bluuebunny/crossref_metadata_2025_split huggingface dataset:
The SonicFinder: An Interface that Uses Auditory Icons (Abstract Only)
Authors: Gayer William W. 
Published: January 2007

The appropriate use of non-speech sounds has the potential to
add a great deal to the functionality of computer interfaces. Sound
is a largely unexploited medium of output, even though it plays an
integral role in our everyday encounters with the world, one that
is complementary to vision. I argue that sound should be used in
computers as it is in the world, where it conveys information about
the nature of sound-producing events. Such a strategy leads to
auditory icons, which are everyday sounds meant to convey
information about computer events by analogy with everyday events.
Auditory icons are an intuitively accessible way to use sound to
provide multidimensional, organized information to users.
These ideas are instantiated in the SonicFinder, which is an
auditory interface I developed at Apple Computer. In this
interface, information is conveyed using auditory icons as well as
standard graphical feedback. I discuss how events are mapped to
auditory icons in the SonicFinder and illustrate how sound is used
by describing a typical interaction with this interface.Two major
gains are associated with using sound in this interface: an
increase in direct engagement with the model world of the computer
and an added flexibility for users in getting information about
that world. These advantages seem to be due to the iconic nature of
the mappings used between sound and the information it is to
convey. I discuss sound effects and source metaphors as methods of
extending auditory icons beyond the limitations implied by literal
mappings and speculate on future directions for such
interfaces.
Towards an information logic
Authors: van Rijsbergen C. J. 
Published: January 2007

'Probability is expectation founded upon partial knowledge.' (Boole, 1854)
Information retrieval based on stored program electronic computers has been an active area of research since the time these machines were invented. It is therefore somewhat surprising that even now no formal computational model for IR exists. There is no well-defined logic to describe information retrieval, and there is no proof or model theory to talk about the truths of IR.
This paper argues that much of the research work in the past has been steps in the direction of a logic for IR. These steps have been taken by developing formal models for information retrieval, but to date none of these are complete nor could any claim to be a computational model for IR. To appreciate this development I shall present a picture of IR, describing bits of a puzzle which may fit together to point to a new framework within which a computational model or logic could be described.
File organizations and access methods for CLV disks
Authors: Christodoulakis S. , Ford D. A. 
Published: January 2007

A large and important class of optical disc technology are CLV format discs such as CD ROM and WORM. In this paper, we examine the issues related to the implementation and performance of several different file organizations on CLV format optical discs such as CD ROM and WORM. The organizations examined are based on hashing and trees.
The CLV recording scheme is shown to be a good environment for efficiently implementing hashing. Single seek access and storage utilization levels approaching 100% can be achieved for CD ROM's. It is shown that a B-tree organization is not a good choice for WORM discs (both CAV and CLV), but a modified ISAM approach can be appropriate for WORM discs. We describe clustered BIM's, a class of tree organizations appropriate for CD ROMS. Expressions for the expected retrieval performance of both hashing and trees are also given.
The paper concludes by outlining recent results and future directions on buffered implementations of access methods for WORM discs, as well as advantages of signature based access methods for text retrieval in WORM disc architectures.
A microprogrammed interpreter for concurrent euclid
Authors: Lall K. , Atwood J. W. 
Published: January 2007

There are several methods of executing programs written in a high level language. The most widely used is to compile the programs into machine language. Another is to translate the programs into some intermediate form and then to execute that form interpretively. A third method is to directly execute either the HLL or the intermediate form.
This study was aimed at investigating the feasibility of directly executing the intermediate representation of the sequential features of Concurrent Euclid (CE) on the SEL 32/75 computer. The CE intermediate code was translated into Ecode, and a microprogrammed interpreter for Ecode was designed and implemented on the SEL, and benchmarked against the compiler. For the CPU-bound prime number algorithm Sieve of Eratosthenes, the interpreter was measured to be about twice as slow as the compiler, due primarily to poor overlap within microinstructions. Ecode was then modified, and a new translator and interpreter designed and implemented. The same benchmark then yielded comparable results for both the interpreter and compiler. We project that further changes in Ecode design and hardware support would result in substantial Ecode efficiency gains.
A flexible VLSI core for an adaptable architecture
Authors: Mulder H. , Stravers P. 
Published: January 2007

Two major limitations concerning the design of cost-effective application-specific architectures are the recurrent costs of system-software development and hardware implementation, in particular VLSI implementation, for each architecture.
The SCalable ARChitecture Experiment (SCARCE) aims to provide a framework for application-specific processor design. The framework allows scaling of functionality, implementation complexity, and performance. The SCARCE framework consists and will consist of: an architecture framework defining the constraints for the design of application-specific architectures; tools for synthesizing architectures from application or application-area; VLSI cell libraries and tools for quick generation of application-specific processors; a system-software platform which can be retargeted quickly to fit the application-specific architecture;
This paper concentrates on the micro-architecture framework of SCARCE and outlines the process of generating VLSI processors.
Automatic synthesis of optimal invariant assertions
Authors: Cousot Patrick , Cousot Radhia 
Published: January 2007

The problem of discovering invariant assertions of programs is explored in light of the fixpoint approach in the static analysis of programs, Cousot [1977a], Cousot[1977b].
In section 2 we establish the lattice theoric foundations upon which the synthesis of invariant assertions is based. We study the resolution of a fixpoint system of equations by Jacobi's successive approximations method. Under continuity hypothesis we show that any chaotic iterative method converges to the optimal solution. In section 3 we study the deductive semantics of programs. We show that a system of logical forward equations can be associated with a program using the predicate transformer rules which define the semantics of elementary instructions. The resolution of this system of semantic equations by chaotic iterations leads to the optimal invariants which exactly define the semantics of this program. Therefore these optimal invariants can be used for total correctness proofs (section 4). Next we show that usually a system of inequations is used as a substitute for the system of equations. Hence the solutions to this system of inequations are approximate invariants which can only be used for proofs of partial correctness (section 5). In section 6 we show that symbolic execution of programs consists in fact in solving the semantic equations associated with this program. The construction of the symbolic execution tree corresponds to the chaotic successive approximations method. Therefore symbolic execution permits optimal invariant assertions to be discovered provided that one can pass to the limit, that is consider infinite paths in the symbolic execution tree. Induction nrinciDles can be used for that purpose. In section 7 we show how difference equations can be utilized to discover the general term of the sequence of successive approximations so that optimal invariants are obtained by a mere passage to the limit. In section 8 we show that an approximation of the optimal solution to a fixpoint system of equations can be obtained by strengthening the term of a chaotic iteration sequence. This formalizes the synthesis of approximate invariants by heuristic methods. Various examples provide a helpful intuitive support to the technical sections.
Automated derivation of program control structure from natural language program descriptions
Authors: Wile David , Balzer Robert , Goldman Neil 
Published: January 2007

This paper describes a system which organizes a natural language description of a program into a conventional program control structure, as a part of a larger system for converting informal natural language program specifications into running programs. Analysis of the input program fragments using a model of a human “reader” of specifications has been found to be a very successful adjunct to conventional “planning” methodologies.
Natural language descriptions of programs can frequently be characterized as “rubble”—a very loosely organized set of almost independent description fragments [Schwartz]. Such specifications are often quite robust, due to a large degree of redundancy; they are also frequently quite concise, due to reliance on the readers' innate knowledge and their knowledge of the application domain. This paper discusses a paradigm for structuring the portion of “rubble” program descriptions which maps into conventional programming language control constructs and definition facilities.
Data abstraction from a programming language viewpoint
Authors: Rowe Lawrence A. 
Published: January 2007

This paper traces the development of data abstraction concepts in programming languages. A data abstraction, or abstract data type, describes a collection of abstract entities and operations on the entities. A program which uses a data abstraction can access or modify the entities only through the abstract operations.
Specific research topics discussed in the paper include: the role of type in a programming language, the formal specification of the semantics of a data abstraction, data abstraction language construct design issues, type hierarchies, and type-checking.
The use of data type information in an interactive database environment
Authors: Buneman Peter , Winston Ira 
Published: January 2007

Despite the enormous advances that have been made in the specification of data types and data models in the fields of programming languages, databases and artificial intelligence; there remain a number of problems in attempting to unify the various approaches to the formal description of data. The purpose of this brief paper is to examine these problems from the point (or points) of view of those people—designers, administrators, applications programmers, and end-users—whose main interest is with databases. In particular, we hope to display special concern for the tools provided for the end-user, who should be the final beneficiary of whatever advances are made.
In order to pin down some of these problems, it is worthwhile to attempt a definition of certain terms used in databases:

1. A
data model
(or
database management system
if one is describing an implementation) is a set of parameterized or “generic” data types.

2. A
database schema
is a set of data types that result from instantiating the generic types of the data model to produce a set of data types that describe the data to be stored.

3. A
database
is an instantiation of those types defined by a schema.
Integrating a database system and programming / information environment
Authors: Cattell R. G.G. 
Published: January 2007

Vast differences in terminology aside, there is considerable overlap between work in knowledge representation, programming language data types, and database models. Our current work on the Cedar programming environment has necessitated integrating a number of ideas in these areas.
As part of the Cedar project in the Computer Science Lab at Xerox PARC, we have been constructing a database management system. The goal of the Cedar environment is to greatly increase our productivity by combining the best currently known principles from programming languages, programming tools, and user interfaces into a single integrated system. Cedar is based on the Mesa programming language [1]. The goal of our database subproject of Cedar is to provide a uniform prepackaged way to perform access to data structures, as contrasted to the current state of affairs in which Mesa programmers repeatedly re-invent the facilities we intend to provide to type, structure, index, link, robustly store, concurrently access, and cache data stored in the primary or secondary memory of one or more computers on a network.
On the specification of behavioural constraints
Authors: Cristian Flaviu 
Published: January 2007

When designing information processing systems, the key problem is to find what symbols and constructs (available in some given language) should be used so as to be able to answer the questions that the users want to ask and to perform the state transitions that the users have to perform in order to keep in step with some reality that is being modelled. If the language that is being used cannot be interpreted directly by the software of a computer (e.g. set theory, algebra, semantic networks), the resulting model is called an abstract model (e.g. a specification, a data base schema). If all of the symbols and constructs used to express the model can be interpreted by a computer, the model is a concrete implementation (e.g. a data base system). Both the abstract and concrete models capture some aspects of the reality that is modelled. They differ with respect to the languages in which they are expressed.
The choice of the languages which are appropriate for writing such models is a subject of intensive debate. The recent workshop on Data Abstraction, Data Bases and Conceptual Modelling has shown that this debate is not likely to diminish in the near future. In the context of this debate, however, a common opinion was expressed several times by data base participants: the data models used to specify data base schemas are lacking to support the specification of operations tailored to particular application environments. It is therefore expected that in the context of data base modelling, the integration of operations (behaviour) with data (structure) will be one of the most fertile research areas for the next few years.
Associating types with domains of relational data bases
Authors: Lacroix Michel , Pirotte Alain 
Published: January 2007

In the DB field, there are two
interpretations
(or perceptions or schools of thought)
concerning the relational model
:

(a) one interpretation considers that the relational model contribution to the DB field essentially consists in the presentation of a clear and simple notion of (flat) file, and that many users will be very satisfied to describe their data structures as tables;
(b) another interpretation considers the relational model as a (reasonable) support for a (weak) entity relationship model.
Axiomatic information modeling
Authors: Lundberg Bengt , Bubenko Janis A 
Published: January 2007

The obvious task in information modeling is to arrive at a model which is correct. However, the concept of correctness has many faces e g the model must correctly reflect the properties of the application at hand, and it must adequately select relevant parts of the application. The former case requires that the information model is “satisfied by the application”. The latter case is dependent on the intended use of the model. The problem of satisfyability is, in most information modeling approaches, considered to be an intuitive task. From logic we know that a theory, here seen as an information model, can only be satisfied if it is consistent. Thus, by applying predicate logic to information modeling, we should have a possibility of checking the satisfyability of an information model. However, in order to ensure that the information model is satisfied by the application in mind, requires an intuitive reasoning.
Consequently, our plans include to further elaborate the use of predicate logic in information modeling. It furthermore includes a study of possibilities and limitations of such an approach. The results obtained so far will be shortly reviewed in the following.
Towards constructive axiomatic specifications
Authors: dos Santos C. S. , Furtado A. L. , de Castilho J. M.V. , de Carvalho S. E.R. 
Published: January 2007

The main goal of our efforts is the specification of data bases whose structure and behaviour are restricted by semantic integrity constraints. Research proceeds along the following stages:
1. Choose a data model;
2. Establish a taxonomy of integrity constraints;
3. Specify the data model formally;
4. Develop a methodology for specifying conceptual schemas for different applications, based on the data model;
5. Provide a conceptual characterization of query and update operations.
The extension of data abstraction to database management
Authors: Wasserman Anthony I. 
Published: January 2007

The long-term goal of the User Software Engineering (USE) project at the University of California, San Francisco, is to provide an integrated homogeneous programming environment for the design and development of interactive information systems. Realization of this goal involves the development of new software tools, their integration with existing tools, and the creation of an information system development methodology in which these tools are systematically used [1,2].
The successful construction of interactive information systems requires the utilization of principles of user-centered design [3,4,5], combined with features traditionally associated with the separate areas of programming languages, operating systems, and data base management [6]. It has become increasingly clear that the key to being able to provide such a unified view lies in providing a unified view of data [7]. The potential benefits of such a unification are considerable, including:
1) conceptual simplification of the system structure permitting, for example, joint design of data structures and data bases
2) the elimination of duplication or inconsistencies among diverse software components
3) the ability to achieve greater reliability in systems because of reduced dependence upon multiple software systems
Constructive Abstract Data types (CAD)
Authors: Wedekind Hartmut H. 
Published: January 2007

1. Distinction from conventional approaches
The motivation for CAD is to extend the idea of data abstraction to application programming. Conventional approaches confine themselves to operational concepts of system programming like STACK, QUEUE etc. and do not consider concepts like CONTRACT, INVOICE etc. of the application world (AW) with an arbitrary number of operations applicable to them, including those of the ad hoc type.
Associative/parallel processors for searching very large textual data bases
Authors: Bird R. M. , Tu J. C. , Worthy R. M. 
Published: January 2007

This paper describes an approach to solving a major problem in the information processing sciences— that of searching very large (5-50 billion characters) data bases of unstructured free-text for random queries within a reasonable time and at an affordable price.
The need by information specialists and knowledge workers for large, fast low-cost text and document retrieval systems is growing rapidly. Conventional approaches to the problem have usually depended upon expensive, general purpose computers, upon special pre-preprocessing of the textual data (e.g. file inverting, indexing, abstracting, etc.), and upon elaborate, costly software. The resulting retrieval systems often cost hundreds of dollars per query and the full scanning of an uninverted, unstructured billion byte textual data base could take hours of computer services. However, in spite of these restrictions, such full text search systems have proved useful and even indispensible for many applications.
Computer technology of the late 1960's and the 1970's, in both hardware and software (e.g., minicomputers, low-cost, high density disk storage, “chip” electronics, natural language query systems, etc.), have made i t practical to build special purpose, low-cost text retrieval systems. Such a system has been built, tested, and is now in a production stage. The system called the Associative File Processor (AFP), utilizes a conventional minicomputer (DEC's PDP-11/45) for control, off-the-shelf high density disks for storage, a special purpose parallel search module as a text term detector, and query and retrieval software. The AFP is currently being field tested at two sites. Full text, parallel searches on un-preprocessed textual data bases are being performed at the effective matching rates of 4 billion bytes per second (8K byte key memory times 500 Kbyte/second data stream). Estimated costs are 10 to 25 cents per query for a one billion byte data base. The costs per query and the time for searching increase in a linear fashion as data base increases. A basic architecture for the AFP is described and an implemented version is discussed. A more powerful term detector module is also under development. This system is designed around a finite state automaton algorithm.
The data management machine, a classification
Authors: Rosenthal Robert S. 
Published: January 2007

There has been much interest in the use of special purpose processors as the data base management component of data processing systems. The generic terms “backend” and “data management machine” have been applied to such devices. Examination of the literature reveals a broad cross section of host to backend functional distribution and interconnection methodology. This discussion represents an attempt to examine and classify several of these backend data base management machine configurations in terms of their operational parameters and application constraints. A formal taxonomy of such systems remains yet to be performed.
At least three distinct classes of data management machine (DMM) are evidenced in the literature; they are the large host backend, distributed network data node and smart peripheral. The intended classes of problem that the various authors envision amenable to solution by the DMM approach exhibit overlap while the performance envelope in which each DMM architecture would provide a technically acceptable, economically sound solution to a given user requirement set varies. Some of the papers used as source for this work contained no explicit mention of either the problem classes or performance constraints that the described configuration was to address; thus liberty has been taken in interpreting the implicit application goals of these authors.
A comparison of sequential and associate computing of priority queues
Authors: Landson Barry M. , Sargent Robert G. 
Published: January 2007

A comparison of priority queues on four different types of computer memories are made by ring a model to determine the total time to do comparable tasks. The four types of memories compared are random access (RAM), associate (AM), hybrid consisting of an associate memory and a random access memory (AM/RAM), and the hybrid memory with an auxiliary memory having the @@@@pability to perform Lewin's Associate algorithm @@@@], (AM/RAM/AML).
The model used for the comparisons is an extension of the MIX model developed by Knuth [1]. The MIX model was extended to include the four types of memories and the instruction set expanded include @@@@ instructions for the memories added. This @@del allows direct comparisons to be made of the different architectures and different software algorithms in performing the same tasks.