ppxscal/embedding_network huggingface dataset:
MagicMouse: an inexpensive 6-degree-of-freedom mouse
Authors: Eric Woods, Paul Mason, Mark Billinghurst
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

An inexpensive computer input device was developed that allows the user to operate within both 2D and 3D environments by simply moving and rotating their fist. Position and rotation around the X, Y and Z-axes are supported, allowing full six degree of freedom input. This is achieved by having the user wear a glove, to which is attached a square marker. Translation and rotation of the hand is tracked by a camera attached to the computer, using the ARToolKit software library. Extraction, calibration, normalisation and mapping of the data converts hand motion into meaningful operations within 2D and 3D environments. Four input scenarios are described, showing that the mapping of the position and rotation data to 2D or 3D operations depends heavily on the desired task.
Formal Specification of Geographic Data Processing Requirements
Authors: G.-C. Roman
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

A formal foundation for the specification of geographic data processing (GDP) requirements is established. Emphasis is on modeling data and knowledge requirements rather than processing needs. A subset of first-order logic is proposed as the principal means for constructing formalizations of the GDP requirements in a manner that is independent of the data representation. Requirements executability is achieved by selecting a subset of logic, compatible with the inference mechanisms available in Prolog. Concepts with GDP significance such as time, space, and accuracy are added for the formalization without losing Prolog implementability or separation of concerns. Rules of reasoning about time, space, and accuracy can be compactly stated in a subset of second-order predicate calculus and can be easily modified to meet the particular needs of a specific application. The feasibility of the approach is established with the aid of a prototype implementation of the formalism in Prolog. The implementation also provides the means for the graphical rendering of logical information on a high-resolution color display.
High-Performance 3-1 Interlock Collapsing ALU's
Authors: J. Phillips, S. Vassiliadis
Venue: IEEE Transactions on Computers (1994)

A high-performance 3-1 interlock collapsing ALU, i.e., an ALU that allows the execution of most execution interlocks in a single machine cycle, is presented. We focus on reducing the Boolean equations describing the device and the incorporation of new mechanisms in the interlock collapsing ALU design. In particular, we focus on the reduction of the critical path, regarding delay, for the interlock collapsing ALU implementation. It is shown that the delay associated with the implementation of the proposed device, in terms of logic stages, assuming a commonly available CMOS technology, is equivalent to the number of logic stages required for the implementation of a 3-1 binary adder. The resulting implementation demonstrates that the proposed 3-1 interlock collapsing ALU can be designed to outperform existing schemes for interlock collapsing ALU's by a factor of at least two. Finally, it is suggested that the proposed device can be used in the implementation of multiple instruction issuing machines, allowing the issuance and execution of interlocks in parallel and in a single machine cycle with no cycle time increases.
Roundtable Introduction
Authors: Hesham El-Rewini, Michael C. Mulder
Venue: Computer (1997)

In the past, educators asked themselves if they needed to change. Today the question is not if but how education will reengineer itself. The authors asked nine contributors how to reengineer the education infrastructure.In "Elements of Effective Computer Science," Peter Freeman challenges institutions to strike a balance between foundational and experimental training courses.In "Rethinking the Current Formula," Gordon Stokes describes the new discipline of information systems engineers. Graduates of such programs would have a foundation in computer science, but not the depth of the computer science specialist.In "Whom Are We Teaching?" Innes Jelly describes a new breed of student: one who must juggle family needs and career progression and who will demand value and relevance in the classroom.In "Blend of Old and New," Lillian Cassel advocates retaining the basics of a liberal arts education but throwing out the current grading system.In "Ethical Behavior in the Curriculum," Doris Lidtke challenges us to teach professional responsibility through courses like computing ethics, not just as a satellite module to technical topics, but as an equally important dimension of professionalism.In "Are We Ready to Scale Up Information Technology?" Stefano Russo wonders if academia can support the use of new computer-based technologies.In "New Possibilities for Distance Learning," Bernd Krämer addresses how to more closely capture the in-person interaction missing in current techniques and make cooperative work much more feasible.In "The Case for More Relevant Computing Skills," Jimmie Haines outlines the complex issue of how to truly partner with industry to ensure that graduates have the most critical skills: analytic ability and systemic thinking.In "Making the Structure More Flexible," Joe Turner points out that traditional educational structures do not support rapid change, and institutional procedures and policies may need to change radically to realize more flexible curricula. What educators do now has the potential to enrich or impede the growth of the information society. The solution, as in any reengineering effort, is to thoroughly understand the goals and requirements.
The Completion Time of Programs on Processors Subject to Failure and Repair
Authors: P. F. Chimento, K. S. Trivedi
Venue: IEEE Transactions on Computers (1993)

The authors describe a technique for computing the distribution of the completion time of a program on a server subject to failure and repair. Several realistic aspects of the system are included in the model. The server behavior is modeled by a semi-Markov process in order to accommodate nonexponential repair-time distributions. More importantly, the effect on the job completion time of the work lost due to the occurrence of a server failure is modeled. They derive a closed-form expression for the Laplace-Stieltjes transform (LST) of the time to completion distribution of programs on such systems. They then describe an effective numerical procedure for computing the completion time distribution. They show how these results apply to the analysis of different computer system structures and organizations of fault-tolerant systems. Finally, they use numerical solution methods to find the distribution of time to completion on several systems.
A Data/Knowledge Paradigm for the Modeling and Design of Operations Support Systems
Authors: Vijay K. Vaishnavi, Gary C. Buchanan, William L. Kuechler Jr.
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

This paper develops the Smart Object paradigm and its instantiation, which provide a new conceptualization for the modeling, design, and development of an important but little researched class of information systems, Operations Support Systems (OSS). OSS is our term for systems which provide interactive support for the management of large, complex operations environments, such as manufacturing plants, military operations, and large power generation facilities. The most salient feature of OSS' is their dynamic nature. The number and kind of elements composing the system as well as the mode of control of those elements change frequently in response to the environment. The abstraction of control and the ease with which complex dynamic control behavior can be modeled and simulated is one of the important aspects of the paradigm. The framework for the Smart Object paradigm is the fusion of object-oriented design models with declarative knowledge representation and active inferencing from AI models. Additional defining concepts from data/knowledge models, semantic data models, active databases, and frame based systems, are added to the synthesis as justified by their contribution to the ability to naturally model OSS at a high level of abstraction. The model assists in declaratively representing domain data/knowledge and its structure, and task or process knowledge, in addition to modeling multilevel control and interobject coordination.
Dependence of the minimal PVD TA(N) sealing thickness on the porosity of ZirkonTM LK Dielectric films
Authors: F. Iacopi, C. Zistl, C. Jehoul, Zs. Tokei, Q. T. Le, A. Das, C. Sullivan, G. Prokopowicz, D. Gronbeck, M. Gallagher, J. Calvert, K. Maex
Venue: Microelectronic Engineering (2002)

The understanding of the parameters and mechanisms playing a role in sealing the surfaces of porous dielectrics is fundamental for an effective integration of these new materials in the interconnect processing. This study focuses on the correlation between the porosity of Zirkon™ low-k dielectric films and the physical vapom deposition (PVD) Ta(N) thickness needed to achieve an efficient sealing of the dielectric surface. A clear dependence of the minimal Ta(N) sealing thickness on the porosity of the Zirkon dielectric films has been observed. Since the average pore size of the films remains approximately constant for the different porosity formulations, this effect is most probably attributed to a partial conversion of the initial 'closed pore' structure into an 'open pore' one for the highest porosity films.
Design and implementation of a parallel I/O runtime system for irregular applications
Authors: Jaechun No, Sung-soon Park, Jesus Carretero Perez, Alok Choudhary
Venue: Journal of Parallel and Distributed Computing (2002)

We present the design, implementation, and evaluation of a runtime system based on collective I/O techniques for irregular applications. The design is motivated by the requirements of a large number of science and engineering applications including teraflops applications, where the data must be reorganized into a canonical form for further processing or restarts. We present two designs: "collective I/O" and "pipelined collective I/O." In the first design, all processors participate in I/O simultaneously, making scheduling of I/O requests simpler but creating possible contention at the I/O nodes. In the second design, processors are organized into several groups so that only one group performs I/O while the next group performs the communication to rearrange data and this entire process is dynamically pipelined to reduce I/O node contention. In other words, the design provides support for dynamic contention management. We also present a software caching method using collective I/O to reduce I/O cost by reusing the data already present in the memory of other nodes. Chunking and on-line compression mechanisms are included in both models. We present performance results on the Intel Paragon at Caltech and on the ASCI/Red teraflops machine at Sandia National Laboratories.
Shock bowing and vorticity dynamics during propagation into different transverse density profiles
Authors: K. Kremeyer, S. Nazarenko, A. C. Newell
Venue: Physica D (2002)

A 2D numerical investigation is presented of shock wave propagation into a gas whose density is modulated in the transverse direction across the width of a shock tube. These density modulations represent temperature distributions in which low density corresponds to high temperature gas and high density corresponds to low temperature gas. This work is motivated by recent shock-plasma experiments, and mechanisms to explain the experimentally observed shock "splitting" signatures are investigated. It is found that the shock splitting signatures are more pronounced when the shock wave is more strongly curved or bowed. This occurs as the depth of the initial density profile is increased. The gross features of the shock splitting signatures are relatively insensitive to variations in the shape of the initial density profile (into which the shock propagates). Several interesting features of vorticity production and evolution are also indicated.
New proofs for minor properties in Matroid theory
Authors: Laurentiu Modan
Venue: Octogon Mathematical Magazine (2001)

In [4], [5] or in other works appeared after 1985, a very important and actual theorem, for the minor matroid theory, is presented. Its assertion will find here a complete proof.
Cache-Only Memory Architectures
Authors: Fredrik Dahlgren, Josep Torrellas
Venue: Computer (1999)

The shared-memory concept makes it easier to write parallel programs, but tuning the application to reduce the impact of frequent long-latency memory accesses still requires substantial programmer effort. Researchers have proposed using compilers, operating systems, or architectures to improve performance by allocating data close to the processors that use it.The Cache-Only Memory Architecture (COMA) increases the chances of data being available locally because the hardware transparently replicates the data and migrates it to the memory module of the node that is currently accessing it. Each memory module acts as a huge cache memory in which each block has a tag with the address and the state.The authors explain the functionality, architecture, performance, and complexity of COMA systems. They also outline different COMA designs, compare COMA to traditional nonuniform memory access (NUMA) systems, and describe proposed improvements in NUMA systems that target the same performance obstacles as COMA.
Software Engineering in Asia
Authors: Sadahiro Isoda, Motoshi Saeki
Venue: IEEE Software (1994)

Asia boasts a growing software industry spread across several countries. However, software technology in Asia still lags behind the US. To become competitive in the global marketplace, many Asian countries have started to improve their university systems and software-development industries. If successful, by 2001 their efforts will create an Asian software industry quite different from today's. The authors survey these efforts and sketch briefly the history of software development in each country. They survey recent trends in Asian software engineering from the industrial, educational, and organizational viewpoints, and offer an optimistic assessment of efforts toward modernization and regional cooperation.
Enumeration of sand piles
Authors: Sylvie Corteel
Venue: Discrete Mathematics (2002)

We study some particular families of integer partitions called "sand piles" which are discrete dynamical systems. Our aim is to link these objects with the theory of partitions in order to enumerate them. We first consider the Ice Pile model IPM(k). We compute explicit asymptotic bounds for the number of sand piles in IPM(k) with area n. We then give the area, width and height generating functions. All these results are derived using bijections and q-equations. We then consider another model called L(θ).
HASE DLX Simulation Model
Authors: Roland N. Ibbett
Venue: IEEE Micro (2000)

This DLX architecture model offers a variety of visualization mechanisms. Instructors use HASE both as a demonstration tool and as a platform for programming exercises through which students learn to appreciate the importance of code optimization at the software-hardware interface.
Hybrid Pattern Recognition Using Markov Networks
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Markov networks are inferred automatically for different classes of learning strings. In subsequent string-to-network alignments for test samples, the networks are used to deduce structural characteristics and to provide similarity measures. By processing the similarity measures as numerical-value features, standard nonparametric decision-theoretic pattern classifiers may be applied to determine class membership. The nearest-neighbor rule and linear discriminant-function classifiers are discussed, and their performances are compared with that of a maximum-likelihood classifier. The hybrid system's ability to determine string orientation correctly is investigated. Experiments with several thousand human banded chromosomes are reported.
Fault-Tolerant Design Strategies for High Reliability and Safety
Authors: N. F. Vaidya, D. K. Pradhan
Venue: IEEE Transactions on Computers (1993)

Several fundamental results related to reliability and safety are analyzed. Modular redundant systems consisting of multiple identical modules and an arbiter are considered. It is shown that for a given level of redundancy, a large number of implementation alternatives exist with varying degree of reliability and safety. Strategies are formulated that achieve a maximal combination of reliability and safety. The effect of increasing the number of modules on system reliability and safety is analyzed. It is shown that when one considers safety in addition to reliability, it does not necessarily help to simply add modules to the system. Specifically, increasing the number of modules by just one does not always improve both reliability and safety. To improve reliability and safety simultaneously, at least two additional modules are required when the outputs of the individual modules do not have any redundant information (e.g., coding for error detection). However, it is shown that if the modules themselves have built-in error detection capability, addition of just one module may be sufficient to improve both reliability and safety.
Reengineering a Configuration-Management System
Authors: Olin Bray, Michael M. Hess
Venue: IEEE Software (1995)

This paper describes the reengineering of a Sandia National Laboratories legacy system for managing engineering drawings/documentation that has evolved over the past 30 years. The approach used natural language information modeling and a 4GL language to understand, reengineer, and reimplement the system and interface it with other current and legacy systems, such as: a system which manages the assembly of serialized parts; and an optical storage system that is an on-line library of released graphical drawings, standards, documents, and procedures.
Spin injection from epitaxial ferromagnetic films into GaAs
Authors: M. Ramsteiner
Venue: Microelectronic Engineering (2002)

Electrical injection of spin polarized electrons is observed at ferromagnet-semiconductor interfaces by analyzing the electroluminescence signal of GaAs/(In,Ga)As light emitting diodes (LED) covered with the metals Fe or MnAs. The circular polarization degree of the emitted light reveals a spin polarization for recombining electrons of about 2%. Time-resolved data on spin relaxation times indicate that the actual spin injection efficiency from Fe into GaAs is about 5% at room temperature. The underlying injection mechanism is explained in terms of a tunneling process.
Effective Data Placement for Wireless Broadcast
Authors: Yon Dohn Chung, Myoung Ho Kim
Venue: Distributed and Parallel Databases (2001)

This paper investigates how to place data objects on air for wireless broadcast such that mobile clients can access the data in short latency. We first define and analyze the problem of wireless data placement, and also propose a measure, named Query Distance (QD), which represents the coherence degree of data set accessed by a query. We show that the problem is NP-complete, and then propose an effective data placement method that constructs the broadcast schedule by appending each query's data set in greedy way. We show through performance experiments that the proposed method reduces the access time of mobile query.
Recognition of freehand sketches using mean shift
Authors: Bo Yu
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

Freehand sketching is a natural and powerful means of interpersonal communication. But to date, it still cannot be supported effectively by human-computer interface. In this paper, we propose a robust method for sketch recognition. It uses mean shift, a nonparametric technique which can delineate arbitrarily shaped clusters, as a pre-process to analyze the direction-curvature joint space and suppress the severe noise of sketched strokes. Furthermore, it combines the vertex detection and primitive shape approximation into a unified and incremental procedure which, by fully utilizing the visual features, can handle hybrid and smooth curves gracefully. Our method does not rely on any domain-specific knowledge, and therefore it can be easily integrated with other high-level applications
Asynchronous Chain Recursions
Authors: J. Han, W. Lu
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

The authors study the compilation and efficient processing of asynchronous chain recursions and show that many complex function-free recursions, which may contain single or multiple linear recursive rules, nonlinear recursive rules, mutually recursive rules, and multiple-level recursions, can be compiled to asynchronous chain recursions. The study on the compilation methods, the simplification of compiled formulas, and the query-processing techniques shows that asynchronous chain recursions can be compiled to relatively simple compiled formulas and processed efficiently using transitive closure query-processing methods.
A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks
Authors: José Duato
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks was proposed in [12], [16]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. Also, two design methodologies were proposed. Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. A tree-like routing scheme is not suitable for hardware-supported multicast in wormhole networks because it produces many headers for each message, drastically increasing the probability of a message being blocked. A path-based multicast routing model was proposed in [25] for multicomputers with 2D-mesh and hypercube topologies. In this model, messages are not replicated at intermediate nodes. This paper develops the theoretical background for the design of deadlock-free adaptive multicast routing algorithms. This theory is valid for wormhole networks using the path-based routing model. It is also valid when messages with a single destination and multiple destinations are mixed together. The new channel dependencies produced by messages with several destinations are studied. Also, two theorems are proposed, developing conditions to verify that an adaptive multicast routing algorithm is deadlock-free, even when there are cyclic dependencies between channels. As an example, the multicast routing algorithms presented in [25] are extended, so that they can take advantage of the alternative paths offered by the network.
An Efficient Jacobi-Like Algorithm for Parallel Eigenvalue Computation
Authors: J. Gotze, S. Paul, M. Sauer
Venue: IEEE Transactions on Computers (1993)

A very fast Jacobi-like algorithm for the parallel solution of symmetric eigenvalue problems is proposed. It becomes possible by not focusing on the realization of the Jacobi rotation with a CORDIC processor, but by applying approximate rotations and adjusting them to single steps of the CORDIC algorithm, i.e., only one angle of the CORDIC angle sequence defines the Jacobi rotation in each step. This angle can be determined by some shift, add and compare operations. Although only linear convergence is obtained for the most simple version of the new algorithm, the overall operation count (shifts and adds) decreases dramatically. A slow increase of the number of involved CORDIC angles during the runtime retains quadratic convergence.