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)     

Burner Performance Evaluation Using Test Code

Development of new burner technology is common practice nowadays. Standardized test codes are available to conduct tests to determine operating characteristics and thermal performance of different parts of steam generating units. This paper describes the results of testing performed to evaluate thermal efficiency of a 74.5?kW fire-tube steam generator fired with a new premixed flame burner in comparison to a typical standard-retrofit diffusion flame burner system. Two premixed flame burners sized at 7.6 and 10.1?cm were tested. Testing was performed in accordance with the ASME PTC 4.1 Power Test Code. The evaluation was conducted in the range of small- to mid-sized, natural gas-fired applications, from 1.06?to?2.64×106?kJ/h. The environmental nitrogen oxide (NOx) emissions performance was also compared for both burner technologies. The results of this evaluation indicate that firing the test boiler with the 7.6?cm new burner slightly improves unit thermal efficiency by 4.0–3.3% for a unit load ranging from approximately 1.06?to?1.79×106?kJ/h, respectively. Operation with the 10.1?cm new burner improves the thermal efficiency by approximately 1.6% at 2.32×106?kJ/h. The uncertainty in the measurements used in the efficiency calculations should account for approximately ±1.5% uncertainty in the reported gross efficiency. Reductions in NOx emissions of the order of 10% resulted from operation with the new premixed flame burners.     

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.     

The Computational Complexity of One-Dimensional Sandpiles

We prove that the one-dimensional sandpile prediction problem is in LOGDCFL, a subset of AC¹. The previously best known upper bound on the ACⁱ-scale was AC². Furthermore, we prove that the one-dimensional sandpile prediction problem is hard for TC⁰ and thus not in AC^1-ε for any constant ε > 0.     

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.     

CODIRO: A New System for Obtaining Data Concerning Consumer Behavior Based on Data Factors of High Interest Determined by the Analyst

The aim of this paper is to propose a new system for the strategic use of customer data that includes and integrates such differing data sources as company databases, mobile telephone networks and Internet data and is a consumer research support system for the discovery of new marketing opportunities. This system, called CODIRO, will be discussed in this paper using a case study of the effects on sales of processed food product television commercials. A system for verifying the validity of consumer behavior models will also be described and discussed. Use of the CODIRO analysis system makes it easy to introduce, into the analytic model, consumer attitude changes and in-store data of many types that have not been used to measure advertising and promotional activity effectiveness in the past.