The development of conduct problems in childhood and adolescence is associated with adverse long-term outcomes, including psychiatric morbidity. Although genes constitute a proven factor of stability in conduct problems, less is known regarding their role in conduct problems' developmental course (i.e. systematic age changes, for instance linear increases or decreases).Mothers rated conduct pro...

The interest in collaborative logistics is fuelled by the ever increasing pressure on companies to operate more efficiently, the realization that suppliers, consumers, and even competitors, can be potential collaborative partners in logistics, and the connectivity provided by the Internet. Logistics exchanges or collaborative logistics networks use the Internet as a common computing platform to...

In this paper we identify various inaccuracies in the paper by R. R. Saxena and S. R. Arora, A Linearization technique for solving the Quadratic Set Covering Problem, Optimization, 39 (1997) 33-42. In particular, we observe that their algorithm does not guarantee optimality, contrary to what is claimed. Experimental analysis has been carried out to assess the value of this algorithm as a heuris...

OBJECTIVES To investigate the association between learning difficulties (LDs) and behavioural and emotional problems of 8-year-old children in the Northern Finland Birth Cohort 1986 (n=9432). STUDY DESIGN A cross-sectional study. METHODS Teachers assessed children's behaviour with a Rutter scale (RB2) and assessed their learning with questions about whether a child had difficulties in readi...

We present a new Lagrangian-based heuristic for solving large-scale set-covering problems arising from crew-scheduling at the Italian Railways (Ferrovie dello Stato). Our heuristic obtained impressive results when compared to state of the art codes on a test-bed provided by the company, which includes instances with sizes ranging from 50,000 variables and 500 constraints to 1,000,000 variables ...

We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this problem can be reduced to the covering problem for the unit simplex. Such setting yields precise asymptotic characterization in the high-rate regime. Our main contribution is a simple and asymptotically optimal algorithm fo...

This paper investigates the semi-online machine covering problems on m ≥ 3 parallel identical machines. Three different semi-online versions are studied and optimal algorithms are proposed. We prove that if the total processing time of all jobs or the largest processing time of all jobs is known in advance, the competitive ratios of the optimal algorithms are both m − 1. If the total processing...

The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)(log log n)) deterministic time 2.8334-approximation algorithm for this problem. Previous approximation algorithms [7, 3, 6], when used to achieve the same approximation ratio for the disc covering problem, will have much higher time complexity than our algorithms.

A modification of Kuethe's method for investigating social schemata in which 5s place magnets representing "mother," "father," and significant others on a board in relation to a centrally placed "self" magnet was administered along with the MMPI to 30 recently admitted female psychiatric patients. Distance between self and mother magnets was correlated with increased schizophrenia (Sc) and decr...

To level up the application of wireless sensor network in cotton field soil monitoring, wireless sensor network technology has been studied deeply. Some difficulties, including the design of soil moisture sensor, covering problem in wireless sensor network and diagnosis algorithm for wireless sensor networks and node, are been proposed and discussed. Combined with cotton field soil moisture mon...