bluuebunny/crossref_metadata_2025 huggingface dataset:
Design of a production system for cognitive modeling
Authors: Anderson John R. , Kline Paul J.
Published: January 2007

It is conjectured that a good cognitive psychology theory will lead to a good artificial intelligence (AI) program. If this is true there should be a convergence of psychological and AI considerations in theory construction. This convergence is illustrated in terms of ACT, a computer simulation model of cognitive processes. Separate AI and psychological considerations are used to motivate the decision to design ACT as a production system operating on an network data base. Similar motivation is provided for other features of ACT implemented within this framework. These features include the use of a propositional structure for the associative network, a spreading activation process operating on the network, the simulated ability to execute several procedures in parallel, and the use of strength measures to select among competing productions and competing paths in the network.We have been working on a production system model of human cognition called ACT. An earlier version of the ACT system, called ACTE, is described in Anderson [3], Anderson, Kline, and Lewis [5], and Kline and Anderson [2]. That system has been used to develop mini-models for retrieval from memory, inference making, language comprehension, question-answering, and problem solving. We are currently working on a new version of ACT called ACTF. This paper discusses a number of the design decisions underlying the ACT system. We will discuss how these design decisions are motivated by both psychological and artificial intelligence (AI) considerations.
Implications of human pattern processing for the design of artificial knowledge systems
Authors: Hayes-Roth Barbara
Published: January 2007

Artificial knowledge systems typically embody several design principles that are also widely accepted as characteristic of human knowledge processing. These properties include: canonical meaning representations for stored patterns; prototypes as representations of classes of stored patterns; pattern matching processes that must evaluate fully all stored patterns that partially match a target pattern; and pattern matching processes that are influenced by pattern complexity and limited processing capacity. This characterization of human pattern processing is critically evaluated in light of recent psychological studies. The implications of these results for the design of artificial knowledge systems are discussed.
Inferential searches of knowledge networks as an approach to extensible language understanding systems
Authors: McDonald David , Hayes-Roth Frederick
Published: January 2007

A program has been constructed that implements some inference schemes for inferring the meaning of noun-noun, adjective-noun, and agent-verb-object phrases from the constituent words. Dictionary definitions of words are input directly into a semantic network using a context free grammar implemented in a production system. To interpret a novel phrase (e.g., lawn mower, car tire, car wheel) semantically, an intersection search originating from the nodes representing the constituent words is performed in the semantic network. If an intersection is found, a meaning for the phrase is produced; otherwise the phrase is not interpreted. During this interpretation, only knowledge provided by dictionary definitions and parts of speech of words is used.
A goal-directed production system for story understanding
Authors: Schank Roger C. , Wilensky Robert
Published: January 2007

Using knowledge to make inferences is a crucial aspect of natural language processing. While the notion of a script has been useful in this regard, other forms of knowledge are also needed. In particular, knowledge about goals and knowledge about stories is crucial for story understanding. The understander must know what types of goals characters in a story can have so as to be able to interpret their behavior. Knowledge about the point of a story is needed to direct the understanding process. These forms of knowledge can best be applied by means of hierarchical production system.
An expectation-driven production system for natural language understanding
Authors: Riesbeck Christopher K.
Published: January 2007

ELI, the English language interpreter for the SAM story understanding system at Yale, is a model of language understanding using productions. Productions are useful because they are flexible, but this flexibility means more work has to be spent controlling and manipulating them. ELI limits the number of productions that have to be manipulated with expectations. Expectations are constraints generated by frame structures that have been built by previously executed productions. Only productions that satisfy existing expectations are used.
On the use of programming knowledge to understand informal process descriptions
Authors: Balzer Robert , Goldman Neil , Wile David
Published: January 2007

The goal of improving and simplifying communication with computers has been pursued largely through the creation and use of better formal languages. This paper investigates an alternative approach by exploring the variety and extent of informal constructs which can be introduced into a formal language without impairing communication. These informal constructs represent the suppression of certain explicit information which must be inferred from the surrounding context.In general, each informal construct has several possible interpretations, only one of which was intended by the speaker. The system's task is to use the existing context to focus attention on a small ordered subset of the most probable alternatives and to further reduce it by applying any constraints or well-formedness rules. The most probable remaining alternative is selected as the intended one.Program descriptions were chosen as the example task domain to test this approach because its rules of context and well-formedness are fairly well developed and because we, as computer scientists, are our own domain experts.
The inference of domain structure from informal process descriptions
Authors: Goldman Neil , Balzer Robert , Wile David
Published: January 2007

Understanding informal descriptions of processes requires access to a body of knowledge about the process domain, and the ability to use that knowledge appropriately. A great deal of effort has been spent in developing methods for organizing and using domain knowledge; relatively little has been done to automate acquisition of such knowledge.Since English process descriptions reflect the underlying structure of the process domain, knowledge about that structure may be inferred from the description itself. A categorization of important structural knowledge classes is presented, and a production system described which interprets English statements on the basis of existing structural context. A sample of the rules from this system is examined. By assuming conditions required in the rule patterns when a linguistic structure is not interpretable, it is possible to infer a great deal of structural knowledge about a process domain. This incremental growth of domain structure presents an alternative to constructing process understanding systems applicable only to very restricted domains, or requiring extensive additions of domain specific knowledge by human experts for each new task.
A production system for speech understanding
Authors: Mostow David Jack , Hayes-Roth Frederick
Published: January 2007

A production system was developed for syntactic and semantic processing within the Hearsay-II speech understanding system. The major properties of the system are discussed, including (1) conversion of static language descriptions into productions, (2) compilation and data-directed execution of productions, (3) dynamically modifiable thresholds on goodness of pattern matches, (4) partial matching, and (5) representation and integration of bottom-up, top-down and horizontal searches. Several weaknesses of the production system paradigm in this application appeared during the course of this research. These arose from (1) the arbitrariness of canonical decompositions of patterns into subpatterns, (2) insufficient use of contextually confirming evidence for individual hypotheses due to the narrowness (literality) of monitored conditions, and (3) difficulty in evaluating the varying import of the same generic action in different contexts. Thus, while the uniformity and lack of explicit organization of production systems are touted as their most desirable features, attendant difficulties of dynamically organizing and controlling coherent problem solutions must be seriously considered in problem domains requiring careful allocation of computational resources.
Pattern recognition and pattern-directed inference in a program for playing go
Authors: Reitman Walter , Wilcox Bruce
Published: January 2007

Skilled human go play presumes the ability to recognize and make inferences from many different kinds of complex patterns. The go playing program described here deals with these various pattern recognition activities in terms of a small set of basic scanning and recognition mechanisms. All of the program's inference processes are defined with respect to these mechanisms.
Believer project
Authors: Schmidt Chuck , Sridharan N. S.
Published: January 2007

Understanding actions involves inferring the goal of the actor and organizing the actions into a plan structure. The BELIEVER system is a psychological theory of how human observers understand the actions of others. The present theory is concerned with single-actor action sequences and can account for goal-directed actions that may succeed or fail in accomplishing the goal, as well as actions governed by norms. Arguments are presented which show that the human process of plan recognition cannot be modeled using a generate and test paradigm. A paradigm, referred to as the
hypothesize and revise
paradigm, does capture important properties of human plan recognition performance. Our implementation of a plan recognition process using this paradigm is presented and discussed.
Indirect speech acts
Authors: Brown Gretchen P.
Published: January 2007

1. A characterization of the forms that may be used to convey particular speech acts.2. A description of mechanism(s) to relate surface forms to underlying speech acts.3. An account of the conversational implications of choosing a particular surface form.For a theory to adequately deal with indirect speech acts, it must contain at least the following components:
Interacting plans
Authors: Bruce Bertram C.
Published: January 2007

The paper presents a notation system for the representation of Interacting plans and applies it in the analysis of a small portion of "Hansel and Gretel". The essential problem for the notation system can be stated as follows: How do we represent the plans that determine behavior in a way that explicates
Interactions
among plans? As the examples Illustrate, the problem is not just to show how cooperation takes place, how conflicts arise and are resolved, how beliefs about plans determine actions, and how differing beliefs and intentions make a story. The system incorporates ideas from work on simple, or non-interacting plans, but the focus is on plans in a social context.
The communication of plans in different media
Authors: Rubin Andee
Published: January 2007

Discussions of the task of plan recognition are often carried out without explicit consideration of the
medium
in which the information is presented. Some researchers talk of inducing a plan from a sequence of observed actions, others of figuring out plans as a participant in a conversation, still others of understanding character's plans in a story. The analysis presented here focuses on the medium differences among these experiences in an attempt to pinpoint what clues exist in each medium for plan recognition.
Review of "Computers, Computers, Computers: In Fiction and In Verse, by D. Van Tassel"; Thomas Nelson, Inc
Authors: Mulligan James
Published: January 2007

Dennie Van Tassel has collected 16 short stories about computers. The stories are by famous writers such as Art Buchwald, Frederic Brown, Robert Heinlein, Bob Elliot and Ray Goulding. Sometimes the computer is just a tool as in "2066: Election Day". In this story a computer gives tests to all individuals who want to be president of the U.S. But since the president's job has become more difficult the computer has made the test so difficult that no one person passes the test.
Cooperative computing based on dyalog APL and the R statistical system
Authors: Skomorokhov Alexander , Kutinsky Vladimir
Published: January 2007

This article describes the implementation of a simple interface between Dyalog APL and the R statistical system in order to build a powerful tool for statistical computations and complex data analysis. We start by building the interface by means of a DCOM server, and go on to examples of using the interface, including calls to R functions from within the Dyalog APL session. Then we move on to graphical representation of different kinds of plots, including 3D plots, and examples of the joint use of Dyalog APL and R libraries. In conclusion, an example of a more complex tree based data analysis and the comparative analysis of the use of similar functions written in Dyalog APL are discussed.
Duplicate bridge match point scoring with APL
Authors: Mansour Stephen M.
Published: January 2007

Duplicate bridge differs from Rubber Bridge because the pairs are scored not on how many tricks they take, but on how well they play the same hand compared to others. Thus, a pair, which manages to take one more trick than every other pair, will score well even with a poor hand; whereas a pair who can easily take all the tricks and doesn't bid a grand slam will score poorly.
Hyperbolic symmetry
Authors: McEwen Robert A.
Published: January 2007

Hyperbolic symmetry has been explored by mathematicians and artists as an outlet that can produce aesthetically appealing images with an underlying mathematical structure. In particular, the artist M. C. Escher has utilized the techniques of hyperbolic symmetry to generate his circle limit drawings. These images contain a central pattern, which is repeated outward while decreasing in size. To create these images, Escher utilized the circular Poincare model of the hyperbolic plane [5]. This model provides the basis for this paper's purpose: exploring families of hyperbolic attractors generated when combinations of maps with hyperbolic symmetry and affine structure are mixed.
What's news
Authors: Van Batenburg Eke
Published: January 2007

Dear APL friends,Several years ago I started this column What's Where to show APL programmers the variety of places where APL is applied. Recently I decided not to continue this activity. So this is my last contribution. Actually it is
your
contribution, because I did not do anything more than collecting stories and it was Jon McGrew who put in a lot of work in enhancing each topic with a nice illustration. So I thank you for your contributions in the past and I thank Jon for enhancing this column with his nice illustrations.
Information diffusion through blogspace
Authors: Gruhl D. , Liben-Nowell David , Guha R. , Tomkins A.
Published: January 2007

We study the dynamics of information propagation in environments of low-overhead personal publishing, using a large collection of WebLogs over time as our example domain. We characterize and model this collection at two levels. First, we present a macroscopic characterization of topic propagation through our corpus, formalizing the notion of long-running "chatter" topics consisting recursively of "spike" topics generated by outside world events, or more rarely, by resonances within the community. Second, we present a microscopic characterization of propagation from individual to individual, drawing on the theory of infectious diseases to model the flow. We propose, validate, and employ an algorithm to induce the underlying propagation network from a sequence of posts, and report on the results.
Learning to extract information from large domain-specific websites using sequential models
Authors: Sarawagi Sunita , Vydiswaran V. G. Vinod
Published: January 2007

In this article we describe a novel information extraction task on the web and show how it can be solved effectively using the emerging conditional exponential models. The task involves learning to find specific goal pages on large domain-specific websites. An example of such a task is to find computer science publications starting from university root pages. We encode this as a sequential labeling problem solved using Conditional Random Fields (CRFs). These models enable us to exploit a wide variety of features including keywords and patterns extracted from and around hyperlinks and HTML pages, dependency among labels of adjacent pages, and existing databases of named entities in a unified probabilistic framework. This is an important advantage over previous rule-based or generative models for tackling the challenges of diversity on web data.
Mining semantics for large scale integration on the web
Authors: Chang Kevin Chen-Chuan , He Bin , Zhang Zhen
Published: January 2007

The Web has been rapidly "deepened" -- with myriad searchable databases online, where data are hidden behind query interfaces. Toward large scale integration over this "deep Web," we are facing a new challenge- With its dynamic and ad-hoc nature, such large scale integration mandates
dynamic semantics discovery.
That is, we must
on-the-fly
cope with "semantics" of dynamically discovered sources without pre-configured source-specific knowledge. To tackle this challenge, our initial works hinge on the insight that the large scale is itself also a unique opportunity: We observe that the desired "semantics" often connects to surface presentation characteristics, through some hidden regularities over many sources. Such regularities can be essentially leveraged in enabling semantics discovery. In particular, we report our evidences in three initial tasks for integrating the deep Web:
interface extraction, schema matching
, and
query translation.
Generalizing these specific evidences, we thus propose our "unified insight" of "mining" semantics for large scale integration by exploiting hidden regularities across holistic sources. Further, to fulfill the promise of such holistic mining, we discuss challenges toward its realization for dynamic semantics discovery. As our initial works as well as several related efforts have witnessed, we believe our unified insight, holistic mining for semantics discovery, is a promising methodology toward enabling large scale integration.
Quick and dirty quantum predictions with FIRMplus
Authors: Lambert Christophe G. , Grover James E.
Published: January 2007

In this paper, we describe our approach to the Quantum Physics classification problem posed in KDD Cup 2004. We used our FIRMplus recursive partitioning random tree approach to classify the two particle types. We spent almost no time tuning parameters, which made our 3
rd
place finish somewhat surprising.
A workshop report
Authors: Hotho Andreas , Sure York , Getoor Lise
Published: January 2007

The international workshop on Mining for and from the Semantic Web (MSW) at the KDD 2004 successfully brought together people from the communities Semantic Web and Knowledge Discovery. The goal of the workshop was to strengthen the communication and interaction between these communities as there is currently an agreement that both can benefit largely from each other. Overall the contributions and discussions showed that today mining
for
the semantic web is the primarily targeted research area. However, with a growing amount of available semantic web data also mining
from
the semantic web will be more prominent.
Report on BIOKDD04
Authors: Zaki Mohammed J. , Morishita Shinichi , Rigoutsos Isidore
Published: January 2007

BIOKDD'04 was held in conjunction with the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, in Seattle, WA, in August 2004. There are numerous sources of biological data that provides challenging opportunities for data mining. For example, the structural genomics initiative aims to catalog the structure-function information for proteins. Advances in technology such as microarrays have launched the subfield of genomics and proteomics to study the genes, proteins, and the regulatory gene expression circuitry inside the cell. Other sources of data include the rapidly growing literature in bioinformatics (e.g., PubMed), the data on biochemical pathways, the evolutionary relationships among organisms in the Tree of Life, high throughput drug design combinatorial libraries, and so on. In addition to the data from biology and genomics, there are rich sources of data from other biosciences, including biomedical, and neuroscience data.
Data mining standards, services, and platforms 2004 (DM-SSP 2004)
Authors: Grossman Robert
Published: January 2007

This is a summary of the workshop on Data Mining Standards, Services and Platforms, which was held at KDD 2004. The Workshop contained talks on the Predictive Model Markup Language (PMML) and the Java standard for data mining JSR-73. It also contained talks on emerging service-based architectures for data mining. Finally, infrastructures for privacy preserving data mining were also discussed.
Fine grain performance evaluation of e-commerce sites
Authors: Andreolini Mauro , Colajanni Michele , Lancellotti Riccardo , Mazzoni Francesca
Published: January 2007

E-commerce sites are still a reference for the Web technology in terms of complexity and performance requirements, including availability and scalability. In this paper we show that a coarse grain analysis, that is used in most performance studies, may lead to incomplete or false deductions about the behavior of the hardware and software components supporting e-commerce sites. Through a fine grain performance evaluation of a medium size e-commerce site, we find some interesting results that demonstrate the importance of an analysis approach that is carried out at the software function level with the combination of distribution oriented metrics instead of average values.
Ranking configuration parameters in multi-tiered e-commerce sites
Authors: Sopitkamol Monchai
Published: January 2007

E-commerce systems are composed of many components with several configurable parameters that, if properly configured, can optimize system performance. Before upgrading existing systems to overcome performance bottlenecks, several areas of a site's architecture and its parameters may be adjusted to improve performance. This paper provides a method to rank key configurable e-commerce system parameters that significantly impact overall system performance, and the performance of the most significant Web function types. We consider both on-line and off-line parameters at each of the e-commerce system layers: Web server, application server, and database server. In order to accomplish our task, we designed a practical, ad-hoc approach that involves conducting experiments on a testbed system setup as a small e-commerce site. The configurable parameters are ranked based on their degrees of performance improvement to the system and to the most critical Web functions. The performance metrics of interest include server's response time, system throughput, and probability of rejecting a customer's request. The experiments were conducted on an e-commerce site compliant to the TPC-W benchmark.
Hierarchical location service for mobile ad-hoc networks
Authors: Kieß Wolfgang , Füßler Holger , Widmer Jörg , Mauve Martin
Published: January 2007

Position-based routing has proven to be a scalable and efficient way for packet routing in mobile ad-hoc networks. To enable position-based routing, a node must be able to discover the location of the node it wants to communicate with. This task is typically accomplished by a location service. In this paper, we propose a novel location service called HLS (Hierarchical Location Service). HLS divides the area covered by the network into a hierarchy of regions. The top level region covers the complete network. A region is subdivided into several regions of the next lower level until the lowest level is reached. We call a lowest level region a cell. For a given node A, one specific cell is selected on each level of the hierarchy by means of hash function. As A changes its position it transmits position updates to these responsible cells. If another node wants to determine the position of A it uses the same hash function to determine the cells that may hold information about the position of A. It then proceeds to query the nodes in these cells in the order of the hierarchy until it receives a reply containing the current position of A. Because of its hierarchical approach HLS is highly scalable and particularly well suited for networks where communication partners tend to be close to each other. Due to the inherent scaling limitations of ad-hoc networks it is very likely that most ad hoc networks will display this property. Furthermore HLS is very robust to node mobility and node failures since it uses regions to select location servers and not a chain of mobile nodes as it is the case, e.g., for the well known Grid Location Service (GLS). We demonstrate these traits by providing extensive simulation data on the behaviour of HLS in a wide range of scenarios and by using GLS as a benchmark.
Tools for computer architecture research
Authors: Burger Doug , Sivasubramaniam Anand
Published: January 2007

Simulators are critical tools for computer architecture research and education. They are invaluable when evaluating hardware designs and enhancements, that would otherwise be prohibitively expensive to prototype in practice. Simulators can be useful vehicles for verifying the validity of initial designs, understanding their cost-benefit trade-offs, whether or not a more expensive and time-consuming hardware prototyping effort is undertaken. In addition to being the sole vehicle for conducting an investigation in different research organizations, simulators are extensively used in industry for validating new ideas before justifying further investments on those ideas. Further, simulators can also serve as excellent platforms for teaching difficult concepts in hardware and compilers, by allowing students hands-on access to hardware and software internals that may not be accessible otherwise.
Guest editor's preface to the special section on discovery and interaction of mobile services
Authors: Mahmoud Qusay H.
Published: January 2007

Mobile services are wireless mobile computing applications and services located on remote servers or peer's devices in a mobile ad hoc setting (MANET). In order to use these services, users of handheld wireless devices must be able to locate them first. One of the fundamental challenges in mobile computing is the discovery of relevant services in dynamically changing environments such as MANETs. Many of the available service discovery protocols were designed for infrastructure-based wired networks and therefore are not suitable for MANETs. The few discovery protocols designed for MANETs do not offer location-based and context-aware service selection, and feature minimal interaction methods.
A rate control mechanism for energy efficient many-to-one communication
Authors: Bhandari Vartika , Vaidya Nitin H.
Published: January 2007

The many-to-one communication paradigm is extremely relevant in the emerging contexts of hybrid wireless networks as well as data gathering sensor networks. In this model of communication the point of data-convergence (base-station) becomes a bottleneck, thereby imposing a trivial upper bound of
W
on achievable aggregate capacity [1] where
W
is the maximum transmission rate possible. Some earlier work on many-to-one communication has considered hierarchical schemes wherein nodes are organized into clusters and intra-cluster communication occurs over a different channel than cluster-head to base-station (BS) communication [1], [2]. However we observe that even within the constraint of a single channel, it is possible to harness the potential for spatial re-use available in the network to obtain greater energy-efficiency while maintaining the same aggregate rate. We envisage a mechanism that exploits the non-linearity inherent in Shannon's equation:
W
=
B
log (1 +
SINR
), and improves on energy consumption by replacing a single high rate transmission with many spatially spread out low rate ones.
A study on object tracking quality under probabilistic coverage in sensor networks
Authors: Ren Shansi , Li Qun , Wang Haining , Chen Xin , Zhang Xiaodong
Published: January 2007

Sensor networks are used for a wide range of object tracking applications, such as vehicle tracking in military surveillance and wild animal tracking in habitat monitoring [1]. These applications, by their nature, enforce certain tracking quality and lifetime requirements. These two requirements, however, are two conflicting optimization goals due to the stringent energy constraints of sensor nodes.
Alpha-Beta pruning
Authors: Fulda Joseph S.
Published: January 2007

One of the most apparently subtle techniques taught in a typical Al survey course is minimaxing with alpha-beta pruning. As Winston writes in his text: "It is not unusual to get lost in this.... Even seasoned game specialists still feel magic in the alpha-beta procedure. Each individual conclusion seems right, but somehow the global result is strange." One way of lessening the apparent mystery of the technique is to ground it in something virtually every computer science student has seen and mastered earlier: cutoff of evaluation in conditionals. After encountering a true disjunct or a false conjunct in thre protasis of an IF statement a reasonable compiler will cease evaluation and return true and false respectively. It is easy to see by constructing some quick truth tables that the MAX function and disjunction are the same. Likewise, the MIN function and conjunction are equivalent. To stop evaluation of a MAX function, what occurs in alpha-beta pruning, is thus no different from what happens to everyday compound conditions with a disjunction. Mutatis mutandis, the same thing can be said of the MIN function and conjunction. There is one slight difference, however. Ordinary conditionals are based on standard, two-state logic, while the MAX and MIN functions in minimaxing can take on many values. We thus have to complete our comparison by noting that for multi-valued logics a true statement is as true as its truest disjunct, while a false statement is as false as its falsest conjunct.
Backgammon program beats world champ
Authors: Berliner Hans
Published: January 2007

On July 15,1979 in Monte Carlo world history was made as a computer program for the first time beat a recognized world champion at his own game. BKG 9.8, authored by Hans Berliner of the Computer Science Department, Carnegie-Mellon University, Pittsburgh, 15213, beat Luigi Villa, the newly crowned Backgammon World Champion in a seven point match 7-1. It should be noted that during the match both opponents palyed well; however, Villa played clearly better. However, as an examination of the game records below will confirm, on this occasion BKG 9.8 was the beneficiary of the element of luck in the game of backgammon, and this accounts for the lop-sided score.
Cognitive science vs. artificial intelligence?
Authors: Ortony Andrew , Wilks Yorick
Published: January 2007

HOMOGENES: If Cognitive Science is ever to become more than a part of AI, as I think and hope it will, then it is going to require a cooperative effort from those concerned with cognition, regardless of their principal discipline. This, in turn, requires a certain degree of humility and intellectual modesty that is patently lacking in many of the most visible AI scholars. I think there is a real danger that the "we know it all "mentality will do irreparable harm to Cognitive Science by driving away those form other disciplines.
A selected descriptor-indexed bibliography to the literature on belief revision
Authors: Doyle Jon , London Philip
Published: January 2007

This article presents an overview of research in an area loosely calledbelief revision.Belief revision concentrates on the issue of revising systems of beliefs to reflect perceived changes in the environment or acquisition of new information. In addition, belief revision research includes the study of methods for representing models of environments as collections of beliefs and the development of formal theories of belief. The bulk of the article consists of a descriptor-indexed bibliography of research addressing these topics. Our intention is that this bibliography serve both to introduce the interested researcher to this literature, and to capture the current state of the field. Towards this purpose, we begin with an overview of belief revision research.
Review of "TEX and METAFONT, New Directions in Typesetting by Donald Knuth", Digital Press and the American Mathematical Society.
Authors: Price Keith
Published: January 2007

TEX and METAFONT, New Directions in Typesetting consists of three parts each of which is self-contained. First is "Mathematical Typography," a Gibbs Lecture that Dr. Knuth presented to the annual meeting of the American Mathematical Society. This gives an overview of both TEX and METAFONT and puts them in perspective. Part 2 is a oomplete description of the TEX typesetting system. The last part is a similar description of METAFONT.
Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Company, Palo Alto, CA, ISBN 0-935382-01-1.
Authors: Price Keith
Published: January 2007

Nils Nilsson's new book on AI is now available from Tioga Publishing Company, P.O. Box 98, Palo Alto, CA 94302; (415) 854--2445. 476 + xv pages including approx. 400 references, remarks about the references, and exercises. 1980, ISBN 0-935382-01-1; $24.50 plus shipping and handling.
A preliminary survey of artificial intelligence machines
Authors: Boley Harold
Published: January 2007

This paper is first attempt at a survey of concrete and abstract machines relevant to AI research, inspired by some recent developments in personal computers. In particular, we consider machines supporting higher-level programming languages used in AI, mainly LISP. The emphasis will be on gaining a global perspective on the emerging field of AI machines rather than on a detailed treatment of specific issues. Thus, readers who are specialists in one of the fields touched (e.g., in parallel and associative machines) will not learn anything new about their particular field (on the contrary, they may contribute additional AI-relevant material to later versions of the survey). However, particularly for AI researchers worrying about the efficiency of their systems, this survey may provide a quick access to this important new research areas. For more specific questions the references in the extensive topic-indexed bibliography should be consulted.
Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Co.
Authors: Kant Elaine
Published: January 2007

Nils Nilsson's new book, (Principles of Artificial Intelligence) (Tioga Publishing Co., 1980) discusses some basic ideas underlying different applications of AI. The book, designed as a text for a senior or first-year graduate course, aims to fill a gap between theory and practice. It succeeds in building a good solid arch outward from the shore of theory, but only a few support beams anchor the bridge to the shore of practice.
Computer aided evolutionary design for software engineering
Authors: Rich Charles , Waters Richard C.
Published: January 2007

The purpose of this project is to explore the fundamental principles underlying the design and construction of large software systems, and to construct a prototype computer aided design tool to support this activity.
Some humor in an A.I. qualifying exam
Authors: Findler Nicholas V.
Published: January 2007

George L. Sicherman has recently taken the Special Area Qualifying Exam in A.I. in my department. In addition to six bona fide q, he was asked to answer two light-hearted ones. I think his responses are funny enough to be published in this forum. It was a take-home exam which fact enable him to "use" a computer in the second area.
Review of "Systems Engineering Models of Human-Machine Interaction by William B. Rouse", North Holland.
Authors: Ramakrishna Kamesh
Published: January 2007

The author had three goals for the book: "to emphasize the current state of the art", "to provide a treatment of a highly mathematical topic while avoiding calculus, differential equations, Laplace and Fourier transforms, and so on", and, "to include basic tutorials on the modeling methodologies of interest and thus avoid requiring the reader to consult other basic sources." The book is based on the lecture notes of a graduate course in Industrial Engineering offerred at the University of Illinois to mostly engineering and psychology students. The author feels that the material in the book is "nicely complemented by having students pursue a series of small design projects in which they have to choose among the various available models, resolve measurement problems, and so on."
Mastermind in SIGART
Authors: Rada Roy
Published: January 2007

Three articles about Mastermind (MM) have appeared in the
SIGART Newsletter
in the past 2 years. Each paper presents a different strategy for MM but only one gives a non-anecdotal assessment of performance. None of the papers seriously address the issue of what would be an optimal strategy of MM.
EXPERIPLAN an expert system that selects statistical analyses for research studies
Authors: Schreiner Joseph
Published: January 2007

EXPERIPLAN is a LISP program that selects and applies statistical analyses to experimental or observational research studies in medicine biology, education, and psychology. A research study is a proposed hypothesis describing the relationship between observed variables. It is based on observed characteristics (variables) of individual subjects. EXPERIPLAN selects an appropriate statistical analysis from the hypothesis and the variables' properties. It contains tutorial components that explain the analysis using the original hypothesis variables, and describe empirical relationships between variables. EXPERIPLAN contains information on 8 pre-defined variables (IO, Sex, Age, Education.,) and their empirical relationships. This knowledge base can be expanded and modified within the memory limits of the operating system. EXPERIPLAN uses this knowledge to advise researchers on the study's possible results. It also searches for controlling or matching variables to include in the study.
Review of "The Hedonistic Neuron: A Theory of Memory, Learning & Intelligence by A. Harry Klopf", Hemisphere Publishing Corporation, Washington, 1982, ISBN 0-89116-202-X.
Authors: Powers David M. W.
Published: January 2007

Another reviewer of this work has questioned "whether hedonism is an appropriate metaphor for brain research" [1, p24]. For Klopf however, hedonism is clearly much more than a metaphor. On the contrary, he sees hedonism as a phenomenon which is exhibited by systems - both social structures and individual organisms - as a direct result of their construction from hedonistic building blocks. The hedonistic neuron is hypothesized as being the most elementary such component of living systems.
Playing Mastermind optimally
Authors: Norvig Peter
Published: January 2007

There have been several recent articles in the SIGART Newsletter about the game of Mastermind (T. M. Rao, #82, E. Shapiro, #85, P. Koppstein, #88). This note describes an algorithm that is different from the others in that it is specifically designed to be an approximation to the optimal strategy.
Selected AI-related dissertations
Authors: Humphrey Susanne M. , Krovetz Bob
Published: January 2007

The following are citations selected by title and abstract as being related to AI, resulting from a computer search on the BRS retrieval system of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.
Reviews of "LISPcraft by Robert Wilensky", W. W. Norton & Company Inc, 1984.
Authors: Sriram D.
Published: January 2007

Traditionally, LISP has been the language for AI researchers, It has a number of unique features for the kind of programming that AI demands. However, till recently its use in the industry was restricted because the language is not standardized and many variations of the language exists. The MACLISP and INTERLISP versions were extensively used in earlier AI work. With the increasing popularity of the UNIX operating system, FranzLISP is currently being used in a number of projects.
Reviews of "Artificial Intelligence, A New Tool for Industry and Business by Richard K. Miller", SEAI Institute, ISBN 0-89671-051-3.
Authors: Price Keith
Published: January 2007

A measure of the business interest in AI is the number of sources of information geared for management. This report is a review of the capabilities of current AI systems especially in how they an be used for industrail automation and management. Most of the information is readily available elsewhere, but not in a single source. The discussion of varous AI research projects concentrates on what the system did rather than on how the system did it. Actual products are discussedd, with some details, and sources for more information are given. Since the report is meant for managers rather than researchers, systems which produce tangible results and those in actual sue (e.g., DELTA at GE, XCON at DEC, DENDRAL) are given more discussion than pure research efforts.
Quantitative artificial intelligence
Authors: Norem Philip C.
Published: January 2007

It is shown that human beings have a modest capability for abstract thought ranging from 100 Kilobytes to 10 Megabytes. Accordingly, present artificial intelligence programs approximating 100 Kilobytes are roughly equal to the low end of human capabilities and should be capable of duplicating human reasoning abilities. Furthermore, it should be possible for a 1 Megabyte program to enable a computer to function in ordinary English with a substantial range of activities, making larger programs possible in English with the preface in a normal computer language.
A note on sorting Prolog assertions
Authors: Kwok C. S.
Published: January 2007

In Prolog programs, arguments are often used to exchange information between relations. This kind of communication is tedious when a large amount of information has to be passed around. One way of solving the problem is to add assertions (unit clauses) to the knowledge base in execution time. These assertions are maintained as "global data structures." They are typically managed by the addition and deletion of clauses. However, most of the Prolog implementations offer little support for these operations. In C-Prolog [1], for example, a clause can only be added as the first or last clause of a relation. It would be useful if one could manipulate clauses in the same way as one manipulates lists. For example, sorting the assertions in the working memory of an expert system may lead the problem solver to follow a "better" path in the search space. In many applications, the working memory is build up incrementally. Thus, the insertion sort is a natural sorting method. The sorting may be combined with the addition of assertions using an assertcl(C) relation. A C-Prolog implementation of the articl(C) relation given below.
Selected AI-related dissertations
Authors: Humphrey Susanne M. , Krovetz Bob
Published: January 2007

The following are citations selected by title and abstract as being related to Al, resulting from a computer search on the BRS retrieval system of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.
Review of "Readings in Medical Artificial Intelligence by William J. Clancey and Edward Shortliffe", Addison-Wesley Publishing Co, Reading, MA.
Authors: Valtorta Marco
Published: January 2007

This volume is a collection of twenty-one articles on Al systems "concerned primarily with diagnosis and therapy" (p. 4). Eighteen are already published, one is based on a doctoral dissertation, and the remaining two, the first and the last ones, were written by the editors, William J. Clancey and Edward H. Shortliffe of Stanford University, especially for this book. Each article appears as a separate chapter introduced by a tow-page essay explaining its relevance and its relation to other work.
An evaluation of MProlog by Logicware
Authors: Bykat Alex
Published: January 2007

The following is a brief report of our experience with MProlog version 1.5 produced by Logicware Inc. Although much of what we report applies probably to all (or at least most) implementations of MProlog by that firm, our experience is with but two of their implementations running on:1. Tektronix 4404 AI Workstation, and2. VM/CMS version running on our IBM-4381 mainframe.We have used MProlog (1.5) in various projects as well as in construction of an intelligent operating system consultant and tutor (OSCAT). OSCAT is a large project which requires nontrivial facilities; this experience undoubtedly affected our evaluation of the MProlog product. Most of what follows is based on our interaction with MProlog for the VM/CMS system.
Algorithms to play Mastermind
Authors: Rao T. M. , Kazin G. , O'Brien D.
Published: January 2007

Several algorithms to play mastermind have been published. However, the overall complexity of the algorithm has not been discussed. In this paper, we present three algorithms and an analysis of their complexity.
An eclectic 5th generation architecture for ultra high speed computing
Authors: Rouse Larry O. , Forbes John F. , Gaudiot Jean-Luc
Published: January 2007

Ultra High Speed Computing will be addressed in the form of a new computing architecture using networks of processors, program partition/allocation techniques, and with specific design elements of the type that would be used for database acceleration. This optimum networking architecture will merge commercially available components and support coordinated algorithms and software methodology to fully exploit potential gains in computational speed through parallel computing. The network of processors to be investigated will be of value at the fine grain level for computational processes and at the large grain level for database and communication processes. The complimentary relationship of dataflow and database technology will be sued to focus the investigations with an emphasis placed on hardware implementation. A Phase I program, described in this paper, would analyze the proposed architecture, including hardware and software tradeoffs, and would define an appropriate simulation based methodology for a future Phase II program in which the candidate designs would be tested.
A progress report on speech understanding at SRI
Authors: Walker Don
Published: January 2007

SRI is one of a number of organizations engaged in a major program of research on the analysis of continuous speech by computer (cf. Newell et al., 1971). The goal is the development of a speech understanding system capable of engaging a human operator in a natural conversation about a specific problem domain. The SRI project involves the actions of a simulated robot manipulating blocks in a simulated three-dimensional environment. A person speaking to the computer will be able to ask questions about this environment, to give commands that will modify it, and to add information to augment its structure. The procedures being developed to provide these capabilities integrate pragmatic, semantic, syntactic, lexical, phonological, phonetic, and acoustic analyses.
A basis for complexity measurement?
Authors: Payne A. J.
Published: January 2007

This paper shows how OR techniques of the Mean Path Theorem can lead to some interesting results for measures of complexity. We have found that we can develop formulae for the best strategy of search. Using this formula we can show that we need to search an area the number of times that we expect to find separate targets and that the value of a measure for the best strategy is unity when we need to find 6.4 targets.