Do the Kallikaks look "menacing" or "retarded?"

To extend R. E. Fancher's (see record 1987-31600-001) review of claims that photographs of the Kallikak family in H. H. Goddard's (1912) study had been retouched to make them look more menacing and retarded, 29 Ss (aged 18–69 yrs) were surveyed for their impressions of the photographs. Overall, Ss were strongly inclined to view the photographed individuals as "kind" and "very bright." (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

More on Goddard and the Kallikak family photographs.

Discusses retouching of the Kallikak family photographs in H. H. Goddard's (1912) study of mental retardation and heredity, with reference to analyses by R. E. Fancher (see record 1987-31600-001) and S. J. Gould (1981), and concurs with Fancher that the retouching was probably not done for deceitful purposes. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

新时代家风建设的思想基础与实践路径探析 #br#

党的十八大以来,以习近平同志为核心的党中央高度重视家风建设在治国理政中的独特作用,深刻体现了家与国辩证统一的战略思维。优秀传统家训文化、马克思、恩格斯家庭观以及红色家风文化是新时代家风建设的思想基础。创造性转化和创新性发展优秀传统家训文化,继承和弘扬红色家风文化,运用好道德和制度两个杠杆,发挥好女性在家风建设中的重要作用是新时代家风建设的重要实践路径。     

Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs

We consider the problem of scheduling n jobs in batches on a single parallel-batching machine, where the jobs are partitioned into jobs families and the jobs in each family have the same due date. The objective is to minimize the weighted number of tardy jobs. We first devise an efficient pseudo-polynomial time and a fully polynomial time approximation scheme for the weighted problem. Then we present $O(n^2)$-time and $O(n\log n)$-time algorithms for the case where the jobs have the same weight and for the case where the jobs have the same processing time, respectively.     

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

In this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an time dynamic programming algorithm and an time dynamic programming algorithm for the problem, where n is the number of jobs, m is the number of families, k is the number of distinct release dates and P is the sum of the setup times of all the families and the processing times of all the jobs. We further give a heuristic with a performance ratio 2. We also give a polynomial-time approximation scheme (PTAS) for the problem.     

Client/Server模式在家庭远程监测系统中的应用

以Internet远程通信和计算机为代表的信息技术的迅速发展和应用，使得远程教育、远程贸易和远程监控成为可能。该文利用Winsock技术实现了基于客户，服务器模式的远程监测机和本地机之间的通信，最终达到家庭远程监测的目的。     

基于Pro/Engineer的三维机械零件库参数化设计

介绍了利用Pro/Engineer建立机械零件库的簇表(Family Table)和Pro/Program两种方法,并作简要比较,以实例实现了零件库的参数化设计.     

A hybrid tabu search for batching and sequencing decisions in a single machine environment

This paper proposes a hybrid tabu search (HTS) to minimise the total weighted tardiness (TWT) for the batching and sequencing of jobs originating from incompatible families in which sequence dependent family setup times exist on single machine. The developed HTS includes distinguished features such as the strict arc based tabu classification along with dynamic tabu tenures, hybrid neighbourhood structures and iterative phases which consist of job and batch sequencing phases. The authors developed a testing methodology to determine the quality of the HTS solution. A mixed integer linear programing (MILP) model was developed to evaluate the optimality of the solution of the HTS for a small-size instance that consists of 640 problems. In addition, three dispatching rule heuristic combinations (EDD–EDD, EDD–BATCS and ATC–BATCS) were developed to test the HTS for large-size instances that deals with 1440 problems. The HTS provided comparable results with the MILP for small-size instances and outperformed the developed dispatching heuristics.     

Beyond the lab: Investigating early adolescents' cognitive,emotional, and arousal responses to violent games

Cognitive, emotional, and arousal responses to violent games play a central role in theoretical explanations of how violent media may affect aggression. However, existing research has focused on a relatively narrow range of responses to violent games in experimental settings. This limits our understanding of whether and how violent game-induced responses relate to aggression in real life. To address these gaps, this study investigated how cognitive effort, emotional valence, and arousal in response to violent games relate to early adolescents' aggression, both cross-sectionally and over a period of one year. In addition, we investigated how a social context variable (i.e., family conflict) predicts these responses to violent games and subsequent aggression. A sample of 448 early adolescents (10–14 years) completed survey questions and media diaries that measured their responses to violent games. Results showed that, outside the lab, a positive cross-sectional relationship between violent game-induced arousal and aggression exists. In addition, arousal mediated the relationship between family conflict and aggression. Study findings justify increased research attention to media responses outside the lab and a need for further theoretical and methodological refinement.