Introduction

In this introduction, Barbara Smith-Moran explains the history and reasoning behind the student essay contest, which asks students to think and write about the contributions science has made to theology

Introduction

Dubois Patrick. YAKCHITCH (Grégoire). In: , . Le dictionnaire de pédagogie et d'instruction primaire de Ferdinand Buisson : répertoire biographique des auteurs. Paris : Institut national de recherche pédagogique, 2002. p. 141. (Bibliothèque de l'Histoire de l'Education, 17

Hope Works: Student Use of Education Tax Credits

Surveys University of California students on their use of Hope Scholarship and Lifetime Learning tax credit programs. Explores the debate over whether federal aid should emphasize incentives to attend college or relief to those already planning to attend

A unified framework for building ontological theories with application and testing in the field of clinical trials

The objective of this research programme is to contribute to the establishment of the emerging science of Formal Ontology in Information Systems via a collaborative project involving researchers from a range of disciplines including philosophy, logic, computer science, linguistics, and the medical sciences. The re­searchers will work together on the construction of a unified formal ontology, which means: a general framework for the construction of ontological theories in specific domains. The framework will be constructed using the axiomatic-deductive method of modern formal ontology. It will be tested via a series of applications relating to on-going work in Leipzig on medical taxonomies and data dictionaries in the context of clinical trials. This will lead to the production of a domain-specific ontology which is designed to serve as a basis for applications in the medical field

Combining constraint satisfaction and local improvement algorithms to construct anaesthetists' rotas

A system is described which was built to compile weekly rotas for the anaesthetists in a large hospital. The rota compilation problem is an optimization problem (the number of tasks which cannot be assigned to an anaesthetist must be minimized) and was formulated as a constraint satisfaction problem (CSP). The forward checking algorithm is used to find a feasible rota, but because of the size of the problem, it cannot find an optimal (or even a good enough) solution in an acceptable time. Instead, an algorithm was devised which makes local improvements to a feasible solution. The algorithm makes use of the constraints as expressed in the CSP to ensure that feasibility is maintained, and produces very good rotas which are being used by the hospital involved in the project. It is argued that formulation as a constraint satisfaction problem may be a good approach to solving discrete optimization problems, even if the resulting CSP is too large to be solved exactly in an acceptable time. A CSP algorithm may be able to produce a feasible solution which can then be improved, giving a good, if not provably optimal, solution