Gorillas (Gorilla gorilla) and Orangutans (Pongo pygmaeus) Encode Relevant Problem Features in a Tool-Using Task.

Two important elements in problem solving are the abilities to encode relevant task features and to combine multiple actions to achieve the goal. The authors investigated these 2 elements in a task in which gorillas (Gorilla gorilla) and orangutans (Pongo pygmaeus) had to use a tool to retrieve an out-of-reach reward. Subjects were able to select tools of an appropriate length to reach the reward even when the position of the reward and tools were not simultaneously visible. When presented with tools that were too short to retrieve the reward, subjects were more likely to refuse to use them than when tools were the appropriate length. Subjects were proficient at using tools in sequence to retrieve the reward. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Accelerating filtering techniques for numeric CSPs

Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper¹ we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis.     

The problem of definition expansion and contraction

This article is the fourth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research focuses on finding criteria that would enable an automated reasoning program to expand or contract definitions wisely. For evaluating a proposed solution to this research problem, we include suggestions concerning possible test problems.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract W-31-109-Eng-38.     

New quadratic models for the maximum weighted cut problem

New quadratic models are proposed to improve the upper-bound estimates in the maximum weighted cut problem. They are found by two original methods for deriving redundant quadratic constraints. A well-known linear model is shown to follow from the models proposed. Recommendations on how to develop its strengthened analogs are given. This study is partially sponsored from the grant UM2-2574-KV-03 (CRDF Cooperative Grants Program). __________ Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 63—75, January–February 2006.     

Necessary optimality conditions in a nonsmooth control problem with variable structure

An optimal control problem with nonsmooth performance criterion described by a system of ordinary differential equations is considered. Necessary first-order optimality conditions are obtained.     

二次盐水及离子膜电解工序常见问题简析

介绍了二次盐水及离子膜电解工序的主要设备和流程,对二次盐水及离子膜电解工序运行中出现的问题进行了分析,并提出了解决措施。     

A theory of reservation-dwelling American Indian alcohol use risk.

The authors present a theory for understanding risk for problem drinking among reservation-dwelling American Indians. The theory offers an overall framework for understanding the risk process for this group. It considers the distinction between factors that influence mean levels of American Indian problem drinking and factors that influence individual differences in American Indian drinking. It proposes important contextual differences between reservation-dwelling American Indians and Caucasians that may help explain the higher mean levels of American Indian problem drinking. The theory further holds that, within the high mean level of problem drinking characteristic of many American Indian reservations, individual differences in problem drinking can be explained by very similar personality and learning factors as those that influence problem-drinking levels for other ethnic groups. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Symmetric BEM formulations for 2-D steady-state and transit potential problems

This paper presents a new concept for symmetric boundary element method (SBEM) applicable to 2-D steady-state and transit potential problems. Two kinds of SBEM formulations are derived. Symmetry is obtained simply through matrix manipulation, and no hypersingularity appears. Therefore, SBEM is much easier than the traditional symmetric Galerkin BEM. Compared with the traditional asymmetric BEM, the present SBEM can reduce the computational cost for time domain problems only. However, when applied to BEM/FEM coupling procedure, SBEM can reduce the computational cost for both steady-state and time domain problems. Three numerical examples are included to illustrate the effectiveness and accuracy of the present formulations.     

Personality and the predisposition to engage in risky or problem behaviors during adolescence.

Longitudinal data from a representative sample of 1,978 Black and White adolescents were used to examine the role of personality in multiple risk or problem behaviors. Results indicate that covariation among diverse behaviors (educational underachievement, delinquent behavior, substance use, sexual behavior) can be adequately modeled by a single higher order factor, and that impulsivity and avoidance coping serve as generalized risk factors for involvement in these behaviors. Whereas none of the personality variables examined explained change in problem behaviors once established, avoidance coping prospectively predicted involvement among a subgroup of adolescents with little or no prior involvement. Results suggest that dysfunctional styles of regulating emotions and emotionally driven behaviors are core features of risky or problem behaviors during adolescence. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A Stronger Complexity Result for the Single Machine Multi-Operation Jobs Scheduling Problem to Minimize the Number of Tardy Jobs

We consider the single machine multi-operation jobs scheduling problem to minimize the number of tardy jobs. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a setup time. A job completes when all of its operations have been processed. The objective is to minimize the number of tardy jobs. In the literature, this problem has been proved to be strongly NP-hard for arbitrary due-dates. We show in this paper that the problem remains strongly NP-hard even when the due-dates are common and all jobs have the same processing time.