ppxscal/embedding_network huggingface dataset:
Building Trust into OO Components Using a Genetic Analogy
Authors: Benoit Baudry, Vu Le Hanh, Jean-Marc Jézéquel, Yves Le Traon
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Despite the growing interest for component-based systems, few works tackle the question of the trust we can bring into a component. This paper presents a method and a tool for building trustable OO components. It is particularly adapted to a design-by-contract approach, where the specification is systematically derived into executable assertions (invariant properties, pre/postconditions of methods). A component is seen as an organic set composed of a specification, a given implementation and its embedded test cases.We propose an adaptation of mutation analysis to the OO paradigm that checks the consistency between specification/implementation and tests. Faulty programs, called ¿mutants¿, are generated by systematic fault injection in the implementation. The quality of tests is related to the mutation score, i.e. the proportion of faulty programs it detects. The main contribution of this is to show how a similar idea can be used in the same context to address the problem of effective test optimization. To map the genetic analogy to the test optimization problem, we consider mutant programs to be detected as the initial preys population and test cases as the predators population.The test selection consists of mutating the ¿predator¿ test cases and crossing them over in order to improve their ability to kill the prey population. The feasibility of components validation using such a ¿Darwinian¿ model and its usefulness for test optimization are studied.
Reasoning about Higher-Order Processes
Authors: Roberto Amadio, Mads Dam
Venue:  (1994)

We address the specification and verification problem for process calculi such as Chocs, CML and Facile where processes or functions are transmissible values. Our work takes place in the context of a static treatment of restriction and of a bisimulation-based semantics. As a paradigmatic and simple case we concentrate on (Plain) Chocs. We show that Chocs bisimulation can be characterized by an extension of Hennessy-Milner logic including a constructive implication, or function space constructor. This result is a non-trivial extension of the classical characterization result for labelled transition systems. In the second part of the paper we address the problem of developing a proof system for the verification of process specifications. Building on previous work for CCS we present an infinitary sound and complete proof system for the fragment of the calculus not handling restriction.
Application of Resonant-Tunneling Quaternary Quantizer to Ultrahigh-Speed A/D Converter
Authors: Takao Waho, Masafumi Yamamoto
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

An analog-to-quaternary quantizer using resonant-tunneling (RT) devices is applied to an ultrahigh-speed analog-to-digital (A/D) converter. First, transient analysis results for the quaternary quantizer, which consists of six RT diodes and one HEMT, are presented. A 4-bit A/D (Jconverter employing this quantizer with multiple-valued logic encoding circuits is then described. The number of transistors is one-fifth of that required for conventional A/D converters. SPICE simulation reveals that the present A/D converter can be operated at sampling rates as high as 4 GS/s.
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Authors: Jonathan R Shewchuk
Venue:  (1994)

The Conjugate Gradient Method is the most prominent iterative method for solving sparse systems of linear equations. Unfortunately, many textbook treatments of the topic are written so that even their own authors would be mystified, if they bothered to read their own writing. For this reason, an understanding of the method has been reserved for the elite brilliant few who have painstakingly decoded the mumblings of their forebears. Nevertheless, the Conjugate Gradient Method is a composite of simple, elegant ideas that almost anyone can understand. Of course, a reader as intelligent as yourself will learn them almost effortlessly. The idea of quadratic forms is introduced and used to derive the methods of Steepest Descent, Conjugate Directions, and Conjugate Gradients. Eigenvectors are explained and used to examine the convergence of the Jacobi Method, Steepest Descent, and Conjugate Gradients. Other topics include preconditioning and the nonlinear Conjugate Gradient Method. I have taken pains to make this article easy to read. Sixty-two illustrations are provided. Dense prose is avoided. Concepts are explained in several different ways. Most equations are coupled with an intuitive interpretation.
The Invention of the First Wearable Computer
Authors: Edward O. Thorp
Venue: Proceedings of the 2nd IEEE International Symposium on Wearable Computers (1998)

The first wearable computer was conceived in 1955 by the author to predict roulette, culminating in a joint effort at M.I.T. with Claude Shannon in 1960-61. The final operating version was tested in Shannon's basement home lab in June of 1961. The cigarette pack sized analog device yielded an expected gain of +44% when betting on the most favored "octant." The Shannons and Thorps tested the computer in Las Vegas in the summer of 1961. The predictions there were consistent with the laboratory expected gain of 44% but a minor hardware problem deferred sustained serious betting.We kept the method and the existence of the computer secret until 1966.
The Benefits of Relaxing Punctuality
Authors: Rajeev Alur, Tomas Feder, Thomas A. Henzinger
Venue:  (1994)

Abstract
A Method of Multi-PERT System for Parallel Jobshop Management
Authors: Hiroaki Sugihara, Nobuhiro Kataoka, Teruaki Takahara, Hisao Koizumi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Conflicts between jobs for shared resources happen daily on the manufacturing floor of a job shop production facility. This makes the management of a manufacturing floor rather difficult. In order to solve this problem, we are proposing a system to plan and manage scheduling using multi-PERT. We call this system the Concurrent Scheduling Method (CSM). Under CSM, the job structure of each individual order is clarified during the design stage to determine the production process. The result is detailed in CSM process charts similar to PERT diagrams. These multiplexed job structures are monitored in order to follow the progress. In addition, the schedule for all orders is planned and managed. A schedule planned in this way is able to have the resource utilization maximized fully and the critical path identified clearly. The information regarding the critical path helps to solve the load problem. In this way, the production process of the site is optimized for keeping delivery date. In addition, status changes caused by new orders, delivery date change requests or progress changes can be responded to quickly.
Dreamweaver&reg: MX Complete Course, 1 edition
Authors: Joyce J. Evans
Venue:  (2002)

: This groundbreaking title provides creative design professionals and students with a complete, authoritative curriculum-based course to quickly and easily get them up-to-speed with the latest release of Macromedia Dreamweaver! Teaches the full range of Dreamweaver tools and techniques through the recreation of a working Web site - with all raw artwork included on the CD-ROM! Features stunning four color artwork and glossy white paper throughout for maximum informational value and "wow" appeal! Appropriate for both Mac and Windows! Divided into timed Sessions based on the central project/image. These are chapter-level Divisions that contain the heart of the book: the progressive tutorials! The project starts simply, establishing major design areas with the basic Dreamweaver techniques, and applying the Wow! Factor to each area as the project advances.. The final result is a professional-level competency with Dreamweaver and a beautiful, fully functional Web site. CD-ROM contains all of the files and materials needed for the project. Seybold Seminars is the number-one name in the design and publishing technology field. Author Biography: Joyce J. Evans is an acclaimed author and dynamic communications professional, with over 10 years of experience in educational training, speaking, tutorial development, Web design and usability, she faces every challenge with a genuine concern for the user. She founded, designed and maintains the Idea Design Web site, a Web design studio. In conjunction with the ID Bookstore and other various clients she keeps herself very busy in the online development world. 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
Modified tree structure for location management in mobile environments
Authors: S. Dolev, D. K. Pradham, J. K. Welch
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Suggests a new data structure for location management in mobile networks. The data structure is based on the tree location database structure. The authors suggest replacing the root and some of the higher levels of the tree with another structure that balances the average load of search requests. For this modification they use a set-ary butterfly network, which is a generalization of the well-known k-ary butterfly. They also suggest modifying the lowest level of the tree in order to reflect neighboring geographical regions more accurately and to support simple location data management. The modification of the lowest level also supports simple handoffs. The update of the proposed location database ensures correct location data following any number of transient faults that corrupt the location database information and thus is self-stabilizing.
Task-Level Planning and Task-Directed Sensing for Robots in Uncertain Environments
Authors: Bruce R Donald, James Jennings, Russell Brown
Venue:  (1991)

The primary goal of our research is task-level planning. We approach this goal by utilizing a blend of theory, implementation, and experimentation. We propose to investigate task-level planning for autonomous agents, such as mobile robots, that function in an uncertain environment. These robots typically have very approximate, inaccurate, or minimal models of the environment. For example, although the geometry of its environment is crucial to determining its performance, a mobile robot might only have a partial, or local ``map'''' of the world. Similarly, the expected effects of a robot''s actuators critically influence its selection of actions to accomplish a goal, but a robot may have only a very approximate, or local predictive ability with regard to forward-simulation of a control strategy. While mobile robots are typically equipped with sensors in order to gain information about the world, and to compensate for errors in actuation and prediction, these sensors are noisy, and in turn provide inaccurate information. We propose to investigate an approach whereby the robot attempts to acquire the necessary information about the world by planning a series of experiments using the robot''s sensors and actuators, and building data-structures based on the robot''s observations of these experiments. A key feature of this approach is that the experiments the robot performs should be driven by the information demands of the task. That is, in performing some task, the robot may enter a state in which making progress towards a goal requires more information about the world (or its own state). In this case, the robot should plan experiments which can disambiguate the situation. When this process is driven by the information demands of the task, we believe it is an important algorithmic technique to effect task-directed sensing. Plan projects focus on: 1. A theory of sensor interpretation and task-directed planning using perceptual equivalence classes, intended to be applicable in highly uncertain or unmodelled environments, such as for a mobile robot. 2. Algorithmic techniques for modelling geometric constraints on recognizability, and the building of internal representations (such as maps) using these constraints. 3. Explicit encoding of the information requirements of a task using a lattice (information hierarchy) of recognizable sets, which allows the robot to perform experiments to recognize a situation or a landmark. 4. The synthesis of robust mobot programs using the geometric constraints, constructive recognizability experiments, and uncertainty models imposed by the task. We propose to (a) continue our research and develop the theory fully, (b) use tools and concepts from the geometric theory of planning where appropriate, and (c) extend our theory and the geometric theory of planning where necessary to overcome challenges of the autonomous mobile robot domain. One of our most important goals is to show how our theory can be made constructive and algor
First order heterogeneous agent computations
Authors: Bogdan Stroe, V. S. Subrahmanian
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Eiter et. al. (1999) have developed a semantics for agents built on top of legacy code bases. In this paper, we study positive agents in their setting. Their semantics are given in terms of "ground" status atoms. In this paper, we argue that the requirement of being ground poses a huge computational overhead. We propose a non-ground semantics for heterogeneous agents in which the semantical structures proposed by Eiter et. al. can be succinctly represented. We use this representation to efficiently compute the nonground representations. We describe our algorithms as well as a prototype experimental implementation using which we validate the efficiency gains realized with our new implementation.
Visually-Guided Navigation by Comparing Two-Dimensional Edge Images
Authors: Daniel P. Huttenlocher, Michael E. Leventon, William J. Rucklidge
Venue:  (1994)

We present a method for navigating a robot from an initial position to a specified landmark in its visual field, using a sequence of monocular images. The location of the landmark with respect to the robot is determined using the change in size and location of the landmark in the image, as a function of the motion of the robot. The landmark location is estimated after the first three images are taken, and this estimate is refined as the robot moves. The method can correct for errors in the robot motion, as well as navigate around obstacles. The obstacle avoidance is done using bump sensors, sonar and dead reckoning, rather than visual servoing. The method does not require prior calibration of the camera. We show some examples of the operation of the system.
PhotoShop Elements 2: The Missing Manual, 1 edition
Authors: Jenn Kettell, Richard Binder
Venue:  (2003)

The recent boom in digital camera sales has created a tremendous demand for simple yet powerful photo-editing software. This is because experienced users, as well as amateurs, are quickly outgrowing the program that was originally bundled with their cameras. Fortunately, Photoshop Elements 3, the latest photo-editing software from Adobe, is filling this void. It allows users to achieve high-quality results without the overwhelming complexity of professional-level software. And it's also affordable. As a result, it is the best-selling photo-editing software on the market today. Yet, while Photoshop Elements 3.0 seems to have everything going in its favor, it is missing one very important element: a manual that explains all of its incredible capabilities. To help consumers truly understand this software, there's now Photoshop Elements 3: The Missing Manual. This comprehensive guide from Barbarba Brundage offers page after page of valuable insight into this popular program, making it the only book readers will need on the topic. Photoshop Elements 3: The Missing Manual does a whole lot more than just point out how to straighten photos, crop, and adjust the color and focus. It's a collection of wonderful tips and tricks, from how to make basic selections to advanced color correction strategies, and from classic darkroom techniques to stylized digital effects. Each feature is carefully explained in easy-to-understand language, so that everyone from professional shooters to hobbyists can benefit. Among other lessons, readers will learn how to: Instantly fix flaws using Elements' Quick Fix mode Gain control with sliders, zoom tools, and before and after views Easily organize photos by calendar or keyword label Make dynamic slide shows with transitions, captions, music, and narration Create themed photo email Whether you're a hobbyist or a professional photographer, Photoshop Elements 3: The Missing Manual will help you become a more efficient, sophisticated digital camera user.
Algorithms for Parallel Memory I: Two-Level Memories
Authors: Scott J Vitter, A E M Shriver.
Venue:  (1993)

We provide the first optimal algorithms in terms of the number of input/outputs (I/Os) required between internal memory and multiple secondary storage devices for the problems of sorting, FFT, matrix transposition, standard matrix multiplication, and related problems. Our two-level memory model is new and gives a realistic treatment of {\em parallel block transfer}, in which dureing a single I/O each of the $P$ secondary storage devices can simultaneously transfer a contiguous block of $B$ records. The model pertains to a large-scale uniprocessor system or parallel multiprocessor system with $P$ disks. In addition, the sorting, FFT, permutation network, and standard matrixmultiplication algorithms are typically optimal in terms of the amount of internal processing time. The difficulty in developing optimal algorithms is to cope with the partitioning of memory into $P$ separate physical devices. Our algorithms'' performance can be significantly better than those obtained by the well-known but nonoptimal technique of disk striping. Our optimal sorting algorithm is randomized, but practical; the probability of using more than $\ell$ times the optimal number of I/Os is exponentially small in $\ell$ (log $\ell$)log($M/B$), where $M$ is the internal memory size.
Bidding for Storage Space in a Peer-to-Peer Data Preservation System
Authors: Brian F. Cooper, Hector Garcia-Molina
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Digital archives protect important data collections from failures by making multiple copies at other archives, so that there are always several good copies of a collection. In a cooperative replication network, sites "trade" space, so that each site contributes storage resources to the system and uses storage resources at other sites. Here, we examine bid trading: a mechanism where sites conduct auctions to determine who to trade with. A local site wishing to make a copy of a collection announces how much remote space is needed, and accepts bids for how much of its own space the local site must "pay" to acquire that remote space. We examine the best policies for determining when to call auctions and how much to bid, as well as the effects of "maverick" sites that attempt to subvert the bidding system. Simulations of auction and trading sessions indicate that bid trading can allowsites to achieve higher reliability than the alternative: a system where sites trade equal amounts of space without bidding.
Search with Very Limited Resources
Authors: David Mutchler
Venue:  (1986)

When search resources are highly limited, how should one use acquired information to gain more information? The following probabilistic model (and generalizations of it) is employed to investigate this question in the context of least-cost path algorithms. The arcs in a complete binary tree have value 1 with probability $p$ and $0$ otherwise. A scout expands $n$ arcs on the frontier of the search, each time learning the (randomly assigned) value of the expanded arc. After the $n$ arc expansions, a leaf must be selected with no further guidance. What arcs should the scout expand, given that he or she wishes to minimize the expected sum of the arcs along the path from the root of the tree to the selected leaf? Clearly, the final leaf selection should be any leaf below the frontier node $\beta$ that minimizes the sum of the arcs to the node $\beta$ plus $p$ times the distance from $\beta$ to the bottom of the tree. Let the {\em greedy policy} denote the search strategy that employs an analogous rule for the selected arc to be expanded. The following ``bad news and good news'''' is shown under the assumption that the depth of the tree is at least $n$. (Search resources are {\em very} limited.) {\em Bad news:} no matter how many arc expansions remain, if $p$ is large enough, the greedy decision is {\em not} the optimal decision from certain situations that may arise naturally. {\em Good news: } for $p \leq \frac {1} {2}$, the greedy policy is an optimal search strategy; for $\frac {1} {2} > p \leq .682$, the expected score of the greedy policy is within a constant of the optimal expected score. Strong evidence - both theoretical and empirical - is supplied that the latter statement holds for all values of $p$.
Training fuzzy logic based software components for reuse
Authors: J. Chen, D. C. Rine
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

A training framework of an effective method for off-line training of a class of control software components (for example, for first-order nonlinear feedback control systems) using combinations of three kinds of adaptation algorithms is presented. Each control software component is represented at the abstract level by means of a set of adaptive fuzzy logic (FL) rules and at the concrete level by means of fuzzy membership functions (MBFs). At the concrete representation level adaptation algorithms specified for use in adapting MBFs are: genetic algorithms, neural net algorithms, and Monte Carlo algorithms. We specify effective combinations of these three existing adaptation algorithms to train an erroneous FL rule-based software component in the tracker problem. In the framework, training consists of two phases: testing and adapting. In this paper, only the adapting phase is addressed. For each fault scenario adaptation algorithms and their combinations are used to modify the MBFs of the component. Effectiveness of the adapting phase is determined in terms of flexibility, adaptability, and stability. We perform experiments using a genetic algorithm. Simulation results are discussed.
Dual Graphs on Surfaces
Authors: Vladimir Gurvich
Venue:  (1996)

Consider an embedding of a graph $G$ in a surface $S$ ({\it map}). Assume that the difference splits into connected components ({\it countries}), each one homeomorphic to an open disk. (It follows from this assumption that graph $G$ must be connected). Introduce a graph $G^*$ dual to $G$ realizing the neighbor relations among countries. The graphs $G$ and $G^*$ have the same set of edges. More precisely, there is a natural one-to-one correspondence between their edge-sets. An arbitrary pair of graphs with common set of edges is called a {\it plan}. Every map induces a plan. A plan is called {\it \bf geographic} if it is induced by a map. In terms of Eulerian graphs we obtain criteria for a plan to be geographic. We also give an algorithm of reconstruction a map from a geographic plan. A case when this map is unique is singled out. Partially, these results were announced by Gurvich and Shabat in 1989. 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