ppxscal/embedding_network huggingface dataset:
Sustaining an Industry Obsession
Authors: Rajesh Gupta
Venue: IEEE Design Test (2002)

Device scaling has long been an acceptedmantra,even an obsession, in the semiconductor industry, and if recent predictions are true, the march of deep-submicron (DSM)devicesinto the nanoscale era will continue.Process anddevice engineers will somehow find a way toovercome the looming technical challenges, justlike they always have from the earliest MOS technology days. Long-range planning, such as thatreflected in the International TechnologyRoadmap for Semiconductors, has only accelerated this trend. However,device scaling has a fundamental business purpose:either a cost advantage or a performance--and, therefore, price--advantage.At some point, the migrationof process technology nodes becomes a returnon investment (ROI)issue with direct consequences for the rest of the microelectronicsindustry.For design and test engineers, application developers, and system builders, maintaining the historic ROI for the semiconductorindustry often means doing more with less.
Design Synthesis and Silicon Compilation
Authors: Nikil D. Dutt, Daniel D. Gajski
Venue: IEEE Design Test (1990)

An overview is given of silicon compilation, which involves translating a high-level design description into layout. Levels of compilers are differentiated, and compilation is shown as a process of synthesis coupled with physical design at each level. The major tasks involved at each level are described, and examples are given to illustrate them. A typical design system based on synthesis and silicon compilation is described.
Concerning the maximum number of stable matchings in the stable marriage problem
Authors: Edward G. Thurber
Venue: Discrete Mathematics (2002)

The function, f(n), represents the maximum number of stable matchings possible in an instance of size n of the stable marriage problem. It is shown that f(n) is a strictly increasing function of n, and a result of Knuth's concerning the exponential growth of this function is generalized to apply to all positive integers, n. A method for constructing ranking matrices is used to produce instances with many stable matchings. A subproblem of the stable marriage problem developed by Eilers (Irvine Compiler Corporation Technical Report, ICC TR1999-2, 1999), called the pseudo-Latin marriage problem, plays a significant role as a tool and as motivation in the paper.
Engineering Joy
Authors: Marc Hassenzahl, Andreas Beu, Michael Burmester
Venue: IEEE Software (2001)

Joy of use has become a buzzword in user interface design although serious attempts at defining it remain sparse. The authors propose systematic methods of taking into account one of its main determinants, hedonic quality, and its complex interplay with usability and utility as a step toward truly engineering the user experience.
A real-time garbage collector with low overhead and consistent utilization
Authors: David F. Bacon, Perry Cheng, V. T. Rajan
Venue: ACM SIGPLAN Notices (2003)

Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant interest in applying garbage collection to hard real-time systems. Past approaches have generally suffered from one of two major flaws: either they were not provably real-time, or they imposed large space overheads to meet the real-time bounds. We present a mostly non-moving, dynamically defragmenting collector that overcomes both of these limitations: by avoiding copying in most cases, space requirements are kept low; and by fully incrementalizing the collector we are able to meet real-time bounds. We implemented our algorithm in the Jikes RVM and show that at real-time resolution we are able to obtain mutator utilization rates of 45% with only 1.6--2.5 times the actual space required by the application, a factor of 4 improvement in utilization over the best previously published results. Defragmentation causes no more than 4% of the traced data to be copied.
Multi-Primitive Hierarchical (MPH) Stereo Analysis
Authors: S. B. Marapane, M. M. Trivedi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This paper develops and demonstrates a new computational framework for an accurate, robust, and efficient stereo approach. In multi-primitive hierarchical (MPH) computational model, stereo analysis is performed in multiple stages, incorporating multiple primitives, utilizing a hierarchical control strategy. The MPH stereo system consists of three integrated subsystems: region-based analysis module; linear edge segment-based analysis module; and edgel-based stereo analysis module. Results of stereo analysis at higher levels of the hierarchy are used for guidance at the lower levels. The MPH stereo system does not overly rely on one type of primitive and therefore will reliably work on a wide range of scenes. The MPH stereo analysis results in the generation of several disparity maps of multiple abstraction. Disparity maps generated at each level can be fused to obtain an accurate and fine resolution disparity map. The MPH approach also provides the capability to selectively analyze image regions with varying detail. This provides the means for adaptively extracting range information of only sufficient resolution. Thus, a stereo system that utilizes primitives of different abstraction and a multilevel hierarchical computational strategy will be superior to a single-level, single-primitive system. Extensive experimentation is carried out on a wide array of scenes of varying complexity from two application domains to systematically evaluate the validity and performance of the MPH framework. The MPH stereo system is able to analyze images in most cases with 85%/spl sim/100% matching accuracy in under a minute of processing time and yield depth values typically within /spl plusmn/2% of the actual depth.
Lock-Free Garbage Collection for Multiprocessors
Authors: M. P. Herlihy, J. E. B. Moss
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

Garbage collection algorithms for shared-memory multiprocessors typically rely on some form of global synchronization to preserve consistency. Such global synchronization may lead to problems on asynchronous architectures: if one process is halted or delayed,other, nonfaulty processes will be unable to progress. By contrast, a storage management algorithm is lock-free if (in the absence of resource exhaustion) a process that is allocating or collecting memory can be delayed at any point without forcing other processes to block. The authors present the first algorithm for lock-free garbage collection in a realistic model. The algorithm assumes that processes synchronize by applying read, write, and compare operations to shared memory. This algorithm uses no locks, busy-waiting, or barrier synchronization, it does not assume that processes can observe or modify one another's local variables or registers, and it does not use inter-process interrupts.
Faster Numerical Algorithms Via Exception Handling
Authors: J. W. Demmel, Xiaoye Li
Venue: IEEE Transactions on Computers (1994)

An attractive paradigm for building fast numerical algorithms is the following: 1) try a fast but occasionally unstable algorithm, 2) test the accuracy of the computed answer, and 3) recompute the answer slowly and accurately in the unlikely event it is necessary. This is especially attractive on parallel machines where the fastest algorithms may be less stable than the best serial algorithms. Since unstable algorithms can overflow or cause other exceptions, exception handling is needed to implement this paradigm safely. To implement it efficiently, exception handling cannot be too slow. We illustrate this paradigm with numerical linear algebra algorithms from the LAPACK library.
Fast and Effective Retrieval of Medical Tumor Shapes
Authors: Philip (Flip) Korn, Nicholas Sidiropoulos, Christos Faloutsos, Eliot Siegel, Zenon Protopapas
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes ("Find tumors that are similar to a given pattern."). We use a natural similarity function for shape-matching, based on concepts from mathematical morphology, and we show how it can be lower-bounded by a set of shape features for safely pruning candidates, thus giving fast and correct output. These features can be organized in a spatial access method, leading to fast indexing for range queries and nearest-neighbor queries. In addition to the lower-bounding, our second contribution is the design of a fast algorithm for nearest-neighbor search, achieving significant speedup while provably guaranteeing correctness. Our experiments demonstrate that roughly 90 percent of the candidates can be pruned using these techniques, resulting in up to 27 times better performance compared to sequential scan.
Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision, and Variable Certainty Weights
Authors: D. Dubois, J. Lang, H. Prade
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

An approach to automated deduction under uncertainty, based on possibilistic logic, is described; for that purpose we deal with clauses weighted by a degree that is a lower bound of a necessity or a possibility measure, according to the nature of the uncertainty. Two resolution rules are used for coping with the different situations, and the classical refutation method can be generalized with these rules. Also, the lower bounds are allowed to be functions of variables involved in the clauses, which results in hypothetical reasoning capabilities. In cases where only lower bounds of necessity measures are involved, a semantics is proposed in which the completeness of the extended resolution principle is proved. The relation between our approach and the idea of minimizing abnormality is briefly discussed. Moreover, deduction from a partially inconsistent knowledge base can be managed in this approach and captures a form of nonmonotonicity.
Ada and Real-Time Robotics: Lessons Learned
Authors: Robert D. Steele, Paul G. Backes
Venue: Computer (1994)

The Supervisory Telerobotics Laboratory (Steler) at the Jet Propulsion Laboratory (JPL) has developed a prototype telerobotic system to demonstrate the type of technology that will be used aboard Space Station Freedom Although the concept of telerobotics for space exploration is not new, the Steler system broke new ground in its demonstration of the feasibility of a local-remote architecture, including ground-remote control, for space applications. A remote space environment poses some interesting computational challenges to ground-remote control of space applications. A remote site has limited computation facilities, is burdened by minimal bandwidth and by round-trip communication delays of as much as 8 seconds, and yet is expected to respond quickly, predictably, and with recoverability to any anomalous situation. Additional design constraints are imposed by NASA's limitations on software, including on-board programs for the robot, being uploaded to the remote site without prior flight qualification. The authors discuss the use of Ada to meet the computational requirements of this project.
Extraction of 3D Object Features from CAD Boundary Representation Using the Super Relation Graph Method
Authors: Ching-Yao Kao, Soundar R. T. Kumara, Rangachar Kasturi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper presents the super relation graph (SRG) method for extracting prismatic features from the CAD boundary representation of a machined part. Using the definition of super relations and the validity of a feature volume, this method recognizes features with all three types of interactions: face splitting, face merging, and edge truncation.
Isometric embedding of Mosaics into cubic lattices
Authors: Michel Deza, Mikhail Shtogrin
Venue: Discrete Mathematics (2002)

We review mosaics T (tilings of Euclidean plane by regular polygons) with respect to possible embedding, isometric up to a scale, of their skeletons or the skeletons of their duals T*, into some cubic lattice Zn. The main result of this paper is the classification, given in Table 1, of all 58 such mosaics among all 165 mosaics of the catalog, given in Chavey (Comput. Math. Appl. 17 (1989) 147) and including all main classifications of mosaics.
Containment orders for similar ellipses with a common center
Authors: P. C. Fishburn, W. T. Trotter
Venue: Discrete Mathematics (2002)

Every finite two-dimensional partially ordered set has an inclusion representation by similar noncircular ellipses centered at the origin. The representing ellipses have the same ratio r of minor axis length to major axis length, and any r ∈ (0,1) can be used for the representation.
Modeling the Economics of Testing: A DFT Perspective
Authors: Pranab K. Nag, Anne Gattiker, Sichao Wei, R. D. Blanton, Wojciech Maly
Venue: IEEE Design Test (2002)

Deciding whether and how to use DFT is difficult because the relationship of costs and benefits is far from being well understood. The tradeoff-modeling procedure presented here helps users fill in the missing links in the DFT decision-making process.
Colif: A Design Representation for Application-Specific Multiprocessor SOCs
Authors: Wander O. Cesário, Gabriela Nicolescu, Lovic Gauthier, Damien Lyonnard, Ahmed A. Jerraya
Venue: IEEE Design Test (2001)

By separating component behavior and communication infrastructure and spanning multiple abstraction levels, Colif lets designers use a divide-and-conquer approach for complex designs and focus on important customizations as they progressively refine the SOC architecture.
Integrating Tester Pin Electronics
Authors: Christopher W. Branson
Venue: IEEE Design Test (1990)

A 10-V pin electronics driver that can output signals with low distortion and fast risetimes for both narrow and wide voltage swings is described. The features combine to eliminate the need for dual drivers, pin cards, or test heads, which simplifies the testing of mixed-technology devices or modules. A high-voltages process module has been added to a standard 1.5- mu m digital CMOS process, which allows the driver to be in the same silicon as the timing and formatting circuitry. Design and calibration techniques that overcome the limitations of the high-voltage CMOS process are examined.
Evaluation of MEMS Capacitive Accelerometers
Authors: Alain Béliveau, Guy T. Spencer, Keith A. Thomas, Scott L. Roberson
Venue: IEEE Design Test (1999)

This article investigates the response and survivability of microelectromechanical systems (MEMS) "low-g" capacitive accelerometers to high-g shock levels. We evaluated three different capacitive accelerometers: Silicon Designs, Inc. (SDI) 1220 accelerometer, Analog Devices (AD) ADXL 181-1000 accelerometer, and Endevco 7290A-100 accelerometer. We chose these devices due to their differing maximum g sensing levels (MGSL). The SDI devices survived to 70 kgn, whereas the AD and Endevco devices survived to 60 kgn and 30 kgn, respectively. Each device possessed a time delay or lag in response to the applied shock when compared to a reference accelerometer. The devices were each evaluated above and below their MGSL to determine their linearity, response times, lag times, pulse duration, survivability levels, and failure modes.
Toward Work-Centered Digital Information Services
Authors: Robert Wilensky
Venue: Computer (1996)

Work-centered digital information services are a set of library-like services meant to address work group needs. Workplace users especially need to access legacy documents and external collections. They also frequently want to retrieve information (rather than documents per se), and they require that digital information systems be integrated into established work practices. Realizing work-centered digital information systems requires a broad technical agenda. Three types of analysis-document image, natural-language, and computer vision-are necessary to facilitate information extraction. Users also need new user interface paradigms and authoring tools to better access multimedia information, as well as improved protocols for client-program interaction with repositories (collections). Moreover, entirely new types of documents must be developed to exploit these capabilities. The system developed by the authors follows a client-server architecture, in which the servers are repositories implemented as databases supporting user-defined functions and user-defined access methods. The repositories also serve as indexing servers. Various protocols are stipulated for these repositories to communicate with clients. A number of interoperating clients serve as browsers for and facilitate access to different document data types. The authors are creating a prototype set of information services called the California Environmental Digital Information System, which includes a diverse collection of environmental data. The authors want this testbed to become a national resource.
Incremental Redocumentation Using the Web
Authors: Václav Rajlich
Venue: IEEE Software (2000)

Too often, a company takes over someone else's software only to find that documentation is sadly lacking. This report shows how one small software company used the Web-based Partitioned Annotations to cost-effectively evolve a software application it had inherited.
Architecture of the ORION Next-Generation Database System
Authors: W. Kim, J. F. Garza, N. Ballou, D. Woelk
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

Various architectural components of ORION-1 and ORION-1SX are described and a review of the current implementation is provided. The message handler receives all messages sent to the ORION system. The object subsystem provides high-level data management functions, including query optimization, schema management, long data management (including text search) and support for versionable objects, composite objects, and multimedia objects. The transaction management subsystem coordinates concurrent object accesses and provides recovery capabilities. The storage subsystem manages persistent storage of objects and controls the flow of objects between the secondary storage device and main memory buffers. In ORION-1, all subsystems reside in one computer. The ORION-1SX architecture is significantly different from ORION-1 in the management of shared data structures and distribution of these subsystems and their components.
Improved Filtering for the QSIM Algorithm
Authors: A. C. C. Say, S. Kuru
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

A source of spurious predictions inside the qualitative simulation algorithm QSIM proposed by B. Kuiper (1986) is identified. The proposed solution involves the use of interval corresponding values for filtering inconsistent states and does not require any additions or restrictions in the input set, unlike the other approaches to the spurious prediction elimination problem. The time and space complexities of the algorithm are not affected by the modification.
Scalability in global mobile information systems (GloMo): issues, evaluation methodology and experiences
Authors: Symeon Papavassiliou, Sheng Xu, Philip Orlik, Mike Snyder, Paul Sass
Venue: Wireless Networks (2002)

The GloMo (Global Mobile Information Systems) project1 has focused on developing new wireless ad hoc networking technologies. These new technologies rely on a broad and varied set of techniques to help cope with the problems inherent in the wireless environment. One of the most critical design elements of all the various technologies is their applicability in large scale deployments. The main objective of our work is to develop and implement a simulation methodology to help evaluate the scalability of these new ad hoc networking technologies and gain some insight into the various aspects of ad hoc network performance scalability issues. To achieve that we have developed a scalability performance evaluation framework and plan, that spans all the various dimensions of scalability: size (number of nodes and density), traffic, operational environment (i.e. propagation models, terrain etc.), mobility. For demonstration purposes we have applied this process on a representative integrated protocol suite designed to provide communication services in mobile ad hoc wireless networks. The corresponding results of the two most critical aspects of scalability properties in tactical networks (i.e. network initialization time and traffic scalability) are also presented here, and demonstrate that a very extensive evaluation of the corresponding scalability metrics under a combination of the various scalability dimensions defined in this paper, is necessary in order to provide an in-depth analysis of the scalability properties in wireless mobile ad hoc networking environments.
Case study: interactive rendering of adaptive mesh refinement data
Authors: Sanghun Park, Chandrajit L. Bajaj, Vinay Siddavanahalli
Venue: Proceedings of the conference on Visualization '02 (2002)

Adaptive mesh refinement (AMR) is a popular computational simulation technique used in various scientific and engineering fields. Although AMR data is organized in a hierarchical multi-resolution data structure, the traditional volume visualization algorithms such as ray-casting and splatting cannot handle the form without converting it to a sophisticated data structure. In this paper, we present a hierarchical multi-resolution splatting technique using k-d trees and octrees for AMR data that is suitable for implementation on the latest consumer PC graphics hardware. We describe a graphical user interface to set transfer function and viewing / rendering parameters interactively. Experimental results obtained on a general purpose PC equipped with NVIDIA GeForce card are presented to demonstrate that the technique can interactively render AMR data (over 20 frames per second). Our scheme can easily be applied to parallel rendering of time-varying AMR data.
Controlled Generation of Intensional Answers
Authors: A. Pirotte, D. Roelants, E. Zimanyi
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Intensional answers are conditions that tuples of values must satisfy to belong to the usual extensional answer of a query addressed to a deductive database. The authors review the concept of intensional answers and introduce a general method for generating them as logical consequences of the query and of deduction rules. The authors show how integrity constraints can filter out inadequate answers and produce simpler and more informative answers. An efficient organization for the combination of answers and constraints is described. The introduction of negation in queries and in the body of deduction rules is discussed. Beyond the mechanics of answer generation, the interest of the approach also depends on a strategy for selecting answers to a user submitting a query. This requires techniques for user modeling and dialogue management similar to those required for expert systems.
What Makes Software Tools Successful?
Authors: Takeshi Chusho
Venue: IEEE Software (1993)

The author discusses ways to successfully move software technology forward. He relates his experiences in the field of software engineering to illustrate what he believes to be the problems of technology transfer and the requirements for successful technology transfer.
Virtual Windows: Linking User Tasks, Data Models, and Interface Design
Authors: Soren Lauesen, Morten Borup Harning
Venue: IEEE Software (2001)

Should you design user interfaces by giving an overview of data in the system or showing only the necessary data for each task step? Neither ensures efficient task support or ease of understanding, so the authors show an approach that balances both and allows early user validation.
Cost-Effective Parallel Computing
Authors: David A. Wood, Mark D. Hill
Venue: Computer (1995)

Large memories can make parallel computing cost-effective even with modest speedups.