نتایج جستجو برای: singularperturbation problems

تعداد نتایج: 583420  

2013
Priyanka Sharma Nisha Saini

Adjustment is one of the most important psychological activities of human being. Life is a process of adjustment. If anyone wants satisfaction in life, then one has to adjust with their environment. The present study was conducted on the students of two collegesone urban and one rural of Jammu region. The main objective of the study was to identify the adjustment problems among college going st...

Journal: :CoRR 2015
Yura Maximov

In this paper we prowide lower bounds on the complexity of the DNF exception problem for short exception lists and hypercube covering problem. The method proposed is based on the relaxation of the initial problem to a certain linear programming problem. Some explicit bounds are provided for the case when exception list size is bounded above by a logarithm of dimension. The bound provided in thi...

2017
Langelihle Mlotshwa Lenore Manderson Sonja Merten

BACKGROUND Pregnancy is life changing, making great demands on women to adapt physically, psychologically, and socially. Social relationships and the support that flow from these provide a critical role in managing health problems in pregnancy. Isolation and lack of care, in contrast, may lead women to experience increased distress during this time. OBJECTIVE This study aimed to explore South...

Journal: :Math. Program. 2006
Daniel Bienstock Mark Zuckerberg

Consider a 0/1 integer program min{c T x : Ax ≥ b, x ∈ {0, 1} n } where A is nonnegative. We show that if the number of minimal covers of Ax ≥ b is polynomially bounded, then there is a polynomially large lift-and-project relaxation whose value is arbitrarily close to being at least as good as that given by the rank ≤ q cuts, for any fixed q. A special case of this result is that given by set-c...

Journal: :Developmental psychology 2008
Sylvana M Côté Anne I Borge Marie-Claude Geoffroy Michael Rutter Richard E Tremblay

The authors examined the role of familial risk and child characteristics in the association between the type of child care in infancy (maternal care [MC]) versus nonmaternal care [NMC]) and emotional/behavioral difficulties at 4 years old. Canadian families (N=1,358) with children between 1 and 12 months old were followed over 4 years. Family risks were found to moderate the association between...

2016
Peyman Afshani Edvin Berglin Ingo van Duijn Jesper Sindahl Nielsen

In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using curves with d degrees of freedom. Another generalization is the Hyperplane Cover problem where points in d-dimensional space are to be covered by hyperplanes. Al...

2012
Robert Crowston Gregory Gutin Mark Jones Saket Saurabh Anders Yeo

In this paper we carry out a systematic study of a natural covering problem, used for identification across several areas, in the realm of parameterized complexity. In the Test Cover problem we are given a set [n] = {1,. .. , n} of items together with a collection, T , of distinct subsets of these items called tests. We assume that T is a test cover, i.e., for each pair of items there is a test...

2013
Jeffrey Roelofs Linda Onckels Peter Muris

This study investigated relationships between attachment insecurity, maladaptive cognitive schemas, and various types of psychopathological symptoms in a sample of clinically referred adolescents (N = 82). A mediation model was tested in which maladaptive schemas operated as mediators in the relations between indices of attachment quality and conduct, peer, and emotional problems. Results revea...

Journal: :Pattern Recognition 2011
Jorge López Lázaro Álvaro Barbero Jiménez José R. Dorronsoro

The nearest point problem (NPP), i.e., finding the closest points between two disjoint convex hulls, has two classical solutions, the Gilbert–Schlesinger–Kozinec (GSK) and Mitchell–Dem’yanov–Malozemov (MDM) algorithms. When the convex hulls do intersect, NPP has to be stated in terms of reduced convex hulls (RCHs), made up of convex pattern combinations whose coefficients are bound by a mo1 val...

2011
Thomas Ehring Ulrike Zetsche Kathrin Weidacker Karina Wahl Sabine Schönfeld Anke Ehlers

Repetitive negative thinking (RNT) has been found to be involved in the maintenance of several types of emotional problems and has therefore been suggested to be a transdiagnostic process. However, existing measures of RNT typically focus on a particular disorder-specific content. In this article, the preliminary validation of a content-independent self-report questionnaire of RNT is presented....

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید