ppxscal/embedding_network huggingface dataset:
Noise Model for Multiple Segmented Coupled RC Interconnects
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

Performance of high-speed VLSI circuits is increasingly limited by interconnect coupling noise. We present simple and improved analytical models for noise phenomena due to coupling capacitance. We extend the P model presented in [4] to accommodate a segmented aggressor. We also include a linear driver resistance in the modeling of both victims and aggressors to measure their estimate on peak noise. Finally, we extend this model to multiple segmented aggressors by superposing noise contributions of individual aggressors and sweeping the result in the time domain to determine peak noise (in contrast to adding the individual peak noise values for individual aggressors). Accuracy in the results depends greatly on actual positioning of victim-aggressor overlaps. We find that previous models that assume aggressors run parallel to the victim net for its entire length do not yield peak noise results nearly as close to SPICE-computed values. We also find that inclusion of driver resistance in the model improves accuracy. Our noise model for a single segmented aggressor is within ~ 16% of SPICE. Results for two segmented aggressors are within acceptable tolerances with respect to SPICE, but error increases with the number of aggressors. We note that these results are almost always pessimistic.
Some Linear-Time Algorithms for Systolic Arrays
Authors: Richard P. Brent, H. T. Kung, Franklin T. Luk
Venue:  (1983)

We survey some recent results on linear-time and almost linear-time algorithms for one and two-dimensional systolic arrays. In particular, we show how the greatest common divisor (GCD) of two polynomials of degree $n$ over a finite field can be computed in time $O(n)$ on a linear systolic array of $O(n)$ cells; similarly for the GCD of two $n$-bit binary numbers. Assuming that the systolic cells can perform floating-point arithmetic, we show how $n$ by $n$ Toeplitz systems of linear equations can be solved in time $O(n)$ on a linear array of $O(n)$ cells, each of which has constant memory size (independent of $n$). Finally, we outline how a two-dimensional array of $O(n)$ by $O(n)$ cells with nearest-neighbor interconnections can be used to solve (to working accuracy) the eigenvalue problem for a symmetric real $n$ by $n$ matrix in time $O(nS(n))$. Here $S(n)$ is a slowly-growing function of $n$; for practical purposes $S(n)$ can be regarded as a constant. In addition to their theoretical interest, these results can be implemented relatively easily and have potential applications in the areas of error-correcting codes, symbolic and algebraic computation, signal processing and image processing. For example, systolic GCD arrays for error correction have been implemented with the microprogrammable ``PSC'''' chip.
Computing Cumulative Measures of Stiff Markov Chains Using Aggregation
Authors: Andrea Bobbio, S K Trivedi
Venue:  (1987)

In this paper, we present an aggregation method for the computation of transient cumulative measures of large, stiff Markov models. We first motivate the use of cumulative measures in performance and reliability models of computer systems. We then show that cumulative measures decay more slowly than instantaneous measures, thus increasing the importance of the transient analysis. The method of computation is based on a decomposition technique. The technique classifies the states of the original problem into slow, fast transient, and fast recurrent states. We aggregate fast transient states and fast recurrent states so that an approximate value to the desired cumulative measure can be obtained by solving a non-stiff set of linear differential equations defined over a reduced subset of slow states only. Several examples are included to illustrate how stiffness arises naturally in many queueing and reliability models, and to show that cumulative measures provide a better characterization of the time dependent system behavior.
On the Number of Vertices Belonging to all Maximum Stable Sets of a Graph
Authors: Boros Edre, Golumbic Martin, Levit Vadim
Venue:  (1999)

Let us denote by $\alpha (G)$ the size of a maximum stable set, and by $\mu(G)$ the size of a maximum matching of a graph $G$, and let $\xi (G)$ be the number of vertices which belong to all maximum stable sets. We shall show that $\xi (G)\geq 1+\alpha (G)-\mu (G)$ holds for any connected graph, whenever $\alpha(G)<\mu(G)$. This inequality improves on related results by Hammer, Hansen and Simeone (1982) and by Levit and Mandrescu (1998). We also prove that on the one hand, $\xi (G)<0$ can be recognized in polynomial time whenever $\mu (G)k$ is, in general, NP-complete for any fixed $k\geq 0$.
SETS: search enhanced by topic segmentation
Authors: Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghavan
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arrange participating sites in a topic-segmented overlay topology in which most connections are short-distance, connecting pairs of sites with similar content. Topically focused sets of sites are then joined together into a single network by long-distance links. Queries are matched and routed to only the topically closest regions. We discuss a variety of design issues and tradeoffs that an implementor of SETS would face. We show that SETS is efficient in network traffic and query processing load.
Embedded fuzzy-control system for machining processes results of a case study
Authors: R. E. Haber, J. R. Alique, A. Alique, J. Hernández, R. Uribe-Etxebarria
Venue: Computers in Industry (2003)

In this paper a fuzzy-control system has been designed, implemented and embedded in an open CNC. The integration process, design steps and results of applying an embedded fuzzy-control system are shown through the example of real machining operations. The controller uses internal CNC signals (i.e. spindle-motor current) that are gathered and mathematically processed by means of an integrated application. The results show that, at least in rough milling operations, internal CNC signals can double as an intelligent, sensorless control system. Actual industrial tests show a higher machining efficiency (i.e. in-process time is reduced by 10% and total estimated savings the system would provide are about 78%).
Why combine logics?
Authors: Patrick Blackburn, Maarten Rijke
Venue:  (1995)

Combining logics has become a rapidly expanding enterprise that is inspired mainly by concerns about modularity and the wish to join together tailored made logical tools into more powerful but still manageable ones. A natural question is whether it offers anything new over and above existing standard languages. By analysing a number of applications where combined logics arise, we argue that combined logics are a potentially valuable tool in applied logic, and that endorsements of standard languages often miss the point. Using the history of quantified modal logic as our main example, we also show that the use of combined structures and logics is a recurring theme in the analysis of existing logical systems.
Bylands: reverse engineering safety-critical systems
Authors: T. M. Bull, E. J. Younger, K. H. Bennett, Z. Luo
Venue: Proceedings of the International Conference on Software Maintenance (1995)

We address two problems concerned with the maintenance of safety-critical software. Firstly, we analyse the new issues required for the reverse engineering of real-time existing code to extract high level designs. Secondly, we present a possible design abstraction mechanism that can be used for safety-critical software. We use formal transformations both in the reverse engineering of systems involving temporal constraints, and in the definition of the abstract representation. We present a design framework and the results of initial experiments. The contributions are: (1) the requirements analyses for reverse engineering safety-critical systems, (2) the use of very-high-level domain languages, and (3) formal transformations as the unifying technology.
Information Invariants for Distributed Manipulation
Authors: Bruce R Donald, James Jennings, Daniela Rus
Venue:  (1994)

In [Don4], we described a manipulation task for cooperating mobile robots that can push large, heavy objects. There, we asked whether explicit local and global communication between the agents can be removed from a family of pushing protocols. In this paper, we answer in the affirmative. We do so by using the general methods of [Don4] analyzing information invariants. We discuss several measures for the information complexity of the task: (a) How much internal state should the robot retain? (b) How many cooperating agents are required, and how much communication between them is necessary? (c) How can the robot change (side-effect) the environment in order to record state or sensory information to perform a task? (d) How much information is provided by sensors? and (e) How much computation is required by the robot? To answer these questions, we develop a notion of information invariants. We develop a technique whereby one sensor can be constructed from others by adding, deleting, and rellocating (a) (e) among collaborating autonomous agents. We add a resource to (a) (e) and ask: (f) How much information is provided by the task mechnics? By answering this question, we hope to develop information invariants that explicitly trade-off resource (f) with resources (a) (e). The protocols we describe here have been implemented in several different forms, and report on experiments to measure and analyze information invariants using a pair of cooperating mobile robots for manipulation experiments in our laboratory.
A Graphical, Language-Based Editor for Generic Solid Models Represented by Constraints.
Authors: Lee A Barford
Venue:  (1987)

A solid model is a representation of the space occupied by a rigid object. A generic solid (or ``generic'''') expresses the solid models for a class of similar objects, or equivalently, a non-rigid object. Automated manufacturing systems require solid models of the objects with which they work. For example, solid models are needed to discover collision-free paths for robot arms. Previously, generics have been created using clumsy textual languages, and solid models have usually been created using graphical editors. This thesis describes a technique for editing generics graphically, thus decreasing the labor required to create both generics and solid models. This thesis introduces microCOSM, a language for specifying solid models and generics in which a solid or generic is represented by its parts along with constraints that the parts must satisfy. Relationships between parts of an object are expressed as constraints between those parts. As a result, microCOSM can express more such relationships than current generic solid languages. A graphical editor for two-dimensional generics in microCOSM has been written. The microCOSM language and the user interface and implementation of the editor are described, and some improvements that should be made to the editor are discussed. The microCOSM editor, like any constraint-based editor, must have a constraint solver, a module that forces any object displayed by the editor to satisfy its constraints. This thesis shows why the usual techniques for solving constraints do not work well with microCOSM and show that the constraints in microCOSM are best solved as a related minimization problem. The minimization problem is chosen to achieve a harmonious compromise between the numerical complexity of the problem and the principle of least astonishment. Most bugs in microCOSM generic definitions involve having too many or too few constraints on some part of the solid. Algorithms are presented that detect under and overconstraint, under some reasonable assumptions about the constraints. These algorithms are dynamic; it is possible to determine if a modification induces an error without rerunning the entire computation. Error messages can be updated interactively, easing identification of the erroneous constraints.
The Effect of Large Training Set Sizes on Online Japanese Kanji and English Cursive Recognizers
Authors: Henry A. Rowley, Manish Goyal, John Bennett
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Much research in handwriting recognition has focused on how to improve recognizers with constrained training set sizes. This paper presents the results of training a nearest-neighbor based online Japanese Kanji recognizer and a neural-network based online cursive English recognizer on a wide range of training set sizes, including sizes not generally available. The experiments demonstrate that increasing the amount of training data improves the accuracy, even when the recognizer's representation power is limited.
Locality-Conscious Load Balancing: Connectionist Architectural Support
Authors: Chaitanya Tumuluri, Alok N. Choudhary, Chilukuri K. Mohan
Venue:  (1996)

Traditionally, in distributed memory architectures, locality maintenance and load balancing are seen as user level activities involving compiler and runtime system support in software. Such software solutions require an explicit phase of execution, requiring the application to suspend its activities. This paper presents the first (to our knowledge) architecturelevel scheme for extracting locality concurrent with the application execution. An artificial neural network coprocessor is used for dynamically monitoring processor reference streams to learn temporally emergent utilities of data elements in ongoing local computations. This facilitates use of kernel-level load balancing schemes thus, easing the user programming burden. The kernel-level scheme migrates data to processor memories evincing higher utilities during load-balancing. The performance of an executiondriven simulation evaluating the proposed coprocessor is presented for three applications. The applications chosen represent the range of load and locality fluxes encounted in parallel programs, with (a) static locality and load characteristics, (b) slowly varying localities for fixed dataset sizes and (c) rapidly fluctuating localities among slowly varying dataset sizes. The performance results indicate the viability and success of the coprocessor in concurrently extracting locality for use in load balancing activities.
Tiling Imperfectly-nested Loop Nests (REVISED)
Authors: Nawaaz Ahmed, Nikolay Mateev, Keshav Pingali
Venue:  (2000)

Tiling is one of the more important transformations for enhancing locality of reference in programs. Tiling of perfectly-nested loop nests (which are loop nests in which all assignment statements are contained in the innermost loop) is well understood. In practice, most loop nests are imperfectly-nested, so existing compilers heuristically try to find a sequence of transformations that convert such loop nests into perfectly-nested ones but not always succeed. In this paper, we propose a novel approach to tiling imperfectly-nested loop nests. The key idea is to embed the iteration space of every statement in the imperfectly-nested loop nest into a special space called the product space. The set of possible embeddings is constrained so that the resulting product space can be legally tiled. From this set we choose embeddings that enhance data reuse. We evaluate the effectiveness of this approach for dense numerical linear algebra benchmarks, relaxation codes, and the tomcatv code from the SPEC benchmarks. No other single approach in the literature can tile all these codes automatically.
Structural assessment by modal analysis: case study of the new Algiers airport
Authors: N. Bourahla, F. Bouriche, M. Benredouane, M. Ould-Amara
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The assessment of the structural resistance of existing constructions such as buildings, bridges, dams etc. uses often mathematical models whose parameters can hardly be precisely estimated by analytical procedure only. Therefore, the elastic, mass and damping characteristics of the structure to be assessed must be known to a sufficient degree of accuracy in order to evaluate the actual structural capacity of the construction. The elastic dynamic properties, particularly the natural frequencies and the corresponding mode shapes are a combined measure of the structural characteristics of the construction. These model characteristics can be successfully estimated, especially in elastic range, using the well known ambient vibration testing. In this paper, the assessment procedure of the new Algiers airport building is described. The results of an extensive program of non-destructive and destructive tests on the concrete were put into the equations, and series of ambient vibration tests were conducted and modal analysis were performed to validate the mathematical models. The paper concludes that a complete program including both non-destructive and ambient vibration testing is essential to accurately validate the hypotheses of the numerical modelling and eventually evaluate the resistance capacity of the structure.
Successive Search Method for Valued Constraint Satisfaction and Optimization Problems.
Authors: Mohamed Tounsi, Philippe David
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

In this paper we introduce a new method based on Russian Doll Search (RDS) for solving optimization problems expressed as Valued Constraint Satisfaction Problems (VCSPs). The RDS method solves problems of size n (where n is the number of variables) by replacing one search by n successive searches on nested subproblems using the results of each search to produce a better lower bound. The main idea of our method is to introduce the variables through the successive searches not one by one but by sets of k variables. We present two variants of our method: the first one where the number k is fixed, noted kfRDS; the second one, kvRDS, where k can be variable. Finally, we show that our method improves RDS on daily management of an earth observation satellite.
Dynamic generation of usable search interfaces for networked information systems
Authors: Pasquale Pagano, Donatella Castelli
Venue:  (1999)

The protocols for networked information systems should provide a richer description of the query capabilities in order to permit the implementation of more usable search interfaces. This paper suggests to express this description with a formal grammar. A grammar is a powerful representation of the query capabilities, it can be easily transmitted, interpreted and manipulated automatically. A grammar can also be simply created and used for dynamically building search interfaces. This paper discusses these last two issues and presents appropriate methods for achieving these aims. EMAIL:: pagano@iei.pi.cnr.it
Packet classification using multidimensional cutting
Authors: Sumeet Singh, Florin Baboescu, George Varghese, Jia Wang
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

This paper introduces a classification algorithm called phHyperCuts. Like the previously best known algorithm, HiCuts, HyperCuts is based on a decision tree structure. Unlike HiCuts, however, in which each node in the decision tree represents a hyperplane, each node in the HyperCuts decision tree represents a k--dimensional hypercube. Using this extra degree of freedom and a new set of heuristics to find optimal hypercubes for a given amount of storage, HyperCuts can provide an order of magnitude improvement over existing classification algorithms. HyperCuts uses 2 to 10 times less memory than HiCuts optimized for memory, while the worst case search time of HyperCuts is 50--500% better than that of HiCuts optimized for speed. Compared with another recent scheme, EGT-PC, HyperCuts uses 1.8--7 times less memory space while the worst case search time is up to 5 times smaller. More importantly, unlike EGT-PC, HyperCuts can be fully pipelined to provide one classification result every packet arrival time, and also allows fast updates.
Virtual Information Towers-A Metaphor for Intuitive, Location-Aware Information Access in a Mobile Environment
Authors: Alexander Leonhardi, Uwe Kubach, Kurt Rothermel, Andreas Fritz
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

This paper introduces Virtual Information Towers (VITs) as a concept for presenting and accessing location-aware information with mobile clients. A VIT is a means of structuring location-aware information, which is assigned to a certain geographical position while having a certain area of visibility. A user equipped with a mobile, wearable computer has access to the VITs which are "visible" from his/her current location. The architecture and protocols of a system are described, which allows its users to create VITs and to access the information on them using Internet mechanisms. We have implemented a prototype of this system and a VIT client for a wearable computer and will present some aspects of this implementation.
A Survey of Black-Box Modernization Approaches for Information Systems
Authors: S. Comella-Dorda, K. Wallnau, R. Seacord, J. Robert
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Information systems are critical assets for modern enterprises and incorporate key knowledge acquired over the life of an organization. These systems must be updated continuously to reflect evolving business practices. Unfortunately, repeated modification has a cumulative effect on system complexity, and the rapid evolution of technology quickly renders existing technologies obsolete. Eventually, the existing information systems become too fragile to modify and too important to discard. For this reason, organizations must consider modernizing these legacy systems to remain viable. The commercial market provides a variety of solutions to this increasingly common problem of legacy system modernization. Understanding the strengths and weaknesses of each modernization technique is paramount to select the correct solution and the overall success of a modernization effort. This paper provides a survey of modernization techniques including screen scraping, database gateway, XML integration, CGI integration, object-oriented wrapping, and ¿componentization¿ of legacy systems. This general overview enables engineers performing legacy system modernization to pre-select a subset of applicable modernization techniques for further evaluation.
Semantics of programming languages: a tool-oriented approach
Authors: Jan Heering, Paul Klint
Venue:  (1999)

By paying more attention to semantics-based tool generation, programming language semantics can significantly increase its impact. Ultimately, this may lead to ``Language Design Assistants'''' incorporating substantial amounts of semantic knowledge.
Argument transformation for growing agents with mobility
Authors: Hajime Sawamura, Wataru Kawakami, Yuichi Umeda
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper describes an approach to growing agents that migrates over the computer network and improve the quality of their logical arguments by communicating with and incorporating arguments from other agents. For the argument improvement we introduce three argument transformation rules: the rule and fact replacement rules for information refinement and diversification, and the weak literal replacement rule for information completion.