Note on Some Fixed Point Constructions in Provability Logic

We present a quite simple proof of the fixed point theorem for GL. We also use this proof to show that Sambin's algorithm yields a fixed point.     

A class of multidimensional IRT models for testing unidimensionality and clustering items

We illustrate a class of multidimensional item response theory models in which the items are allowed to have different discriminating power and the latent traits are represented through a vector having a discrete distribution. We also show how the hypothesis of unidimensionality may be tested against a specific bidimensional alternative by using a likelihood ratio statistic between two nested models in this class. For this aim, we also derive an asymptotically equivalent Wald test statistic which is faster to compute. Moreover, we propose a hierarchical clustering algorithm which can be used, when the dimensionality of the latent structure is completely unknown, for dividing items into groups referred to different latent traits. The approach is illustrated through a simulation study and an application to a dataset collected within the National Assessment of Educational Progress, 1996. The author would like to thank the Editor, an Associate Editor and three anonymous referees for stimulating comments. I also thank L. Scaccia, F. Pennoni and M. Lupparelli for having done part of the simulations.     

云门文偃的禅学思想

该文对唐末五代时期“禅宗五家”之一云门宗创始人文偃的禅学思想进行了初步分析,指出了其宗教哲学的客观唯心主义本质,同时也揭示了其“机锋”的反理性、反逻辑、反知识的特点。     

Bayes modal estimation in item response models

This article describes a Bayesian framework for estimation in item response models, with two-stage prior distributions on both item and examinee populations. Strategies for point and interval estimation are discussed, and a general procedure based on the EM algorithm is presented. Details are given for implementation under one-, two-, and three-parameter binary logistic IRT models. Novel features include minimally restrictive assumptions about examinee distributions and the exploitation of dependence among item parameters in a population of interest. Improved estimation in a moderately small sample is demonstrated with simulated data.This research was supported by a grant from the Spencer Foundation, Chicago, IL. Comments and suggestions on earlier drafts by Charles Lewis, Frederic Lord, Rosenbaum, James Ramsey, Hiroshi Watanabe, the editor, and two anonymous referees are gratefully acknowledged.     

Factor analysis for clustered observations

Classical factor analysis assumes a random sample of vectors of observations. For clustered vectors of observations, such as data for students from colleges, or individuals within households, it may be necessary to consider different within-group and between-group factor structures. Such a two-level model for factor analysis is defined, and formulas for a scoring algorithm for estimation with this model are derived. A simple noniterative method based on a decomposition of the total sums of squares and crossproducts is discussed. This method provides a suitable starting solution for the iterative algorithm, but it is also a very good approximation to the maximum likelihood solution. Extensions for higher levels of nesting are indicated. With judicious application of quasi-Newton methods, the amount of computation involved in the scoring algorithm is moderate even for complex problems; in particular, no inversion of matrices with large dimensions is involved. The methods are illustrated on two examples.Suggestions and corrections of three anonymous referees and of an Associate Editor are acknowledged. Discussions with Bob Jennrich on computational aspects were very helpful. Most of research leading to this paper was carried out while the first author was a visiting associate professor at the University of California, Los Angeles.     

The EM algorithm for latent class analysis with equality constraints

The EM algorithm is a popular iterative method for estimating parameters in the latent class model where at each step the unknown parameters can be estimated simply as weighted sums of some latent proportions. The algorithm may also be used when some parameters are constrained to equal given constants or each other. It is shown that in the general case with equality constraints, the EM algorithm is not simple to apply because a nonlinear equation has to be solved. This problem arises, mainly, when equality constrints are defined over probabilities indifferent combinations of variables and latent classes. A simple condition is given in which, although probabilities in different variable-latent class combinations are constrained to be equal, the EM algorithm is still simple to apply.The authors are grateful to the Editor and the anonymous reviewers for their helpful comments on an earlier draft of this paper. C. C. Clogg and R. Luijkx are also acknowledged for verifying our results with their computer programs MLLSA and LCAG, respectively.     

Wisdom's Information: Rereading a Biblical Image in the Light of Some Contemporary Science and Speculation

The biblical image of Wisdom as the power who "orders all things well" in nature and in human life can be read in the light of contemporary information theory. Some current scientific speculation offers an interpretation of reality as a vast information-processing system, in which informational situations are continuously transformed through algorithmic operations. This interpretation finds a metaphysical counterpart in the distinction between "nature natured" and "nature naturing" in the philosophical theology of Samuel Taylor Coleridge. This confluence of religious, metaphysical, and scientific imagery suggests a picture of the world in which the processes of "nature naturing,""human humaning," and "God Godding" inform and recur in each other.     

Stimulus-specific contrast effects during operant discrimination learning

In two experiments, pigeons' responding was equally reinforced in the presence of four line-orientation stimuli. Responding was then reinforced when only two of the four orientation stimuli were present; the remaining two orientations appeared during extinction. Response rates were often highest in the stimulus adjacent to the orientations presented during extinction and often lowest in that orientation adjacent to the orientations presented with reinforcement. These effects were stronger and more persistent when the stimuli were separated by a smaller angle, rendering the discrimination more difficult. These and other data suggest that discrimination training may not be accurately explained in terms of the simple effects of reinforcement and nonreinforcement associated with isolated stimuli, nor by accounts that depend upon stimulus generalization. Recent accounts of contrast that depend upon “emotionality” produced by nonreinforced responding or upon reinforcement-elicited responses are also difficult to apply to these data.     

Additive structure in qualitative data: An alternating least squares method with optimal scaling features

A method is developed to investigate the additive structure of data that (a) may be measured at the nominal, ordinal or cardinal levels, (b) may be obtained from either a discrete or continuous source, (c) may have known degrees of imprecision, or (d) may be obtained in unbalanced designs. The method also permits experimental variables to be measured at the ordinal level. It is shown that the method is convergent, and includes several previously proposed methods as special cases. Both Monte Carlo and empirical evaluations indicate that the method is robust.This research was supported in part by grant MH-10006 from the National Institute of Mental Health to the Psychometric Laboratory of the University of North Carolina. We wish to thank Thomas S. Wallsten for comments on an earlier draft of this paper. Copies of the paper and of ADDALS, a program to perform the analyses discussed herein, may be obtained from the second author.     

FACAIC: Model selection algorithm for the orthogonal factor model using AIC and CAIC

This paper describes the authors' FORTRAN algorithm FACAIC for choosing the number of factors for an orthogonal factor model using Akaike's Information Criterion. FACAIC utilizes the IMSL subroutine OFCOMM.The authors dedicate this algorithm to Professor Hirotugu Akaike in appreciation of his pioneering work on AIC which was originally intended for the factor analysis and other statistical model identification problems.