Refinements in validity generalization methods: Implications for the situational specificity hypothesis.

Using a large database, this study examined 3 refinements of validity generalization procedures: (1) a more accurate procedure for correcting the residual standard deviation (SD) for range restriction to estimate SDp, (2) use of r? instead of study-observed rs in the formula for sampling error variance, and (3) removal of non-Pearson rs. The 1st procedure does not affect the amount of variance accounted for by artifacts. The addition of the 2nd and 3rd procedures increased the mean percentage of validity variance accounted for by artifacts from 70 to 82%, a 17% increase. The cumulative addition of all 3 procedures decreased the mean SDp estimate from .150 to .106, a 29% decrease. Six additional variance-producing artifacts were identified that could not be corrected for. In light of these it was concluded that the obtained estimates of mean SDp and mean validity variance accounted for were consistent with the hypothesis that the true mean SDp value is close to zero. These findings provide further evidence against the situational specificity hypothesis. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

The generation effect is no artifact: Generating makes words distinctive.

The generation effect occurs if people remember items they complete from fragments better than complete items they read. Four experiments investigate two questions. When does the effect occur, and why does it do so? Targets generated in related contexts are recognized better than read targets, and they are recalled better with the contexts as cues; the contexts are recognized equally well, and the relation between the context and target is not enhanced by generation. Furthermore, generated items exceed items read in pure lists even when read ones from the mixed list are no worse than the controls. The generation effect is real; it is not an artifact. However, there is nothing special about generation. Generating is a type of encoding, and like any other type of encoding, its effects are maximal on tests that require subjects to do again whatever they did at study. Generating makes targets distinctive by contrasting them with other relatives of the context, and, as a result, the targets enjoy benefits in later discriminations within their family. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Minimum spanning trees made easier via multi-objective optimization

Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate the Pareto front, multi-objective optimization problems are considered as more difficult than single-objective problems. One should not forget that the fitness vector with respect to more than one objective contains more information that in principle can direct the search of evolutionary algorithms. Therefore, it is possible that a single-objective problem can be solved more efficiently via a generalized multi-objective model of the problem. That this is indeed the case is proved by investigating the computation of minimum spanning trees.This work was supported by the Deutsche Forschungsgemeinschaft (DFG) as part of the Collaborative Research Center Computational Intelligence (SFB 531) and by the German-Israeli Foundation (GIF) in the project Robustness Aspects of Algorithms.     

The Role of Acceptance and Job Control in Mental Health, Job Satisfaction, and Work Performance.

Acceptance, the willingness to experience thoughts, feelings, and physiological sensations without having to control them or let them determine one's actions, is a major individual determinant of mental health and behavioral effectiveness in a more recent theory of psychopathology. This 2-wave panel study examined the ability of acceptance also to explain mental health, job satisfaction, and performance in the work domain. The authors hypothesized that acceptance would predict these 3 outcomes 1 year later in a sample of customer service center workers in the United Kingdom (N = 412). Results indicated that acceptance predicted mental health and an objective measure of performance over and above job control, negative affectivity, and locus of control. These beneficial effects of having more job control were enhanced when people had higher levels of acceptance. The authors discuss the theoretical and practical relevance of this individual characteristic to occupational health and performance. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Periodic dynamics of coupled cell networks I: rigid patterns of synchrony and phase relations

It has recently been proved by Golubitsky and coworkers that in any network of coupled dynamical systems, the possible 'rigid' patterns of synchrony of hyperbolic equilibria are determined by purely combinatorial properties of the network, known as 'balanced equivalence relations'. A pattern is 'rigid' if it persists under small 'admissible' perturbations of the differential equation — ones that respect the network structure. We discuss a natural generalisation of these ideas to time-periodic states, and motivate two basic conjectures, the Rigid Synchrony Conjecture and the Rigid Phase Conjecture. These conjectures state that for rigid hyperbolic time-periodic patterns, cells with synchronous dynamics must have synchronous input cells, and cells with phase-related dynamics must have input cells that have the same phase relations. We provide evidence supporting the two conjectures, by proving them for a special class of periodic orbits, which we call 'tame', under strong assumptions on the network architecture and the symmetries of the periodic state. The discussion takes place in the formal setting of coupled cell networks. We prove that rigid patterns of synchrony are balanced, together with the analogous result for rigid patterns of phase relations. The assumption on the network architecture simplifies the geometry of admissible vector fields, while tameness rules out patterns with non-trivial local or multilocal symmetry. The main idea is to perturb an admissible vector field in a way that retains sufficient control over the associated perturbed periodic orbit. We present two techniques for constructing these perturbations, both using a general theorem on groupoid-symmetrisation of vector fields, which has independent interest. In particular we introduce a method of 'patching' that makes local changes to an admissible vector field. Having established these results for all-to-all coupled networks and tame periodic orbits we prove more general versions that require these assumptions only on a suitable quotient network. These conditions are weaker and encompass a larger class of networks and periodic orbits. We give an example to show that rigidity cannot be relaxed to hyperbolicity. We also prove, without any technical assumptions, that rigidly synchronous or phase-related cells must be input-isomorphic, a necessary precondition for the two conjectures to hold.     

Criteria to disprove context freeness of collage languages

Collage grammars are context-free devices which generate picture languages consisting of collages—sets of parts, where a part is a set of points in a given space. In order to show that certain collage languages cannot be generated, the well-known pumping technique turns out to be rather useless. To circumvent this difficulty, other necessary criteria for context-freeness are established in this paper. Roughly speaking, these criteria reveal that (1) the collages in a context-free collage language can be deflated stepwise in such a manner that the difference between subsequent collages in the resulting chain is small and (2) the volume of parts can grow or shrink only exponentially.