bluuebunny/crossref_metadata_2025_split huggingface dataset:
NYNEX intelligent systems group
Authors: Atwood M. E. 
Published: January 2007

The Intelligent Interfaces Group is an interdisciplinary group with interests in artificial intelligence, human-computer interaction, and cognitive science. The primary mission is to provide research and development support to both the regulated and unregulated business units of NYNEX (the Regional Bell Operating Company for New York and New England). The Group was started in October 1986. The Intelligent Interfaces Group is part of the Artificial Intelligence Laboratory; other groups in this Laboratory are Expert Systems, Neural Networks and Machine Learning, and Speech Technologies.
Staff members have interests in tutoring systems and tutoring strategies, the design and use of multi-modal communications systems, the evaluation of interactive systems, the development of software toolkits, and similar areas. Projects are selected to support these interests as well as have near-term practical benefits. Some projects are conducted at the request of NYNEX family units, others are initiated by staff members. All projects are funded by NYNEX.
A model for microarchitecture structure evaluation
Authors: Fernandes E. S. T. 
Published: January 2007

This paper presents the specification and implementation of a model oriented primarily to the evaluation of the structure of microarchitectures. According to the model, target architectures are described as an oriented graph which is examined by search algorithms in order to find the minimum cost path required in the execution of a set of machine primitives.
The model is very useful to determine the role of each target machine component: through the model it is possible to assess the effect of both including and removing architecture components on the overall performance of a machine being conceived.
The paper shows the main aspects of the project, discusses the research potential of the model, and describes the current stage of the work.
The automatic synthesis of recursive programs
Authors: Manna Zohar , Waldinger Richard 
Published: January 2007

We describe a deductive technique for the automatic construction of recursive programs to meet given input-output specifications. These specifications express what conditions the output of the desired program is expected to satisfy. The deductive technique involves transforming the specifications by a collection of rules, summoned by pattern-directed function invocation. Some of these transformation rules express the semantics of the subject domain; others represent more general programming techniques. The rules that introduce conditional expressions and recursive calls into the program are discussed in some detail.
The deductive techniques described are embedded in a running system called SYNSYS. This system accepts specifications expressed in high-level descriptive language and attempts to transform them into a corresponding LISP program. The transformation rules are expressed in the QLISP programming language. The synthesis of two programs performed by the system are presented.

This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under Contract MDA903-76-C-0206, by the National Science Foundation under Grant DCR72-03737 A01, by the Office of Naval Research under Contracts N00014-76-C-0687 and N00014-75-C-0816; and by a grant from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel.

The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of Stanford University, Stanford Research Institute, or the U.S. Government.
An overview of Knowledge Representation
Authors: Mylopoulos John 
Published: January 2007

This is a brief overview of terminology and issues related to Knowledge Representation (here-after KR) research, intended primarily for researchers working on Semantic Data Models within Database Management and Program Specifications within Programming Languages/Software Engineering.
Knowledge Representation is a central problem in Artificial Intelligence (AI) today. Its importance stems from the fact that the current design paradigm for “intelligent” systems stresses the need for expert knowledge in the system along with associated knowledge-handling facilities. This paradigm is in sharp contrast to earlier ones which might be termed “power-oriented” [Goldstein and Papert 77] in that they placed an emphasis on general purpose heuristic search techniques [Nilsson 71].
Dynamic system specification
Authors: Balzer Robert M. 
Published: January 2007

Our group is perhaps unique in that our approach to modeling dynamic systems has a strong heritage from all three fields represented at this workshop. Each of the fields has contributed four major concepts to our modeling approach.
From the Data Base field, we have adopted the idea of a single global model (data base) which defines the state of the system. Fully associative relations among typed atomic objects (no internal structure) constitute the entire state description. An information model (query language) is defined for extracting information from the state (such as one or all objects satisfying some description, or the truthfulness of some proposition). Finally, the model is updated via transactions, so that either the entire operation is completed successfully, or the state is unchanged.
Heterogeneous databases and high level abstraction
Authors: Katz Randy H. 
Published: January 2007

A heterogeneous database management system combines multiple dissimilar models of data within a single integrated system. The objective is to allow a user to access data independently of how it is actually organized. For example, a user may access a database as though it were stored relationally (i.e., in tables) [CODD70], even though it is actually stored as a CODASYL/DBTG or network database [CODA71]. In addition, different subpieces of the database may be organized under different data models. The heterogeneous database system must present these to the user as an integrated whole. The user's model of his data may be different from any of the models chosen to implement it.
Rather than construct a new database system from scratch, we are interested in constructing a heterogeneous system out of existing systems. The key difficulties with this approach are: (1) the formulation of database design methods that are applicable to a variety of different data models, and (2) the development of techniques to translate programs and data between dissimilar data models. In this paper, we briefly describe how high level abstraction has been applied to these problems. The use of abstraction in database systems is related to the application of abstraction techniques in programming languages and artificial intelligence research.
Relativism and views in a conceptual data base model
Authors: Kreps Peter 
Published: January 2007

The purpose of the Pingree Park Workshop was to bring together practitioners from the fields of Artificial Intelligence (AI), Database Management (DB), and Programming Languages (PL), to discover common issues, and to explore commonalities and differences in approaches to these issues. At the risk of being superficial let me try to summarily characterize the three fields and point to where I think they may fruitfully interact.
It seems to me that at its best, AI is an interdisciplinary science of cognition. It attempts to understand the bases for natural cognition, primarily by developing models of structures and processes that underlie cognition. By incorporation into interactive systems these models can be both exploited as artificially intelligent technology and explored for their adequacy in explaining natural cognition.
Incompleteness in knowledge bases
Authors: Levesque Hector J. 
Published: January 2007

The first topic for discussion at the High Level Abstraction Workshop was
What should be modelled?
that is, what aspects of the world (slice of reality / enterprise) must be dealt with in a high level conceptual model. I would like to address this question from the point of view of incomplete knowledge bases. Although my remarks pertain mainly to AI applications, I suspect that any application using an information system of some sort will eventually have to face similar issues.
The knowledge bases required in many applications can be characterized by a lack of complete information about the world of interest.
A three-level approach to the description of data structures, and notational framework
Authors: Meyer Bertrand 
Published: January 2007

When talking about data structures, whether local to a program or persistent over time, three different viewpoints are equally important. The first one is that of the user, who is interested in the external properties of a certain structure, more precisely, its noticeable behavior in response to outside effects (queries, requests for modifications, etc.). The second viewpoint is that of the language designer, who is in search of a small number of basic objects and building mechanisms which will allow for the description of complex objects in terms of simpler ones. The last view is that of the implementor, who must find efficient representations for the constructs thus described.
Based on this remark, a three-level description of data structures has been used by the author in previous work [6, 7, 8]. The three levels may be called:
Ulisse
Authors: Cerretti R. , Jasilli D. , Matteucci D. R. 
Published: January 2007

The paper describes a project conducted in collaboration between CNUCE, an Institute of the Italian National Research Council, and a private research center, concerning a multifunctional system (Ulisse) capable of operating both as a stand alone unit for office administration and automation (word processsing, file management and retrieval) and as an intelligent terminal with local facilities for text editing, text formatting and storage.
The first results of the application of Ulisse in the environment of the scientific users of CNUCE are illustrated.
APL as the foundation for a universal computer language
Authors: Dunwell Stephen W. 
Published: January 2007

Some ways in which universal computer languages differ from those in common use today. Universal dictionary. Universal alphabet. Universal character representation. Universal keyboard. Universal communication among computer systems. Elimination of an operating system as a separate entity.
Some advantages of universal computer languages over those in common use today. Easier to teach and to learn. Easier and faster creation and modification of software. Faster execution. Easier transfer of software from one system to another. Fewer application software packages required.
Some of the changes and additions required to make APL an acceptable universal computer language. Implement the APL interpreter at the chip level. Add language features to meet operating system requirements. Eliminate the features now required to communicate with operating systems of the present kind. Improve communication among users of a system. Improve the handling of integers. Improve the handling of graphics. Improve alphabet, character representation, and keyboard.
The second edition of my monograph on this subject will be available at the Copenhagen APL Conference.
A structured approach to analysis and design of complex systems
Authors: Evans F. , Jantzen J. 
Published: January 2007

An automatic control system for managing the heating of a modern building may involve several thousands of components and feedback loops. As such systems grow, decomposition into (nested) subsystems becomes increasingly necessary.
The subject of the poster session is complexity in large scale systems.
We think we can make the computer manage the complexity in any system that can be described in a block-diagram.
A variety of complex systems are represented by different types of block-diagrams. They have one theoretical concept in common: connectedness. Directed graphs (digraphs) can describe the fundamental concepts of structure and reachability, and graph theory provides a consistent mathematical theory of it.

The South Bank Polytechnic and the Technical University of Denmark are actively concerned through industrial collaborators with problems of

energy management for modern buildings

control of waste water in urban sewage networks

fuzzy control of industrial processes

engineering management systems

expert system design for fault diagnosis and food poisoning diagnosis.

All these problems require a tool for i) inputting and editing of graphs, and ii) an executable, array based model.
In the late 70'ies Franksen, Falster & Evans (1979) proposed a description of control systems based on a Boolean array representation of digraphs. At APL87 Fordyce & Sullivan presented an inference mechanism for VLSI chip manufacturing, also based on Boolean array structures (Fordyce & Sullivan, 1987). The APL89 conference had a similar nested array approach (Jantzen, 1989), and recently, the beginning of a whole theory, based on the 'digraph approach' has been published (Reinschke, 1988).
The poster session will present a digraph model, in which the nodes contain tree-structured, nested data. The oriented arcs display the flow of information. Internally each level of the diagram will be stored in a nested array. The user can draw the diagram directly on screen using a digitizer.

The session will include live demonstrations of

fault diagnosis on a water tank model of a sewage network

a structured approach to expert system design

interactive graphics for object oriented visual programming (APL2)

frame based data systems (APL2).

The demonstrations will emphasize the PC, PS/2 and RT/PC based aids to complexity management.
The digraph approach promises speed and space gains due to the purely Boolean array representations, as well as user-friendliness due to automatic decomposition techniques.
An application development platform
Authors: Kromberg Morten , Gfeller Martin 
Published: January 2007

While APL was a highly productive system for personal computing and application development when it was introduced, it is lacking nowadays in the areas of programming-in-the-large and user interface construction.
The design and implementation of a new Application Development Platform (ADP) is described. The ADP frees the programmer from user interface concerns, and frees the application from device specific code. The ADP ensures consistent user interfaces based on state-of-the-art window techniques.
Together with the underlying APL language, a software repository (Logos) and a data handling facility (ViewPoint®) the ADP is part of a full application environment.
The paper describes the underlying principles of our ADP. We also present a small worked out example comparing a traditional toolbox with the ADP.
What's ahead for 2000 A.D.?
Authors: Smith Howard J. 
Published: January 2007

On January 1, 2000 many applications will stop working properly. Most utilities and applications express the year as the two low order digits of the full representation of the year so that dates in the new century will appear to occur before dates in the old. When this phenomenon occurred in the past humans adapted quickly, and no great dislocation occurred.
Unfortunately, the computer is not as adaptable or reasonable as the human.
This paper presents one possible solution to the problem, at least in the APL environment. This solution involves replacing date fields in files and records with a pseudo-Julian day number (PJD). This number permits the analyst to use date information arithmetically to determine the day of the week, the period between dates, create lists of dates, etc. The PJD is easily converted to or from human-usable canonical date forms. Finally, the technique defers difficulties due to changes of year, century, millennium, etc. indefinitely.
In the later sections of the paper some thoughts on possible extensions to the leap-year algorithm are discussed. The new terms would improve precision without affecting the past or present. Finally, sample functions which support and utilize this “perpetual” calendar are given.
It must be emphasized that this paper represents a solution only within the APL environment. The concept is applicable in any environment, language or system but only if it or a similar solution is adopted before December 31, 1999. If we users of APL recognize and fix the problem in our environment while the rest of the computing world ignores it, the problem will still affect everyone, including us.
FRESH, an expert system design tool on APL2
Authors: Vermeulen J. W. B. , Spoor E. R. K. 
Published: January 2007

The emergence of commercially available expert system shells has opened up new avenues for large scale development of expert systems. However, this challenge also generates a new problem area concerned with ways of integrating such developments with existing information modelling environments. Expert system shells and conventional systems originate from distinct research areas with mutually differing modelling-views. These differences retard the natural incorporation of the new technology in existing environments.
To attack this problem, a migration path is required. The fundamentals of expert systems shells should be carefully grafted upon existing modelling views in order to bridge the gap.
This contribution describes the expert system design tool FRESH (Frame Relationship Expert-system SHell) and its underlying principles. The fundamentals of FRESH closely resemble those of the Entity-Relationship (ER) approach to information modelling. Some necessary adjustments, which enable knowledge representation, fit in naturally, without having the modelling view drift away from its origin.
FRESH has been implemented in APL2, exploiting the language's state of the art data structures and interactive capabilities. Also, APL2 provides excellent opportunities to interface expert system technology to traditional management information systems.
Traffic characterization of the NSFNET national backbone
Authors: Heimlich Steven A. 
Published: January 2007

Traditionally, models of packet arrival in communication networks have assumed either Poisson or compound Poisson arrival patterns. A study of a token ring local area network (LAN) at MIT [5] found that packet arrival followed neither of these models. Instead, traffic followed a more general model dubbed the “packet train,” which describes network traffic as a collection of packet streams traveling between pairs of nodes. A packet train consists of a number of packets travelling between a particular node pair.
This study examines the existence of packet trains on NSFNET, a high speed national backbone network. Train characteristics on NSFNET are not as striking as those found on the MIT local network; however, certain protocols exhibit quite strong train behavior given the great number of hosts communicating through the backbone.
Descriptions of the packet train model can be found in [3] and [5].
Onset and underpinnings of white matter atrophy at the very early stage of multiple sclerosis - a two-year longitudinal MRI/MRSI study of corpus callosum
Authors: Audoin B , Ibarrola D , Malikova I , Soulier E , Confort-Gouny S , Duong M-V Au , Reuter F , Viout P , Ali-Chérif A , Cozzone P J , Pelletier J , Ranjeva J-P 
Published: January 2007

Backgrounds Atrophy of corpus callosum (CC), a white matter structure linking the two hemispheres, is commonly observed in multiple sclerosis (MS). However, the occurrence and processes leading to this alteration are not yet determined. Goal and methods To better characterize the onset and progression of CC atrophy from the early stage of MS, we performed a two-year follow-up magnetic resonance imaging/magnetic resonance spectroscopic imaging (MRI/MRSI) exploration of CC in 24 patients with clinically isolated syndrome. These patients were explored using the same protocol at month (M)6, M12 and M24. MRI/MRSI techniques were applied to measure CC volume, and relative concentrations of N-acetylaspartate (NAA), creatine/phosphocreatine (Cr) and choline-containing compounds (Cho). A group of matched controls was also explored. Results Atrophy of CC, not present at baseline, was observed at M12 and progressed over the second year (M24). At baseline, a decrease in relative NAA level was observed in the anterior and posterior body of CC, with normalization during the follow-up period. In the anterior body, an increase in relative Cho level was observed, with normalization at M6. Normal relative Cr levels were observed at all time points in all sub-regions. The rate of CC atrophy was correlated with the change in the Expanded Disability Status Scale (EDSS) during the follow-up period. Conclusion These results suggest that CC atrophy appears over a period of one year after the first acute inflammatory episode, and that this atrophy is accompanied, especially in the anterior body of CC, by a normalization of the relative Cho levels, marker of acute inflammation, and NAA levels, marker of neuronal dysfunction and/or loss.
Apatite-group minerals from nepheline syenite, Pilansberg alkaline complex, South Africa
Authors: Liferovich R. P. , Mitchell R. H. 
Published: January 2007

AbstractThe nepheline syenites of the Pilansberg alkaline complex (South Africa) have undergone extensive subsolidus equilibration and alteration with a deuteric Cl- and Na-rich fluid phase. Complex assemblages of secondary minerals result from the replacement of primary alummosilicates, rinkite, eudialyte and fluorapatite. The composition of apatite group minerals formed during these alteration processes reflects the Sr- and rare earth element (REE) content, Na/Cl ratio and pH of the deuteric fluids. Apatite-group minerals are observed to have formed in the following sequence: orthomagmatic fluorapatite; strontian britholite-(Ce); strontian fluorapatite; Sr-apatite; REE-rich Sr-apatite; Sr-Na-REE- rich minerals approaching the stoichiometry of belovite-(Ce) and deloneite-(Ce); britholite-(Ce). Increasing alkalinity of the deuteric fluids is reflected by increasing amounts of Sr replacing Ca in apatite and culminates in the formation of Sr apatite containing 62.1 wt.% SrO (∼4.17 a.p.f.u. Sr). Pilansberg apatite-group minerals form a near-complete solid solution between fluorapatite and a fluorine analogue of Sr apatite with limited solution towards belovite-(Ce), Si-rich belovite-(Ce) and strontian britholite-(Ce).