ppxscal/embedding_network huggingface dataset:
SIRIO: a distributed information system over a heterogeneous computer network
Authors: C. R. Costilla, M. J. Bas, J. Villamor
Venue: ACM SIGMOD Record (1993)

This paper presents the SIRIO project, a commercial experience within Spanish industry, developed for Tecnatom S.A. by the Data and Knowledge Bases Research Group at the Technical University of Madrid. SIRIO runs over a heterogeneous local area network, with a client-server architecture, using the following tools: Oracle as RDBMS, running over a Unix server, TCP/IP as a communication protocol, Ethernet TOOLKIT for the distributed client-server architecture, and C as the host programming language for the distributed applications (every one of them is rather complex and very different from the rest). The system uses computers with MS-DOS, connected to the server over the LAN. SIRIO is mainly based on the conceptual design of an Rdb, upon which several distributed applications are operational as big software modules. These applications are: 1.- The inspection programs, the management of their corresponding criteria and the automatic generation of queries. 2.- Graphics processing and interface definition. 3.- Interactive Rdb updating. 4.- Historical db management. 5.- Massive load of on-field obtained data. 6.- Report and query application. The approach of the SIRIO integrated information system presented here is a pioneering one. There are about two dozen companies worldwide in this field and none has developed such an advanced system to this day. From 1992, SIRIO is totally operational in the Tecnatom S.A. industry. It constitutes an important tool to obtain the reports (from different plants) for the clients, for the State control organizations, and for the specialized analyst staff.
Efficient massively parallel simulation of dynamic channel assignment schemes for wireless cellular communications
Authors: Albert G. Greenberg, Boris D. Lubachevsky, David M. Nicol, Paul E. Wright
Venue: ACM SIGSIM Simulation Digest (1994)

Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. The driving events are called arrivals and departures, in continuous time, to cells geographically distributed across the service area. A dynamic channel assignment scheme decides which call arrivals to accept, and which channels to allocate to the accepted calls, attempting to minimize call blocking while ensuring co-channel interference is tolerably low. Specifically, the scheme ensures that the same channel is used concurrently at different cells only if the pairwise distances between those cells are sufficiently large. Much of the complexity of the system comes from ensuring this separation. The network is modeled as a system of interacting continuous time automata, each corresponding to a cell. To simulate the model, we use conservative methods; i.e., methods in which no errors occur in the course of the simulation and so no rollback or relaxation is needed. Implemented on a 16K processor MasPar MP-1, an elegant and simple technique provides speedups of about 15x over an optimized serial simulation running on a high speed workstation. A drawback of this technique, typical of conservative methods, is that processor utilization is rather low. To overcome this, we developed new methods that exploit slackness in event dependencies over short intervals of time, thereby raising the utilization to above 50% and the speedup over the optimized serial code to about 120x with respect to the workstation simulation.
On the type extensions of Oberon-2
Authors: Libero Nigro
Venue: ACM SIGPLAN Notices (1993)

Oberon-2, the latest Prof. N. Wirth language design, supports object - oriented (OO) programming through an original record type extension mechanism. The language is expected to gain a growing acceptance both in the academic and industrial worlds. This short note aims to make a critical evaluation of Oberon-200 facilities by showing how the current language definition can be too restrictive in the building of usual type hierarchies like those allowed, for instance, by C++. A minor extension is suggested which improves the effectiveness of Oberon-2.
Transforming high-level data-parallel programs into vector operations
Authors: Jan F. Prins, Daniel W. Palmer
Venue: ACM SIGPLAN Notices (1993)

Efficient parallel execution of a high-level data-parallel language based on nested sequences, higher order functions and generalized iterators can be realized in the vector model using a suitable representation of nested sequences and a small set of transformational rules to distribute iterators through the constructs of the language.
In search of the ideal prototype
Authors: Richard Muñoz, Harold H. Miller-Jacobs
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1992)

Common wisdom states rapid prototyping will result in a better product. Many tools are available to assist the practitioner in producing prototypes. Yet, few indications exist to show rapid prototyping has substantially improved how products are built. This panel will look at the following issues: Can rapid prototyping dramatically improve product development? How do developers integrate rapid prototyping into their existing development process? Are high fidelity tools helpful or do they actually impede development? What is the ideal prototype and how can we build it?
A high resolution event timer Ada package for DOS environments
Authors: Michael J. Paul, John E. Gochenouer
Venue: ACM SIGAda Ada Letters (1994)

DOS provides real time clock functions with a resolution of 55 milliseconds. Unfortunately, this is not sufficient for many applications. By directly accessing the IBM PC hardware, however, one can theoretically develop a timing function with the same resolution of the system clock. Direct hardware access, however, is not without side effects. The following paper discusses the difficulties in achieving high resolution timings and provides a practical Ada solution.
Bounded degree graph inference from walks
Authors: Vijay Raghavan
Venue: Journal of Computer and System Sciences (1994)

Aslam and Rivest considered the problem of inferring the smallest edge-colored graph of degree bound k consistent with the sequence of colors seen in a walk of the graph. Using Church-Rosser properties of certain sets of rewrite rules, they gave a polynomial time algorithm for the case of k = 2. The straightforward implementation of their ideas results in an O(n^5) algorithm, where n is the length of the walk. In this paper, we develop their ideas further and give an O(n log n) algorithm for the same problem. We also show that if the degree bound k is greater than two, then the decision version of the problem is NP-complete, thus settling a conjecture of Aslam and Rivest.
The successful CIO: integrating organizational and individual perspectives
Authors: Carol V. Brown
Venue: Proceedings of the 1993 conference on Computer personnel research (1993)

In alignment with the SIGCPR-93 conference theme, this paper examines &ldquo;what we know and don't know&rdquo; about the successful CIO from both the organizational and individual perspectives. Literature on the contextual characteristics of the CIO role and the nature of the work is first reviewed, followed by literature on the individual CIO's traits, skills, and behaviors. Two themes important for future research in this area emerge. First, today's typical CIO is operating under the dual objectives of increased control and increased responsiveness, with oversight responsibilities for dispersed IS managers and functions. Second, given this increase sharing of IS responsibilities with division management, a key challenge for today's CIO is to forge partnerships with senior management and division heads in order to exert influence without direct authority. Although no empirical research on the CIO partnership role was found, publications for practitioner audiences by leaders in the MIS field are reviewed for insights on this topic. Finally, a framework for future research which integrates these organizational and individual perspectives, as well as the new dependence on partnership relationships, is proposed.
Using Scheme in the introductory computer science curriculum (abstract)
Authors: Daniel P. Friedman, Brian Harvey, Simon Kaplan, Richard Salter, George Springer
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

Panelists will discuss the various aspects of using the SCHEME programming language as a tool for the instruction of computer science concepts in an introductory computer science course. This approach has been used both experimentally and on a regular basis at institutions in the United States and Europe focusing on the technologies for coping with the complexity of organization of large-scale software systems, as a reflection of general principles of software design. The course develops three basic means for decomposing difficult problems: building abstraction hierarchies, establishing conventional interfaces, and moving to new levels of linguistic description. There is significant laboratory work completed in the course using the SCHEME dialect of the programming language LISP, including such topics as modeling physical phenomena, event-based simulation, interpreters and compilers, and logic programming. The goal of the course is not to teach a programming language, but rather to explore important general principles of programming style using a number of the novel features of SCHEME. The members of the panel are nationally known faculty who are experienced in instruction and curriculum development using SCHEME, as well as authors of several well-known texts in this field. The session will include a brief presentation by each panel member followed by a discussion period in which conference attendees will be invited to ask questions and/or make comments.
Type checking type classes
Authors: Tobias Nipkow, Christian Prehofer
Venue: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1993)

We study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner's work on polymorphism by introducing a separate context constraining the type variables in a typing judgement. This lead to simple type inference systems and algorithms which closely resemble those for ML. In particular we present a new unification algorithm which is an extension of syntactic unification with constraint solving. The existence of principal types follows from an analysis of this unification algorithm.
The INtersect concept for multidatabase system integration in the pharmaceutical industry
Authors: Tony Schaller
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

The industry trends facing information systems in the 1990's involve a matrix of complex requirements. The migration from centralized mainframe computing to desktop personal computing has created opportunities and challenges in moving access to and control of information closer to the end-user. Within this new wave of computing, there has been a drive to move the access control for information to the desktop of the user. Although, graphical user standards were introduced in order to ease of use and provide a consistent look and feel to desktop applications. This provided some assistance in shielding the complexity of the various systems, however it did not address the difficulties presented in accessing heterogeneous database systems on various platforms.
The Grapheur: an original concept of curve drawing page maker implemented in C under Unix
Authors: M. Hassenforder, G. Gissinger
Venue: ACM SIGCHI Bulletin (1994)

This paper introduces a new kind of graphic page maker concept for curve drawing. The implemented tool is designed to handle scientific data, but the underlying structure enables it to be adapted to any kind of curve drawing. This tool is a filter translating numerical input data into a page of curves following a given page layout. The input data format is very flexible and the page layout is hierarchically split into sub elements. This hierarchy is displayed and can be modified in a specially designed editor. The tool is built with object oriented design allowing easy improvement. This feature has been tested, we have successfully added some new friendly objects, so future implementation is discussed.
Integrating ILP and EBL
Authors: Raymond J. Mooney, John M. Zelle
Venue: ACM SIGART Bulletin (1994)

This paper presents a review of recent work that integrates methods from Inductive Logic Programming (ILP) and Explanation-Based Learning (EBL). ILP and EBL methods have complementary strengths and weaknesses and a number of recent projects have effectively combined them into systems with better performance than either of the individual approaches. In particular, integrated systems have been developed for guiding induction with prior knowledge (ML-Smart, FOCL, GRENDEL) refining imperfect domain theories (FORTE, AUDREY, Rx), and learning effective search-control knowledge (AxA-EBL, DOLPHIN).
Constructing natural language interface applications to operating systems
Authors: Bill Z. Manaris, Jason W. Pritchard
Venue: Proceedings of the 1993 ACM conference on Computer science (1993)

A linguistic stratification analysis of mainstream operating system command languages is presented in the context of developing natural language interfaces to operating systems. Specifically, such interfaces incorporate an explicit conceptual model of the underlying operating system's semantic domain and may be viewed as abstraction barriers between two linguistic strata. The high-level linguistic stratum consists of the conceptual constructs employed by the user to describe elements of the semantic domain incorporated in the interface. The low-level linguistic stratum consists of the operating system linguistic elements that realize these conceptual constructs. The presented linguistic stratification analysis has been employed in the design of a user interface management system for developing natural language interfaces to operating systems. The significance of these results is demonstrated through the development of a natural language interface for the Unix operating system.
Approaches to passage retrieval in full text information systems
Authors: Gerard Salton
Venue: Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval (1993)

Large collections of full-text documents are now commonly used in automated information retrieval. When the stored document texts are long, the retrieval of complete documents may not be in the users' best interest. In such circumstance, efficient and effective retrieval results may be obtained by using passage retrieval strategies designed to retrieve text excerpts of varying size in response to statements of user interest. New approaches are described in this study for implementing selective passage retrieval systems, and identifying text passages responsive to particular user needs. An automated encyclopedia search system is used to evaluate the usefulness of the proposed methods.
Schema evolution in OODBs using class versioning
Authors: Simon Monk, Ian Sommerville
Venue: ACM SIGMOD Record (1993)

This paper describes work carried out on a model for the versioning of class definitions in an object-oriented database. By defining update and backdate functions on attributes of the previous and current version of a class definition, instances of any version of the class can be converted to instances of any other version. This allows programs written to access an old version of the schema to still use data created in the format of the changed schema.
Performance assertion checking
Authors: Sharon E. Perl, William E. Weihl
Venue: ACM SIGOPS Operating Systems Review (1993)

Performance assertion checking is an approach to automating the testing of performance properties of complex systems. System designers write assertions that capture expectations for performance; these assertions are checked automatically against monitoring data to detect potential performance bugs. Automatically checking expectations allows a designer to test a wide range of performance properties as a system evolves: data that meets expectations can be discarded automatically, focusing attention on data indicating potential problems.PSpec is a language for writing performance as sertions together with tools for testing assertions and estimating values for constants in assertions. The language is small and efficiently checkable, yet capable of expressing a wide variety of performance properties. Initial experience indicates that PSpec is a useful tool for performance testing and debugging; it helped uncover several performance bugs in the runtime system of a parallel programming language.
Science and Substance: A Challenge to Software Engineers
Authors: Norman Fenton, Shari Lawrence Pfleeger, Robert L. Glass
Venue: IEEE Software (1994)

For 25 years, software researchers have proposed improving software development and maintenance with new practices whose effectiveness is rarely, if ever, backed up by hard evidence. We suggest several ways to address the problem, and we challenge the community to invest in being more scientific.
Sparse polynomials and linear logic
Authors: Henry G. Baker
Venue: ACM SIGSAM Bulletin (1993)

The Gabriel FRPOLY benchmark was rewritten in a "linear" fragment of Common Lisp and is competitive with the standard FRPOLY benchmark code. This linear FRPOLY is considerably more perspicuous than the standard code, while its running time is only 6% longer than that of the standard FRPOLY code. Linear FRPOLY recovers all of its garbage, and its "high water mark" space requirement is very probably smaller than that of the standard code. In the expansion of (x+y+z+1)15, the standard FRPOLY does 48,892 new conses, while the linear FRPOLY does only 4821 new conses---i.e., it does only about 10% of the consing of the standard FRPOLY code.We also tested versions of FRPOLY in which squarings were not used for exponentiation. This non-linear FRPOLY does 38,780 conses, and takes only 59% of the time of the non-linear squaring FRPOLY. The linear non-squaring FRPOLY takes only 62% of the time of the linear squaring FRPOLY, and cuts the new consing to 3988 cells. A slightly slower version cuts the new consing to 2590 cells---only 567 cells (28%) more than are used in the result.
The international directory network and connected data information systems for research in the earth and space sciences
Authors: James R. Thieman
Venue: Proceedings of the 1993 ACM SIGMOD international conference on Management of data (1993)

Many researchers are becoming aware of the International Directory Network (IDN), an interconnected federation of international directories to Earth and space science data. These directories may become distributed nodes of a single, virtual master data directory of the future. Not as many are aware, however, of the many Earth-and-space-sciece-relevant information systems which can be accessed automatically from the directories. After determining potentially useful data sets in various disciplines through IDN directories it is becoming increasingly possible to get detailed information about the correlative possibilities of these data sets through the connected guide/catalog and inventory systems. Such capabilities as data set browse, subsetting, analysis, etc. are available now and will be improving in the future.
Computing tensor product decompositions
Authors: Dennis M. Snow
Venue: ACM Transactions on Mathematical Software (TOMS) (1993)

An algorithm is presented for computing the decomposition of a tensor product of two irreducible representations of a semisimple complex Lie group into its irreducible components. The algorithm uses a known formula which expresses the multiplicities of the highest weight vectors in the decomposition as an alternating sum indexed by the Weyl group. This sum is accomplished with minimal memory requirements using techniques developed previously by the author for efficiently computing Weyl group orbits. Examples are given for each of the exceptional Lie groups.
Interactive methods for visualizable geometry
Authors: Andrew J. Hanson, Tamara Munzner, George Francis
Venue: Computer (1994)

Interactive computer graphics can provide new insights into the objects of pure geometry, providing intuitively useful images, and, in some cases, unexpected results. Interactive computer graphics systems have opened a new era in the visualization of pure geometry. We demonstrate the fruitful relationship between mathematics and the discipline of computer graphics, emphasizing those areas of low-dimensional geometry and topology where interactive paradigms are of growing importance.
An Investigation of Methods for Determining Depth from Focus
Authors: John Ens, Peter Lawrence
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The concept of depth from focus involves calculating distances to points in an observed scene by modeling the effect that the camera's focal parameters have on images acquired with a small depth of field. This technique is passive and requires only a single camera. The most difficult segment of calculating depth from focus is deconvolving the defocus operator from the scene and modeling it. Most current methods for determining the defocus operator employ inverse filtering. The authors reveal some fundamental problems with inverse filtering: inaccuracies in finding the frequency domain representation, windowing effects, and border effects. A general, matrix-based method using regularization is presented, which eliminates these problems. The new method is confirmed experimentally, with the results showing an RMS error of 1.3%.
The visibility complex
Authors: Michel Pocchiola, Gert Vegter
Venue: Proceedings of the ninth annual symposium on Computational geometry (1993)

We introduce the visibility complex of a collection O of n pairwise disjoint convex objects in the plane. This 2-dimensiotnal cell complex may be considered as a generalization of the tangent visibility graph of O . Its space complexity k is proportional to the size of the tangent visibility graph. We give an Onlogn+k algorithm for its construction. Furthermore we show how the visibility complex can be used to compute the view from a point or a convex object with respect to O in Omlogn time, where m is the size of the view. The view from a point is a generalization of the visibility polygon of that point with respect to O .
PCBN: A High-Performance Partitionable Circular Bus Network for Distributed Systems
Authors: Tai-Kuo Woo, Stanley Y. W. Su
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The authors present a dynamically partitionable circular bus network (PCBN) and efficient algorithms for maximizing its utilization. In their approach, a distributed network is transformed into a graph, in which a vertex represents a communication request and an edge denotes the conflict between a pair of communication requests. A graph traversal algorithm is applied to the graph to identify some maximal independent sets of vertices. The communication requests corresponding to the vertices of a maximum independent set call proceed in parallel. By computing the expected size of the maximal independent sets of a graph, the improvement ratio of the network can be obtained. The network control and synchronization techniques of PCBN are described in detail. The idling problem in the execution of nonconflicting requests is also discussed.