6977019
Rule Creation and Rule Learning Through Environmental Exploration
The task of learning from environment is specified. It requires the learner to infer the laws of the environment in terms of its percepts and actions, and use the laws to solve problems. Based on research on problem space creation and discrimination learning, this paper reports an approach in which exploration, rule creation and rule learning are coordinated in a single framework. With this approach, the system LIVE creates STRIPS-Iike rules by noticing the changes in the environment when actions are taken, and later refines the rules by explaining the failures of their predictions. Unlike many other learning systems, since LIVE treats learning and problem solving as interleaved activities, no training instance nor any concept hierarchy is necessary to start learning. Furthermore, the approach is capable of discovering hidden features from the environment when normal discrimination process fails to make any progress.
5581562
Computer science as empirical inquiry: symbols and search
Computer science is the study of the phenomena surrounding computers. The founders of this society understood this very well when they called themselves the Association for Computing Machinery. The machine—not just the hardware, but the programmed, living machine—is the organism we study.
37804897
Directions for Qualitative Reasoning
Sacks & Doyle provide an excellent overview of the fundamental limitations of the SPQR representations for reasoning about the qualitative properties of dynamic systems. We take this opportunity to outline some new directions for qualitative reasoning. In this paper, we provide a rigorous mathematical characterization for the term “qualitative property” in the context of static and dynamic systems. Based on these characterizations, we show that interval representations are well suited for reasoning about the qualitative properties of static systems such as qualitative comparative statics and qualitative stability. Moreover, we also show that symbolic computations help in the derivation of useful global properties of dynamic systems which can be used to guide numerical sampling of differential equations. The integration of symbolic and numeric methods provides a powerful approach for automating the qualitative analysis of differential equations.
16243913
Experiments with a Heuristic Compiler
This report describes some experiments in constructing a compiler that makes use of heuristic problem~solving techniques such as those incorporated in the General Problem Solver (GPS) [1]. The experiments were aimed at the dual objectives of throwing light on some of the problems of constructing more powerful programming languages and compilers, and of testing whether the task of writing a computer program can be regarded as a "problem" in the sense in which that term is used in GPS. The present paper is concerned primarily with the second objective--with analyzing some of the problem-solving processes that are involved in writing computer programs. At the present stage of their development, no claims will be made for the heuristic programming procedures described here as practical approaches to the construction of compilers. Their interest lies in what they teach us about the nature of the programming task.
10043574
Scientific Model-Building as Search in Matrix Spaces
Many reported discovery systems build discrete models of hidden structure, properties, or processes in the diverse fields of biology, chemistry, and physics. We show that the search spaces underlying many well-known systems are remarkably similar when re-interpreted as search in matrix spaces. A small number of matrix types are used to represent the input data and output models. Most of the constraints can be represented as matrix constraints; most notably, conservation laws and their analogues can be represented as matrix equations. Typically, one or more matrix dimensions grow as these systems consider more complex models after simpler models fail, and we introduce a notation to express this. The novel framework of matrix-space search serves to unify previous systems and suggests how at least two of them can be integrated. Our analysis constitutes an advance toward a generalized account of model-building in science.
6846387
Causality and Model Abstraction
Abstract Much of science and engineering is concerned with characterizing processes by equations describing the relations that hold among parameters of objects and govern their behavior over time. In formal descriptions of processes in terms of parameters and equations, the notion of causality is rarely made explicit. Formal treatments of the foundations of sciences have avoided discussions of causation and spoken only of functional relations among variables. Nevertheless, the notion of causality plays an important role in our understanding of phenomena. Even when we describe the behavior of a system formally in terms of acausal, mathematical relations, we often give an informal, intuitive explanation of why the system behaves the way it does in terms of cause-effect relations. In this paper, we will present an operational definition of causal ordering. The definition allows us to extract causal dependency relations among variables implicit in a model of a system, when a model is represented as a set of acausal, mathematical relations. Our approach is based on the theory of causal ordering first presented by Simon [22]. The paper shows how to use the theory and its extension in reasoning about physical systems. Further, the paper studies the relation of the theory to the problems of model aggregation.
17561186
Situated Action: A Symbolic Interpretation
The congeries of theoretical views collectively referred to as “situated action” (SA) claim that humans and their interactions with the world cannot be understood using symbol-system models and methodology, but only by observing them within real-world contexts or building nonsymbolic models of them. SA claims also that rapid, real-time interaction with a dynamically changing environment is not amenable to symbolic interpretation of the sort espoused by the cognitive science of recent decades. Planning and representation, central to symbolic theories, are claimed to be irrelevant in everyday human activity. 
 
We will contest these claims, as well as their proponents' characterizations of the symbol-system viewpoint. We will show that a number of existing symbolic systems perform well in temporally demanding tasks embedded in complex environments, whereas the systems usually regarded as exemplifying SA are thoroughly symbolic (and representational), and, to the extent that they are limited in these respects, have doubtful prospects for extension to complex tasks. As our title suggests, we propose that the goals set forth by the proponents of SA can be attained only within the framework of symbolic systems. The main body of empirical evidence supporting our view resides in the numerous symbol systems constructed in the past 35 years that have successfully simulated broad areas of human cognition.
8638136
The marketplace of high-performance computing
In this paper we analyze the major trends and changes in the High-Performance Computing (HPC) market place since the beginning of the journal ‘Parallel Computing’. The initial success of vector computers in the 1970s was driven by raw performance. The introduction of this type of computer systems started the area of ‘Supercomputing’. In the 1980s the availability of standard development environments and of application software packages became more important. Next to performance these factors determined the success of MP vector systems, especially at industrial customers. MPPs became successful in the early 1990s due to their better price/performance ratios, which was made possible by the attack of the ‘killer-micros’. In the lower and medium market segments the MPPs were replaced by microprocessor based symmetrical multiprocessor (SMP) systems in the middle of the 1990s. There success formed the basis for the use of new cluster concepts for very high-end systems. In the last few years only the companies which have entered the emerging markets for massive parallel database servers and financial applications attract enough business volume to be able to support the hardware development for the numerical high-end computing market as well. Success in the traditional floating point intensive engineering applications seems to be no longer suAcient for survival in the market. ” 1999 Elsevier Science B.V. All rights reserved.
11287797
Collaborative Discovery in a Scientific Domain
This study compares Pairs of subjects with Single subjects in a task of discovering scientific laws with the aid of experiments. Subjects solved a molecular genetics task in a computer micro-world (Dunbar, 1993). Pairs were more successful in discovery than Singles and participated more actively in explanatory activities (i.e., entertaining hypotheses and considering alternative ideas and justifications). Explanatory activities were effective for discovery only when the subjects also conducted crucial experiments. Explanatory activities were facilitated when paired subjects made requests of each other for explanation and focused on them. The study extends from individual to collaborative discovery activities the importance to the discovery process of setting goals to find hypotheses and evidence (Dunbar, 1993) and to construct explanations of phenomena and processes encountered in examples (Chi, Bassok, Lewis, & Glaser, 1989). Discovery through collaboration is a common and growing practice in science whose processes have not yet been extensively studied. We do not yet know whether discovery processes are different when people work together, what role discussion plays in collaboration, how researchers entertain hypotheses and conduct experiments when working together or how they handle alternative hypotheses and justifications that arise in discussion. These questions may be approached through historical case studies, field observation, interviews with researchers involved in collaboration, and laboratory experiments. Each approach has its advantages and limitations. This paper follows an experimental approach. We are aware that, although experiments are highly useful for detailed analyses of discovery processes, we need to be cautious in interpreting these data as reflecting actual scientists’ collaborative discovery processes. Over the long run, combining various approaches
26191709
The Implementation of the U.S. High Performance Computing and Communications Program
This paper gives an overview of the federal High Performance Computing and Communication (HPCC) Program. This initiative involves the Defense Advanced Projects Agency (DARPA), the Department of Energy (DOE), the National Aeronautics and Space Administration (NASA), and the National Science Foundation (NSF). Its goal is to advance U.S. science and industrial competitiveness by supporting the development of teraops high performance systems, the software and algorithms required to render those massively parallel systems efficiently usable, and the Gigabit networks to make those machines accessible, as well as to broaden the base of computationally literate scientists. We outline the HPCC effort and the rationale underlying it, and give an overview of some of the “Grand Challenge” work under way at Argonne’s Mathematics and Computer Science Division, as well as the Grand Challenges addressed by NASA’s Computational Aerosciences program.
27066665
Applications Performance on Intel Paragon XP/S-15
The impact of two different operating systems OSF, and SUNMOS available on the NAS Paragon, on the performance of applications has been studied and investigated. In OSF, paging of the unused part of the server and management of the virtual memory by the operating system degrades the performance of the applications by as much as by 40% in some of the cases studied. The influence of the data cache on the performance of the applications under both OSF and SUNMOS using one-dimensional (1-D) Fast Fourier transform (FFT) and three-dimensional (3-D) FFT has also been investigated. The performance of NAS Parallel Benchmarks is reported, and the scalability issues of the machine and the algorithms under both OSF and SUNMOS are considered.