ppxscal/embedding_network huggingface dataset:
Probability-One Homotopy Algorithms for Robust Controller Analysis and Synthesis with Fixed-Structure Multipliers
Authors: Emmanuel G. Collins, Wassim M. Haddad, Layne T. Watson
Venue:  (1996)

To enable the development of M-K (i.e., multiplier-controller) iteration schemes that do not require (suboptimal) curve fitting, mixed structured singular value analysis tests that allow the structure of the multipliers to a priori be specified, have been developed. These tests have recently been formulated as linear matrix inequality (LMI) feasibility problems. The least conservative of these tests always results in unstable multipliers and hence requires a stable coprime factorization of the multiplier before the control synthesis phase of the M-K iteration. This paper first reviews the LMI formulations of robustness analysis. It then develops alternative formulations that directly synthesize the stable factorizations and are based on the existence of positive definite solutions to certain Riccati equations. These problems, unlike the LMI problems, are not convex. The feasibility problem is approached by posing an associated optimization problem that cannot be solved using standard descent methods. Hence, we develop probability-one homotopy algorithms to find a solution. These results easily extend to provide computationally tractable algorithms for fixed-architecture, robust control design, which appear to have some advantages over the bilinear matrix inequality (BMI) approaches resulting from extensions of the LMI framework for robustness analysis.
A Compositional Framework for Fault-Tolerance by Specification Transformation
Authors: Doron Peled, M. Joseph
Venue:  (1993)

The incorporation of a recovery algorithm into a program can be viewed as a program transformation, converting the basic program into a fault-tolerant version. We present a framework in which such program transformations are accompanied by a corresponding formula transformation which obtains properties of the fault-tolerant versions of the programs from properties of the basic programs. Compositionality is achieved when every property of the fault-tolerant version can be obtained from a transformed property of the basic program. A verification method for proving the correctness of formula transformations is presented. This makes it possible to prove just once that a formula transformation corresponds to a program transformation, removing the need to prove separately the correctness of each transformed program. Keywords: Parallel Algorithms, Distributed Algorithms, Fault-Tolerance, Specification, Verification.
Evolutionary generation of regrasping motion
Authors: Yasuhisa Hasegawa, Toshio Fukuda
Venue: Advances in evolutionary computing: theory and applications (2003)

In this chapter, we propose a generation method for the regrasping motion of a four-fingered robot hand using evolutionary programming (EP). The control of multi-fingered robot hands has been the subject of recent interest. To generate a regrasping motion for an object, there are many parameters to be determined, such as the grasping points, grasping forces, regrasping phases, finger allocation and so on. It is difficult to optimize such manipulation parameters for achieving dexterous manipulation. The evolutionary optimization method is generally able to find optimal solutions without supervision after much iteration, which makes it almost impractical to apply it in a real environment directly. Therefore we apply the controller generated in numerical simulations to control a real four-fingered robot hand. We show the effectiveness of the proposed method for the regrasping motion in our experimental results.
The Role of Formal Specification in Rule-Based Real-Time AI (Extended Abstract)
Authors: I. D. Craig
Venue:  (1991)

This paper describes the role of formal specification in the development of AI systems: it is seen as an important step in the development of reliable real-time AI systems. It discusses some of the issues involved in formal specification and their relationship to current practise and theory. Three completed specifications are described. The paper describes the use of formal methods in the development of AI interpreters and relates formal methods at this level to work in knowledge representation. The role of formal specification in the modelling of experimental systems is also discussed.
A Survey of Simulation Tools for Requirements Engineering
Authors: Reto Schmid, Johannes Ryser, Stefan Berner, Martin Glinz, Ralf Reutemann, Erwin Fahr
Venue:  (2000)

Validation of requirements specifications is undoubtly an integral and indispensable part of requirements engineering.Validation is the process of checking whether requirements specifications meet the intentions and expectations of the stakeholders. One approach to support the process of validation is based on simulation/execution and animation of system (behaviour)models t at are derived from initial requirements specifications.However,the benefit of executable models is determined by the capabilities of the corresponding simulation tools.This paper presents a survey on simulation and animation capabilities of ten modern software/system engineering tools.
FEASIBILITY STUDY ON THE COSTS OF IDDQ TESTING IN CMOS CIRCUITS
Authors: F. J Ferguson, Tracy Larrabee
Venue:  (1991)

Many manufacturing defects in static CMOS circuits are not detected by tests generated using the traditional single stuck-at fault model. Many of these defects may be detected as increased propagation delay or as excessive quiescent power supply current (I_DDQ). In this paper we compare the costs of detecting probable manufacturing defects by the resulting excess I_DDQ with the costs of traditional logical testing methods.
TRAINING AN ANIMATED ARM TO REACH FOR OBJECTS IN SPACE USINGNEURAL NETWORKS (M.S. Thesis)
Authors: Jeanne M Rich
Venue:  (1989)

In the past, large amounts of user effort have been required to create acceptable animations in commonly used motion control systems for animation. In order to reduce user effort, research in computer animation has been directed towards automatic motion control systems. A new method of automatic motion control using neural networks (also known as connectionist models) is examined as one possible means of reducing user effort. The main objective of such a method is to train a neural network to control the inbetween motion given only the start and goal positions. If using neural networks is an appropriate method for automatic motion control, not only would it have applications in computer animation but robotics as well. In order to analyze the feasibility of using neural networks for automatic motion control, the simple motion of an arm reaching for an object in a two dimensional world was used. Initially, a multi-layered feed-forward network was trained to predict the position of an arm at the following time frame, given only the position of the arm at the current time frame and its relative position from the object. After the network was trained using the back-propagation learning algorithm, the performance of the network was tested, producing an animated motion that was far from acceptable, even though the network''s training performance leveled off to a low mean error. It was also discovered that a highly acceptable animated motion could be produced when the network continued to be trained during the testing phase. Other network configurations and data representations were also explored to lower the mean error during training and to produce more promising arm motions. The results of this research indicate that many of the simpler techniques that have been suggested in the neural net literature simply don''t work for automatic motion control. However, more sophisticated techniques may show some promise, even though the results of this research are inconclusive. 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
Characterisation Based Bottleneck Analysis of Parallel Systems
Authors: M. J. Zemerly, J. Papay, Graham R. Nudd
Venue:  (1995)

Bottleneck analysis plays an important role in the early design of parallel computers and programs. In this paper a methodology for bottleneck analysis based on an instruction level characterisation technique is presented. The methodology is based on the assumption that a bottleneck is cauused by the slowest component of a computing system. These components are: memory (internal, external), processor (ALU, FPU), communication and I/O. Three metrics were used to identify bottlenecks in the system components. These are the B-ration, the communications-computation ratio and the memory-processing ratio. These ratios are dimensionless with values greater than unity indicates the presence of a bottleneck. The methodology is illustrated and validated using a communication intensive linear solver algorithm (Gauss-Jordan elimination) which was implemented on a mesh connected distributed memory parallel computer (128 T800 Parystec SuperCluster).
Supporting Worker Independence in Collaboration Transparency
Authors: Begole James "Bo", Rosson Mary Beth, Shaffer Clifford A.
Venue:  (1998)

Conventional collaboration-transparency systems are inefficient in their use of network resources and lack support for key groupware principles: concurrent work, relaxed WYSIWIS, and group awareness. We present an alternative implementation approach to collaboration transparency that provides many features previously seen only in collaboration-aware applications. Our approach is based on an object-oriented replicated architecture where selected single-user interface objects are dynamically replaced by multi-user extensions. The replacement is transparent to the single-user application and its developer. As an instance of this approach, we describe its incorporation into a new Java-based collaboration-transparency system, called Flexible JAMM. We conducted an empirical study to evaluate the effectiveness of Flexible JAMM versus a representative conventional collaboration-transparency system, NetMeeting. Completion times were significantly faster in a loosely-coupled task using Flexible JAMM, and were not adversely affected in a tightly-coupled task. Accuracy was unaffected by the system used. Participants greatly preferred Flexible JAMM. The evaluation validates our aim of supporting multiple styles of collaboration.
Hierarchical Constraint Satisfaction as a Model for Adding Types withInheritance to Prolog
Authors: Chandan Chitale, John Deighan, John W. Roach
Venue:  (1990)

Prolog is a language based on first order logic. It uses resolution as a rule of inference, and unification is the heart of resolution. Prolog operates on the Herbrand universe, a single, unstructured domain. In problems with large structured domains, the number of resolution steps may become large. We have incorporated type inheritance into Prolog to exploit large structured domains to write more concise code and to obtain shorter proofs. Types are subuniverses corresponding to sets of objects. The subset of relation between types induces a hierarchy on the universe. We used the hierarchical constraint satisfaction concept to incorporate these extensions into Prolog. We also provide a formal proof that our typed unification extends standard Prolog and directly augments the Warren Abstract Machine (WAM) concept.
Dynamic Load Distribution Optimization in Heterogeneous MultipleProcessor Systems
Authors: Emile K. Haddad
Venue:  (1993)

We examine the problem of optimizing the distribution of the m interacting modules of a given work load on a parallel system with p heterogeneous processors. Average-valued parameters are used to model the intermodule coupling of the work load and its execution and communication times on the diverse system processors. We derive an analytical optimality criterion to minimize a multi-metric objective function representing a weighted combination of work load completion time, communication cost, resource utilization cost, and processor idle-time.
Methods and Problems of Wavelength-Routing in All-Optical Networks
Authors: Ralf Klasing
Venue:  (1998)

We give a survey of recent theoretical results obtained for wavelength-routing in all-optical networks. The survey is based on the previous survey in [Beauquier, B., Bermond, J-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising from wavelength-routing in all-optical networks. In: Proc. of the 2nd Workshop on Optics and Computer Science, part of IPPS''97, 1997]. We focus our survey on the current research directions and on the used methods. We also state several open problems connected with this line of research, and give an overview of several related research directions.
Plagiarism in Programming Assignments
Authors: Mike Joy, Michael Luck
Venue:  (1998)

There number of students following programming courses is steadily increasing at the same time as access to computers and networks is readily available. There is a significant minority of students who -- for a variety of reasons -- take advantage of the available technology and illicitly copy other students'' programming assignments and attempt to disguise their deception. Software that can help tutors to detect plagiarism is therefore of immense assistance in detecting -- and so helping to prevent -- such abuse. We introduce a novel approach to designing such software which performs well in comparison to sophisticated software available elsewhere, yet is simple both in concept an in implementation. Our approach reduces substantially the effort needed to upgrade to new programming languages, and has been tested on a variety of classes and several different programming languages.
Scenic Trails Ascending from Sea-Level Nim to Alpine Chess
Authors: A. S. Fraenkel
Venue:  (1994)

Aim: Present a systematic development of part of the theory of combinatorial games from the ground up. Approach: Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies. Methodology: Divide and conquer. Ascend from Nim to chess in small strides at a gradient that''s not too steep. Presentation: Informal; examples of games sampled from various strategic viewing points along scenic mountain trails, which illustrate the theory.
TCG-2: a test-case generator for non-linear parameter optimisation techniques
Authors: Zbigniew Michalewicz, Martin Schmidt
Venue: Advances in evolutionary computing: theory and applications (2003)

The experimental results reported in many papers suggest that making an appropriate a priori choice of an evolutionary method for a non-linear parameter optimisation problem remains an open question. It seems that the most promising approach at this stage of research is experimental, involving a design of a scalable test suite of constrained optimisation problems, in which many features could be tuned easily. It would then be possible to evaluate the merits and drawbacks of the available methods as well as test new methods efficiently. In this chapter, we discuss a new test-case generator for constrained parameter optimisation techniques, which deals with deficiencies of the generators proposed earlier. This generator, TCG-2, is capable of creating various test problems with different characteristics, including the dimensionality of the problem, number of local optima, number of active constraints at the optimum, topology of the feasible search space, etc. Such a test-case generator is very useful for analysing and comparing different constraint-handling techniques.
Numerical Simulations of Semiconductor Devices by Streamline-Diffusion Methods
Authors: Xunlei Jiang
Venue:  (1995)

Theoretical and practical aspects of the design and implementation of the streamline-diffusion (SD) method for semiconductor device models are explored systematically. Emphasis is placed on the hydrodynamic (HD) model, which is computationally more challenging than the drift-diffusion (DD) model, but provides some important physical information missing in the DD model. We devise a non-symmetric SD method for device simulations. This numerical method is uniformly used for the HD model (including a proposed simplification (SHD)) and the DD model. An appropriate SD operator is derived for the general non-symmetric convection-diffusion system. Linear stability analysis shows that our proposed numerical method is stable if the system can be symmetrized. Stability arguments and numerical experiments also suggest that the combination of the method of lines and the semi-discrete SD method may not be appropriate for the transient problem, a fact which often has been ignored in the literature. An efficient method, consistent with the SD method used for conservation laws, is developed for the potential equation. The method produces a more accurate electric field than the conventional Galerkin method. Moreover, it solves for the potential and electric field in a decoupled manner. We apply our numerical method to the diode and MESFET devices. Shocks for the diode in one and two space dimensions and the electron depletion near the gate for the MESFET in two space dimensions are simulated. Model comparisons are implemented. We observe that the difference in solutions between the HD and DD models is significant. The solution discrepancy between the full HD and SHD models is almost negligible in MESFET simulation, as in many other engineering applications. However, an exceptional case is found in our experiments. 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
Collocation Software for Boundary Value Differential - Algebraic Equations
Authors: Uri M. Ascher, Raymond J. Spiteri
Venue:  (1992)

We describe the methods and implementation of a general-purpose code, COLDAE. This code can solve boundary value problems for nonlinear systems of semi-explicit differential-algebraic equations (DAEs) of index at most 2. Fully implicit index-1 boundary value DAE problems can be handled as well. The code COLDAE is an extension of the package COLNEW (COLSYS) for solving boundary value ODEs. The implemented method is piecewise polynomial collocation at Gaussian points, extended as needed by the projection method of Ascher-Petzold. For general semi-explicit index-2 problems, as well as for fully implicit index-1 problems, we define a {\em selective projected collocation} method, and demonstrate its use. The mesh selection procedure of COLSYS is modified for the case of index-2 constraints. We also discuss shooting for initial guesses. The power and generality of the code are demonstrated by examples.
Syntactic Pattern Recognition of Moving Objects in Dosmestic Environment
Authors: Sok G Lim, Mike Alder, Christopher J.S. deSilva
Venue:  (1993)

In this paper, we present a syntactic approach to classifying moving objects in a domestic environment such as human beings and curtains blown by the wind and external events such as moving tree branches. We use quadratic forms as our simple pattern primitives and the description of the objects (or patterns) is based on the relationships between the forms, which we call the UpWrite. The UpWrite process can be applied any number of times, to extract high level information such as strokes, and express them in a compact way suitable for classification.
How to Pass the Turing Test by Cheating
Authors: Jason Hutchens
Venue:  (1997)

Back in the heyday of computer hardware, some notable people actually believed that sentient computer programs were literally just around the corner. This prompted the great British mathemetician, Alan Turing, to devise a simple test of intelligence. If a computer program could pass the Turing test, then it could be said to be exhibiting intelligence. In 1991, the Cambridge Centre for Behavioural Studies held the first formal instantiation of the Turing Test. In this incarnation the test was known as the Loebner contest, as Dr. Hugh Loebner pledged a $100,000 grand prize for the first computer program to pass the test. I have submitted two computer programs to the 1996 Loebner contest, which is to be held on Friday April 19 in New York city. These computer programs are nothing more than glorious hacks, but in constructing them I have learned a great deal about how language works. In this paper I will describe in detail how my computer programs work, and will make comparisons with similar computer programs such as ELIZA. After this, I will explain why the Loebner contest is doomed to failure.
A Comparison of Led-from and Leads-to
Authors: Edgar Knapp
Venue:  (1988)

Progress properties of parallel programs are often expressed using the operator ``leads-to,'''' a binary relation over predicates on the program state. Informally, p leads-to q means that from a state satisfying p a state satisfying q is reached eventually. We investigate the notion of the weakest predicate that leads-to q, for some given q. We formalize this notion by defining a predicate transformer called ``led-from'''' and show that led-from maps a predicate q to the weakest predicate that leads-to q. We also demonstrate that led-from and leads-to are equivalent in expressive power by showing that each can be defined in terms of the other. The advantages of basing concurrent program semantics on the predicate transformer led-from rather than the relation leads-to are similar to those of basing sequential program semantics on the predicate transformer wp rather than on the relation of Hoare-Triples {p}S{q}. In particular, questions about junctivity properties can be raised and answered. Among other things we show that led-from is monotonic and idempotent, but not or-continuous and neither finitely disjunctive nor finitely conjunctive.
Impact envelope formula of simple beams due to high speed trains
Authors: J. D. Yau, Y. B. Yang
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this paper, the dynamic response of beams with simple supports to moving train loads is studied using an analytical approach. The present results indicate that the dynamic response of the beam at resonance remains rather bounded, if the effect of damping is taken into account. An envelope impact formula is proposed for the deflection of the beam with light damping, which serves as a useful and preliminary design aid to railway engineers.
Workconserving vs. Non-workconserving Packet Scheduling: An Issue Revisited
Authors: Jorg Liebeherr, Erhan Yilmaz
Venue:  (1999)

Many packet schedulers for QoS networks are equipped with a rate-control mechanism. The function of a rate-control mechanism (also called rate controller) is to buffer packets from flows which exceed their negotiated traffic profile. It has been established that rate controllers lead to reduced buffer requirements at packet switches, and do not increase the worst-case delays in a deterministic service. On the other hand, rate controllers make a scheduler non-workconserving, and, thus, may yield higher average end-to-end delays. In this study, we show that by properly modifying a rate-controller, one can design a scheduler which balances buffer requirements against average delays. We present a scheduler, called Earliness-based Earliest Deadline First (EEDF), which achieves such a balancing using a tunable rate control mechanism. In simulation experiments, we compare EEDF with a rate-controlled EDF scheduler and a workconserving version of EDF.