bluuebunny/crossref_metadata_2025_split huggingface dataset:
A hand gesture interface device
Authors: Zimmerman Thomas G. , Lanier Jaron , Blanchard Chuck , Bryson Steve , Harvill Young 
Published: January 2007

This paper reports on the development of a hand to machine interface device that provides real-time gesture, position and orientation information. The key element is a glove and the device as a whole incorporates a collection of technologies. Analog flex sensors on the glove measure finger bending. Hand position and orientation are measured either by ultrasonics, providing five degrees of freedom, or magnetic flux sensors, which provide six degrees of freedom. Piezoceramic benders provide the wearer of the glove with tactile feedback. These sensors are mounted on the light-weight glove and connected to the driving hardware via a small cable.
Applications of the glove and its component technologies include its use in conjunction with a host computer which drives a real-time 3-dimensional model of the hand allowing the glove wearer to manipulate computer-generated objects as if they were real, interpretation of finger-spelling, evaluation of hand impairment in addition to providing an interface to a visual programming language.
Automated lip-synch and speech synthesis for character animation
Authors: Lewis J. P. , Parke F. I. 
Published: January 2007

An automated method of synchronizing facial animation to recorded speech is described. In this method, a common speech synthesis method (linear prediction) is adapted to provide simple and accurate phoneme recognition. The recognized phonemes are then associated with mouth positions to provide keyframes for computer animation of speech using a parametric model of the human face.
The linear prediction software, once implemented, can also be used for speech resynthesis. The synthesis retains intelligibility and natural speech rhythm while achieving a “synthetic realism” consistent with computer animation. Speech synthesis also enables certain useful manipulations for the purpose of computer character animation.
Performance modeling in integrated curcuit design (tutorial)
Authors: Hedlund Kye 
Published: January 2007

This tutorial is an introduction to performance modeling in the design of integrated circuits (ICs). It assumes no background in either electrical engineering or VLSI design; all relevant concepts and terminology will be introduced. The goal is to give an overview of the role of performance modeling in IC design, the current state of the art, central problems and research challenges.
First, the process of IC design will be reviewed. Every design progresses through a series of stages: concept, architecture, implementation and realization. Each level of design manipulates different abstractions and hence is concerned with different measures of design quality. Some principle measures are: speed, silicon area, power consumption and the number of input/output connections. There are several different major design paradigms such as gate array, standard cell and custom design. Each results in different tradeoffs between flexibility, ease of implementation and design quality. This has a fundamental impact on both the design process and the resulting design.
Performance considerations enter into IC design at a variety of levels: device, circuit, logic design and architecture. Each requires different performance models, and the designer must make tradeoffs that are qualitatively different at different levels. Circuit level design requires fast and accurate models of logic gate behavior. A circuit's speed, silicon area and power consumption must be accurately estimated. Each of these circuit characteristics can be traded off against the others, and the designer may adjust the tradeoff in order to tune the circuit to the needs of a particular application. Accurate and computationally fast models form the basis for the tools that assist the designer in circuit optimization. Tools exist that accurately predict circuit performance and that automatically optimize circuits.
Integrated circuit design is a field still in its infancy. This, coupled with the fact that the underlying technological base has undergone rapid change in recent years, means that performance modeling of IC design is still in its formative stages. Some areas (e.g. device modeling) are more mature and better understood than others (e.g. architectural modeling). Research opportunities are plentiful.
Computer vision and its application to APL
Authors: Feldberg I. 
Published: January 2007

Computer Vision refers to the application of human vision techniques to a computer, simply put, teaching the computer to see. This branch of computer science is well rooted in several other branches, including: image processing, artificial intelligence, and computational geometry. From these fields, as well as its own, come many interesting algorithms that can be used to form computer vision systems. These systems have been used in the past to perform such operations as inspecting tools on an assembly line and maneuvering a vehicle without human intervention. These tasks require two very different types of computer vision systems. In the first, a very limited domain can be covered, that is, the computer has to recognize only a few things (e.g. tool, belt, background). In the second, the computer has to be much smarter. It must recognize many diverse things (ground, walls, sky, obstacles).
In this project, a medium-scale computer vision task was chosen. We were to take an image of a mandrill (the famous one) and create algorithms to accurately label parts of the image. After some thought, APL was chosen as the language to program the task in. Not only was APL easy to work with, but it proved to be a creative factor. In APL, we were able to use array techniques that were simply unavailable in any other language.
APL and finite elements for solving convection-diffusion problems, with examples from gas bearing design
Authors: Hendriks F. 
Published: January 2007

The increasing popularity of finite element techniques to solve fluid flow problems has been due, in large part, to its geometric flexibility and adaptability. APL shares that property. Therefore, it is a natural companion to finite element modelling. The closeness of control that APL allows during algorithm and program development is especially welcome during the pre-processing stages of the solution of field problems, in particular during grid generation. This leads to very reasonable “door-to-door” solution times, especially for problems that occur in a R&D environment, where a large percentage of the time is spent formulating, changing and maintaining code.
Using examples from engineering practice, the adaptability of APL is illustrated in gas bearing design, as applied to magnetic sliders in hard disk files and laser mirror scanners in electrophotographic printers. APL was also used to teach finite element techniques and grid generation. It proved effective in affording a more immediate view of the key steps of finite element modelling, such as assembly of the stiffness matrix, and the effect of node numbering on the bandwidth of the sparse linear system.
Screen management in the “real world”
Authors: Stawick Edmund W. 
Published: January 2007

An application-based screen management system was developed in APL for a mainframe-based interactive database. It requires no special hardware or software support and therefore runs on any asynchronous communications device. The system includes features unique to most on-line databases yet common to many screen-oriented PC systems.
The foundation of the design is the division of all report information into discrete, logical sections. By dividing a report in this way and by providing the user with a powerful set of commands to allow movement both between and within these logical sections, one achieves a very flexible and user-friendly interface.
A self-defining dynamic data management system using multiple access methods
Authors: Montour Normand R. 
Published: January 2007

The advent of Generalized Arrays introduces a broad range of new possibilities for Application Systems. This is the description of such a system that introduces two new concepts.
The first concept is the use of different access methods, written in APL, on the same data base using Generalized Arrays.
The second one is the use of an algorithm to monitor the Data Base and initiate prompting for action-by-the-user function.
A portable APL language test generation and verification system
Authors: Nylander Charles G. 
Published: January 2007

The major tasks that must be performed during development and use of an APL language test system include construction of tests and verification of test results. In addition, it is desirable that a test system be transportable to a variety of APL language implementations, be extensible, and allow easy revalidation of the language implementation.
In this paper, we will describe the design, implementation, and use of an extensible, portable, self-verifying APL test system that includes facilities to generate large sets of useful tests with very little effort.
The test system is based on a test definition language and on an executable formal definition of the APL language. By careful use of the test system, 150,000 self-verifying language tests were constructed in four man-weeks.
Transportability was achieved by using APL as the implementation language for the test system software.
The successful use and transportation of this test system demonstrates that it is relatively easy to generate tests for and in the APL language.
TAGINE, an interactive tool for report generation
Authors: Yazigi Colette 
Published: January 2007

This paper describes an APL tool designed as an aid to report writing.
Using APL formatting symbols is quite difficult, and the report formatting phase of a business application program is often very long: TAGINE has been designed to allow quick and easy programming of reports.
TAGINE is divided into two modules:
1 - TANA is a simple macro-language intended for describing computations to be performed, and building a model of the final report (with automatic justifications, titles, formatting and decoration).
2 - TEDI performs the report generating using the model that has been stored. Most frequently, the end-user uses only the TEDI module.
At the APL division of SLIGOS, we have been using TAGINE for one year and have reduced the report programming effort by a factor of 10 compared to direct use of formatting primitives.
We have built 400 models with TANA, and produced 10000 tables with TEDI.
Systematic use of TAGINE has greatly improved:
• Applications portability
• Linking of a variety of applications
• Product maintenance and reliability
Relational data-base management and APL
Authors: Codd E. F. 
Published: January 2007

Historically, the development of programming languages was driven by a desire to remove needless machine-oriented representation clutter from the programmer's purview. When compared with other implemented programming languages, APL goes quite far in this direction. However, like its competitors, APL provides almost no support for programs that have to access and possibly update data from shared data bases. Such data is usually subject to syntactic and semantic constraints that are declared on a community basis. Moreover, both the data and the constraints are subject to dynamic sharing with other independently-developed programs.
We outline the principles underlying the relational model for formatted data bases, including the structures, algebraic operators, normalization, and formal data sublanguages. We conclude with a discussion of the need for a knowledge base (1) to act as a defining base for a proposed data base; (2) to mediate queries and transactions; and (3) to aid in query formulation in formal or natural language.
A short list of references is given for those wishing more introductory information about relational database management.
The nested rectangular array as a model of data
Authors: More Trenchard 
Published: January 2007

Data, like electricity and gravity, are part of the world in which we live. Some occur naturally, as in the genetic code, while most occur as a consequence of language and social organization. The search for a theory of data, which begins with the choice of a model, is as important and interesting as the development of theories in physics, economics, and psychology.
Most models of data are collections, such as the unnested array of APL, the one-axis nested list of LISP, and the set, which is nested but lacks the properties of order, repetitions, type, and multiple axes inherent in rectangular arrangement. Nested rectangular arrays have all these properties. The existence of simple, universally valid equations in both set theory and linear algebra suggests that equally simple equations may hold for all arrays. The principles of nested collections developed in set theory apply with few changes to the nesting of arrays. A one-sorted theory of arrays, in which type is preserved for empty arrays, provides an algebra of operations interpreted not only for data but also types of data.
Teaching computer science with APL
Authors: Denenberg Stewart A. , Peelle Howard A. 
Published: January 2007

We suggest that APL be used to teach selected topics in computer science. As a case in point, we take the topic:
“An Introduction to Search Procedures for Problem-Solving”
This is the first topic in a series of experimental curriculum units currently being developed at the University of Massachusetts.
In this paper, recursive APL functions are used to demonstrate fundamental search procedures, namely:
Breadth-First Search
Depth-First Search
Random Search
Heuristic Search
For illustration, a simplified Water Jug Problem is used with a state-space representation. The reader is invited to consider programming enhancements as well as extensions to other problems.
In closing, we cite some other topics potentially suitable for teaching with APL and mention implications for computer-science education.
Systemic implications of leap and an improved two-part cursor
Authors: Raskin J. 
Published: January 2007

The lowly text cursor is a non-issue for most interface designers. Nonetheless, current text cursor designs suffer from at least two problems: one-off errors and a lack of visibility of function. These problems are exacerbated in an editing environment which uses the extremely fast Leap cursor-moving technology.
This paper presents solutions to these cursor design problems and reveals the surprising way many other aspects of system design can be improved as a consequence of designing the cursor correctly.
Parallel simulation of queueing networks: limitations and potentials
Authors: Wagner D. B. , Lazowska E. D. 
Published: January 2007

This paper concerns the parallel simulation of queueing network models (QNMs) using the conservative (Chandy-Misra) paradigm. Most empirical studies of conservative parallel simulation have used QNMs as benchmarks. For the most part, these studies concluded that the conservative paradigm is unsuitable for speeding up the simulation of QNMs, or that it is only suitable for simulating a very limited subclass of these models (e.g., those containing only FCFS servers). In this paper we argue that these are unnecessarily pessimistic conclusions. On the one hand, we show that the structure of some QNMs inherently limits the attainable simulation speedup. On the other hand, we show that QNMs without such limitations can be efficiently simulated using some recently introduced implementation techniques.
We present an analytic method for determining an upper bound on speedup, and use this method to identify QNM structures that will exhibit poor simulation performance. We then survey a number of promising implementation techniques, some of which are quite general in nature and others of which apply specifically to QNMs. We show how to extend the latter to a larger class of service disciplines than had been considered previously.
On reordering instruction streams for pipelined computers
Authors: Shieh J.-J. , Papachristou C. 
Published: January 2007

This paper describes a method to reorder the straight line instruction streams for pipelined computers which have one instruction issue unit but may contain multiple function units. The objective is to make the most efficient usage of the pipelines within the computer system. The input to the scheduler is the intermediate code of a compiler, and is represented by a data dependence graph (DDG).
The scheduler is a kind of list scheduler. The data dependence and the pipeline effect of the function units within the system have been considered for finding a most suitable time slot for each node during reordering time.
The scheduler has been implemented and several scientific application programs have been tested. The results show that in most of the cases the scheduler will achieve the optimal result. The average instruction issue rate is over 96%. As a comparison, the issue rate of an ordinary compiler is only 22%; and the issue rate of a compiler with the effect of pipeline but without reordering the instruction stream is about 45%.
Data models in database management
Authors: Codd E. F. 
Published: January 2007

It is a combination of three components: 1) a collection of data structure types (the building blocks of any database that conforms to the model);
2) a collection of operators or inferencing rules, which can be applied to any valid instances of the data types listed in (1), to retrieve or derive data from any parts of those structures in any combinations desired;
3) a collection of general integrity rules, which implicitly or explicitly define the set of consistent database states or changes of state or both—these rules may sometimes be expressed as insert-update-delete rules.
Automatic parallelization of APL-style programs
Authors: Ching Wai-Mee 
Published: January 2007

APL-style programs use high level primitives on arrays instead of DO-loops whenever possible. For such programs, the average size of a basic blocks is much large than those in their FORTRAN counterparts. Hence, it is sufficiently profitable and relative easy to concentrate on basic blocks when parallelizing APL-style programs. But such an approach must depend on an APL compiler. The APL/370 compiler we have been developing aims at implementing automatic parallelization of APL programs at basic block level.
The compiler exploits functional parallelism on data independent sub-expressions and data parallelism of array primitives on array elements. The compiler front end does a local data dependency analysis and emits synchronization flags at function nodes. The back end does partitioning of (assembly code) array loop. A set of low-level synchronization primitives on MVS has also been developed. This will enable us to run compiled applications in parallel mode on IBM 3090 multi-processors to access the effectiveness of various scheduling methods on a shared memory model.
Angiogram analysis in APL: a case study
Authors: Feldberg Ian 
Published: January 2007

Angiograms are commonly used to diagnose the occurrence of an arterial occlusion. Dye is injected into a blood vessel, where its movement is tracked and recorded with x-rays. Currently, a physician uses these pictures to make a qualitative judgment on the state of the heart or artery. Unfortunately, these judgments are quite often incorrect.
A joint project between the Johns Hopkins Hospital and the Applied Physics Laboratory has been investigating the feasibility of digitally analyzing these angiograms, in order to better understand how blood flows through the heart and what type of occlusions are truly dangerous. APL became instrumental in this project because its powerful array manipulation functions allowed us to test our algorithms very quickly. In this overview, some of APL's features are discussed and compared to their equivalents in other software packages.
APL\?
Authors: Hui Roger K. W. , Iverson Kenneth E. , McDonnell E. E. , Whitney Arthur T. 
Published: January 2007

This paper describes a version of APL based upon the dictionary [1], but significantly simplified and enhanced, and directly usable on any machine that provides ASCII characters. It also describes salient features of a C implementation that has been tested on several machines, and is available as freeware. There have been four primary motivations for this work:

To provide an APL system for use in teaching mathematics and related topics that is modern, free, and transportable.

To devise a spelling scheme based on the ASCII alphabet that preserves the major advantages of the one-letter words based on the special alphabet commonly used in APL.

To exploit the advantages of breaking from the strict conformance with earlier APL that is normally obligatory in commercial systems.

To explore an unusual style of C programming that makes heavy use of pre-processing facilities.

Examples of the use of the language in a variety of topics are provided in an appendix.
We are indebted to a number of colleagues for advice and help: Anthony Howe, David Steinbrook, Bob Bernecky, Mark Czerwinski, L.J. Dickey, Jiri Dvorak, James Hui, Eric Iverson, Paul Jackson, and Roland Pesch.
DEMOS—a PC-system for population projections for small areas
Authors: Lönn Sven Gunnar 
Published: January 2007

DEMOS
*
PLUS is the name of Kommundata's system for population projections. It works together with another package called DEMOGRAFEN, (the DEMOGRAPHER) aimed for presentation of demographic data. These two systems are members of the software group “Planning Systems”, which are developed for social and economic planning activities in local governments. The “Planning Systems” are all written in APL
*
PLUS/PC. They are distributed with the run-time system of APL
*
PLUS

About 80 percent of the expenditures of local governments in Sweden can be assigned to certain age classes. For example the costs of schools, day nurseries, care of old people. Hence it is very important for local authorities to have knowledges of the population and its distribution by age and housing areas. Therefore more than one hundred municipalities in Sweden are using DEMOS and DEMOGRAFEN to improve their knowledge of the population and to make population forecasts for different housing areas. The systems are also used in education in some universities.
DEMOS is designed to give the maximum flexibility in making projections and is easy to use with pop-up windows and extensive on-line help. With DEMOS it is easy to make population forecasts of the whole municipality as well as population projections of selected housing areas for special purposes.
Algorithm alterable models and APL
Authors: Miroshnikov Alexey L. 
Published: January 2007

The paper deals with a software development of a certain kind of economics systems models: algorithm alterable models. The special feature of algorithm alterable models as follows: a research work with the model gives new knowledge about the modelling system, that cause a necessity to change the model itself. After changes this cycle is repeated. APL is mostly suitable for a development of the alterable models software. A method of the development is discussed in the paper as well.
As an example the paper outlines a modeling of a long-term planning process in a capital construction. A corresponding software - DDS for the planning - is described. The DDS had been implemented in APL 2.0 on a CDC Cyber-172 mainframe in LIIAS USSR. So called, psuedo-parallel executions, combined APL with ALGOL and FORTRAN subsystems, have been developed to improve dynamics characteristics of the DSS software.