ppxscal/embedding_network huggingface dataset:
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
Authors: Nicola Geismann, Michael Hemmer, Elmar Schömer
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

We present two approaches to the problem of calculating a cell in a 3- dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It works with reductions to planar arrangements of algebraic curves. Degenerate situations such as tangential intersections and self-intersections of curves are intrinsic to the planar arrangements we obtain. The coordinates of the intersection points are given by the roots of univariate polynomials. We succeed in locating all intersection points either by extended local box hit counting arguments or by globally characterizing them with simple square root expressions. The latter is realized by a clever factorization of the univariate polynomials. Only the combination of these two results facilitates a practical and implementable algorithm.The second approach operates directly in 3-space by applying classical solid modeling techniques. Whereas the first approach guarantees a correct solution in every case the second one may fail in some degenerate situations. But with the help of verified floating point arithmetic it can detect these critical cases and is faster if the quadrics are in general position.
Zassenhaus Lie Idempotents, q-Bracketing and a New Exponential/Logarithm Correspondence
Authors: G. Duchamp, D. Krob, E. A. Vassilieva
Venue: Journal of Algebraic Combinatorics: An International Journal (2000)

We introduce a new i>q-exponential/logarithm correspondance that allows us to solve a conjecture relating Zassenhauss Lie idempotents with other Lie idempotents related to the i>q-bracketing operator.
Meta-level architectures for component-based mobile computing
Authors: Arnel I. Periquet, Eric C. Lin
Venue: Mobile Networks and Applications (2001)

We present an approach to mobile-aware application development that integrates mobile-awareness into existing distributed component designs. Our proposed mobile components encapsulate a context of distributed components that collaborate to fulfill a set of published application functions. The approach os based on a set of meta-level architectures for mobility. First, we present a reflective layered-adaptation model derived from a proposed set of dynamic adaptation architectures. Then, we present a set of mobility-enhanced component services and corresponding object-oriented architectures for their realization. The approach is demonstrated with the development of a video delivery component. We show how mobile awareness can be integrated into an existing component-based design based on our proposed mobility-enhanced CORBA-based services.
Multilevel operating systems
Authors: William Orchard-Hays
Venue: Communications of the ACM (1966)

The basic software for all newer computers is built on the well-established need for standard operating systems. This implies that all applications&mdash;no matter how large, complex or time consuming&mdash;must operate under (or, more precisely, on top of) the standard system. Large applications require supervisory monitors which handle problems similar to those of the operating systems, but at a different level. Sometimes, still a third or even a fourth such level is required or desirable. This leads naturally to the concept of multilevel systems&mdash;similar vertically, but different horizontally. Proper division of responsibility between levels leads to greater efficiency and less logical complexity, while actually enhancing capability.
AFTA: a formal delay model for functional thinking analysis
Authors: V. Chandramouli, J. P. Whittemore, K. A. Sakallah
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Despite its importance, we find that a rigorous theoretical foundation for performing timing analysis has been lacking so far. As a result, we have initiated a research project that aims to provide such a foundation for functional timing analysis. As part of this work we have developed an abstract automaton based delay model that accounts for the various analog factors affecting delay, such as signals slopes, near simultaneous switching, etc., while at the same timweb accounting for circuit functionality. This paper presents this delay model
Model-Based Brightness Constraints: On Direct Estimation of Structure and Motion
Authors: Gideon P. Stein, Amnon Shashua
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

We describe a new direct method for estimating structure and motion from image intensities of multiple views. We extend the direct methods of Horn and Weldon [18] to three views. Adding the third view enables us to solve for motion and compute a dense depth map of the scene, directly from image spatio-temporal derivatives in a linear manner without first having to find point correspondences or compute optical flow. We describe the advantages and limitations of this method which are then verified with experiments using real images
An overview of the University of Texas at Dallas' center for advanced telecommunications systems and services (CATSS)
Authors: Imrich Chlamtac, Stefano Basagni, Stephen Gibbs
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2000)

The University of Texas at Dallas' Center for Advanced Telecommunications Systems and Services (CATSS) was founded in January 1998 to satisfy the acute needs of the growing Dallas/Richardson telecommunications industry. Its mission is to foster a strong Industry-University partnership to advance local telecommunications industries to the next generation of systems and products. Composed of UTD faculty and industry researchers and managers, the Center's focus is exclusively telecommunications-related fields of study and research. The technical foci of the Center reflect the current needs of the telecommunications industry, including but not limited to wireless and optical networking. The Center's work spans the entire range of available technical expertise---hardware, communications, transmission modalities, algorithms, systems architecture, and applications. As part of its activities, the Center organizes workshops and conferences on topics solicited by industry and the community. It offers seminars and courses featuring talks from leading experts both from the public and private sectors, and publishes journals and magazines. By accomplishing this, CATSS serves as a clearing house for advanced telecommunications research and development in the short run, and incubates long term vision, enabling a continuation of the robust development and rapid expansion of the telecommunications industry.
Accumulative versioning file system Moraine and its application to metrics environment MAME
Authors: Tetsuo Yamamoto, Makoto Matsushita, Katsuro Inoue
Venue: ACM SIGSOFT Software Engineering Notes (2000)

It is essential to manage versions of software products created during software development. There are various versioning tools actually used in these days, although most of them require the developers to issue management commands for consistent versioning. In this paper, we present a novel versioning file system Moraine, which accumulatively and automatically collects all files created or modified. Those files are versioned and stored as compressed forms. The older versions are easily retrieved from Moraine by the time-stamps or tags if required. Using Moraine system, we have developed a metrics (measurement) environment called MAME (Moraine As a Metrics Environment). MAME can collect various metrics data for on-going or past projects, since its basis, Moraine, is able to retrieve all versions of all products (files). Both Moraine and MAME have been implemented. Using these systems, we have evaluated the performance of Moraine and MAME with various test data and student project data. The result shows that disk space required by this approach is several times larger than ordinary approaches; however, it is acceptable at the current tendency of disk price decrease. By this approach, an ideal metrics environment has been easily established by developing simple data-collection tools for version files.
A New Method for Testing Re-Programmable PLAs
Authors: Charles E. Stroud, James R. Bailey, Johan R. Emmert
Venue: Journal of Electronic Testing: Theory and Applications (2000)

We present a method for obtaining a minimal set of test configurations and their associated set of test patterns that completely tests re-programmable Programmable Logic Arrays (PLAs) including EEPROM, UV-EPROM, and SRAM based re-programmable PLAs typically found in Complex Programmable Logic Devices (CPLDs). The resultant set of test configurations and vectors detect all single and multiple stuck-at faults (including line and transistor faults) as well as all bridging faults in the PLA. Previously proposed test methods proposed for EEPROM based PLAs (IEEE Trans. on CAD, Vol. 13, No. 7, pp.935&ndash;939, 1994;Proc. IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, 1998, pp. 146&ndash;154) require additional test hardware as well as a large number of test configurations and vectors for complete testing. Our approach requires no modification to the PLA and only two or four test configurations, depending on the ratio of PLA product terms to inputs.
m-powering personnel for e-business change
Authors: Colin Ash, Janice Burn
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

The paper examines a model that proposes various antecedents to successful e-business change management in ERP environments. A case study of an m-commerce project for a personnel management system within a large traditional engineering company is described in the context of this model. The specific goal of the research is to determine facilitators that lead to e-business project success of these change efforts. The results show that performance gains from the Intranet-ERP project were accompanied by the presences of facilitators in all dimensions of the framework. Of particular importance were those components related to employee empowerment &mdash; knowledge management, relationship building, and learning capacity. This has implications for both IT and user personnel and the future governance of the organisation.
A Survey of Data Structures for Computer Graphics Systems
Authors: Robin Williams
Venue: ACM Computing Surveys (CSUR) (1971)

This is a survey of a data structures and their use in computer graphics systems. First, the reasons for using data structures are given. Then the sequential, random, and list organizations are discussed, and it is shown how they may be used to build complex data structures. Representative samples of languages specifically designed for creating and manipulating data structures are described next. Finally some typical computer graphics systems and their data structures are described. It is also pointed out that much work remains to be done to develop a satisfactory theoretical foundation for designing data structures.
The ABCD's of Paxos
Authors: Butler Lampson
Venue: Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (2001)

We explain how consensus is used to implement replicated state machines, the general mechanism for fault-tolerance. We describe an abstract version of Lamport's Paxos algorithm for asynchronous consensus. Then we derive the Byzantine, classic, and disk versions of Paxos from the abstract one, show how they are related to each other, and discuss the safety, liveness, and performance of each one.
On the conversion of programs to decision tables: method and objectives
Authors: John C. Cavouras
Venue: Communications of the ACM (1974)

The problems of converting programs to decision tables are investigated. Objectives of these conversions are mainly program debugging and optimization in practice. Extensions to the theory of computation and computability are suggested.
Efficient techniques for accurate modeling and simulation of substrate coupling in mixed-signal IC's
Authors: J.-P. Costa, M. Chou, L. M. Silveira
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Industry trends aimed at integrating higher levels of circuit functionality have triggered a proliferation of mixed analog-digital systems. Magnified noise coupling through the common chip substrate has made the design and verification of such systems an increasingly difficult task. In this paper we present a fast eigendecomposition technique that accelerates operator application in BEM methods and avoids the dense-matrix storage while taking all of the substrate boundary effects into account explicitly. This technique can be used for accurate and efficient modeling of substrate coupling effects in mixed-signal integrated circuits.
Post-layout timing-driven cell placement using an accurate net length model with movable Steiner points
Authors: Amir H. Ajami, Massoud Pedram
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

This paper presents a new algorithm for timing-driven cell placement using the notion of movable Steiner points that capture the net topology. The proposed algorithm improves the timing closure at the backend of the EDA design flow. Unlike conventional flows that perform placement and routing in two separate steps and use rough estimates of the net lengths during placement, our algorithm uses accurate net lengths by considering the net topologies during the Elmore delay calculation step and dynamically updates the routing during the concurrent placement of Steiner points and cells. The simultaneous placement and routing problem is formulated as a mathematical program with a small number of variables and solved by the Han-Powell method. Experimental results demonstrate the effectiveness of the new approach compared to the conventional flows.
Preserving average proximity in arrays
Authors: Richard A. DeMillo, Stanley C. Eisenstat, Richard J. Lipton
Venue: Communications of the ACM (1978)

Programmers and data structure designers are often forced to choose between alternative structures. In storing these structures, preserving logical adjacencies or &ldquo;proximity&rdquo; is usually an important consideration. The combinatorial problem of storing arrays as various kinds of list structures is examined. Embeddings of graphs are used to model the loss of proximity involved in such storage schemes, and an elementary proof that arrays cannot be stored as linear lists with bounded loss of proximity is presented. Average loss of proximity is then considered, and it is shown that arrays cannot be stored as linear lists with only bounded loss of average proximity, but can be so stored in binary trees. The former result implies, for instance, that row major order is an asymptotically optimal storage strategy for arrays.
The NASA Digital Earth Testbed
Authors: Jeff de La Beaujardière, Horace Mitchell, Robert Raskin, Ananth Rao
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

The goal of Digital Earth (www.digitalearth.gov) is to create a virtual representation of our planet that enables a person to explore and interact with the vast amounts of natural and cultural information gathered about the Earth. The challenge is enormous, and a critical first step is interoperability among the servers, viewers, catalogs and middleware services in such a distributed computing network. As part of its contribution to the public/private/academic Digital Earth (DE) partnership, a NASA Testbed is implementing the OpenGIS Consortium (OGC) Web Map Server Interface Specification on several data servers and viewer clients, and is building an OGC Catalog Services prototype implementation. Viewers will include a web-based client, an immersive 3D workbench client, and a wall-sized museum display client. Servers will provide global, regional and local environmental information from satellites, climate models and ground stations. This paper describes the Web Mapping spec and the components of the NASA DE Testbed.
Teaching HCI with scenario-based design: the constructivist's synthesis
Authors: Kam Hou Vat
Venue: ACM SIGCSE Bulletin (2001)

This paper describes the application of scenario-based design in the teaching of Human-Computer Interaction (HCI), in an undergraduate Software Engineering program. Specifically, we describe how the ideas of constructivism can be synthesized with the team-based efforts in managing software requirements. The paper serves as an experience report of an ongoing action research the author has been executing to revise the curriculum and pedagogy of a junior core course entitled Software Psychology. In particular, we depict some problem scenarios, helping the evolution of the course content, and developing our students as self-directed work teams of software professionals. The paper concludes with the author's lessons learned with this course enactment plus the necessary reflective evaluations therein.
Wiring requirement and three-dimensional integration of field-programmable gate arrays
Authors: Arifur Rahman, Shamik Das, Anantha Chandraksan, Rafael Reif
Venue: Proceedings of the 2001 international workshop on System-level interconnect prediction (2001)

In this paper analytical models for predicting interconnect requireðments in field-programmable gate arrays (FPGAs) are presented, and opportunities for 3-D implementation of FPGAs are examined. The analytical models for 2-D FPGAs are calibrated by routing and placement experiments with benchmark circuits and extended to 3-D FPGAs. Based on system-level modeling, we find that in FPGAs with 20K 4-input look-up tables, the reduction in channel width, interconnect delay, and power dissipation can be over 50% by 3-D implementation.
An inductive approach to language translation
Authors: Ramon D. Faulk
Venue: Communications of the ACM (1964)

The possibility of natural language translation by means of fixed operations on example translation is considered. The conception of sentence translation which motivates the work is informally presented, and the measurement of physical similarity in pairs of strings is discussed, a nation which plays a central role in the proposed type of translator. Experimental evidence is presented in support of the premise upon which this conception is based.
The Fuhrmann-Realization for Multi-Operator Systems inthe Behavioral Context
Authors: Heide Gluesing-Luerssen
Venue: Multidimensional Systems and Signal Processing (2000)

We use the polynomial approach of Fuhrmann to construct explicit first-order input /latent variable /output realizations for systems with several operators acting on a function space. The class of systems being covered includes certain types of delay-differential, partial differential, and discrete-time mD-systems.
Some practical experience with a software quality assurance program
Authors: G. G. Gustafson, Roberta J. Kerr
Venue: Communications of the ACM (1982)

Within a production programming environment, a software quality assurance program (QAP) was instituted to produce standards, conventions, and methodologies for all phases of the software development process. Software language standards and several support processors, in turn, developed. The authors offer a plan which may help others avoid some of the pitfalls they experienced while attempting to construct a meaningful software QAP.
Justifying the business value of information systems education: a report on multi-cultural field experiments
Authors: John T. Nosek
Venue: Proceedings of the 2001 ACM SIGCPR conference on Computer personnel research (2001)

There is little empirical evidence to support the value of information systems education and training. While IS training is conducted because of its direct impact on the accretion of skills, the lack of empirical evidence for the value of information systems education limits resource allocation for it. As organizations employ information technology which is more difficult to justify using standard cost/benefit methods, user information satisfaction (UIS) is becoming a useful metric to measure the business value of IT. In two multi-cultural field experiments it was found that information systems education caused statistically significant affects in UIS. In general, after viewing a video on the IS development process, end users became more satisfied with the information product and less satisfied with some aspects of IS support and staff, especially, the usual education and training provided.
PVFS: A Parallel Virtual File System for Linux Clusters
Authors: Ibrahim F. Haddad
Venue: Linux Journal (2000)

An introduction to the Parallel Virtual File System and a look at how one company installed and tested it.
MIN&mdash;an optimal variable-space page replacement algorithm
Authors: Barton G. Prieve, R. S. Fabry
Venue: Communications of the ACM (1976)

A criterion for comparing variable space page replacement algorithms is presented. An optimum page replacement algorithm, called VMIN, is described and shown to be optimum with respect to this criterion. The results of simulating VMIN, Denning's working set, and the page partitioning replacement algorithms on five virtual memory programs are presented to demonstrate the improvement possible over the known realizable variable space algorithms.
A constraint-based application model and scheduling techniques for power-aware systems
Authors: Jinfeng Liu, Pai H. Chou, Nader Bagherzadeh, Fadi Kurdahi
Venue: Proceedings of the ninth international symposium on Hardware/software codesign (2001)

New embedded systems must be power-aware, not just low-power. That is, they must track their power sources and the changing power and performance constraints imposed by the environment. Moreover, they must fully explore and integrate many novel power management techniques. Unfortunately, these techniques are often incompatible with each other due to overspecialized formulations or they fail to consider system-wide issues. This paper proposes a new graph-based model to integrate novel power management techniques and facilitate design-space exploration of power-aware embedded systems. It captures min/max timing and min/max power constraints on computation and non-computation tasks through a new constraint classification and enables derivation of flexible system-level schedules. We demonstrate the effectiveness of this model with a power-aware scheduler on real mission-critical applications. Experimental results show that our automated techniques can improve performance and reduce energy cost simultaneously. The application model and scheduling tool presented in this paper form the basis of the IMPACCT system-level framework that will enable designers to aggressively explore many power-performance trade-offs with confidence.
Algorithms for energy-efficient multicasting in static ad hoc wireless networks
Authors: Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Ephremides
Venue: Mobile Networks and Applications (2001)

In this paper we address the problem of multicasting in ad hoc wireless networks from the viewpoint of energy efficiency. We discuss the impact of hte wireless medium on the multicasting problem and the fundamental trade-offs that arise. We propose and evaluate several algorithms for defining multicast trees for session (or connection-oriented) traffic when transceiver resources are limited. The algorithms select the relay nodes and the corresponding transmission power levels, and achieve different degrees of scalability and performance. We demonstrate that the incorporation of energy considerations into multicast algorithms can, indeed, result in improved energy efficiency.