ppxscal/embedding_network huggingface dataset:
Exploring Embedded-Systems Architectures with Artemis
Authors: Andy D. Pimentel, Louis O. Hertzberger, Paul Lieverse, Pieter van der Wolf, Ed F. Deprettere
Venue: Computer (2001)

Because embedded systems mostly target mass production and often run on batteries, they should be cheap to realize and power efficient. In addition, they require a high degree of programmability to provide real-time performance for multiple applications and standards. However, performance requirements as well as cost and power-consumption constraints demand that substantial parts of these systems be implemented in dedicated hardware blocks. As a result, their heterogeneous system architecture consists of components ranging from fully programmable processor cores to fully dedicated hardware components for timecritical application tasks. Increasingly, these designs yield heterogeneous embedded multiprocessor systems that reside together on a single chip. The heterogeneity of these highly programmable systems and the varying demands of their target applications greatly complicate system design. The increasing complexity of embedded- system architectures makes predicting performance behavior more difficult. Therefore, having the appropriate tools to explore different choices at an early design stage is increasingly important. The Artemis modeling and simulation environment aims to efficiently explore the design space of heterogeneous embedded-systems architectures at multiple abstraction levels and for a wide range of applications targeting these architectures. The authors describe their application of this methodology in two studies that showed promising results, providing useful feedback on a wide range of design decisions involving the architectures for the two applications.
Designing in Power-Down Test Circuits
Authors: Paul S. Levy
Venue: IEEE Design Test (1991)

Built-in self-test circuitry that is active only during testing is described. The benefit of these types of circuits is that defects that are not uncovered within the test circuitry will not contribute to failures in the host's ICs. Thus, the overall reliability of the IC in its targeted application should increase. Also, since the test circuitry is inactive, there will be less overall power consumption. Layout issues, simulation models, and interface/isolation considerations are discussed. Some general design guidelines are given.
Optimization of Rule-Based Systems Using State Space Graphs
Authors: Blaz Zupan, Albert Mo Kim Cheng
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

Embedded rule-based expert systems must satisfy stringent timing constraints when applied to real-time environments. The paper describes a novel approach to reduce the response time of rule-based expert systems. Our optimization method is based on a construction of the reduced cycle-free finite state space graph. In contrast with traditional state space graph derivation, our optimization algorithm starts from the final states (fixed points) and gradually expands the state space graph until all of the states with a reachable fixed point are found. The new and optimized system is then synthesized from the constructed state space graph. We present several algorithms implementing the optimization method. They vary in complexity as well as in the usage of concurrency and state-equivalency¿both targeted toward minimizing the size of the optimized state space graph. Though depending on the algorithm used, optimized rule-based systems: 1) in general have better response time in that they require fewer rule firings to reach the fixed point; 2) are stable, i.e., have no cycles that would result in the instability of execution; and 3) have no redundant rules. We also address the issue of deterministic execution and propose optimization algorithms that generate the rule-bases with single corresponding fixed points for every initial state. The synthesis method also determines the tight response time bound of the new system and can identify unstable states in the original rule-base. No information other than the rule-based real-time decision program itself is given to the optimization method. The optimized system is guaranteed to compute correct results independent of the scheduling strategy and execution environment.
Using Laser Defect Avoidance to Build Large-Area FPGAs
Authors: Glenn H. Chapman, Benoit Dufort
Venue: IEEE Design Test (1998)

Chip defect densities set the complexity limits of FPGAs. However, wafer-scale techniques expand this with defect avoidance routing around flawed blocks to build working systems. FPGAs have the features required for successful defect avoidance systems: repeatable cells, built-in switchable flexible routing, and potentially large number of applications. Laser-formed connections/cuts switches are effective in bypassing fabrication time defects in cell power, clocks, and signal buses, thus creating defect-free large working systems. Experiments on test FPGAs show laser defect avoidance routing signal delays 50% those of active switches. Thus laser defect avoidance after fabrication eliminates errors creating large-area FPGAs whose defective cell distribution is nearly unseen by the user.
A Safe, Accurate Intravenous Infusion Control System
Authors: Edna Barros, Marcus V. D. dos Santos
Venue: IEEE Micro (1998)

The main goal of this work is the development of a fault-tolerant intravenous infusion control system. The system was implemented in hardware and software and the hardware/software partitioning was done by using a co-design methodology developed in our research group. The main criteria considered during the hardware/software partitioning were performance, hardware area and software fault-tolerance. The software was implemented into a microprocessor and the hardware was prototyped by using FPGA's.
A Characterization of Binary Decision Diagrams
Authors: S. Chakravarty
Venue: IEEE Transactions on Computers (1993)

Binary decision diagrams (BDDs) are a representation of Boolean functions. Its use in the synthesis, simulation, and testing of Boolean circuits has been proposed by various researchers. In all these applications of BDDs solutions to some fundamental computational problems are needed. A characterization of BDDs in terms of the complexity of these computational problems is presented. A tighter bound on the size of an ordered BDD that can be computed from a given Boolean circuit is presented. On the basis of the results, a case is made for exploring the use of repeated BDDs, with a small number of repeated variables, and free BDDs for some applications for which only ordered BDDs have been used so far.
Effects of global interconnect optimizations on performance estimation of deep submicron design
Authors: Yu Cao, Chenming Hu, Xuejue Huang, Andrew B. Kahng, Sudhakar Muddu, Dirk Stroobandt, Dennis Sylvester
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

In this paper, we quantify the impact of global interconnect optimization techniques that address such design objectives as delay, peak noise, delay uncertainty due to noise, power, and cost. In doing so, we develop a new system-performance simulation model as a set of studies within the MARCO GSRC Technology Extrapolation (GTX) system. We model a typical point-to-point global interconnect and focus on accurate assessment of both circuit and design technology with respect to such issues as inductance, signal line shielding, dynamic delay, buffer placement uncertainty and repeater staggering. We demonstrate, for example, that optimal wire sizing models need to consider inductive effects -- and that use of more accurate {-1,3} worst-case capacitive coupling noise switch factors substantially increases peak noise estimates compared to traditional {0,2} bounds. We also find that optimal repeater sizes are significantly smaller than conventional models would suggest, especially when considering energy-delay issues.
Diary of a Y2K Consultant: Bracing for the Millennium
Venue: Computer (1999)

In less than 12 months, New Year's Day will put the Y2K-compliance efforts of organizations large and small to the ultimate test on an international scale. As that date nears, awareness of the Y2K Problem's potential for disrupting travel, basic services, and even entire economies has begun spreading to the general public. News programs feature regular reports from self-proclaimed Millennium Bug experts, consultants eager for publicity utter dire warnings of a computer-generated apocalypse, and stand-up comics even work Y2K into their routines. As the year 2000 nears, we seek one high-profile technology consultant's unique perspective on the consequences, compliance efforts, legends, and hype that surround the Y2K Problem. This year, Computer will offer a Y2K consultant's diary, highlighting the experiences of Howard Rubin, a member of our Editorial Board. A tenured full professor, Rubin chairs the Department of Computer Science at the City University of New York's Hunter College. CEO of Rubin Systems Inc. and a noted Y2K consultant, he provides such counsel to the US President, Vice President, and Senate, and will also provide it to Computer's readers over the next 12 months.
From symptom to cause: localizing errors in counterexample traces
Authors: Thomas Ball, Mayur Naik, Sriram K. Rajamani
Venue: ACM SIGPLAN Notices (2003)

There is significant room for improving users' experiences with model checking tools. An error trace produced by a model checker can be lengthy and is indicative of a symptom of an error. As a result, users can spend considerable time examining an error trace in order to understand the cause of the error. Moreover, even state-of-the-art model checkers provide an experience akin to that provided by parsers before syntactic error recovery was invented: they report a single error trace per run. The user has to fix the error and run the model checker again to find more error traces.We present an algorithm that exploits the existence of correct traces in order to localize the error cause in an error trace, report a single error trace per error cause, and generate multiple error traces having independent causes. We have implemented this algorithm in the context of slam, a software model checker that automatically verifies temporal safety properties of C programs, and report on our experience using it to find and localize errors in device drivers. The algorithm typically narrows the location of a cause down to a few lines, even in traces consisting of hundreds of statements.
Fuzzy tolerance relations and relational maps applied to information retrieval
Authors: László T. Kóczy, Tamás D. Gedeon, Judit A. Kóczy
Venue: Fuzzy Sets and Systems (2002)

One of the major problems in automatic indexing and retrieval of documents is that usually it cannot be guaranteed that the user queries include (all) of the actual words that occur in the documents that should be retrieved. Also it often happens that words with several meanings occur in a document, but in a rather different context from that expected by the querying person. In order to achieve better recall and higher precision, fuzzy tolerance and similarity relations have been introduced based on the counted or estimated values of (hierarchical) co-occurrence frequencies. This study addresses the problem of how these relations can be generated from the occurrence frequencies, especially as these are based on possibilistic rather than probabilistic measures, and also how the relations can be implemented by fuzzy relevance matrices.
Cellular Processing Tools for High-Performance Simulation
Authors: Domenico Talia
Venue: Computer (2000)

Recently, computational simulation has become a third approach along with theory and laboratory simulation to studying and solving scientific problems. In this approach, a computer equipped with problem solving software tools may represent a virtual laboratory in which researchers can build a model for a given problem and run it under varying conditions. These increasingly complex computational methodologies require sophisticated models and techniques, and vice versa. The authors explain how developing and validating complex models will increasingly depend on significant advances in experimental and testing techniques. High performance parallel computers gave researchers the ability to implement inherently parallel techniques such as cellular automata (CA), neural networks, and genetic algorithms significant new mathematical models for describing complex scientific phenomena. This article explains how cellular automata offer a powerful modeling approach for complex systems in which global behavior arises from the collective effect of many locally interacting, simple components.
Soapbox
Authors: Terry Bollinger
Venue: IEEE Software (1995)

Welcome to Soapbox, a forum for readers to talk to each other about the issues they face everyday. We accept contributions of any length and in many languages. See the ad on p. 80 about how to participate.Our first contribution warns of the unavoidable side-effects of using metrics, especially in the production of an intangible product such as software. If managers overemphasize particular metrics, bogus metrics will soon appear. To detect them, I suggest managers view facts from many perspectives. For example, if productivity metrics are intentionally faked, this will become obvious when you examine the cost per line of code and the hourly cost.¿ Tomoo Matsubara
Comments on "An O(n/sup 2.5/) Fault Identification Algorithm for Diagnosable Systems
Authors: V. Tz. Radoytchevsky, A. Ja. . Shalaev
Venue: IEEE Transactions on Computers (1994)

For original paper see A.T. Dahbura and G.M. Masson, "An O(n/sup 2.5/) fault identification algorithm for diagnosable systems," IEEE Trans. Comput., vol. C-33, pp. 486-492, Jun. 1984. Dahbura and Masson suggested an alternative version of Hakimi-Amin's theorem about the necessary and sufficient conditions for the system, described by PMC model (1967), to be t/sub p/-diagnosable. The authors found systems with connection assignment that satisfy conditions of Dahbura-Masson's theorem but are not t/sub p/-diagnosable. In this correspondence they state the additional condition under which Dahbura-Masson's theorem will hold.
The Koala Component Model for Consumer Electronics Software
Authors: Rob van Ommering, Frank van der Linden, Jeff Kramer, Jeff Magee
Venue: Computer (2000)

Most consumer electronics today contain embedded software. In the early days, developing CE software presented relatively minor challenges, but in the past several years three significant problems have arisen: size and complexity of the software in individual products; the increasing diversity of products and their software; and the need for decreased development time.The question of handling diversity and complexity in embedded software at an increasing production speed becomes an urgent one. The authors present their belief that the answer lies not in hiring more software engineers. They are not readily available, and even if they were, experience shows that larger projects induce larger lead times and often result in greater complexity. Instead, they believe that the answer lies in the use and reuse of software components that work within an explicit software architecture.The Koala model, a component-oriented approach detailed in this article, is their way of handling the diversity of software in consumer electronics. Used for embedded software in TV sets, it allows late binding of reusable components with no additional overhead.
Real-Time Visual Tracking of Complex Structures
Authors: Tom Drummond, Roberto Cipolla
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

This paper presents a novel framework for three-dimensional model-based tracking. Graphical rendering technology is combined with constrained active contour tracking to create a robust wire-frame tracking system. It operates in real time at video frame rate (25 Hz) on standard hardware. It is based on an internal CAD model of the object to be tracked which is rendered using a binary space partition tree to perform hidden line removal. The visible edge features are thus identified online at each frame and correspondences are found in the video feed. A Lie group formalism is used to cast the motion computation problem into simple geometric terms so that tracking becomes a simple optimization problem solved by means of iterative reweighted least squares. A visual servoing system constructed using this framework is presented together with results showing the accuracy of the tracker. The system also incorporates real-time online calibration of internal camera parameters. The paper then describes how this tracking system has been extended to provide a general framework for tracking in complex configurations, including the use of multiple cameras, the tracking of structures with articulated components, or of multiple structures with constraints. The methodology used to achieve this exploits the simple geometric nature of the Lie group formalism which renders the constraints linear and homogeneous. The adjoint representation of the group is used to transform measurements into common coordinate frames. The constraints are then imposed by means of Lagrange multipliers. Results from a number of experiments performed using this framework are presented and discussed.
Protecting Respondents' Identities in Microdata Release
Authors: P. Samarati
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Today's globally networked society places great demand on the dissemination and sharing of information. While in the past released information was mostly in tabular and statistical form, many situations call today for the release of specific data (microdata). In order to protect the anonymity of the entities (called respondents) to which information refers, data holders often remove or encrypt explicit identifiers such as names, addresses, and phone numbers. Deidentifying data, however, provides no guarantee of anonymity. Released information often contains other data, such as race, birth date, sex, and ZIP code, that can be linked to publicly available information to reidentify respondents and inferring information that was not intended for disclosure. In this paper we address the problem of releasing microdata while safeguarding the anonymity of the respondents to which the data refer. The approach is based on the definition of k-anonymity. A table provides k-anonymity if attempts to link explicitly identifying information to its content map the information to at least k entities. We illustrate how k-anonymity can be provided without compromising the integrity (or truthfulness) of the information released by using generalization and suppression techniques. We introduce the concept of minimal generalization that captures the property of the release process not to distort the data more than needed to achieve k-anonymity, and present an algorithm for the computation of such a generalization. We also discuss possible preference policies to choose among different minimal generalizations.
New Combinatorial Bounds for Authentication Codes and KeyPredistribution Schemes
Authors: Kaoru Kurosawa, Koji Okada, Hajime Saido, Douglas R. Stinson
Venue: Designs, Codes and Cryptography (1998)

This paper provides new combinatorial bounds and characterizations of authentication codes (A-codes) and key predistribution schemes (KPS). We first prove a new lower bound on the number of keys in an A-code without secrecy, which can be thought of as a generalization of the classical Rao bound for orthogonal arrays. We also prove a new lower bound on the number of keys in a general A-code, which is based on the Petrenjuk, Ray-Chaudhuri and Wilson bound for t-designs. We also present new lower bounds on the size of keys and the amount of users&lsquo; secret information in KPS, the latter of which is accomplished by showing that a certain A-code is &rsquo;&rsquo;hiding&lsquo;&lsquo; inside any KPS.
Weighted domination in triangle-free graphs
Authors: Peter Dankelmann, Dieter Rautenbach, Lutz Volkmann
Venue: Discrete Mathematics (2002)

A weighted graph (G,w) is a graph G together with a positive weight-function on its vertex set w: V(G) → R>0. The weighted domination number γw(G) of (G,w) is the minimum weight w(D) = Συ∈D w(υ) of a set D ⊆ V(G) such that every vertex x ∈ V(D) - D has a neighbor in D. If Συ∈V(G) w(υ)= |V(G)|, then we speak of a normed weighted graph. Recently, we proved that γw(G)γw(G) ≤ n2 (1 + 2/n-2) and γw(G) + γw(G) ≤ 3n/4 + n/2(n-2) for normed weighted bipartite graphs (G, w) of order n such that neither G nor the complement G has isolated vertices. In this paper we will extend these Nordhaus-Gaddum-type results to triangle-free graphs.
Guest Editor's Introduction: The RAD Fad" Is Timing Really Everything?
Authors: David N. Card
Venue: IEEE Software (1995)

In our haste to speed development, we should consider if we are sprinting in the right direction. Is faster time-to-market equally important to every developer? Does a faster cycle time necessarily guarantee success? And how does the answer change from one year to the next?
Scale Space Hierarchy
Authors: Arjan Kuijper, Luc M. J. Florack, Max A. Viergever
Venue: Journal of Mathematical Imaging and Vision (2003)

We investigate the deep structure of a scale space image. We concentrate on scale space critical points&mdash;points with vanishing gradient with respect to both spatial and scale direction. We show that these points are always saddle points. They turn out to be extremely useful, since the iso-intensity manifolds through these points provide a scale space hierarchy tree and induce a &ldquo;pre-segmentation&rdquo;: a segmentation without a priori knowledge. Furthermore, both these scale space saddles and the so-called catastrophe points form the critical points of the parameterised critical curves&mdash;the curves along which the spatial critical points move in scale space. This enables one to localise these two types of special points relatively easy and automatically. Experimental results concerning the hierarchical representation and pre-segmentation are given and show results that correspond to a fair degree to both the mathematical and the intuitive forecast.
The Integration of Image Segmentation Maps using Region and Edge Information
Authors: C. C. Chu, J. K. Aggarwal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

We present an algorithm that integrates multiple region segmentation maps and edge maps. It operates independently of image sources and specific region-segmentation or edge-detection techniques. User-specified weights and the arbitrary mixing of region/edge maps are allowed. The integration algorithm enables multiple edge detection/region segmentation modules to work in parallel as front ends. The solution procedure consists of three steps. A maximum likelihood estimator provides initial solutions to the positions of edge pixels from various inputs. An iterative procedure using only local information (without edge tracing) then minimizes the contour curvature. Finally, regions are merged to guarantee that each region is large and compact. The channel-resolution width controls the spatial scope of the initial estimation and contour smoothing to facilitate multiscale processing. Experimental results are demonstrated using data from different types of sensors and processing techniques. The results show an improvement over individual inputs and a strong resemblance to human-generated segmentation.