ppxscal/embedding_network huggingface dataset:
A Generalized Scheme for Mapping Parallel Algorithms
Authors: V. Chaudhary, J. K. Aggarwal
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

A generalized mapping strategy that uses a combination of graph theory, mathematicalprogramming, and heuristics is proposed. The authors use the knowledge from the givenalgorithm and the architecture to guide the mapping. The approach begins with agraphical representation of the parallel algorithm (problem graph) and the parallelcomputer (host graph). Using these representations, the authors generate a newgraphical representation (extended host graph) on which the problem graph is mapped.An accurate characterization of the communication overhead is used in the objectivefunctions to evaluate the optimality of the mapping. An efficient mapping scheme isdeveloped which uses two levels of optimization procedures. The objective functionsinclude minimizing the communication overhead and minimizing the total execution timewhich includes both computation and communication times. The mapping scheme istested by simulation and further confirmed by mapping a real world application ontoactual distributed environments.
Materialization and Its Metaclass Implementation
Authors: Mohamed Dahchour, Alain Pirotte, Esteban Zimányi
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Materialization is a powerful and ubiquitous abstraction pattern for conceptual modeling that relates a class of categories (e.g., models of cars) and a class of more concrete objects (e.g., individual cars). This paper presents materialization as a generic relationship between two classes of objects and describes an abstract implementation of it. The presentation is abstract in that it is not targeted at a specific object system. The target system is supposed to provide: 1) basic object-modeling facilities, supplemented with an explicit metaclass concept and 2) operations for dynamic schema evolution like creation or deletion of a subclass of a given class and modification of the type of an attribute of a class. The presentation is generic in that the semantics of materialization is implemented in a metaclass, which is a template to be instantiated in applications. Application classes are created as instances of the metaclass and they are thereby endowed with structure and behavior consistent with the generic semantics of materialization.
Rapid Prototyping for DSP Systems with Multiprocessors
Authors: Marc Engels, Rudy Lauwereins, J. A. Peperstraete
Venue: IEEE Design Test (1991)

The authors describe the hardware and software of a system for prototyping digital-signal-processing applications by using commercially available digital-signal processors linked to form multiprocessors. The graphical programming environment makes it easier to program, compile, debug, and test DSP algorithms. The system reduces the cost of application prototyping, making it a feasible step at early design stages. To demonstrate the advantages of their approach, the authors explain how they prototyped a digital audio broadcast system. The complexities encountered highlight the limitations of the system.
Area I/O's Potential for Future Processor Systems
Authors: Etienne Hirt, Michael Scheffler, Jean-Pierre Wyss
Venue: IEEE Micro (1998)

"The next performance increase in microprocessor systems is waiting just behind the corner". This statement seems to be proven every year when the new generation of microprocessors is launched. Although one cannot deny that progress is made primarily at chip level and that it is much slower on the system level: Whereas state-of-the-art processors already today show internal clock rates being predicted for the future as shown in the NTRS road map (Table 1), the external clock rate and especially memory bus width cannot keep up with this development. Even by adding several levels of cache hierarchies to overcome this discrepancy between off-chip bandwidth and on-chip speed, the maximum latency will enlarge more and more [1]. Today, even the I/O bus proposed in the road map are difficult to connect to the outside world.Thus, performance figures as bandwidth, latency, system speed, and not to forget, size of future microprocessor systems are highly dependent on the interconnection technologies. In fact, when taking into account the expected feature size reduction due to semiconductor technology improvements, interconnection will be the performance show stopper.
Implementation Strategies for First-Class Continuations
Authors: William D. Clinger
Venue: Higher-Order and Symbolic Computation (1999)

Scheme and Smalltalk continuations may have unlimited extent. This means that a purely stack-based implementation of continuations, as suffices for most languages, is inadequate. We review several implementation strategies for continuations and compare their performance using instruction counts for the normal case and continuation-intensive synthetic benchmarks for other scenarios, including coroutines and multitasking. All of the strategies constrain a compiler in some way, resulting in indirect costs that are hard to measure directly. We use related measurements on a set of benchmarks to calculate upper bounds for these indirect costs.
Roll-Forward Checkpointing Scheme: A Novel Fault-Tolerant Architecture
Authors: D. K. Pradhan, N. H Vaidya
Venue: IEEE Transactions on Computers (1994)

We propose a novel architecture for a fault-tolerant multiprocessor environment. It is assumed that the multiprocessor organization consists of a pool of active processing modules and either a small number of spare modules or active modules with some spare processing capacity. A fault-tolerance scheme is developed for duplex systems using checkpoints. Our scheme, unlike traditional checkpointing schemes, requires no rollbacks for recovering from single faults. The objective is to achieve performance of a triple modular redundant system using duplex system redundancy.
Parallel Implementation of Multiple Model Tracking Algorithms
Authors: A. Averbuch, S. Itzikowitz, T. Kapon
Venue: IEEE Transactions on Parallel and Distributed Systems (1991)

The implementations of the Viterbi algorithm (VA) and the interacting multiple model(IMM) algorithm on a shared-bus and shared-memory multiple-input multiple-data (MIMD) multiprocessor are discussed. The computational complexity as well as the speedup and efficiency are examined in detail. It is shown that the computational complexity of the parallel implementation of these algorithms is about the same in both memory space and processing time categories. Efficiency with P processors is about 1-1/P for small P and is expected to be relatively high for large P, especially when many filters and large state and measurement vectors are considered.
Perfect shifters
Authors: C. M. Fiduccia, K. J. Rappoport
Venue: IEEE Transactions on Computers (1994)

Pin-efficient single-instruction multiple-data networks, with p/spl ap//spl radic/(2m) pins per cell that can/spl minus/in one clock tick/spl minus/shift data by any amount k in an interval /spl lsqb//spl minus/m,m/spl rsqb/ are considered. Perfect barrel shifters, which perform the group of permutations c/spl rarr/c+k(mod n), 0/spl les/k/spl les/n/spl minus/1, using p=q+1 pins per cell, are known to exist for all n=q/sup 2/+q+1, where q is any prime power. In sharp contrast, it is shown that for any permutation /spl pi/ of order greater than 3m, one-tick perfect shifters for the set of permutations /spl pi//sup /spl lsqb//spl minus/m,m/spl rsqb//=/spl lcub//spl pi//sup k//spl verbar//spl minus/m/spl les/k/spl les/m/spl rcub/ exist only for the three cases (m=1, p=2), (m=3, p=3), and (m=6, p=4). In particular, only three perfect linear arrays, c/spl rarr/c+k, exist. The proof is based on a relationship between the difference covers and zero-one solutions to certain quadratic equations.
Software Risk Management
Authors: Barry W. Boehm, Tom DeMarco
Venue: IEEE Software (1997)

In mature engineering disciplines, risk management has been de rigeur for centuries. When Michelangelo set out to raise the dome of St. Peters in 1547, he was well aware of the potential collapse zones under the staging, the possibility of materials failure, and the human capacity for error. For each of these major risks he prepared a mitigation plan: a fallback, a safety factor, or an alternative. Today, we routinely practice risk management in our stewardship of the environment, in planning financial strategy, in construction engineering, and in medicine. But how do we apply it to the ultimate risky business, software development?
Motion Tracking with an Active Camera
Authors: D. Murray, A. Basu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper describes a method for real-time motion detection using an active camera mounted on a pan/tilt platform. Image mapping is used to align images of different viewpoints so that static camera motion detection can be applied. In the presence of camera position noise, the image mapping is inexact and compensation techniques fail. The use of morphological filtering of motion images is explored to desensitize the detection algorithm to inaccuracies in background compensation, Two motion detection techniques are examined, and experiments to verify the methods are presented. The system successfully extracts moving edges from dynamic images even when the pan/tilt angles between successive frames are as large as 3.
Continuous topology simplification of planar vector fields
Authors: Xavier Tricoche, Gerik Scheuermann, Hans Hagen
Venue: Proceedings of the conference on Visualization '01 (2001)

Vector fields can present complex structural behavior, especially in turbulent computational fluid dynamics. The topological analysis of these datasets reduces the information but one is usually still left with too many details for interpretation. In this paper, we present a simplification approach that removes pairs of critical points from the dataset, based on relevance measures. In contrast to earlier methods, no grid changes are necessary since the whole method uses small local changes of the vector values defining the vector field. An interpretation in terms of bifurcations underlines the continuous, natural flavor of the algorithm.
An optimal simple parallel algorithm for testing isomorphism of maximal outerplanar graphs
Authors: Shan-Chyun Ku, Biing-Feng Wang
Venue: Journal of Parallel and Distributed Computing (2002)

An outerplanar graph is a planar graph that can be imbedded in the plane in such a way that all vertices lie on the exterior face. An outerplanar graph is maximal if no edge can be added to the graph without violating the outer-planarity. In this paper, an optimal parallel algorithm is proposed on the EREW PRAM for testing isomorphism of two maximal outerplanar graphs. The proposed algorithm takes O(log n) time using O(n) work. Besides being optimal, it is very simple. Moreover, it can be implemented optimally on the CRCW PRAM in O(1) time.
Efficient Minimisation of the KL Distance for the Approximation of Posterior Conditional Probabilities
Authors: M. Battisti, P. Burrascano, D. Pirollo
Venue: Neural Processing Letters (1997)

The minimisation of a least mean squares cost function produces poor results in the ranges of the input variable where the quantity to be approximated takes on relatively low values. This can be a problem if an accurate approximation is required in a wide dynamic range. The present paper approaches this problem in the case of multilayer perceptrons trained to approximate the posterior conditional probabilities in a multicategory classification problem. The use of a cost function derived from the Kullback&ndash;Leibler information distance measure is proposed and a computationally light algorithm is derived for its minimisation. The effectiveness of the procedure is experimentally verified.
The Successful Diffusion of Innovations: Guidance for Software Development Organizations
Authors: Gina C. Green, Alan R. Hevner
Venue: IEEE Software (2000)

The authors present results from a research field study that examined the question: What factors explain the successful diffusion of new software de-velopment techniques into practice? They created a research framework that ex-plores the complex relationship between developer involvement in the IT adoption process, characteristics of the environ-ment into which the IT is introduced, de-veloper control issues, and IT diffusion success.
Using Distributed Objects to Build the Stanford Digital Library Infobus
Authors: Andreas Paepcke, Michelle Q. Wang Baldonado, Chen-Chuan K. Chang, Steve Cousins, Hector Garcia-Molina
Venue: Computer (1999)

For digital libraries to thrive, the providers of information and information processing services must be able to evolve their systems autonomously. However, as the complexity of their offerings increases, software tools more sophisticated than existing Web facilities are needed. Distributed object technology may be the answer. The availability of high-volume, increasingly sophisticated information is making the need for metadata facilities more urgent. Traditional, library-based approaches break down when used in an advanced digital library. More modular mechanisms are needed, and the CORBA system is one approach. Digital libraries are affected at a deep technical level by the widely differing user traditions of Web users and library patrons. The challenge and opportunity of digital libraries will be the synthesis of these traditions. Four years ago the authors of this article set out to create a technical infra-structure to support the construction of digital libraries. In their view, a digital library comprises widely distributed resources that can be maintained autonomously by different organizations and will not require adherence to uniform interfaces.
Walking around fat obstacles
Authors: L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem
Venue: Information Processing Letters (2002)

We prove that if an object O is convex and fat then, for any two points a and b on its boundary, there exists a path on O's boundary, from a to b, whose length is bounded by the length of the line segment ab times some constant β. This constant is a function of the dimension d and the fatness parameter. We prove bounds for β, and show how to efficiently find paths on the boundary of O whose lengths are within these bounds. As an application of this result, we briefly consider the problem of efficiently computing short paths in Rd in the presence of disjoint convex fat obstacles.
Developing Diffractive Optics for Optical Computing
Authors: Mohammad R. Taghizadeh, J. Michael Miller, Paul Blair, Frank A. P. Tooley
Venue: IEEE Micro (1994)

Diffractive optical elements easily handle tasks such as the generation of uniform arrays of beams, beam steering and focusing, and aberration correction that conventional optics alone often find difficult or impossible. Here we review the design, fabrication, and performance of DOEs for use as free-space interconnection elements in optical-computing and photonic-switching applications. Our discussion focuses on Fourier- and Fresnel-regime surface-relief structures and their microlithographic fabrication. We include two practical examples to demonstrate the potential of such optical elements.
An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation
Authors: Z. Wu, R. Leahy
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A novel graph theoretic approach for data clustering is presented and its application to the image segmentation problem is demonstrated. The data to be clustered are represented by an undirected adjacency graph G with arc capacities assigned to reflect the similarity between the linked vertices. Clustering is achieved by removing arcs of G to form mutually exclusive subgraphs such that the largest inter-subgraph maximum flow is minimized. For graphs of moderate size ( approximately 2000 vertices), the optimal solution is obtained through partitioning a flow and cut equivalent tree of G, which can be efficiently constructed using the Gomory-Hu algorithm (1961). However for larger graphs this approach is impractical. New theorems for subgraph condensation are derived and are then used to develop a fast algorithm which hierarchically constructs and partitions a partially equivalent tree of much reduced size. This algorithm results in an optimal solution equivalent to that obtained by partitioning the complete equivalent tree and is able to handle very large graphs with several hundred thousand vertices. The new clustering algorithm is applied to the image segmentation problem. The segmentation is achieved by effectively searching for closed contours of edge elements (equivalent to minimum cuts in G), which consist mostly of strong edges, while rejecting contours containing isolated strong edges. This method is able to accurately locate region boundaries and at the same time guarantees the formation of closed edge contours.
Smart Dust: Communicating with a Cubic-Millimeter Computer
Authors: Brett Warneke, Matt Last, Brian Liebowitz, Kristofer S. J. Pister
Venue: Computer (2001)

The University of California, Berkeley's Smart Dust project explores whether an autonomous sensing, computing, and communication system can be packed into a cubic-millimeter mote (a small particle or speck) to form the basis of integrated, massively distributed sensor networks. The authors selected an arbitrary size for their sensor systems to explore microfabrication technology's limitations. Because of its discrete size, substantial functionality, connectivity, and anticipated low cost, Smart Dust will facilitate innovative methods for microfabrication technology and interact with the environment, providing more information from more places less intrusively. Smart Dust requires evolutionary and revolutionary advances in miniaturization, integration, and energy management. Designers use microelectromechanical systems to build small sensors, optical communication components, and power supplies, whereas microelectronics provides increasing functionality in smaller areas, with lower energy consumption.Research in the wireless sensor network area is growing rapidly in academia and industry. The authors look toward programming walls and furniture, and some day even insects and dust.
Software Engineering: Community and Culture
Authors: Helen Sharp, Hugh Robinson, Mark Woodman
Venue: IEEE Software (2000)

Ideas and techniques from the social sciences can improve the theory and practice of the software engineering discipline. To illustrate the contributions this cross-pollination has made, these authors focus on the nature of paradigms and software quality management systems. Their studies underscore the importance of community in how new technical ideas become accepted, how despite software engineers too often prefer polemic to evidence, and the primacy given to the local guru that transcends formal organizational structures.
Supporting statistical electronic table usage by citizens
Authors: Carol A. Hert, Elizabeth D. Liddy, Ben Shneiderman, Gary Marchionini
Venue: Communications of the ACM (2003)

Over 70 agencies at the federal level are charged with collecting data and producing and disseminating statistics. These statistics are used to inform government policy, shape health care initiatives, provide information on the state of the economy, and others. They also have significant impact on the lives of citizens who use the statistics, for example, to determine job opportunities, changes in social security benefits, and quality of life in particular areas. Our digital government project developed several specific technologies to support the location, manipulation, and understanding of a quintessential format for statistical information---the table.
Developing Infrastructure to Mass-Produce MEMS
Authors: Karen W. Markus
Venue: IEEE Computational Science Engineering (1997)

Adapted with permission from Frontiers of Engineering: Reports on Leading Edge Engineering from the 1996 NAE Symposium on Frontiers of Engineering. Copyright 1997 by the National Academy of Sciences. Courtesy of the National Academy Press, Washington, D.C. Though microelectromechanical systems are often made from silicon, the existing semiconductor technology base faces numerous challenges to meet the special requirements of fabricating MEMS devices. To realize economies of scale, seven aspects of MEMS manufacturing infrastructure must be improved.
Testing of Fault-Tolerant Hardware Through Partial Control of Inputs
Authors: I. Pomeranz, S. M. Reddy
Venue: IEEE Transactions on Computers (1993)

The problem of testing fault-tolerant redundant digital systems is investigated. To test redundant systems through normal voter outputs, independent control of the output of each replicated unit is required. In the past it was assumed that independent control of the output of a replicated unit requires independent control of all of its inputs. The authors show that partial control of inputs is actually required. The critical input set problem, which is the problem of finding a set of inputs that need to be independently controlled, is formulated. Solutions are offered for different testing strategies, including exhaustive testing and deterministic testing, and for different levels of circuit description.
CA-Based Byte Error-Correcting Code
Authors: Indranil Sen Gupta, Dipanwita Roy Chowdhury, Parimal Pal Chaudhuri
Venue: IEEE Transactions on Computers (1995)

This paper reports a novel approach for designing byte error-correcting codes using cellular automata (CA). A simple scheme for generation and decoding of single-byte error-correcting and double-byte error-detecting codes, referred to as CA-SbEC-DbED, is presented. Extension of the scheme to locate/correct larger number of information byte errors has been also included. The encoding and decoding algorithms have been designed with the help of a linear operator that can be conveniently realized with a maximum length group CA. The regular, modular and cascadable structure of CA can be economically built with VLSI technology. Compared to the existing architecture of the Reed-Solomon decoder chip, CA-based implementation of the proposed decoding scheme provides a simple cost effective solution.
Real-Life Object-Oriented Systems
Authors: Søren Lauesen
Venue: IEEE Software (1998)

Object orientation has become a popular catchphrase, yet its benefits are difficult to obtain. The author studied seven OO development teams, mapped the difficulties they encountered, and identified the best current practices. He found that the teams used one of three basic architectures. Here he explores the advantages and disadvantages of each with regard to connecting databases, applications, and screen objects.
Morphological Filtering as Template Matching
Authors: R. Jones, I. Svalbe
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Binary morphological operations with single and multiple structuring elements are implemented using look-up table (LUT) driven templates. Many complex operations can be implemented in one pipeline processing cycle for 3*3 regions of support and in four or five cycles for 5*5 regions of support. The basis representation of the operations is used to specify the required templates.