bluuebunny/crossref_metadata_2025 huggingface dataset:
SPEC benchmarks and competitive results
Authors: Keller Tom
Published: January 2007

In less than a year since its Introduction the System performance Evaluation Cooperative (SPEC ((TM))) benchmarks have established themselves as an Important and widely distributed benchmark suite for engineering and scientific workstations, displacing the old standards Dhrystone, Linpack and Whetstone. This is because most workstation vendors support SPEC and have participated in developing both the benchmarks and a benchmarking methodology that overcome many of the failings of the old benchmark standards. SPEC's strong endorsement by EE TIMES newsmagazine helps insure that SPEC results are heavily publicized in the Industry.
Book review: Performance Analysis of Transaction Processing Systems by Wilbur H. Highleyman (Prentice Hall, 1989)
Authors: Finkel David
Published: January 2007

Measurement of computer system performance usually occupies at most a chapter or two of performance evaluation texts, but here it is given the book-length treatment it deserves. The author begins the book with an introductory chapter discussing the purposes and goals of performance measurement, which of course varyn from one study to another. He then surveys the kinds of measurement tools available, and sets out his philosophy of measurement methodology (which includes references to Aristotle and the Renaissance world view), which is expanded in a later chapter.
Book review: Performance Engineering of Software Systems by Connie U. Smith (Addison-Wesley, 1990)
Authors: Finkel David
Published: January 2007

This books concentrates on the important topic of the performance of computer communications networks, particularly on the performance of the multiple access protocols they use. The approach is mathematical, and the authors clearly state the mathematical prerequisities they expect from the reader: probability theory, stochastic processes in general, and Markov chains and the M/G/1 queue in particular. The mathematical prerequisities allow the the authors to do a careful and complete job of deriving the results they need. Each chapter ends with a set of challenging exercises, for those who wish to use the book as a text, and the book ends with an extensive bibliography.
Benchmark semantics
Authors: Ponder Carl G.
Published: January 2007

Be careful when interpreting benchmark measurements that compare two languages or two implementations of the same language. A program expressed in two different languages rarely computes the exact same function in both cases. The same goes for a program run on two different implementations of the same language. The implementation details ultimately affect the language semantics as well as the benchmark performance. Here are some simple examples of this effect.
Book Review: Efficient FORTRAN Programming, by Anton Kruger (Wiley, 1990; ISBN 0 471-52894-3)
Authors: Kajen Michael
Published: January 2007

I like Kruger's philosophy on writing efficient programs. He presents program efficiency as a series of tradeoffs: memory versus speed, complexity versus speed, generality versus simplicity. His goal is to help the programmer concentrate on writing clear, efficient programs that make the best use of the hardware and software.
The RHET system
Authors: Allen James F.
Published: January 2007

The RHET system is a knowledge representation tool that is intended to support the development of advanced prototype natural language understanding and planning systems. The key requirements on the system are that it be general and expressive enough to support basic experimental systems, that it is efficient enough to allow such systems to be effectively built, and that its behavior be precisely specified independent of the actual program. It is a hybrid representation consisting of a set of separately defined specialized reasoning systems that are presented to the user within a single uniform framework.
The relation-based knowledge representation of King Kong
Authors: Bayer Samuel , Vilain Marc
Published: January 2007

This paper presents an overview of the knowledge representation facilities of King Kong a transportable natural language system. The thrust of the paper is towards demonstrating how the particulars of Kong's representation language support the processing of key phenomena of natural language. To this extent, we cover Kong's terminological hierarchies; the logical language in which Kong encodes utterance meanings; and the query evaluator that interfaces Kong to expert system back ends. We focus particularly on King Kong's innovative treatment of relations, as this treatment provides the system with much of its language analysis strengths.
The LILOG knowledge representation system
Authors: Bollinger Toni , Pletat Udo
Published: January 2007

The LILOG knowledge representation system is part of LEU/2 - the LILOG Experimentier Umgebung
1
- a natural language understanding system for German. The knowledge representation system comprises a sophisticated knowledge representation system comprises a sophisticated knowledge representation language based on order-sorted predicate logic enriched by a type system of KL-ONE like languages, default reasoning, and the capability to delegate inferences to external deductive components. The inference engine processing
L
LILOG
can be considered as an experimental theorem proving shell since, for example, we are able to exchange inference calculi and search strategies very easily. We sketch the knowledge representation language
L
LILOG
, give an overview of the internal architecture of the LILOG inference engine, and show how the inference engine is embedded into the natural language understanding system LEU/2.
The MVL theorem proving system
Authors: Ginsberg Matthew L.
Published: January 2007

The MVL theorem-proving system is an implementation of theoretical work currently under way at Stanford University. Theoretical progress made there is regularly included in MVL in order to ensure that the ideas developed theoretically can be tested experimentally as well.
A concise presentation of ITL
Authors: Guarino Nicola
Published: January 2007

ITL (Intensional Terminological Language) is a Prolog-based language derived from our previous work on DRL. Like LOGIN, it improves the expressive adequacy of Prolog by the introduction of a separate theory, which represents the sortal structure of the domain. This theory is linked to the object theory by a simple form of order-sorted unification. Differently from LOGIN, however, ITL sorts are not complex structures similar to KLONE concepts. The reason is that ITL is not based on generic descriptions: roles (we call them attributes) are represented as independent concepts, which contribute to the structure of more complex concepts through separate statements expressing necessary conditions, sufficient conditions or structural constraints. The result is a fine-grained terminological language, whose syntax resembles in some way OMEGA. Yet, differently from OMEGA, this language does not have the full power of first order logic. It has however an intensional semantics, which we consider as an important characteristic of terminological knowledge. In this paper we briefly discuss the rationale behind ITL, and present its major characteristics.
First experiences with the SB-ONE knowledge representation workbench in natural-language applications
Authors: Kobsa Alfred
Published: January 2007

SB-ONE is a workbench for the representation of conceptual knowledge, with the emphasis on applications in natural-language systems. Besides the SB-ONE language, the workbench comprises three different interfaces, a partition mechanism, a consistency maintenance system for the syntactic well-formedness of SB-ONE knowledge bases, a classifier, a realizer, a pattern matcher, a spreading-activation mechanism, an interpreter and classifier for SB-ONE to SB-ONE translation rules, an integration mechanism for an external frame-based representation, and a connection between SB-ONE and an extended Prolog. These components have been employed by a fairly large number of people in various natural-language applications. This paper describes the SB-ONE workbench, illustrates the motivations and philosophies behind its components, and reports some feedback received from users.
Socratic sequent systems
Authors: McAllester David A.
Published: January 2007

This paper describes a general theoretical framework for constructing intelligent knowledge bases. The framework arises from the desire to construct powerful and efficient systems. Powerful in the sense that they drawn "deep" conclusions from the knowledge base, and efficient in that they give quick responses.
Local inference relation
are proposed as a way of constructing a variety of powerful yet efficient inference systems. Local Socratic sequent systems are proposed as a formal model of interactive knowledge bases based on local inference relations.
Providing paradigm orientation without implementational handcuffs
Authors: Shrobe Howard E.
Published: January 2007

Why is it hard to implement a Knowledge Representation or Reasoning tool that people actually use?
Epikit
Authors: Singh Narinder , Genesereth Michael
Published: January 2007

Epikit is a library of Common Lisp subroutines intended for use in the construction of programs that operate on databases encoded in Knowledge Interchange Format (KIF).The goals of Epikit are to provide a robust, portable, and efficient library of subroutines to support representation and reasoning methods based on Logic. The focus primarily is on first-order logic (FOL) with extensions to support meta-knowledge, i.e., knowledge about other expressions in the KIF language, and extensions to support the specification and interpretation of programs for intelligent control applications.
Book review: Semantic Foundations of Logic Volume 1: Propositional Logics by Richard L. Epstein With assistance and collaboration of Walter A. Carnielli Itala, M. L. D'Ottaviano, Stanislav Krejewski, Roger D. Maddux (Kluwer Academic Publishers, 1990)
Authors: Truszkowski Walt
Published: January 2007

This is not your typical book on logic. The novel tone of this book is established by the author's desire for unity among the various logics which have been introduced to date. The basic questions addressed by this book are: "If logic is objective how come there are so many logics? Is there one right logic, or many right ones? Is there some underlying unity that connects them?" [Preface] In answering these questions it becomes apparent that a major pre-occupation of the author lies with understanding and explaining the relationship between the truths of the logics, i.e. their theorems, and everyday reality and reasoning. In a nutshell the author develops and shares with the reader a process of abstraction from the natural language of everyday reasoning to a more formalized language of logic. This abstraction process is driven by the type of reasoning to be done. This basic process is responsible for the expanding collection of logics under study today. The author invites us to join him in exploring the underlying unity he is proposing as a basis for this abstraction process.
Book review: User Models in Dialog Systems Edited by A. Kobsa and W. Wahlster (Springer-Verlag, 1989)
Authors: Kruse Johnson
Published: January 2007

User Models in Dialog Systems is informative and thought-provoking. The book is based upon a user modeling conference held in 1986. Since then, the various contributors have obviously worked at adding tutorial and review material to the chapters to supplement the research reports. This is very useful, especially since the primary effect of the book will be to promote the idea that interactive software systems can eventually become intelligent partners in goal-directed dialogs with humans. The book is by no means an engineering handbook; it is primarily theoretical, but includes sketches of requirements specifications and feasibility demonstrations.
Book review: Common Lisp: A Gentle Introduction to Sympolic Programming by David S. Touretzky (Benjamin Cummings Publishing Co.)
Authors: Heger A. Share
Published: January 2007

Touretzky starts his book with the following statement: "This book is about learning to program in Lisp." He delivers his promise to his readers with clear instructions and many simple yet robust examples throughout the book. A partial list of features that separate this book from others are: emphasis on simplicity, use of evaltrace notation, description of several useful Lisp toolkits, and comprehensive representations for Lisp data structures. In addition, each chapter ends with a section on advanced topics. These sections have two purposes: to introduce advanced programming materials and to show computer programming in its broader mathematical and logical perspectives.
Checkers program to challenge for world championship
Authors: Schaeffer Jonathan , Culberson Joseph , Treloar Norman , Knight Brent , Lu Paul , Szafron Duane
Published: January 2007

The checkers program Chinook has won the right to play a 40-game match for the World Checkers Championship against Dr. Marion Tinsley. This was earned by placing second, after Dr. Tinsley, at the U.S. National Open, the biennial event used to determine a challenger for the Championship. At the event, and the preceding Mississippi State Open, Chinook drew a 4 game match against the World Champion and defeated the world's number 2, 4 and 6 players. This is the first time a program has earned the right to contest for a human World Championship. In a practice match played as a prelude to the World Championship match later this year, Dr. Tinsley narrowly defeated Chinook, 7.5--6.5
Are complete K-trees something more than decision trees?
Authors: Valiente Gabriel
Published: January 2007

I have just read the research report "Using Complete K-Trees to Generate Code in Pascal for an Expert System" by Dr. Edward N. Schwartz, appeared in
SIGART Bulletin
1(2): 12--13. The report first presents K-trees as an "implementation independent method of knowledge representation," useful "in all stages of expert system development." The idea of a complete K-tree is then introduced, in which all possible values of every property are explicitly recorded in the tree. As this is the central result presented in the report, I think it deserves some comments.
On a general framework for large-scale constraint-based optimization
Authors: Gu Jun
Published: January 2007

The explicit solution for the n–queens problem, mentioned in a letter from Bo Bernhardsson [2], is basically Pauls's solution analyzed by Ahrens (See reference [1] of our previous article in
SIGART
October issue 1990). The result was in public domain long before 1918 (not 1969). We also mentioned its weakness, namely: The class of solutions provided by analytical methods is very restricted, as Ahrens pointed out in [1]. They can only provide
one
solution for the
n
–queens problem and can not provide
any
solution (much better explicit solutions for the
n
–queens problem exist). This is not the case for search methods which can find, in principle, any solution. This distinction is crucial for practical applications of the
n
-queens problem.
Considered harmful—still
Authors: Bernecky Robert
Published: January 2007

The APL character set has contributed, more than any other facet of the language, to its lack of acceptance in the computing community at large. The character set is a metaproblem---not a problem in and of itself, but a creator of other recurring problems of hardware, software, ergonomics, and psychology. The adoption of new, ASCII-based dialects of APL, such as J, is suggested as one solution to the character-set problem.
Integrated Use of Expert Systems at the K-Tree Level
Authors: Chen Z. , AI-Schamma S.
Published: January 2007

In this paper, we discuss the integrated use of expert systems built from expert systems shells. We explain that this integration can be conceptually viewed as expert systems integration at the K-tree level. The relationship between our work and other work in distributed artificial intelligence is also examined.
Book review: Readings in Planning Edited by James Allen, James Hendler, and Austin Tate (Morgan Kaufmann, San Mateo, CA, 1990)
Authors: Hoebel Louis J.
Published: January 2007

Readings In Planning (RIP) is another volume in a fine series of anthologies published by Morgan Kaufman. This volume is a collection of previously published (save for one) papers on the subfield of artificial intelligence (AI) dealing with planning and the action. This volume presents many of the historically important papers while providing a general framework for study in this field.
Book review: Artificial Intelligence: Its Scope and Limits By James H. Fetzer (Kluwer Academic, Dordrecht, 1990)
Authors: Thimbleby Harold
Published: January 2007

This is the fourth book in the Kluwer Studies in Cognitive Systems series, itself edited by James Fetzer. The thesis of
Artificial Intelligence: Its Scope and Limits
is that the mental processes of animals, and humans in particular, are qualitatively different from digital machines. The so-called "Basic Model" of AI is, according to Fetzer, that minds are to brains what programs are to computers, and he argues that this view is flawed. This is a straight-forward argument but the book is not accessible to beginners in the field who might learn by exposure to the discussion. The text, indeed, seems at times to be deliberately abstract.
Book review: An Introduction to Default Logic by Philippe Besnard (Springer Verlag, New York, 1989)
Authors: Korb Kevin B.
Published: January 2007

One of Hubert Dreyfus's more biting criticisms of Artificial Intelligence has been that its success stories have been largely confined to toy environments. Some researchers are unperturbed by this criticism, apparently believing that an accretion of little success stories will eventually reward us with a cumulative global success story. Others have turned to renewed efforts to understand what Herbert Simon calls "weak methods" of inference, that is methods of inference which do not presuppose specific knowledge of a domain. I too believe that knowledge-poor methods of inference offer greater long-term promise for the development of AI. Philippe Besnard's book is a codification of efforts to formalize one species (genus?) of knowledge-poor reasoning, what has been variously called default, defeasible, and nonmonotonic reasoning.
Book review: Search in Artificial Intelligence Ed. by Laveen Kanal and Vipin Kumar (Springer-Verlag, New York, 1988)
Authors: Stefanski Pawel A.
Published: January 2007

The most recent addition to the well-known series "Symbolic Computation" which started in 1982 with the seminal volume by N.J.Nilsson "Principles of Artificial Intelligence" brings the reader a well-selected set of thirteen articles presenting the most important developments in the area of heuristic search and related research issues. Most of the articles in this volume were originally published in various journals during the last decade and were revised and edited for this publication. This volume will prove especially noteworthy for any researcher or student whose interests include traditional search techniques, optimization problems or constraint satisfaction. Some of the chapters (identified below) will also serve as an excellent tutorial introduction to various aspects of search, as seen from the artificial intelligence perspective, although it must be noted that almost all chapters require some degree of mathematical sophistication.
Book review: Natural Language Generation in Artificial Intelligence and Computational Linguistics Edited by Cecile L. Paris, William R. Swartout, and William C. Mann (Kluwer Academic, Dordrecht,1990)
Authors: Lytinen Steven L.
Published: January 2007

This book is a selection of papers presented at the
Fourth International Workshop on Natural Language Generation,
held in Catalina, California in July of 1988. If there is a central theme to this compilation of articles, it is that natural language generators are no longer relatively straightforward, mechanistic translators which produce text from an internal representation language. Rather, state-of-the-art theories of generation look very much like theories of planning. Many analogies can be made between the generation process and hierarchical planning. The first level of planning in most systems corresponds to the selection of an overall discourse structure. As planning continues, lexical selection is analogous to the task of operator selection. Each lexical choice imposes constraints on the rest of the "plan" which restrict further choices.
Book review: Intelligent Systems in Business: Integrating the Technology Edited by J. Jeffrey Richardson and Marjorie J. DeFries (Ablex, Norwood, N J, 1990)
Authors: Nielsen Norman R.
Published: January 2007

This book is a collection of 22 papers and represents the proceedings of a forum on "Increasing Management Productivity with Intelligent Systems" held in Snowmass/Aspen, Colorado, in August 1988. The proceedings are aimed at the managerial reader, and the content is intended to be relatively nontechnical. The purpose of these proceedings is "to help managers learn, not about techniques, but about applications of intelligent systems to the business problems of today" and to provide nontechnical "advice from others with some experience using these new systems." As in any collection of papers, individual contributors have followed the stated objectives to a greater or lesser degree.
An architecture for understanding in planning, action, and learning
Authors: Alterman Richard , Carpenter Tamitha , Zito-Wolf Roland
Published: January 2007

FLOABN is an integrated architecture for an intelligent agent that brings together planning, execution, learning, spatial reasoning, and the interpretation of instructions in natural language form. The system runs in an environment based on a discrete event simulation that models the temporal extent and sequencing of events and actions. Overall, the goal of this architecture is to facilitate the integration of several capabilities within an intelligent agent. This architecture supports the coordination of high-level mental activities with low-level hand-eye motor routines, with particular emphasis on the role of understanding.
Two ways to act
Authors: Anderson Scott D. , Hart David M. , Cohen Paul R.
Published: January 2007

We derive a simple mathematical model of the interaction of two tasks running concurrently on a uniprocessor. Specifically, we model the rate at which two periodic tasks will interrupt each other. The predictions of this model are supported by simulation experiments. From the model, we argue that placing reflexive control and cognitive control on different processors is not justified by the different time-scales over which they act, but is justified by the extent to which the higher priority task dominates the uniprocessor.
Integrating perception, action and learning
Authors: Antonisse Jim , Wechsler Harry
Published: January 2007

The construction of robots adequate for field operation requires the integration of planning, perception, and learning. The coordination of these technologies in the context of constraints of realtime, robust, and safe operation is leading to coupled representations of perception and action. We are developing a system that explores the use of Case-Based Reasoning techniques for inducing low-level, coupled representations of potential robot locations. These will subsequently be used for planning and possibly as operationality criteria in deriving efficient task description. This work is proceeding under an architectural design that integrates horizontal, subsumption approaches to building robots with the vertical Perception-Control-Action internal structure for each layer.
An integrated architecture for learning and planning in robotic domains
Authors: Barbehenn Michael , Hutchinson Seth
Published: January 2007

Our system, GINKO, is fully implemented and integrates aspects of Learning, Planning, Execution, Perception, and Robotics In short, from Robotics we take our domains and we borrow the notion of planning in configuration space. We use Machine Learning techniques to classify regions of configuration space according to their qualitative behaviors. This corresponds to learning the conditional effects of robot operators. Our planner generates an abstract plan of transitions between regions of qualitative behavior in the configuration space. A concrete plan is generated by augmenting the abstract plan with execution monitors that sense critical aspects of the situations to ensure that a particular plan is being followed and that the regions from which the plan was derived are accurately characterized.
Similarity-based cognitive architecture
Authors: Forbus Kenneth D. , Gentner Dedre
Published: January 2007

Similarity permeates human cognition. There is evidence that objects are categorized based partly on similarity to previous category members and that the likelihood of transfer is governed by the similarity between the original and current situations. New problems are often solved by analogy to prior problems. Similarity is responsible for many human errors, such as perceptual confusions and many recall intrusions; but at the same time, analogy and similarity are important in scientific discovery. Consequently, we are developing a cognitive architecture in which similarity computations play a central role. This is unlike most architectural approaches, which either do not treat analogy and similarity computations play a central role. This is unlike most architectural approaches, which either do not treat analogy and similarity at all, or relegate them to a subsidiary role, to be called in sporadically when other mechanisms are stuck. We are using Gentner's Structure-Mapping theory [12] as our framework for defining similarity computations.The rest of this note addresses the list of issues suggested by the symposium organizers.
An integrated architecture for intelligent agents
Authors: Hayes-Roth Barbara
Published: January 2007

Our research focuses on highly sophisticated intelligent agents having three key characteristics requiring integration:* Adaptivity. An intelligent agent interacts with--influences and is influenced by--other dynamic entities in its environment. It perceives data from the environment, reasons to interpret perceptions, solve problems, make decisions, etc., acts to affect external entities and to achieve its goals. To keep pace with external events and avoid missing important demands and opportunities for action, the agent performs these functions asynchronously, concurrently, and selectively. Nonetheless, these functions must be integrated. Perception must inform reasoning and action. Reasoning must guide perception and action. Action must feed back on perception and reasoning.
Evaluation of integrated agent architectures
Authors: Hayes-Roth Barbara
Published: January 2007

In evaluating an integrated agent architecture, there are various questions we might hope to answer:Does the architecture provide a sufficient framework for meeting the stated requirements?
Plan-then-compile architectures
Authors: Mitchell Tom M.
Published: January 2007

Several architectures have recently been developed which integrate planning, reacting, and knowledge compilation learning, in order to improve system reactivity while retaining system flexibility. This paper assesses strengths and weaknesses of such Plan-Then-Compile architectures, by analyzing one such architecture, Theo-Agent [Mitchell 90]. We describe capabilities and limitations of the Theo-Agent, and use these to try to understand the generic capabilities and limits of Plan-Then-Compile architectures more generally.
A distributed, decision-theoretic control system for a mobile robot
Authors: Ogasawara Gary H.
Published: January 2007

A model is described that divides an agent architecture into five components (percepts, decomposition, strategies, arbitration, actions). Using this model and a decision-theoretic perspective on the agent's behavior, the resultant agent is both flexible and rational. A mobile robot control system that uses the agent architecture model is described in some depth. The mobile robot operates in a simulated, 2-D environment with fixed and moving obstacles and a limited and noisy vision sensor. A formal, comparative analysis of agent architecture classes concludes this paper.
An architecture for bounded rationality
Authors: Russell Stuart J.
Published: January 2007

This paper is specifically concerned with the topic oflimited rationality--- the generation of utility-maximizing behaviour in a non-static environment by a system with finite computational resources. The design of the RALPH (Rational Agent with Limited Performance Hardware) architecture aims to tie together, in a unified theoretical framework and a single system design, three strands of research relevant to this problem: the study ofmetareasoningprocedures, that is, decision procedures that select computations to direct the course of another decision procedure; thecompilationof decision processes that explicitly maximize utility into efficiently-executable policies and goals, and their integration into the decision procedure; and the generation ofplanningbehaviour, directed towards an explicitly-represented goal, in the context of decision theory. Decision procedures are implemented by four distinctexecution architectures,running in parallel, each characterized by the types of knowledge employed. Only fragments of the architecture are currently implemented, but some progress has been made on the individual topics.
Dyna, an integrated architecture for learning, planning, and reacting
Authors: Sutton Richard S.
Published: January 2007

Dyna is an AI architecture that integrates learning, planning, and reactive execution. Learning methods are used in Dyna both for compiling planning results and for updating a model of the effects of the agent's actions on the world. Planning is incremental and can use the probabilistic and ofttimes incorrect world models generated by learning processes. Execution is fully reactive in the sense that no planning intervenes between perception and action. Dyna relies on machine learning methods for learning from examples---these are among the basic building blocks making up the architecture---yet is not tied to any particular method. This paper briefly introduces Dyna and discusses its strengths and weaknesses with respect to other architectures.
Organization of the basic agent
Authors: Vere Steven A.
Published: January 2007

The Basic Agent is an attempt to create a conscious, mindlike AI artifact embedded in time and functioning in a simulated dynamic environment. The agent integrates temporal planning, temporal reasoning, reactive replanning, action execution, limited natural language understanding and generation, symbolic perception, episodic memory and reflection, and some general knowledge associated with the vocabulary items. A state-change style semantics for action verbs, based on a set of primitive relations, allows convenient integration of the natural language and planning components. The architectural elements of the system and their interaction are described.
Finding circular relationships in networks
Authors: Fordyce Kenneth , Jantzen Jan , Sullivan Gerald
Published: January 2007

A critical computational requirement for many of the decision technologies in the fields of MS/OR, AI/KBS, and DSS is the development and manipulation of a network describing the relationship between "actors" involved in the application of the decision technology to a specific problem. The manipulation of such networks using Boolean arrays and functions is well known in the APL community (see bibliography). Often in such networks it is important to identify circular conditions as a preprocessing step, but the techniques to accomplish often yield incomplete information. This paper describes a simple and efficient method to find all circular conditions as a preprocessing step.This paper is a subset of a longer paper (Fordyce, Jantzen, and Sullivan, 1990) which describes how we can fully build and manipulate a function network with Boolean arrays including focusing networks, finding circular conditions, and grouping functions based on relative independence to identify parallel computational opportunities and substantially reduces the non-procedural aspect of the problem.
Book review: Case-Based Planning: Viewing Planning as a Memory Task by Krlstian J. Hammond (Academic Press, 1989)
Authors: Wurst Karl R.
Published: January 2007

Much of the research at the Yale AI Lab relates to the investigation of memory. Learning and reminding form the basis of case-based reasoning in general and case-based planning (CBP) in particular. By remembering past successes and failures in planning, a planner may reduce much of its work to retrieving previously used plans and applying the to the situation at hand.
Book review: Cognitive Engineering in Complex Dynamic Worlds. Edited by E. Hollnagel, G. Mancini, & D. Woods (Academic Press)
Authors: Henninger Scott
Published: January 2007

This book is a compendium of papers that resulted from a workshop composed primarily of European human factors researchers. The same articles were previously published in a special issue of the
International Journal of Man-Machine Studies
(November/December 1987). It is organized into three sections: the first addresses issues in the design of cognitive tools, the second describes models of decision makers in accident conditions, and the third section addresses knowledge representation. Each section is concluded with an overview and a commentary section written by one of the editors. The quality of the papers vary, with papers authored or co-authored by one of the editors being the best quality.
Book reviews: Computer-Aided Financial Analysis by Ross M. Miller (Addison-Wesley)
Authors: Ferrante Rich
Published: January 2007

According to the author "This book is designed to serve as a bridge between finance and computer science." It emphasizes "those situations that are sufficiently complex that they cannot be adequately analyzed without a computer." The book is intended as a textbook for courses bridging the gap between computer science and financial analysis. It starts at the basics for each subject and quickly builds to interesting material of useful complexity.
Book review: Philosophical Logic and Artificial Intelligence. Edited by Richmond H. Thomason (Kluwer Academic Publishers, 1989)
Authors: Doyle Jon
Published: January 2007

This book represents a welcome departure from the past. Many readers in AI avoid looking at books on philosophy and artificial intelligence, at least after seeing one or two of the genre. The reason for this disinterest is aptly captured by Thomason in his introduction to the present volume, which expands on a special issue of the
Journal of Philosophical Logic
published in 1988.
A Review Of Artificial Intelligence In Simulation
Authors: Tsatsoulis Costas
Published: January 2007

The recent surge of interest in Expert Systems and Artificial Intelligence (AI) has led many simulation researchers to point out the similarities between AI and simulation methodologies, and to commence efforts to combine the two, thus improving both. This survey will discuss the current state-of-the-art of applying AI to simulation, and will present a detailed picture of research completed and in-progress.
PCF parallel Fortran extensions
Authors: The Parallel Computing Forum CORPORATE
Published: January 2007

This proposed standard was constructed as an effort to provide a uniform spelling of well understood parallel constructs. There was a conscious effort to resist the lure of new constructs unless the evolutionary path from existing practice was clear.
Utilization of the career anchor/career orientation constructs for management of I/S professionals
Authors: Crook Connie W. , Crepeau Raymond G. , McMurtrey Mark E.
Published: January 2007

Management of I/S personnel has consistently ranked among the top concerns of MIS management. Similarly, from the employee's perspective, there are indications that the lack of attention to careers and career planning is a key problem facing I/S personnel. These issues are addressed by further investigating the "career anchor" or "career orientation" concept developed by Schein (1978) and expanded by DeLong (1982). Crepeau et al. (1990) confirmed the existence of career anchors/orientations for I/S personnel. In the present study the discriminatory power of the career anchors among I/S job types, gender, and years of experience is analyzed. Though statistical results were marginal, the authors conclude that it may be more productive for managers to focus on those anchors which do not discriminate in order to better match employers' and employees' career objectives.
Constraint sensitive scheduling in RASP
Authors: Baldwin Doug , Hitchings Hamilton
Published: January 2007

We describe the scheduling algorithm with which the RASP circuit synthesizer meets constraints. Because RASP makes an unusually large number of design choices, it uses a local cost-based scheduler. Nonetheless, experimental tests suggest that the scheduler produces a wide range of designs, handling both area and timing constraints very well.
Base-value in actuarial practice
Authors: Karman Jan
Published: January 2007

In this paper, only one APL primitive is involved: decode (⊥). Decode (or base-value) gives us the evaluation of a polynomial. The life annuity, which is of crucial importance in actuarial practice, is a polynomial, and it is plausible that the APL primitive decode is very useful in this respect.The paper starts with an introduction in the fundamentals of mortality tables, continues with the derivation of the life annuity and finally comes to an extremely powerful use of the base-value primitive.It is emphasized that the actuarial theory in general is applicable to any kind of large population, whether consisting of light bulbs, refrigerators, television sets, motor cars, or books in a library [1]. For instance, replacement of consumer durables in case of break-down within a guarantee period is a term insurance.Further, a term insurance, as almost any contract of life insurance, can be expressed as a function of a life annuity.
The role of the activity adjacency matrix in the critical path method
Authors: Lin Edward Y. H.
Published: January 2007

This paper introduces the use of an activity adjacency matrix in the critical path method to avoid the confusion created by converting the project into its network representation, particularly in performing the cost time trade-offs. A set of APL code was developed to illustrate this point.
Book review: SOFTWARE PROTYPING, FORMAL METHODS AND VDM by Sharam Hekmatpour and Darrel Ince (Addison-Wesley, 1988)
Authors: Groves Lindsay
Published: January 2007

This book is about rapid software prototyping based on formal methods. The first three chapters comprise an introduction to rapid prototyping, beginning with an examination of the traditional software life-cycle and the problems which motivate the need for rapid prototyping, followed by a review of current approaches and techniques. The remaining seven chapters and the two appendices describe and illustrate a particular prototyping methodology and a prototyping environment, called EPROS, which supports this methodology.
Book review: COMPUTERS IN THE HUMAN CONTEXT. Ed. by Tom Forester (MIT Press, 1989)
Authors: Alexander Lynne
Published: January 2007

This collection of 43 articles presents a variety of opinions on how information technology (IT) affects humankind. The editor chose articles representing contrasting opinions on many themes and issues. The articles offer historical and philosophical perspectives on IT. Most offer or imply suggestions on directions for the future use and development of IT. Most of the articles are reprints from other publications.
The universe of design is unfolding (as it should!)
Authors: Carter Jim
Published: January 2007

This is a brief report of the discussion in one of the subgroups from the "Taking Design Seriously" Workshop at CHI'90. The "Cosmic Glue" subgroup organized around the concept that there needs to be something at a higher level than the "Design Process(es) of HCI". This higher "Cosmic Glue" should lead towards systems that actually (rather than only theoretically) satisfy their users and their purposes for being.
Report on the CHI'90 workshop on structure editors
Authors: Neal Lisa , Szwillus Gerd
Published: January 2007

Although work on structure editors has been going on for almost twenty years, the designers and users of syntax-directed editors and graphical structure editors had never met to reflect on these tools' past, present, and future. The CHI'90 Workshop on Structure Editors was organized for the purpose of examining structure editors from a human-computer interaction perspective. We also hoped to increase the intersection between the programming environment and human-computer interaction communities.
Trip report
Authors: Beuschel Werner , Pickering Jeanne
Published: January 2007

The conference was sponsored by CPSR (Computer Professionals for Social Responsibility) and its Workplace Project in Palo Alto and held at the University of Washington in Seattle, March 31 and April 1, 1990. Almost 200 people attended the six invited talks, a panel and ten workshops. It was the first conference of its kind in the United States.
The standards factor
Authors: Billingsley Pat
Published: January 2007

Regular readers of
Standards Action
, a bi-monthly publication that lists draft national and international standards available for comment, may have seen the following notice above the listing for some draft standards in the "Information Technology" section:NOTE: This draft standard is being submitted simultaneously as an International Standard and an American National Standard.
UIST '90, the annual symposium on user interface software and technology
Authors: Cohen Ellis S.
Published: January 2007

UIST,
the
ACM Annual Symposium on User Interface Software and Technology,
is the flagship conference for those interested in constructing innovative systems that explore ideas which are at the heart of evolving user interfaces.
Usability metrics and methodologies
Authors: Nielsen Jakob
Published: January 2007

The British Computer Society's human-computer interaction specialist group sponsored a one-day seminar on usability metrics and methodologies in connection with its 1990 annual meeting in London. The seminar was organized by Nigel Bevan from the National Physical Laboratory and attracted an audience of about 80 people. The lively discussions during the seminar and the tea breaks indicated substantial interest in the issues of usability engineering.
Report on the interact '90 workshop on education in HCI
Authors: Mantei Marilyn M. , Hewett Thomas
Published: January 2007

This report describes the discussions and outcomes of a workshop on education held on August 27, 1990, at the INTERACT' 90 Conference in Cambridge, England. The workshop and its outcomes are significant because of the nature of the attendees. Participants had developed or were developing a curriculum in HCI for each of their countries. Thus, the workshop brought together experts on HCI curriculum to explore the differences that each of their cultures and university systems would place upon the interpretation and presentation of HCI.
CHI'90 workshop on visual interfaces to geometry
Authors: Kuhn Werner , Egenhofer Max J.
Published: January 2007

The purpose of this interdisciplinary workshop was to explore and integrate advanced approaches to the visual representation and interactive manipulation of geometric information. The approach taken was to establish desirable properties of interfaces, identify problems in achieving them, and suggest new approaches to solve these problems, in order to improve the communication between users and systems when dealing with geometric information.
Information exchanges patterns in a computer-supported cooperative work environment
Authors: Cook Gary J. , Dunn Cheryl L. , Grabski Severin V.
Published: January 2007

Software for supporting cooperative work, or groupware, is an approach for increasing project team productivity by changing the way team members work and communicate with each other. Since groupware use can be influenced by various individual, team, and organizational factors, empirical research is needed to "... study the flow of members' interaction to discover the impact the technology is having on the nature of the group's cognitions, actions, and feelings, and the relationship between these attributes of information exchange and decision outcomes (DeSanctis and Gallupe, 1987, p. 603)." The objective of this study is to examine patterns of computer-supported information exchange in a cooperative work environment. The environment requires colleagues to work together to complete a project within a specified time frame. The patterns of information exchange observed should provide insight into what aspects of groupware are perceived as helpful by users, and provide directions for further research.
A rational function arithmetic and simplification system in common Lisp
Authors: Yan Tak W.
Published: January 2007

We describe a multivariate rational function (ratio of polynomials) arithmetic simplification system written in Common Lisp. These programs form one module in a sequence of packages written with an aim to develop an efficient, freely-distributed computer algebra system. In this report, we discuss the representation of rational functions in the system and the programs for rational addition, multiplication, and exponentiation. We also describe a package that converts between expressions in Lisp prefix form and the representation of rational expressions in the system.
A program computing the homology groups of loops spaces
Authors: Rubio Julio , Sergeraert Francis
Published: January 2007

The object of this note is to describe the second version of a program allowing in theory the possibility of calculating the homology groups of iterated loop spaces
H

q

(Ω

p

X;
Z
) (solving every extension problem) if
X
is a reduced simplicial set with effective homology the skeleton of which begins in dimension
p
+1. It is understood, bearing in mind the hyper-exponential complexity of the algorithm, an overambitious choice for
q, p
and
X
would not allow the obtaining of a result in a reasonable time. But several examples of calculations already made with the help of this program show that it is possible to find groups, which up until now, have seemed to be inaccessible.
A maple program for proving hypergeometric identities
Authors: Zeilberger Doron
Published: January 2007

In [Z1](see also [Z2],[WZ],[S],[Ci]) I gave an algorithm for proving any terminating definite hypergeometric identity, and more generally, for finding the linear recurrence satisfied by any definite hypergeometric sum[EQUATION]
A toolkit for manipulating indefinite summations with application to neural networks
Authors: Wang Dongming
Published: January 2007

In this paper we present the design and implementation of a toolkit in MACSYMA for the manipulation of indefinite summations which is of interest and commonly used in mathematical derivations. The differentiation and integration of indefinite summations with respect to indexed variables are considered in particular. The development of this toolkit was motivated by and has its major purpose for our investigation in the computer aided analysis and derivation of artificial neural networks. The application of the toolkit to this subject is briefly discussed.