ppxscal/embedding_network huggingface dataset:
Multi-agent Reinforcement Learning for Crane Control Problem: Designing Rewards for Conflict Resolution
Authors: Sachiyo Arai, Kazuteru Miyazaki, Shigenobu Kobayashi
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

In recent years, a reinforcement learning approach to build an agent's knowledge in a multi-agent world has prevailed. When the reinforcement learning is applied to such a world, "a concurrent learning among the agents", "a perceptual aliasing ", and "a designing rewards" are the most important problems to be considered. We have already confirmed that Profit-sharing algorithm shows its robustness against these three problems through some experiments. In this paper, we focus on an advantage of Profit-sharing comparing to Q-learning through the simulations of controlling cranes where there exist the conflicts among the agents. The conflict resolution problem must become a bottle-neck in the multi-agent world if we approach to it by the top-down method. Similarly, Q-learning is also weak in this problem without exhaustive design of the rewards or detailed information about other agents. We present that Profit-sharing method can be available to resolve it, through the results of some experiments on the controlling cranes problem.
Two-level Method with Coarse Space Size Independent Convergence
Authors: Petr Vanek, Radek Tezaur, Marian Brezina, Jitka Krizkova
Venue:  (1995)

The basic disadvantage of the standard two-level method is the strong dependence of its convergence rate on the size of the coarse-level problem. In order to obtain the optimal convergence result, one is limited to using a coarse space which is only a few times smaller than the size of the fine-level one. Consequently, the asymptotic cost of the resulting method is the same as in the case of using a coarse-level solver for the original problem. Today''s''s two-level domain decomposition methods typically offer an improvement by yielding a rate of convergence which depends on the ratio of fine and coarse level only polylogarthmically ([BPS86],[DSW94],[Man93],[FR91],[MT]). However, these methods require the use of local subdomain solvers for which straightforward application of iterative methods is problematic, while the usual application of direct solvers is expensive. We suggest a method diminishing significantly these difficulties. Following the unpublished technical report [VK95], we develop a simple abstract framework based on the concept of smoothed aggregation introduced in [VMB} with aggregates derived from the system of nonoverlapping subdomains. We show that the smoothing of the coarse-space by an appropriate polynomial of degree about N-des (symbol d denotes the dimension of the problem to be solved and Nes is the characteristic number of degrees of freedom per subdomain) can assure the coarse the coarse-space size independent convergence. The associated cost is significantly smaller than that of the local solvers in the case of standard domain decomposition. Moreover, it decreases as d increases. Because of the page limit, we only apply the abstract framework to the case of scalar equation with jumps in coefficients. More general problems and numerical experiments will be treated in [TVB].
Exploiting Temporal and Spatial Constraints on Distributed Shared Objects
Authors: Richard West, Karsten Schwan, Ivan Tacic, Mustaque Ahamad
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Gigabit network technologies have made it possible to combine workstations into a distributed, massively-parallel computer system. Middleware, such as distributed shared objects (DSO), attempts to improve programmability of such systems, by providing globally accessible 'object' abstractions. Researchers have developed consistency protocols for replicated 'memory' objects. These protocols are well suited to scientific applications but less suited to multimedia or groupware applications. This paper addresses the state sharing needs of complex distributed applications with (1) high-frequency symmetric accesses to shared objects, (2) unpredictable and limited locality of accesses, (3) dynamically changing sharing behavior, and (4) potential data races. We show that a DSO system exploiting application-level temporal and spatial constraints on shared objects can outperform shared object protocols which do not exploit application-level constraints. We compare our S(emantic) DSO against entry consistency using a sample application having the four properties mentioned above.
Proceedings of Sixth International Workshop on Unification
Authors: Wayne Snyder
Venue:  (1993)

Abstract The Proceedings of the Sixth International Workshop on Unification contains short papers presented at the workshop which took place at the Dagstuhl conference center in Germany, in June 1992.
Optimal Portfolio Selection with Fixed Transactions Costs in the presence of Jumps and Random Drift
Authors: Ajay S Aiyer
Venue:  (1996)

In this paper, we study the general problem of optimal portfolio selection with fixed transactions costs in the presence of jumps. We extend the analysis of Morton and Pliska to this setting by modeling the return processes of the risky assets in the investor''s portfolio as jump-diffusion processes and derive the expression for the related optimal stopping time problem of a Markov process with jumps and explicitly solve it in the situation when the portfolio consists only of one risky asset. We also provide an asymptotic analysis of our model with one risky asset following the ideas of Wilmott and Atkinson. In the process, we also obtain a solution for the "Merton problem" generalized to the situation when there is credit risk. Finally, we consider the case where the drift of the stock price process is random and unobservable and obtain expressions for the optimal trading policies. 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
Assessing Complex Computer Based Systems using the Goal Structuring Notation
Authors: S P. Wilson, J A. McDermid, C H. Pygott, D J. Tombs
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Procurers of critical computer based systems have to assess the suitability of implementations provided by external contractors. What an assessor requires is a clear, comprehensible and defensible argument, with supporting evidence, that a system will behave acceptably. In this paper we describe how the Goal Structuring Notation (GSN) can be used to capture suitability arguments with supporting evidence attached in the form of design models, test results, analysis results, audit reports, etc. We also describe associated tool support =96 the Safety Argument Manager (SAM). This paper describes work being carried out by the Defence Research Agency (DRA) and the University of York, supported by the UK Ministry of Defence s (MoD) Strategic Research Programme. It presents the preliminary results and expected future direction of the project. Nothing in this paper should be taken as the official position of the MoD or the DRA.
Java Message Service (JMS) for J2EE
Authors: Levent Erdogen
Venue:  (2002)

:The authoritative guide to JMS for enterprise developers. JMS API is gaining important popularity for Enterprise applications and there is no adequate documentation for JMS for the J2EE platform. This book covers not only the concepts, but also present simple examples to explain the concepts and real sample applications to show how to use those concepts and techniques.J2EE is commonly used for enterprise applications. The Java(tm) Message Service (JMS) API has been developed by Sun working in close cooperation with the leading enterprise messaging vendors. Enterprise messaging is now recognized as an essential tool for building enterprise applications. By combining Java technology with enterprise messaging, the JMS API provides a new, powerful tool for solving enterprise computing problems. Enterprise messaging provides a reliable, flexible service for the asynchronous exchange of critical business data and events throughout an enterprise. The JMS API adds to this a common API and provider framework that enables the development of portable, message based applications in the Java programming language. 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
CI2 --- A Logic for Plural Representation
Authors: Felix Yen
Venue:  (1990)

The problem we address is the representation of plurals. The solution we present is CI2, a first-order logic named after the {\em calculus of individuals}. (If one thinks of individuals as being sets, then CI2 is just the calculus of individuals with numbers added.) In CI2, plurals are represented with terms denoting sets. (Singulars are represented with terms denoting unit sets.) We are primarily concerned with the problem of representing ambiguous sentences and making inferences from them. Our solution involves using a "new" but simple ontology as well as special classes of functions which we describe. The result is a theory that enables us to disambiguate sentences incrementally. We also describe a CI2-specific theorem prover (fully implemented) that uses several techniques that may be of use to those interested in developing systems that can reason about sets. We demonstrate the viability of our theory by presenting representations for twelve ambiguous, plural sentences. We show how each sentence can be disambiguated and how the desired inferences were computed by our theorem prover. Our dissertation concludes by addressing the problem of modifying existing programs so that they can manipulate plural entities. This is not trivial modification as it entails solving the closure problem, i.e. making closure assumptions. We present a promising approach in which closure assumptions are made only when needed. 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
Visitor combination and traversal control
Authors: J. M.W. Visser
Venue:  (2001)

The \emph{Visitor} design pattern allows the encapsulation of polymorphic behavior outside the class hierarchy on which it operates. A common application of \emph{Visitor} is the encapsulation of tree traversals. Unfortunately, visitors resist composition and allow little traversal control. To remove these limitations, we introduce visitor \emph{combinators}. These are implementations of the visitor interface that can be used to \emph{compose} new visitors from given ones. The set of combinators we propose includes \emph{traversal} combinators that can be used to obtain full traversal control. A clean separation can be made between the generic parts of the combinator set and the parts that are specific to a particular class hierarchy. The generic parts form a reusable framework. The specific parts can be generated from a (tree) grammar. Due to this separation, programming with visitor combinators becomes a form of \emph{generic programming} with significant reuse of (visitor) code.
Public Policy and the Knowledge Economy: Foundations and Frameworks (New Horizons in Public Policy)
Authors: David Rooney, Richard Joseph, Thomas Mandeville, Gregory Hearn
Venue:  (2003)

:"Knowledge is a product of human social systems and, therefore, the foundations of the knowledge-based economy are social and cultural. Communication is central to knowledge creation and diffusion, and Public Policy in Knowledge-Based Economies highlights specific social and cultural conditions that can enhance the communication, use and creation of knowledge in a society." "The purpose of this book is to illustrate how these social and cultural conditions are identified and analysed through new conceptual frameworks. Such frameworks are necessary to penetrate the surface features of knowledge-based economies - science and technology - and disclose what drives such economies." This book will provide policymakers, analysts and academics with the fundamental tools needed for the development of policy in this little understood and emerging area.
Data Optimization for Visualization of FEM-Data
Authors: Gernot Opriessnig
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The amount of data, produced by a finite element calculation places a particular challenge to scientific visualization. Specifically in the field of tunneling, because to describe the very complicated properties of the rock-mass with a finite element mesh, this mesh must have a very fine grid. This affects a large number of elements, and for each of them, simulation results are calculated. If the tunnel advance is simulated, a large number of load steps are calculated, which also increases the amount of data, so result files can reach a size of hundreds megabytes. Because of decreasing hardware costs, the storage of these data is no longer a real problem, but for the visualization in real-time techniques are necessary to reduce this amount of data, without loosing any information.In this paper, methods are presented, to extract the parts of the FEM-output-data that are necessary for the visualization of the simulation results. There are two major parts, which have to be considered: the geometry and the simulation data. In both the requirements for simulation and visualization are different. The techniques, described here, fulfill the requirements of scientific information visualization.
Intuitionistic counterparts of finitely-valued logics
Authors: M. Baaz, C. G. Fermuller
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

We investigate the relation between Kripke's model structures for intuitionistic logic and the simple syntactical restriction that turns the classical sequent calculus into an intuitionistic one. For this purpose we generalize ordinary Kripke structures to ones based on arbitrary finite sets of truth values and show that imposing a proper syntactical restriction on many-placed sequents leads to calculi that are correct and cut-free complete for the new logics.
Configuration Management with Logical Structures
Authors: Yi Lin, Steven P. Reiss
Venue:  (1995)

When designing software, programmers usually think in terms of modules that are represented as functions and classes. But using existing configuration management systems, programmers have to deal with versions and configurations that are organized by files and directories. This is inconvenient and error-prone, since there is a gap between handling source code and managing configurations. We present a framework for programming environments that handles versions and configurations directly in terms of the functions and classes in source code. We show that with this framework, configuration management issues in software reuse and cooperative programming become easier. We also present a prototype environment that has been developed to verify our ideas.
Language tug-of-war: industry demand and academic choice
Authors: Michael de Raadt, Richard Watson, Mark Toleman
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

This paper seeks to inform instructors responsible for designing introductory programming courses within a university setting. In particular, guidelines for choosing programming languages to be taught are presented. Information relevant to instructors of later programming courses is also presented.We ask the question: "are instructors of introductory programming courses wanting to teach industry demanded languages and if so, are they choosing the correct languages?" The guidelines produced to answer this question are based on a census of introductory programming teaching in Australian universities, coupled with a survey of employer demand based on newspaper job advertisements.
Reliable Cellular Automata with Self-Organization
Authors: Peter Gacs
Venue:  (1998)

Abstract In a probabilistic cellular automaton in which all local transitions have positive probability, the problem of keeping a bit of information for more than a constant number of steps is nontrivial, even in an infinite automaton. Still, there is a solution in 2 dimensions, and this solution can be used to construct a simple 3-dimensional discrete-time universal fault-tolerant cellular automaton. This technique does not help much to solve the following problems: remembering a bit of information in 1 dimension; computing in dimensions lower than 3; computing in any dimension with non-synchronized transitions. Our more complex technique organizes the cells in blocks that perform a reliable simulation of a second (generalized) cellular automaton. The cells of the latter automaton are also organized in blocks, simulating even more reliably a third automaton, etc. Since all this (a possibly infinite hierarchy) is organized in ``software'''', it must be under repair all the time from damage caused by errors. A large part of the problem is essentially self-stabilization recovering from a mess of arbitrary-size and content caused by the faults. The present paper constructs an asynchronous one-dimensional fault-tolerant cellular automaton, with the further feature of ``self-organization''''. The latter means that unless a large amount of input information must be given, the initial configuration can be chosen to be periodical with a small period.
Design Synthesis Using Adaptive Search Techniques and Multi-Criteria Decision Analysis
Authors: Mark Nicholson, Divya Prasad
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Safety and real-time requirements of computer-based life-critical applications dramatically increase the complexity of the issues that need to be addressed during the design process. Typically quantitative analysis of such requirements are undertaken in an ad-hoc manner after the artifact has been produced. In this paper we propose a more systematic approach which uses Adaptive Search and Multi-Criteria Decision Analysis techniques to provide analytical support during the design-decision process.
Finding Exact Solutions to the Bandwidth Minimization Problem
Authors: Gianna Del Corso, Giovanni Manzini
Venue:  (1998)

Given an m by m sparse symmetric matrix, we consider the problem of finding the permutation of rows and columns which minimizes the bandwidth. This problem is known to be NP-complete therefore no algorithm polynomial in m is likely to exist. We present two algorithms which exhaustively enumerate all permutations trying to discard as early as possible those which cannot lead to an optimal ordering. Our first algorithm uses a depth first search strategy, while our second algorithm uses a recently developed technique called perimeter search. We have tested the performance of these algorithms solving problems of size ranging from 40 to 100. Our results show that there exist classes of matrices for which it is possible to find the minimum bandwidth in a small amount of time. Our results also provide additional experimental evidence of the effectiveness of the perimeter search technique: we found that, compared to depth-first search, perimeter search can reduce the running time up to a factor 100. TEL:: +39 050 593479 EMAIL:: delcorso@imc.pi.cnr.it
Developing Two of Arsac''s Funny Algorithms
Authors: David Gries
Venue:  (1985)

In Some Funny Program (Ecole Normale Superieure, Paris, June 1985) J. Arsac discusses several algorithms, but not from the standpoint of their development. Here, we develop the algorithms given their specification using the methods espoused in The Science of Programming. 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
Game logic for game theorists
Authors: M. Pauly
Venue:  (2000)

Game Logic (GL), introduced in (Parikh, 1985), is examined from a game-theoretic perspective. A new semantics for GL is proposed in terms of untyped games which are closely related to extensive game forms of perfect information. An example is given of how GL can be used as a formal model of game situations, and some metatheoretic results are presented in the context of their game-theoretic relevance.
Simultaneous Multithreading-Based Routers
Authors: Kemathat Vibhatavanij, Nian-Feng Tzeng, Angkul Kongmunvattana
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

This work considers the use of an SMT (simultaneous multithreading) processor in lieu of the conventional processor(s) in a router and evaluates quantitatively the potential gains as a result. An SMT processor exploits the benefits of both ILP (instruction level parallelism) and TLP (thread-level parallelism), suitable for the next generation routers, in which an increased number of functions are to be implemented. The use of an SMT processor not only allows router functions to be decomposed into multiple threads but also designates separate threads to handle different incoming traffic streams of a router to exploit TLP, potentially attaining performance improvement. Additionally, an SMT processor may admit new router functions or added traffic streams relatively easily without compromising much existing performance levels, via including a new thread (or threads) to perform one newly added function or traffic stream. This router design appears to have better flexibility and adaptability. In order to assess the benefits of this design approach, we implemented three key router functions (i.e., packet header extraction, packet header manipulation, and longest-prefix matching) as threads using an SMT simulator (SMTSIM) for performance evaluation. The results of this router design approach are collected and compared with those of conventional routers.
Rational communication in multi-agent semi-competitive environments
Authors: Ka-man Lam, Ho-fung Leung
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

This paper introduces rational communication among agents in a multi-agent semi-competitive environment. In such an environment, agents are in competition in some aspects, while cooperation can sometimes increase agents' utilities, and agents have incentives to be dishonest. Therefore, agents need to decide whether or not, and to what degree, to trust other agents. This paper extends and applies the Recursive Modeling Method of Gmytrasiewicz and Durfee, and illustrates how an agent models its knowledge, how it uses these models to make decisions on its actions, whether to lie to its listeners, and whether to trust the message senders as well as individual messages. In addition, this paper introduces the new concept of degree of trustworthiness of agents, which mimics the model in human interactions. Furthermore, this paper discusses the relations between an agent's attitude towards risk and the agent's trust in individual messages after considering the senders' trustworthiness and the expected utility of trusting the messages. Some interesting examples are investigated.