ppxscal/embedding_network huggingface dataset:
UQBT: Adaptable Binary Translation at Low Cost
Authors: Cristina Cifuentes, Mike Van Emmerik
Venue: Computer (2000)

Developments in the semiconductor industry have made possible smaller and faster processors for general-purpose computing, portable devices, multipurpose appliances, and system-on-chip designs. Binary translation offers a quick, inexpensive way to migrate software from one processor to another.Although binary-translation techniques are still in their infancy compared to their compiler counterparts, engineers have been using them for 15 years. Just as engineers build compilers partly on the basis of specifications, the authors are developing the University of Queensland Binary Translator (UQBT) on the basis of machine specifications and properties of machines and operating systems. This static binary-translation framework supports various processors, including complex- instruction-set computers (CISC), reduced-instruction-set computers (RISC), and stack-based machines.The authors describe the UQBT framework and discuss their observations while using it to instantiate six different translators across Sun Sparc, Intel Pentium, and Java virtual-machine architectures.
A Modified General Regression Neural Network (MGRNN) with new, efficient training algorithms as a robust 'black box'-tool for data analysis
Authors: Dirk Tomandl, Andreas Schober
Venue: Neural Networks (2001)

A Modified General Regression Neural Network (MGRNN) is presented as an easy-to-use 'black box'-tool to feed in available data and obtain a reasonable regression surface. The MGRNN is based on the General Regression Neural Network by D. Specht [Specht, D. (1991). A General Regression Neural Network. IEEE Transactions on Neural Networks, 2(6), 568-576], therefore, the network's architecture and weights are determined. The kernel width of each training sample is trained by two supervised training algorithms. These fast and reliable algorithms require four user-definable parameters, but are robust against changes of the parameters. Its generalization ability was tested with different benchmarks: intertwined spirals, Mackey--Glass time series and PROBEN1. The MGRNN provides two additional features: (1) it is trainable with arbitrary data as long as a suitable metric exists. Particularly, it is unnecessary to force the data structure to vectors of equal length; (2) it is able to compute the gradient of the regression surface as long as the gradient of the metric is definable and defined. The MGRNN solves common practical problems of common feed-forward networks.
Advances in Windows NT Storage Management
Authors: Luis Felipe Cabrera, Brian Andrew, Kyle Peltonen, Norbert Kusters
Venue: Computer (1998)

Windows NT 5.0 introduces fundamental changes to storage management. The new infrastructure in NT 5.0 can adapt to future changes in storage devices and media, brings a more powerful set of management mechanisms, and supports more base services within the system. Most of the changes are transparent to legacy applications and to users, but software producers who want to deploy advanced functionality should realize increased benefits from the underlying infrastructure. Windows NT now supports the dynamic plug-and-play of storage devices and the growth and mounting of storage volumes. It also frees the NT system from drive letter limitations and incorporates several new file system features to aid the development of enterprise-class storage management solutions. This article describes two new mechanisms present in Windows NT 5.0, the reliable change journal and the reparse points. It also presents storage management infrastructure subsystems and services that help administer storage. Both mechanisms are designed to facilitate the robust and efficient administration of an increasing volume of data whose lifetime grows over time.
Design of Self-Diagnostic Boards by Multiple Signature Analysis
Authors: M. G. Karpovsky, S. M. Chaudhry
Venue: IEEE Transactions on Computers (1993)

A new design approach, based on multiple signature analysis, for self-diagnostic boards is presented. For this approach, test responses from all chips on the board are compressed into space-time signatures using nonbinary multiple error-correcting codes, and faulty chips are identified by analyzing relations between distortions in these signatures. This approach results in a considerable reduction of a hardware overhead, required for diagnostics, as compared with the straightforward approach where separate signatures are computed for each chip on the board. The diagnostic approach presented can also be used for identification of faulty boards in a system or for faulty processors in a multiprocessor environment.
User-Interface Management Control and Communication
Authors: Rex Hartson
Venue: IEEE Software (1989)

The author addresses how to separate components in an interactive system, illustrating and comparing approaches to separation. He then describes how to achieve control among these components. He presents the concept of two communication levels to support separation. The author covers the distinction between dialogue and semantics, runtime architecture, the choice of interaction style, dialogue control, communication issues to consider when deciding component separation, and the use of object-oriented programming.
Abbreviated text input
Authors: Stuart M. Shieber, Ellie Baker
Venue: Proceedings of the 8th international conference on Intelligent user interfaces (2003)

We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on PDAs or cell phones or by disabled users) by taking advantage of the informational redundacy in natural language. Previous approaches to this problem have been based on the idea of prediction of the text, but these require the user to take overt action to verify or select the system's predictions. We propose taking advantage of the duality between prediction and compression. We allow the user to enter text in compressed form, in particular, using a simple stipulated abbreviation method that reduces characters by about 30% yet is simple enough that it can be learned easily and generated relatively fluently. Using statistical language processing techniques, we can decode the abbreviated text with a residual word error rate of about 3%, and we expect that simple adaptive methods can improve this to about 1.5%. Because the system's operation is completely independent from the user's, the overhead from cognitive task switching and attending to the system's actions online is eliminated, opening up the possibility that the compression-based method can achieve text input efficiency improvements where the prediction-based methods have not
Parallel Simulated Annealing using Speculative Computation
Authors: E. E. Witte, R. D. Chamberlain, M. A. Franklin
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

A parallel simulated annealing algorithm that is problem-independent, maintains the serial decision sequence, and obtains speedup which can exceed log/sub 2/P on P processors is discussed. The algorithm achieves parallelism by using the concurrency technique of speculative computation. Implementation of the parallel algorithm on a hypercube multiprocessor and application to a task assignment problem are described. The simulated annealing solutions are shown to be, on average, 28% better than the solutions produced by a random task assignment algorithm and 2% better than the solutions produced by a heuristic.
Unbiased Estimation and Statistical Analysis of 3-D Rigid Motion from Two Views
Authors: K. Kanatani
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The problem of estimating 3D rigid motion from point correspondences over two views is formulated as nonlinear least-squares (LS) optimization, and the statistical behaviors of the errors in the solution are analyzed by introducing a realistic model of noise described in terms of the covariance matrices of N-vectors. It is shown that the LS solution based on the epipolar constraint is statistically biased. The geometry of this bias is described in both quantitative and qualitative terms. Finally, an unbiased estimation scheme is presented, and random number simulations are conducted to observe its effectiveness.
Automated Smoothing of Image and Other Regularly Spaced Data
Authors: M. Berman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper is primarily motivated by the problem of automatically removing unwanted noise from high-dimensional remote sensing imagery. The initial step involves the transformation of the data to a space of intrinsically lower dimensionality and the smoothing of images in the new space. Different images require different amounts of smoothing. The signal (assumed to be mostly smooth with relatively few discontinuities) is estimated from the data using the method of generalized cross-validation. It is shown how the generalized cross-validated thin-plate smoothing spline with observations on a regular grid (in d-dimensions) is easily approximated and computed in the Fourier domain. Space domain approximations are also investigated. The technique is applied to some remote sensing data.
Abstract Models of Storage
Authors: Robert D. Tennent, Dan R. Ghica
Venue: Higher-Order and Symbolic Computation (2000)

This note is a historical survey of Christopher Strachey's influence on the development of semantic models of assignment and storage management in procedural languages.
Mtool: An Integrated System for Performance Debugging Shared Memory Multiprocessor Applications
Authors: A. J. Goldberg, J. L. Hennessy
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The authors describe Mtool, a software tool for analyzing performance losses in shared memory parallel programs. Mtool augments a program with low overhead instrumentation which perturbs the program's execution as little as possible while generating enough information to isolate memory and synchronization bottlenecks. After running the instrumented version of the parallel program, the programmer can use Mtool's window-based user interface to view compute time, memory, and synchronization objects. The authors describe Mtool's low overhead instrumentation methods, memory bottleneck detection technique, and attention focusing mechanisms, contrast Mtool with other approaches, and offer a case study to demonstrate its effectiveness.
Expert Focus-Pushing the Envelope: Space Telerobotics at Carnegie Mellon University
Authors: Christopher Locke
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

Three space-oriented projects at CMU's Robotics Institute are described: the Ambler planetary rover, the self-mobile space manipulator and the Hubble space telescope scheduling system. The Ambler planetary rover project is a comprehensive research program to design and build an intelligent machine that will explore and sample extraterrestrial planetary surfaces. The self-mobile space manipulator robot is part of an effort to develop technologies that will enable mobile robots to be used on the space station and other space structures. The Hubble space telescope scheduling (HSTS) Project is developing a software architecture to formulate and solve complex planning and scheduling problems.
Meld Scheduling: A Technique for Relaxing Scheduling Constraints
Authors: Santosh G. Abraham, Vinod Kathail, Brian L. Deitrich
Venue: International Journal of Parallel Programming (1998)

Meld scheduling melds the schedules of neighboring scheduling regions to respect latencies of operations issued in one region but completing after control transfers to the other. In contrast, conventional schedulers ignore latency constraints from other regions leading to potentially avoidable stalls in an interlocked (superscalar) machine or incorrect schedules for noninterlocked (VLIW) machines. Alternatively, schedulers that conservatively require all operations to complete before the branch takes effect produce inefficient schedules. In this paper, we present general data structures for maintaining latency constraint information at region boundaries. We present a meld scheduling algorithm for noninterlocked processors that generates latency constraints at the boundaries of scheduled regions and utilizes this information during the scheduling of other regions. We present a range of design options and describe the reasons behind our particular choices. We evaluate the performance of meld scheduling on a range of machine models on a set of SPEC92 and UNIX benchmarks.
Workflow and End-User Quality of Service Issues in Web-Based Education
Authors: Mladen A. Vouk, Donald L. Bitzer, Richard L. Klevans
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

The option of obtaining education over networks is quickly becoming a reality for all those who have access to the Internet and the World Wide Web (WWW). However, at present, network-based education (NBE) over the WWW and the Internet in general faces a number of pitfalls. The problems range from inadequate end-user quality of service (QoS), to inadequate materials, to shortcomings in learning paradigms, and to missing or inappropriate student assessment and feedback mechanisms. In this paper, we discuss some major issues that, although mostly solved for NBE, still face Web-based education (WBE). These include the required workflow-oriented technological and quality of service support. In discussing the issues, we use examples from a wide-area NBE/WBE system called NovaNET and a WBE system called Web Lecture System (WLS). We recommend that WBE system developers construct operational user (workflow) profiles before building their content and interfaces. Our experience is that, especially for synchronous WBE systems, user-level round-trip keystroke delays should not exceed about 250 ms and the overall availability of the system (including network-related service failures) should be at least 0.95. We also suggest that a successful WBE system will have a sound auto-adaptive knowledge assessment component, a ¿virtual¿ laboratory capability, and a set of strong collaborative functions. Until WBE systems match teacher/instructor and student workflows both technologically (as an appliance) and pedagogically, WBE, except in its most primitive form, will not be an effective educational tool.
Implementing Sparc in ECL
Authors: Emil W. Brown, Anant Agrawal, Trevor Creary, Michael F. Klein, Dave Murata, Joseph Petolino
Venue: IEEE Micro (1990)

A joint development project that implemented Sun Microsystems' scalable processor architecture (Sparc) with Bipolar Integrated Technology's bipolar emitter-coupled logic (ECL) is described. The authors review both ECL technology and the features of BIT's ECL technique and discuss how board and cache considerations influenced the chip designs. Also discussed are the integer unit pipeline, system interface signals, and coprocessor interface. The chip set, now completed, performs at a level equal to large mainframe computers and approaches that of today's supercomputers.
EMMA2: A High-Performance Hierarchical Multiprocessor
Authors: Enrico Appiani, Bruno Conterno, Vildo Luperini, Leonardo Roncarolo
Venue: IEEE Micro (1989)

The development of a parallel system providing high computational power at a reasonable cost using inexpensive processors is described. The original motivation for the work, which led to the EMMA (Elaborate Multi-Mini Associativo) multicomputer, was the mechanization of mail sorting. The need for a system that could be the basis for a wider range of applications spurred the study and development of a new system, the EMMA2. The discussion covers EMMA2's characteristics, architecture, buses, standard modules, I/O, approach to coprocessors, and operating system.
Port partitioning and dynamic queueing for IP Forwarding
Authors: Chae Y. Lee, Hee K. Cho
Venue: Computers and Operations Research (2002)

With the increase of internet protocol (IP) packets the performance of routers became an important issue in internet/working. In this paper we examine the matching algorithm in gigabit router which has input queue with virtual output queueing. Dynamic queue scheduling is also proposed to reduce the packet delay and packet loss probability. Port partitioning is employed to reduce the computational burden of the scheduler in a switch which matches the input and output ports for fast packet switching. Each port is divided into two groups such that the matching algorithm is implemented within each pair of groups in parallel. The matching is performed by exchanging the pair of groups at every time slot. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. In dynamic queue scheduling, a popup decision rule for each delay critical packet is made to reduce both the delay of the delay critical packet and the loss probability of loss critical packet. Computational results show that MMPP has the lowest delay and requires the least buffer size. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm. The dynamic queue scheduling is illustrated to be highly effective when the occupancy of the input buffer is relatively high.
Optimizing Computing Costs Using Divisible Load Analysis
Authors: Jeeho Sohn, Thomas G. Robertazzi, Serge Luryi
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

A bus oriented network where there is a charge for the amount of divisible load processed on each processor is investigated. A cost optimal processor sequencing result is found which involves assigning load to processors in nondecreasing order of the cost per load characteristic of each processor. More generally, one can trade cost against solution time. Algorithms are presented to minimize computing cost with an upper bound on solution time and to minimize solution time with an upper bound on cost. As an example of the use of this type of analysis, the effect of replacing one fast but expensive processor with a number of cheap but slow processors is also discussed. The type of questions investigated here are important for future computer utilities that perform distributed computation for some charge.
Non-destructive characterisation of porous low-k dielectric films
Authors: M. R. Baklanov, K. P. Mogilnikov
Venue: Microelectronic Engineering (2002)

Characterization of pore structure is needed to develop and optimize low-k dielectric films and processes. Advanced non-destructive methods, such as ellipsometric porosimetry, small-angle neutron and X-ray scattering combined with specular X-ray reflectivity and positron annihilation lifetime spectroscopy have recently been developed for this purpose. In this paper, the results of comparative analysis of different instrumentations are presented. Fundamentals and applications of the ellipsometric porosimetry are analyzed in more detail.
Connecting the Home With a Phone Line Network Chip Set
Authors: Edward H. Frank, Jack Holloway
Venue: IEEE Micro (2000)

In addition to shared Internet access for PCs, the home network will connect to every consumer electronic device. To make this possible, we must consider robust system requirements, home phone line standards, costs, and implementation of a supporting iLine10 chip set.
The typenumber of trees
Authors: Hung-Lin Fu, I-Fan Sun
Venue: Discrete Mathematics (2002)

This paper proves that the typenumber of a tree T is independent of the number of the pages in a book-embedding, and is equal to either |D(T)| or |D(T)| + 1, where D(T) is the set of integers which are degrees of the vertices of T. We then completely characterize trees having typenumber |D(T)| and trees having typenumber |D(T)| + 1.
Lagrangian-Eulerian advection for unsteady flow visualization
Authors: Bruno Jobard, Gordon Erlebacher, M. Yousuff Hussaini
Venue: Proceedings of the conference on Visualization '01 (2001)

In this paper, we propose a new technique to visualize dense representations of time-dependent vector fields based on a Lagrangian-Eulerian Advection (LEA) scheme. The algorithm produces animations with high spatio-temporal correlation at interactive rates. With this technique, every still frame depicts the instantaneous structure of the flow, whereas an animated sequence of frames reveals the motion a dense collection of particles would take when released into the flow. The simplicity of both the resulting data structures and the implementation suggest that LEA could become a useful component of any scientific visualization toolkit concerned with the display of unsteady flows.
Efficient Data Allocation over Multiple Channels at Broadcast Servers
Authors: Wai Gen Yee, Shamkant B. Navathe, Edward Omiecinski, Christopher Jermaine
Venue: IEEE Transactions on Computers (2002)

Broadcast is a scalable way of disseminating data because broadcasting an item satisfies all outstanding client requests for it. However, because the transmission medium is shared, individual requests may have high response times. In this paper, we show how to minimize the average response time given multiple broadcast channels by optimally partitioning data among them. We also offer an approximation algorithm that is less complex than the optimal and show that its performance is near-optimal for a wide range of parameters. Finally, we briefly discuss the extensibility of our work with two simple, yet seldom researched extensions, namely, handling varying sized items and generating single channel schedules.
Guest Editor's Introduction: Fault tolerance
Authors: Karl E. Grosspietsch
Venue: IEEE Micro (1994)

This special issue reports on the methodological progress in some selected areas of fault tolerance as well as practical experience gained by developing concrete fault-tolerant systems. Correspondingly, the issue contains contributions from the research community as well as from industry.
Computing stationary probability distributions and large deviation rates for constrained random walks.: the undecidability results.
Authors: David Gamarnik
Venue: ACM SIGMETRICS Performance Evaluation Review (2002)

Our model is a constrained homogeneous random walk in Z+d. The convergence to stationarity for such a random walk can often be checked by constructing a Lyapunov function. The same Lyapunov function can also be used for computing approximately the stationary distribution of this random walk, using methods developed in [11]. In this paper we show that computing exactly the stationary probability for this type of random walks is an undecidable problem: no algorithm can exist to achieve this task. We then prove that computing large deviation rates for this model is also an undecidable problem. We extend these results to a certain type of queueing systems. The implication of these results is that no useful formulas for computing stationary probabilities and large deviations rates can exist in these systems.
On the Estimation of Rigid Body Rotation from Noisy Data
Authors: Daniel Goryn, Søren Hein
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We derive an exact solution to the problem of estimating the rotation of a rigid body from noisy 3D image data. Our approach is based on total least squares (TLS), but unlike previous work involving TLS, we include the constraint that the transformation matrix should be orthonormal. It turns out that the solution to the estimation problem has the same form as if the data are not noisy, and thus the solution to the standard Procrustes problem can be applied.