Little is known about the association between empathic and prosocial tendencies (caring) and internalizing psychopathology in young children. Associations between caring and internalizing problems (INT) were examined in young children (N = 63). Children’s caring was measured using a developmentally appropriate story narrative task about mothers in distress; narratives were rated for themes of caring. No general associations between caring and INT were found. A marginally significant, negative quadratic relation between themes of empathy and INT was found in boys (low levels of INT were related to both high and low levels of empathy). Children’s concern reactions were marginally, negatively associated with INT in children of nondepressed mothers. Overall, findings indicate that associations between caring and INT in preschool-aged children are present only under specific conditions, highlighting the importance of gender and maternal psychopathology in elucidating the role of caring in complicated risk cascades that may result in INT .

No description available.

This paper presents a novel MEMS based DNA computer for solving SAT problems. No time-consuming sample preparation procedures and delicate sample applying equipment were required for the computing process. Moreover, experimental results show the bound DNA sequences can sustain the chemical solutions during computing processes such that the proposed method shall be useful in dealing with large scale problems. An algorithm based on a modified sticker model accompanied with a state-of-the-art MEMS-based microarray experiment is demonstrated to solve SAT problem which has long served as a benchmark in DNA computing. Unlike conventional DNA computing algorithms need an initial data pool to cover all correct and incorrect answers and further execute a series of separation procedures to destroy the unwanted ones, we built solutions in parts to satisfy one clause in one step, and eventually solve the entire Boolean formula through steps. Accordingly this algorithm greatly reduces the formation of unnecessary candidate solutions and shall be very practical as problem size grows. In this study, a novel MEMS-based technology including utilizing blank mask as the microarray substrate to prevent the self-fluorescent effect, a twin-mask back-side exposure process to improve the computing speed and a low-temperature backing process to prevent DNA damage during computing procedure. In addition, the minimal time requirement for DNA hybridization was also evaluated experimentally. The paper reports a novel computing method for solving SAT problem utilizing a state-of-art MEMS-based microarray. The advantage of this method is as the problem size scales up, it only needs to linearly increase the variety of sequences standing for variables and augment the array size. Therefore, while solving a complicated SAT problem, the numbers of DNA sample and the time for the computing process can be dramatically reduced with this approach.

In this dissertation, we consider modified inexact Newton methods applied to second order nonlinear problems. In the implementation of Newton's method applied to problems with a large number of degrees of freedom, it is often necessary to solve the linear Jacobian system iteratively. Although a general theory for the convergence of modified inexact Newton's methods has been developed, its application to nonlinear problems from nonlinear PDE's is far from complete. The case where the nonlinear operator is a zeroth order perturbation of a fixed linear operator was considered in the paper written by Brown et al.. The goal of this dissertation is to show that one can develop modified inexact Newton's methods which converge at a rate independent of the number of unknowns for problems with higher order nonlinearities. To do this, we are required to first, set up the problem on a scale of Hilbert spaces, and second, to devise a special iterative technique which converges in a higher order Sobolev norm, i.e., H1+alpha(omega) \ H1 0(omega) with 0 < alpha < 1/2. We show that the linear system solved in Newton's method can be replaced with one iterative step provided that the initial iterate is close enough. The closeness criteria can be taken independent of the mesh size. In addition, we have the same convergence rates of the method in the norm of H1 0(omega) using the discrete Sobolev inequalities.

Thesis (Ph.D.)--University of Delaware, 2009. / Principal faculty advisor: Joel Best, Dept. of Sociology & Criminal Justice. Includes bibliographical references.

Thesis (Ph. D.) in Psychology--University of Maine, 2003. / Includes vita. Includes bibliographical references (leaves 132-155).

Thesis (M.S. in C.S.)--College of Computing, Georgia Institute of Technology, 2004. Directed by Santosh Pande. / Includes bibliographical references (leaves 73-74).

Thesis (Ph.D.)--City University of Hong Kong, 2009. / "Submitted to Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy." Includes bibliographical references (leaves [95]-100)

Inaug.-Diss.--Greifswald. / Lebenslauf. Includes bibliographical references.

Thesis (D. Min.)--Erskine Theological Seminary, 2000. / Abstract. Includes bibliographical references (leaves 157-172).