ppxscal/embedding_network huggingface dataset:
On the Implementation of Arithmetic Support Functions for Generalized Signed-Digit Number Systems
Authors: B. Parhami
Venue: IEEE Transactions on Computers (1993)

Ordinary signed-digit (OSD) number representation systems have been defined for any radix r alpha >r. The most important property of OSD number representation systems is the possibility of performing carry-free addition and (by changing all the digit signs in the subtrahend) borrow-free subtraction. Generalized signed-digit (GSD) number systems cover all useful redundant number representations as special cases. Most GSD number systems support carry-free addition and borrow-free subtraction, and even those that do not can be dealt with using limited-carry or limited-borrow algorithms which yield the ith sum or difference digit z/sub i /as a function of the digits x/sub i/, y/sub i/, x/sub i-1/, y/sub i-1/, x/sub i-2/ and y/sub i-2/ of the operands x and y. Additional topics that are important for practical implementation of arithmetic functions using GSD number systems are treated. Because GSD number systems may have asymmetric digit sets, one must consider subtraction (or at least sign change for representations with alpha
Hardware-Software Codesign Using Processor Synthesis
Authors: Carolyn Kuttner
Venue: IEEE Design Test (1996)

The practice of concurrent hardware-software design can significantly cut the cost and cycle time to build digital systems for embedded real-time applications. The traditional "hardware first, software last" development process has proven difficult and costly. The biggest problems are traceable to disconnects in the hardware and software partitioning discovered during integration and test, after hardware fabrication. Late discovery of these errors causes projects to be over budget and late. Worse, the resulting system may not fully satisfy user needs.Under a Defense Advanced Research Projects Agency (DARPA) Initiative in Concurrent Engineering program, TRW developed a process, supported by a tool, in which we developed hardware and software incrementally and concurrently, validate requirements in simulation before fabricating any hardware, and we fully interconnect the path from initial design through manufacturing with computer-aided design (CAD) tools.
UNIX Power Tools 3RD EXP&UP, 3rd edition
Authors: Shelley Powers, Jerry Peek
Venue:  (2002)

The latest edition of this best-selling favorite is loaded with vital information on Linux, Darwin, and BSD. Unix Power Tools 3rd Edition now offers more coverage of bash, zsh, and other new shells, along with discussions about modern utilities and applications. Several sections focus on security and Internet access. There is a new chapter on access to Unix from Windows, and expanded coverage of software installation and packaging, as well as basic information on Perl and Python.
A new object-order ray-casting algorithm
Authors: Benjamin Mora, Jean Pierre Jessel, René Caubet
Venue: Proceedings of the conference on Visualization '02 (2002)

Many direct volume rendering algorithms have been proposed during the last decade to render 2563 voxels interactively. However a lot of limitations are inherent to all of them, like low-quality images, a small viewport size or a fixed classification. In contrast, interactive high quality algorithms are still a challenge nowadays. We introduce here an efficient and accurate technique called object-order ray-casting that can achieve up to 10 fps on current workstations. Like usual ray-casting, colors and opacities are evenly sampled along the ray, but now within a new object-order algorithm. Thus, it allows to combine the main advantages of both worlds in term of speed and quality. We also describe an efficient hidden volume removal technique to compensate for the loss of early ray termination.
System M: A Transaction Processing Testbed for Memory Resident Data
Authors: K. Salem, H. Garcia-Molina
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

System M is an experimental transaction processing testbed that runs on top of the Mach operating system. Its database is stored in primary memory. The structure and algorithms used in System M are described. The checkpointer is the component that periodically sweeps memory and propagates updates to a backup database copy on disk. Several different checkpointing (and logging) algorithms were implemented, and their performance was experimentally evaluated.
A Compact Higher Order Finite Difference Method for the Incompressible Navier&ndash;Stokes Equations
Authors: Arnim Brüger, Jonas Nilsson, Wendy Kress
Venue: Journal of Scientific Computing (2002)

A numerical method based on compact fourth order finite difference approximations is used for the solution of the incompressible Navier&ndash;Stokes equations. Our method is implemented for two dimensional, curvilinear coordinates on orthogonal, staggered grids. Two numerical experiments confirm the theoretically expected order of accuracy.
Analysis and Synthesis of Facial Image Sequences Using Physical and Anatomical Models
Authors: D. Terzopoulos, K. Waters
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

An approach to the analysis of dynamic facial images for the purposes of estimating and resynthesizing dynamic facial expressions is presented. The approach exploits a sophisticated generative model of the human face originally developed for realistic facial animation. The face model which may be simulated and rendered at interactive rates on a graphics workstation, incorporates a physics-based synthetic facial tissue and a set of anatomically motivated facial muscle actuators. The estimation of dynamical facial muscle contractions from video sequences of expressive human faces is considered. An estimation technique that uses deformable contour models (snakes) to track the nonrigid motions of facial features in video images is developed. The technique estimates muscle actuator controls with sufficient accuracy to permit the face model to resynthesize transient expressions.
Applicative Parallelism on a Shared-Memory Multiprocessor
Authors: Rodney R. Oldehoeft, David C. Cann
Venue: IEEE Software (1988)

An applicative language, SISAL (streams and iteration in a single-assignment language), is used to examine how effective the applicative approach can be in programming parallel computers. SISAL is a research language for investigating issues in parallel processing, especially for numerical computing. A prototype implementation of SISAL is described, focusing on loops and streams and on microtasking software. Performance results are reported for Livermore kernel 1, the Sieve prime finder, insertion sort, Batcher sort, the Simple hydrodynamics code, and the PSPhot photon-transport code.
Automatic Synthesis of Self-Recovering VLSI Systems
Authors: Alex Orailoglu, Ramesh Karri
Venue: IEEE Transactions on Computers (1996)

In this paper, we will describe an integrated system for synthesizing self-recovering microarchitectures called ${\cal SYNCERE}$. In the ${\cal SYNCERE}$model for self-recovery, transient faults are detected using duplication and comparison, while recovery from transient faults is accomplished via checkpointing and rollback. ${\cal SYNCERE}$initially inserts checkpoints subject to designer specified recovery time constraints. Subsequently, ${\cal SYNCERE}$incorporates detection constraints by ensuring that two copies of the computation are executed on disjoint hardware. Towards ameliorating the dedicated hardware required for the original and duplicate computations, ${\cal SYNCERE}$imposes intercopy hardware disjointness at a sub-computation level instead of at the overall computation level. The overhead is further moderated by restructuring the pliable input representation of the computation. ${\cal SYNCERE}$has successfully derived numerous self-recovering microarchitectures. Towards validating the methodology for designing fault-tolerant VLSI ICs, we carried out a physical design of a self-recovering 16-point FIR filter.
Gibbs Measures on Negatively Curved Manifolds
Authors: Yves Coudene
Venue: Journal of Dynamical and Control Systems (2003)

We define the concept of a Gibbs measure on the unitary bundle of any negatively curved complete manifold; as a consequence we show that if the manifold is geometrically finite, there always exists an ergodic probability measure invariant with respect to the geodesic flow and fully supported on the nonwandering set of the flow.
Limited Bandwidth to Affect Processor Design
Authors: Doug Burger, James R. Goodman, Alain Kägi
Venue: IEEE Micro (1997)

In this article, we discuss how the effects of long memory latencies and increased memory bandwidth requirements may affect the design of modern microprocessors and their memory systems. In particular, we examine the subtle trade-offs between memory latency and bandwidth. Through execution-driven simulation, we measure the fraction of time that several SPEC95 benchmarks spend computing, stalled for memory latency, and stalled for limited memory bandwidth. Our results show that as processors implement more aggressive latency tolerance techniques, limited memory bandwidth negatively impacts programs much more than do long memory latencies. Finally, we survey a range of strategies for mitigating bandwidth limitations and discuss the relative merits and disadvantages of each.
The ChARM Tool for Tuning Embedded Systems
Authors: Cosimo Antonio Prete, Marco Graziano, Francesco Lazzarini
Venue: IEEE Micro (1997)

In embedded system design, the designer has to find a tradeoff solution for system architecture to satisfy conflicting requirements of the product. Tuning such a system and, in particular, its cache memory, is a complex and difficult task. For these reasons, the designers need simulators to investigate how to improve performance, reduce power consumption and so on. These tools, in the past used only by companies involved in microprocessor design, are now very useful in the design of embedded products. We show the usefulness of our tool in configuring the memory subsystem for two typical programs for embedded systems.
Performance Improvement by Microdiversity for Wideband Signals in Frequency Selective Fading Indoor Channels with Co-Channel Interference
Authors: Gerard J. M. Janssen
Venue: Wireless Personal Communications: An International Journal (1999)

A comprehensive analytical bit-error-rate (BER) model is presented to analyse the performance of antenna-microdiversity for wideband BPSK modulated signals in the frequency selective fading multipath channel, specified by its complex impulse response. The model includes the disturbance by intersymbol interference (ISI) and co-channel interference (CCI), as well as the channels&lsquo; impact on the carrier phase- and clock recovery in the receiver. The channel impulse responses at the antenna elements are determined by taking into account the direction of arrival of the individual paths. Computational BER- and SNIR-gain results (SNIR = signal-to-noise+interference-ratio) show that a substantial performance improvement is achieved with antenna combining for wideband signals which suffer ISI and/or CCI. For the indoor multipath channel with exponentially decaying power delay profile, the performance enhancement is compared for several antenna combining schemes. Quasi-coherent equal gain combining (QCEGC) is proposed as an novel EGC scheme based on a less accurate phase estimation technique. For wideband signals, QCEGC shows a slight performance degradation when compared to maximal ratio combining or minimum mean square error combining (MMSEC), but has a much lower implementation complexity. In the channel with CCI, where the best performance is achieved with MMSEC, QCEGC performs very poor.
Global exponential stability of delayed Hopfield neural networks
Authors: Tianping Chen
Venue: Neural Networks (2001)

In this paper, we discuss delayed Hopfield neural networks, investigating their global exponential stability. Sufficient conditions ensuring global exponential stability of delayed Hopfield neural networks are given.
Scalability of Parallel Algorithm-Machine Combinations
Authors: X. H. Sun, D. T. Rover
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Scalability has become an important consideration in parallel algorithm and machinedesigns. The word scalable, or scalability, has been widely and often used in the parallelprocessing community. However, there is no adequate, commonly accepted definition ofscalability available. Scalabilities of computer systems and programs are difficult toquantify, evaluate, and compare. In this paper, scalability is formally defined foralgorithm-machine combinations. A practical method is proposed to provide a quantitative measurement of the scalability. The relation between the newly proposed scalability and other existing parallel performance metrics is studied. A harmony between speedup and scalability has been observed. Theoretical results show that a large class ofalgorithm-machine combinations is scalable and the scalability can be predicted throughpremeasured machine parameters. Two algorithms have been studied on an nCUBE 2multicomputer and on a MasPar MP-1 computer. These case studies have shown howscalabilities can be measured, computed, and predicted. Performance instrumentation andvisualization tools also have been used and developed to understand the scalabilityrelated behavior.
Approximation quality for sorting rules
Authors: Günther Gediga, Ivo Düntsch
Venue: Computational Statistics Data Analysis (2002)

A method is presented for the approximation quality for sorting rules, which is based on Rough Set Data Analysis. Several types of rules are discussed: The "nominal → nominal" case (NN) (the classical Rough Set approach), "nominal → ordinal" (NO) rules, and "ordinal → ordinal" (OO) rules, and its generalisation to "(nominal, ordinal) → ordinal" rules (NO-O). We provide a significance test for the overall approximation quality, and a test for partial influence of attributes based on the bootstrap technology.For the bivariate case, the relationship of U-statistics and the proposed approximation quality measure is discussed. It can be shown that in this case a simple linear transformation of the Kendall tau correlation forms an upper bound for the approximation quality of sorting rules.A competing model is also studied. Whereas this method is a promising tool in case of searching for global consistency, we demonstrate that in case of local perturbations in the data set the method may offer questionable results, and that it is dissociated from the theory it claims to support.In the final Section, an example illustrates the introduced concepts and procedures.
Touch Screens Now Offer Compelling Uses
Venue: IEEE Software (1991)

Research on improving the user interfaces of touch screen applications is described. The advantages of touch screens are discusses, their current capabilities are examined, and possible future developments are considered.
Types for the ambient calculus
Authors: Luca Cardelli, Giorgio Ghelli, Andrew D. Gordon
Venue: Information and Computation (2002)

The ambient calculus is a concurrent calculus where the unifying notion of ambient is used to model many different constructs for distributed and mobile computation. We study a type system that describes several properties of ambient behavior. The type system allows ambients to be partitioned in disjoint sets (groups), according to the intended design of a system, in order to specify both the communication and the mobility behavior of ambients.
Performance Analysis of a Generalized Class of M-Level Hierarchical Multiprocessor Systems
Authors: I. O. Mahgoub, A. K. Elmagarmid
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

The performance of the m-level hierarchical multiprocessor system is analyzed in terms of the system bandwidth for both hierarchically nonuniform reference and uniform reference models. The results show that for a higher rate of local requests (requests to memory modules within the same cluster) the m-level system performs fairly close to the crossbar system and outperforms a typical multiple-bus system (with the number of buses equal to half the number of processors). The bandwidth of the m-level system is evaluated for different numbers of levels, and the results are compared with those of a crossbar system (m=1).
A Wideband Wavelet Based Estimator Correlator and its Properties
Authors: Leon H. Sibul, Lora G. Weiss
Venue: Multidimensional Systems and Signal Processing (2002)

Maximum likelihood detectors of narrowband, non-stationary random echos in Gaussian noise can be efficiently implemented in the time-frequency domain. When the transmitted signals have large time-bandwidth products, the natural implementation of estimators and detectors is in the time-scale or wavelet transform domain. This paper presents a wideband wavelet transform domain implementation of an estimator-correlator (EC) detector and details the components of this processor, including weighted wavelet transforms and cascaded scattering functions. Key properties associated with this wavelet based wideband EC are also presented. The theoretical developments of the processor are based on group theory which provides a unified approach to detector development for both narrowband and wideband processors. The group theoretic concepts provide a powerful analysis tool for complex signal processing problems.
On spectral bounds for cutsets
Authors: J. A. Rodríguez, A. Gutiérrez, J. L. A. Yebra
Venue: Discrete Mathematics (2002)

Let Γ be a simple and connected graph. A k-vertex separator [k-edge separator] is a subset of vertices [edges] whose deletion separates the vertex [edge] set of Γ into two parts of equal cardinality, that are at distance greater than k in Γ. Here we investigate the relation between the cardinality of these cutsets and the laplacian spectrum of Γ. As a consequence of the study, we obtain the well-known lower bounds for the bandwidth and the bipartition width of a graph.
Components: What If They Gave a Revolution and Nobody Came?
Authors: Peter M. Maurer
Venue: Computer (2000)

There have been three great revolutions in computing technology during the past 50 years: the stored-program computer, high-level languages, and component-level programming. Although working programmers are well aware of this last revolution, it seems to have escaped the notice of most everyone else. The author feels that academic researchers are doing little or nothing that touches the subject and, apart from trade journals and magazines aimed at developers, that publishers have all but ignored it. The component-level programming revolution has already happened in the academic community, and in the author's opinion, nobody came. The author starts by giving a brief history of components, detailing the controls (tools that allow developers to create visually pleasing dialog boxes by drawing such devices as buttons), visual innovations, and the data control of Visual Basic. The author moves on to current component technology. He explains ActiveX and other recent technological developments (like dynamic instantiation and universal standard). He finishes by looking into the future of component technology, explaining semipersistence, marketing flexibility, and solutions to transmitting problems.
MEMS: The Systems Function Revolution
Authors: Karen W. Markus, Kaigham J. Gabriel
Venue: Computer (1999)

Information systems are no longer confined to desktops but are rapidly becoming part of cars, personal digital assistants, and palmtop systems. In this context, systems must be able not only to compute but also to sense their physical environment and respond to it. These requirements move beyond even complex microelectronics, calling for a functionality that combines electrical and mechanical components. This new functionality is realized in microelectro-mechanical systems (MEMS). MEMS devices are fast becoming part of everything from automobiles and fighter aircraft to printers and telecommunications switching equipment. According to the authors, despite some obvious advantages, MEMS are not well understood by the systems design and applications community-ironically, the ones to whom MEMS offer the greatest opportunities for enhancing system functionality. One area of confusion is how MEMS are produced and how that process differs from microelectronics manufacturing. In this article, the authors explain similarities and differences and identify some trends and motivations leading to a new systems functionality.
Use of the SAND spatial browser for digital government applications
Authors: Hanan Samet, Houman Alborzi, František Brabec, Claudio Esperança, Gísli R. Hjaltason, Frank Morgan, Egemen Tanin
Venue: Communications of the ACM (2003)

Numerous federal agencies produce official statistics made accessible to ordinary citizens for searching and data retrieval. This is frequently done via the Internet through a Web browser interface. If this data is presented in textual format, it can often be searched and retrieved by such attributes as topic, responsible agency, keywords, or press release. However, if the data is of spatial nature, for example, in the form of a map, then using text-based queries is often too cumbersome for the intended audience. We describe the use of the SAND Spatial Browser to provide more power to users of these databases by enabling them to define and explore the specific spatial region of interest graphically. The SAND Spatial Browser allows users to form either purely spatial or mixed spatial/nonspatial queries intuitively, which can present information to users that might have been missed if only a textual interface was available.
Presentation Planning for Distributed VoD Systems
Authors: Eenjun Hwang, B. Prabhakaran, V. S. Subrahmanian
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

A distributed video-on-demand (VoD) system is one where a collection of video data is located at dispersed sites across a computer network. In a single site environment, a local video server retrieves video data from its local storage device. However, in distributed VoD systems, when a customer requests a movie from the local server, the server may need to interact with other servers located across the network. In this paper, we present different types of presentation plans that a local server can construct in order to satisfy a customer request. Informally speaking, a presentation plan is a temporally synchronized sequence of steps that the local server must perform in order to present the requested movie to the customer. This involves obtaining commitments from other video servers, obtaining commitments from the network service provider, as well as making commitments of local resources, while keeping within the limitations of available bandwidth, available buffer, and customer data consumption rates. Furthermore, in order to evaluate the quality of a presentation plan, we introduce two measures of optimality for presentation plans: minimizing wait time for a customer and minimizing access bandwidth which, informally speaking, specifies how much network/disk bandwidth is used. We develop algorithms to compute three different optimal presentation plans that work at a block level, or at a segment level, or with a hybrid mix of the two, and compare their performance through simulation experiments. We have also mathematically proven effects of increased buffer or bandwidth and data replications for presentation plans which had previously been verified experimentally in the literature.
On Optimizing Diameter and Average Distance of Directed Interconnected Networks
Authors: H. Braun, F. C. Stephan
Venue: IEEE Transactions on Computers (1993)

A generic approach to constructing the topology of fixed degree directed networks for a given node degree and size is proposed. The topology has minimum diameter and makes it possible to answer Maekawa's problem partially. In addition, an expansion operator Ex(x,n) is provided to scale the network size. Fast routing algorithms for these networks that have logarithmic time complexity while using constant buffer size are presented.