Psychoanalytic Psychology: Editorial.

Notes that, with this issue, the journal Psychoanalytic Psychology begins its 20th year of publication. The journal's editor discusses new features for 2003, and the unique contributions of the journal as the second largest psychoanalytic journal published in the US. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Analytical results for the plectonemic response of supercoiled DNA

The DNA molecule is modeled as an elastic rod with bending and twisting rigidities, subjected to external tension and twist applied at one end, the other end being clamped. We study the plectonemic equilibrium of such a rod, taking into account the impenetrability constraint. Numerical solutions of this boundary value problem have previously shown that purely elastic models can reproduce the supercoiling response of the DNA molecule. Using a variational approach, we derive analytical formulae for the elastic response of the filament, and extend former numerical results.     

Examining a dimensional representation of depression and anxiety disorders' comorbidity in psychiatric outpatients with item response modeling.

The current study replicated, in a sample of 2,300 outpatients seeking psychiatric treatment, a previous study (R. F. Krueger & M. S. Finger, 2001) that implemented an item response theory approach for modeling the comorbidity of common mood and anxiety disorders as indicators along the continuum of a shared latent factor (internalizing). The 5 disorders examined were major depressive disorder, social phobia, panic disorder/agoraphobia, specific phobia, and generalized anxiety disorder. The findings were consistent with the prior research. First, a confirmatory factor analysis yielded sufficient evidence for a nonspecific factor underlying the 5 diagnostic indicators. Second, a 2-parameter logistic item response model showed that the diagnoses were represented in the upper half of the internalizing continuum, and each was a strongly discriminating indicator of the factor. Third, the internalizing factor was significantly associated with 3 indexes of social burden: poorer social functioning, time missed from work, and lifetime hospitalizations. Rather than the categorical system of presumably discrete disorders presented in DSM-IV, these 5 mood and anxiety disorders may be alternatively viewed as higher end indicators of a common factor associated with social cost. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Grand theories of personality cannot be integrated.

Comments on the original article "A New Big Five: Fundamental Principles for an Integrative Science of Personality," by Dan P. McAdams and Jennifer L. Pals (see record 2006-03947-002). McAdams and Pals (April 2006) presented a new model to integrate the field of personality psychology. Cultural and evolutionary factors interact with an individual's basic traits, characteristic adaptations, and life narratives, which in turn are linked to roles, demands, and behaviors. The current authors welcome McAdams and Pals's (2006) model for providing a way to integrate much of the previously disparate empirical findings in personality psychology. However, the current authors also think that McAdams and Pals (2006) overstated the inclusiveness of the model, and more generally, the current authors dispute their assertion that the grand theories of personality can be integrated within a single model. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Algorithms in the W-Hierarchy

We show new upper bounds for problems in the W-hierarchy of fixed-parameter complexity. A crucial ingredient of our proofs is an extension to the W-RAM model, which permits more-powerful operations but remains equivalent to the original. We use the extended model to give new upper bounds for Subsetsum, Maximum Irredundant Set, and various problems concerning intersection of finite-state machines.     

Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers

A finite recurrent system over sets of natural numbers of dimension n is a pair composed of n n-ary functions over sets of natural numbers and an n-tuple of singleton sets of natural numbers. Every function is applied to the entries of the tuple and computes a set of natural numbers, that may also be empty. The results are composed into another tuple, and the process is started anew. Thus, a finite recurrent system defines an infinite sequence of n-tuples containing sets of natural numbers. The last entry of a generated n-tuple is called the output of a step, and the union of the output sets of all steps is the set defined by the finite recurrent system. Membership problems ask whether a given number is in a specified output set or in some output set. We study membership problems for special finite recurrent systems, whose functions are built from the set operations union, intersection and complementation and the arithmetical operations addition and multiplication. Sum and product of two sets of natural numbers are defined elementwise. We restrict the set of operations from which functions are built and determine the impact on the complexity of the membership problems. We focus on PSPACE-decidable membership problems and show completeness results for the complexity classes NL, NP and PSPACE.     

Dynamic Complexity Theory Revisited

Dynamic complexity investigates the required effort to maintain knowledge about a property of a structure under changing operations. This article introduces a refined notion of dynamic problems which takes the initial structure into account. It develops the basic structural complexity notions accordingly. It also shows that the dynamic version of the LOGCFL-complete problem D₂LREACH(acyclic) can be maintained with first-order updates.     

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism.