ppxscal/embedding_network huggingface dataset:
On Self-Fault Diagnosis of the Distributed Systems
Authors: S. H. Hosseini, J. G. Kuhl, S. M. Reddy
Venue: IEEE Transactions on Computers (1988)

The problem of achieving fault diagnosis in a network of interconnected processing elements (called nodes) is considered. It is assumes that there is no central facility to control, coordinate or mediate among the processing elements. Every node can eventually determine the status of nodes and communication paths between them. A diagnostic algorithm for homogeneous systems (systems with only testing nodes) is given. The self-fault-diagnosis of inhomogeneous systems (systems with nodes of varying degrees of testing capability) is studied and diagnostic algorithms are proposed.
Continual Queries for Internet Scale Event-Driven Information Delivery
Authors: Ling Liu, Calton Pu, Wei Tang
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

In this paper we introduce the concept of continual queries, describe the design of a distributed event-driven continual query system¿OpenCQ, and outline the initial implementation of OpenCQ on top of the distributed interoperable information mediation system DIOM [22], [20]. Continual queries are standing queries that monitor update of interest and return results whenever the update reaches specified thresholds. In OpenCQ, users may specify to the system the information they would like to monitor (such as the events or the update thresholds they are interested in). Whenever the information of interest becomes available, the system immediately delivers it to the relevant users; otherwise, the system continually monitors the arrival of the desired information and pushes it to the relevant users as it meets the specified update thresholds. In contrast to conventional pull-based data management systems such as DBMSs and Web search engines, OpenCQ exhibits two important features: 1. it provides push-enabled, event-driven, content-sensitive information delivery capabilities, and 2. it combines pull and push services in a unified framework. By event-driven we mean that the update events of interest to be monitored are specified by users or applications. By content-sensitive, we mean the evaluation of the trigger condition happens only when a potentially interesting change occurs. And, by push-enabled, we mean the active delivery of query results or triggering of actions without user intervention.
Performance Measurement Intrusion and Perturbation Analysis
Authors: A. D. Malony, D. A. Reed, H. A. G. Wijshoff
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

The authors study the instrumentation perturbations of software event tracing on the Alliant FX/80 vector multiprocessor in sequential, vector, concurrent, and vector-concurrent modes. Based on experimental data, they derive a perturbation model that can approximate true performance from instrumented execution. They analyze the effects of instrumentation coverage, (i.e., the ratio of instrumented to executed statements), source level instrumentation, and hardware interactions. The results show that perturbations in execution times for complete trace instrumentations can exceed three orders of magnitude. With appropriate models of performance perturbation, these perturbations in execution time can be reduced to less than 20% while retaining the additional information from detailed traces. In general, it is concluded that it is possible to characterize perturbations through simple models. This permits more detailed, accurate instrumentation than traditionally believed possible.
Developing an Accredited Software Engineering Program
Authors: Philip Dart, Lorraine Johnston, Cameron Schmidt, Liz Sonenberg
Venue: IEEE Software (1997)

Accreditation of software engineering degree programs affirms that software development is a true engineering discipline. The authors, from the University of Melbourne's Department of Computer Science, discuss their experiences developing Australia's first fully accredited software engineering degree program.
A New On-Line Robust Approach to Design Noise-Immune Speech Recognition Systems
Authors: Fabian Vargas, Rubem D. R. Fagundes, Daniel Barros,  Jr.
Venue: Journal of Electronic Testing: Theory and Applications (2003)

Hereafter, we present a new approach dealing to cope with the harmful effects of noise on speech recognition systems (SRS). This approach is oriented to hardware redundancy and it is essentially a modification of the classic Recovery Blocks scheme. When compared to conventional approaches using Fast Fourier Transform (FFT) and Hamming Code, the primary benefit of such a technique is to improve system performance when operating in real (i.e., noisy) environments. The second advantage is related to the considerably low complexity and reduced area overhead required for implementation. We implemented three full versions of the proposed algorithm: one running of a PC microcomputer, and a second one slightly modified to run on a TMS-320C67 Texas DSP microprocessor module. Both of them were described in the C language. Finally, a last implementation was prototyped on a HW-SW development environment based on the same Texas microprocessor and on the FLEX10K20 FPGA Altera Component.
Unchecked Exceptions Can Be Strictly More Powerful Than Call/CC
Authors: Mark Lillibridge
Venue: Higher-Order and Symbolic Computation (1999)

We demonstrate that in the context of statically-typed purely-functional lambda calculi without recursion, unchecked exceptions (e.g., SML exceptions) can be strictly more powerful than call/cc. More precisely, we prove that a natural extension of the simply-typed lambda calculus with unchecked exceptions is strictly more powerful than all known sound extensions of Girard&lsquo;s F_&omega; (a superset of the simply-typed lambda calculus) with call/cc.This result is established by showing that the first language is Turing complete while the later languages permit only a subset of the recursive functions to be written. We show that our natural extension of the simply-typed lambda calculus with unchecked exceptions is Turing complete by reducing the untyped lambda calculus to it by means of a novel method for simulating recursive types using unchecked-exception&ndash;returning functions. The result concerning extensions of F_&omega; with call/cc stems from previous work of the author and Robert Harper.
CAD solutions and outstanding challenges for mixed-signal and RFIC design
Authors: Domine Leenaerts, Georges Gielen, Rob A. Rutenbar
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

This tutorial paper addresses the problems and solutions that are posed by the design of mixed-signal integrated systems on chip (SoC). These include problems in mixed-signal design methodologies and flows, problems in analog design productivity, as well as open problems in analog, mixed-signal and RF design, modeling and verification tools. The tutorial explains the problems that are posed by these mixed-signal/RF SoC designs, describes the solutions and their underlying methods that exist today and outlines the challenges that still remain to be solved at present. In the first part the design of analog and mixed-signal circuits is addressed, while the second part focuses on the specific problems raised by RF wireless circuits.
A 'Crystal Ball' for Software Liability
Authors: Jeffrey Voas, Gary McGraw, Lora Kassab, Larry Voas
Venue: Computer (1997)

Software developers are living in a liability grace period, but it won't last. To adequately insure themselves against potential liability, developers need tools to identify worst-case scenarios and help them quantify the risks associated with a piece of software. For assessing such risks associated with software, the authors recommend fault injection, which provides worst-case predictions about how badly a piece of code might behave and how frequently it might behave that way. By contrast, software testing states how good software is. But even correct code can have "bad days," when external influences keep it from working as desired. Fault injection is arguably the next best thing to having a crystal ball, and it certainly beats facing the future with no predictions at all. It should be a regular part of risk assessment. The greatest benefit from fault injection occurs when a piece of software does not tolerate injected anomalies. False optimism gives way to the only honest claim-that the software presents risks.
A random stacking process
Authors: Leonard J. Schulman
Venue: Discrete Mathematics (2002)

We examine a generalization of one-dimensional random walks with one reflecting and one absorbing boundary, in which a range of strategies is available, and the goal is to avoid absorption for as long as possible; we show a sharp threshold for the walk parameter separating linear and exponential expected walk times.
Design and Performance Analysis of a Disk Array System
Authors: Antonio Puliafito, Vincenzo Catania, Salvatore Riccobene, Lorenzo Vita
Venue: IEEE Transactions on Computers (1995)

We concentrate on the architectural issues of parallelizing I/O access in a disk array system by means of definition of a new, particularly flexible architecture, called partial dynamic declustering, which is fault-tolerant and offers higher levels of performance and reliability than the solutions normally used. A simulation analysis highlights the efficiency of the proposed solution in balancing the file system workload and demonstrates its validity in both cases of unbalanced loads and expansion of the system. Particular attention is also paid to the definition of analytical models, based on stochastic reward nets, in order to analyze the performance and reliability of the system. The response time distribution function is evaluated and a specific performance analysis with varying degrees of declustering and workload is carried out.
Converting legacy code into Ada: a cognitive approach
Authors: Joseph M. Scandura
Venue: Computer (1994)

Describes a code conversion tool that helps programmers visualize and understand system design. The author first reviews current software reengineering tools and then describe a new cognitive approach to system (re)engineering based on code comprehension tools that provide a visual representation of code containing less cognitive noise. This better enables programmers to understand system design. The approach integrates code comprehension tools with current reengineering methodologies to create an integrated reengineering workbench for converting legacy code into newer languages such as Ada or C/C++.
Watch Your Language!
Authors: Richard Wiener
Venue: IEEE Software (1998)

Wiener agrees with Hatton that OO does not match the way we normally think. He goes on to say, however, that this is true of programming in any language using any paradigm. Given this, he argues, it is essential that we use good principles, good ideas, and good languages. Further, to compare OO and non-OO implementations, researchers should look at a true OO language-and that isn't C++.
Passive Safety in High-Consequence Systems
Authors: Victor L. Winter, John M. Covan, Larry J. Dalton
Venue: Computer (1998)

Although they address diverse domains, these six reports reveal a set of common criteria for high assurance. Generally speaking, the critical criteria are reliability, availability, safety, timeliness, security, and evolvability. These reports also identify areas for study: ý In "Passive Safety in High-Consequence Systems," Victor L. Winter, John M. Covan, and Larry J. Dalton discuss the design principles behind passive safety, which means that a system is not required to initiate any action to arrive at a safe state. ý In "Long-Life Deep-Space Applications," Leon Alkalai and Ann T. Tai describe the design philosophy behind a highly miniaturized, reliable, low-cost, avionics system for long-life deep-space applications. ý In "Challenges for Continuously Available Systems," Rick Harper and Barry Flahive tell about continuously available systems, which are used whenever the cost of downtime is extremely high. They describe a data-base server that directs certain telephone calls via service control points. ý In "Capturing Safety-Critical Medical Requirements," Wei-Tek Tsai, Ramin Mojdehbakhsh, and Sanjai Rayadurgam discuss safety, reliability, and timing issues associated with medical devices such as pacemakers and defibrillators. ý In "Applications in Rapidly Changing Environments," Kinji Mori dis cusses application systems requirements designed to accommodate the rapid advances in computer and communication technologies. ý In "Component-Based Reconfigurable Systems," Michael R. Lowry describes NASA Ames' Amphion project, a system for building high-assurance reconfigurable software systems from components in a software library.
Scheduling Transactions with Temporal Constraints: Exploiting Data Semantics
Authors: Ming Xiong, Krithi Ramamritham, John A. Stankovic, Don Towsley, Rajendran Sivasankaran
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

In this paper, issues involved in the design of a real-time database which maintains data temporal consistency are discussed. The concept of data-deadline is introduced and time cognizant transaction scheduling policies are proposed. Informally, data-deadline is a deadline assigned to a transaction due to the temporal constraints of the data accessed by the transaction. Further, two time cognizant forced wait policies which improve performance significantly by forcing a transaction to delay further execution until a new version of sensor data becomes available are proposed. A way to exploit temporal data similarity to improve performance is also proposed. Finally, these policies are evaluated through detailed simulation experiments. The simulation results show that taking advantage of temporal data semantics in transaction scheduling can significantly improve the performance of user transactions in real-time database systems. In particular, it is demonstrated that under the forced wait policy, the performance can be improved significantly. Further improvements result by exploiting data similarity.
Generalized Algorithm for Parallel Sorting on Product Networks
Authors: Antonio Fernández, Kemal Efe
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

We generalize the well-known odd-even merge sorting algorithm, originally due to Batcher [2], and show how this generalized algorithm can be applied to sorting on product networks.If G is an arbitrary factor graph with N nodes, its r-dimensional product contains $N^r$ nodes. Our algorithm sorts $N^r$ keys stored in the r-dimensional product of G in $O(r^2F(N))$ time, where F(N) depends on G. We show that, for any factor graph G, F(N) is, at most, O(N), establishing an upper bound of $O(r^2\,N)$ for the time complexity of sorting $N^r$ keys on any product network.For product networks with bounded r (e.g., for grids), this leads to the asymptotic complexity of O(N) to sort $N^r$ keys, which is optimal for several instances of product networks. There are factor graphs for which $F(N)=O({\rm log}^2\,N),$ which leads to the asymptotic running time of $O({\rm log}^2\,N)$ to sort $N^r$ keys. For networks with bounded N (e.g., in the hypercube N = 2, fixed), the asymptotic complexity becomes $O(r^2).$We show how to apply the algorithm to several cases of well-known product networks, as well as others introduced recently. We compare the performance of our algorithm to well-known algorithms developed specifically for these networks, as well as others. The result of these comparisons led us to conjecture that the proposed algorithm is probably the best deterministic algorithm that can be found in terms of the low asymptotic complexity with a small constant.
Improved Digital Signature Algorithm
Authors: Chi-Sung Laih, Sung-Ming Yen
Venue: IEEE Transactions on Computers (1995)

In this brief paper, a digital signature algorithm is developed which is an improved version of the Digital Signature Algorithm (DSA) proposed by the NIST. The security of the improved version is the same as the original one while it benefits the signature signer and performs more efficiently.
On H&#x00F6;lder's inequality and its applications
Authors: Chang-jian Zhao, Mihály Bencze
Venue: Octogon Mathematical Magazine (2002)

The main purpose of the present article is first to give a simple generalizations of Hölder's inequality by using the method of analysis and theory of inequality. Then as applications, we improve some new type Pachpatte's inequalities.
A mixed-mode BIST scheme based on folding compression
Authors: Liang Huaguo, Sybille Hellebrand, Hans-Joachim Wunderlich
Venue: Journal of Computer Science and Technology (2002)

In this paper a new scheme for mixed mode scan-based BIST is presented with complete fault coverage, and some new concepts of folding set and computing are introduced. This scheme applies single feedback polynomial of LFSR for generating pseudo-random patterns, as well as for compressing and extending seeds of folding sets and an LFSR, where we encode seed of folding set as an initial seed of LFSR. Moreover these new techniques are 100% compatible with scan design. Experimental results show that the proposed scheme outperforms previously published approaches based on the reseeding of LFSRs.
Meshes: the next generation
Authors: Mark Christon, David Hardin, John Compton, Mary Zosel
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Building complex meshes for large-scale numerical simulations presents immense difficulties in exploiting high-performance computers. Industry and research leaders will describe the current state of the art for generating meshes for such large scientific problems. This will be followed by a panel and general audience discussion of the algorithmic and architectural issues surrounding the generation of meshes with 107 to 109 grid points. (Note: The terms "mesh" and "grid" are used interchangeably in the literature.)
Embedable Problem-Solving Architectures: A Study of Integrating OPS5 with UMass GBB
Authors: D. D. Corkill
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The requirements of a problem-solving architecture that can be tightly embedded within other architectures and coexist with multiple instances of itself and of other problem-solvers are discussed. The additional effort needed to produce an embedable problem-solving architecture is minor compared to the substantial increase in applicability of the architecture. A specific need for embedable problem-solvers arose with the University of Massachusetts Generic Blackboard Framework (UMass GBB). UMass GBB is based on the blackboard paradigm, which naturally integrates heterogeneous problem-solving representations as individual knowledge sources (KSs). This need is met by developing general specifications for embedable problem-solving architectures, and the specifications are used to modify the public-domain version of OPS5 in order to embed it as an integral KS language within UMass GBB. The OPS5 modifications result in an easily integrated GBB KS language (distributed with the UMass GBB system) that has been used in several GBB applications.
Making smalltalk a database system
Authors: George Copeland, David Maier
Venue: ACM SIGMOD Record (1984)

To overcome limitations in the modeling power of existing database systems and provide a better tool for database application programming, Servio Logic Corporation is developing a computer system to support a set-theoretic data model in an object-oriented programming environment We recount the problems with existing models and database systems We then show how features of Smalltalk, such such as operational semantics, its type hierarchy, entity identity and the merging of programming and data language, solve many of those problems Nest we consider what Smalltalk lacks as a database system secondary storage management, a declarative semantics, concurrency, past states To address these shortcomings, we needed a formal data model We introduce the GemStone data model, and show how it helps to define path expressions, a declarative semantics and object history in the OPAL language We summarize similar approaches, and give a brief overview of the GemStone system implementation
Effect of dopants on chemical mechanical polishing of Silicon
Authors: M. Forsberg, N. Keskitalo, J. Olsson
Venue: Microelectronic Engineering (2002)

In microelectronic manufacturing, chemical mechanical polishing (CMP) of silicon is becoming a more and more important process. This work investigates the effect of dopants on CMP of silicon. A high boron concentration is found to reduce the removal rate. The boron induced reduction is clearly demonstrated by observing boron diffused areas on a wafer protrude during polishing. A high phosphorus concentration enhances the removal rate. It is also found that the removal rate is lower for the Si(111) compared to the Si(100) orientation.
A Unified Object Topology
Authors: William M. Tepfenhart, James J. Cusick
Venue: IEEE Software (1997)

This article offers a structure for understanding how kits, frameworks, and systems fit in with patterns, architectural styles, and domain analysis. The article applies the structure to show what information-specifically, patterns and architectural styles-are required to develop kits, frameworks, and systems, and how that information fits into a systems development life cycle. The topology also identifies potential products and research areas.
Householder CORDIC Algorithms
Authors: Jean-Marc Delosme, Shen-Fu Hsiao
Venue: IEEE Transactions on Computers (1995)

Matrix computations are often expressed in terms of plane rotations, which may be implemented using COordinate Rotation DIgital Computer (CORDIC) arithmetic. As matrix sizes increase multiprocessor systems employing traditional CORDIC arithmetic, which operates on two-dimensional (2D) vectors, become unable to achieve sufficient speed. Speed may be increased by expressing the matrix computations in terms of higher dimensional rotations and implementing these rotations using novel CORDIC algorithms¿called Householder CORDIC¿that extend CORDIC arithmetic to arbitrary dimensions. The method employed to prove the convergence of these multi-dimensional algorithms differs from the one used in the 2D case. After a discussion of scaling factor decomposition, range extension and numerical errors, VLSI implementations of Householder CORDIC processors are presented and their speed and area are estimated. Finally, some applications of the Householder CORDIC algorithms are listed.
Telcordia Technologies: The Journey to High Maturity
Authors: Bill Pitterman
Venue: IEEE Software (2000)

How does a large, multifaceted company change its culture from one where quality and customer satisfaction were an afterthought to one where these elements became the driving force behind its main software development business, achieving both ISO 9001 registration and a CMM Level 5 rating in the process? Telcordia Technologies instituted these institution-wide changes over five years.
Programmable DSPs: A Brief Overview
Authors: Edward A. Lee
Venue: IEEE Micro (1990)

A brief history of digital signal processors (DSPs), which may become the key to the integration of telecommunications and computation, is presented. A tabular summary of models to date is provided. The recent emergence of DSP cores is discussed.