ppxscal/embedding_network huggingface dataset:
Steps towards a systematic investigation of possible evolutionary trajectories from reactive to deliberative control systems
Authors: Matthias Scheutz, Paul Schermerhorn
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Although they are vastly outnumbered by simpler control systems, complex, "deliberative" control systems have evolved on our planet. Hence, agents with deliberative capabilities must have adaptive advantages over agents with simpler control systems in some environments. This paper examines the tradeoffs between the costs of control systems and the benefits they offer in a variety of environments and dmcusses the implications of these tradeoffs on evolutionary trajectories from "reactive" control systems, through somewhat more complex "affective" systems, to genuine deliberative systems.
Choosing the Instant of Insurance Commencement
Authors: B. P. Kharlamov
Venue: Automation and Remote Control (2003)

Consideration was given to a continuous insurance model where the client is insured at a random time instant depending on the degree of wear of the insured object. The insurer designates the insurance premium and the insurance recovery that is paid to the client provided that the object was insured prior to the insured accident (failure). It was proved that the client bears the minimum losses if it concludes the insurance contract when the degree of wear (proportional to the danger of failure) reaches a level equal numerically to the ratio of the insurance premium to the insurance recovery. Expecting this optimal behavior of the client, the insurer seeks the most advantageous ratio. If there is no penalty for nonconcluded contract (the insured accident occurs before conclusion of the contract), then the greater the ratio, the greater on the average the relative insurer's profit from the enterprise. If there exists a penalty, then there exists a ratio of the insurance premium to the insurance recovery that is most advantageous to the insurer. The problem of determining the optimal ratio is solvable numerically in the class of monotone continuous semi-Markovian processes for which determination of the optimal level comes to solving a transcendental equation with functions defined by the process parameters.
PDL: A New Physical Synthesis Methodology
Authors: Toshiyuki Shibuya, Rajeev Murgai, Tadashi Konno, Kazuhiro Emi, Kaoru Kawamura
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

In this paper, we propose a new physical synthesismethodology, PDL, which relaxes the timing constraintsto obtain best optimality in terms of layout quality andtiming quality. It provides a common database for delaycalculation, logic optimization, placement, and routingtools so that they can work and interact closely. Wepresent results on industrial circuits showing the efficacyof this methodology.
C/C++ Conditional Compilation Analysis Using Symbolic Execution
Authors: Ying Hu, Ettore Merlo, Michel Dagenais, Bruno Lagüe
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

Conditional compilation is one of the most powerful parts of a C/C++ environment available for building software for different platforms with different feature sets. Although conditional compilation is powerful, it can be difficult to understand and is error prone. In large software systems, file inclusion, conditional compilation and macro substitution are closely related and are often largely interleaved. Without adequate tools, understanding complex header files is a tedious task. This practice may even be complicated as the hierarchies of header files grow with projects. This paper presents our experiences of studying conditional compilation based on symbolic execution of preprocessing directives. Our two concrete goals are: for any given preprocessor directive or C/C++ source code line, finding the simplest sufficient condition to reach/compile it, and finding the full condition to reach/compile that code line. Two different strategies were used to achieve these two goals. A series of experiments conducted on the Linux kernel are presented.
A Run on Sterling-Personal Finance on the Move
Authors: Lee Cooper, Chris Baber, Graham Johnson
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

A number of organizations are currently engaged in the creation of electronic wallets as platforms for electronic commerce and banking. Significantly the wallet developed by Swatch is wearable. The Swatch Access thus represents one of the few applications of truly wearable technology within the financial service sector. This paper summarizes research intent upon exploring and highlighting the non-technical requirements associated with electronic wallets such as the Swatch Access. To achieve this goal the research adopted an ethnographic approach. A series of interviews and observations was carried out, addressing the content of the people's existing wallets and how the wallet and its contents are used in everyday life. The findings are subsequently discussed in terms of their implications for the development of future wearable electronic wallets.
Effective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks
Authors: J. C. Sancho, A. Robles, J. Flich, P. López, J. Duato
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

The InfiniBand Architecture (IBA) defines a switch-based network with point-to-point links whose topology is arbitrarily established by the customer. Often, the interconnection pattern is irregular, which complicates routing and deadlock avoidance. Current routing algorithms for NOWs, either achieve a low network performance, such as the up*/down* routing scheme, or cannot be implemented on IBA networks. IBA switches provide support for several virtual lanes, but they are primarily intended for QoS. Hence, its use for other purposes, like deadlock avoidance or performance improvement, should be limited.In this paper, we propose a simple and effective methodology for designing deadlock-free routing strategies that are able to route packets through minimal paths in InfiniBand networks. This methodology can meet the trade-off between network performance and the number of resources dedicated to deadlock avoidance. Evaluation results show that the resulting routing strategies significantly outperform up*/down* routing. In particular, throughput improvementranges, on average, from 1:33 for small networks to 4:05 for large networks. Also, it is shown that just two virtual lanes and three service levels are enough to achieve more than 80% of the throughput improvement achieved by the best proposed routing strategy (the one that always provides minimal paths without limiting the number of resources).
Towards rich information landscapes for visualising structured Web spaces
Authors: K. Andrews, M. Pichler, P. Wolf
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

The Harmony browser for the Hyper-G Web server utilises Hyper-G's rich data model to provide a number of tightly-coupled, two- and three-dimensional visualisation and navigational facilities. In particular the Harmony Information Landscape visualises the hierarchical structure of Hyper-G spaces upon a plane in three-dimensional space. The Harmony Information Landscape has now been extended to display a combined structure and link map by selectively superimposing hyperlink relationships in the vertical dimension above and below the hierarchy map. In addition, documents returned by search queries may be selectively "plotted" in the landscape, indicating their whereabouts in a broader context, and several sets of 3D icons are available for representing the various document types.
On Designing Fault-Tolerant VLSI Processor Arrays
Authors: L A Rosenberg
Venue:  (1985)

A number of strategies have been proposed in the literature for designing fault-tolerant arrays of processors. We describe here a formal framework in which to study these strategies with an eye toward assessing their suitability for VLSI implementation. Our framework is graph-theoretic; and our measure of the suitability of a strategy is the area required to lay out a fault-tolerant linear array of processors. We illustrate the utility of the framework by studying three design strategies and two design problems. The first design strategy builds an array each of whose processing elements (PEs) contains a switching mechanism sufficiently robust that when PEs fail, an appropriate setting of the switches will configure the good PEs into a linear array, using only direct neighbor connections. The second strategy runs buses past the PEs and interconnects the fault-free PEs into a linear array by having PEs tap into the bank of buses. The third strategy inserts no switches into the PEs; instead it realizes all inter-PE connections through a switching network that is external to the PEs. The first of the two design problems requires that a linear array be created, no matter how few PEs are found to be free of faults. The second problem attempts to salvage an array only if some prespecified fraction of the PEs are defect-free. For the first design problem, the three design strategies construct n-PE solution arrays in areas $0(n^4),~0(n~log~n)$, and $0(n)$, respectively. For the second design problem, the first strategy can be improved (under certain circumstances) to $0(n^2)$, while the others can be improved only by constant factors. The development suggests that, although our formal setting does not capture all facets of the design problem, it is suitable for comparison studies such as those described herein.
Enhancing The Fault-Tolerance of Nonmasking Programs
Authors: Sandeep S. Kulkarni, Ali Ebnenasir
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In this paper, we focus on automated techniques to enhance thefault-tolerance of a nonmasking fault-tolerant program to masking.A masking program continually satisfies its specification even iffaults occur. By contrast, a nonmasking program merely guaranteesthat after faults stop occurring, the program recovers to states fromwhere it continually satisfies its specification. Until the recovery iscomplete, however, a nonmasking program can violate its (safety)specification. Thus, the problem of enhancing fault-tolerance fromnonmasking to masking requires that safety be added and recoverybe preserved. We focus on this enhancement problem for high atomicityprograms -where each process can read all variables- and fordistributed programs -where restrictions are imposed on what processescan read and write. We present a sound and complete algorithmfor high atomicity programs and a sound algorithm for distributedprograms. We also argue that our algorithms are simplerthan previous algorithms, where masking fault-tolerance is addedto a fault-intolerant program. Hence, these algorithms can partiallyreap the benefits of automation when the cost of adding maskingfault-tolerance to a fault-intolerant program is high. To illustratethese algorithms, we show how the masking fault-tolerant programsfor triple modular redundancy and Byzantine agreement can be obtainedby enhancing the fault-tolerance of the corresponding non-maskingversions. We also discuss how the derivation of these programsis simplified when we begin with a nonmasking fault-tolerantprogram.
A survey of automated timetabling
Authors: Andrea Schaerf
Venue:  (1995)

The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or high school) and the type of constraints. This problem, that has been traditionally considered in the operational research field, has recently been tackled with techniques belonging also to artificial intelligence (e.g. genetic algorithms, tabu search, simulated annealing, and constraint satisfaction). In this paper, we survey the various formulations of the problem, and the techniques and algorithms used for its solution.
Fuzzy Technologies and Their Advantages in Commercial Advanced Planning Systems (APS)
Authors: Walter Cadek
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Enterprise wide Planning Systems imply many functions that cannot be covered by exact mathematical expressions. Instead of, there are functions like forecasting, estimating, optimizing a.s.o., which are based on experience of past situations on the one hand and are depending on complex influences, which cannot easily be taken into account by simplemathematical methods. In these entire cases FUZZY-Logic can help to define a set of rules, dependencies and conclusions.The application of FUZZY Technologies in "Advanced Planning Systems (APS) is not yet usual, but there are some other mathematical methods in use which can be described to solve the usability problem [13]. In use there are methods likeMathematical OptimizationSimulationScenarioHeuristicPersonal Judgmentwhich support planning activities in a certain manner. FUZZY is somehow universal in its application, which means, how ever the complexity of the relation between the known parameters and the unknown "X" is, it can be modeled in FUZZY Technology. In addition, there are not much mathematical skills necessary to use FUZZY. Instead of mathematical formulas, a graphical, user-friendly interface is used to simplify the application.The main advantage of using FUZZY-Technology is its reproducibility, which can be used to further develop, maintain and optimize the tasks like "forecasting", "estimating" and so on. 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
Fast, Reliable Head Tracking under Varying Illumination
Authors: Marco La Cascia, Stan Sclaroff
Venue:  (1998)

Abstract An improved technique for 3D head tracking under varying illumination conditions is proposed. The head is modeled as a texture mapped cylinder. Tracking is formulated as an image registration problem in the cylinder''s texture map image. To solve the registration problem in the presence of lighting variation and head motion, the residual error of registration is modeled as a linear combination of texture warping templates and orthogonal illumination templates. Fast and stable on-line tracking is then achieved via regularized, weighted least squares minimization of the registration error. The regularization term tends to limit potential ambiguities that arise in the warping and illumination templates. It enables stable tracking over extended sequences. Tracking does not require a precise initial fit of the model; the system is initialized automatically using a simple 2-D face detector. The only assumption is that the target is facing the camera in the first frame of the sequence. The warping templates are computed at the first frame of the sequence. Illumination templates are precomputed off-line over a training set of face images collected under varying lighting conditions. Experiments in tracking are reported.
A Formal Model for Model Interconnection Languages
Authors: M. D. Rice, S. B. Seidman
Venue:  (1992)

A formal, generic model of module interconnections is proposed that is based on the concepts of hierarchy and modularity. The mathematical formalism used in the model is derived from the specification language Z. The general form of the model is represented by a collection of Z schemas that is invariant across all of its applications. A particular application is specified by supplying values of generic parameters and by conjoining each of the general Z schemas with an application-specific Z schema and adding additional application-specific constraints. Applications are given to the Conic configuration language, the STILE graphical design and development environment, and to a setting for coarse-grained dataflow programming.
Balancing Domain Decomposition: Theory and Performance in Two and Three Dimensions
Authors: Jan Mandel, Marian Brezina
Venue:  (1993)

The Balancing Domain Decomposition algorithm uses in each iteration solution of local problems on the subdomains couples with a coarse problem that is used to propagate the error globally and to guarantee that the possibly singular local problems are consistent. The abstract theory introduced in [19] is used to develop condition number bounds for conforming linear elements in two and three dimensions. The bounds are independent of arbitrary coefficient jumps between subdomains and of the number of subdomains, and grow only as the squared logarithm of the mesh size h. Computational experiments for two and three-dimensional problems confirm the theory and, in addition, show that the method is remarkable resilient and performs very well for strongly discontinuous coefficients as well as unstructured subdomains.
An Infrastructure for a Mobile-Agent System that Provides Personalized Services to Mobile Devices
Authors: Debbie O. Chyi
Venue:  (2000)

In this paper, we present the design of a mobile-agent system that provides a mobile user with a personalized information retrieval service and we describe the implementation of the infrastructure for such a system. This "Personal Agent System" gathers information from the Internet and uses context-aware mechanisms to manage the information according to a mobile user''s needs and preferences. The user''s schedule and location are the context indicators in this system. These indicators are critical in ensuring that users obtain only the information they want, receive information in a form that is most useful for viewing on their mobile device, and is notified of new information in a minimally intrusive manner. The system incorporates a rule-based learning system to enhance the personalization achieved by the system. 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
Unique Signal Analysis and Synthesis Project
Authors: D J Leyland
Venue:  (1996)

The unique signal concept was developed at Sandia National Laboratories in the 1970`s as a way to communicate an unambiguous intent to detonate from the human/machine interface to the responder in a nuclear weapon. A unique signal can be described as a sequence of independent binary events which are sent through a communication channel and processed by the responder. The responder must receive the correct sequence of events in order to proceed with detonation. Unique signals are the safety critical component of the subsytem so that the communication channel itself does not have to be barrierized. Since unique signals are safety critical, we subject them to certain design constraints in an attempt to reduce the probability of accidently generating the patterns in abnormal environments. Some of these constraints are mathematically justifiable; there are also heuristics based on observation and engineering considerations. In this project we attempt to address recent computational needs of unique signal research as well as to investigate current issues in unique signal design. This includes the development of comprehensive analysis and synthesis software; the creation of a collection of patterns for a high-consequence robotics operation; a comparison of unique signals to patterns generated by a linear feedback shift register; and an insight into a potentially dangerous \event skipping`` phenomenon. In the process we have discovered that no patterns will meet the design constraints explicitly. We also investigate additional design constraints such as tests of randomness. For example, a unique signal can be thought of as a balanced Bernoulli process, and we can run appropriate hypothesis tests to determine whether or not the patterns show characteristics of a random sequence. We will also dicuss directions for future research. 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
A Case Study Using the Round-Trip Strategy for State-Based Class Testing
Authors: G. Antoniol, L. C. Briand, M. Di Penta, Y. Labiche
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

A number of strategies have been proposed for state-basedclass testing. An important proposal made byChow, that was subsequently adapted by Binder, consistsin deriving test sequences covering all round-trip paths ina finite state machine (FSMs). Based on a number of(rather strong) assumptions, and for traditional FSMs, itcan be demonstrated that all operation and transfererrors in the implementation can be uncovered. Throughexperimentation, this paper investigates this strategywhen used in the context of UML statecharts. Based on aset of mutation operators proposed for object-orientedcode we seed a significant number of faults in animplementation of a specific container class. We theninvestigate the effectiveness of four test teams atuncovering faults, based on the round-trip path strategy,and analyze the faults that seem to be difficult to detect.Our main conclusion is that the round-trip path strategyis reasonably effective at detecting faults (87% average asopposed to 69% for size-equivalent, random test cases)but that a significant number of faults can only exhibit ahigh detection probability by augmenting the round-tripstrategy with a traditional black-box strategy such ascategory-partition testing. This increases the number oftest cases to run --and therefore the cost of testing-- anda cost-benefit analysis weighting the increase of testingeffort and the likely gain in fault detection is necessary.
Autonomous Navigation Based On a Dynamic Representation
Authors: Maurizio Piaggio, Renato Zaccaria
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In this paper we propose a real-time architecture for autonomous mobile robots. We describe the single components of the architecture that are responsible of data acquisition and representation, navigation and obstacle avoidance. In particular we will focus on the integration of the components in the architecture and on the mechanisms that allow the system to operate in real time. Some experimental results will be illustrated.
On the Automatic Generation of Content Links in Hypertext
Authors: Gerard Salton, Chris Buckley
Venue:  (1989)

Text structuring systems that provide links between text portions have been widely proposed as aids for text preparation and text manipulation. In principle, it is easy to follow available links between related text portions; it is much harder, however, to put in place useful links that relate document sections with related text content. An approach is described in this note for the automatic generation of content links based on global term and phrase matches between sentence and document texts. Tentative evaluation data are included to demonstrate the usefulness of the proposed procedures.