Background: Maternal exposure to adversity during the perinatal period has been associated with increased susceptibility for psychiatric symptoms in the offspring. The aim of this study was to investigate a possible d...
详细信息
Background: Maternal exposure to adversity during the perinatal period has been associated with increased susceptibility for psychiatric symptoms in the offspring. The aim of this study was to investigate a possible developmental effect of maternal perinatal stressors on emotional and behavioural symptoms in the offspring in a developing country. Methods: We followed an Ethiopian birth cohort (N = 358), assessing intimate partner violence (IPV) and maternal psychiatric symptoms during the perinatal period and at follow-up 10 years later, as a proxy for adversity, and maternal ratings on the Child Behavior Checklist (CBCL) 10 years later as the outcome. Results: Among the women, exposure to IPV was common (60.6%) during the perinatal period and predicted IPV (29.9% of the mothers) at follow-up (. = 0.132;p = 0.012). There was also an association between maternal psychiatric symptoms at the two time points (. = 0.136;p = 0.010) and between maternal symptoms and IPV. Current maternal symptoms of anxiety and depression (beta = 0.057;p < 0.001), but not during the perinatal period, were associated with child CBCL-scores. Conclusion: Our findings do not support the hypothesis that early adversity increase susceptibility for psychiatric symptoms. However, the findings emphasize the public health problem of IPV in this population, adding to the women's mental health problem.
C++ permits definition of a local class, within a function, method or block rather than in the global space. This feature makes nested functions and closures possible. Returning an object as the result of a function i...
详细信息
C++ permits definition of a local class, within a function, method or block rather than in the global space. This feature makes nested functions and closures possible. Returning an object as the result of a function inevitably involves deep-copying of the object to and from temporaries, which may be expensive for big objects. Lazy construction, a late binding, is a simple and a very useful alternative. In this method, matrices themselves are never returned from functions;a function may however yield a recipe for how to make an object. In a code snippet, the first argument is the title of a test case and the second argument is a test's body itself, specified as an anonymous function, a genuine abstraction.
Folds are appreciated by functional programmers. Their dual, unfolds, are not new, but they are not nearly as well appreciated. We believe they deserve better. To illustrate, we present (indeed, we calculate) a number...
详细信息
Folds are appreciated by functional programmers. Their dual, unfolds, are not new, but they are not nearly as well appreciated. We believe they deserve better. To illustrate, we present (indeed, we calculate) a number of algorithms for computing the breadth-first traversal of a tree. We specify breadth-first traversal in terms of level-order traversal, which we characterize first as a fold. The presentation as a fold is simple, but it is inefficient, and removing the inefficiency makes it no longer a fold. We calculate a characterization as an unfold from the characterization as a fold;this unfold is equally clear, but more efficient. We also calculate a characterization of breadth-first traversal directly as an unfold: this turns out to be the `standard' queue-based algorithm.
In this paper, we show that the operational semantics of a nondeterministic while loop given in previous papers is equal to the denotational one, which is given as the greatest fixed point of a semantic function in th...
详细信息
In this paper, we show that the operational semantics of a nondeterministic while loop given in previous papers is equal to the denotational one, which is given as the greatest fixed point of a semantic function in the demonic semilattice. This will be done by using a nondeterministic programming theorem. This theorem can be considered as a generalization of the while statement verification to nondeterministic loops.
A new approach to formation and organization of the anticipatory data sampling (A-process) in fast local processor memory is analyzed in development of mechanisms directed to achievement of the limitary processors cap...
详细信息
A new approach to formation and organization of the anticipatory data sampling (A-process) in fast local processor memory is analyzed in development of mechanisms directed to achievement of the limitary processors capacity. The approach is based on the principle of A-process conveyerization ″from above″, analysis results of programs on the standard languages of high-level as well as the principle of A-process ″intellectualization″. The A-processes formed on the base of A-analysis provide essential reduction (tenths of percents) of data processing time in the central processor.
Parametrization of some large-scale discrete programming problems is considered. Parameters characterizing these problems are found. Ranges of the parameters are studied depending on the time available for solving the...
详细信息
Parametrization of some large-scale discrete programming problems is considered. Parameters characterizing these problems are found. Ranges of the parameters are studied depending on the time available for solving the problem. Results of experimental investigation of the traveling salesman problem and of the knapsack problem are presented.
We show how to reduce the time overhead for backing up in a singly linked list to O(nΕ) per operation for any Ε>0 without modifying the list and without making use of storage other than a finite number of pointer...
详细信息
We show how to reduce the time overhead for backing up in a singly linked list to O(nΕ) per operation for any Ε>0 without modifying the list and without making use of storage other than a finite number of pointers into the list. We also prove a matching lower bound. Our results add precision to the intuitive feeling that doubly linked lists are more efficient than singly linked lists, and quantify the efficiency gap in a read-only situation. As an application, our upper bound implies that read-only programs can do string matching much faster than previously expected.
The growth of manufacturing control software from simple NC and PLC-based systems to concurrent networked systems incorporating PC's, PLC's, CNC's, and enterprise databases has created new challenges to th...
详细信息
The growth of manufacturing control software from simple NC and PLC-based systems to concurrent networked systems incorporating PC's, PLC's, CNC's, and enterprise databases has created new challenges to the design, implementation, and maintenance of safe and dependable manufacturing systems. Key milestones in this evolution, and the prospects for the use of formal verification methods in achieving enhanced dependability of future manufacturing software, are examined in this paper and presentation.
We present a tool, outward rotations, for enhancing the performance of several semidefinite programming based approximation algorithms. Using outward rotations, we obtain an approximation algorithm for MAX CUT that, i...
详细信息
We present a tool, outward rotations, for enhancing the performance of several semidefinite programming based approximation algorithms. Using outward rotations, we obtain an approximation algorithm for MAX CUT that, in many interesting cases, performs better than the algorithm of Goemans and Williamson. We also obtain an improved approximation algorithm for MAX NAE-{3}-SAT. Finally, we provide some evidence that outward rotations can also be used to obtain improved approximation algorithms for MAX NAE-SAT and MAX SAT.
There are found approximability criterion of abstract program semantics in regard to functional program equivalence in the theoretical-set terms and obtained the main properties of semantics approximability ratio. The...
详细信息
There are found approximability criterion of abstract program semantics in regard to functional program equivalence in the theoretical-set terms and obtained the main properties of semantics approximability ratio. The made comparative analysis of abstract semantics of sequential programs is based essentially on the conception of a formal program model. As a matter of fact, formal program model semantics play the same role in respect to variety of abstract semantics of sequential operator programs as the Erbran interpretations in regard to all possible interpretations of positive logic programs. Therefore in the study of functional properties of sequential programs it is expediently to choose the generalized formal program models as a common semantic base analogically as in logic programming the declarative semantic foundations are Erbran interpretations.
暂无评论