Assessing the Incremental Algorithm: A Response to Krahmer et al.

This response discusses the experiment reported in Krahmer et al.’s Letter to the Editor of Cognitive Science. We observe that their results do not tell us whether the Incremental Algorithm is better or worse than its competitors, and we speculate about implications for reference in complex domains, and for learning from ‘‘normal” (i.e., non‐semantically‐balanced) corpora.     

Evolutionary Theologies and Divine Action1

Abstract

Two challenges loom large for efforts to develop a theology of evolution. The first is the problem of purpose: can evolutionary processes, in which chance plays so prominent a role, be understood as the context of God's purposive action? The second is the problem of the pervasiveness of suffering and death in evolution. To the extent that we succeed in responding to the first difficulty by giving an account of how God's purposes are enacted in the history of life, we deepen the conundrum about God's relation to natural evils. In particular, if we embrace evolution as God's clever way of making life make itself, we will find it difficult to sustain the classical theological claim that death is a disruptive interloper in God's good creation.     

The order-restricted association model: Two estimation algorithms and issues in testing

This paper presents a row-column (RC) association model in which the estimated row and column scores are forced to be in agreement with an a priori specified ordering. Two efficient algorithms for finding the order-restricted maximum likelihood (ML) estimates are proposed and their reliability under different degrees of association is investigated by a simulation study. We propose testing order-restricted RC models using a parametric bootstrap procedure, which turns out to yield reliablep values, except for situations in which the association between the two variables is very weak. The use of order-restricted RC models is illustrated by means of an empirical example. Francisca Galindo performed this research as a part of her PhD. dissertation project at Tilburg University.     

Weighted least squares fitting using ordinary least squares algorithms

A general approach for fitting a model to a data matrix by weighted least squares (WLS) is studied. This approach consists of iteratively performing (steps of) existing algorithms for ordinary least squares (OLS) fitting of the same model. The approach is based on minimizing a function that majorizes the WLS loss function. The generality of the approach implies that, for every model for which an OLS fitting algorithm is available, the present approach yields a WLS fitting algorithm. In the special case where the WLS weight matrix is binary, the approach reduces to missing data imputation.This research has been made possible by a fellowship from the Royal Netherlands Academy of Arts and Sciences to the author.     

EM algorithms for ML factor analysis

The details of EM algorithms for maximum likelihood factor analysis are presented for both the exploratory and confirmatory models. The algorithm is essentially the same for both cases and involves only simple least squares regression operations; the largest matrix inversion required is for aq ×q symmetric matrix whereq is the matrix of factors. The example that is used demonstrates that the likelihood for the factor analysis model may have multiple modes that are not simply rotations of each other; such behavior should concern users of maximum likelihood factor analysis and certainly should cast doubt on the general utility of second derivatives of the log likelihood as measures of precision of estimation.     

Nonseparability,Potentiality, and the Context-Dependence of Quantum Objects

Standard quantum mechanics undeniably violates the notion of separability that classical physics accustomed us to consider as valid. By relating the phenomenon of quantum nonseparability to the all-important concept of potentiality, we effectively provide a coherent picture of the puzzling entangled correlations among spatially separated systems. We further argue that the generalized phenomenon of quantum nonseparability implies contextuality for the production of well-defined events in the quantum domain, whereas contextuality entails in turn a structural-relational conception of quantal objects, viewed as carriers of dispositional properties. It is finally suggested that contextuality, if considered as a conditionalization preparation procedure of the object to be measured, naturally leads to a separable concept of reality whose elements are experienced as distinct, well-localized objects having determinate properties. In this connection, we find it necessary to distinguish the meaning of the term reality from the criterion of reality for us. The implications of the latter considerations for the notion of objectivity in quantum mechanics are also discussed.

Comparison of advantages and disadvantages among various algorithms in logistics path design—Taking H-group as an example

There are many kinds of VRP problems and there are many ways to solve them. In this paper, we use ant colony algorithm, genetic algorithm, and annealing algorithm to optimize the selection of the logistics path of H-group located at He Nan Province. It establishes an algorithm evaluation system, and analyzes the performance of the three algorithms in six dimensions from qualitative and quantitative perspectives. Through MATLAB data calculation, we found that the ant colony algorithm performs equally well on the solution quality, solution efficiency, code storage, robustness, adaptability, and optimality.     

Must God Be Dead? Reinventing the Sacred

Newton became a death knell for a theistic God and for a non-epiphenominal mind. The culprit is the deterministic causal closure of classical physics. Two major revolutions are taking us beyond this closure. The first is Quantum Mechanics, which is non-deterministic. The second revolution may just be happening. The emergence and evolution of life in our or any biosphere is governed by no law at all. This freedom suggests one sense of God as the natural creativity of the Universe.     

Disjunctive Quantum Logic in Dynamic Perspective

In Coecke (2002) we proposed the intuitionistic or disjunctive representation of quantum logic, i.e., a representation of the property lattice of physical systems as a complete Heyting algebra of logical propositions on these properties, where this complete Heyting algebra goes equipped with an additional operation, the operational resolution, which identifies the properties within the logic of propositions. This representation has an important application towards dynamic quantum logic, namely in describing the temporal indeterministic propagation of actual properties of physical systems. This paper can as such by conceived as an addendum to Quantum Logic in Intuitionistic Perspective that discusses spin-off and thus provides an additional motivation. We derive a quantaloidal semantics for dynamic disjunctive quantum logic and illustrate it for the particular case of a perfect (quantum) measurement.