نتایج جستجو برای: singularperturbation problems
تعداد نتایج: 583420 فیلتر نتایج به سال:
OBJECTIVE To assess the mechanisms accounting for the transfer of risk from one generation to the next, especially as they relate to maternal adverse childhood experiences and infant physical and emotional health outcomes. STUDY DESIGN Participants were 501 community mother-infant dyads recruited shortly after the birth and followed up at 18 months. Mothers retrospectively reported on their a...
In this paper, we address the selfish bin covering problem, which is greatly related both to the bin covering problem, and to the weighted majority game. What we are mainly concerned with is howmuch the lack of central coordination harms social welfare. Besides the standard PoA and PoS, which are based on Nash equilibrium, we also take into account the strong Nash equilibrium, and several new e...
As evidence-based practice is becoming integrated into children's mental health services as a means of improving outcomes for children and youth with severe behavioral and emotional problems, therapeutic foster care (TFC) which is a specialized treatment program for such youth, is one of few community-based programs considered to be evidence-based. "Together Facing the Challenge" (TFTC) which w...
The article discusses a study involving a framework (range of possible changes [RPC] Model) developed and applied to identify patterns in consistent and inconsistent intervention outcomes effects by informant, measurement method, and method of statistical analysis to the meta-analytic study of trials testing two evidence-based interventions for children and adolescents (youth-focused cognitive-...
The strong isometric dimension and the adjacent isometric dimension of graphs are compared. The concepts are equivalent for graphs of diameter two in which case the problem of determining these dimensions can be reduced to a covering problem with complete bipartite graphs. Using this approach several exact strong and adjacent dimensions are computed (for instance of the Petersen graph) and a po...
Children who exhibit persistently elevated levels of conduct problems (CP) from early childhood, so-called early-starters, are known to be at increased risk for continued CP throughout middle childhood, adolescence, and adulthood. Theoretical and empirical work has focused on this subgroup of children characterized by similar risk factors, an early age of onset, and a persistent developmental c...
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d∗, remove from S the fewest number of points so that the remaining set has doubling dimension at most d∗. We present a bicriteria approximation for this problem, and extend this algorithm to solve a group of proximity problems.
We present a polynomial time algorithm for the unit disk covering problem with an approximation factor 72, and show that this is the best possible approximation factor based on the method used. This is an improvement on the best known approximation factor of 108.
Given a direct sum G of cyclic groups, we find a sharp bound for the minimal number of proper subgroups whose union is G. This generalizes to sums of cyclic modules over more general rings, and we are able to solve this covering problem for all local, Artinian, or Dedekind rings (and even for monoids). We also minimally cover all finitely generated non-cyclic modules over quasi-local rings. The...
The work considers the problem of solving a system of fuzzy relational equations with inf-implication composition and introduces the concepts of a characteristic matrix and attainable components. It is first shown that solving the system is closely related with the covering problem. Further, it is proved that maximal solutions of the system correspond to irredundant coverings of the characteris...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید