ppxscal/embedding_network huggingface dataset:
Planning Multi-Step Error Detection and Recovery Strategies
Authors: Bruce R Donald
Venue:  (1987)

Robots must plan and execute tasks in the presence of uncertainty. Uncertainty arises from sensing errors, control errors, and uncertainty in the geometry of the environment. By employing a combined strategy of force and position control, a robot programmer can often guarantee reaching the desired final configuration from all the likely initial configurations. Such motion strategies permit robots to carry out tasks in the presence of significant uncertainty. However, compliant motion strategies are very difficult for humans to specify-for this reason we have been working on the automatic synthesis of motion strategies for robots. In previous work [D], we presented a framework for computing one-step motion strategies that are guaranteed to succeed in the presence of all three kinds of uncertainty. The motion strategies comprise sensor-based gross motions, compliant motions, and simple pushing motions. However, it is not always possible to find plans that are guaranteed to succeed. For example, if tolerancing errors render an assembly infeasible, the plan executor should stop and signal failure. In such cases the insistence on guaranteed success is too restrictive. For this reason we investigate Error Detection and Recovery (EDR) strategies. EDR plans will succeed or fail recognizably: in these more general strategies, there is no possibility that the plan will fail without the executor realizing it. The EDR framework fills a gap when guaranteed plans cannot be found or do not exist: it provides a technology for constructing plans that might work, but fail in a ``reasonable'''' way when they cannot. We describe techniques for planning multi-step EDR strategies in the presence of uncertainty. Multi-step strategies are considerably more difficult to generate, and we introduce three approaches for their synthesis: these are the Push-forward Algorithm, Failure Mode Analysis, and the Weak EDR Theory. We have implemented the theory in the form of a planner, called LIMITED, in the domain of planar assemblies.
A systemic approach for the formalization of the information systems concept: why information systems are systems?
Authors: Manuel Mora, Ovsei Gelman, Francisco Cervantes, Marcelo Mejía, Alfredro Weitzenfeld
Venue: Critical reflections on information systems: a systemic approach (2003)

In the new economic context, based on Information and Knowledge resources, the concepts of Information Systems and Information Technology (IS&IT) are fundamental to understand the organizational and managerial process in all levels: strategic, tactic and operational. From an academic and practitioner perspective, we pose that the correct use of the concept of IS&IT, and in specific of Information Systems, is critical. First ones need to study the same object and second ones need to use the same common conceptual knowledge about what are Information Systems. Nevertheless, uniquely informal and semiformal definitions of Information Systems have been reported in the literature and thus a formal definition based on core systemic foundations is missing. For these reasons, the conceptualization and formal definition of what are Information Systems acquires a relevant research and praxis status. This chapter addresses this problematic situation posing a formal definition of the term Information Systems based on core theoretical principles of the Systems Approach. For that, we firstly review the foundations of Systems Approach to establish the basis for our conceptual development. Then, an updated formal definition of the core concept System originally developed by Gelman and Garcia (1989) and that incorporates new insights from other systemic researchers is presented. With these theoretical bases, we proceed to review the contributions and limitations of main informal and semiformal definitions of the term Information Systems reported at the literature. Then the new formal definition of this term is developed using the updated formal definition of the term System. We continue with a discussion of how the definition posed formalizes systemic concepts of previous definitions, of how these are partial cases of the new definition and of how it can be used to model and study Information Systems in organizations. Finally, we conclude with main remarks and implications of this definition and with directions for further research.
Robust Functional Equations with Applications to Self-Testing/Correcting
Authors: Ronitt Rubinfeld
Venue:  (1994)

The idea of self-testing/correcting programs, introduced in [BLR90], is a powerful tool for attacking the problem of program correctness. However, one of the main criticisms of this approach was that it seemed to have limited scope, applying only to linear and low degree polynomial functions. This paper provides results which show that the concept of self-testing/correcting has much broader applications than we previously understood. We concentrate on functions $f$ satisfying functional equations, in particular, those of the form $\forall x,y~~ F[f(x-y), f(x+y), f(x),f(y)]=0$, where $F$ is an algebraic function. We show that self-testers and self-correctors can be found for many such functions, including $\tan{x},{1 \over {1+\cot{x}}}, {Ax \over {1-Ax}},\cosh{x}$. We make an initial attempt at characterizing properties of functional equations that make them useful for self-testing and self-correcting.
The Mortar Wavelet Method
Authors: S. Bertoluzza, V. Perrier
Venue:  (1999)

This paper deals with the construction of wavelet approximation spaces, in the framework of the Mortar method. We briefly describe the construction of a class of MultiResolution Analyses which are well suited for application by the Mortar method approach, and then we sketch the Mortar Wavelet method for the Laplace-Dirichlet problem for which we give an error estimate. Numerical tests show the feasibility of the method proposed.
Incremental Motion-Based Location Recognition
Authors: Seon-Woo Lee, Kenji Mase
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

This paper describes a method to recognize the current location of a user using a few simple sensors. The proposed method is based on the integration of incremental motions (e.g., walking) over time to determine location transitions. To handle uncertainty, a fuzzy reasoning method is introduced. The paper also describes a prototype location recognition system that uses a set of inexpensive and wearable sensors, a bi-axial accelerometer and a digital compass. The system uses a reliable motion recognition method featuring only two directional acceleration measurements. The effectiveness of the proposed method is demonstrated by experiments at six locations in an indoor environment.
Diagnosing Double Regular Systems
Authors: Endre Boros, Tonguc Unluyurt
Venue:  (1997)

We consider the problem of testing sequentially the components of a double regular system, when the testing of each component is costly. Generalizing earlier results about $k$-out-of-$n$ systems, we provide a polynomial time algorithm for the most cost-effficient sequential testing of double regular systems. The algorithm can be implemented to work efficiently both for explicitly given systems, and for systems given by an oracle.
A+ Complete Study Guide, Deluxe Edition, 2 edition
Authors: David Groth
Venue:  (2003)

:Here's the book you need to prepare for the A+ Core Hardware and Operating System Technologies exams. This proven Sybex Study Guide provides In-depth coverage of every exam objectiveall the information you need Practical information on essential hardware- and OS-related tasks Hundreds of challenging review questions, in the book and on the CD Leading-edge exam preparation software, including our custom testing engine and electronic flashcards Featured on the CDs The first CD is packed with vital preparation tools and materials, beginning with the Sybex EdgeTest testing engine, which lets you check your knowledge of the material and review areas according to objective. With it you get six bonus exams, electronic flashcards for your PC and Palm handhelds, and a fully searchable electronic version of this book. The second CD features twenty instructional videos. Ranging in length from two to five minutes and highlighted at relevant spots throughout the book, they cover the essential hands-on tasks and techniques you must master to earn your certification.
Parametric studies on cyclically loaded exterior beam-column joints
Authors: P. G. Bakir, M. H. Boduroglu
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Over the last 30 years, significant amount of research has been carried out on cyclically loaded exterior beam-column joints. In spite of the cumulated data, there is still no consensus between the research circles regarding the factors affecting the joint shear strength. The aim of this paper is to investigate the influence of different parameters on the joint shear strength. For this purpose, an experimental database consisting of 60 cyclically loaded exterior beam-column joints is used. Several parametric studies are carried out on the experimental database. It is apparent from these parametric studies that the joint shear strength increases as the beam longitudinal reinforcement ratio, and the concrete cylinder strength increase. The joint shear strength decreases when the joint aspect ratio increases.
Behavioral Simulation of Power Line Noise Coupling in Mixed-Signal Systems using SystemC
Authors: Jan Lundgren, Bengt Oelmann, Trond Ytterdal, Patrik Eriksson, Munir Abdalla, Mattias O'Nils
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper presents methods for early quantification ofdigital to analog noise coupling at behavioral level. Themethods enable designers to both verify the behavior oftheir mixed-signal architecture and its sensitivity to noisecoupling. The high-level noise coupling simulation modelsare implemented as extensions to SystemC.
Extended Stochastic Petri Nets: Applications and Analysis
Authors: B J Dugan, S K Trivedi, Robert Geist, Victor Nicola
Venue:  (1984)

An Extended Stochastic Petri Net (ESPN) model, useful for modeling systems which exhibit concurrent, asynchronous, or nondeterministic behavior is developed. Applications demonstrating the flexibility of the model for a variety of system modeling applications are presented. Analytic techniques for the representation of a class of ESPNs as Markov or semi-Markov processes are discussed, as in the simulation of more general models. Finally, DEEP (The Duke ESPN Evaluation Package) is previewed.
In-Place Reconstruction of Version Differences
Authors: Randal Burns, Larry Stockmeyer, Darrell D. E. Long
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

In-place reconstruction of differenced data allows information on devices with limited storage capacity to be updated efficiently over low-bandwidth channels. Differencing encodes a version of data compactly as a set of changes from a previous version. Transmitting updates to data as a version difference saves both time and bandwidth. In-place reconstruction rebuilds the new version of the data in the storage or memory the current version occupies—no scratch space is needed for a second version. By combining these technologies, we support highly mobile applications on space-constrained hardware. We present an algorithm that modifies a differentially encoded version to be in-place reconstructible. The algorithm trades a small amount of compression to achieve this property. Our treatment includes experimental results that show our implementation to be efficient in space and time and verify that compression losses are small. Also, we give results on the computational complexity of performing this modification while minimizing lost compression.
Communication Kernel for High Speed Networks in the Parallel Environment LANDA-HSN
Authors: Thierry Monteil, Jean Marie Garcia, David Gauchard, Olivier Brun
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Due to the development of several new technologies concerning high speed networks, one can get PC clusters for intensive computing at a low price. Parallel programming environments must take into account the heterogeneity of workstation networks into their communication kernels. New technologies must be easily integrated into such environments. The LANDA-HSN project has been designed for an efficient use of the available resources (network, processor, memory). This paper describes the mechanisms and the implementation of its communication kernel on SMP hosts and through interconnection networks. The contribution of this paper is to propose a flexible and efficient communication kernel.
A Consistent and Complete Deductive System for the Verification of Parallel Programs
Authors: Susan S. Owicki
Venue:  (1976)

The semantics of a simple parallel programming language is presented in two ways: deductively, by a set of Hoare-like axioms and inference rules, and operationally, by means of an interpreter. It is shown that the deductive system is consistent with the interpreter. It would be desirable to show that the deductive system is also complete with respect to the interpreter, but this is impossible since the programming language contains the natural numbers. Instead it is proven that the deductive system is complete relative to a complete proof system for the natural numbers; this result is similar to Cook''s relative completeness for sequential programs. The deductive semantics given here is an extension of an incomplete deductive system proposed by Hoare. The key difference is an additional inference rule which provides for the introduction of auxiliary variables in a program to be verified.
A Case Study on Participatory Redesign of Web Site with Scenario-Based Techniques
Authors: Kentaro Go, Tomokazu Takahashi, Atsumi Imamiya
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Participatory design has been used to bring user requirements into design of interactive multimedia systems. The case study of participatory design, discussed in this paper, employs scenario-based techniques for redesigning a Web site of Computer Science Department. It reveals that scenarios can encourage real users to participate in redesign activities and to identify usability problems on Web sites, yet they may feel that scenario writing process becomes an effort. This paper discusses some issues on conducting scenario-based participatory redesign of Web sites also.
On the Power of Multiplication in Random Access Machines
Authors: Juris Hartmanis, Janos Simon
Venue:  (1974)

We consider random access machines with a multiplication operation, having the added capability of computing logical operations on bit vectors in parallel. The contents of a register are considered both as an integer and as a vector of bits and both arithmetic and boolean operations may be used on the same register. We prove that, counting one operation as a unit of time and considering the machines as acceptors, deterministic and non-deterministic polynomial time acceptable languages are the same, and are exactly the languages recognizable in polynomial tape by Turing machines. We observe that the same measure on machines without multiplication is polynomially related to Turing machine time thus the added computational power due to multiplication in random access machines is equivalent to the computaitonal power which polynomially tape-bounded Turing machine computations have over polynomially time-bounded computations. Therefore, in this formulation, it is not harder to multiply than to add if and only if PTAPE=PTIME for Turing machines. We also discuss other instruction sets for random access machines and their computational power.
Improving on Service-Customizing for Applications in PGPS-Based IntServ/RSVP Architecture
Authors: Yan Cheng, Boxuan Gu, Xiaojun Ma, Guanqun Gu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

The future Internet is expected to support applications with quality o service (QoS) requirements. For this end several mechanisms are suggested in the IETF to supportsignaling, one of the most promising among them is IntServ. In this paper, we study the relationship between the QoS implementing mechanism and application demands,and make a set o an improved application interface beyond the stand RSVP API. Our goal is to provide an API friendly to applications, through extracting the key elements from the traffic parameters and reservation parameters which should be opaque toapplications.
Analysis of a Variable Time-step Discretization of the Three-Dimensional Fr\''emond Model for Shape Memory Alloys
Authors: Ulisse Stefanelli
Venue:  (1999)

This paper deals with a semi-implicit time discretization with variable step of a three-dimensional Fr\''emond model for shape memory alloys. Global existence and uniqueness of a solution is discussed. Moreover, an {\em a priori} estimate for the discretization error is recovered. The latter depends solely on data, imposes no constraints between consecutive time steps, and shows an optimal order of convergence when referred to a simplified model. TEL:: +39-382-505628 KEYWORDS:: Shape memory alloys, time discretization, existence and uniqueness, error estimate EMAIL:: ulisse@dimat.unipv.it
L-fuzzy valued inclusion measure, L-fuzzy similarity and L-fuzzy distance
Authors: A. Kehagias, M. Konstantinidou
Venue: Fuzzy Sets and Systems (2003)

The starting point of this paper is the introduction of a new measure of inclusion of fuzzy set A in fuzzy set B. Previously used inclusion measures take values in the interval [0, 1]; the inclusion measure proposed here takes values in a Boolean lattice. In other words, an inclusion is viewed as an L-fuzzy valued relation between fuzzy sets. This relation is reflexive, antisymmetric and transitive, i.e. it is a fuzzy order relation; in addition, it possesess a number of properties which various authors have postulated as axiomatically appropriate for an inclusion measure. We also define an L-fuzzy valued measure of similarity between fuzzy sets and an L-fuzzy valued distance function between fuzzy sets; these possess properties analogous to the ones of real-valued similarity and distance functions.
Cyclic codes of length 2e over Z4
Authors: Taher Abualrub, Robert Oehmke
Venue: Discrete Applied Mathematics (2003)

Cyclic codes of odd length over Z4 have been studied by many authors. But what is the form of cylic codes of even length? The structure of cyclic codes of length n = 2e, for any positive integer e is considered. We show that any cyclic code is an ideal in the ring Rn=Z4[x]/〈xn - 1〉. We show that the ring Rn is a local ring but not a principal ideal ring. Also, we find the set of generators for cyclic codes. Examples of cyclic codes of such length are given.
CMU Very Fast Range-Imaging System
Authors: Shigeyuki Tada, Andrew Gruss, Takeo Kanade
Venue:  (1993)

We present a high-speed range-imaging system based on a VLSI computational sensor developed in the CMU Computer Science Department. The VLSI range sensor is a custom chip consisting of an array of cells which combine photo-sensing and computation. Unlike conventional "step-and-repeat" light-stripe range finders, our sensor gathers range images in parallel as a scene is swept by a continuously moving plane of light. A prototype range-finding system has been built using a second-generation sensor and is capable of acquiring a 32 x 32 point frame of 3-D measurements in a millisecond --- two orders of magnitude faster than currently available range-finding systems. The accuracy and the repeatability of the acquired range data has been measured to be less than 0.2%. In this paper, we discuss the range-finding system and present experimental results that measure its performance.
Confidence-Based Reliability And Statistical Coverage Estimation
Authors: W. E. Howden
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

In confidence-based reliability measurement, we determine that we are at least C confident that the probability of a program failing is less than or equal to a bound B. The basic results of this approach are reviewed and several additional results are introduced, including the adaptive sampling theorem which shows how confidence can be computed when faults are corrected as they appear in the testing process. Another result shows how to carry out testing in parallel. Some of the problems of statistical testing are discussed and an alternative method for establishing reliability called statistical coverage is introduced. At the cost of making reliability estimates that are relative to a fault model, statistical coverage eliminates the need for output validation during reliability estimation and allows the incorporation of non-statistical testing results into the statistical reliability estimation process. Statistical testing and statistical coverage are compared, and their relationship with traditional reliability growth modeling approaches is briefly discussed.
Recording and Retrieving Spatial Information with Video and Images
Venue: Proceedings of the International Conference on Information Visualisation (2000)

A pilot web site study for comparative exploration of heritage landscapes and great European gardens have raised issues about the size and complexity of the datasets and the need to record locational and other metadata with visual and aural images. Such multimedia datasets deployed from spatial databases are likely to become served on demand with appropriate associated detail and data. Previous work on the Tower of London and its environs has shown that similar large complex datasets are increasingly common during the creation and management of 3D models of buildings and urban areas. Such datasets may also encompass digital video and high-resolution images, historical images and data, with maintenance and management information and record drawings. Little difference has been found in practice between the data management and retrieval issues that apply to web-based multimedia interpretations of historic environments and those that are particular to large area 3D models. A common approach may serve an initial web site based outcome and assist later development of a virtual reality 3D model. The question of when it is useful to model and when video or high-resolution images may be equally or more useful is also examined.
On the Global Convergence of Broyden''s Method
Authors: Jorge J. More, J. A. Trangenstein
Venue:  (1974)

We consider Broyden''s 1965 method for solving nonlinear equations. If the mapping is linear, then a simple modification of this method guarantees global and Q-superlinear convergence. For nonlinear mappings it is shown that the hybrid strategy for nonlinear equations due to Powell leads to R-superlinear convergence provided the search directions from a uniformly linearly indepenent sequence. We then explore this last concept and its connection with Broyden''s method. Finally, we point out how the above results extend to Powell''s symmetric version of Broyden''s method.
DesignoftheSelf-EducationRoboticsSystem
Authors: Andriy I. Shevchenko
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The design of self-education (self-training) autonomus robotics system is described in this paper. Also, the practical model of the robotics system is present. 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