ppxscal/embedding_network huggingface dataset:
Autonomous Agents for Online Diagnosis of a Safety-critical System Based on Probabilistic Causal Reasoning
Authors: J. Lauber, C. Steger, R. Weiss
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The goal of decentralization in failure detection, identification, and recovery of high-assurance systems is to focus diagnosis on safety-critical components. The goal of probabilistic causal reasoning in diagnosis is to improve performance of fault isolation. However, this reasoning method is dependent on prior reliability knowledge. Our approach aims at focusing the overall diagnostic cycle in two independent ways: first, autonomous agents diagnose high-consequence appliances of a modular manufacturing system and second, prior reliability data needed is derived from a quality assurance program. Therefore we present a hybrid technique in combining quality assurance data, failure mode and effects analysis and probabilistic causal reasoning. We develop a dynamic Bayesian network which, given evidence from sensor observations, is able to learn and reason over time. We successfully apply autonomous diagnosis agents in concert with reliability assessment to improve online diagnosis of a pneumatic-mechanical device.
Supply Voltage Scalable System Design Using Self-Timed Circuits
Authors: W. Kuang, J. S. Yuan, A. Ejnioui
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Supply voltage scalable system design for low poweris investigated using self-timed circuits in this paper. Twoarchitectures are proposed to achieve supply voltagescalability, for preserved quality and energy-qualitytradeoff respectively, In the fist architecture, the supply-voltageautomatically tracks the input data rate of thedata path so that the supply-voltage can be kept as smallas possible while maintaining the speed requirement andprocessing quality. In the second one, further energysaving is achieved at the cost of signal-noise-ratio loss indigital signal processing when an ultra-low supplyvoltage is applied. Cadence simulation shows theeffectiveness for both architectures. More than 40% to70% power can be saved by introducing -15dB to -10 dBerror in a case study: speech signal processing.
CC++: A Declarative Concurrent Object Oriented Programming Notation
Authors: K. M Chandy, Carl Kesselman
Venue:  (1993)

CC++ is Compositional C++, a parallel object-oriented notation that consists of C++ with six extensions. The goals of the CC++ project are to provide a theory, notation and tools for developing reliable scalable concurrent program libraries, and to provide a framework for unifying: 1.distributed reactive systems, batch-oriented numeric and symbolic applications, and user-interface systems, 2.declarative programs and object-oriented imperative programs, and 3.deterministic and nondeterministic programs. This paper is a brief description of the motivation for CC++, the extensions to C++, a few examples of CC++ programs with reasoning about their correctness, and an evaluation of CC++ in the context of other research on concurrent computation. A short description of C++ is provided.
A Bibliography for the Developmnet of An Intelligent Mathematical System
Authors: Harvey J. Greenberg
Venue:  (1995)

This purpose of this paper is to provide references in the rapidly growing area of intelligent environments for modeling and analysis, particularly for the development and use of decision support systems couched in mathematical programming. This is the focus of the project to develop an Intelligent Mathematical Programming System (IMPS). One way to divide the project''s scope is: formulation, analysis and discourse. There are, however, interdependent components that pertain to model management, software engineering, learning models, and other elements taken from a variety of disciplines.
The Adverse Impact of the TCP Congestion-Control Mechanism in Heterogeneous Computing Systems
Authors: Wu-chun Feng, Peerapol Tinnakornsrisuphap
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Via experimental study, we illustrate how TCP modulates application traffic in such a way as to adversely affect network performance in a heterogeneous computing system. Even when aggregate application traffic smooths out as more applications' traffic are multiplexed, TCP induces burstiness into the aggregate traffic load, and thus hurts network performance. This burstiness is particularly bad in TCP Reno and even worse when RED gateways are employed. Based on the results of this experimental study, we then develop a stochastic model for TCP Reno to demonstrate how the burstiness in TCP Reno can be modeled.
Using finite experiments to study asymptotic performance
Authors: Catherine McGeoch, Peter Sanders, Rudolf Fleischer, Paul R. Cohen, Doina Precup
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

In the analysis of algorithms we are interested in obtaining closed form expressions for algorithmic complexity, or at least asymptotic expressions in O(ċ)-notation. It is often possible to use experimental results to make significant progress towards this goal, although there are fundamental reasons why we cannot guarantee to obtain such expressions from experiments alone. This paper investigates two approaches relating to problems of developing theoretical analyses based on experimental data.We first consider the scientific method, which views experimentation as part of a cycle alternating with theoretical analysis. This approach has been very successful in the natural sciences. Besides supplying preliminary ideas for theoretical analysis, experiments can test falsifiable hypotheses obtained by incomplete theoretical analysis. Asymptotic behavior can also sometimes be deduced from stronger hypotheses which have been induced from experiments. As long as complete mathematical analyses remains elusive, well tested hypotheses may have to take their place. Several examples are given where average complexity can be tested experimentally so that support for hypotheses is quite strong.A second question is how to approach systematically the problem of inferring asymptotic bounds from experimental data. Five heuristic rules for "empirical curve bounding" are presented, ogether with analytical results guaranteeing correctness for certain families of functions. Experimental evaluations of the correctness and tightness of bounds obtained by the rules for several constructed functions and real datasets are described.
Reducing Power Consumption of CMOS VLSI's through VDD and VTH Control
Authors: Takayasu Sakurai
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Lowering operating voltage, VDD, is a key to low-power CMOS digital VLSI's. In order to complete a certain task in a required time and in order to keep leakage current within a tolerable level in the low VDD designs, VDD and VTH control is obligatory. This talk will cover several of the schemes including multi-VTH, variable VTH, multi-VDD and variable VDD to achieve low-power systems. Circuit level ideas to software related research is described.
A Model for Stock Price Fluctuations Based on Information
Authors: Shepp Larry
Venue:  (2000)

This paper is dedicated to the memory of Aaron Wyner, the well known information theorist. It gives a new model for stock price fluctuations based on a concept of ``information''''. In contrast, the usual Black-Scholes-Merton-Samuelson model is based on the {\em explicit} assumption that information plays {\em no} role in stock prices. The new model is based on the non-uniformity of information in the market and the time delay until new information becomes generally known. The new model is expected to give more accurate predictions of future prices and more accurate formulas for hedge option valuations. The new valuations have been calculated for the various standard options inside the new model in a recent PhD thesis by Xin Guo. Because the concept of information is the driving one in the new model it seemed appropriate to discuss this in the present volume even though ``information'''' is used in a somewhat different sense here than in communication theory. In communication theory, information is {\em intended} to be communicated. One is concerned with designing a means for the successful transfer of messages from a source to the receiver and the value of the information is in its successful transmission. In the stock market, the reverse is usually true; information is hoarded and is of value to the owner {\em only} until it becomes known to others. Some messages are avidly communicated in the market but are really meant to {\em disinform} the receivers. This may of course also be true occasionally in communication theory which usually avoids concerning itself with the {\em meaning} of the message to be transmitted. Despite these differences in the role of information in the two situations, there are similarities in the mathematics used to study them. Certainly probabilistical models play a prominent role in both theories. In Shannon''s communication theory quantitative value is assigned to a channel (its rate or its capacity). Is there anything similar in the market? We are able to assign a quantitative value to knowing an item of information {\it which is unknown to others} say that a company is in a strong (or weak) position at a given point in time, via pricing of options on the company''s stock. This paper is intended as a first step towards the goal of making the use of information into a quantitative tool. Problems with explicit solutions are of value in obtaining insights. At the end of the paper we compare several problems of mathematical interest in order to better understand which optimal stopping problems have explicit solutions. 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
Program Comprehension Techniques Improve Software Inspections: A Case Study
Authors: Stan Rifkin, Lionel Deimel
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Software inspections are widely regarded as a cost-effective mechanism for removing defects in software, though performing them does not always reduce the number of customer-discovered defects. We present a case study in which an attempt was made to reduce such defects through inspection training that introduced program comprehension ideas. The training was designed to address the problem of understanding the artifact being reviewed, as well as other perceived deficiencies of the inspection process itself. Measures, both formal and informal, suggest that explicit training in program understanding may improve inspection effectiveness.
Software Agent-Mediated Confidential Information Gathering System
Authors: Xun Yi, Chee Kheong Siew
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In this paper, we propose a confidential information gathering system, which employs software agent traversing a list of information resource servers on Internet to gather confidential information. Both software agent technology and cryptographic technology are applied here to automate and secure the confidential information gathering process.
Consistency, Redundancy, and Implied Equalities in Linear Systems
Authors: Harvey Greenberg
Venue:  (1994)

Systems of linear inequalities have been studied for more than a century, but many of the results were developed during the early years of linear programming (1950''s). New developments in linear programming plus interests in artificial intelligence have recently produced new results. One question is that of consistency: Does there exist a solution to satisfy all linear relations simultaneously? If so, are some of the relations redundant - that is, implied by the others? Are there implied equalities - that is, does some (weak) inequalities have to hold with equality in every feasible solution? This paper brings together the main theorems that address these questions, unifies the framework, and presents some new results.
HOT: Heuristics for Oblique Trees
Authors: Vijay S. Iyengar
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

This paper presents a new method (HOT) of generating oblique decision trees. Oblique trees have been shown to be useful tools for classification in some problem domains, producing accurate and intuitive solutions. Our method can be incorporated into a variety of existing decision tree tools and the paper illustrates this with two very distinct tree generators. The key idea is a method of learning oblique vectors and using the corresponding families of hyperplanes orthogonal to these vectors to separate regions with distinct dominant classes. Experimental results indicate that the learnt oblique hyperplanes lead to compact and accurate oblique trees. HOT is simple and easy to incorporate into most decision tree packages, yet its results compare well with much more complex schemes for generating oblique trees.
A Trusted Open Platform
Authors: Paul England, Butler Lampson, John Manferdelli, Marcus Peinado, Bryan Willman
Venue: Computer (2003)

Although administrators can configure a system to restrict access to resources, in a mass-market setting they cannot be sure of the kernel's integrity. The commercial need for an open software and hardware architecture leads to huge and complex operating systems. A single programming error or intentional back door in this code base can open the way for an attack that renders the access-control system ineffective.The authors describe Microsoft's next-generation secure computing base, a system that offers robust access control through mechanisms for code authentication.
Bioeconomic modelling of a three-species fishery with switching effect
Authors: G. P. Samanta, Debasis Manna, Alakes Maiti
Venue: The Korean Journal of Computational Applied Mathematics (2003)

This paper aims to study the problem of combined harvesting of a system involving one predator and two prey species fishery in which the predator feeds more intensively on the more abundant species. Mathematical formulation of the optimal harvest policy is given and its solution is derived in the equiblibrium case by using Pontryagin's Maximum principle. Dynamic optimization of the harvest policy is also discussed by taking E(t), the combined harvest effort, as a dynamic variable. Biological and bioeconomic interpretations of the results associated with the optimal equilibirum solution are explained. The significance of the constraints required for the existence of an optimal singular control are also given.
The Sage project: a new approach to software engineering for distributed applications
Authors: A. Ricciardi
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

We describe the Sage project, a new approach to software engineering for (fault-tolerant) distributed applications. Sage uses the modal logic of knowledge and applies theoretical results detailing how processes learn facts about each other's state to derive the minimal communication graph for a wide range of coordination problems. The specification interface is controlled, yet expressive enough to capture important distributed coordination problems and weaker variants appropriate for wide-area applications. The resulting graphical display shows programmers which messages must be received. Sage allows users to experiment on the derived protocol by crashing processes, reordering events, losing messages, and partitioning the network. If a solution still exists, Sage regenerates the communication graph. This animates the effects of unpredictable system events on distributed applications, and separates the issues in testing a protocol's behavior in the face of failures, from the effects background system conditions can have on the testing procedure itself.
Optimal Trie Compaction is NP-Complete
Authors: Jens M. Dill
Venue:  (1987)

NOT AVAILABLE
A Distributed Algorithm Enhancing the Connection Quality and Bandwidth Utilization in Wireless Cellular Networks
Authors: Ruiling Chen, Xing Zhou, Feng Zheng, Chuanshan Gao
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper presents a distributed algorithm for enhancing the connection quality and bandwidth utilization in the cellular mobile network, which can improve the quality of service (QoS) in wireless cellular networks. This algorithm allows the history information of the mobile entity to be used to predict an elliptical shadow around it, which covers all spots that the mobile is going to move with a high possibility in a given time. The cells, and only the cells that overlap the shadow should reserve the resource for the mobile connection so as to achieve a low hand-off dropping rate and reduce remarkablythe unnecessarily reserved resource. The algorithm is self-adaptive when the motion is very unpredictable, by observing the mobile actual movement and automatically adjusting the elliptical shadow. Our simulation proved it to be effective in achieving satisfactory QoSparameters such as connection quality and bandwidth utilization.
Presburger''s Article on Integer Arithmetic: Remarks and Translation
Authors: Ryan Stansifer
Venue:  (1984)

No abstract supplied.
Exploiting ILP, TLP, and DLP with the polymorphous TRIPS architecture
Authors: Karthikeyan Sankaralingam, Ramadass Nagarajan, Haiming Liu, Changkyu Kim, Jaehyuk Huh, Doug Burger, Stephen W. Keckler, Charles R. Moore
Venue: Proceedings of the 30th annual international symposium on Computer architecture (2003)

This paper describes the polymorphous TRIPS architecture which can be configured for different granularities and types of parallelism. TRIPS contains mechanisms that enable the processing cores and the on-chip memory system to be configured and combined in different modes for instruction, data, or thread-level parallelism. To adapt to small and large-grain concurrency, the TRIPS architecture contains four out-of-order, 16-wide-issue Grid Processor cores, which can be partitioned when easily extractable fine-grained parallelism exists. This approach to polymorphism provides better performance across a wide range of application types than an approach in which many small processors are aggregated to run workloads with irregular parallelism. Our results show that high performance can be obtained in each of the three modes--ILP, TLP, and DLP-demonstrating the viability of the polymorphous coarse-grained approach for future microprocessors.
Expected value operator of random fuzzy variable and random fuzzy expected value models
Authors: Yian-Kui Liu, Baoding Liu
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

Random fuzzy variable is a mapping from a possibility space to a collection of random variables. This paper first presents a new definition of the expected value operator of a random fuzzy variable, and proves the linearity of the operator. Then, a random fuzzy simulation approach, which combines fuzzy simulation and random simulation, is designed to estimate the expected value of a random fuzzy variable. Based on the new expected value operator, three types of random fuzzy expected value models are presented to model decision systems where fuzziness and randomness appear simultaneously. In addition, random fuzzy simulation, neural networks and genetic algorithm are integrated to produce a hybrid intelligent algorithm for solving those random fuzzy expected valued models. Finally, three numerical examples are provided to illustrate the feasibility and the effectiveness of the proposed algorithm.
Adaptive network based fuzzy control of a dynamic biped walking robot
Authors: Changjiu Zhou, K. Jagannathan
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

In this paper, we proposed a adaptive-network-based fuzzy inference system (ANFIS) control strategy based on a hierarchy of walking planning level, gait generating level and joint control level, which do not require detailed kinematics or dynamic biped models. The ANFIS controller, which enhances Sugeno fuzzy controller with self-learning capability from adaptive network, can combine the qualitative knowledge in fuzzy rules and be fine-tuned by online learning. The effectiveness of the proposed ANFIS joint control was verified through a 5-link biped robot simulation. We demonstrated that the designed hierarchical control system can use the experimental input-output data pairs for the biped robot learning and walking with dynamic balance. It is also shown that the further online self-learning capability of the ANFIS controller can markedly improve the dynamic walking performance of the biped robot.
Measuring Web Performance in the Wide Area
Authors: Paul Barford, Mark Crovella
Venue:  (1999)

Abstract One of the most vexing questions facing researchers interested in the World Wide Web is why users often experience long delays in document retrieval. The Internet''s size, complexity, and continued growth make this a difficult question to answer. We describe the Wide Area Web Measurement project (WAWM) which uses an infrastructure distributed across the Internet to study Web performance. The infrastructure enables simultaneous measurements of Web client performance, network performance and Web server performance. The infrastructure uses a Web traffic generator to create representative workloads on servers, and both active and passive tools to measure performance characteristics. Initial results based on a prototype installation of the infrastructure are presented in this paper.
Formal development of static program analysers
Authors: V. Gouranton, D. Le Metayer
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

We propose an approach for the formal development of static analysers which is based on transformations of inference systems. The specification of an analyser is made of two components: an operational semantics of the programming language and the definition of a property by recurrence on the proof trees of the operational semantics. The derivation is a succession of specialisations of inference systems with respect to properties on their proof trees. In this paper we illustrate the methodology with the derivation of analysers for a non-strict functional language.
Personal Radio
Authors: John C. Artz
Venue:  (2000)

With the development of new technologies that allow the broadcast of digital data over radio signals, there are many possibilities for improving upon the traditional radio station model for content delivery. The idea of Personal Radio is a system that tailors content to meet the needs of each individual. Using Global Positioning System (GPS) technology to play location specific content, the listening history to play content an appropriate number of times, and user feedback to learn personal preferences, the Personal Radio provides the listener with the content that is the most useful/interesting to them. This paper will examine the general design of such a system and present solutions developed in the implementation of several pieces of the design. 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