ppxscal/embedding_network huggingface dataset:
Correct and Almost Complete Diagnosis of Processor Grids
Authors: Stefano Chessa, Piero Maestrini
Venue:  (1999)

Given a set N of n interconnected processors, some of which may be faulty, the System-Level Diagnosis aims at identifying the faulty processors by analyzing the outcomes of the available interprocessor tests. Execution of a test requires that the involved units be connected. Regular or quasi regular interconnection schemes deserve special attention, due to their widespread use in parallel architectures. The most common approach to the diagnosis of regular systems has been probabilistic, thus leading to results whose correctness can only be evaluated probabilistically. In this paper, a new deterministic algorithm is introduced, which identifies a set F of faulty processors and a set K of non-faulty processors, with F+K=T, which the diagnosis algorithm itself asserts for every specific diagnosis experiment, together with the diagnosis. Results of extensive simulation studies are reported, from which it is seen that the diagnosis can be expected to be complete or almost complete whenever the number of faults is no more than T, and that the degree of completeness remains quite satisfactory as long as the number of faults is below n/3. It is also seen that the diagnosis is almost certainly correct as long as the number of faults is below n/2.
An Impact of Introducing Multi-Level Signals to a Bandpass Cascaded Delta-Sigma Modulator
Authors: Takao Waho, Shin-ya Kobayashi, Koji Matsuura
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

An impact of introducing multi-level signals to abandpass delta-sigma modulator (DSM), which is ofparticular interest for wireless communicationsapplications, has been investigated.A cascaded architecture is studied,since this is favorable to obtain high resolution as well as stability.By increasing the number of the signal levels from two to 16,we have improved the DSM signal-to-noise ratio by 24 dB, or by 4 bits.This amount of improvement is almost the same asthat for conventional lowpass DSMs.Our simulation also indicated that,if a mismatch in intervals between levels was introduced in the DSMs,the noise-shaping characteristics were modified considerably,and the signal-to-noise ratio (SNR) decreases.The dynamic element matching technique,in particular the mismatch-shaping scheme,was proved effective to improve the SNR, even if the mismatch exists.
A Gradient-Based Evidence Measure for Image Matching
Authors: Daniel Scharstein
Venue:  (1994)

We present a simple yet powerful method to perform point-to-point matching between two images. The method uses an \it{evidence measure}, whose value for a given displacement reflects both the similarity between two locations and the confidence in a correct match. The measure is based on the gradient fields of the images, and can be computed quickly and in parallel. Accumulating the evidence measure for different displacements allows (1) stable computation of correspondences without smoothing across motion boundaries, and (2) detection of dominant motions, which can serve as attention cues in active vision systems. The method works well both on highly textured images and on images containing regions of uniform intensities, and can be used for a variety of applications, including stereo vision, motion segmentation, and object tracking.
Dynamic Virtual Private Networks
Authors: Ohad Rodeh, Ken Birman, Mark Hayden
Venue:  (1997)

We generalize traditional support for virtual private networks by introducing mechanisms for dynamic re-keying and membership management. Our approach significantly strengthens the protection properties of virtual private networks, using no new hardware and making no special assumptions about line security. An implementation exhibits low overhead, provides guarantees of authenticity and confidentiality to any IP application running over the virtual network and can be extended to address other network properties. Provided that RSVP is implemented in IP routers and widely deployed, one could also use our architecture to manage QoS on behalf of applications.
On traces for ${\bf H}({\bf curl},\Omega)$ in Lipschitz domains
Authors: A. Buffa, M. Costabel, D. Sheen
Venue:  (2000)

We study tangential vector fields on the boundary of a bounded Lipschitz domain $\Omega$ in $R^3$. Our attention is focused on the definition of suitable Hilbert spaces corresponding to fractional Sobolev regularities and also on the construction of tangential differential operators on the non-smooth manifold. The theory is applied to the characterization of tangential traces for the space ${\bf H}({\bf curl},\Omega)$. Hodge decompositions are provided for the corresponding trace spaces, and an integration by parts formula is proved.
Automatic Repairing of Web Wrappers by Combining Redundant Views
Authors: Boris Chidlovskii
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

We address the problem of automatic maintenance of Web wrappers used in data integration systems to encapsulate an access to Web information providers. The maintenance of Web wrappers is critical as providers often changes the page format and/or structure making wrappers inoperable. The solution we propose extends the conventional wrapper architecture with a novel component of automatic maintenance and recovery. We consider the automaticrecovery as special type of the classification problem and use ensemble methods of machine learning to build alternative views of provider pages. We combine extraction rules of conventional wrappers with content features of extracted information to accurate recovery from three types of format changes, namely, content, context and structural changes. We report results of the recovery performance for format changes at widely used Web providers.
Parallel Depth-First Search in General Directed Graphs
Authors: Alok Aggarwal, J R Anderson, Ming Kao
Venue:  (1990)

A directed cycle separator of an $n$-vertex directed graph is a vertex-simple directed cycle such that when the vertices of the cycle are deleted, the resulting graph has no strongly connected component with more than $n/2$ vertices. It is shown that the problem of finding a directed cycle separator is in randomized NC. It is also proved that computing cycle separators and conducting depth-first search in directed graphs are deterministically NC-equivalent. These two results together yield the first randomized NC algorithm for depth-first search in general directed graphs.
Gestures as Input: Neuroelectric Joysticks and Keyboards
Authors: Kevin R. Wheeler, Charles C. Jorgensen
Venue: IEEE Pervasive Computing (2003)

Electromyogram technology captures gestures as input for neuroelectric joysticks and keyboards and thus could lead to new applications in flight control, space, and the video game industry. The authors describe how they used electrodes to capture the gestures, processed EMG signals from the muscles performing these gestures, and trained hidden Markov models to create systems used to successfully fly simulated aircraft to landings and recognize virtual keystrokes.
Encyclopaedia of Complexity Results for Finite-Horizon Markov Decision Process Problems
Authors: Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender
Venue:  (1997)

The computational complexity of finite horizon policy evaluation and policy existence problems are studied for several policy types and representations of Markov decision processes. In almost all cases, the problems are shown to be complete for their complexity classes; classes range from nondeterministic logarithmic space and probabilistic logarithmic space (highly parallelizable classes) to exponential space. In many cases, this work shows that problems that already were widely believed to be hard to compute are probably intractable (complete for NP, NP^PP , or PSPACE), or provably intractable (EXPTIME-complete or worse). The major contributions of the paper are to pinpoint the complexity of these problems; to isolate the factors that make these problems computationally complex; to show that even problems such as median-policy or average-policy evaluation may be intractable; and the introduction of natural NP^PP-complete problems.
Rabin Measures and Their Applications to Fairness and Automata Theory
Authors: Nils Klarlund, Dexter Kozen
Venue:  (1991)

Rabin conditions are general class of properties of infinite sequences that emcompass most known automata-theoretic acceptance conditions and notions of fairness. In this paper we show how to determine whether a program satisfies a Rabin condition by reasoning about single transitions instead of infinite computations. We introduce a concept, called a Rabin measure, which in a precise sense expresses progress for each transition toward satisfaction of the Rabin condition. When applied to termination problems under fairness constraints, Rabin measures constitute a simpler verification method than previous approaches, which often are syntax-dependent and require recursive applications of proof rules to syntactically transformed programs. Rabin measures also generalize earlier automata-theoretic verification methods. Combined with a result by Safra, our result gives a method for proving that a program satisfies a nondeterministic Buchi automaton specification.
User experience notation for software design how close are we?
Authors: Graham Oakes, Ted Kilian, Geraldine Fitzpatrick
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Various methods and notations (such as UML and RUP) were developed to communicate user requirements into systems desigh. The workshop explores participants' own approaches to ensuring that user requirements are visible throughout the design process.
Exploiting Locality in the Run-Time Parallelization of Irregular Loops
Authors: María J. Martín, David E. Singh, Juan Touriño, Francisco F. Rivera
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

The goal of this work is the efficient parallel execution of loops with indirect array accesses, in order to be embedded in a parallelizing compiler framework. In this kind of loop pattern, dependences can not always be determined at compile-time as, in many cases, they involve input data that are only known at run-time and/or the access pattern is too complex to be analyzed. In this paper we propose run-time strategies for the parallelization of these loops. Our approaches focus not only on extracting parallelism among iterations of the loop, but also on exploiting data access locality to improve memory hierarchy behavior and, thus, theoverall program speedup. Two strategies are proposed: one based on graph partitioning techniques and other based on a block-cyclic distribution. Experimental results show that both strategies are complementary and the choice of the best alternative depends on some features of the loop pattern.
Inferring Body Pose without Tracking Body Parts
Authors: Romer Rosales, Stan Sclaroff
Venue:  (1999)

Abstract A novel approach for estimating articulated body posture and motion from monocular video sequences is proposed. Human pose is defined as the instantaneous two dimensional configuration (i.e., the projection onto the image plane) of a single articulated body in terms of the position of a predetermined set of joints. First, statistical segmentation of the human bodies from the background is performed and low-level visual features are found given the segmented body shape. The goal is to be able to map these, generally low level, visual features to body configurations. The system estimates different mappings, each one with a specific cluster in the visual feature space. Given a set of body motion sequences for training, unsupervised clustering is obtained via the Expectation Maximation algorithm. Then, for each of the clusters, a function is estimated to build the mapping between low-level features to 3D pose. Currently this mapping is modeled by a neural network. Given new visual features, a mapping from each cluster is performed to yield a set of possible poses. From this set, the system selects the most likely pose given the learned probability distribution and the visual feature similarity between hypothesis and input. Performance of the proposed approach is characterized using a new set of known body postures, showing promising results.
A decentralized model-based diagnostic tool for complex systems
Authors: Yannick Pencolé, Marie-Odile Cordier, Laurence Rozé
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

We address the problem of diagnosing complex discrete-event systems such as telecommunication networks. Given a flow of observations from the system, the goal is to explain those observations by identifying and localizing possible faults. Several model-based diagnosis approaches deal with this problem but they need the computation of a global model which is not feasible for complex systems like telecommunication networks. Our contribution is the proposal of a decentralized approach which permits to carry out an on-line diagnosis without computing the global model. This paper describes the implementation of a tool based on this approach. Given a decentralized model of the system and a flow of observations, the program analyzes the flow and computes the diagnosis in a decentralized way. We also present experimental results based on a real system.
Performance analysis of finite output-buffered multistage ATM switching fabrics
Authors: B. Zhou, M. Atiquzzaman
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

A new and accurate Markov chain model for evaluating the performance of multistage ATM switching fabrics with 2/spl times/2 finite output-buffered switching elements is proposed. By comparing the results obtained from the proposed model, existing models, and simulations, it has been shown that the proposed model is much more accurate than existing models in the presence of a non-uniform traffic in the switch. The results from existing models are unsatisfactory in the presence of an increased blocking in the switch arising due to a non-uniform traffic in the switch. On the contrary, the proposed model is very robust even under severe blocking inside the switch.
UHC - A Massively Parallel and Distributed Realisation of Hierarchical Classifier Networks
Authors: K. P. Lam
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In an earlier work on the design of fine-grain, scalable classifiers for massively parallel computers, the technique of unifying cascaded networks has been demonstrated. This paper further examines the method adopted using a highly parallel processing architecture, entitled Unified Hierarchical Classifiers (UHC), based on the principles of Generalized Regression Neural Networks (GRNN). As with the GRNN, it has been shown that the resulting classification network can be implemented efficiently on general-purpose multiprocessor platforms without dedicated hardware for processor interconnections. Adding to this the structural simplicity, and the demonstrable potential for an effective distributed realization on the Cray T3D, will make UHC an attractive classifier architecture in practical applications. 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
Interactive Consistency in Quasi-Asynchronous Systems
Authors: Andre Postma, Thijs Krol
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In order to make a dependable distributed computer system resilient to arbitrary failures of its processors, deterministic interactive consistency algorithms (ICAs) are required. Thus far, in order to guarantee interactive consistency, all ICAs found in the literature require that all correct processors in the system start the algorithm simultaneously. In a distributed system, it is hard to satisfy this requirement. Therefore, in this paper, we describe a new class of self-synchronizing ICAs that guarantee interactive consistency without the above-mentioned requirement.
3-step Fibonacci series modulo m
Authors: Engin Özkan, Hüseyin Aydin, Ramazan Dikici
Venue: Applied Mathematics and Computation (2003)

We have proved two original theorem concerning Wall number of the the 3-step Fibonacci sequences. We give five conjectures concerning 3-step Fibonacci sequence. Furthermore, we also give a computer verification of those conjectures for the primes less than 5 × 105.
Mapping Requirements to Reusable Components Using Design Spaces
Authors: L. Baum, M. Becker, L. Geyer, G. Molter
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

A consistent implementation of component-based reuse bears several implications for the design of the software development process. For instance, requirements engineering has to be tailored to particularly elicit information necessary for selecting and configuring appropriate components. Besides sketching our approach to component-based system development, this paper shows how Design Spaces can be applied to actively support reuse-oriented activities. Design Spaces allow to uniformly describing requirements on and properties of software artifacts, as well as correlations between specific properties. As a con-sequence, they are well suited to guide the requirements capturing towards the properties of existing components, and to map those requirements to component selections and configurations. The paper demonstrates how to consistently deploy the Design Space technique throughout the process, leading to a complete and strongly tool-supported path from requirements capturing to system implementation.
Alternative priority scheduling in dynamic priority systems
Authors: Hyungill Kim, Sungyoung Lee, Jongwon Lee
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The major drawback of the slack-stealing based schedulings for aperiodic requests is a high computational complexity to calculate the slack which in consequence makes them not be practical. In this paper, we present a soft-aperiodic task scheduling algorithm, called Alternative Priority Scheduling (APS), which has a simple slack calculation method in dynamic priority systems. The proposed algorithm has extended the EDF-CTI (Earliest Deadline First-Critical Task Indicating) Algorithm developed by the authors. The APS algorithm references the off-line built CTI table and chooses either an EDF or a CEF (Critical Execution time First) algorithm alternatively at run-time. This paper also demonstrates the optimality of the APS algorithm. Our simulation study shows that the APS algorithm, in most cases, is slightly better than the EDF-CTI algorithm and the other soft-aperiodic schedulings in terms of the short response time of aperiodic requests, and considerably improves the previous algorithms in a high workload.
Are the Interoperability Standards for EDA Too Little/Too Late for Real SoC Designs?
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The panel will examine the emerging interoperability standards and contrast them to the time to market requirements for current designs. There are supporting statements for interoperability standards. However, there are concerns about the results and the delayed delivery. The proposed interoperability standards may not address features of the process technology at the time standards are adopted A second issue facing the design community is the impact on the product specific design methodologies used and the cost in time/money to shift to new methodologies required for these tools that may be more homogenized than optimized for particular types of SOC. Additional issues include support issues for the flow for the standards vs custom flows, point tools vs sub-flow tools, data reuse and migration vs new data creation for use in the current tools, and tool directions and roadblocks for advanced (sub 0.10um) DSM processes. The panel is comprised of EDA, Foundry, Semiconductor Manufacturers, and Design Centers who will discuss their experiences with in-house developed flows, multi-vendor flows based on multiple APIs and the time-to-market tradeoffs of these solutions as an alternative to the 2-3 year delay waiting for committee based standards. 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
The Networked Computer Science Technical Report Library
Authors: James R. Davis, Carl Lagoze
Venue:  (1996)

The Networked Computer Science Technical Report Library (NCSTRL) is a distributed digital library of research results from computer science departments and laboratories in the USA and abroad. NCSTRL benefits readers, authors, and departments. Researchers throughout the world can use familiar Internet tools (the World Wide Web) to search for, browse, read, and download technical reports from participating institutions. Authors benefit by reaching a wider audience. Departments gain a clean, effective management system for distributing their technical reports and eliminate much of their current copying and mailing charges. This article describes the design of NCSTRL, its historical basis in earlier work, and the expected course of the development.
A Client-Server Approach to Virtually Synchronous Group Multicast: Specifications and Algorithms
Authors: Idit Keidar, Roger I. Khazan
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

This paper presents a formal design for a novel group multicast service that provides virtually synchronous semantics in asynchronous fault-prone environments. The design employs a client-server architecture in which group membership is maintained not by every process but while virtually synchronous group only dedicated membership servers implement multicast implemented by service end-points running at the clients.Specifically, the paper defines service semantics for the client-server interface, that is, for the group membership service. The paper then specifies virtually synchronous semantics for the new group multicast service, as a collection of commonly used safety and liveness properties. Finally, the paper presents new algorithms that use the defined group membership service to implement the specified properties. The algorithm that provides the complete virtually synchronous semantics executes in a single message round in parallel with the membership service's agreement on views, and is therefore more efficient than previously suggested algorithms providing such semantics.