ppxscal/embedding_network huggingface dataset:
Sequential Circuits with Combinational Test Generation Complexity under Single-Fault Assumption
Authors: Michiko Inoue, Emil Gizdarski, Hideo Fujiwara
Venue: Journal of Electronic Testing: Theory and Applications (2002)

We show that the test generation problem for all single stuck-at faults in sequential circuits with internally balanced structures can be reduced into the test generation problem for single stuck-at faults in combinational circuits. In our previous work, we introduced internally balanced structures as a class of sequential circuits with the combinational test generation complexity. However, single stuck-at faults on some primary inputs, called separable primary inputs, corresponded to multiple stuck-at faults in a transformed combinational circuit. In this paper, we resolve this problem. We show how to generate a test sequence and identify undetectability for single stuck-at faults on separable primary inputs.
Requirements and Psychology
Authors: Chris Rupp
Venue: IEEE Software (2002)

Fulfilling your customers' interests determines your market success, but how do you find these requirements effectively and efficiently? As simple as this question sounds, answering it in daily practice is difficult. Often, stake-holders are interviewed about their requirements or asked to write them down, but this approach rarely uncovers the real requirements that reflect a customer's true interests or needs. We need a way of getting information about the customers' core desires--conscious, unconscious, even subconscious. The hottest sellers are products that fulfill these desires.
A Hardware-Software Real-Time Operating System Framework for SoCs
Authors: Vincent J.Mooney III, Douglas M.Blough
Venue: IEEE Design Test (2002)

The delta framework for RTOS-SoC codesign helps designers simultaneously build a SoC or platform-ASIC architecture and a customized hardware-software RTOS. Examples generated by this prototype tool include RTOS designs that speed up applications by 27% or more, using a small amount of hardware area.
Addressing the timing closure problem by integrating logic optimization and placement
Authors: Wilsin Gosti, Sunil P. Khatri, Alberto L. Sangiovanni-Vincentelli
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Timing closure problems occur when timing estimates computed during logic synthesis do not match with timing estimates computed from the layout of the circuit. In such a situation, logic synthesis and layout synthesis are iterated until the estimates match. The number of such iterations is becoming larger as technology scales. Timing closure problems occur mainly due to the difficulty in accurately predicting interconnect delay during logic synthesis.In this paper, we present an algorithm that integrates logic synthesis and global placement to address the timing closure problem. We introduce technology independent algorithms as well as technology dependent algorithms. Our technology independent algorithms are based on the notion of "wire-planning". All these algorithms interleave their logic operations with local and incremental/full global placement, in order to maintain a consistent placement while the algorithm is run. We show that by integrating logic synthesis and placement, we avoid the need to predict interconnect delay during logic synthesis. We demonstrate that our scheme significantly enhances the predictability of wire delays, thereby solving the timing closure problem. This is the main result of our paper. Our results also show that our algorithms result in a significant reduction in total circuit delay. In addition, our technology independent algorithms result in a significant circuit area reduction.
Clustered Partial Linear Regression
Authors: Luis Torgo, Joaquim Pinto Da Costa
Venue: Machine Learning (2003)

This paper presents a new method that deals with a supervised learning task usually known as multiple regression. The main distinguishing feature of our technique is the use of a multistrategy approach to this learning task. We use a clustering method to form sub-sets of the training data before the actual regression modeling takes place. This pre-clustering stage creates several training sub-samples containing cases that are &ldquo;nearby&rdquo; to each other from the perspective of the multidimensional input space. Supervised learning within each of these sub-samples is easier and more accurate as our experiments show. We call the resulting method clustered partial linear regression. Predictions using these models are preceded by a cluster membership query for each test case. The cluster membership probability of a test case is used as a weight in an averaging process that calculates the final prediction. This averaging process involves the predictions of the regression models associated to the clusters for which the test case may belong. We have tested this general multistrategy approach using several regression techniques and we have observed significant accuracy gains in several data sets. We have also compared our method to bagging that also uses an averaging process to obtain predictions. This experiment showed that the two methods are significantly different. Finally, we present a comparison of our method with several state-of-the-art regression methods showing its competitiveness.
Developing a Generic Augmented-Reality Interface
Authors: Ivan Poupyrev, Desney S. Tan, Mark Billinghurst, Hirokazu Kato, Holger Regenbrecht, Nobuji Tetsutani
Venue: Computer (2002)

An augmented-reality interface dynamically superimposes interactive computer graphics images onto objects in the real world. Although researchers and developers have made great advances in display and tracking technologies, to date interaction with these environments has been largely limited to passive viewing or simple browsing of virtual information registered to the real world.The authors designed Tiles as a first step toward overcoming these limitations by allowing effective spatial composition, layout,and arrangement of digital objects in the physical environment. Tiles users can freely place interface elements anywhere they want: on tables or whiteboards, inboxes and folders, arranged in stacks, or grouped together. The interface configuration and layout of Tiles' elements emerges spontaneously as the result of users' workactivity and evolves together with it.
A System for Interpretation of Line Drawings
Authors: R. Katsuri, S. T. Bow, W. El-Masri, J. Shah, J. R. Gattiker, U. B. Mokate
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

A system for interpretation of images of paper-based line drawings is described. Since a typical drawing contains both text strings and graphics, an algorithm has been developed to locate and separate text strings of various font sizes, styles, and orientations. This is accomplished by applying the Hough transform to the centroids of connected components in the image. The graphics in the segmented image are processed to represent thin entities by their core-lines and thick objects by their boundaries. The core-lines and boundaries are segmented into straight line segments and curved lines. The line segments and their interconnections are analyzed to locate minimum redundancy loops which are adequate to generate a succinct description of the graphics. Such a description includes the location and attributes of simple polygonal shapes, circles, and interconnecting lines, and a description of the spatial relationships and occlusions among them. Hatching and filling patterns are also identified. The performance of the system is evaluated using several test images, and the results are presented. The superiority of these algorithms in generating meaningful interpretations of graphics, compared to conventional data compression schemes, is clear from these results.
Segregating information about the size and shape of the vocal tract using a time-domain auditory model: the stabilised wavelet-Mellin transform
Authors: Toshio Irino, Roy D. Patterson
Venue: Speech Communication (2002)

We hear vowels pronounced by men and women as approximately the same although the length of the vocal tract varies considerably from group to group. At the same time, we can identify the speaker group. This suggests that the auditory system can extract and separate information about the size of the vocal-tract from information about its shape. The duration of the impulse response of the vocal tract expands or contracts as the length of the vocal tract increases or decreases. There is a transform, the Mellin transform, that is immune to the effects of time dilation; it maps impulse responses that differ in temporal scale onto a single distribution and encodes the size information separately as a scalar constant. In this paper we investigate the use of the Mellin transform for vowel normalisation. In the auditory system, sounds are initially subjected to a form of wavelet analysis in the cochlea and then, in each frequency channel, the repeating patterns produced by periodic sounds appear to be stabilised by a form of time-interval calculation. The result is like a two-dimensional array of interval histograms and it is referred to as an auditory image. In this paper, we show that there is a two-dimensional form of the Mellin transform that can convert the auditory images of vowel sounds from vocal tracts with different sizes into an invariant Mellin image (MI) and, thereby, facilitate the extraction and separation of the size and shape information associated with a given vowel type. In signal processing terms, the MI of a sound is the Mellin transform of a stabilised wavelet transform of the sound. We suggest that the MI provides a good model of auditory vowel normalisation, and that this provides a good framework for auditory processing from cochlea to cortex.
The Emergence of Distributed Component Platforms
Authors: David Krieger, Richard M. Adler
Venue: Computer (1998)

In recent years, several vendors and consortia have independently developed standards that define the basic mechanics for building and interconnecting software components. Sun's JavaBeans has emerged as the leading rival to Microsoft's DCOM, supplanting the OpenDoc standard from the now defunct Component Integration Laboratories. Component software is moving from its original focus on desktop-bound compound documents to enterprise applications that include distributed server components. The backers of competing standards are racing to capture market leadership by delivering the tangible benefits of component standards via distributed component platformsýintegrated development and runtime environments that isolate much of the conceptual and technical complexity involved in building component-based applications. With DCPs, businesses can assign their few highly skilled programmers to component construction and use less sophisticated developers to carry out the simpler assembly tasks. By making component standards available to the broadest possible spectrum of developers, DCPs essentially drive those standards to market. This article reviews the state of component software as embodied in DCPs. The two DCP market leaders are Microsoft's DCOM (or ActiveX/DCOM) and Sun's JavaBeans. However, Internet and OMG component standards are emerging that will likely impact both the content and status of these two DCPs. The authors also discuss component frameworks, which extend DCPs to provide more complete application development solutions.
Efficient Data Mining for Path Traversal Patterns
Authors: Ming-Syan Chen, Jong Soo Park, Philip S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (1998)

In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects are linked together to facilitate interactive access. Our solution procedure consists of two steps. First, we derive an algorithm to convert the original sequence of log data into a set of maximal forward references. By doing so, we can filter out the effect of some backward references, which are mainly made for ease of traveling and concentrate on mining meaningful user access sequences. Second, we derive algorithms to determine the frequent traversal patterns¿i.e., large reference sequences¿from the maximal forward references obtained. Two algorithms are devised for determining large reference sequences; one is based on some hashing and pruning techniques, and the other is further improved with the option of determining large reference sequences in batch so as to reduce the number of database scans required. Performance of these two methods is comparatively analyzed. It is shown that the option of selective scan is very advantageous and can lead to prominent performance improvement. Sensitivity analysis on various parameters is conducted.
The expected complexity of Prim's minimum spanning tree algorithm
Authors: Chip Martel
Venue: Information Processing Letters (2002)

We study the expected performance of Prim's minimum spanning tree (MST) algorithm implemented using ordinary heaps. We show that this implementation runs in linear or almost linear expected time on a wide range of graphs. This helps to explain why Prim's algorithm often beats MST algorithms which have better worst-case run times.Specifically, we show that if we start with any n node m edge graph and randomly permute its edge weights, then Prim's algorithm runs in expected O(m + nlogn log(2m/n)) time. Note that O(m + nlogn log(2m/n)) = O(m) when m = Ω(n log n log log n).We extend this result to show that the same expected run times apply even when an adversary can select the weights of m/logn edges and the possible weights of the remaining edges (which are then randomly assigned).
A Development Environment for an Object Specification Language
Authors: Martin Gogolla, Stefan Conrad, Grit Denker, Rudolf Herzig, Nikolaos Vlachantonis
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Techniques for the development of reliable information systems on the basis of their formal specification are the main concern in our project. Our work focuses on the specification language TROLL light which allows to describe the part of the world to be modeled as a community of concurrently existing and communicating objects. Our specification language comes along with an integrated, open development environment. The task of this environment is to give support for the creation of correct information systems. Two important ingredients of the environment to be described here in more detail are the animator and the proof support system.
A PC-Based Digital Speech Spectrograph
Authors: L. Robert Morris
Venue: IEEE Micro (1988)

The author describes how a TMS32010-based Tl-speech PC board from Texas Instruments was combined with an off-the-shelf, PC graphics board to produce a real-time speech spectrograph system. The Realtime Spectral Lab (RSL) is a relatively inexpensive, PC-based, commercial-quality system. It produces high-quality spectrograms of up to 2 s of speech within 5 s of speech input. Also discussed are the algorithms chosen and the software structures evolved to implement the system. The resulting instrument is flexible. Dual spectrograms can show either simultaneous wideband and narrowband analyses of the same utterance, or equal frequency-resolution versions with differing time resolution. In addition, users can compare a target spectrogram to changing, real-time input. They can also mark a wideband spectrogram with cursors and expand the selected time segment into another, fine time-resolution spectrogram. The discussion is a case study of nontrivial DSP (digital signal processing) systems design and implementation by hardware selection and DSP programming alone.
Efficient compression and rendering of multi-resolution meshes
Authors: Zachi Karni, Alexander Bogomjakov, Craig Gotsman
Venue: Proceedings of the conference on Visualization '02 (2002)

We present a method to code the multiresolution structure of a 3D triangle mesh in a manner that allows progressive decoding and efficient rendering at a client machine. The code is based on a special ordering of the mesh vertices which has good locality and continuity properties, inducing a natural multiresolution structure. This ordering also incorporates information allowing efficient rendering of the mesh at all resolutions using the contemporary vertex buffer mechanism. The performance of our code is shown to be competitive with existing progressive mesh compression methods, while achieving superior rendering speed.
Modeling and Distributed Simulation of a Broadband-ISDN Network
Authors: Arthur Chai, Sumit Ghosh
Venue: Computer (1993)

A distributed approach to communication network simulation using a network of workstations configured as a loosely coupled parallel processor to model and simulate the broadband integrated services digital network (B-ISDN) is proposed. In a loosely coupled parallel processor system, a number of concurrently executable processors communicate asynchronously using explicit messages over high-speed links. Since this architecture is similar to that of B-ISDN networks, it constitutes a realistic testbed for their modeling and simulation. The authors describe an implementation of this approach on 50 Sun workstations at Brown University. Performance results, based on representative B-ISDN networks and realistic traffic models, indicate that the distributed approach is efficient and accurate.
Status Report: Computer-Aided Prototyping
Authors: Luqi, Winston Royce
Venue: IEEE Software (1992)

The application of prototyping, the construction and analysis of an executable model that approximates a proposed system, to software engineering is described. In the paper, the role of computer-aided prototyping in software development is assessed, the supporting technology necessary for prototyping to reach its potential is identified, and directions for future work are suggested.
Using Petri Nets for the Design of Conversation Boundaries in Fault-Tolerant Software
Authors: J. Wu, E. B. Fernandez
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Only a few mechanisms have been proposed for the design of fault-tolerant software.One of these is the conversation, which, though it has some drawbacks, is a potentiallypromising structure. One of the problems with conversations is that they must be definedand verified by the user. In this short note, a systematic method for generating theboundaries of conversations directly from the specification is proposed. This method canalso be used to verify conversations selected by the user. The specification is describedby a high-level modified Petri net which can easily be transformed into a state modelcalled an action-ordered tree. The conversation boundaries are then determined from thistree. It is proved that the method proposed is complete in the sense that all of thepossible boundaries can be determined, and it has the merit of simplicity. A robot armcontrol system is used to illustrate the idea. The proposed method can serve as the basisof a tool to assist in conversation designs.
An Application-Centric Characterization of Domain-Based SFC Partitioners for Parallel SAMR
Authors: Johan Steensland, Sumir Chandra, Manish Parashar
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

Structured adaptive mesh refinement (SAMR) methods for the numerical solution of partial differential equations yield highly advantageous ratios for cost/accuracy as compared to methods based on static uniform approximations. These techniques are being effectively used in many domains including computational fluid dynamics, numerical relativity, astrophysics, subsurface modeling, and oil reservoir simulation. Distributed implementations of these methods, however, lead to significant challenges in dynamic data-distribution, load-balancing, and runtime management. This paper presents an application-centric characterization of a suite of dynamic domain-based inverse space-filling curve partitioning techniques for the distributed adaptive grid hierarchies that underlie SAMR applications. The overall goal of this research is to formulate policies required to drive a dynamically adaptive metapartitioner for SAMR grid hierarchies capable of selecting the most appropriate partitioning strategy at runtime based on current application and system state. Such a metapartitioner can significantly reduce the execution time of SAMR applications.
The calculation of the intramyocardial stress
Authors: Rachad M. Shoucri
Venue: Technology and Health Care (2002)

A mathematical approach is given by which the intramyocardial stress σ induced in the passive medium of the myocardium is expressed as the sum of the stress (σ)p induced in the passive medium by the left ventricular pressure P and the external pressure Po, and the stress (σ)d induced in the passive medium by the active force generated by the muscular fibers of the myocardium. Relations between σ = (σ)p + (σ)d, the left ventricular elastance E and the residual volume Vd are also derived. Applications to experimental data are given and clinical implications of the results are discussed. A list of symbols is given in the appendix.
An XML approach for legacy code reuse
Authors: Y. Bi, M. E. C. Hull, P. N. Nicholl
Venue: Journal of Systems and Software (2002)

In this paper, we investigate a hybrid approach of wrapping and migration for the reuse of legacy applications through a case study. This approach is based on eXtensible Markup Language (XML), client/server architecture and the concepts used by Netron Fusion. To implement wrapping and migration of legacy applications, necessary information is achieved by gaining the understanding of the information flow and logic, and tracing users' interactions with systems, aiming at minimal modifications of the original applications. We present, through a case study, a way of applying this approach to an application.
An Extended Class of Scale-Invariant and Recursive Scale Space Filters
Authors: Eric J. Pauwels, Luc J. Van Gool, Peter Fiddelaers, Theo Moons
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

In this paper we explore how the functional form of scale space filters is determined by a number of a priori conditions. In particular, if we assume scale space filters to be linear, isotropic convolution filters, then two conditions (viz. recursivity and scale-invariance) suffice to narrow down the collection of possible filters to a family that essentially depends on one parameter which determines the qualitative shape of the filter. Gaussian filters correspond to one particular value of this shape-parameter. For other values the filters exhibit a more complicated pattern of excitatory and inhibitory regions. This might well be relevant to the study of the neurophysiology of biological visual systems, for recent research shows the existence of extensive disinhibitory regions outside the periphery of the classical center-surround receptive field of LGN and retinal ganglion cells (in cats). Such regions cannot be accounted for by models based on the second order derivative of the Gaussian. Finally, we investigate how this work ties in with another axiomatic approach of scale space operators (propounded by Lindeberg and Alvarez et al.) which focuses on the semigroup properties of the operator family. We show that only a discrete subset of filters gives rise to an evolution which can be characterized by means of a partial differential equation.