New Tractable Classes From Old

The constraint satisfaction problem is known to be NP-hard in general, but a number of restrictions of the problem have been identified over the years which ensure tractability. This paper introduces two simple methods of combining two or more tractable classes over disjoint domains, in order to synthesise larger, more expressive tractable classes. We demonstrate that the classes so obtained are genuinely novel, and have not been previously identified. In addition, we use algebraic techniques to extend the tractable classes which we identify, and to show that the algorithms for solving these extended classes can be less than obvious.     

The warehouse scheduling problem: formulation and algorithms

The Warehouse Scheduling Problem is a deterministic multi-item inventory problem with a restriction on warehouse floor space available. We formulate a mixed integer nonlinear programming problem for the objective of minimizing long run inventory holding and order costs per unit of time. We integrate algorithms for staggering orders, described in companion papers, with a heuristic to choose the order sequences. The result is called Sequenced Staggering. We describe a new algorithm to generate order frequencies, called the powers-of-two-factor-of-three technique, as a generalization of Roundy's roundoff technique for powers-of-two policies. We report on a computational study of four hybrid algorithms for solving the warehouse scheduling problem, including the competing algorithm of Gallego, Queyranne, and Simchi-Levi. Based on these results, we recommend the combination of powers-of-two frequencies with Sequenced Staggering.     

Categorical scaling of time: Implications for clock-counter models.

Pigeons partitioned time into three intervals. Responses to one key could be reinforced after a short time, to a second key after an intermediate time, and to a third key after a long time. The values of the short, intermediate, and long times and the proportion of trials ending with reinforcement were varied. Absolute and relative response rates on each key were an orderly function of time and showed approximately proportional changes with changes in the interval values, consistent with Weber's law, Gibbon's (1977) scalar expectancy theory, and Killeen and Fetterman's (1988) behavioral theory of timing (BeT). Standard deviations of the times at which subjects switched between successive keys increased more slowly within a condition than across conditions, as predicted by BeT. Increases and decreases in reinforcement probability produced both transient and longer lasting changes in timing behavior, once again, in accord with predictions of BeT. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

"Adolescent psychopathology: I. Prevalence and incidence of depression and other DSM-III—R disorders in high school students": Correction.

Reports an error in the original article by P. M. Lewinsohn et al ( Journal of Abnormal Psychology, 1993[Feb], Vol 102[1], 133–244). On page 140, in the Total Incidence columns in Table 4, the data for the Attention Deficit row should be switched with that for the Conduct row. (The following abstract of this article originally appeared in record 1993-25780-001.) Data were collected on the point and lifetime prevalences, 1-yr incidence, and comorbidity of depression with other Diagnostic and Statistical Manual of Mental Disorders-III-Revised (DSM-III-R) disorders in a randomly selected sample (n?=?1,710) of high school students at point of entry and at 1-yr follow-up (n?=?1,508). The Schedule for Affective Disorders and Schizophrenia for School-Age Children was used to collect diagnostic information; 9.6% met criteria for a current disorder, more than 33% had experienced a disorder over their lifetimes, and 31.7% of the latter had experienced a 2nd disorder. High relapse rates were found for all disorders, especially for unipolar depression (18.4%) and substance use (15.0%). Female Ss had significantly higher rates at all age levels for unipolar depression, anxiety disorders, eating disorders, and adjustment disorders; male Ss had higher rates of disruptive behavior disorders. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Generic Representation of Solid-Object Geometry for Genetic Search

Abstract: This paper examines the first stage of using genetic algorithms in design—how to encode designs as chromosomes. Generic representations capable of describing the geometry of any solid object to eliminate the unnecessary duplication of work at this stage are explored. A suitable low-parameter, spatial-partitioning representation is then proposed, using partitions consisting of six-sided polyhedra intersected by planes. Finally, the coding of the representation is examined, with the conclusion that allelic coding with control genes and user-definable, fixed-value alleles would provide the most flexible system.