ppxscal/embedding_network huggingface dataset:
Static Verification of Test Vectors for IR Drop Failure
Authors: Aman A. Kokrady, C. P. Ravikumar
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

ATPG tools generate test vectors assuming zero delay model forlogic gates.In reality, however, gates have finite rise and falldelays that are dependent on process, voltage, and temperaturevariations across different dies on a wafer and within a die.A testengineer must verify the vectors for timing correctness before theyare handed off to the product engineer.Currently, validation oftests is done using dynamic simulation of the circuit using the testvectors.A test vector is invalidated if it cannot reliably distinguishbetween a good and a faulty circuit under the signal placement andobservation error window of the tester equipment.Since structuraltests can result in much more switching activity in the circuit thanwhat is estimated during normal functioning, the IR drop in thepower & ground lines can be significant, adversely impacting pathdelays.As a result, the validation performed by simulation can beerror prone.Oversizing the power rails to address this problemimpacts the yield.We therefore propose the verification of testvectors for IR drop failure and present a flow for identifyingfailing vectors.Attempting to address this verification in dynamicsimulation will force the use of circuit simulation or mixed-levelsimulation techniques, which are expensive in terms of run time.We discuss a static approach to validate the test vectors for failurein the presence of IR drop problems.
IDDQ data analysis using neighbor current ratios
Authors: Sagar S. Sabade, D. M. H. Walker
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

IDDQ test loses its effectiveness for deep sub-micron chips since it cannot distinguish between faulty and fault-free currents. The concept of current ratios, in which the ratio of maximum to minimum IDDQ is used to screen faulty chips, has been previously proposed. However, it is incapable of screening some defects. The neighboring chips on a wafer have similar fault-free properties and are correlated. In this paper, the use of spatial correlation in combination with current ratios is investigated. By differentiating chips based on their non-conformance to local IDDQ variation, outliers are identified. The analysis of SEMATECH test data is presented.
In Defense of One-Vs-All Classification
Authors: Ryan Rifkin, Aldebaro Klautau
Venue: The Journal of Machine Learning Research (2004)

We consider the problem of multiclass classification. Our main thesis is that a simple "one-vs-all" scheme is as accurate as any other approach, assuming that the underlying binary classifiers are well-tuned regularized classifiers such as support vector machines. This thesis is interesting in that it disagrees with a large body of recent published work on multiclass classification. We support our position by means of a critical review of the existing literature, a substantial collection of carefully controlled experimental work, and theoretical arguments.
Mixed finite element methods for stationary incompressible magneto&#x2013;hydrodynamics
Authors: Dominik Sch&#x00f6;tzau
Venue: Numerische Mathematik (2004)

A new mixed variational formulation of the equations of stationary incompressible magneto&#x2013;hydrodynamics is introduced and analyzed. The formulation is based on curl-conforming Sobolev spaces for the magnetic variables and is shown to be well-posed in (possibly non-convex) Lipschitz polyhedra. A finite element approximation is proposed where the hydrodynamic unknowns are discretized by standard inf-sup stable velocity-pressure space pairs and the magnetic ones by a mixed approach using N&#x00e9;d&#x00e9;lec&#x2019;s elements of the first kind. An error analysis is carried out that shows that the proposed finite element approximation leads to quasi-optimal error bounds in the mesh-size.
Spatio-temporal available bandwidth estimation with STAB
Authors: Vinay J. Ribeiro, Rudolf H. Riedi, Richard G. Baraniuk
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

We study the problem of locating in space and over time a network path's tight link, that is the link with the least available bandwidth on the path. Tight link localization benefits network-aware applications, provides insight into the causes of network congestion and ways to circumvent it, and aids network operations. We present STAB, a light-weight probing tool to locate tight links. STAB combines the probing concepts of self-induced congestion, tailgating, and packet chirps in a novel fashion. We demonstrate its capabilities through experiments on the Internet and verify our results using router MRTG data.
Finding the smallest image of a set
Authors: Steve Linton
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering the resulting sequences lexicographically, we find the first image. This has applications to combinatorial and other search problems, allowing isomorphic results to be eliminated more efficiently.We give worst-case asymptotic running time estimates and practical results obtained with a GAP implementation.
Managing Moving Objects on Dynamic Transportation Networks
Authors: Zhiming Ding, Ralf Hartmut Guting
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

One of the key research issues with moving objectsdatabases (MOD) is the modeling of moving objects. Inthis paper, a new moving objects database model, MovingObjects on Dynamic Transportation Networks (MODTN),is proposed. In MODTN, moving objects are modeled asmoving graph points which move only within predefinedtransportation networks. To express general events of thesystem, such as traffic jams, temporary constructions,insertion and deletion of junctions or routes, theunderlying transportation networks are modeled asdynamic graphs so that the state and the topology of thegraph system at any time instant can be tracked andqueried. Besides, to track the location of networkconstrained moving objects, a location update mechanismis provided, and the corresponding uncertaintymanagement issues are analyzed.
The price of validity in dynamic networks
Authors: Mayank Bawa, Aristides Gionis, Hector Garcia-Molina, Rajeev Motwani
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with short-lived hosts being the norm rather than an exception. In recent years, researchers have investigated best-effort algorithms to efficiently process aggregate queries (e.g., sum, count, average, minimum and maximum) [6, 13, 21, 34, 35, 37] on these networks. Unfortunately, query semantics for best-effort algorithms are ill-defined, making it hard to reason about guarantees associated with the result returned. In this paper, we specify a correctness condition, single-site validity, with respect to which the above algorithms are best-effort. We present a class of algorithms that guarantee validity in dynamic networks. Experiments on real-life and synthetic network topologies validate performance of our algorithms, revealing the hitherto unknown price of validity.
Effectiveness of web page classification on finding list answers
Authors: Hui Yang, Tat-Seng Chua
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

List question answering (QA) offers a unique challenge in effectively and efficiently locating a complete set of distinct answers from huge corpora or the Web. In TREC-12, the median average F1 performance of list QA systems was only 6.9%. This paper exploits the wealth of freely available text and link structures on the Web to seek complete answers to list questions. We employ natural language parsing, web page classification and clustering to find reliable list answers. We also study the effectiveness of web page classification on both the recall and uniqueness of answers for web-based list QA.
Annotating Narratives Using Ontologies and Conceptual Graphs
Authors: Jan Uhlir, Martin Falc
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper we propose a generic semi-automatic language-independent framework for annotating content using ontologies as the controlled vocabulary for annotations and Conceptual Graphs [Knowledge Representation: Logical, Philosophical, and Computational Foundations] as the annotation language. We build on our experiments with story abstracts expressed as conceptual graphs, which proved applicability of conceptual graphs as a language suitable for capturing semantics of narratives. We formulate basic requirements for well formed semantic annotations and we show how the proposed methodology will satisfy them.
Eof
Authors: Ibrahim Haddad
Venue: Linux Journal (2004)

Carrier Grade Linux
Sharing Learner Profile through an Ontology and Web Services
Authors: Daniela Leal Musa, LydiaSilva Munoz, Jose Palazzo Moreira de Oliveira
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper we propose a Web Services based solution to exchange learner's information among different e-learning systems described following a Web Ontology. The Web Services technology was used because it allows the easy communication between Web applications through the HTTS protocol. Our goal with this work was to make different e-learning systems to cooperate with each other in order to reach a set of learner information richer than that currently found in standard e-learning systems. The present work is part of a current project intended to present an adaptive content associated to a particular student profile, the AdaptWeb® Project.
An evaluation of techniques for controlling focus+context screens
Authors: Mark J. Flider, Brian P. Bailey
Venue: Proceedings of Graphics Interface 2004 (2004)

We evaluated four techniques for controlling focus+context screens. We compared an egocentric versus exocentric View mixed with whether the display on the focus screen moves in the same (paper mapping) versus opposite (scroll mapping) direction as imput force. Our results show that (i) View had little effect, (ii) users almost always allocated attention to the context screen when controlling the display, (iii) scroll mappings enabled a user to perform tasks faster, commit fewer errors, and be more satisfied with the system compared to paper mappings, and (iv) a user can better control focus+context screens when the frame of reference either does move or is perceived to move in the direction of input force. We discuss these results and recommend how to enable a user to better control focus+context screens.
Making control systems visible
Authors: Qiao Liu, Keiichi Nakata, Kazuo Furuta
Venue: Cognition, Technology and Work (2004)

In this paper we discuss how to support interface design of automatic control systems in a systematic way, that is, how to identify the information that should be displayed in a cognitive relevant way and how to visualize this information content in the interface efficiently. First, a means-ends hierarchical structure is adopted to build the functional model of a control system. Then, a set of functional primitives is proposed, and their behavioural explanations are given. These primitives are used to describe the functions in a functional model of a control system. Based on the functional model, the necessary information to be visualized in the interface can then be identified. Third, a library of graphical presentations for the set of functional primitives is set up. To overcome the problem of display complexity and improve operators&#x2019; cognitive workload, the concept of &#x201c;functional macro&#x201d; is adopted. Furthermore, several principles are proposed to explain how to map a functional model to interface displays. Finally, how to use this approach to support interface design of automatic control systems is explained in detail by using the electrical and hydraulic controller (EHC) of a nuclear power plant (NPP) as an example. A simple experiment showed that the display design of EHC in this study could be more helpful to identify the modes of EHC than a SSSI design. Reusability of the set of functional primitives and their graphical presentations make this approach possible to support designing displays of various control systems.
Algebraic Optimization of Data Delivery Patterns in Mobile Sensor Networks
Authors: Vladimir Zadorozhny, Panos K. Chrysanthis, Alexandros Labrinidis
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Database-like query processing over a network of sensors has become an attractive paradigm for building sensor applications. A sensor query is characterized by data streams among participating sensor nodes with possible in-node data filtering or aggregation, and can be described as a tree-like data delivery pattern. The data delivery pattern can also be considered as a query execution plan, or query routing tree. In this work, we propose an algebraic optimization of the query routing tree construction and reconfiguration. In particular, we aim at generating query trees that maximize collision-free concurrent data transmissions hence reducing energy and time wastes due to retransmissions. Towards this, we introduce a Data Transmission Algebra (DTA) and apply it for efficient generation of such query trees.
Queue Processor Architecture for Novel Queue Computing Paradigm Based on Produced Order Scheme
Authors: Ben A. Abderazek, M. Arsenji, Soichi Shigeta, Tsutomu Yoshinaga, Masahiro Sowa
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

This paper proposes novel produced order parallel queue processor architecture. To store intermediate results, the proposed system uses a FIFO queue registers instead of random access registers. Datum is inserted in the queue in produced order scheme and can be reused. We will show that this feature has a profound implication in the areas of parallel execution, programs compactness, hardware simplicity and high execution speed. Our preliminary performance evaluations have shown a significant performance improvement (e.g., 10% to 26% decrease in program size and 6% to 46% decrease in execution time over a range of benchmark programs) when compared with the earlier proposed architecture.
Automatic Techniques for Texture Mapping in Virtual Urban Environments
Authors: R. G. Laycock, A. M. Day
Venue: Proceedings of the Computer Graphics International (2004)

Many methods exist for automatically generating threedimensional models of urban environments at various levelsof detail. To improve the realism of these models texturemaps are applied to the building facades. This paper focuseson techniques which progress towards the automaticapplication of textural detail to building facades. In particularattention is paid to residential scenes where buildingsare occluded by many objects such as vegetation andfences. The approach undertaken uses a set of images foreach building being textured. From this set a single buildingimage is created by identifying the building and removingoccluding objects using a depth map. Further processingof the building image is undertaken to generate two texturemaps, the wall map and the object map. The wall map containsa repeatable wall pattern extracted automatically fromthe building facade. The object map contains the spatial arrangementof features on a transparent background. Thefeatures are objects on the building facade such as windowsand doors. These two texture maps are combined on thegraphics card to permit the final textural detail of the buildingto be visualised.
Improved Prediction for Web Server Delay Control
Authors: Dan Henriksson, Ying Lu, Tarek Abdelzaher
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Control methods are being used increasingly for uncertaintymanagement and QoS in modern web server systems.Previous approaches have suggested combined feed-forwardand feedback control strategies, using queuing theoryfor feed-forward delay prediction. While queuing theoryallows one to predict delay as a function of arrival andservice rates, the prediction applies only to long-term averages,and is therefore insensitive to sudden load changes.Unfortunately, Internet load is very bursty, leaving room forpredictor improvement. The main contribution of this paperis an extension of the combined feed-forward/feedbackframework in which the queuing model is replaced with apredictor that instead uses instantaneous measurements topredict future delays. The proposed strategy is evaluatedin simulation and by experiments on an Apache web server.It is shown that the new approach performs better than thecombined queuing model based feed-forward and feedbackcontrol presented in earlier papers.
Heuristic Algorithms for Determination of Canonical Forms and Grammatical Characteristics of Words
Authors: A. V. Anisimov, A. N. Romanik, V. Yu. Taranukha
Venue: Cybernetics and Systems Analysis (2004)

Algorithms are developed that determine canonic forms and grammar categories from individual words and the vocabulary of a text. Algorithms are proved to be highly efficient. The accuracy of determination directly depends on the length of the text.
Performance characteristics of the Cray X1 and their implications for application performance tuning
Authors: Hongzhang Shan, Erich Strohmaier
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

During the last decade the scientific computing community has optimized many applications for execution on superscalar computing platforms. The recent arrival of the Japanese Earth Simulator has revived interest in vector architectures especially in the US. It is important to examine how to port our current scientific applications to the new vector platforms and how to achieve high performance. The success of porting these applications will also influence the acceptance of new vector architectures. In this paper, we first investigate the memory performance characteristics of the Cray X1, a recently released vector platform, and determine the most influential performance factors. Then, we examine how to optimize applications tuned on superscalar platforms for the Cray X1 using its performance characteristics as guidelines. Finally, we evaluate the different types of optimizations used, the effort for their implementations, and whether they provide any performance benefits when ported back to superscalar platforms.
A New Hierarchical Method for Identification of Dynamic Regulatory Pathways from Time-Series DNA Microarray Data
Authors: Alireza Darvish, E. Bak, K. Gopalakrishnan, R. H. Zadeh, Kayvan Najarian
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

A new hierarchical method is proposed to analyze time-series DNA microarray data to identify dynamic genetic pathways. Initially the hierarchical method applies a specialized clustering technique to incorporate the available heuristic information about biological system. Then, the prototypes of the resulting clusters are used as time-variables to develop an Auto Regressive model relate the expression of the prototypes to each other. The resulting model also allows the prediction of gene expressions for the next time steps. The developed AR model can then be used to relate the expression value of each single gene to the genes of other clusters. The proposed method was applied to the cell-cycle dataset containing the DNA microarray time-series of a large number of genes involved in the eukaryotic cell-cycle. The technique resulted to a network of interactions among five clusters of genes in which the genes of each cluster have a biologically-meaningful trend in time.
Local Tree-Width, Excluded Minors, and Approximation Algorithms
Authors: Martin Grohe
Venue: Combinatorica (2003)

The local tree-width of a graph G=(V,E) is the function ltwG :&#x2115;&#x2192;&#x2115; that associates with every r&#x2208;&#x2115; the maximal tree-width of an r-neighborhood in G. Our main grapht heoretic result is a decomposition theorem for graphs with excluded minors, which says that such graphs can be decomposed into trees of graphs of almost bounded local tree-width.As an application of this theorem, we show that a number of combinatorial optimization problems, suchas Minimum Vertex Cover, Minimum Dominating Set, and Maximum Independent Set have a polynomial time approximation scheme when restricted to a class of graphs with an excluded minor.
Intrusion Detection in Virtual Machine Environments
Authors: Marcos Laureano, Carlos Maziero, Edgard Jamhour
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

A virtual machine is a software replica of an underlying real machine. Multiple virtual machines can operate on the same host machine concurrently, without interfere each other. Such concept is becoming valuable in production computing systems, due to its benefits in terms of costs and portability. As they provide a strong isolation between the virtual environment and the underlying real system, virtual machines can also be used to improve the security of a computer system in face of attacks to its network services. This paper presents a new approach to achieve this goal, by applying intrusion detection techniques to virtual machine based systems, thus keeping the intrusion detection system out of reach from intruders. The results obtained from a prototype implementation confirm the usefulness of this approach.
Ann Kirschner on marketing and distribution of online learning
Authors: Ann Kirschner
Venue: Ubiquity (2004)

Outside of business schools, the very word "marketing" makes most universities uncomfortable, as does the idea of students as customers. But the world of higher education is becoming increasingly competitive. Fathom, named for the double idea of comprehension and depth, was a milestone in the evolution of online learning and a prototype of where things are headed.
Automated algorithms for multiscale morphometry of neuronal dendrites
Authors: Christina M. Weaver, Patrick R. Hof, Susan L. Wearne, W. Brent Lindquist
Venue: Neural Computation (2004)

We describe the synthesis of automated neuron branching morphology and spine detection algorithms to provide multiscale three-dimensional morphological analysis of neurons. The resulting software is applied to the analysis of a high-resolution (0.098 µm × 0.098 µm × 0.081 µm) image of an entire pyramidal neuron from layer III of the superior temporal cortex in rhesus macaque monkey. The approach provides a highly automated, complete morphological analysis of the entire neuron; each dendritic branch segment is characterized by several parameters, including branch order, length, and radius as a function of distance along the branch, as well as by the locations, lengths, shape classification (e.g., mushroom, stubby, thin), and density distribution of spines on the branch. Results for this automated analysis are compared to published results obtained by other computer-assisted manual means.