Mothers' mental illness and child behavior problems: Cause-effect association or observation bias

Objective: A number, of studies have consistently found that a mother's mental health (particularly her level of depression) is a strong predictor of mental health problems experienced by her child(ren). However, the validity of this finding is in doubt because the majority of these studies have relied on maternal reports as indicators of children's behavior. Method: This prospective, longitudinal study examines data an the mental health of the mother from prior to the birth of her child to when the child reaches 14 years of age. Child behavior is measured at 14 years of age using reports from mother and child. Mother and child responses are compared to provide an indication of the possible magnitude of maternal observation bias in the reporting of child behavior problems. Results: Anxious and/or depressed mothers tend to report more cases of child behavior problems than do their mentally healthy counterparts or children themselves. Differences between mothers and youths In reporting behavior problems appear to be related to the mothers' mental health. Conclusions: Current maternal mental health impairment appears to have a substantial effect on the reporting of child behavior problems by the mother, thereby raising questions about the validity of reports of child behavior by persons who are currently emotionally distressed.

Maximum packings of K-v-K-u with triples

We construct, for all positive integers u, and v with u less than or equal to v, a decomposition of K-v - K-u (the complete graph on v vertices with a. hole of size u) into the maximum possible number of edge disjoint triangles.

Ni-II and Zn-II complexes of the hexadentate macrocyclic ligand cis-6,13-dimethyl-1,4,8,11-tetraazacyclotetra- decane-6,13-diamine

The title pendent-arm macrocyclic hexaamine ligand binds stereospecifically in a hexadentate manner, and we report here its isomorphous Ni-II and Zn-II complexes (both as perchlorate salts), namely (cis-6,13-dimethyl-1,4,8,11-tetraazacyclotetradecane-6,13-diamine-kappa(6)N)nickel(II) diperchlorate, [Ni(C12H30N6)](ClO4)(2), and (cis-6,13-dimethyl-1,4,8,11-tetraazacyclotetradecane-6,13-diamine-kappa(6)N)zinc(II) diperchlorate, [Zn(C-12 H30N6)](ClO4)(2). Distortion of the N-M-N valence angles from their ideal octahedral values becomes more pronounced with increasing metal-ion size and the present results are compared with other structures of this ligand.

Decompositions of complete multipartite graphs into cycles of even length

Necessary and sufficient conditions for the existence of an edge-disjoint decomposition of any complete multipartite graph into even length cycles are investigated. Necessary conditions are listed and sufficiency is shown for the cases when the cycle length is 4, 6 or 8. Further results concerning sufficiency, provided certain small decompositions exist, are also given for arbitrary even cycle lengths.

A family of perfect factorisations of complete bipartite graphs

A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cycle. Let n = p(2) for an odd prime p. We construct a family of (p-1)/2 non-isomorphic perfect 1-factorisations of K-n,K-n. Equivalently, we construct pan-Hamiltonian Latin squares of order n. A Latin square is pan-Hamiltoilian if the permutation defined by any row relative to any other row is a single Cycle. (C) 2002 Elsevier Science (USA).

C4-saturated bipartite graphs

Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgraph of K with the property that for any edge e is an element of E(K)\E(G), G boolean OR {e} is not H-free. We present some general results on K-s,K-t-saturated subgraphs of the complete bipartite graph K-m,K-n and study the problem of finding, for all possible values of q, a C-4-saturated subgraph of K., having precisely q edges. (C) 2002 Elsevier Science B.V. All rights reserved.

Nominal versus indexed debt: A quantitative horse race

The main arguments in favor and against nominal and indexed debts are the incentive to default through inflation versus hedging against unforeseen shocks. We model and calibrate these arguments to assess their quantitative importance. We use a dynamic equilibrium model with tax distortion, government outlays uncertainty, and contingent-debt service. Our framework also recognizes that contingent debt can be associated with incentive problems and lack of commitment. Thus, the benefits of unexpected inflation are tempered by higher interest rates. We obtain that costs from inflation more than offset the benefits from reducing tax distortions. We further discuss sustainability of nominal debt in developing (volatile) countries. (C) 2010 Elsevier Ltd. All rights reserved.

A comparative study of similarity measures for manufacturing cell formation

We introduced a spectral clustering algorithm based on the bipartite graph model for the Manufacturing Cell Formation problem in [Oliveira S, Ribeiro JFF, Seok SC. A spectral clustering algorithm for manufacturing cell formation. Computers and Industrial Engineering. 2007 [submitted for publication]]. It constructs two similarity matrices; one for parts and one for machines. The algorithm executes a spectral clustering algorithm on each separately to find families of parts and cells of machines. The similarity measure in the approach utilized limited information between parts and between machines. This paper reviews several well-known similarity measures which have been used for Group Technology. Computational clustering results are compared by various performance measures. (C) 2008 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.

A spectral clustering algorithm for manufacturing cell formation

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.

Trade spectrum of K4-e

A K-4 - e trade consists of two disjoint decompositions of some simple graph H into copies of K-4 - e. The number of vertices of H is referred to as the foundation of the trade, while the number of copies of K-4 - e in each of the decompositions is called the volume of the trade. We determine the values of v and s for which there exists a K-4 - e trade of volume s and foundation v.

A family of perfect hashing methods

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the one with minimum constants. Members of the family generate a hash function in two steps. First a special kind of function into an r-graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions.

On the spectrum for K_{m+2}/K_m designs

The spectrum problem for the decomposition of K-n into copies of the graph K_{m+2}\K_m is solved for n = 0 or 1 (mod 2m + 1). (C) 1997 John Wiley & Sons, Inc.

On the structure, electrochemistry, and spectroscopy of the (N,N'-bis(2'-(dimethylamino)ethyl)-N,N'-dimethylpropane-1,3-diamine)copper(II) ion

The synthesis, spectroscopy, and electrochemistry of the acyclic tertiary tetraamine copper(II) complex [CuL(1)](ClO4)(2) (L(1) = N,N-bis(2'-(dimethylamino)ethyl)-N,N'-dimethylpropane-1,3-diamine) is reported. The X-ray crystal structure of [CuL(1)(OClO3)(2)] reveals a tetragonally elongated CuN4O2 coordination sphere, exhibiting relatively long Cu-N bond lengths for a Cu-II tetraamine, and a small tetrahedral distortion of the CuN4 plane. The [CuL(1)](2+) ion displays a single, reversible, one-electron reduction at -0.06 V vs Ag/AgCl. The results presented herein illustrate the inherent difficulties associated with the separation and characterization of Cu-II complexes of tertiary tetraamines, and some previously incorrect assertions and unexplained observations of other workers are discussed.

The intersection problem for K_4-e designs

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph K-n and B is an edge-disjoint decomposition of K-n into copies of the simple graph G. Following design terminology, we call these copies ''blocks''. Here K-4 - e denotes the complete graph K-4 with one edge removed. It is well-known that a K-4 - e design of order n exists if and only if n = 0 or 1 (mod 5), n greater than or equal to 6. The intersection problem here asks for which k is it possible to find two K-4 - e designs (P,B-1) and (P,B-2) of order n, with \B-1 boolean AND B-2\ = k, that is, with precisely k common blocks. Here we completely solve this intersection problem for K-4 - e designs.

Modelling of cold-formed purlin-sheeting systems .1. Full model

Purlin-sheeting systems used for roofs and walls commonly take the form of cold-formed channel or zed section purlins, screw-connected to corrugated sheeting. These purlin-sheeting systems have been the subject of numerous theoretical and experimental investigations over the past three decades, but the complexity of the systems has led to great difficulty in developing a sound and general model. This paper presents a non-linear elasto-plastic finite element model, capable of predicting the behaviour of purlin-sheeting systems without the need for either experimental input or over simplifying assumptions. The model incorporates both the sheeting and the purlin, and is able to account for cross-sectional distortion of the purlin, the flexural and membrane restraining effects of the sheeting, and failure of the purlin by local buckling or yielding. The validity of the model is shown by its good correlation with experimental results. A simplified version of this model, which is more suitable for use in a design environment, is presented in a companion paper. (C) 1997 Elsevier Science Ltd.