ppxscal/embedding_network huggingface dataset:
The Motivation for Dynamic Adaptive Autonomy in Agent-based Systems
Authors: K. S. Barber
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Agent-based systems require flexibility to perform effectively in complex and dynamic environments. Previous research has identified numerous motivations for adaptability in agent-based systems; however, the extent of this adaptability can be expanded. This paper shows that agents should be able to benefit from controlling the problem-solving frameworks (also called planning-interaction frameworks) under which they plan for their goals. Dynamic Adaptive Autonomy (DAA) allows agents to control their planning-interaction styles, called autonomy levels, along a defined spectrum (from command-driven to consensus to locally autonomous/master). This allows agents to dynamically form, modify, or dissolve goal-oriented problem-solving groups. This paper presents one motivation for DAA through experiments showing that the best type of problem-solving framework for a group of agents depends not only on the problem domain and the pre-defined characteristics of the system, but also on run-time factors that can change during system operation. Thus, it is possible for agents to benefit from the capability to dynamically adapt their problem-solving framework to their situation.
Fast and sound two-step algorithms for multiple alignment of nucleic sequences
Authors: S. Abdeddaim
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

The authors report on their work on multiple alignment of biological sequences. The observation of actual alignments has lead the authors to formulate heuristics from which they have derived new and efficient algorithms. These two algorithms are very fast and give reasonably good results. They work in two steps: blocks are found in the sequences, and then the sequences are aligned between the blocks. Strong and sound hypotheses made at every step, as well as a new representation of blocks, yield high efficiency of the resulting algorithms.
STEPS: A Software Tool-set for automatEd Protocol Synthesis
Authors: Hakim Kahlouche
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

Protocol synthesis represents an important alternative to the classical design process based on reachability analysis where the fundamental drawback is the exponential growth of reachable states. In order to demonstrate the usefulness and the feasibility of our protocol synthesis approach, we have developed a software tool-set for automated protocol synthesis called STEPS which supports our synthesis approach. The aim of this paper is to present the functionalities and an experimentation of STEPS. We also propose a new protocol development methodology based on our synthesis approach.
{\bf (Revision of CS-1993-17.)} Scoping Construct in Logic Programming: Implementation Problems and Their Solution
Authors: Gopalan Nadathur, Bharat Jaharaman, Keehang Kwon
Venue:  (1994)

The inclusion of universal quantification and a form of implication in goals in logic programming is considered. These additions provide a logical basis for scoping but they also raise new implementation problems. When universal and existential quantifiers are permitted to appear in mixed order in goals, the devices of logic variables and unification that are employed in solving existential goals must be modified to ensure that constraints arising out of the order of quantification are respected. Suitable modifications that are based on attaching numerical tags to constants and variables and on using these tags in unification are described. The resulting devices are amenable to an efficient implementation and can, in fact, be assimilated easily into the usual machinery of the Warren Abstract Machine (WAM). The provision of implications in goals results in the possibility of program clauses being added to the program for the purpose of solving specific subgoals. A naive scheme based on asserting and retracting program clauses does not suffice for implementing such additions for two reasons. First, it is necessary to also support the resurrection of an earlier existing program in the face of backtracking. Second, the possibility for implication goals to be surrounded by quantifiers requires a consideration of the parameterization of program clauses by bindings for their free variables. Devices for supporting these additional requirements are described as also is the integration of these devices into the WAM. Further extensions to the machine are outlined for handling higher-order additions to the language. The ideas presented here are relevant to the implementation of the higher-order logic programming language $\lambda$Prolog.
Simulating Realistic Bridging and Crosstalk Faults in an Industrial Setting
Authors: Jonathan Bradford, Hartmut Delong, Ilia Polian, Bernd Becker
Venue: Journal of Electronic Testing: Theory and Applications (2003)

Three different techniques for simulating realistic faults generated from IC layout are discussed. Two of them deal with bridging faults, and the third one handles crosstalk faults. The simulation is performed on top of a commercial simulator and thus is very well applicable in an industrial environment. No change of the design database and only minimal changes of the test shell are required. Experimental results are reported for a library cell and a block from a full-custom design.
Capacity Reservation in ATM Networks
Authors: Gunnar Karlsson
Venue:  (1995)

The research on traffic control has not yet lead to a consensus on how to properly allocate resources in ATM networks. There are consequently no practicable methods available now when the initial deployment of ATM switches and terminals is under way. Yet, many of the applications which motivate the deployment uses multi-media and will thus require some degree of performance guarantees on the information transfer. Here we suggest a readily applicable method for reserving capacity in ATM networks. Cells using the reserved capacity may only depart at fixed time-instances, and have reserved buffers in the network nodes. The scheme gives a lossless performance, can be implemented with low complexity; it simplifies the call-acceptance and allows ``best effort'''' traffic to use slack in the reserved and all of the non-reserved capacity.
Computation in a single Neuron: Hodgkin and Huxley revisited
Authors: Blaise Agüera y Arcas, Adrienne L. Fairhall, William Bialek
Venue: Neural Computation (2003)

A spiking neuron "computes" by transforming a complex dynamical input into a train of action potentials, or spikes. The computation performed by the neuron can be formulated as dimensional reduction, or feature detection, followed by a nonlinear decision function over the low-dimensional space. Generalizations of the reverse correlation technique with white noise input provide a numerical strategy for extracting the relevant low-dimensional features from experimental data, and information theory can be used to evaluate the quality of the low-dimensional approximation. We apply these methods to analyze the simplest biophysically realistic model neuron, the Hodgkin-Huxley (HH) model, using this system to illustrate the general methodological issues. We focus on the features in the stimulus that trigger a spike, explicitly eliminating the effects of interactions between spikes. One can approximate this triggering "feature space" as a two-dimensional linear subspace in the high-dimensional space of input histories, capturing in this way a substantial fraction of the mutual information between inputs and spike time. We find that an even better approximation, however, is to describe the relevant subspace as two dimensional but curved; in this way, we can capture 90% of the mutual information even at high time resolution. Our analysis provides a new understanding of the computational properties of the HH model. While it is common to approximate neural behavior as "integrate and fire," the HH model is not an integrator nor is it well described by a single threshold.
Virtual Reality Used in a Collaborative Architectural Design Process
Venue: Proceedings of the International Conference on Information Visualisation (2000)

This paper presents a project and where the possibilities to use Virtual Reality in architectural design processes are examined. The main goal of the project is to develop a process for collaborative design of laboratory layouts using VR (Cave-technology) as a tool integrated into the concepts of Process Architecture. The project has been carried through in cooperation with the Chemical Department at Lund Institute of Technology/Lund University. It is a ¿real¿ project integrated in the University's programming process. A workshop initiated the design process and was followed by a series of different design events, which were arranged with the participants from one research and one education laboratory. At these events, the participants made several visits to their future labs in a VR-Cave. The visits were alternated with more traditional design sessions with paper and pencils. The results show that the collaborative design process including VR helped the users by providing a method with which their ideas could be better formulated, analyzed, tested and finally realized. The results from the project have been incorporated into the building program for the new Chemical laboratory building.
Hardware/software cosynthesis: multiple constraint satisfaction and component retrieval
Authors: R. Miller, H. Carter, K. Davis, S. Venkatesan
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Hardware/software cosynthesis is a complex process that involves transforming a high-level system specification to an implemented hardware/software system that meets the specification constraints. One phase of the cosynthesis process is described: partitioning the specification into components and binding them to hardware/software resources. Partitioning requires an effective means to explore the design space, challenges include: supporting constraint-driven retrieval; and evaluating candidate solutions considering the interaction of multiple constraints. The cosynthesis tool described assigns scores to candidate solutions using multiple design constraints, but rather than the simple sum approach predominant in cosynthesis research, it uses a vector of rank data that does not require that equal weight be given to all criteria. Our results to date show that not only can we process a scaleable, selectable set of design constraints, but when compared with a 2 constraint Fidducia-Matheyses (FM) approach, we achieve better results. The flexible component retrieval is accomplished using our database system; the database is unique for three reasons: it uses a hardware description language as the basis for its conceptual model; it allows flexible, ad hoc querying over designs; and it uses a fine granularity of component modeling to enable detailed search conditions required by the cosynthesis tool.
Derivation of the Ellipsoid Algorithm
Authors: Mike Karr, Srinivasan Krishnan, John Reif
Venue:  (1991)

\indent In the recent past a number of algorithms for linear programming have been published. In this paper we present an informal derivational framework for linear programming algorithms, and derive the ellipsoid method using the ideas in this framework. The natural exposition circumvents the tedious {\em posteriori} correctness proof.
Non-linear coupled heat and moisture analysis of concrete
Authors: M. Kulhavý, Z. Bittnar
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents the approach for the numerical modelling of heat and moisture transfer. The already developed model, by Prof. Bazant, for moisture transfer with the non-linear material model to 90°C has been modyfied for the coupled problem. The implemented non-stationary and non-linear model has been implemented to the object-oriented software ATEN A, The model has been tested and used for the analysis of real structure -- duct where the sufficient numerical stability of the proposed algorithm has been proved.
A note on parallel executions of restrictive blind issuing protocols for secret-key certificates
Authors: Stefan A. Brands
Venue:  (1995)

The receiver in a restrictive blind certificate issuing protocol can blind the issued public key and the certificate but not a certain blinding-invariant predicate of the secret key. Recently a generally applicable technique was described for designing restrictive blind issuing protocols for a certain type of secret-key certificates, and it was shown that the resulting issuing protocols should not be run in parallel since that would enable an attack in which completely blinded triples can be retrieved. To allow the signer in highly demanding applications to run the restrictive blind certificate issuing protocol in parallel mode, a simple technique for modifying the issuing protocols was proposed. In this note it is shown that the proposed modification technique does not overcome the parallel attack problem.
On the Diameter of the Generalized De Bruijn Graphs uGB(n, n2 + 1)
Authors: J. Caro, L. Nochefranca, P. Sy
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

The generalized de Bruijn graph UGB (n, n2 + 1) is thegraph with vertex set V = { 0, 1, . . . , n2} and the neighbor-hood N (i) of i ? V is N(i) = X(i) n Y(i) where X(i) ={in + d(mod n2 + 1) : a ? D and [(2i -MA) + (n2 +l)Z] n D = }, Y(i) = {(p - i)n(mod n2 + 1) : β ? Dand [(/β-2i)n+(n2+1)Z]flD = $}.Znthispuper,weshall show that the diameter of UGB (n, n2 + 1) is at most4for n odd and n l\geq 5
Loop Quantization: Unwinding for Fine-Grain Parallelism Exploitation
Authors: Alexandru Nicolau
Venue:  (1985)

Loop unwinding is a well known technique for reducing loop overhead, exposing parallelism and increasing the efficiency of pipelining. Traditional loop unwinding is limited to the innermost loop in a group of nested loops and the amount of unwinding is either fixed or has to be specified by the user, on a case by case basis. In this paper we present a general technique for automatically unwinding multply nested loops, explain its advantages over other transformation techniques and illustrates its practical effectiveness. 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
Electronic Commerce: B2C Strategies and Models
Authors: Steve Elliott
Venue:  (2002)

:Notwithstanding the NASDAQ upheavals in 2000, industry is continuing to embrace the concepts of Electronic Commerce. However, a major barrier to more widespread implementation of Electronic Commerce is uncertainty within organizations as how best to proceed. Based on research in six economies - the UK, USA, Denmark, Greece, Hong Kong (China) and Australia, this much needed guide to the implementation of business-to-consumer electronic commerce addresses the documented uncertainties of business and consumers with Internet retailing by presenting the experiences of leading examples of Business to Consumer Electronic Commerce in each of six economies. The countries represent a broad range of environments to identify issues that may be specific to a particular market. The firms have been selected as significant examples of Internet retailing in industry sectors recognized as leaders in the use of the Internet, including; travel, books, music CDs, technology sales, gifts, groceries and general merchandise.
Directing Web Traffic: How to Get Users to Your Site and Keep Them There
Authors: Philip Smith
Venue:  (2002)

:This book is about how to create interest and awareness around a web site: how to keep visitors there as long as you need them and ensure that they see what you want them to. It also explains how to extract the information you need and strike up a relationship that continues after their departure from the site. Unlike most books on web site promotion, Directing Web Traffic is a book by designers for designers. It is about how to use design effectively for the Internet, not only within a web browser but also in emerging technologies such as WAP and interactive television. It shows how creative off- and online promotional strategies generate interest in a site, and how design can ensure that interest is both maintained and directed. From search engine optimisation to pop-up advertisements, from navigation to affiliate deals, from online surveys to guerilla marketing - tried and tested techniques are covered in detail. Profiles of successful sites and campaigns show how good Web marketing works, and examples of bad practice show what to avoid. 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
Distributed resource monitors for mobile objects
Authors: M. Ranganathan, A. Acharya, J. Saltz
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

We present our position on resource monitoring as three working hypotheses. First, a resource-aware placement of components of a distributed application can provide significant performance gains over a resource-oblivious placement. Second, effective mobility decisions can be based on coarse-grained monitoring. Finally, a simple and cheap distributed resource monitoring scheme can provide sufficient information for effective mobility decisions. We present a design for distributed resource monitors which we believe can provide effective resource information at an acceptable cost.
Workload Characterization and Locality Management for Coarse-Grain Multiprocessors
Authors: Christopher Connelly, Schlatter C Ellis
Venue:  (1994)

Scalable shared memory multiprocessors commonly employ replication and the associated coherency maintenance of memory blocks, but differ in the granularity from fine-grain (cache-coherent multiprocessors) to coarse-grain (page-based distributed shared memory systems). Regardless of the size of coherency blocks, attaining good performance may depend on the number of copies staying small. Previous workload characterization studies of fine-grain systems have shown sharing patterns that tend toward small {\it worker sets \/} (set of processors sharing a block). Coarse-grain architectures offer scalability advantages unless the sharing patterns for larger coherency blocks are considerably less favorable. This is the question we address in this paper. Our results are encouraging in that, despite the coarse granularity, worker sets scale reasonably.
Robot Builder's Bonanza, 3 edition
Authors: Gordon McComb
Venue:  (2003)

:A major revision of the bestselling "bible" of amateur robotics buildingpacked with the latest in servo motor technology,microcontrolled robots,remote control,Lego Mindstorms Kits,and other commercial kits. Gives electronics hobbyists fully illustrated plans for 11 complete Robots,as well as all-new coverage of Robotix-based Robots,Lego Technic-based Robots,Functionoids with Lego Mindstorms,and Location and Motorized Systems with Servo Motors. Features a pictures and parts list that accompany all projects,and material on using the BASIC Stamp and other microcontrollers. Robots that walk,see,feel,talk,listen,and think. Remote-controlled robots and robots that find their own way. A robotic arm and a robotic bug. Robots made from toys,and robots controlled by computers. Robots with "brains. " You can build them all from plans in this book,or design your own. Just look inside. This updated edition of Gordon McComb's best-selling Robot Builder's Bonanza features fascinating science tidbits,field-tested projects,and modular organization to make it easy to invent and build your own designs. Full appendices provide suggestions for further reading,Internet information sources,names and addresses for mail order supply companies,and help with interfacing logic families. This heavily illustrated "bible" of amateur robotics is the best you can ever find. Take it home and start building robots today. EVERYTHING YOU NEED TO GET STARTED*Where to Get the Parts *How Much They Cost *Working with Plastic,Wood,& Metal *Constructing the 'Bot *Avoiding Common Mistakes Fully Illustrated Plans for these Amazing RobotsMinibot Scooterbot Roverbot Six-Legged Walking Robot Pepbot Lego Lightbots that Seek and Avoid Light Polar coordinate robotic arm Revolute coordinate robotic arm More NEW IN THIS EDITION*Lego Technic-Based Robots*Functionoids with Lego Mindstorms*Fixed and Mobile Systems with Servo Motors*Using the Basic Stamp,BasicX,and Other Microcontrollers*Remote Controlled Robots*Infrared,Ultrasonic,Laser,and other High-Tech Sensors.
An Historical Account of the 'WearComp' and 'WearCam' Inventions Developed for Applications in 'Personal Imaging'
Authors: Steve Mann
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

We are entering a pivotal era in which we will become inextricably intertwined with computational technology that will become part of our everyday lives in a much more immediate and intimate way than in the past. The recent explosion of interest in so-called ``wearable computers'' is indicative of this general trend. The purpose of this paper is to provide an historical account of my wearable computer effort, from the 1970s (WearComp0) to present (WearComp7), with emphasis on a particular variation whose origins were in imaging applications. This application, known as `personal imaging', originated as a computerized photographer's assistant which I developed for what many regarded as an obscure photographic technique. However, it later evolved into a more diverse apparatus and methodology, combining machine vision and computer graphics, in a wearable tetherless apparatus, useful in day-to-day living. Personal imaging, at the intersection of art, science, and technology, has given rise to a new outlook on photography, videography, augmented reality, and 'mediated reality', as well as new theories of human perception and human-machine interaction. My current personal imaging apparatus, based on a camera and display built within an ordinary pair of sunglasses, together with a powerful multimedia computer built into ordinary clothing, points to a new possibility for the mass-market.
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
Authors: Katherine Guo, Mark Hayden, Robbert van Renesse, Werner Vogels, Kenneth P. Birman
Venue:  (1997)

To deliver multicast messages reliably in a group, each member maintains copies of all messages it sends and receives in a buffer for potential local retransmission. The storage of these messages is costly and buffers may grow out of bound. Garbage collection is needed to address this issue. Garbage collection occurs once a process learns that a message in its buffer has been received by every process in the group. The message is declared stable and is released from the process''s buffer. This paper proposes a gossip-style garbage collection scheme called GSGC for scalable reliable multicast protocols. This scheme achieves fault-tolerance and scalability without relying on the underlying multicast protocols. It collects and disseminates information in the multicast group by making each group member periodically gossip information to a random subset of the group. Extending the global gossip protocol further, this paper also investigates a local gossip scheme that achieves improved scalability and significantly better performance. Simulations conducted in a WAN environment are used to evaluate the performance of both schemes.