bluuebunny/crossref_metadata_2025 huggingface dataset:
A real-time medium access control protocol for ad hoc wireless local area networks
Authors: Baldwin Rusty O. , Davis Nathaniel J. , Midkiff Scott F.
Published: January 2007

We develop and analyze a simple, elegant medium access control (MAC) protocol for use in transmitting real-time data in point to point
ad hoc
wireless local area networks (WLANs). Our enhancement of IEEE 802.11, real-time MAC (RT-MAC), achieves dramatic reductions in mean delay, missed deadlines, and packet collisions by selectively discarding packets and sharing station state information. For example, in a 50 station network with a normalized offered load of 0.7, mean delay is reduced from more than 14 seconds to less than 45 ms, late packets are reduced from 76% to less than 1%, and packet collisions are reduced from 36% to less than 1%. Regression models are developed from simulation data to describe network behavior in terms of throughput, mean delay, ratio of late packets, and ratio of collisions. Stations using RT-MAC are interoperable with stations using IEEE 802.11.
Comments on an optimized protocol for mobile network authentication and security
Authors: Martin Keith M. , Mitchell Chris J.
Published: January 2007

The level of network authentication and security offered by a protocol proposed in [3] is considered
Mobility modeling in wireless networks
Authors: Bettstetter Christian
Published: January 2007

The movement pattern of mobile users plays an important role in performance analysis of wireless computer and communication networks. In this paper, we first give an overview and classification of mobility models used for simulation-based studies. Then, we present an enhanced random mobility model, which makes the movement trace of mobile stations more realistic than common approaches for random mobility. Our movement concept is based on random processes for speed and direction control in which the new values are correlated to previous ones. Upon a speed change event, a new target speed is chosen, and an acceleration is set to achieve this target speed. The principles for direction changes are similar. Finally, we discuss strategies for the stations' border behavior (i.e., what happens when nodes move out of the simulation area) and show the effects of certain border behaviors and mobility models on the spatial user distribution.
Implementation of interval arithmetic using APL
Authors: Fischer Herbert , Surkan Alvin J.
Published: January 2007

The central problem of interval arithmetic is first described in a general set theory framework. This description is specialized to intervals and interval operations which are defined over a set of machine numbers and implemented in computer programs. APL has been used for the logical formulation of algorithms for these operations of interval arithmetic. The Iverson notation of APL removes the arbitrariness of conventional descriptions of algorithms and program solutions. The results are obtained by direct execution of the completely explicit APL function type routines which both constitute a program and unambiguously describe algorithms for implementing the operations of interval arithmetic.
The generalized inverse
Authors: Lezotte D. C. , Hubert J. J.
Published: January 2007

Rao (1962) suggested a method for calculating a generalized inverse of an arbitrary matrix and used the method to represent a solution to the set of normal equations obtained in the theory of least squares. This method is similar to that used for calculating the regular inverse of a non-singular matrix (namely, the sweep-out method) developed by Gauss. The resulting inverse is a one-condition g-inverse and possesses many properties which make its use more desirable than other proposed g-inverses.This paper contains a discussion of the properties of this one-condition g-inverse, anAPLprogram for computing the inverse, and some examples demonstrating the use of the program. Finally we show that the four-condition unique Moore-Penrose inverse readily follows by the use of this program.
Considerations in the design of a compiler for APL
Authors: Saal Harry J.
Published: January 2007

Existing implementations of the APL language are generally referred to as "interpretive". APL users rely on system behavior of an interpretive nature, such as "desk calculator mode" debugging, and modern interpreters retain that external view even though internal interpreter organization is highly optimized. Increased use of APL has led to many requests for an APL compiler.This paper first presents a selected annotated bibliography of eight papers which address the question of efficient execution of APL programs. Based on the results of these studies, the problem of efficiently executing APL expressions seems to be well understood.The second half of the paper presents a number of environment related questions which must be resolved before designing a compiler for APL. Almost all of these issues involve potential tradeoffs of performance for other desirable attributes of an APL system.
A simple music system in APL
Authors: Smith Stuart
Published: January 2007

This paper describes a low-cost musical instruction system written entirely in APL. This system has facilities to enter, store, edit, and perform simple music compositions. The only special device required to implement the system is an inexpensive "music box" to provide musical (sound) output. Typical instructional uses of the system are shown.
Special control structures for APL
Authors: Reeves A. P. , Besemer J.
Published: January 2007

The problem of consolidating the block control structures of conventional programming languages such as ALGOL within the framework of APL is discussed. A novel partial solution is proposed by the introduction of special new basic functions to APL. One of the main design considerations of these functions is to maintain the current structure of APL as far as possible.A preprocessor to enable simple implementation of these structures without modification to existing APL interpreters is described. Some program examples using these new functions are given.
Aplecon
Authors: Lewis Stephen D.
Published: January 2007

APLECON is a set of APL workspaces which implement regression techniques commonly encountered in econometrics. Each estimation technique is expressed in a concise and unambiguous manner by using a standard format. To facilitate further analysis, data, key parameters, and estimates are either saved as global variables or can be retrieved by explicit-result functions. APLECON is viewed as an alternative to existing econometric programs which often take on the character of a "black box". Natural extensions of this work include applications in the area of computer-assisted instruction and development of a comprehensive package for econometric modeling.
Determining investment yields
Authors: Kline Edward M.
Published: January 2007

One of the basic financial-analysis problems is to determine the yield rate on an investment. The yield can then be compared with yields on alternate investments to aid the investor in making a choice. The traditional approach to finding a yield is to use a trial-and-error method which requires setting up a loop for tests of successive trial solutions. This paper will present a different way of solving for yields, which does not require looping when implemented in APL. This method will also be shown to require less storage for data, less computing time, and less storage during calculations.
Tracing the evaluation of APL expressions
Authors: Sigle John
Published: January 2007

The ability to trace each step in the evaluation of an APL expression is useful for debugging and improving APL code as well as for teaching APL. This facility can be provided by the APL interpreter, however, it is not clear what form of display is most suitable for this purpose. In this paper three alternate forms of display are described, illustrated and compared. The question of how this capability should be invoked is also addressed.
Analyzing a web-based system's performance measures at multiple time scales
Authors: Almeida Virgilio , Arlitt Martin , Rolia Jerry
Published: January 2007

Web and e-commerce workloads are known to vary significantly from hour to hour, day to day, and week to week. The causes of these fluctuations are changes in the number of users visiting a site and the mix of services they require. Since the workloads are known to vary over time, one should not simply choose an arbitrary time interval and consider it as a reference for performance evaluation. We conclude that times scales are of great importance for operational analysis, particularly for systems with bursty loads. Service level agreements must certainly take into account measurement time scales. Similarly input parameters for predictive models are sensitive to time scale. Ultimately, a time scale should be chosen for service level requirements that best expresses the needs of end-users and the price the owner of a site is willing to pay for QoS.
Probabilistic scalable P2P resource location services
Authors: Menascé Daniel A. , Kanchanapalli Lavanya
Published: January 2007

Scalable resource discovery services form the core of directory and other middleware services. Scalability requirements preclude centralized solutions. The need to have directory services that are highly robust and that can scale with the number of resources and the performance of individual nodes, points to Peer-to-Peer (P2P) architectures as a promising approach. The resource location problem can be simply stated as "given a resource name, find the location of a node or nodes that manage the resource." We call this the
deterministic
location problem. In a very large network, it is clearly not feasible to contact all nodes to locate a resource. Therefore, we modify the problem statement to "given a resource name, find with a given probability, the location of a node or nodes that manage the resource." We call this a
probabilistic
location approach. We present a protocol that solves this problem and develop an analytical model to compute the probability that a directory entry is found, the fraction of peers involved in a search, and the average number of hops required to find a directory entry. Numerical results clearly show that the proposed approach achieves high probability of finding the entry while involving a relatively small fraction of the total number of peers. The analytical results are further validated by results obtained from an implementation of the proposed protocol in a cluster of workstations.
History of Fortran
Authors: Metcalf Michael
Published: January 2007

Often questions arise that relate to the history of Fortran and to the development of its various standards: "why was feature x included/excluded?", "which statement was in which standard?", "was there a conspiracy to do this, that or the other?",
etc.
Answers to all these and more can be found in the literature. I have tried to assemble a short list of books and journals that should be relatively easy to find or obtain in a good academic library, in the hope that it can be of service to such enquirers.
Automatic composition of music by means of grammatical evolution
Authors: de la Puente Alfonso Ortega , Alfonso Rafael Sánchez , Moreno Manuel Alfonseca
Published: January 2007

This work describes how grammatical evolution may be applied to the domain of automatic composition. Our goal is to test this technique as an alternate tool for automatic composition. The AP440 auxiliary processor will be used to play music, thus we shall use a grammar that generates AP440 melodies. Grammar evolution will use fitness functions defined from several well-known single melodies to automatically generate AP440 compositions that are expected to sound like those composed by human musicians.
Radial basis function networks in A+
Authors: Skomorokhov Alexander
Published: January 2007

This paper discusses an implementation and application of Radial Basis Function (RBF) Networks. This type of neural networks performs a universal approach to function approximation. The same algorithm and program may be successfully applied to regression modeling or pattern classification. We illustrate the most important characteristics of RBF networks with a number of examples and discuss network behavior in depth. The software has been implemented in the A+ language, which became available to developers in January of 2001.
An analytical study of CANIT algorithm in TCP protocol
Authors: Benaboud H. , Berqia A. , Mikou N.
Published: January 2007

CANIT
(Congestion Avoidance with Normalized Interval of Time) algorithm is a new policy for TCP congestion avoidance which is proposed in order to improve TCP fairness over long delay links.
CANIT
uses a new parameter refered to NIT (
Normalized Interval of Time
), which is the key of this algorithm. In former works, we showed by simulations of some configuration with various value of NIT parameter, that using our algorithm instead of the standard one, improves the TCP fairness as well as the utilisation of network ressources. In this work, we propose an analytical study and we give the basic equations in order to find the optimal value of NIT parameter which provides more fairness and better bandwidth utilisation.
Modeling TCP Reno with RED-based routers
Authors: Kamal Ahmed E.
Published: January 2007

The purpose of this paper is to introduce an accurate performance model for the TCP Reno version in the presence of a bottlenecked router which uses the Random Early Detection (RED) active queue The paper makes two contributions:• It introduces an accurate model of a target source operating according to the TCP Reno mechanism in the presence of background traffic. The background traffic is represented by a general discrete batch Markov arrival process (D-BMAP), which is modified in order to make the phase transitions dependent on packet losses. It can therefore be used to model a collection of UDP and/or TCP sources. Under this model, packets are dropped only when the router is congested, or when the RED protocol is invoked, i.e., the buffer occupancy is taken into account.• The paper also introduces an accurate model of the RED mechanism, which tracks the evolution of the difference between the instantaneous and average queue sizes. This representation is chosen since the average queue size tends to follow the instantaneous queue size, and therefore the difference between them is usually limited.This model is different from the models presented in the literature for TCP in a number of ways. Unlike [1, 2] where packet losses are random, and independent of the actual buffer occupancy, our model captures the buffer occupancy, and the actual packet losses due to buffer overflow. This paper also models the cross traffic using a general process. Reference [3] considered the effect of cross traffic only by modeling the service times using a random process.
Computing stationary probability distributions and large deviation rates for constrained random walks.
Authors: Gamarnik David
Published: January 2007

Our model is a constrained homogeneous random walk in
Z
+

d

. The convergence to stationarity for such a random walk can often be checked by constructing a Lyapunov function. The same Lyapunov function can also be used for computing approximately the stationary distribution of this random walk, using methods developed in [11]. In this paper we show that computing exactly the stationary probability for this type of random walks is an undecidable problem: no algorithm can exist to achieve this task. We then prove that computing large deviation rates for this model is also an undecidable problem. We extend these results to a certain type of queueing systems. The implication of these results is that no useful formulas for computing stationary probabilities and large deviations rates can exist in these systems.
Intelligent information retrieval with proto-Gnosis
Authors: Boeing Winfried
Published: January 2007

This paper describes first experiences with the language proto-GNOSIS, a hybrid of MUMPS and PROLOG. The objective of the GNOSIS project is to create a GNOSIS shell, specified as a superset of X/OPEN capabilities. The shell will also be used at the University of Cologne to develop an intelligent information retrieval (IIR) system. This paper outlines an approach for IIR and illustrates the problem. Some mechanisms for an IIR system are discussed briefly. Then some examples from the GNOSIS language extensions are given.
A fast and portable uniform quasi-random generator of very large period based ona generalized multi-moduli congruential method
Authors: Guinier Daniel
Published: January 2007

The present method generates machine-Independent uniform random sequences of real numbers in the interval (0.,1.) excluding 1. It uses a generalization of mulltiplicative linear gongruential generators working with prime numbers as moduli whose values have been fixed according to the positive integer arithmetic storage available from the system, and one or their corresponding primitive elements as multipliers to complete independently each full cycle.The periodicity can be considered as infinite: O (10
92
) for a 16-bit machine and O (10
174
) for a 32-bit machine and their respective integer arithmetic; the periodicity can be adjusted if it is required by the user in the normal version or statistically reaching the maximum in the enhanced
'stagger'
version.An implementation of the method is available in the form of structured Fortran 77 functions and gives bettr results in term of velocity and periodicity than the other transportable functions compared with good quality of randomness.
The 9373 and 9375 pipelined processing unit
Authors: Kalla Ron
Published: January 2007

The IBM 9370 processor family uses System/370 (S/370) architecture, which consists of three parts: the central processing unit (CPU), memory, and I/O control. This paper explains how the 9373 and 9375 CPU instruction processing cards fetch and execute S/370 instructions.To obtain the maximum performance, the CPU is designed as a pipelined processor. Pipelining is a method used in processor design to optimize performance of a sequential stream of instructions. In a sequential stream of instructions, the processor knows what the next instruction is before the current one is completed; consequently, it can begin execution of it. In some cases, the processor can start some phase of the execution of several instructions before executing the current one, thus giving depth to the pipe. The 9373 and 9375 CPU cards take full advantage of pipelining to deliver optimum performance.
A visual microprogramming system
Authors: Baba T. , Minakawa H. , Okuda K.
Published: January 2007

A visual microprogramming system has been developed to support all aspects of the microprogramming process for a microprogrammed computer. The user can specify microoperations on a displayed hardware configuration. A graphical microprogram list has also been designed to display several microinstructions on the screen. Optimization may also be done on the screen. A visual simulator graphically illustrates the execution of microoperations on the screen, while allowing the user to control the simulator by using several commands. Preliminary evaluation results are also presented.
Computer architecture simulation using a register transfer language
Authors: Pittman R. , Bartel L.
Published: January 2007

ASIM (Architecture Simulator) is a hardware description language for describing the hardware of a digital electronic system. The components of an electronic system are described by three primitives: ALU, Selector, and Memory, which are sufficient to describe any piece of digital electronic equipment. ASIM is different from other hardware description languages in that it uses only these three high-level primitives and is not based upon an underlying programming language. To ease the translation of the specification to hardware, ASIM description primitives closely resemble their hardware counterparts, which leads to more compact descriptions than other languages. ASIM is implemented both in an interpreter and a compiler.
Microcode compaction with timing constraints
Authors: Su B. , Ding S. , Wang J. , Xia J.
Published: January 2007

At present, microcode compaction with timing constraints (abbreviated as MCTC) is still an open problem. Complex timing relation between microoperations greatly affects the optimization result of microcode. This paper begins with a survey of MCTC problems, then presents a formal description of MCTC and, on the basis of a systematic study of the characteristics of HCTC, presents a generally-oriented heuristic algorithm--CAS, which has a high success rate of scheduling and promises a good optimization result. Preliminary experiments indicate that CAS is better than other existing MCTC algorithms.
Library networking: its value to education
Authors: Molholt Pat
Published: January 2007

I have been asked to talk about libraries in the network environment, the role of library networking, in the educational process, and my observations gained from a five month study sponsored by the Office of Library Programs, US Department of Education.
The quality of expertise: implications of expert-novice differences for knowledge acquisition
Authors: LaFrance Marianne
Published: January 2007

Recognizing that the knowledge of experts is qualitatively and not just quantitatively different from the knowledge of novices is an important pre-requisite to conducting effective knowledge acquisition. This article reviews the current cognitive research on expertise and proposes seven ways in which the knowledge of experts is different from the knowledge of novices, including such aspects as underlying schema, goal-orientation, practical focus, categorical chunking, cognitive complexity, automaticity of expert problem solving, and finally, the episodic nature of expert memory. The paper concludes with an outline of several implications that follow from this research including showing why knowledge acquisition will remain problematic without knowledge of experts' knowledge, as well as making a number of specific suggestions for those who need to elicit expert knowledge for knowledge-based systems.
Knowledge acquisition at the metalevel: creation of custom-tailored knowledge-acquisition tools
Authors: Musen Mark A.
Published: January 2007

Automated knowledge-acquisition tools can assist system builders in the creation of knowledge bases for expert systems. An important class of such tools includes programs that contain detailed models of families of application tasks. Users enter knowledge about particular applications into these tools in terms of the predefined task models that the tools incorporate. Construction of such tools, however, has itself proven to be laborious. PROTÉGÉ is an interactive program that assists knowledge engineers in the construction of task models, and that automatically generates custom-tailored, graphical knowledge-acquisition tools based on those models. Domain experts independently use the knowledge-acquisition tools that PROTÉGÉ generates to enter the knowledge that defines individual applications. The methodology simplifies the development of task-based knowledge-acquisition aids, and allows system builders to separate the difficult, model-building part of knowledge acquisition from the more straightforward entry of content knowledge.
Putting the expert in charge: graphical knowledge acquisition for fault diagnosis and repair
Authors: Rodi L. L. , Pierce J. A. , Dalton R. E.
Published: January 2007

Thesis: With respect to the fault diagnosis and repair problem,• experts who are not programmers can work alone to specify test and repair plans and make use of a natural idiom;• a graphical interface can be built which limits keyboard input and avoids natural language headaches;• consistency checking to prevent cycles and redundancies in test/repair sequences can be carried out during knowledge acquisition prior to running the resulting diagnostic routines;• a current version of the (output) diagnostic routine may be run easily during knowledge acquisition to verify the knowledge base while it is being built;• diagnostic testing can be deterministic but need not be fully-ordered, and probably should not be;• rules and uncertainty measures are not necessary.
Methods for knowledge acquisition and refinement in second generation expert systems
Authors: Lavrac Nada , Mozetic Igor
Published: January 2007

First generation expert systems rely on the use of surface knowledge, such as associational or heuristic. Second generation technology is characterized by two additional features:
deep knowledge
and
machine learning.
Three second generation methods for knowledge acquisition are reviewed: learning rules from examples, model-based rule learning, and semi-automatic model acquisition. The man-machine process of acquiring and refining knowledge extends the role of expert systems to
expert support systems,
since both man and machine learn through repeated knowledge refinement cycles. Explanation of solutions and of the knowledge base itself is crucial for this man-machine learning process. An extended expert system shell schema is presented that includes a knowledge acquisition and a knowledge explanation module.
Knowledge acquisition in a machine fault diagnosis shell
Authors: Krishnamurthi M. , Underbrink A. J.
Published: January 2007

The knowledge acquisition tools and techniques discussed in the literature deal primarily with the acquisition of human expertise applied in a particular problem domain. The acquired expertise generally includes both the decision making strategies of the human expert and the descriptions of the application problem. This acquisition process can become quite repetitive and time consuming when developing a number of application expert systems which use similar problem solving expertise but differ only in their application details. In this paper, we address this issue by discussing the details of the knowledge acquisition system we have designed and developed for use in a customized machine fault diagnosis shell. The knowledge acquisition system functions as a module of the diagnosis shell and acquires details of application machinery for which diagnosis expert systems are to be developed. The acquired application specific knowledge is combined in the shell with predefined generalized diagnosis strategies and application diagnosis expert systems are rapidly generated. The designed knowledge acquisition system has been implemented using Lisp on the Symbolic Lisp machine and has been validated by acquiring and verifying the design descriptions of a Cincinnati Milacron 786 robot. In this paper, the issues related to the development of a knowledge acquisition system for a customized problem solving shell, such as the machine fault diagnosis shell, and the details of the implemented knowledge acquisition system are discussed.
Model-based knowledge acquisition for heuristic classification systems
Authors: Plaza E. , de Màntaras R. L.
Published: January 2007

We present a methodology and an implemented system, EAR*, for supporting knowledge acquisition. Its goal is to build an implementation-independent knowledge-level description of the target knowledge base, guided by our current understanding of the generic structure of heuristic classification systems.
The taming of an expert: an anecdotal report
Authors: Brown B.
Published: January 2007

In the mid-80's when I joined the Texas Instruments Defense Systems Artificial Intelligence Lab, expert systems were a solution looking for a problem. My first assignment as a knowledge engineer was knowledge acquisition for a small expert system supporting an internal TI project. Preparing for the task, I reviewed texts [1][2][3] and journal articles [4][5] in the lab's small but growing technical library. Most texts agreed that effective knowledge acquisition was essential and that the process could be a bottleneck in system development. But the how-to, what-to, and how-fix were often missing. In an effort to supplement the limited material, the lab made available to its fledgling knowledge engineers internal guidelines to aid in beginning knowledge acquisition [6][7][8].
Hypertext as a means for knowledge acquisition
Authors: Wells T. L.
Published: January 2007

The most time consuming portion of constructing an expert system is the knowledge acquisition phase. A general knowledge acquisition tool designed around a hypertext concept could allow a knowledge engineer to list important concepts, create nodes attached to these concepts which explain their relevance, connect related concepts by linking their nodes, use graphics to explain difficult concepts, and even critique information entered into the system previously. In such a system, knowledge acquisition would not be confined to linear input of information. The knowledge engineer could use the hypertext system to compile knowledge gathered from an expert after interviewing, or s/he could enter the knowledge into the system as the expert sits there telling her/him what information to encode. The advantage of a hypertext knowledge acquisition tool is that all knowledge relevant to the expert system would be centralized into a hypertext knowledge base which the expert, or experts, can peruse and verify before the knowledge is encoded into a representation scheme. Then when the knowledge engineer does transfer the knowledge into a scheme suitable for use by an expert system, s/he can be sure that the knowledge is complete, sufficient, necessary, and correct.
Knowledge acquisition from multiple experts
Authors: Wolf W. A.
Published: January 2007

The
traditional
method of knowledge acquisition when constructing a knowledge-based (expert) system is to depend primarily upon a single source, usually an expert in the domain under consideration. This approach has several advantages: no need to resolve conflicts -- factual or personal -- among several experts; easier communication; a more consistent approach to solving the problems dealt with, etc. However, certain domains require the use of more than one expert to gather sufficient knowledge to construct a meaningful system. We report on one such domain and on the techniques used for knowledge acquisition from multiple experts.
Knowledge acquisition from repertory grids using a logic of confirmation
Authors: Ford K. , Petry F.
Published: January 2007

This research involves a continuing effort aimed at the development and unification of the prerequisite underlying theoretical foundations for an adequate approach to knowledge elicitation from repertory grid data. The repertory grid is a sorting test in which a list of elements are judged based on a set of constructs, essentially mapping elements onto constructs. Thus knowledge elicitation is performed by the expert's assigning of ratings to elements on the given constructs. The repertory grid is based on the personal construct psychology of Kelly. This theory assumes that people typically use cognitive dimensions - termed
constructs
- to evaluate their experience where each construct represents a single bipolar distinction.
A grid-based tool for knowledge acquisition: validation with multiple experts
Authors: Shaw M. L. G.
Published: January 2007

Knowledge Support System Zero (KSS0) is a system providing an integrated set of tools for knowledge acquisition for knowledge based-systems.
Elicit
provides facilities for eliciting the important dimensions of an expert's thinking on a topic;
Exchange
extends this to share entities and attributes between experts and elicits differences in perspective and terminology as well as disagreements on the topic.
SOCIO
processes results from several experts to reveal the similarities and differences in the concept systems of different experts, or the same experts at different times, construing a domain defined through common entities or attributes. It can be used to focus discussion between experts on those differences between them which require resolution, enabling them to be classified in terms of differing terminologies, levels of abstraction, disagreements, and so on. It provides a framework for identifying
consensus, correspondence, conflict,
and
contrast
in a knowledge acquisition system with multiple experts.
The elucidation of non-monoTONous reasoning and related notions in artificial intelligence
Authors: Humphrey S. M.
Published: January 2007

It is recognized that an intelligent agent must be capable of reasoning about the world it inhabits, must possess various forms of knowledge and beliefs about its world, and must use these to infer information about its world in order to plan, act, make decisions, respond to other agents, and so forth. The technical problem for AI is to characterize the patterns of reasoning required by intelligent agents, and to computerize them in some way.
Using Excel as a front end to APL+Win
Authors: Baelen Eric
Published: January 2007

This article will discuss how we might use an Excel Workbook as a front end for an APL+Win application. The goal is to allow a user to start an Excel Worksheet, have it launch APL+Win as a COM object and pass control to make APL a client to that session of Excel. We want to minimize the number of Excel Visual Basic Macros we need to write. For each Excel Worksheet, APL will populate it, protect it, validate input, create input forms, and save the results in a database.
Overcoming the memory wall in symbolic algebra
Authors: Cooperman Gene , Ma Xiaoqin
Published: January 2007

The traditional permutation multiplication algorithm is now limited by memory latency and not by CPU speed. A new cache-aware permutation algorithm speeds up permutation multiplication by a factor of 3.4 on current CPUs. The new algorithm is limited by memory bandwidth, but not by memory latency. Current trends indicate improving memory bandwidth and stagnant memory latency. This makes the new algorithm especially important for future computer architectures. In addition, we believe this "memory wall" will soon force a redesign of other common algorithms of symbolic algebra.
Mobile code middleware for mobile multimedia information access
Authors: Kunz Thomas
Published: January 2007

Mobile devices are limited in their capabilities, in particular when accessing multimedia information services. To overcome their performance limitation, we suggest employing code mobility to offload computationally demanding application components to more powerful proxy servers. Based on this idea, we are developing a mobile code middleware infrastructure build on top of KVM, a Java virtual machine for mobile devices.
Abstractions in semantic networks: axiom schemata for generalization, aggregation and grouping
Authors: Schiel Ulrich
Published: January 2007

A successful complex expert system, Kardio's model of the human heart is designed for the diagnosis of cardiac arrhythmias. Kardio is highly skilled in the reading of ECG recordings, and can be used as a diagnostic tool in ECG interpretation. In this groundbreaking account, the authors show how the model was compiled, by means of qualitative simulation and machine learning tools, into various representations that are suited for particular expert tasks. They investigate a hierarchical organization of a qualitative model and outline an experiment whereby the construction of a deep model is automated by machine learning techniques. The book contains a complete model of the electrical system of the heart.
The infinite state acceptor and its application to AI
Authors: Isper Edward A.
Published: January 2007

The infinite state acceptor is presented and is shown to be more powerful than the Turing machine for purposes of accepting strings. The role of abstraction in the design of such machines is discussed. It will be argued that such an acceptor is not merely an eccentric extrapolation of current models but is useful for the description of the behavior of devices whose complexity is nontrivial.
Computer algebra on MIMD machine
Authors: Roch J.-L. , Senechaud P. , Sievert-Rich F. , Villard G.
Published: January 2007

PAC is a computer algebra system, based on MIMD type parallelism. It uses parallelism as a tool for processing problems wich are too complex for a sequential treatment. Basic fundamentals of the system are firstly discussed. Then, different problems are studied, particularly the implementation of infinite-precision arithmetic, the solution of linear systems and of Diophantine equations, the parallelization of Buchberger's algorithm for Gröbner bases.A prototype of PAC is implemented on the Floating Point System hypercube Tesseract 20 (16 nodes), and different timing results obtained on this machine are given.
MACSYMS's inverse Laplace transform
Authors: Clarkson M.
Published: January 2007

The inverse Laplace transform capability of MACSYMA has been improved and extended. It has been extended to evaluate certain limits, sums, derivatives and integrals of Laplace transforms. It also takes advantage of the inverse Laplace transform convolution theorem, and can deal with a wider range of symbolic parameters.
Book review: COGNITIVE SCIENCE: AN INTRODUCTION by N.E. Stillings, M.H. Feinstein, J.L. Garfield, E.L. Rissland, D.A. Rosenbanm, S.E. Weisler, & L. Baker-Ward (MIT Press 1988)
Authors: Cook Linda K.
Published: January 2007

As a formal academic discipline, Cognitive Science is difficult to describe and even that much harder to teach. This text, however, appears to have done an admirable job of providing a coherent introduction to a new discipline which draws from a number of older, more traditional academic domains. This introductory text covers, in-depth, the following areas: Cognitive Psychology, Artificial Intelfigence, Neuroscience, Philosophy, Vision, and a number of Language-related areas, including the following: Linguistics, Language Acquisition, Semantics and Natural Language Processing.
Book review: "C" as a second laguage: For Native Speakers of Pascal by Tomasz Muldner & Peter W. Steele (Addison-Wesley: MA, 1988)
Authors: Auemheimer Brent
Published: January 2007

Beginning computer science students frequently ask their professors to recommend a book about C programming. These students usually know Pascal, have a vague idea that C is an important language, and know that C will be used in their upper level courses to come. C as a Second Language was written to fill this need. In their preface, the authors describe the book's intended audience as "students, professional programmers, and computer hobbyists studying C on their own" (Muldner, p. v). Experience in Pascal programming is assumed.
Book review: Structured induction in expert systems by Alen D. Shapiro (Addison-Wesley 1987)
Authors: Peffers Ken
Published: January 2007

This book examines the use of structured and unstructured induction to design rule-based expert systems in situations which may be too complex to be coded using conventional techniques. It aims to offer a solution to the problem that the complexity of expert systems is limited by the inherent difficulty of converting the knowledge possessed by the domain expert into rules.
Report on the workshop on analytical models
Authors: Butler K. , Bennett J. , Polson P. , Karrat J.
Published: January 2007

Analytical models are extremely useful and important tools for design engineering in many fields. They provide engineers with performance predictions for a specified design, and they also can assist in design improvements by identifying the sources of performance deficiencies.Currently analytical models are not commonly used for design engineering in HCI. However, university research has produced some promising results, and has led to exploratory development projects in several major corporations.
CSCW'88: report on the conference & review of the proceedings
Authors: Grudin J.
Published: January 2007

This article is a combined trip report and review of the published proceedings of the CSCW '88 Conference on Computer-Supported Cooperative Work. The conference proceedings are available from ACM Order Department, PO Box 64145, Baltimore, MD 21264, $22 for members and $30 for non-members; credit card orders are taken at (800) 342-6626.
A programming language basis for user interface
Authors: Olsen D. R.
Published: January 2007

The Mickey UIMS maps the user interface style and techniques of the Apple Macintosh onto the declarative constructs of Pascal. The relationships between user interfaces and the programming language control the interface generation. This imposes some restrictions on the possible styles of user interfaces but greatly enhances the usability of the UIMS.
A synthetic visual environment with hand gesturing and voice input
Authors: Weimer D. , Ganapathy S. K.
Published: January 2007

This paper describes a practical synthetic visual environment for use in CAD and teleoperation. Instead of using expensive head mounted display systems, we use a standard display and compute smooth shaded images using an AT&T Pixel Machine. The interface uses a VPL DataGlove [9] to track the hand, bringing the synthetic world into the same space as the hand. Hand gesturing is used to implement a virtual control panel, and some 3D modeling tasks. When simple speech recognition was added it markedly improved the interface. We also outline what extensions might be needed for using this kind of interface for teleoperation.
Planar maps: an interaction paradigm for graphic design
Authors: Baudelaire P. , Gangnet M.
Published: January 2007

Compared to traditional media, computer illustration software offers superior editing power at the cost of reduced freedom in the picture construction process. To reduce this discrepancy, we propose an extension to the classical paradigm of 2D layered drawing, the
map paradigm
, that is conducive to a more natural drawing technique. We present the key concepts on which the new paradigm is based: a) graphical objects, called
planar maps
, that describe shapes with multiple colors and contours; b) a drawing technique, called
map sketching
, that allows the iterative construction of arbitrarily complex objects. We also discuss user interface design issues in map based illustration software.
User-interface design for a clinical neurophysiological intensive monitoring system
Authors: Collura T. F. , Jacobs E. C. , Burgess R. C. , Klem G. H.
Published: January 2007

We describe the functional requirements and design reasoning leading to a user-interface for an automated clinical neurophysiological monitoring system. The design provides a versatile, high-performance system in which computer-naive users have access to functions typically requiring dedicated training.

The system provides real-time data acquisition, signal processing, and graphical output, specifically tailored for the diagnosis and characterization of cases of epilepsy. The development of a user-interface was based on a collaborative effort, in which designers and users worked with a common functional model, and developed working metaphors for system operations. In addition, an interactive screen was designed to facilitate the management of multiple concurrent operations in an intuitive and easy to learn fashion.
Soundtrack: An Auditory Interface for Blind Users (Abstract Only)
Authors: Edwards Alistair D. N.
Published: January 2007

Throughout the history of human-computer interface development
one aspect has remained constant: output from computers has been
almost entirely visual. A continued and increasing reliance on
visual communication has had a disadvantageous effect on users who
have visual disabilities. A visual interface is of no use to a user
who is completely blind: communication must use one of the other
senses, and hearing is an obvious candidate.

A number of human-computer interfaces have been developed and
adapted into an auditory form based on the use of synthetic speech.
However, for modern interfaces which use more complex displays,
synthetic speech is not sufficient. One attempt to adapt such a
mouse-based interface into an auditory form based on musical tones
and synthetic speech is described. This project involved the
development of a word processor called Soundtrack with an auditory
interface. Evaluation of this application suggests that the
approach is viable, but that it was difficult to use, and there are
significant research questions still to be addressed.
Methodology for comparative selection of interactive database interface types
Authors: Cristiano L. K.
Published: January 2007

On-line database applications are becoming the most common new software tasks. Their use is becoming increasingly popular in all areas of information management. In many environments these on-line applications are made available to a large, diverse user population. The majority of these users do not have training in database or software areas. For this reason, the interface between the user and the database is vital. It serves to protect the integrity of the database by governing user access and it provides an understandable medium through which the untrained user can obtain or update the desired data.The appropriateness of the interface can affect the success or failure of the database application. The wrong type of interface can result in inefficient data access and a reluctance on the part of users to utilize the tool. Most interactive database interfaces fall into two general categories, menu-driven or command- driven. These two interface types are dissimilar in appearance, usage, and often in performance. This article will provide a set of generalized criteria to assist the database manager or designer in selecting which interface type is better suited for a given application. The same criteria can also be used by managers in selecting a commercial database product for purchase. Factors such as the logical structure of the data, characteristics of the user community, and cost are considered. A worksheet is provided to allow for a quantitative analysis of the criteria in order to establish a foundation for the decision-making process.
Walking on an electric treadmill while performing VDT office work
Authors: Edelson N. , Danoffz J.
Published: January 2007

The physiological and psychological health problems associated with sedentary office work are well documented, but their solution has proved elusive. In this study a specially designed office permitted the comparison of conventional word processing (sedentary condition) to word processing performed while walking on an electric treadmill at 1.4 to 2.8 km/hr (active condition). Five subjects after several days of practice produced two test trials each consisting of six 20-minute intervals of word processing. For the sedentary condition the subjects were seated, during all six intervals. For the active condition, treadmill-walking and seated intervals were alternated. Variables measured included word processing performance score, stress and arousal indices, and body complaint count. The first of these was tested with a repeated ANOVA and Newman-Keuls post hoc, and the latter three with correlated t-tests. No significant differences were found between the two conditions forperformanceorbody complaints. Stresswas significantly lower (p < .05), and arousal was higher but not quite significant (P < .07) for the active condition. We conclude that treadmill walking and routine word processing can be performed concurrently without a decrement in work performance, and that certain physiological and psychological benefits may result.
Information detective: a workstation for exploring three dimensional information space
Authors: Kojima K.
Published: January 2007

Artificial reality is used to simulate two different kinds of space. One is the physical world. The other is a conceptual data model. A head mounted display can simulate the former. In this paper, we propose a system,
Information Detective
, to simulate the latter. Information Detective is a workstation for browsing complex information spaces. It consists of a small flat display and two tracking sensors. It behaves like a magnifying glass in three dimensional space and can show object details in a natural way. It is being developed to keep users from losing themselves in large and complex information spaces.