ppxscal/embedding_network huggingface dataset:
Distributed Fault Tolerance: Lessons from Delta-4
Authors: David Powell
Venue: IEEE Micro (1994)

Because they avoid extensive redesign of specialized hardware, software-implemented approaches to fault tolerance are very resilient to change. Europe's Delta-4 project argues persuasively for implementing fault tolerance in a distributed fashion. The Delta-4 approach achieves fault tolerance by replicating capsules/spl minus/runtime representations of application objects/spl minus/on distributed, LAN-interconnected nodes. It can configure capsule groups to tolerate either stopping or arbitrary failures. Its multipoint protocols serve to coordinate capsule groups and for error processing and fault treatment.
Multidimensional Indexing for Recognizing Visual Shapes
Authors: A. Califano, R. Mohan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper introduces an analytical framework for studying some properties of model acquisition and recognition techniques based on indexing. The goal is to demonstrate that several problems previously associated with the approach can be attributed to the low dimensionality of invariants used. These include limited index selectivity. Excessive accumulation of votes in the look-up table buckets, and excessive sensitivity to quantization parameters. Theoretical results demonstrate that using high-dimensional, highly descriptive global invariants produces better results in terms of accuracy, false positive suppression, and computation time. A practical example of high-dimensional global invariants is introduced and used to implement a 2-D shape acquisition/recognition system. The acquisition/recognition system is based on a two-step table look-up mechanism. First, local curve descriptors are obtained by correlating image contour information at short range. Then, seven-dimensional global invariants are computed by correlating triplets of local curve descriptors at longer range. This experimental system is meant to illustrate the behavior of a high-dimensional indexing scheme. Indeed, its performance shows good agreement with the analytical model with respect to database size, fault tolerance, and recognition speed. Model acquisition time is linear to cubic in the number of object features. Object recognition time is constant to linear in the number of models in the database and linear to cubic in the number of features in the image. The system has been tested extensively. With more than 250 arbitrary shapes in the database. Unsupervised shape and subpart acquisition is demonstrated.
Organization of the Motorola 88110 Superscalar RISC Microprocessor
Authors: Keith Diefendorff, Michael Allen
Venue: IEEE Micro (1992)

Motorola's second-generation RISC microprocessor, which uses advanced techniques for exploiting instruction-level parallelism, including superscalar instruction issue, our-of-order instruction completion, speculative execution, dynamic instruction rescheduling, and two parallel, high-bandwidth, on-chip caches, is discussed. The microprocessor was designed to serve as the central processor in low-cost personal computers and workstations, and support demanding graphics and digital signal processing applications. The 88110's instruction set architecture, instruction sequencer, register files, execution units, address translation facilities, caches, and external bus interface are described.
DAIS: A Distributed AI Programming Shell
Authors: R. Kannan, W. H. Dodrill
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

The design and implementation of a distributed AI programming shell, DAIS, which provides an integrated, domain-independent programming environment for building distributed AI programs on PCs, are described. The target platform is the DOS environment, and DAIS has been implemented in C. The DAIS distribution characteristics, architecture, and knowledge-representation scheme are discussed. Its rule-based features and communication functions are examined. A significant deviation in DAIS's production system capability is the absence of optimization during the pattern-matching phase. Some plausible enhancements for DAIS are indicated.
Idioms and Patterns as Architectural Literature
Authors: James O. Coplien
Venue: IEEE Software (1997)

One of the leaders of the patterns community and the author of Advanced C++, Coplien describes his view of why patterns are important, and the contribution they bring to architecture. He argues that their value extends far beyond objects, that they are a powerful way of thinking about software development organizations as well as the architecture of the systems they develop.
Standards: Defining Software Engineering as a Profession
Venue: Computer (1993)

The need for standards of personal accountability for professionals working in the field of software engineering is examined. The field is defined, and the technical expertise and entry-level requirements that it requires are identified. Ways to initiate the process of obtaining a broad professional consensus on the norms of the software engineering field are proposed.
WebCompanion: A Friendly Client-Side Web Prefetching Agent
Authors: Reinhard P. Klemm
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Accessing remote sites of the World Wide Web is often a frustrating experience for users because of long Web page retrieval times even over relatively fast Internet connections. Users are more likely to embrace the further expansion of the role of the Web into a major infrastructure for electronic commerce and for information, application, and multimedia delivery if Web accesses can be accelerated. One technique that attempts this is prefetching. We built a client-side Java-implemented prefetching agent, WebCompanion, which employs a novel adaptive, fast, and selective online prefetching strategy based on estimated round-trip times for Web resources. This strategy efficiently hides the access latencies for slow resources while at the same time limiting the network and server overhead and local resource consumption to moderate levels. Our extensive experiments show an average access speed-up of greater than 50 percent and an average network byte overhead of less than 150 percent using WebCompanion over a fast Internet connection. We measured a slight acceleration in accessing the Web through WebCompanion even in a pessimistic scenario where the user never requests a prefetched document.
Feasibility of Spectrum Sharing Between Fixed and Mobile RadioSystems
Authors: P. J. Marshall, M. Shafi, K. W. Sowerby
Venue: Wireless Personal Communications: An International Journal (1999)

General techniques are presented to investigate the feasibility of spectrum sharing between a DS-CDMA mobile radio system and a fixed point-to-point microwave link. The limitations of a spectrum sharing arrangement are identified for specific system parameters. Initial results indicate that, for the systems considered, spectrum sharing will be difficult to implement in many environments and that the spectrum sharing arrangement is limited by the mobile radio system performance, in particular the reverse mobile link. However it is shown that the coordination requirements of the two systems converge when the mobile transmission power is increased. When excision suppression is used to remove fixed service interference at a mobile receiver, it may have an adverse effect on the mobile system performance due to a degradation in the correlation characteristics of the received signal. The degradation in the received signal depends on the width and centre frequency of the excised interference relative to the mobile signal.
Nonlocal Properties of Two-Qubit Gates and Mixed States, and the Optimization of Quantum Computations
Authors: Yuriy Makhlin
Venue: Quantum Information Processing (2002)

Entanglement of two parts of a quantum system is a nonlocal property unaffected by local manipulations of these parts. It can be described by quantities invariant under local unitary transformations. Here we present, for a system of two qubits, a set of invariants which provides a complete description of nonlocal properties. The set contains 18 real polynomials of the entries of the density matrix. We prove that one of two mixed states can be transformed into the other by single-qubit operations if and only if these states have equal values of all 18 invariants. Corresponding local operations can be found efficiently. Without any of these 18 invariants the set is incomplete. Similarly, nonlocal, entangling properties of two-qubit unitary gates are invariant under single-qubit operations. We present a complete set of 3 real polynomial invariants of unitary gates. Our results are useful for optimization of quantum computations since they provide an effective tool to verify if and how a given two-qubit operation can be performed using exactly one elementary two-qubit gate, implemented by a basic physical manipulation (and arbitrarily many single-qubit gates).PACS: 03.67-a; 03.67.Lx
The effect of electrolytes on the cloud point of poly ethylene glycol aqueous solutions
Authors: A. Eliassi, H. Modarress, G. A. Mansoori
Venue: Iranian Journal of Science and Technology (2002)

Cloud points of aqueous solutions of poly ethylene glycol (PEG)/inorganic salts are measured using the particle counting method. The average molecular weights of PEG are 3,350 and 10,000. NaH2PO4, Na2HPO4, KH2PO4 and K2HPO4 are the inorganic salts used. Measurements are done for different weight percentage of PEG and salts in water.
Mobile Agents Make a Network an Open Platform for Third-Party Developers
Venue: Computer (1994)

Remote programming enables occasionally connected devices to de things that would be prohibitively expensive with remote procedure calling. Mobile agents simplify the development and introduction of new communicating applications.
Performance Evaluation of a Decoded Instruction Cache for Variable Instruction Length Computers
Authors: G. D. Intrater, I. Y. Spillinger
Venue: IEEE Transactions on Computers (1994)

A Decoded INstruction Cache (DINC) is a buffer between the instruction decoder and other instruction pipeline stages. In this paper, we explain how techniques that reduce the branch penalty on a DINC, can improve CPU performance. We also analyze the impact of some of the design parameters of DINC's on variable instruction length computers. Our study indicates that tuning the mapping of the instructions into the cache can improve performance substantially. Tuning must be based on the instruction length distribution for a specific architecture. In addition, the associativity degree has a greater effect on the DINC's performance than on the performance of regular caches. We discuss the difference between the performance of DINC's and other caches, when longer cache lines are used. We present a model to estimate the miss rate based on its characteristics, that are discussed and analyzed throughout this paper. Our conclusions are based on both analytical study and trace driven simulations of several integer UNIX applications.
Solubilty and growth kinetics of silver nitrate in ethanol
Authors: M. Manteghian, A. Ebrahimi
Venue: Iranian Journal of Science and Technology (2002)

The solubility of silver nitrate in ethanol was determined at various temperatures. The growth kinetics of silver nitrate in ethanol were then determined using initial derivaties of temperature and desupersaturation in a mixed-batch crystallizer. For more accuracy, high order polynomials were fitted to the solubility, temperature and desupersaturation data. The conventional modes were therefore modified to allow for these high order relashionships.
Efficient Totally Self-Checking Checkers for a Class of Borden Codes
Authors: A. Paschalis, Th. Haniotakis, D. Nikolos
Venue: IEEE Transactions on Computers (1995)

In this paper a new method to design totally self-checking (TSC) checkers for a class of Borden codes is given and their applicability is discussed. The TSC checkers designed in this paper are impressively more efficient, with respect to implementation cost and speed, than the corresponding checkers hitherto proposed in the literature.
Java and the Shift to Net-Centric Computing
Authors: Marc A. Hamilton
Venue: Computer (1996)

While Sun's Java has perhaps received more press this past year than any other product since Windows 95, its potential remains less understood. Java is a software platform for network-centric computing. The key to its power is its write- once, run-anywhere model. The Java runtime environment translates Java code into machine instructions that run on any supported platform. The first Java virtual machines were part of World Wide Web browsers such as Sun's HotJava and Netscape Navigator. Today, Java virtual machines are being developed for a much wider range of platforms, from operating systems to telephones. I describe Java's features and strengths, its built-in security mechanisms, and Sun's Java extensions for the enterprise.
A virtual environment for simulated rat dissection: a case study of visualization for astronaut training
Authors: Kevin Montgomery, Cynthia Bruyns, Simon Wildermuth
Venue: Proceedings of the conference on Visualization '01 (2001)

Animal dissection for the scientific examination of organ subsystems is a delicate procedure. Performing this procedure under the complex environment of microgravity presents additional challenges because of the limited training opportunities available that can recreate the altered gravity environment. Traditional astronaut crew training often occurs several months in advance of experimentation, provides limited realism, and involves complicated logistics. We have developed an interactive virtual environment that can simulate several common tasks performed during animal dissection. In this paper, we describe the imaging modality used to reconstruct the rat, provide an overview of the simulation environment and briefly discuss some of the techniques used to manipulate the virtual rat.
Loop-Level Parallelism in Numeric and Symbolic Programs
Authors: J. R. Larus
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A new technique for estimating and understanding the speed improvement that can resultfrom executing a program on a parallel computer is described. The technique requires noadditional programming and minimal effort by a program's author. The analysis begins by tracing a sequential program. A parallelism analyzer uses information from the trace to simulate parallel execution of the program. In addition to predicting parallel performance, the parallelism analyzer measures many aspects of a program's dynamic behavior. Measurements of six substantial programs are presented. These results indicate that the three symbolic programs differ substantially from the numeric programs and, as aconsequence, cannot be automatically parallelized with the same compilation techniques.
Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network
Authors: D. J. Pritchard, D. A. Nicole
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The authors introduce a multiprocessor interconnection network, known ascube-connected Mobius ladders, which has an inherently deadlock-free routing strategyand hence has none of the buffering and computational overhead required bydeadlock-avoidance message passing algorithms. The basic network has a diameter phi of4n-1 for n2/sup n+2 /nodes and has a fixed node degree of 4. The network can beinterval routed in two stages and can be represented as a Cayley graph. This is the onlypractical fixed degree topology of size O(2/sup phi /) which has an inherentlydeadlock-free routing strategy, making it ideally suited for medium and large sizedtransputer networks.
Information Alchemy, the Art and Science of Knowledge Management, 1st edition
Authors: Gerry Bernbom
Venue:  (2000)

:This timely third volume of the EDUCAUSE Leadership Strategies series explores the difficult terrain of managing and protecting the storage, flow, and use of electronic data on college and university campuses.
InterBase: An Execution Environment for Heterogeneous Software Systems
Authors: Omran A. Bukhres, Jiansan Chen, Weimin Du, Ahmed K. Elmagarmid, Robert Pezzoli
Venue: Computer (1993)

The InterBase system, which integrates preexisting systems over a distributed, autonomous, and heterogeneous environment using a tool-based interface, is described. It supports heterogeneous applications without violating the local autonomy of component systems. The InterBase system locates and starts remote services, transfers and transforms data among different services, manages failures, and controls parallelism between multiple global applications running concurrently. InterBase also uses remote system interfaces (RSIs), which are superimposed on each software resource, to deal with the problem of heterogeneity. The RSIs transform commands and data between global applications and various software resources, forming a homogeneous interface to heterogeneous software resources.
Diagnosis of interconnect faults in cluster-based FPGA architectures
Authors: Ian Harris, Russell Tessier
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Fault diagnosis has particular importance in the context of field programmable gate arrays (FPGAs) because faults can be avoided by reconfiguration at almost no real cost. Cluster-based FPGA architectures, in which several logic blocks are grouped together into a coarse-grained logic block, are rapidly becoming the architecture of choice for major FPGA manufacturers. The high density interconnect found within clusters greatly complicates the problem of FPGA diagnosis. We propose a technique for the testing and diagnosis of cluster-based FPGA architectures. We present a hierarchical approach to define a set of FPGA configurations in which each fault is detectable, and each fault pair is differentiable. The cornerstone of this work is the concise expression of the distinguishing conditions of each fault pair. Experimental results demonstrate that nearly 100% fault coverage and diagnostic resolution are achieved with a low number of test configurations.
Exploiting Instruction- and Data-Level Parallelism
Authors: Roger Espasa, Mateo Valero
Venue: IEEE Micro (1997)

Historically, there have been two different approaches to high performance computing: instruction-level parallelism (ILP) and data-level parallelism (DLP). The ILP paradigm seeks to execute several instructions each cycle by exploring a sequential instruction stream and extracting independent instructions that can be sent to several execution units in parallel. The DLP paradigm, on the other hand, uses vectorization techniques to specify with a single instruction (a vector instruction) a large number of operations to be performed on independent data. A few of these vector instructions running concurrently can provide a large operation parallelism for many consecutive cycles.
Latin Squares for Parallel Array Access
Authors: K. Kim, V. K. Prasanna
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A parallel memory system for efficient parallel array access using perfect latin squares asskewing functions is discussed. Simple construction methods for building perfect latinsquares are presented. The resulting skewing scheme provides conflict free access toseveral important subsets of an array. The address generation can be performed inconstant time with simple circuitry. The skewing scheme can provide constant timeaccess to rows, columns, diagonals, and N/sup 1/2/*N/sup 1/2/ subarrays of an N*Narray with maximum memory utilization. Self-routing Benes networks can be used torealize the permutations needed between the processing elements and the memorymodules. Two skewing schemes that provide conflict free access to three-dimensionalarrays are also discussed. Combined with self-routing Benes networks, these schemesprovide efficient access to frequently used subsets of three-dimensional arrays.
Obstacle Detection Based on Qualitative and Quantitative 3D Reconstruction
Authors: Zhongfei Zhang, Richard Weiss, Allen R. Hanson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

Three different algorithms for obstacle detection are presented in this paper each based on different assumptions. The first two algorithms are qualitative in that they return only yes/no answers regarding the presence of obstacles in the field of view; no 3D reconstruction is performed. They have the advantage of fast determination of the existence of obstacles in a scene based on the solvability of a linear system. The first algorithm uses information about the ground plane, while the second only assumes that the ground is planar. The third algorithm is quantitative in that it continuously estimates the ground plane and reconstructs partial 3D structures by determining the height above the ground plane of each point in the scene. Experimental results are presented for real and simulated data, and the performance of the three algorithms under different noise levels is compared in simulation. We conclude that in terms of the robustness of performance, the third algorithm is superior to the other two.
On Recovering Hyperquadrics from Range Data
Authors: Senthil Kumar, Song Han, Dmitry Goldgof, Kevin Bowyer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper discusses the applications of hyperquadric models in computer vision and focuses on their recovery from range data. Hyperquadrics are volumetric shape models that include superquadrics as a special case. A hyperquadric model can be composed of any number of terms and its geometric bound is an arbitrary convex polytope. Thus, hyperquadrics can model more complex shapes than superquadrics. Hyperquadrics also possess many other advantageous properties (compactness, semilocal control, and intuitive meaning). Recovering hyperquadric parameters is difficult not only due to the existence of many local minima in the error function but also due to the existence of an infinite number of global minima (with zero error) that do not correspond to any meaningful shape. Our proposed algorithm starts with a rough fit using only six terms in 3D (four in 2D) and adds additional terms as necessary to improve fitting. Suitable constraints are used to ensure proper convergence. Experimental results with real 2D and 3D data are presented.
Integration of Complex Differential Equations
Authors: B. Azevedo Scárdua
Venue: Journal of Dynamical and Control Systems (1999)

Let X be a polynomial vector field in {\Bbb C}^2&semi; then it defines an algebraic foliation {\cal F} on {\Bbb C}P(2). If {\cal F} admits a Liouvillian first integral on {\Bbb C}P(2), then it is transversely affine outside some algebraic invariant curve S\subset {\Bbb C}P(2). If, moreover, for some irreducible component S_0 \subset S, the singularities q &isin; Sing {\cal F} \cup S are generic, then either {\cal F} is given by a closed rational 1-form or it is a rational pull-back from a Bernoulli foliation {\cal R}: p(x)\thinspace dy-(y^2a(x)+yb(x))\thinspace dx=0 on \overline {\Bbb C} \times \overline {\Bbb C}. This result has several applications such as the study of foliations with algebraic limit sets on {\Bbb C}P(2)(2), the classification polynomial complete vector fields over {\Bbb C}^2, and topological rigidity of foliations on {\Bbb C}P(2). We also address the problem of moderate integration for germs of complex ordinary differential equations.