An automated test development of parallel tests from a seed test

Binary programming models are presented to generate parallel tests from an itembank. The parallel tests are created to match item for item an existing seed test and match user supplied taxonomic specifications. The taxonomic specifications may be either obtained from the seed test or from some other user requirement. An algorithm is presented along with computational results to indicate the overall efficiency of the process. Empirical findings based on an itembank for the Arithmetic Reasoning section of the Armed Services Vocational Aptitude Battery are given.The Office of Naval Research, Program in Cognitive Science, N00014-87-C-0696 partially supported the work of Douglas H. Jones. The Rutgers Research Resource Committee of the Graduate School of Management partially supported the work of Douglas H. Jones and Ing-Long Wu. A Thomas and Betts research fellowship partially supported the work of Ing-Long Wu. The Human Resources Laboratory, United States Air Force, partially supported the work of Ronald Armstrong. The authors benefited from conversations with Dr. Wayne Shore, Operational Technologies, San Antonio, Texas. The order of authors' names is alphabetical and denotes equal authorship.     

Relative costs and statistical power in the extreme groups approach

The relationship between variables in applied and experimental research is often investigated by the use of extreme (i.e., upper and lower) groups. Recent analytical work has provided an extreme groups procedure that is more powerful than the standard correlational approach for all values of the correlation and extreme group size. The present article provides procedures to optimize power by determining the relative number of subjects to use in each of two stages of data collection given a fixed testing budget.The opinions or assertions contained herein are those of the writers and are not to be construed as official or reflecting the views of the Navy Department.Edward F. Alf, Jr. is also affiliated with the Department of Psychology, San Diego State University.     

How to maximize reward rate on two variable-interval paradigms

Without assuming any constraints on behavior, we derive the policy that maximizes overall reward rate on two variable-interval paradigms. The first paradigm is concurrent variable time-variable time with changeover delay. It is shown that for nearly all parameter values, a switch to the schedule with the longer interval should be followed immediately by a switch back to the schedule with the shorter interval. The matching law does not hold at the optimum and does not uniquely specify the obtained reward rate. The second paradigm is discrete trial concurrent variable interval-variable interval. For given schedule parameters, the optimal policy involves a cycle of a fixed number of choices of the schedule with the shorter interval followed by one choice of the schedule with the longer interval. Molecular maximization sometimes results in optimal behavior.     

Choice, changeover, and travel

Since foraging in nature can be viewed as instrumental behavior, choice between sources of food, known as “patches,” can be viewed as choice between instrumental response alternatives. Whereas the travel required to change alternatives deters changeover in nature, the changeover delay (COD) usually deters changeover in the laboratory. In this experiment, pigeons were exposed to laboratory choice situations, concurrent variable-interval schedules, that were standard except for the introduction of a travel requirement for changeover. As the travel requirement increased, rate of changeover decreased and preference for a favored alternative strengthened. When the travel requirement was small, the relations between choice and relative reinforcement revealed the usual tendencies toward matching and undermatching. When the travel requirement was large, strong overmatching occurred. These results, together with those from experiments in which changeover was deterred by punishment or a fixed-ratio requirement, deviate from the matching law, even when a correction is made for cost of changeover. If one accepted an argument that the COD is analogous to travel, the results suggest that the norm in choice relations would be overmatching. This overmatching, however, might only be the sign of an underlying strategy approximating optimization.     

Likelihood inference on the underlying structure of IRT models

The assumptions underlying item response theory (IRT) models may be expressed as a set of equality and inequality constraints on the parameters of a latent class model. It is well known that the same assumptions imply that the parameters of the manifest distribution have to satisfy a more complicated set of inequality constraints which, however, are necessary but not sufficient. In this paper, we describe how the theory for likelihood-based inference under equality and inequality constraints may be used to test the underlying assumptions of IRT models. It turns out that the analysis based directly on the latent structure is simpler and more flexible. In particular, we indicate how several interesting extensions of the Rasch model may be obtained by partial relaxation of the basic constraints. An application to a data set provided by Educational Testing Service is used to illustrate the approach.We thank Dr. Gorman and Dr. Rogers of the Educational Testing Service for providing the data analyzed in Section 4. We also thank three reviewers for comments and suggestions.This revised article was published online in August 2005 with the PDF paginated correctly.     

基于性能反馈的PSO算法速度上限调整策略

速度上限是影响微粒群算法性能的一个主要参数。针对现有调节策略存在参数统一设置、与微粒性能无关等缺点,本文提出一种基于性能反馈的调整策略,使得速度上限能随着个体性能的改变而动态调整,从而更加真实有效的模拟了鸟类觅食的群体行为特征。仿真结果表明该算法能较好地提高微粒群算法的计算效率。     

下腰痛综合征的诊治与人文思想

下腰痛是一种常见的骨科病症,轻者可影响患者生活,重者可使患者丧失劳动力。它的发病原因有很多,治疗方法各有不同。在下腰痛的诊断中要按照适度医疗的原则选择合适的检查;在下腰痛的治疗中须按照最优化医疗的原则选择最佳的治疗方案。在治疗中要注意结合人文思想来提高下腰痛的治疗效果。     

Indclus: An individual differences generalization of the adclus model and the mapclus algorithm

We present a new model and associated algorithm, INDCLUS, that generalizes the Shepard-Arabie ADCLUS (ADditive CLUStering) model and the MAPCLUS algorithm, so as to represent in a clustering solution individual differences among subjects or other sources of data. Like MAPCLUS, the INDCLUS generalization utilizes an alternating least squares method combined with a mathematical programming optimization procedure based on a penalty function approach to impose discrete (0,1) constraints on parameters defining cluster membership. All subjects in an INDCLUS analysis are assumed to have a common set of clusters, which are differentially weighted by subjects in order to portray individual differences. As such, INDCLUS provides a (discrete) clustering counterpart to the Carroll-Chang INDSCAL model for (continuous) spatial representations. Finally, we consider possible generalizations of the INDCLUS model and algorithm.We are indebted to Seymour Rosenberg for making available the data from Rosenberg and Kim [1975]. Also, this work has benefited from the observations of S. A. Boorman, W. S. DeSarbo, G. Furnas, P. E. Green, L. J. Hubert, L. E. Jones, J. B. Kruskal, S. Pruzansky, D. Schmittlein, E. J. Shoben, S. D. Soli, and anonymous referees.This research was supported in part by NSF Grant SES82 00441, LEAA Grant 78-NI-AX-0142, and NSF Grant SES80 04815.     

Nodality effects during equivalence class formation: An extension to sight-word reading and concept development

Three students with moderate disabilities were taught to read and match-to-sample sight words comprising stimulus sets based upon the four food groups. We taught students conditional discriminations within four four-member sets using a single-sample/four-comparison procedure. Students were taught A-B, B-C, and C-D conditional discriminations for each of the four potential stimulus classes. Subsequent probes tested for relations based upon symmetry and one-node and two-node transitivity. The performances for all students indicated that symmetric relations emerged before one-node transitive relations, and that one-node transitive relations emerged before two-node transitive relations. These results are consistent with a pattern of responding, referred to as a "nodality effect," in which relations with fewer nodes are demonstrated prior to the demonstration of relations with a greater number of nodes. These results extend this area of research to sight-word reading for students with moderate disabilities.     

More on concurrent interval-ratio schedules: a replication and review.

It has been suggested that the failure to maximize reinforcement on concurrent variable-interval, variable-ratio schedules may be misleading. Inasmuch as response costs are not directly measured, it is possible that subjects are optimally balancing the benefits of reinforcement against the costs of responding. To evaluate this hypothesis, pigeons were tested in a procedure in which interval and ratio schedules had equal response costs. On a concurrent variable time (VT), variable ratio-time (VRT) schedule, the VT schedule runs throughout the session and the VRT schedule is controlled by responses to a changeover key that switches from one schedule to the other. Reinforcement is presented independent of response. This schedule retains the essential features of concurrent VI VR, but eliminates differential response costs for the two alternatives. It therefore also eliminates at least one significant ambiguity about the reinforcement maximizing performance. Pigeons did not maximize rate of reinforcement on this procedure. Instead, their times spent on the alternative schedules matched the relative rates of reinforcement, even when schedule parameters were such that matching earned the lowest possible overall rate of reinforcement. It was further shown that the observed matching was not a procedural artifact arising from the constraints built into the schedule.