bluuebunny/crossref_metadata_2025 huggingface dataset:
Translation of nested APL to C++
Authors: Gusev Dmitri , Pospelov Igor
Published: January 2007

This paper discusses the task of developing a nested APL compiler and puts forward the project of such a compiler. The proposed approach consists of simulating the semantics of APL by using the object-oriented C++ programming language. Different kinds of problems ranging from APL syntax ambiguity to the implementation of nested arrays and the robustness of compiled code are considered and different solutions are proposed. We conclude that it is feasible to develop a robust nested APL compiler, although the problem of performance demands further research.
APL, dynamic programming, and the optimal control of electromagnetic brake retarders
Authors: Kimbrough Scott
Published: January 2007

The basis of dynamic programming is described. It is a method for finding the best way to control a system when that system can be controlled by its inputs. As an example, the optimal (or best) control of an electromagnetic brake retarder is derived. In this example the current to the brake retarder is the input being controlled. APL is shown to be a convenient language for writing a dynamic programming algorithm. A set of APL subroutines is provided for solving two-dimensional problems with one input. Adept APL programmers may enjoy the challenge of generalizing this code to problems of arbitrary dimensions.
Early bankruptcy detection using neural networks
Authors: Rudorfer Gottfried
Published: January 2007

In 1993, Austria had the highest number of bankruptcies since 1945. The total liabilities came to approximately US$3 billion.

Powerful tools for the early detection of company risks are very important to avoid high economic losses. Artificial neural networks (ANN) are suitable for many tasks in pattern recognition and machine learning. In this paper we present an ANN for early detection of company failures using balance sheet ratios. The neural network has been successfully tested with real data of Austrian private limited companies. The research activities included the design of an APL application with a graphical user interface to find out the relevant input data and tune the ANN.

The developed APL workspace takes advantage of modern windowing features running on IBM compatible computers.
Fuzzy control of technological processes in APL2
Authors: Skomorokhov Alexander O. , Reinhardt K.-H. , Roche G. , Tielemann M.
Published: January 2007

A fuzzy control system has been developed to solve problems which are difficult or impossible to control with a proportional integral differential approach. According to system constraints, the fuzzy controller changes the importance of the rules and offers suitable variable values. The fuzzy controller testbed consists of simulator code to simulate the process dynamics of a production and distribution system and the fuzzy controller itself. The results of our tests confirm that this approach successfully reflects the experience gained from skilled manual operations. The simulation and control software was developed in APL2/2 running under OS/2. Several features of this product, especially multitasking, the ability to run AP124 and AP207 windows concurrently, and the ability to run concurrent APL2 sessions and interchange data among them were used extensively in the simulation process.
Concrete multidimensional statistics in APL2
Authors: Strohmeier Bernhard
Published: January 2007

This paper deals with problems which occur in discrete multi-dimensional statistics and shows how they are solved using APL2. In particular, the APL2 feature
primitive function with axis
proves to be helpful and allows smart solutions to the problems of computing conditional probability tables and performing the iterative proportional fitting procedure. The implementation is done using the
literate
APL2-style.
Supporting semantic information retrieval in communication networks by multimedia techniques
Authors: Pejtersen Annelise Mark
Published: January 2007

The aim of the project is to understand and describe the information needs and search behavior of a professional design team as a basis for formulation of specifications of an information system that effectively supports the access to a wide network of heterogeneous databases. This project will supplement a similar project focused on the needs of casual users in public libraries and thus serve to generalize from previous research. To limit the scope of the study to a realistic project, it will be focused on the activities of an industrial design team. Below follows a resume of the original project proposal.
Book review: From Animals to Animats 3. Edited by Dave Cliff, Philip Husbands, Jean-Arcady Meyer, and Stewart W. Wilson (MIT Press)
Authors: Hexmoor Henry
Published: January 2007

This volume is an excellent collection of papers from the conference that took place in Brighton, England, August 8th-12th 1994. Most of these papers have well-documented results or offer well-researched positions. Overall, I enjoyed reading the papers and am pleased to use the book as a reference. After some general comments, I will review the volume, section by section. As far as the organization of papers is concerned, I would like to see more tutorial papers collected in a separate section.
Book review: Scale-Space Theory in Computer Vision by Tony Lindeberg (Kluwer Academic Publishers, 1994)
Authors: Chfistensen Henrik I.
Published: January 2007

The problem of scale is well-known in science, as selection of the appropriate scale is critical to the success of analyses/descriptions. The world is inherently organized in a scale hierarchy where major structures provide the reference for small scale structures. An example from everyday life is the organization of space in the world: countries, cities, houses, rooms, furniture, parts, molecules, etc. For the description of a particular phenomenon it is essential that the appropriate reference frame is chosen, for example, it typically makes little sense to describe where your desk is with respect to the country you live in, while it makes a lot of sense to describe where it is situated in your office.
Book review: Signal and Image Processing with Neural Networks by Timothy Masters (John Wiley & Sons, Inc., 1994)
Authors: Menkes Alex M.
Published: January 2007

Applied engineers will happily place this book adjacent to their 'Numerical Recipes' volume. Masters' fills this volume with methodology based on many years of experience. The title is misleading, implying that neural networks are to be used for signal and image processing. The book is not about neural networks, but about how 'features' can be extracted from raw data and formatted for neural networks. The methodology described is sound signal processing and can be applied to a variety of processing tasks. However, many readers will deride this volume as Masters provides little theoretical or mathematical background. The volume is filled with applied tips and examples, and the C++ algorithms on the accompanying disk are skillfully written. The book has a very specific agenda, despite its title, and it does a good job outlining complex topics with minimal background. The book is very well suited for the investigator that needs to implement a neural network solution quickly and with minimal grasp of the material. Despite its faults, I would definitely recommend it to any engineer looking for applied tools for implementing neural networks to solve a signal processing task.
Book review: Knowledge-Based Systems Analysis and Design-A KADS Developer's Handbook by Stewart W. Tansley and Clive C. Hayball (Prentice Hall 1993)
Authors: Corriveau Philippe
Published: January 2007

The acronym KADS (Knowledge Analysis and Design Support) has come to stand for a group of methods which can be applied to knowledge-based system development. KADS has become the de facto European standard and is being used with ever increasing frequency in North America as, for example, with the SOAR model [9]. As stated in the preface, the purpose of this book is to provide a full explanation of KADS plus a handbook for the use of KADS' methods. The authors' objective is to convince their target readers (practising computer professionals already well acquainted with the basic concepts of artificial intelligence) to adopt and use KADS. Note that although Prolog is the favored language in Europe, as well as that used by the developers of KADS, it is not used in this book, which simplifies the task of LISP users in applying the methods proposed.
Report on the ACM CSC '95 panel
Authors: Manaris Bill , Aiken Robert , Koutsougeras Cris , Munakata Toshinori , Valtorta Marco
Published: January 2007

This is a report on the panel "Artificial Intelligence: Finally in the Mainstream?" which was held during the ACM Computer Science Conference in Nashville, TN on March 1, 1995. The panel was held on the same day as the ACM Turing Award ceremony, which this year was given to the two AI pioneers, Edward Feigenbaum and Raj Reddy; as pointed out by several of the conference attendants, the fact that ACM selected these two specific individuals as recipients of the most prestigious award in Computer Science, suggests that the Computer Science mainstream, has given its answer to the panel's theme question. Coincidentally, the Turing Award lectures were delivered a few hours before the panel and thus set the stage and mood for the panel statements and discussion that followed. The panel consisted of Robert Aiken, Cris Koutsougeras, Toshinori Munakata and Marco Valtorta, and was moderated by Bill Manaris.
Using medical objects
Authors: Groom Frank M.
Published: January 2007

The medical community has traditionally utilized a common set of materials for diagnosis, documentation, and communicating about patients. These materials tend to be independently created, separately analyzed, but are used by medical personnel as an integrated set to deal with a particular patient. Included in such materials are patient history, problem symptoms, diagnostic imaging (X-Rays, MRI, PET, bone scans), patient logs, hospital specialist analysis, and consulting physician conclusions, treatments and results. Further records, such as hospital equipment used, drugs and materials used, facilities and personnel used, are all elements to be itemized and bills, insurance records, and forms are required for payment. Each of these medical elements can be created and captured as a separate object instance which can then be arrayed in a hierarchy in direct association with a particular patient.The advantage of employing objects to represent, display, store and transmit medical information is that objects encapsulate into a single entity all the elements required to use this medical information. An object contains the required data whether it be a document or an image. The object also contains information about the document such as who created it, who is authorized to use it, how big it is, and what special formats or data types are used. The most powerful thing about an object is that the program or method which operates against the data or document is encapsulated within the object along with the data to be processed. Therefore one need not acquire and run a special program to process the object since the required program is enclosed in the object. Finally, a messaging program is enclosed in the object as well to send messages to other objects if their assistance is required. Thus an object is a self contained entity. A physician, researcher, technician, or nurse can retrieve an object and merely execute it. One need not load a program, then download data, and finally run the program against the data. The data and the program are encapsulated as a unit and executed as a unit. One retrieves the object and executes it. For further references on objects, there is Grady Booch's
Object-Oriented Analysis and Design
, Benjamin Cummings, 1994, and Won Kim's
Introduction to Object Oriented Databases
, MIT Press, 1990.
SAOOSS
Authors: Mazhindu Rosemary , Kronsjo Lydia
Published: January 2007

This paper reports on a research work towards the development of a System for Analysis of Object-Oriented Software Systems(SAOOSS). SAOOSS is to consist of a set of tools for a statical analysis of inheritance relationships of a given syntactically correct object-oriented software system against a set of design guidelines for well formed hierarchies. The aim of the analysis is to enable the user to gain a global understanding of the software system's inheritance structure, and to provide guidelines for a proper use of inheritance in system development.The theory of our research is based on a set of rules for well formed object-oriented based hierarchies developed by Rebecca Wirfs-Brock, Lauren Wiener and Brian Wilkerson, [1]. Rosemary Mazhindu has developed a logical extension to the work of Rebecca Wirfs-Brock, Lauren Wiener and Brian Wilkerson and this work, reported here, has formed the theoretical basis of SAOOSS.Although the theoretical basis of the research has evolved from studying a number of object-oriented languages, our aim is to develop the software system which will analyse programs and software written in C++.
Object design for communication protocol software
Authors: Liu Chung-Shyan
Published: January 2007

In this paper, an object design method for communication protocol software, which is specified based on a finite state machine, is presented. In our method, an object class is defined for each state of the finite state machine. The objects designed in our method have freer granularity than that in conventional approaches. Inheritance is used in our method as a program structuring mechanism to allow incremental design. A real example is given for demonstration.
The object oriented model and its advantages
Authors: Guimarães José de Oliveira
Published: January 2007

This paper examines some advantages of the Object Oriented Model (O.O.M), such as reuse of code. better structured programs and easier transition from analysis to implementation. It presents some examples, showing why the O.O.M results in higher code reuse than procedural programming. The paper points also the advantages of Object Oriented Analysis (O.O.A) and of Data Abstraction (even though no direct connection exists between D.A. and the O.O.M).The reader is supposed to have some knowledge of the Object Oriented paradigm (class definition, objects. inheritance and polymorphism) and of C++ language.
Using continued fractions for efficient subclass checking
Authors: Morrison R. , England A. , Connor R. C. H. , Atkinson M. P. , Barneva S. , Rabitti F. , Zezula P.
Published: January 2007

Dynamic subclass checks are common in many sub-paradigms of object-oriented programming. These checks may be simply implemented by following the superclass chain through the objects which represent the class hierarchy. However, in large or data-intensive applications, such as OODBMS, this simple checking strategy may have significant efficiency consequences. Very long class chains, which commonly occur, can cause much pointer following, which in turn has a knock-on effect on the overall performance of memory management. Measurements have shown that memory management is the most significant factor in the performance of large object-oriented systems.This paper describes a way of testing if one class is a subclass of another without involving any pointer accesses. On creation, each class is allocated a unique pair of integers, over which subclass tests may be performed using only arithmetic. The technique only works for single inheritance systems; the essence of the technique is to simulate the tree structure of the class hierarchy using the well-understood mathematical model of continued fractions.
Types in objectbases development
Authors: de Miguel Adoración , Piattini Mario G.
Published: January 2007

During the later years a significant number of data models for objectbases (object models) have been proposed introducing different categories of data types. However, these models usually covers only implementation issues, not considering types throughout all the development phases. In this paper a classification of types in object models is presented and their role along the different development phases is discussed.
The CHI '95 doctoral consortium
Authors: Marshall Catherine
Published: January 2007

For the past 10 years, SIGCHI has sponsored a Doctoral Consortium which is held at the annual CHI conference. Traditionally, the Doctoral Consortium has been a closed event in which an invited group of doctoral candidates present their research-in-progress to each other and to a faculty committee. In addition to the presentations, there are typically group exercises and discussion sessions which are designed to allow the Doctoral Consortium participants to get to know one another better, to think about their research in the larger context of the CHI field, and to become more fully integrated citizens of the CHI community. Participants in the Doctoral Consortium also are encouraged to participate in the CHI conference poster event.The CHI '95 Doctoral Consortium, held May 7-8 in Denver, Colorado, followed the traditional format described above. However, in keeping with the approach of continuous innovation and iterative design which is ingrained in the CHI conference planning process, the students and faculty who participated in this year's event also thought about ways to improve upon that format. The main opportunity we see for the future is to create more of a link between the Doctoral Consortium and the main conference. The sections below will report on both the key events of this year's Doctoral Consortium and on the ideas we have for the future.
On extending parallelism to serial simulators
Authors: Nicol David , Heidelberger Philip
Published: January 2007

This paper describes an approach to discrete event simulation modeling that appears to be effective for developing portable and efficient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops sub-models using an existing sequential simulation modeling tool, using the full expressive power of the tool. A set of modeling language extensions permit automatically synchronized communication between sub-models; however, the automation requires that any such communication must take a non-zero amount of simulation time. Within this modeling paradigm, a variety of conservative synchronization protocols can transparently support conservative execution of sub-models on potentially different processors. A specific implementation of this approach, U.P.S. (Utilitarian Parallel Simulator), is described, along with performance results on the Intel Paragon.
Predicting the future
Authors: Noble Bradley L. , Chamberlain Roger D.
Published: January 2007

The partitioning of systems for parallel simulation is a complex task, requiring consideration of both computational load requirements and communications activity. Typically, this information is not accurately known prior to execution. This paper investigates the use of historical information for the prediction of future requirements, both for computation and communications. In addition, for optimistic simulation algorithms, we present a novel technique (which we call predictive optimism) whereby binary prediction schemes can be used to increase the accuracy of optimistic assumptions, thereby decreasing rollbacks and potentially improving overall simulator performance.
Security issues with TCP/IP
Authors: Li Renqi , Unger E. A.
Published: January 2007

An introduction to network security , basic definitions and aa brief discussion of the architecture of TCP/IP as well as the Open System Intercornnection(OSI) Reference Model open the paper. The relationship between TCP/IP and of some OSI layers is described. An indepth look is provided to the major protocols in TCP/IP suite and the security features and problems in this suite of protocols. The secutiy problems are discussed in the context ofthe protocol services.
Hybrid inferential security methods for statistical databases
Authors: Hansen Steven C.
Published: January 2007

Memoryless inference control methods have been shown to provide effective means of reducing the amount of sensitive information released from a statistical database while maximizing the release of non-sensitive information. Early memoryless inference controls have the additional benefit of providing control at a low computation and storage cost. Two recent extensions to memoryless inference control allow the controls to release more non-sensitive information but do so at a greater cost in terms of computation and storage. This paper describes a proposed hybrid inference control method that can potentially maximize the release of information while holding down computation costs.
A unified representation for numerical and qualitative simulations
Authors: Berleant Daniel
Published: January 2007

Models fall naturally into two main categories, those of discrete systems and those of continuous systems. Our model-based reasoning work deals with continuous systems, augmented to provide for the possibility that one continuous system model transitions to another, as when a threshold event occurs such as a thermostat turning on.One aspect of model-based reasoning is simulation. A model is defined and its behavior(s) inferred through qualitative or numerical simulation. The simulated trajectories then facilitate tasks that one expects model-based reasoning to aid in, such as prediction, monitoring, diagnosis, and design.Here we describe an approach to representing simulation trajectories that results in descriptions of system behavior that contain both qualitative and quantitative information about trajectories closely integrated together. Those descriptions are supported by an internal, representation methodology that also closely integrates qualitative and quantitative information. The internal representation methodology supports quantitative inferences about the trajectories, and an example trace of such inferencing is provided.
p
-th roots for integers modulo

p
n

and for
p
-adic integers
Authors: Volpi Aldo
Published: January 2007

Given a prime number
p
> 2, we determine the roots of a polynomial of the form

X
p
-a

in the rings of integers modulo

p
n

and in the ring of
p
-adic integers, using a procedure based on the solution of first degree equations.
REDUCE package for the indefinite and definite summation
Authors: Koepf Wolfram
Published: January 2007

This article describes the REDUCE package ZEILBERG implemented by Gregor Stölting and the author which can be obtained from RedLib, accessible via anonymous ftp on ftp.zib-berlin.de in the directory pub/redlib/rules.The REDUCE package ZEILBERG is a careful implementation of the Gosper and Zeilberger algorithms for indefinite, and definite summation of hypergeometric terms, respectively. An expression

a
k

is called a
hypergeometric term
(or
closed form
), if

a
k
/a
k-1

is a rational function with respect to
k.
Typical hypergeometric terms are ratios of products of powers, factorials, Γ function terms, binomial coefficients, and shifted factorials (Pochhammer symbols) that are integer-linear in their arguments.The package covers further extensions of both Gosper's and Zeilberger's algorithm which in particular are valid for ratios of products of powers, factorials, Γ function terms, binomial coefficients, and shifted factorials that are rational-linear in their arguments.A similar MAPLE package is described elsewhere [2].
DPL
Authors: Willhoft Robert Gordon
Published: January 2007

T
HE NEED FOR
a powerful, easy to use, parallel language continues despite very significant advances in the area of parallel processing. Many parallel languages are simply old sequential languages with parallel constructs added. This research describes the Data Parallel Language (DPL), a parallel language built from its foundations on parallel concepts. DPL bases much of its expression on data parallelism found in APL2 and Fortran90. DPL uses a method based on Petri nets for controlling the execution of groups of statements. Therefore, it allows the user to express parallel algorithms in a natural, array-based method that is independent of the underlying parallel architecture.APL has been recognized as a naturally parallel language because of its ability to express algorithms on array arguments directly. This eliminates the need for a programmer to convert them into sequential loops. Fortran90 has recently adopted similar data parallel concepts into the Fortran language. DPL borrows from APL2 and Fortran90 to define an extensive data parallel function set. Functions in DPL are designed to take arrays as arguments and map the execution onto the underlying parallel machine.Petri nets provide a very elegant model for expressing concurrent and asynchronous operations. DPL uses the semantics of Petri nets to provide a general purpose control structure. DPL frees the programmer from having a fixed set of parallel control constructs, such as are provided in most parallel languages. Rather, it provides a method to express parallel execution based only on the input and output conditions of parts of the program.This work provides the complete syntax and semantics of DPL and then explores its use. The expressiveness of the language is demonstrated by showing how common parallel structures can be implemented. The ease of use is analyzed using a study of existing APL2 code to determine the amount of implicit parallelism in an array language. Some of the issues of compiling DPL are discussed and theoretical speedups are given. The advantages of DPL over other languages, especially APL2 and Fortran90, are outlined.
The diverse career orientations of MIS personnel
Authors: Jiang James J. , Klein Gary , Balloun Joseph
Published: January 2007

Past studies have found different dominant career anchors present among information system (IS) personnel. This study provides additional evidence that IS personnel have a diversity of career orientations and that the orientations can vary according to external conditions. A survey of IS personnel supports the premise that each professional situation and each individual is unique. Organizations are better off creating flexible career structures rather than rigid career paths and must be prepared to adjust to changes in the environment.
A notation for manipulating arrays of operations
Authors: Landaeta David J.
Published: January 2007

Much has been written on the-possibility of incorporating arrays of functions and arrays of operators into APL. Various methods have been proposed for creating and restructuring such arrays. This paper proposes the introduction of arrays of operations in general into APL2. Vector notation is extended, as suggested by Brown and Benkard, to allow easy creation of vectors of operations. A new object, called an ELEVATOR, is introduced in order to create operations for manipulating arrays of operations. The semantics of the jot is extended, as per Benkard, to provide a means of extracting structural information from operation arrays.

An analysis of the meaning behind the new notation is undertaken. Definitions are given which not only satisfy the notational requirements but also provide insights into the nature of structural operations on function arrays. The information retained in an empty function array is explained, and the relationship between the primitive ENCLOSE function and the EACH operator becomes clear.
APL2—A mathematician's delight
Authors: Thomson Norman
Published: January 2007

The early claims of APL to the attention of the computing world included its closeness to mathematical notation and hence its power both to improve and enhance the understanding of mathematical ideas, and also to smooth the process of realizing them on a computer. The new features of APL2, notably nested arrays and operator extensions have brought programming and mathematics even closer together. Mathematical users of APL cannot but delight in the new possibilities, of which just a few are outlined in this paper.
The integration of relational database algebra into APL
Authors: Livingstone David
Published: January 2007

A characteristic of Fourth Generation Languages is that they not only provide a high level of programmer productivity - as does APL - but also have a much wider area of applicability than conventional languages, or even APL. The aim of the project described here is to strengthen APL as a Fourth Generation Language by widening its scope though the addition of some database facilities, specifically data manipulation primitives. The primitives added are derived from Relational Database Algebra since this is based on the same philosophy as APL. As a relation is a special case of a generalized array, the algebra functions are generalized to handle n-dimensional arrays. The extra functions are not just add-ons or database facilities interfaced to APL, but primitives that maintain the unity of APL.
Checkpoint—Restart for APL applications
Authors: Pardee Otway O.
Published: January 2007

The crash proofing of APL programs is relatively simple in an APL system having a file sub-system. The method is the classical Check Point and Restart to which has been added Completion Codes. It can be used for single user programs or multiple user interactive programs with critical sections. It assures recovery for such external generated failures as CPU, terminal, telephone line drop, or network crashes. The method can be used on already written programs by simple insertion in the existent code. It is particularly useful in application programs where the users are laymen.
Automated application programming environment
Authors: Chua Yap S. , Winton Charles N.
Published: January 2007

With the availability of high-performance, low-cost hardware, APL provides a cost-effective means of developing custom software for the small business environment, and perhaps the best alternative to trying to adapt to an off-the-shelf package. Since APL does not inherently deal with system specific screen manipulation and file management techniques, programming these interface requirements from APL is typically tedious, potentially reducing the attractiveness of APL as the development language. Strategies for dealing with the realities of screen and file management in the context of small business systems are discussed in this paper. Low level functions with universal application are described along with code generation utilities to automatically produce the user and file interfaces for application packages. The programmer makes use of the screen and file management utilities to specify screen I/O and file management requirements resulting in a set of automatically generated screen and file functions for use with the application program. Thus, the programmer is relieved of the tedious task of dealing with the programming of the user and file interfaces and can concentrate on the “core” of the application program. Furthermore, system specific code in the application program (for displays and files) minimally affects portability since the utilities confine such code to a handful of low level functions. A working example of a small business system constructed with the assistance of screen and file management utilities is discussed.
A logic programming tool for qualitative system design
Authors: Moller Gert L.
Published: January 2007

Introducing a geometrical approach to propositional divalent logic with the truth-tables of the Boolean connectives as the geometrical objects, we can make a simple operational implementation in APL of basic inference methods. This is the basis for a logic programming tool used for preliminary product design at the Danish company Bang&Olufsen.
Logic programming in APL2
Authors: Brown James A. , Cook Janice H. , Groner Leo H. , Eusebi Ed
Published: January 2007

The most popular vehicles for logic programming are LISP and PROLOG.
APL2
has the important features of these languages and more. On one hand,
APL2
has all the expressive power of LISP and implementation of PROLOG in
APL2
is not difficult. On the other hand,
APL2
includes facilities for full screen management, menus, graphics, access to relational databases, and powerful computational primitives.

This paper explores the representation of logic using the nested data structures of
APL2
and shows how some standard algorithms of logic programming are expressed in
APL2
. This includes Unification, Resolution, and a logic programming environment like PROLOG. A discussion of the pertinent
APL2
notation, detailed discussion of the algorithms and commented programs appear in (Br1).
APL2 and AI: a study of search
Authors: Eusebi Ed , Brown James A.
Published: January 2007

The APL2 language and its environment offers a number of features which make it an effective vehicle for AI research and for the development of knowledge-based systems. In the language, general arrays can easily model various knowledge representations; it is easy to model parallel behavior; there are various ways to implement deductive reasoning: and there are some interesting features that support a functional style of programming. In the environment, editors, interactive graphics, and debugging tools provide excellent human interfaces; Fortran, REXX, and Assembler routines may transparently replace APL2 functions; relational tables which are subsets of APL2 arrays may be retrieved dynamically; and user-to-user shared variable processing can be used to model parallel behavior.

In this paper, we will demonstrate the usage of APL2 for AI problems by presenting concise functional programs for searching a database of rules and facts. Various simple enhancements are shown which extend the scope of the programs to and/or, heuristic, bi-directional, and parallel search.
Typesetting APL using a Macintosh
Authors: Howland John E.
Published: January 2007

This paper describes a low-cost approach to providing high quality printing of text which contains APL characters as well as other text fonts. APL fonts for the Macintosh™computer and the Apple LaserWriter™printer have been developed which allow low-cost typesetting of APL expressions and functions. Since the Macintosh computer can be used as a work station on several commercial typesetting machines, these fonts can be used to provide commercial quality printing of APL manuscripts.
Dissertations
Authors: Shneiderman Ben
Published: January 2007

The following are citations selected by title and abstract as being related to Computer-Human Interaction, resulting from a computer search, using Dialog Information Services, of the Dissertation Abstracts Online database produced by University Microfilms International (UMI). Included are UMI order number, title, author, degree, year, institution; number of pages, Dissertation Abstracts International (DAI) subject category chosen by the author, and abstract. Unless otherwise specified, paper or microform copies of dissertations may be ordered from University Microfilms International, Dissertation Copies, Post Office Box 1764, Ann Arbor, MI 48106, USA; telephone for U.S. (except Michigan, Hawaii, Alaska): 1-800-521-3042, for Canada: 1-800-343-5299. Price lists and other ordering and shipping information are in the introduction to the published DAI An alternate source for copies is sometimes provided. Dissertation titles and abstracts contained here are published with permission of University Microfilms International, publishers of Dissertation Abstracts International (copyright by University Microfilms International), and may not be reproduced without their prior permission.
Book review: Decision-Analytic Intelligent Systems by David A. Klein (Lawrence Erlbaum Associates, 1994)
Authors: Pittarelli Michael
Published: January 2007

I'll get straight to the point: If you feel the need to ownally spend time reading) everything in print on computer-aided decision-making, then this book is for you. Otherwise, it probably isn't.
Book review: The Phenomenon of Commonsense Reasoning: nonmonotonicity, action and information by Dimitrios Thanassas (Ellis Horwood, 1992)
Authors: Saba Walid S.
Published: January 2007

This book deals with a well-known problem in artificial intelligence, namely commonsense reasoning. The author tackles this problem from the standpoint of classical AI, building on theories of nonmonotonic reasoning developed by McCarthy, McDermott, Poole, Reiter, and Allen. However, the proposals given in this book differ from traditional approaches in two respects: (1) a novel approach to integrating formal models of commonsense reasoning with traditional knowledge representation formalisms, such as frames and scripts is suggested, and (2) a "typicality logic" is described, and the claim is made that default logic formalisms that have been proposed in the literature are "specializations" of the author's typicality logic.
Book review: Essentials of Fuzzy Modeling and Control by Ronald R. Yager and Dimitar P. Filev (John Wiley, 1994)
Authors: Toth Herbert
Published: January 2007

Essentials of Fuzzy Modeling and Control,
on its back cover, presents itself as the only comprehensive guide in the field: it "gives you all the concepts, tools, and techniques for fuzzy control and modeling in one volume. The book follows a logical, pedagogically consistent format designed to fully acquaint readers with the entire range of fuzzy concepts, tools, and modeling techniques. While it is an excellent general introduction for students, the authors' ultimate goal is to give researchers an opportunity to acquire everything they need to build the kinds of fuzzy rule-based models used in the development of the controllers now being used for the next generation of intelligent systems."
A formalization of the Turing test
Authors: Bradford Phillip G. , Wollowski Michael
Published: January 2007

Alan Turing proposed an interactive test to replace the question "Can machines think?" This test has become known as the Turing Test and its validity for determining intelligence or thinking is still in question.Struggling with the validity of long proofs, program correctness, computational complexity and cryptography, theoreticians developed interactive proof systems. By formalizing the Turing Test as an interactive proof system and by employing results from complexity theory, this paper investigates the power and limitations of the Turing Test. In particular, assuming the notion of completeness for standard complexity classes carries over faithfully to human cognition, then we can say: if human intelligence subsumes machine intelligence, and human intelligence is not simulatable by any bounded machine, then the Turing Test can distinguish humans and machines to within arbitrarily high probability.This paper makes no claim about the Turing Test's sufficiency to distinguish humans and machines. Rather, through its formalization this paper gives several ramifications involving the acceptance or rejection of the Turing Test as sufficient for making any such distinction.
Do Gophers have WWWebbed feet?
Authors: DeSimone Albert
Published: January 2007

I like the word "complements" much more than the word "versus," and I like the way Gopher complements the World Wide Web. If you are a current or aspiring information provider, you have probably been involved in discussions which place these two Internet-based information discovery tools in direct opposition. It's almost like a B-grade movie --- Gopher versus World Wide Web --- the audience being treated to the slaying of text-based information delivery by global hypermedia with its entourage of pictures, movies, and sounds. All this played out before our eyes to the sad strains of that increasingly popular tune "As the Bandwidth Played on."
Defining InterNIC support services
Authors: Newell Tom
Published: January 2007

As a result of the changing face of the Internet and consequently, the changing demands and requirements of its users, the InterNIC is examining its role in the support it provides to Network Information Center (NIC) staff and other members of the Research and Education (R&E) community who supports Internet users. InterNIC Support Services is a new program aimed at investigating this potential role of the InterNIC team. The NIC Liaison, Tom Newell, is charged with developing this new service and formally presented its goals at the 1995 ACM, SIGUCCS meeting in St. Louis, both entertaining questions and inviting community participation in the effort.
Taxila
Authors: Niyogi Debashish , Srihari Sargur N.
Published: January 2007

Only a few short years ago the hypertext community consisted of a [somewhat] small and highly-focused group of scientists who met every other year to discuss and share their results and advancements in systems, interface, human cognition, standards, rhethoric, applications, and methodology. Although an occasional outsider might venture to the conferences or perhaps read from the literature, there was a fairly clear distinction between the hypertext field and others.
Clusters, meta-clusters, and digital libraries
Authors: Bailey S. , Grossman R. L. , Hanley D.
Published: January 2007

We describe the architectural design and our early experience with scientific, engineering, and medical digital libraries that we have developed as part of the National Scalable Cluster Project (NSCP). Our goal is to develop an infrastructure for scalable, interactive digital libraries supporting high performance computing and high performance data management which interfaces to and interoperates with the World Wide Web (WWW).
Hypermedia support for a digital library in CS
Authors: Fox Edward A.
Published: January 2007

Since 1991 we have been developing a digital library (DL) in computer science and applying if for CS education. NSF has founded two large projects focusing in this area, as well as several related efforts. "A User-Centered Database for the Computer Science Literature" ran from 1991 through early 1995, benefited from strong support from ACM, and led to the Envision system [8, 9, 10]. "Interactive Learning With a Digital Library in Computer Science" [6, 7] runs from 1993 through early 1997, is supported by ACM as well as other publishers like IEEE-CS, includes efforts at Norfolk State University (NSU), and benefits from extensive hypermedia system support. By late April 1995, thirteen courses were supported by this El (NSF Education Infrastructure) project and over forty thousand accesses a week were logged by our server.
Extending an interactive thesaurus by dragging
Authors: Johnson Eric H.
Published: January 2007

Some of the research activities of the University of Illinois Digital Library Initiative focus on ways to improve subject access through the use of interactive thesaurus displays. Although a number of thesauri, such as the NASA Thesaurus, have appeared on-line, and eliminate the page-flipping necessary with printed thesauri, they basically just reproduce the printed form in that they do not graphically represent the relationships between thesaurus terms. We have developed a prototype interface, implemented in Microsoft Visual Basic, which visually displays both the hierarchical and related-term structures in a thesaurus. Compare Figures 1 and 2.
Medical cognitive graphics
Authors: Cole W. G.
Published: January 2007

Medical inference problems that seem too complex for intuitive solution can be made tractable if the problem information is presented in the form of a graphic display. The medical cognitive graphics approach to aiding complex problem solving conceives of a medical professional as a person trying to form a mental model of the patient's situation. Appropriate computer graphics make mental models easier to form and easier to explore. This paper develops the notion of medical cognitive graphics via two examples drawn from medical diagnosis and monitoring.
How are windows used? Some notes on creating an empirically-based windowing benchmark task
Authors: Gaylin K. B.
Published: January 2007

Users of a windowing system were studied for the purpose of creating an empirically based windowing benchmark. Each filled out a paper questionnaire that sampled subjective opinions of windowing commands, and were observed for approximately 22 minutes while performing typical daily activities on the computer. Subjects were also asked to demonstrate a typical log-on procedure and were personally interviewed. Windowing command frequencies, and screen layout characteristics were collected and analyzed. The data revealed a relatively high use of a small number of commands that were primarily concerned with moving between windows. This study enabled the creation of a more accurate windowing benchmark task.
Animated graphical interfaces using temporal constraints
Authors: Duisberg R. A.
Published: January 2007

Algorithm animation has an acknowledged and growing role in computer aided algorithm design, as well as in documentation and technology transfer, since the medium of interactive graphics is a broader, richer channel than text by which to communicate information. Since an animation constitutes the interface between a user and an algorithm, a kit that facilitates the construction of such has all the basic elements of a User Interface Management System. Constraint languages are useful in constructing such an interface construction kit, whereby consistency is maintained among the elements of a structure and among those of a view of that structure presented to the user. But constraints specify only static state in current implementations. To specify the evolution of structures and views by discrete time increments, as in animation, requires a extension to current constraint languages to allow expression of specifications of temporal behavior.
Defining constraints graphically
Authors: Borning A.
Published: January 2007

A number of constraint-oriented, interactive graphical systems have been constructed. A typical problem in such systems is that, to define a new kind of constraint, the user must leave the graphical domain and write code in the underlying implementation language. This makes it difficult for less experienced users to add new kinds of constraints. As a step toward solving this problem, the system described here allows the graphical definition of constraints. An interface has been built in which a user can conveniently construct a new kind of object, annotating it with the relations that it must obey.
Learning modes and subsequent use of computer-mediated communication systems
Authors: Hiltz S. R.
Published: January 2007

New users of four computer-mediated communication systems were asked to indicate which of a variety of learning modes they had used, including reading written manuals, using online automated help facilities, personal or group lessons from a human teacher, and trial-and-error learning. Despite often elaborate documentation and online help, the most frequent mode actually selected by users is trial and error learning. Rather than bemoaning the fact that users do not make proper use of written documentation, the implication for system implementation is that it should be designed to effectively encourage and support trial-and-error learning. An experimental intervention offering a guided learning activity supports this conclusion.
Designing a quality voice: an analysis of listeners' reactions to synthetic voices
Authors: Rosson M. B. , Cecala A. J.
Published: January 2007

Eight subjects listened to a set of synthetic voices reflecting a crossing of four voice qualities: head size, pitch, richness and smoothness. The listeners evaluated the voices on sixteen perceptual scales, and judged each voice's appropriateness for twenty voice-output scenarios. Factor analysis of the perceptual ratings recovered two factors, fullness and clarity. A similar analysis of the appropriateness ratings revealed three situational factors, information, entertainment and feedback. Further analyses indicated that the voice qualities associated with the three situational factors were quite different, and suggest ways to optimize voices used for a particular purpose.