ppxscal/embedding_network huggingface dataset:
Compiling C on a Multiple-Stack Architecture
Authors: Claus Assmann, Andreas Huth
Venue: IEEE Micro (1996)

A major distinguishing feature of RISC processor architectures is the organization of their register files. They basically fall into three categories: a flat register file as in MIPS processors, fixed--size register windows as in the SPARC processor line, and a stack-like organization as in the AM29K processors. The purpose of this paper is to introduce a RISC processor architecture Fast with a unique stack system. It has been designed with the special needs of functional languages in mind. To demonstrate the suitability of this architecture for conventional languages, we have implemented a C compiler for it. This paper gives an overview over the important parts of the architecture. It describes the adaptation of a standard C compiler to this architecture, and compares the resulting performance with SPARC and MIPS implementations.
Guest Editor's Introduction: Breaking Out of the Software Engineering Mind-Mold
Authors: Terry Bollinger
Venue: IEEE Software (2002)

I like to read anything that makes me think. As an example--I recently read an article proposing that software engineering is an attempt to merge two opposing themes. Para-phrasing a bit, I would call the first theme a discipline of completeness; the second is freedom of creation.
A Survey of Recent Results in the Spectral Theory of Ergodic Dynamical Systems
Authors: G. R. Goodson
Venue: Journal of Dynamical and Control Systems (1999)

The purpose of this paper is to survey recent results in the spectral theory of ergodic dynamical systems. In addition we prove some known results using new methods and mention some new results, including the recent solution to Rokhlin's problem concerning ergodic transformations having a homogeneous spectrum of multiplicity two. We emphasize applications of ideas arising from the theory of joinings and Markov intertwinings.
Characterizing Substrate Coupling in Deep-Submicron Designs
Authors: Luis Miguel Silveira, Nuno Vargas
Venue: IEEE Design Test (2002)

The accurate modeling of noise-coupling effects caused by crosstalk through the substrate is an increasingly important concern for design and verification of analog, digital, and mixed systems. With the technique described here, designers can efficiently extract accurate substrate-coupling parameters from deep-submicron designs.
Discovering Useful Concept Prototypes for Classification Based on Filtering and Abstraction
Authors: Wai Lam, Chi-Kin Keung, Danyu Liu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

The nearest-neighbor algorithm and its derivatives have been shown to perform well for pattern classification. Despite their high classification accuracy, they suffer from high storage requirement, computational cost, and sensitivity to noise. We develop a new framework, called ICPL (Integrated Concept Prototype Learner), which integrates instance-filtering and instance-abstraction techniques by maintaining a balance of different kinds of concept prototypes according to instance locality. The abstraction component, based on typicality, employed in our ICPL framework is specially designed for concept integration. We have conducted experiments on a total of 50 real-world benchmark data sets. We find that our ICPL framework maintains or achieves better classification accuracy and gains a significant improvement in data reduction compared with existing filtering and abstraction techniques as well as some existing techniques.
On Poisson Solvers and Semi-Direct Methods for Computing Area Based Optical Flow
Authors: A. K. Chhabra, T. A. Grogan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Simchony, Chellappa, and Shao (1990) proposed a semi-direct method for computing area based optical flow. Their method is based on the iterative application of a direct Poisson solver. This method is restricted to Dirichlet boundary conditions, i.e., it is applicable only when velocity vectors at the boundary of the domain are known a priori. The authors show, both experimentally and through analysis, that the semi-direct method converges only for very large smoothness. At such levels of smoothness, the solution is obtained merely by filling in the known boundary values; the data from the image is almost totally ignored. Next, the authors consider the Concus and Golub method (1973), another semi-direct method, for computing optical flow. This method always converges, but the convergence is too slow to be of any practical value. The authors conclude that semi-direct methods are not suited for the computation of area based optical flow.
A Petri Net Model for Reasoning in the Presence of Inconsistency
Authors: T. Murata, V. S. Subrahmanian, T. Wakayama
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Petri nets provide a promising framework for executing queries to logic programs. Petri net models for query processing in logic programming were initially developed by T. Murata and D. Zhang (IEEE Trans. Software Eng., vol.14, no.4, p.481-97, 1988). It is shown how this framework can be extended to be applicable to reasoning in the presence of inconsistency. This yields a Petri net model of programs that be inconsistent in classical logic. This is interesting because large expert systems may often contain inconsistent information. The Petri net method proposed suggests a robust way of preventing inconsistency from infecting a system and rendering it useless.
Aspiration-based and reciprocity-based rules in learning dynamics for symmetric normal-form games
Authors: Dale O. Stahl, Ernan Haruvy
Venue: Journal of Mathematical Psychology (2002)

Psychologically based rules are important in human behavior and have the potential of explaining equilibrium selection and separatrix crossings to a payoff dominant equilibrium in coordination games. We show how a rule learning theory can easily accommodate behavioral rules such as aspiration-based experimentation and reciprocity-based cooperation and how to test for the significance of additional rules. We confront this enhanced rule learning model with experimental data on games with multiple equilibria and separatrix-crossing behavior. Maximum likelihood results do not support aspiration-based experimentation or anticipated reciprocity as significant explanatory factors, but do support a small propensity for non-aspiration-based experimentation by random belief and non-reciprocity-based cooperation.
Multilevel optimization for large-scale circuit placement
Authors: Tony F. Chan, Jason Cong, Tianming Kong, Joseph R. Shinnerl
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

We have designed and implemented a new class of fast and highly scalable placement algorithms that directly handle complex constraints and achieve total wirelengths comparable to the state of the art. Our approach exploits recent advances in (i) multilevel methods for hierarchical computation, (ii) interior-point methods for nonconvex nonlinear programming, and (iii) the Fast Multipole Method for the order N evaluation of sums over the N (N - 1)/2 pairwise interactions of N components. Significant adaptation of these methods for the placement problem is required, and we have therefore developed a set of customized discrete algorithms for clustering, declustering, slot assignment, and local refinement with which the continuous algorithms are naturally combined. Preliminary test runs on benchmark circuits with up to 184,000 cells produce total wirelengths within approximately 5-10% of those of GORDIAN-L [1] in less than one tenth the run time. Such an ultra-fast placement engine is badly needed for timing convergence of the synthesis and layout phases of integrated circuit design.
Designing Innovative Reading Experiences for a Museum Exhibition
Authors: Maribeth Back, Rich Gold, Anne Balsamo, Mark Chow, Matt Gorbet, Steve Harrison, Dale MacDonald, Scott Minneman
Venue: Computer (2001)

In 1998, the Tech Museum of Innovation in San Jose invited the Research in Experimental Documents (RED) group at Xerox Corporation's Palo Alto Research Center to develop an exhibit for its Center of the Edge Gallery. RED convenes researchers skilled in video production, mechanical engineering, interface design, architecture, cultural theory, sound engineering, cartooning, writing, lighting, programming, industrial design, and graphic arts to design and build real working objects and prototypes. It explores new document genres within emerging media through hands-on experimentation. RED searches for projects that influence the real world, using public reaction to gain insight into a project's effectiveness and "speculative design" process. The Tech Museum focuses on current technology rather than science. Its 250 exhibits are interactive, original, or custom-made. Reading remains central to our technological society, and the authors show how digital technology facilitates an array of exciting reading experiences. The exhibit encourages people to consider the genesis of the text they read and ask how technology might change what, where, and how they read.
Visualization of sports using motion trajectories: providing insights into performance, style, and strategy
Authors: Gopal Pingali, Agata Opalach, Yves Jean, Ingrid Carlbom
Venue: Proceedings of the conference on Visualization '01 (2001)

Remote experience of sporting events has thus far been limited mostly to watching video and the scores and statistics associated with the sport. However, a fast-developing trend is the use of visualization techniques to give new insights into performance, style, and strategy of the players. Automated techniques can extract accurate information from video about player performance that not even the most skilled observer is able to discern. When presented as static images or as a three-dimensional virtual replay, this information makes viewing a game an entirely new and exciting experience.This paper presents one such sports visualization system called LucentVision, which has been developed for the sport of tennis. LucentVision uses real-time video analysis to obtain motion trajectories of players and the ball, and offers a rich set of visualization options based on this trajectory data. The system has been used extensively in the broadcast of international tennis tournaments, both on television and the Internet.
Two-Level Minimization of Multivalued Functions with Large Offsets
Authors: A. A. Malik, R. K. Brayton, A. R. Newton, A. L. Sangiovanni-Vincentelli
Venue: IEEE Transactions on Computers (1993)

Extends the theory of reduced offsets to logic functions with multivalued inputs. The authors show that the use of multivalued reduced offsets provides the same flexibility that is available with the use of the offset. Offset-based minimization of multivalued functions with large offsets often takes long computation time and requires very large memory and sometimes is not possible within reasonable time and memory. Such functions can be minimized effectively using reduced offsets.
Designing Access Methods for Bitemporal Databases
Authors: Anil Kumar, Vassilis J. Tsotras, Christos Faloutsos
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

By supporting the valid and transaction time dimensions, bitemporal databases represent reality more accurately than conventional databases. In this paper, we examine the issues involved in designing efficient access methods for bitemporal databases, and propose the partial-persistence and the double-tree methodologies. The partial-persistence methodology reduces bitemporal queries to partial persistence problems for which an efficient access method is then designed. The double-tree methodology "sees" each bitemporal data object as consisting of two intervals (a valid-time and a transaction-time interval) and divides objects into two categories according to whether the right endpoint of the transaction time interval is already known. A common characteristic of both methodologies is that they take into account the properties of each time dimension. Their performance is compared with a straightforward approach that "sees" the intervals associated with a bitemporal object as composing one rectangle, which is stored in a single multidimensional access method. Given that some limited additional space is available, our experimental results show that the partial-persistence methodology provides the best overall performance, especially for transaction timeslice queries. For those applications that require ready, off-the-shelf, access methods, the double-tree methodology is a good alternative.
Orientation-Based Differential Geometric Representations for Computer Vision Applications
Authors: P. Liang, C. H. Taubes
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Orientation-based representations (OBR's) have many advantages. Three orientation-based differential geometric representations in computer vision literature are critically examined. The three representations are the extended Gaussian image (EGI), the support-function-based representation (SFBR), and the generalized Gaussian image (GGI). The scope of unique representation, invariant properties from matching considerations, computation and storage requirements, and relations between the three representations are analyzed. A constructive proof of the uniqueness of the SFBR for smooth surfaces is given. It is shown that an OBR using any combination of locally defined descriptors is insufficient to uniquely characterize a surface. It must contain either global descriptors or ordering information to uniquely characterize a surface. The GGI as it was originally introduced requires the recording of one principle vector. It is shown in this paper that this is unnecessary. This reduces the storage requirement of a GGI, therefore making it a more attractive representation. The key ideas of the GGI are to represent the multiple folds of a Gaussian image separately; the use of linked data structures to preserve ordering at all levels and between the folds; and the indexing of the data structures by the unit normal. It extends the EGI approach to a much wider range of applications.
Improvisation in Small Software Organizations
Authors: Tore Dybå
Venue: IEEE Software (2000)

Traditional ways of developing software and improving the software process rely on theories that assume that the environment is predictable. However, for most small software organizations the environment is constantly changing and often unpredictable. The author explores improvisation and its role in smaller companies.
Does OO Sync with How We Think?
Authors: Les Hatton
Venue: IEEE Software (1998)

Given that corrective-maintenance costs already dominate the software life cycle and look set to increase significantly, reliability in the form of reducing such costs should be the most important software improvement goal. Yet the results are not promising when we review recent corrective-maintenance data for big systems in general and for OO in particular-possibly because of mismatches between the OO paradigm and how we think.
Randomized metarounding
Authors: Robert Carr, Santosh Vempala
Venue: Random Structures Algorithms (2002)

Let P be a linear relaxation of an integer polytope Z such that the integrality gap of P with respect to Z is at most r, as verified by a polytime heuristic A, which on any positive cost function c returns an integer solution (an extreme point of Z) whose cost is at most r times the optimal cost over P. Then for any point x* in P (a fractional solution), rx* dominates some convex combination of extreme points of Z. A constructive version of this theorem is presented here, with applications to approximation algorithms, and can be viewed as a generalization of randomized rounding.
Reliability of Answers to Queries in Relational Databases
Authors: F. Sadri
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The author studies the problem of determining the reliability of answers to queries in a relational database system, where the information in the database comes from various sources with varying degrees of reliability. An extended relational model is proposed in which each tuple in a relation is associated with an information source vector which identifies the information source(s) that contributed to that tuple. The author shows how relational algebra operations can be extended, and implemented using information source vectors, to calculate the vector corresponding to each tuple in the answer to a query, and hence, to identify information source(s) contributing to each tuple in the answer. This also enables the database system to calculate the reliability of each tuple in the answer to a query as a function of the reliability of information sources.
Response of a mesoscopic superconducting disk to magnetic fields
Authors: Akinobu Kanda, Youiti Ootuka
Venue: Microelectronic Engineering (2002)

We have studied the response of a mesoscopic superconducting disk to magnetic fields through energy gap measurement at four points on the disk boundary. On increasing magnetic field, magnitude and direction of the supercurrent are almost the same at the four points, showing that uniform diamagnetic supercurrent is flowing along the disk boundary. On decreasing magnetic field, on the other hand, magnitude and direction of the supercurrent depend on measuring position and strength of the magnetic field. Particularly, paramagnetic supercurrent is observed at high magnetic fields. The condition for the observation is the same as that for the paramagnetic Meissner effect, strongly indicating that the origin of the paramagnetic Meissner effect is the paramagnetic supercurrent.
Transient Fault Tolerance in Digital Systems
Authors: Janusz Sosnowski
Venue: IEEE Micro (1994)

It is hard to shield systems effectively from transient faults (fault avoidance techniques). So some other means must be employed to assure appropriate levels of transient fault tolerance (insensitivity to transient faults). They are based on fault-masking and fault recovery ideas. Having analyzed this problem, the author identifies critical design points and outlines some practical solutions that refer to efficient on-line detectors (detecting errors during the system operation) and error handling procedures. This framework provides a basis for understanding transient fault problems in digital systems. It can be helpful in selecting optimum techniques to mask or eliminate transient fault effects in developed systems.
Object Identification From Multiple Images Based on Point Matching Under a General Transformation
Authors: M. C. K. Yang, J. S. Lee
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This work is motivated by ship identification from a sequence of ISAR images. Maximum likelihood classification, based on point matching, is formulated when the observed images are subject to missing points and phantoms. The 3-D to 2-D transformation is assumed to be known only in a certain parametric form. Proper weights, based on the noise levels for all images, are derived for the classification formula. The new formulation simplifies the computation of matching and makes its extension to object identification from multiple images feasible. Moreover, some theoretical properties of the identification procedure can now be investigated. Guidelines on which groups of objects are easier to distinguish are found from statistical theory followed by intuitive explanation. This method is then applied to ship identification with simulated ISAR images.
UltraSPARC-IIi: Expanding the Boundaries of a System on a Chip
Authors: Kevin B. Normoyle, Michael A. Csoppenszky, Allan Tzeng, Timothy P. Johnson, Christopher D. Furman, Jamshid Mostoufi
Venue: IEEE Micro (1998)

The UltraSPARC-IIi allows a system the benefits of UltraSPARC performance and bandwidth, while enabling the cost effective use of PC-class system components. Sun's popular SolarisTM operating system is fully supported, and all UltraSPARC software is compatible. It is a 64-bit superscalar SPARCTM V9 machine, targeted for use in uniprocessor systems, that is an example of a high-performance system-on-a-chip. Functions spanning at least three separate complex system ASICs along with a modified UltraSPARC-II core are combined into one coherent system on a single die running at 300 MHz. The net effect is a general purpose CPU that contains an integrated DRAM controller, PCI 2.1 compatible 66MHz/32-bit I/O interface, high-end UltraSPARC Port ArchitectureTM (UPA) bus interface, second-level cache controller, three MMUs, three TLBs, flexible interrupts, plus other important system functions and V9 extensions. The most notable of the extensions to V9 is VISTM - extended instruction set for imaging and networking. The result is a very cost effective platform for desktop, server, and high-performance networking, telecommunications, and imaging embedded systems.
Smart simulation using collaborative formal and simulation engines
Authors: Pei Hsin Ho, Thomas Shiple, Kevin Harer, James Kukula, Robert Damiano, Valeria Bertacco, Jerry Taylor, Jiang Long
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

We present Ketchum, a tool that was developed to improve the productivity of simulation-based functional verification by providing two capabilities: (1) automatic test generation and (2) unreachability analysis. Given a set of "interesting" signals in the design under test (DUT), automatic test generation creates input stimuli that drive the DUT through as many different combinations (called coverage states) of these signals as possible to thoroughly exercise the DUT. Unreachability analysis identifies as many unreachable coverage states as possible.Ketchum differs from the previous published results for several reasons. First, Ketchum provides 10x higher capacity than previous published results. The higher capacity is achieved by carefully orchestrating simulation and multiple formal methods including symbolic simulation, SAT-based BMC, symbolic fixpoint computation and automatic abstraction. Second, Ketchum performs not only automatic test generation but also unreachability analysis, which enables the test generation effort to be focused on coverage states that are not unreachable. Third, the backbone of Ketchum is an off-the-shelf commercial simulator. It enables Ketchum to reach deep states of the design quickly and supports simulation monitors through the standard API of the simulator during test generation.We applied Ketchum to several industrial designs, including the picoJava microprocessor from SUN and the DW8051 microcontroller from Synopsys and obtained very promising results. The experiments show that Ketchum can (1) handle design blocks containing more than 4500 latches and 170K gates, (2) reach up to 6x more coverage states than random simulation and (3) identify a majority of the unreachable coverage states.
Universal graphs without large bipartite graphs assuming GCH
Authors: Ofer Shafir
Venue: Discrete Mathematics (2002)

Among a family of graphs H a graph G is called universal if any graph in H is isomorphic to an induced subgraph of G, and is called w-universal if any graph in H is isomorphic to a subgraph of G. The problem of the existence of universal and w-universal graphs was examined first for the family {G: G is of cardinality λ and omits the complete graph on κ} and was completely settled by Komjáth and Shelah (J. Combin. Theory Ser. B 63(1) (1995)). assuming GCH. The study of the families Hλ,κ,θ = {G: G is a graph of cardinality λ and omits the bipartite graph B(κ,θ)} started by Komjáth and Pach (Mathematika 31 (1984)) where it was proved that there is no w-universal graph for HN1N1Nm0 assuming ⋄w1. In an unpublished result, Saharon Shelah weakened this condition to CH and his proof is presented here as Theorem 1. In Theorem 2 we replace this assumption by (N1) and a = N1 and in Theorems 3 and 4 we give sufficient conditions for the nonexistence of a universal graph for such families (for example for H2N02N0,N0 this is true in ZFC).