- Full text PDF available (7)
Heart rate variability biofeedback intervention involves slow breathing at a rate of ∼6 breaths/min (resonance breathing) to maximize respiratory and baroreflex effects on heart period oscillations. This intervention has wide-ranging clinical benefits and is gaining empirical support as an adjunct therapy for biobehavioral disorders, including asthma and… (More)
Agent-based modeling (ABM) constitutes a powerful computational tool for the exploration of phenomena involving emergent dynamic behavior in the social sciences. This paper demonstrates a computer-assisted approach that bridges the significant gap between the single-agent microscopic level and the macroscopic (coarse-grained population) level, where… (More)
The dynamic version of the minimum cost multicommodity flow problem that generalizes the static minimum cost multicom-modity flow problem is formulated and studied. This dynamic problem is considered on directed networks with a set of commodities , time-varying capacities, fixed transit times on arcs, and a given time horizon. We assume that cost functions,… (More)
The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon. The corresponding algorithm to solve this problem is proposed and some details concerning its complexity are discussed.
A graph G is called F-saturated if it is F-free but the addition of any missing edge to G creates a copy of F. Let the saturation function sat(n, F) be the minimum number of edges that an F-saturated graph on n vertices can have. We determine this function asymptotically for every fixed complete partite graph F as n tends to infinity and give some… (More)
In this paper we study two basic problems related to dynamic flows: maximum multicommodity flow and the minimum cost multicommodity flow problems. We consider these problems on dynamic networks with time-varying capacities of edges. For minimum cost multicommodity flow problem we assume that cost functions, defined on edges, are nonlinear and depending on… (More)
The game-theoretic formulation of the multiobjective multi-commodity flow problem is considered. The dynamic version of this problem is studied and an algorithm for its solving, based on the concept of multiobjective games, is proposed.