ppxscal/embedding_network huggingface dataset:
Exploration and Exploitation Trade-Off in Multiagent Learning
Authors: Keiki Takadama, Katsunori Shimohara
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper focuses on the trade-off between exploration and exploitation in multiagentlearning and explores some fundamental factors that contribute to clarifying this trade-offThrough inventive simulations on distributed constraint satisfaction problems in multiagentenvironments, the following implications are revealed: (1) the trade-off between explorationand exploitation at the collective level is not easy to be solved when considering the trade-offat the individual level; but (2) the trade-off at the collective level can be solved by introducinga simple gradient search in the trade-off at the individual level.
Proof-checking an audio control protocol with LP
Authors: W. O. D Griffioen
Venue:  (1995)

In this paper we report on the use of the Larch Prover to mechanize the correctness proof of a version of the Philips Audio Control Protocol.
Quickest Paths: Faster Algorithms and Dynamization
Authors: Dimitrios Kagaris, Grammati E. Pantziou, Spyros Tragoudas, Christos D. Zaroliagis
Venue:  (1994)

Given a network $N=(V,E,{c},{l})$, where $G=(V,E)$, $|V|=n$ and $|E|=m$, is a directed graph, ${c}(e) < 0$ is the capacity and ${l}(e) \ge 0$ is the lead time (or delay) for each edge $e\in E$, the quickest path problem is to find a path for a given source--destination pair such that the total lead time plus the inverse of the minimum edge capacity of the path is minimal. The problem has applications to fast data transmissions in communication networks. The best previous algorithm for the single--pair quickest path problem runs in time $O(r m+r n \log n)$, where $r$ is the number of distinct capacities of $N$ \cite{ROS}. In this paper, we present algorithms for general, sparse and planar networks that have significantly lower running times. For general networks, we show that the time complexity can be reduced to $O(r^{\ast} m+r^{\ast} n \log n)$, where $r^{\ast}$ is at most the number of capacities greater than the capacity of the shortest (with respect to lead time) path in $N$. For sparse networks, we present an algorithm with time complexity $O(n \log n + r^{\ast} n + r^{\ast} \tilde{\gamma} \log \tilde{\gamma})$, where $\tilde{\gamma}$ is a topological measure of $N$. Since for sparse networks $\tilde{\gamma}$ ranges from $1$ up to $\Theta(n)$, this constitutes an improvement over the previously known bound of $O(r n \log n)$ in all cases that $\tilde{\gamma}=o(n)$. For planar networks, the complexity becomes $O(n \log n + n\log^3 \tilde{\gamma}+ r^{\ast} \tilde{\gamma})$. Similar improvements are obtained for the all--pairs quickest path problem. We also give the first algorithm for solving the dynamic quickest path problem.
An Approach to Concurrent Semantics Using Complete Traces
Authors: Kevin S. Van Horn
Venue:  (1986)

No abstract available.
Impredicative Strong Existential Equivalent to Type:Type
Authors: James G. Hook, Douglas J. Howe
Venue:  (1986)

NOT SUPPLIED
On order-invariance of a binomial over a nullifying cell
Authors: Scott McCallum
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

The improved projection operation for cylindrical algebraic decomposition (CAD) described in [10] requires for its validity the crucial concept of order-invariance. A real polynomial f(x1, ..., xr) is said to be order-invariant in a subset c of Rr if the order (of vanishing) of f at the point p is constant as p varies throughout c. The application of the improved projection which is perhaps simplest conceptually is in the construction of a CAD for a set of polynomials which is well-oriented in a certain sense. Given a well-oriented set A of r-variate integral polynomials algorithm CADW [10] uses the improved projection to construct a CAD of Rr which is order-invariant for each polynomial in A. A drawback of CADW is that it halts in failure, reporting that A is not well-oriented, when presented with a non-well-oriented set A as input. Such failure of CADW is potentially serious, because it forces the user to fall back on less efficient projection operators (such as the Collins-Hong projection) for CAD. The present paper describes an efficient method for avoiding the failure of CADW in certain special non-well-oriented cases. The method is based upon a sufficient criterion for the order of a polynomial h(x1, ..., xr) of the special form h = a(x1, ..., xr-1)xrk + b(x1, ldots, xr-1) (which we shall call a binomial in xr) to be 1 throughout the entire cylinder over a nullifying point p in Rr-1 for h (that is, a point p for which h(p, xr) = 0 identically). Following a review of CADW, the sufficient criterion referred to is motivated and proved. The algorithmic application of the criterion is carefully described and validated, and an example discussed.
Delay jitter correlation analysis for traffic transmission on high speed networks
Authors: C. Fulton, San-Qi Li
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

Studies the time-dynamic behavior of delay jitter as captured by the autocorrelation function; the second-order statistics provide information relating to consecutive cell loss in real-time services. The authors derive an expression for delay jitter correlation of a stationary traffic stream in an MMPP/M/1/K system with FIFO service discipline; use of a type of deterministic rate server yields the same correlation function but with reduced variance. The jitter second-order statistics are shown to depend strongly on those of the queue, and the queue second-order statistics depend strongly on those of the input traffic. The authors show that the shape of the jitter correlation is determined by the weighted difference in queue correlations, and they derive a method for obtaining the weights for an MMPP traffic stream. In the numerical study emphasis is placed on a periodic traffic stream (such as CBR video) multiplexed on a major communication node; the authors investigate the impact of input traffic correlations and queueing system parameters on the queue length and delay jitter second-order statistics. They also briefly consider the delay jitter correlation from a binary Markov source (voice model).
A lower-bound result on the power of a genetic algorithm
Authors: Kihong Park
Venue:  (1994)

Abstract This paper presents a lower-bound result on the computational power of a genetic algorithm in the context of combinatorial optimization. We describe a new genetic algorithm, the merged genetic algorithm, and prove that for the class of monotonic functions, the algorithm finds the optimal solution, and does so with an exponential convergence rate. The analysis pertains to the ideal behavior of the algorithm where the main task reduces to showing convergence of probability distributions over the search space of combinatorial structures to the optimal one. We take exponential convergence to be indicative of efficient solvability for the sample-bounded algorithm, although a sampling theory is needed to better relate the limit behavior to actual behavior. The paper concludes with a discussion of some immediate problems that lie ahead.
Fine-Grained Parallel VLSI Synthesis for Commercial CAD on a Network of Workstations
Authors: Victor Kim, Prithviraj Banerjee, Kaushik De
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

We present a fine-grained parallel processing scheme for speeding up an industrial VLSI synthesis tool on a network of workstations without sacrificing the quality of results. The synthesis tool is Ambit BuildGates, high-capacity ASIC logic synthesis software from Cadence Design Systems. We examine some necessary operating conditions for a practical parallel implementation of such software, and propose a parallel approach, which accommodates for the highly irregular computation requirements in synthesis and the high-latency, low-bandwidth conditions of the target environment. For pragmatic as well as performance concerns, we designed a parallel algorithm, which produces results (synthesized logic) that are identical to those of the original uniprocessor algorithm. We employ heuristic load assessment and adaptive cyclic distribution in order to actively balance the unpredictable load throughout execution, which enables a considerable reduction in runtime (i.e. 51.3 hours down to 23.4 hours) on actual customer design benchmarks.
Enhancing Time Triggered Scheduling with Value Based Overload Handling and Task Migration
Authors: Jan Carlson, Tomas Lennvall, Gerhard Fohler
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

Time triggered methods provide deterministic behaviour suitable for critical real-time systems. They perform less favourably, however, if the arrival times of some activities are not known in advance, in particular if overload situations have to be anticipated. In many systems, the criticality of only a subset of activities justify the cost associated with the time triggered methods.In this paper we consider distributed systems where a subset of critical activities are handled in a time triggered fashion, via an offline schedule. At runtime, the arrival of aperiodic tasks may cause overload that demands to be handled in such a way that i) time triggered activities still meet all their original constraints, ii) execution of high-valued tasks are prioritised over tasks with lower value, iii) tasks can be quickly migrated to balance the overall system load.We give a precise formulation of overload detection and value based task rejection in the presence of offline scheduled tasks, and present a heuristic algorithm to handle overload. To benefit from the distributed setting, the overload handling includes an algorithm that integrates migration of rejected tasks with resource reclaiming and an acceptance test of newly arrived tasks.Simulation results underline the effectiveness of the presented approach.
OS Support for P2P Programming: a Case for TPS
Authors: Sébastien Baehni, Patrick Th. Eugster, Rachid Guerraoui
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Just like Remote Procedure Call (RPC) turned out to be a very effective OS abstraction in building client-server applications over LANs, Type-based Publish-Subscribe (TPS) can be viewed as a high-level candidate abstraction for building Peer-to-Peer (P2P) applications over WANs.This paper relates our preliminary, though positive, experience of implementing and using TPS over JXTA, which can be viewed as the P2P counterpart to sockets. We show that, at least for P2P applications with the Java type model, TPS provides a high-level programming support that ensures type safety and encapsulation, without hampering the decoupled nature of these applications. Furthermore, the loss of flexibility (inherent to the use of any high levelabstraction) and the performance overhead, are negligible with respect to the simplicity gained by using TPS.
MIAOW Assessment
Authors: Donatella Castelli, Serena Pisani
Venue:  (1997)

This report documents the MIAOW assessment phase. The task of this phase is to evaluate the MIAOW system with respect to its ability to satisfy the end-user working needs. The evaluation has been carried out following, as far as possible, the indication stated in ISO/IEC 14598-1 protocol. This protocol decomposes the evaluation process in the four steps: 1) Establish evaluation requirements; 2) Specification of the evaluation; 3) Design of the evaluation; 4) Execution of the evaluation.
Achieving the Quality of Verification for Behavioral Models with Minimum Effort
Authors: Tom Chen, Anneliese von Mayrhauser, Amjad Hajjar, Charles Anderson, Mehmet Sahinoglu
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

When designing a system in the behavioral level, one of the most important steps to be taken is verifying its functionality before it is released to the logic/PD design phase. One may consider behavioral models as oracles in industries to test against when the final chip is produced. In this work, we use branch coverage as a measure for the quality of verifying/testing behavioral models. Minimum effort for achieving a given quality level can be realized by using the proposed stopping rule. The stopping rule guides the process to switch to a different testing strategy using different types of patterns, i.e. random vs. functional, or using different set of parameters to generate patterns/test cases, when the current strategy is expected not to increase the coverage. We demonstrate the use of the stopping rule on two complex behavioral level VHDL models that were tested for branch coverage with 4 different testing phases. We compare savings of the number of applied testing patterns and quality of testing both with and without using the stopping rule, and show that switching phases at certain points guided by the stopping rule would yield to the same or even better coverage with less number of testing patterns.
Embedding Formally Proved Code in a Smart Card: Converting B to C
Authors: Antoine Requet, Gaëlle Bossu
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

Smart cards are small-embedded devices with strong security requirements. To fulfill those requirements, formal methods appear as promising techniques. The B method has already been used to model smart card components. However, smart cards have also very strong programming constraints, for both memory usage and computing power. Currently the code generated from a B specification does not meet those constraints. This paper presents some classical optimisation techniques that are well suited for B specifications, and that need to be included within a code generator to embed this generated code.
Cluster Stability and the Use of Noise in Interpretation of Clustering
Authors: George S. Davidson, Brian N. Wylie, Kevin W. Boyack
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

A clustering and ordination algorithm suitable for mining extremely large databases, including those produced by microarray expression studies, is described and analyzed for stability. Data from a yeast cell cycle experiment with 6000 genes and 18 experimental measurements per gene are used to test this algorithm under practical conditions. The process of assigning database objects to an X,Y coordinate, ordination, is shown to be stable with respect to random starting conditions, and with respect to minor perturbations in the starting similarity estimates. Careful analysis of the way clusters typically co-locate, versus the occasional large displacements under different starting conditions are shown to be useful in interpreting the data. This extra stability information is lost when only a single cluster is reported, which is currently the accepted practice. However, it is believed that the approaches presented here should become a standard part of best practices in analyzing computer clustering of large data collections.
CREP&mdash;Characterizing Reverse Engineering Process Component Methodology
Authors: Tortorella Maria, Visaggio Giuseppe
Venue: Proceedings of the International Conference on Software Maintenance (1997)

The past decade has assisted to a growing interest in reverse engineering and to the consequent proliferation of papers and experience reports about this subject from both academic and industrial environments. Many types of reverse engineering process components (i.e. methods, algorithms, techniques, procedures, processes model, etc.) have been proposed. To be able to reuse effectively the published results, it is needed to characterize the process components, understand the similitude and differentiate them, and choose the ones to be used either alternatively or together in the same process. The Characterizing Reverse Engineering Process component methodology (CREP) is a systematic and defined approach to compare either processes or process components. It provides the definition of a characterizing evaluation schema specialized for the reverse engineering. The first phase of the CREP method formalizes the process components, and constructs the process models; while, the second phase characterizes the process components highlighting their most peculiar concepts and grouping the homogenous information.
Supercomputing ''90 BOF Session on Standardizing Parallel Trace Formats
Authors: Cherri M. Pancake, Dennis Gannon, Sue Utter, Donna Bergmark
Venue:  (1991)

As part of last year''s Supercomputing ''90, there was a Birds of Feather session on standardizing the trace files that come out of parallel program execution. This report contains the minutes of that meeting. Cherri Pancake, Auburn University, introduced the meeting and the participants. Objectives of the meeting were to determine what we want to do about standardizing trace formats, particularly for parallel processing. Standardization would allow system-independent tools to be developed; it also would allow the sharing of traces and perhaps even performance comparisons for applications on different machines and systems. Discussion in this BOF was limited to application performance and did not include system performance.
Where is knowledge in robotics? some methodological issues on symbolic and connectionist perspectives of AI
Authors: J. Mira, A. E. Delgado
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

In this chapter we consider a number of methodological issues to which little importance is normally attributed in robotics but which we consider essential to the development of integrated methods of soft and hard computing and to the understanding of the artificial intelligence (AI) purpose and fundamentals.The basic conjecture in this chapter is that knowledge always remains at the knowledge level and in the external observer's domain. To the robot only pass the formal model underlying these models of knowledge. Consequently, there are neither essential differences between symbolic and connectionist techniques nor between soft and hard computing. They are different inferences and problem-solving-methods (PSMs) that belong to a library and that are selected to be used in a sequential or concurrent manner according to the suitability for decomposing the task under consideration, until we arrive to the level of inferential primitives solved in terms of data and relations specific of the application domain.The distinctive characteristics of hard and soft computing methods are related to the balance between knowledge and data available in advance, the granularity of the model or the necessity and capacity of learning in real time. Nevertheless, in all these cases the knowledge (the meaning of the entities and relations of the model) always is outside the robot, at the knowledge level, the "house" of models.In many publications, the robotic programs are described without including any distinction between levels and domains of description of a calculus. As a result, it is generally difficult to determine what the robot actually performs, which knowledge has been represented, and which is artificially injected during the human interpretation of the robots behavior.In order to make clear this methodological issues we consider the taxonomy of levels introduced by Marr [1] and Newell [2] (Knowledge, Symbols, and Hard-ware) put on the top of the two domains of description of a calculus (the domain proper of each level and that of the observer external to the computation of the level). Then, we describe the usual approach to modeling and reduction of models from the knowledge to the symbol level and finally we illustrate the analogies and differences between different models and reduction processes including the operational stage, either symbolic, connectionist, probabilistic or fuzzy. In all the cases our conviction is that most of the work must be made by modeling tasks and PSMs at the knowledge level, where it is crystal clear that soft and hard computing are complementary and ready to be integrated.
Euclidean Reconstruction and Reprojection Up to Subgroups
Authors: Yi Ma, Stefano Soatto, Jana Kosecka, Shankar Sastry
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

The necessary and sufficient conditions for being able to estimate scene structure, motion and camera calibration from a sequence of images are very rarely satisfied in practice. What exactly can be estimated in sequences of practical importance, when such conditions are not satisfied? In this paper we give a complete answer to this question. For every camera motion that fails to meet the conditions, we give explicit formulas for the ambiguities in the reconstructed scene, motion and calibration. Such a characterization is crucial both for designing robust estimation algorithms (that do not try to recover parameters that cannot be recovered), and for generating novel views of the scene by controlling the vantage point. To this end, we characterize explicitly all the vantage points that give rise to a valid Euclidean re-projection regardless of the ambiguity in the reconstruction. We also characterize vantage points that generate views that are altogether invariant to the ambiguity. All the results are presented using simple notation that involves no tensors nor complex projective geometry, and should be accessible with basic background in linear algebra.
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
Authors: Jie Wu, Hailan Li
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

We consider an efficient distributed algorithm for determining a dominating and absorbent set of vertices (mobile hosts) in a given directed graph that represents an ad-hoc wireless network with unidirectional links. This approach is based on the concept of dominating set in graph theory. A host v is called a dominating neighbor (absorbent neighbor) of another host u if there is a directed edge (v; u) ((u; v)). A subset of vertices is dominating and absorbent if every vertex not in the subset has one dominating neighbor and one absorbent neighbor in the subset. A quick formation process of a dominating and absorbent set is given and this set can be easily updated when the network topology changes dynamically. Ideas for dominating-set-based routing in an ad-hoc wireless network with unidirectional links are also given. The effectiveness of the approach is confirmed through a simulation study.
Telepointer: Hands-Free Completely Self Contained Wearable Visual Augmented Reality without Headwear and without any Infrastructural Reliance
Authors: Steve Mann
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

Telepointer is a wearable hands-free, headwear-free device that allows the wearer to experience a visual collaborative telepresence, with text, graphics, and a shared cursor, displayed directly on real world objects. A mobile person wears the device clipped onto his tie, which sends motion pictures to a video projector at a base (home) where another person can see everything the wearer sees. When the person at the base points a laser pointer at the projected image of the wearer's site, the wearer's aremac's servo's points a laser at the same thing the wearer is looking at. It is completely portable and can be used almost anywhere since it does not rely on infrastructure. It is operated through a Reality User Interfaces (RUI) that allows the person at the base to have DIRECT interaction with the real world of the wearer, establishing a kind of computing that is completely free of metaphors, in the sense that a laser at the base controls the wearable laser aremac.