ppxscal/embedding_network huggingface dataset:
On two families of paradigms of group-solvability
Authors: Alessandro Agostini
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We advance and compare two families of coalitional paradigms of solvability.A coalitional paradigm is distinguished from a "noncoalitional" paradigm primarily by its focus on what groups of agents can achieve, rather than on what individual agents can do---even if cooperating. As a criterion of group formation, our models engage a kind of pairwise, context-dependent coordination between knowledge-based "LAGs," eventually able to communicate the complete & local meaning of expressions taken from the literals of a common first-order language.
Asynchronous Checkpointing Protocol for Object-Based Systems
Authors: Katsuya Tanaka, Makoto Takizawa
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

We discuss how to take checkpoints in object-based systems. Object-based checkpoints are consistent in the object-based system but may be inconsistent according to the traditional message-based definition.We present an asynchronous protocol for taking object-based checkpoints among objects. An object to take a checkpoint in the traditional protocol does not take a checkpoint if the current checkpoint is object-based consistent with the other objects. The number of checkpoints can be reduced by the protocol.
Collective intelligence of the artificial life community on its own successes, failures, and future
Authors: Steen Rasmussen, Michael J. Raven, Gordon N. Keating, Mark A. Bedau
Venue: Artificial Life (2003)

We describe a novel Internet-based method for building consensus and clarifying conflicts in large stakeholder groups facing complex issues, and we use the method to survey and map the scientific and organizational perspectives of the artificial life community during the Seventh International Conference on Artificial Life (summer 2000). The issues addressed in this survey included artificial life's main successes, main failures, main open scientific questions, and main strategies for the future, as well as the benefits and pitfalls of creating a professional society for artificial life. By illuminating the artificial life community's collective perspective on these issues, this survey illustrates the value of such methods of harnessing the collective intelligence of large stakeholder groups.
Parallel Efficiency: The Dataflow Advantage
Authors: John Morris
Venue: Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (1999)

Dataflow computation models enable simpler and more efficient management of the memory hierarchy - a key barrier to the performance of many parallel programs.This paper enumerates some advantages of using the dataflow model; it argues that the programming model is simple and easily managed by a programmer and demonstrates some of the efficiencies that the dataflow model allows an underlying run-time system to achieve.
Using $\cal SEEK$ for Multi-Channel Pattern Recognition
Authors: Kenneth P. Birman
Venue:  (1982)

Our work on computerized analysis of the 2-channel, 24-hr electrocardiogram has resulted in the development of multi-channel signal processing systems that learn by observation. In this paper a new tool for implementing such algorithms is described: the pattern recognition language $\cal SEEK$. Programs written in $\cal SEEK$ build a knowledge base containing tree-like data structures, each of which stores acquired information about a particular multi-channel waveform. Input data is interpreted by performing an efficient parallel evaluation of the structures in the knowledge base. Our work is applicable to a wide variety of pattern recognition problems that arise in medical signal processing. The approach is illustrated with examples drawn from ECG analysis.
The Robin Williams Mac OS X Book, Jaguar Edition, 2 edition
Authors: Robin Williams
Venue:  (2002)

:No other author documents the Mac OS the way Robin Williams does. In The Robin Williams Mac OS X Book, Jaguar Edition updated to include Mac OS X 10.2, she brings her inimitable approach to Apple's radically redesigned OS, eschewing jargon for straightforward explanations and a good dose of humor. It's an approach that works equally as well for newcomers looking for a gentle introduction to the Macintosh as it does for experienced Mac users upgrading to Mac OS X 10.2.This practical, how-to guide covers all of the exciting new features in Mac OS X 10.2, including the revamped Finder, new instant messaging client, global address book, spam-blocking email program, QuickTime 6, Sherlock 3, and more. Robin doesn't neglect the basics either. You'll find logical, easy-to-follow sections on how to use your Mac for a variety of everyday tasks: printing, sending email, exchanging files, and surfing the Web. And for those frustrating moments When Things Go Wrong, Robin has compiled a troubleshooting guide for common Mac snafus. See for yourself why Robin's books have won her millions of fans.
An efficient parallel algorithm for the planar mincut linear arrangement problem for trees
Authors: Sung Kwon Kim
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

The MINCUT problem for graphs is to find a linear arrangement with minimum cut. The problem is NP-complete for general graphs while polynomial-time solvable for trees. The PLANAR MINCUT problem does not allow edge crossings in arrangements. We present a parallel algorithm for the PLANAR MINCUT problem for trees with n vertices, which takes O(log/sup 2/ n) time and O(n) processors in the EREW PRAM.
Efficient Remote Data Access in a Mobile Computing Environment
Authors: Laura Bright, Louiqa Raschid
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

We consider the problem of remote data access for multiple clients in mobile computing environments. In this environment, a base station provides a wireless communication link between mobile clients and remote servers that reside on a fixed network. Clients send requests to the base station for objects, which reside on the remote servers. The base station downloads these objects from the remote servers and transmits them to the clients. A drawback in this environment is that remote data access across a fixed network is slow. When locally cached copies of data exist at the base station, accessing them reduces latency. However, the cached data becomes old, as data that is more recent is made available at the remote servers. In this paper, we consider a framework that allows mobile clients to specify their preferences about recency. The objective is to maximize the recency of the data for all clients while delivering data to clients as quickly as possible. We develop an on-demand strategy which determines when the base station should access data from remote servers and when it should return data copies from its cache. We present analytical results that show the benefits of the on-demand approach.
J2ME: The Complete Reference, 1 edition
Authors: James Keogh
Venue:  (2003)

:This comprehensive resource covers J2ME architecture and explains how to build applications and services for cell phones and PDAs with J2ME. You'll also get details on security, information management, and storage, as well as advanced topics such as Mobile Information Device Profile (MIDP) and Connected Limited Device Configuration (CLDC)
Design for Quality and Manufacturing
Authors: Prakash Agrawal
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

This presentation will discuss from a CEO's perspective the process needed to design a quality chip for manufacturing. It will cover the milestones necessary for bringing a successful chip to market. Discussion highlights will focus first on a well thought out analysis of market requirements, taking into account the product roadmaps and feature requirements of your major customers, the competition, the potential market size, and the delivery schedule necessary to hit the window of opportunity to sell the new product. Next, it will focus on how to proceed with a thorough evaluation of your company's internal variables, such as your technology roadmap, cost analysis, capability of strategic partners, capacity requirements, and return on investment. Finally, it will give tips on evaluating the results of matching the market requirements with your company's internal capabilities. It will mention some of the well-known design tools and practices used in the industry that can help you assure the built-in quality necessary to meet manufacturing standards and market needs. 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
Dynamically managing the communication-parallelism trade-off in future clustered processors
Authors: Rajeev Balasubramonian, Sandhya Dwarkadas, David H. Albonesi
Venue: ACM SIGARCH Computer Architecture News (2003)

Clustered microarchitectures are an attractive alternative to large monolithic superscalar designs due to their potential for higher clock rates in the face of increasingly wire-delay-constrained process technologies. As increasing transistor counts allow an increase in the number of clusters, thereby allowing more aggressive use of instruction-level parallelism (ILP), the inter-cluster communication increases as data values get spread across a wider area. As a result of the emergence of this trade-off between communication and parallelism, a subset of the total on-chip clusters is optimal for performance. To match the hardware to the application's needs, we use a robust algorithm to dynamically tune the clustered architecture. The algorithm, which is based on program metrics gathered at periodic intervals, achieves an 11% performance improvement on average over the best statically defined architecture. We also show that the use of additional hardware and reconfiguration at basic block boundaries can achieve average improvements of 15%. Our results demonstrate that reconfiguration provides an effective solution to the communication and parallelism trade-off inherent in the communication-bound processors of the future.
A note on scheduling multiprocessor tasks with identical processing times
Authors: Philippe Baptiste
Venue: Computers and Operations Research (2003)

We study the scheduling situation where n tasks with identical processing times have to be scheduled on m parallel processors. Each task is subjected to a release date and requires simultaneously a fixed number of processors. We show that, for each fixed value of m, the problem of minimizing total completion time can be solved in polynomial time. The complexity status of the corresponding problem Pm|ri, Pi = p, sizei| Σ Ci was unknown before.
Implementing responsibility for states and events
Authors: Martin J. Kollingbaum, Timothy J. Norman, Chris Reed
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Contracts in the real world often rest upon a notion of responsibility, by which parties commit to the fulfilment of particular imperatives embedded in the contract. Responsibility is not the same as direct action, nor commitment to such action: a canonical example is where imperatives are issued, in a particular context, to effect the delegation of responsibility. Furthermore, responsibility can range not only over particular activities, but also over particular states of the world. This paper first explains the problem of state-based and event-based responsibility, and then illustrates how this is operationalised in the NoA system through the use of an example.
Route planning and map inference with global positioning traces
Authors: Stefan Edelkamp, Stefan Schrödl
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

Navigation systems assist almost any kind of motion in the physical world including sailing, flying, hiking, driving and cycling. On the other hand, traces supplied by global positioning systems (GPS) can track actual time and absolute coordinates of the moving objects.Consequently, this paper addresses efficient algorithms and data structures for the route planning problem based on GPS data; given a set of traces and a current location, infer a short(est) path to the destination.The algorithm of Bentley and Ottmann is shown to transform geometric GPS information directly into a combinatorial weighted and directed graph structure, which in turn can be queried by applying classical and refined graph traversal algorithms like Dijkstras' single-source shortest path algorithm or A*.For high-precision map inference especially in car navigation, algorithms for road segmentation, map matching and lane clustering are presented.
Visual Metaphors to Enhance Hypermedia
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper argues that whilst hypermedia systems potentially have a major role to play in education there is the danger that they tend to engender cognitive and navigational overhead in their users, which in turn detracts from their educational value. A potentially valuable means of ameliorating this difficulty is to use metaphors to aid the user as they interact with the system. The value of metaphors in overcoming the problems of cognitive overloading and navigational overhead is discussed and an experimental study proposed to investigate the design and deployment of suitable metaphors in this context.
Programming with Communicating Nondeterministic Logic Objects
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Object-oriented logic programming (OOLP) is a hybrid of object-orientation and logic programming paradigms. In this paper, we present a new object-oriented logic programming language P&P. P&P supports programming with communicating nondeterministic objects and stream parallelism for communication among objects. Intuitively, each object has a Parlog `shell' with Prolog `contents.' One concern in our design is to integrate Prolog's backtracking, sequential search with Parlog's concurrent execution. Hence P&P supports committed inter-object message passing via the Parlog `shell' of the objects. Also, object-oriented features are added to provide encapsulation and code reuse. 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
An efficient traffic control scheme for integrated voice, video and data over ATM networks: explicit allowed rate algorithm (EARA)
Authors: A. Dinesh, M. Moh
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

ATM networks are networks with guaranteed quality of service. The main cause of congestion in ATM networks is over utilization of the physical bandwidth. Unlike constant bit rate traffic, the bandwidth reserved by variable bit rate (VBR) traffic is not fully utilized at all instances. Hence, this unused bandwidth is allocated to available bit rate traffic (ABR). As the bandwidth used by VBR traffic changes, the available bandwidth for ABR traffic varies, i.e., the available bandwidth for ABR traffic is inversely proportional to the bandwidth used by the VBR traffic. Based on this fact, a rate based congestion control algorithm, explicit allowed rate algorithm (EARA), is presented. The EARA is compared with the proportional rate control algorithm (PRCA) and explicit rate indication congestion avoidance algorithm (ERICA), under congestion and fairness configurations. The results show that, with a minimal overhead on the switch, the EARA significantly decreases the required buffer space and improves the network throughput.
Binary decision diagrams by shared rewriting
Authors: J. C. Pol, Hans Zantema
Venue:  (2000)

BDDs provide an established technique for propositional formula manipulation. In this paper we re-develop the basic BDD theory using standard rewriting techniques. Since a BDD is a DAG instead of a tree we need a notion of shared rewriting and develop appropriate theory. A rewriting system is presented by which canonical ROBDDs can be obtained. For this rewriting system a {\em layerwise} strategy is proposed having the same time complexity as the traditional algorithm, and a {\em lazy} strategy sometimes performing much better than the traditional algorithm.
The relationship amongst coefficient matrices in symmetric Galerkin BEM for 2D elastic problems
Authors: G. Y. Yu
Venue: Advances in Engineering Software (2003)

Based on the assumption that solutions from different methods are the same, the relationship amongst weakly singular, strongly singular and hypersingular matrices associated with symmetric Galerkin BEM is derived for 2D elastic problems. Hypersingularity is avoided through matrix manipulations so that only weakly and strongly singularities need to be solved. Compared with the advantages brought about by symmetry, the additional computation caused by matrix manipulations is not so important in many cases, especially for time domain dynamic problems or when one wants to couple BEM with other symmetric schemes. Both static and dynamic problems have been studied, and three numerical examples are included to show the effectiveness and accuracy of the present formulation.
Algoritmi di tipo Gradiente Coniugato su Sistemi Distribuiti a Memoria Condivisa
Authors: P. Lanucara, S. Rovida.
Venue:  (1999)

It is well known that Conjugate-Gradients algorithms are wildly used for the solution of large scale linear systems as they are competitive among the available fast iterative schemes and their parallelization appears to be straightforward since there is a potential parallelism to be exploited at each step. In this paper we present a parallel implementation, on distributed shared memory architectures using the SPMD programming paradigm, of the BiCGSTAB algorithm associated with some algebraic preconditioners. We analyze the programming environment supplied by an SMP cluster of 4 Digital AlphaServer 4100 with 4 processors each, interconnected with Memory Channel to handle data communication and data distribution. We compare the performance of different implementations of the algorithms: one based on the MPI message passing interface and the other one based on the mix of MPI for message passing among different nodes and GUIDE from KAP/Pro Toolset to exploit parallelism within each SMP node through the use of standard OpenMP directives. This multilevel parallelism can be also obtained with a combination of MPI and the Digital Extended Math Library Pthreads, a multi-threaded version of the BLAS, LAPACK routines, available on the considered architecture.
Generation of Propagation Rules for Intentionally Defined Constraints
Authors: Slim Abdennadher, Christophe Rigotti
Venue: Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (2001)

A general approach to implement propagation and simplification of constraints consists of applying rules over these constraints. However, a difficulty that arises frequently when writing a constraint solver is to determine the constraint propagation algorithm. In previous work, different methods for automatic generation of propagation rules for constraints defined over finite domains have been proposed.In this paper, we present a method for generating propagation rules for constraint predicates defined by means of a constraint logic program.
ODAC: An Agent-Oriented Methodology Based on ODP
Authors: Marie-Pierre Gervais
Venue: Autonomous Agents and Multi-Agent Systems (2003)

The ODAC methodology (Open Distributed Applications Construction) aims to provide a designer of agent-based systems with a set of methods and tools to allow him/her to control the construction process complexity of such systems. It enables software engineers to specify agent-based systems that will be implemented within an execution environment, for example a mobile agent platform. Our work is based on the Open Distributed Processing (ODP) standards and the agent paradigm.
Document clustering based on non-negative matrix factorization
Authors: Wei Xu, Xin Liu, Yihong Gong
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

In this paper, we propose a novel document clustering method based on the non-negative factorization of the term-document matrix of the given document corpus. In the latent semantic space derived by the non-negative matrix factorization (NMF), each axis captures the base topic of a particular document cluster, and each document is represented as an additive combination of the base topics. The cluster membership of each document can be easily determined by finding the base topic (the axis) with which the document has the largest projection value. Our experimental evaluations show that the proposed document clustering method surpasses the latent semantic indexing and the spectral clustering methods not only in the easy and reliable derivation of document clustering results, but also in document clustering accuracies.
Progress Measures and Finite Arguments for Infinite Computation
Authors: Nils Klarlund
Venue:  (1990)

We establish principles for proving properties about infinite computations by reasoning about finite ones. We apply these principles to show that for a wide variety of verification problems involving nondeterminism, fairness, and liveness there are assertional verification methods that directly relate program and specification. Most previous research relies on transformations of programs in order to reduce a verification problem to problems that can be solved using classical techniques such a refinement mappings and well-founded orderings. Progress measures, the key innovation of this thesis, provide direct, syntax-independent verification techniques for a wide range of specifications. We exhibit progress measures for the language containment problem for nondeterministic automata; for verification with general fairness constraints; and for verification of very general specifications, including infinitary temporal logics. We obtain and optimal solution (in a recursion-theoretic sense) to the problem of verifying infinite computations by reasoning about finite ones. This result establishes a link between descriptive set theory and the theory of verification.
A Note on Set Systems with no Union of Cardinality 0 Modulo m
Authors: Grolmusz Vince
Venue:  (2000)

Alon, Kleitman, Lipton, Meshulam, Rabin and Spencer (Graphs. Combin. 7 (1991), no. 2, 97-99) proved, that for any hypergraph ${\cal F}=\{F_1,F_2,\ldots, F_{d(q-1)+1}\}$, where $q$ is a prime-power, and $d$ denotes the maximal degree of the hypergraph, there exists an ${\cal F}_0\subset {\cal F}$, such that $|\bigcup_{F\in{\cal F}_0}F|\equiv 0\pmod{q}$. We give a direct, alternative proof for this theorem, and we also give an explicit construction of a hypergraph of degree $d$ and size $\Omega(d^2)$ which does not contain a non-empty sub-hypergraph with a union of size 0 modulo 6.