Depression in young adolescents: Investigations using 2 and 3 factor versions of the parental bonding instrument

Associations between parenting style and depressive symptomatology in a community sample of young adolescents (N = 2596) were investigated using self-report measures including the Parental Bonding Instrument and the Center for Epidemiologic Studies Depression Scale. Specifically, the 25-item 2-factor and 3-factor models by Parker et al. (1979), Kendler's (1996) 16-item 3-factor model, and Parker's (1983) quadrant model for the Parental Bonding Instrument were compared. Data analysis included analysis of variance and logistic regression. Reanalysis of Parker's original scale indicates that overprotection is composed of separate factors: intrusiveness (at the individual level) and restrictiveness (in the social context). All models reveal significant independent contributions from paternal care, maternal care, and maternal overprotection (2-factor) or intrusiveness (3-factor) to moderate and serious depressive symptomatology, controlling for sex and family living arrangement. Additive rather than multiplicative interactions between care and overprotection were found. Regardless of the level of parental care and affection, clinicians should note that maternal intrusiveness is strongly associated with adverse psychosocial health in young adolescents.

A constant factor approximation algorithm for boxicity of circular arc graphs

Boxicity of a graph G(V, E) is the minimum integer k such that G can be represented as the intersection graph of k-dimensional axis parallel boxes in Rk. Equivalently, it is the minimum number of interval graphs on the vertex set V such that the intersection of their edge sets is E. It is known that boxicity cannot be approximated even for graph classes like bipartite, co-bipartite and split graphs below O(n0.5-ε)-factor, for any ε > 0 in polynomial time unless NP = ZPP. Till date, there is no well known graph class of unbounded boxicity for which even an nε-factor approximation algorithm for computing boxicity is known, for any ε < 1. In this paper, we study the boxicity problem on Circular Arc graphs - intersection graphs of arcs of a circle. We give a (2+ 1/k)-factor polynomial time approximation algorithm for computing the boxicity of any circular arc graph along with a corresponding box representation, where k ≥ 1 is its boxicity. For Normal Circular Arc(NCA) graphs, with an NCA model given, this can be improved to an additive 2-factor approximation algorithm. The time complexity of the algorithms to approximately compute the boxicity is O(mn+n2) in both these cases and in O(mn+kn2) which is at most O(n3) time we also get their corresponding box representations, where n is the number of vertices of the graph and m is its number of edges. The additive 2-factor algorithm directly works for any Proper Circular Arc graph, since computing an NCA model for it can be done in polynomial time.

Evidence for the reliability and validity, but not the practical utility of the two-factor Consideration of Future Consequences Scale-14

Researchers have proposed 1-factor, 2-factor, and bifactor solutions to the 12-item Consideration of Future Consequences Scale (CFCS-12). In order to overcome some measurement problems and to create a robust and conceptually useful two-factor scale the CFCS-12 was recently modified to include two new items and to become the CFCS-14. Using a University sample, we tested four competing models for the CFCS-14: (a) a 12-item unidimensional model, (b) a model fitted for two uncorrelated factors (CFC-Immediate and CFC-Future), (c) a model fitted for two correlated factors (CFC-I and CFC-F), and (d) a bifactor model. Results suggested that the addition of the two new items has strengthened the viability of a two factor solution of the CFCS-14. Results of linear regression models suggest that the CFC-F factor is redundant. Further studies using alcohol and mental health indicators are required to test this redundancy.