ppxscal/embedding_network huggingface dataset:
Reducing Test Power, Time and Data Volume in SoC Testing Using Selective Trigger Scan Architecture
Authors: Shervin Sharifi, Mohammad Hosseinabadi, Pedram Riahi, Zainalabedin Navabi
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Time, power and data volume are among the most challenging problems in test of System-on-Chip (SoC) devices. These problems become even more important in scan-based test. TheSelective Trigger Scan architecture introduced in this paper addresses these problems. Thisarchitecture reduces switching activity in circuit-under-test (CUT) and increases the scan clock frequency. Format of data for this reduced activity architecture enables us to perform a good compression and further reduce the test time. Our experiments on ISCAS 85 and 89 benchmark circuits show effectiveness of this architecture in improving SoC test in terms of power, time and data volume.
A Method of Implementing UML Virtual Machines With Some Constraints Based on Abstract State Machines
Authors: Wuwei Shen, Kevin Compton, James Huggins
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

UML has become a standard language for designingsoftware systems. To help software developers design acorrect UML model for a software system has become animportant goal for many UML CASE tools. In this paper,we propose a new UML virtual machine based on AbstractState Machines. We combine the UML meta-model, UMLmodel and user objects model into one under the ASM virtualmachine for UML. Since the ASM virtual machine forUML supports OCL, software developers can precisely designa software model and then find some errors such asinconsistency in the model with the help of the ASM virtualmachine.
A Gr&ouml;tzsch-Type Theorem for List Colourings with Impropriety One
Authors: R. &SCARON;krekovski
Venue: Combinatorics, Probability and Computing (1999)

A graph G is m-choosable with impropriety d, or simply (m, d)&#x002A;-choosable, if, for every list assignment L, where &#x2223;L(v)&#x2223;&ge;m for every v&isin;V(G), there exists an L-colouring of G such that each vertex of G has at most d neighbours coloured with the same colour as itself. We prove a Gr&ouml;tzsch-type theorem for list colourings with impropriety one, that is, the (3, 1)&#x002A;-choosability for triangle-free planar graphs; in the proof the method of extending a precolouring of a 4- or 5-cycle is used.
Image texture classification using datagrams and characteristic views
Authors: Shisong Yang, Chih-Cheng Hung
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper addresses the problem of image texture classification. A novel texture feature called "characteristic view", which is directly extracted from a kernel corresponding to each texture class, was developed. The K-views template method was used to classify the texture pixels based on these features. The characteristic view concept is based on the assumption that an image taken from the nature scenes, a specific texture class in this image will frequently reveal the repetitions of some certain patterns of features. Different "views" can be obtained as features from different spatial locations. The datagram concept is developed in this paper. Experimental results using datagrams are provided.
Software evolution: background, theory, practice
Authors: Meir M. Lehman, Juan F. Ramil
Venue: Information Processing Letters (2003)

This paper opens with a brief summary of some 30 years of study of the software evolution phenomenon. The results of those studies include the SPE program classification, a principle of software uncertainty and laws of E-type software evolution. The laws were termed so because they encapsulate phenomena largely independent of the people, the organisations and the domains involved in the evolution of the E-type systems studied. Recent studies have refined earlier conclusions, yielded practical guidelines for software evolution management and provide a basis for the formation of a theory of software evolution. Given the volume of published material and the extent of recent discussions on the topic (see, e.g., [Proc. ICSM, Montreal, 2002, p. 66]), this paper is restricted to an overview that exposes the significance of the evolution phenomenon and its study to the wider community, providing a basis for the future and, in particular, development of a theory of software evolution.
Self-Affine Carpets on the Square Lattice
Authors: Irene Hueter, Yuval Peres
Venue: Combinatorics, Probability and Computing (1997)

We explore the &lsquo;Hausdorff dimension at infinity&rsquo; for self-affine carpets defined on the square lattice. This notion of dimension (due to Barlow and Taylor), which is the correct notion from a probabilistic perspective, differs for these sets from more &lsquo;naive&rsquo; indices of fractal dimension.
Coloring of Double Disk Graphs
Authors: Hongwei Du, Xiaohua Jia, Deying Li, Weili Wu
Venue: Journal of Global Optimization (2004)

We study the problem of minimizing the number of colors for vertex-coloring of double disk graphs and in this note, show a polynomial-time 31-approximation for the problem, which improves an existing result.
The HyperHotel Application Built over D.I.C.E. and Co.In.S.
Authors: Peter Triantafillou, Nikos Ntarmos, John Yannakopoulos
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Content integration of web data sources is becoming increasingly important for the next generation information systems. However, all proposed solutions are faced with the same performance bottleneck: the network overhead incurred when contacting the integrated e-sites. With this demo paper we shall demonstrate the functionality of HyperHotel. HyperHotel is used for finding appropriate hotel rooms when travelling. Its novetlies are that it is designedand implemented as an internet web-hotel content integration application and that it is built on top of D.I.C.E. and Co.In.S.; a novel content integration infrastructure consisting of a domain-independent COntent INtegration System and its Data Integration Cache Engine. We'll show how the infrastructure of D.I.C.E. and Co.In.S. can be applied and exploited in HyperHotel in order to improve the response time of complex user queries. This exemplifies the significance of this infrastructure since HyperHotel is representative of a large class of e-commerce, content integration applications.
DVD authoring
Authors: Ian Pointer
Venue: Linux Journal (2003)

Got ideas for TV-based information design, games and Easter eggs? Make them work on DVDs you create with this versatile software. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
PEST: a tool for implementing pseudo-exhaustive self test
Authors: Eleanor Wu, Paul W. Rutkowski
Venue: Proceedings of the conference on European design automation (1990)

PEST is a CAD tool for implementing pseudo-exhaustive self test in integrated circuits. PEST's unique features are: 1. Parallel testing of all cones, 2. Global test point selection, and 3. A new cost effective scheme for test vector generation. AT&T's Network Interface Controller chip was designed using PEST. Effective 100% fault coverage without fault simulation or test generation was obtained with less than 24% transistor overhead. This paper begins with an overview of PEST's approach. The test generation algorithm is then described. Finally, the implementation of PEST in the Network Interface Controller is presented.
On joint probability density functions of discrete time iterative processes
Authors: G. S. Ladde, Bonita A. Lawrence
Venue: Mathematics and Computers in Simulation (2003)

In this work, we develop an algorithm for determining the marginal probability density function of the solution processes of a nonlinear non-stationary discrete time iterative process with random parameters. The results include the case of degenerate random initial states. As a by-product of our study, the special case when the initial state is non-degenerate is addressed.
Equivalence of the 1-Rate Model to the Classical Model on Strictly Nonblocking Switching Networks
Authors: W. R. Chen, F. K. Hwang, Xuding Zhu
Venue: SIAM Journal on Discrete Mathematics (2004)

In the 1-rate(f) network, each link can carry up to f messages for some integer f. The classical model is the special case when f=1. We show that a network is strictly nonblocking under the 1-rate(f) model if and only if it is strictly nonblocking under the classical model.
PoliS: a programming model for multiple tuple spaces
Authors: Paolo Ciancarini
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

The class of parallel models and languages based on a shared associative data structure has recently aroused large interest. Among these languages, Linda is certainly well known. In this paper we define PoliS, a model of coordination based on the concept of Multiple Tuple Spaces, a generalization of the Linda approach to parallel programming. The model introduces a programming method in which both space and time of computations can be specified and programmed, aiming at controlling coordination of distributed entities. We discuss a parallel programming language based on this model and, as a meaningful application, the design of a programming environment based on PoliS.
Bridging models across the software lifecycle
Authors: Nenad Medvidovic, Paul Grünbacher, Alexander Egyed, Barry W. Boehm
Venue: Journal of Systems and Software (2003)

Numerous notations, methodologies, and tools exist to support software system modeling. While individual models help to clarify certain system aspects, the large number and heterogeneity of models may ultimately hamper the ability of stakeholders to communicate about a system. A major reason for this is the discontinuity of information across different models. In this paper, we present an approach for dealing with that discontinuity. We introduce a set of "connectors" to bridge models, both within and across the "upstream" activities in the software development lifecycle (specifically, requirements, architecture, and design). While the details of these connectors are dependent upon the source and destination models, they share a number of underlying characteristics. These characteristics can be used as a starting point in providing a general understanding of software model connectors. We illustrate our approach by applying it to a system we have designed and implemented in collaboration with a third-party organization.
Robust Stable Fuzzy Control via Fuzzy Modeling and Feedback Linearization with Its Applications to Controlling Uncertain Single-link Flexible Joint Manipulators
Authors: Chang-Woo Park
Venue: Journal of Intelligent and Robotic Systems (2004)

In this paper, a robust stable fuzzy control design based on feedback linearization is presented. Takagi&ndash;Sugeno fuzzy model is used as representing the nonlinear plant model and uncertainty is assumed to be included in the model structure with known bounds. For this structured uncertainty, the closed system can be analyzed by applying the perturbation system stability analysis to the fuzzy feedback linearization systems and a sufficient condition is derived to guarantee the stability of the closed-loop system with bounded parameter uncertainties. Based on the developed analysis method, we can design a robust fuzzy controller by choosing the control parameters satisfying the robust stability condition.
Information Technology Investment and Firm Performance: A Meta-Analysis
Authors: JeeHae Lim, Vernon J. Richardson, Tom L. Roberts
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

In the recent past, researchers have shown conflicting results regarding the returns to IT investment. Some researchers posit that the equivocal results of IT investment are due to inconsistent measurement of firm performance following IT investment. We propose to use meta-analysis to summarize and synthesize the patterns of relatively consistent relations from empirical studies of IT investment returns during the last decade.
Static analysis of parameterized loop nests for energy efficient use of data caches
Authors: Paolo D'Alberto, Alexandru Nicolau, Alexander Veidenbaum, Rajesh Gupta
Venue: Compilers and operating systems for low power (2003)

Caches are an important part of architectural and compiler low-power strategies by reducing memory accesses and energy per access. In this chapter, we examine efficient utilization of data caches for low power in an adaptive memory hierarchy. We focus on the optimization of data reuse through the static analysis of line size adaptivity. We present an approach that enables the quantification of data misses with respect to cache line size at compile-time. This analysis is implemented in a software package STAMINA. Experimental results demonstrate effectiveness and accuracy of the analytical results compared to alternative simulation based methods.
An active hypertext model for system requirements
Authors: Colin Potts, Kenji Takahashi
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

We are developing tools to support a conversational metaphor for requirements definition and analysis. Our conversational model consists of three components: (1) a hypertextual representation of requirements and their interrelations, (2) an issue-based speech act model, and (3) a typology of changes. These components act together in a model we call the Inquiry Cycle. We discuss requirements analysis activities supported by the conversational model, including information retrieval and navigation, rationale management, and agenda management. We have implemented a prototype active hypertext system, and we have applied our model and implementation to the requirements for an ATM banking system, an example we use in the paper for illustration.
A new algorithm for online structure and parameter adaptation of RBF networks
Authors: Alex Alexandridis, Haralambos Sarimveis, George Bafas
Venue: Neural Networks (2003)

This paper deals with the problem of online adaptation of radial basis function (RBF) neural networks. A new adaptive training method is presented, which is able to modify both the structure of the network (the number of nodes in the hidden layer) and the output weights, as the algorithm proceeds. These adaptation capabilities make the algorithm suitable for modeling dynamical time varying systems, where not only the dynamics but also the operating region changes with time. Therefore, the important issue of extrapolation is faced successfully, but at the same time the algorithm takes care of the size of the network, by deleting the hidden node centers that remain inactive for a long time. The selection of the network centers is based on a fuzzy partition of the input space, which defines a number of fuzzy subspaces. The algorithm considers the centers of the fuzzy subspaces as candidates for becoming hidden node centers and makes the selections, so that at least one center is close enough to each input example. The proposed technique is illustrated through the application to time varying dynamical systems and is compared to other adaptive training methods.
Visual formalisms for configuration management
Authors: Michael W. Godfrey
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

As reuse of software components becomes more commonplace, being able to understand, manipulate and reason about software system architectures acquires new importance. Although commercial software development environments have addressed many of the issues of configuration management, there is still a need for visual formalisms that can aid in representing and manipulating architectures of software systems. This paper introduces ConForm (Configuration Formalism), a graphical notation for representing configurations of software systems. Several of the basic concepts of ConForm were inspired by the C/Mesa language [8]; however, ConForm is both language and tool independent. ConForm is notable because it is both a visual and a formal approach to representing software architectures.
Design, evaluation measurements and CFD modeling of a small swirl stabilised laboratory burner
Authors: N. Orfanoudakis, A. Hatziapostolou, E. Mastorakos, E. Sardi, K. Krallis, N. Vlachakis, S. Mavromatis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

An important way of understanding flame processes is to scale-up the measurements' results of tests on small burners to larger ones. Ideally, the result of a burner and flame scaling would be the complete similarity of all the combustion processes (turbulent transport and mixing, heat generation, heat transfer) in the scale down domain. In reality however, that is not possible, as all the physical and chemical processes will not scale down in the same way. Extensive work on volatile evolution and ignition and their scale up to larger burners, has been reported in the past, where non-dimensional numbers have been used to scale up results measured in small scale burners as for example the En number (for ignition process) and Fl number (for devolatilisation process). There are mainly two practical criteria for the scaling of burners, namely constant velocity (CV) and constant residence or mixing time (CRT) scaling. Both scaling criteria rely on the scaling of the large macro-scale turbulent mixing process. In the constant velocity scaling case air velocities and fuel particle velocities are maintained constant with scale reduction. Swirling flows are used as means of controlling flames in combustion chambers and have also found application in various types of burners in order to achieve the desired ignition and burnout characteristics for a given fuel.
Parallel implementation of geometric shortest path algorithms
Authors: Mark Lanthier, Doron Nussbaum, Jörg-Rüdiger Sack
Venue: Parallel Computing (2003)

In application areas such as geographical information systems, the Euclidean metric is often less meaningfully applied to determine a shortest path than metrics which capture, through weights, the varying nature of the terrain (e.g., water, rock, forest). Considering weighted metrics, however, increases the run-time of algorithms considerably suggesting the use of a parallel approach. In this paper, we provide a parallel implementation of shortest path algorithms for the Euclidean and weighted metrics on triangular irregular networks (i.e., a triangulated point set in which each point has an associated height value). To the best of our knowledge, this is the first parallel implementation of shortest path problems in these metrics. We provide a detailed discussion of the algorithmic issues and the factors related to data, machine, implementation which determine the performance of parallel shortest path algorithms. We describe our parallel algorithm for weighted shortest paths, its implementation and performance for single-and multiple-source instances. Our experiments were performed on standard architectures with different communication/computation characteristics, including PCs interconnected by a cross-bar switch using fast ethernet, a state-of-the-art Beowulf cluster with gigabit interconnect and a shared-memory architecture, SunFire.
On Identifying Codes in the Triangular and Square Grids
Authors: Iiro Honkala, Tero Laihonen
Venue: SIAM Journal on Computing (2004)

It is shown that in the infinite square grid the density of every $(r, \leq 2)$-identifying code is at least 1/8 and that there exists a sequence $C_r$ of $(r, \leq 2)$-identifying codes such that the density of Cr tends to 1/8 when $r \rightarrow \infty$. In the infinite triangular grid a sequence $C'_r$ of $(r, \leq 2)$-identifying codes is given such that the density of $C'_r$ tends to 0 when $r \rightarrow \infty$.
Fully testable PLA design with minimal extra input
Authors: Che W. Chiou, Ted. C. Yang
Venue: Proceedings of the conference on European design automation (1990)

Due to its popular application in the design of LSI/VLSI circuits, testable PLAs have become an important topic. Bozorgui-Nesbat and McCluskey [10] offered a lowoverhead method which adds extra inputs rather than shift registers to design a fully testable PLA. However, to design such a PLA with a minimal number of extra inputs is an NP complete problem [10]. In this study, a rule to modify an arbitrary irredundant PLA which needs fewer extra inputs than other existing methods [10, 11, 12, 14] to make the modified PLA fully testable is presented. It covers multiple stuck-at faults, multiple extra devices, and multiple missing devices, except multiple redundant extra devices in the OR plane of a PLA. In addition, the aforementioned problem is shown no longer NP complete for the modified PLA.
On Medians of Lattice Distributions and a Game with Two Dice
Authors: Charles M. Grinstead
Venue: Combinatorics, Probability and Computing (1997)

Let D1 and D2 be two dice with k and l integer faces, respectively, where k and l are two positive integers. The game Gn consists of tossing each die n times and summing the resulting faces. The die with the higher total wins the game. We examine the question of which die wins game Gn more often, for large values of n. We also give an example of a set of three dice which is non-transitive in game Gn for infinitely many values of n.
Switch-level delay test
Authors: Melvin A. Breuer, Sandeep K. Gupta
Venue:  (2002)

This dissertation presents a switch-level delay test methodology to generate high quality delay tests for CMOS circuits containing complex gates and domino logic circuits. First we address static CMOS circuits containing complex gates. We demonstrate that using a primitive gate model of a circuit for delay test generation can yield tests that fail to excite critical delays of the circuit. We propose focusing on switch-level structures, called targets, to test for delay defects in circuits. We define a high quality delay test, called &tau;-robust test, that detects delay inducing defects on a target, independent of circuit delays. The completeness of our test methodology with &tau;-robust tests is proved. Since a &tau;-robust test may not exist for many targets in a circuit, we further define other delay tests with weaker guarantees of delay defect detection. Simulation experiments demonstrate that a test set constructed based on our methodology performs significantly better, in terms of coverage of targets for delay defects and critical delay excitation, than a test set constructed based on classical methodology. Our methodology is extended to domino logic circuits. We demonstrate that tests obtained with classical approaches can fail to detect certain delay defects. We identify switch-level structures in the evaluate logic circuitry and precharge logic circuitry, called E targets and P targets, respectively, and define high quality delay tests to detect delay defects on them. We identify the testabilities of E targets and P targets in benchmark circuits with tests from our methodology. We also demonstrate that different domino logic circuits implementing the same function and having identical fanout structures can differ vastly in their testabilities, depending on the choice of an N domino gate or its structurally dual P domino gate for the individual gates in a circuit. Finally we discuss our preliminary investigations into two future research problems. We first address synthesis of highly delay testable circuits with static CMOS complex gates. We then discuss extension of our methodology to circuits with pass transistor logic gates.