ppxscal/embedding_network huggingface dataset:
Scheduling algorithms for distributed Web servers
Authors: M. Colajanni, P. S. Yu, D. M. Dias
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

A distributed Web system, consisting of multiple servers for data retrieval and a Domain Name Server (DNS) for address resolution, can provide the scalability necessary to keep up with growing client demand at popular sites. However, balancing the requests among these atypical distributed servers opens interesting new challenges. Unlike traditional distributed systems in which a centralized scheduler has full control of the system, the DNS controls only a small fraction of the requests reaching the Web site. This makes it very difficult to avoid overloading situations among the multiple Web servers. We adapt traditional scheduling algorithms to the DNS, propose new policies, and examine their impact. Extensive simulation results show the advantage of using strategies that schedule requests on the basis of the origin of the clients and very limited state information, such as whether a server is overloaded or not. Conversely, algorithms that use detailed state information often exhibit the worst performance.
Arcgis Developer's Guide for Visual Basic Applications (VBA), 1 edition
Authors: Amir H. Razavi
Venue:  (2002)

:Learn how to implement ArcObjects components to customize, add new tools, or extend ArcGIS 8.1 functionality! New from OnWord Press, ArcGIS Developer's Guide for Visual Basic for Applications is a "must" for GIS professionals and students alike. This compact how-to and reference manual contains all of the examples, exercises, plus professional tips and hints that skilled ArcGIS users need to learn how to develop their own applications. No prior experience with ArcObjects is required! Each chapter of this book walks the reader step by step through the process of developing a small application, from start to finish. In this way, ArcGIS application developers are exposed to the entire code and can maintain sight of the "big picture" as they achieve new levels of expertise in using data windows, maps, layers, page layouts, and more! Ideal for the novice, initial chapters introduce and explain the VBA development environment; COM basics, interfaces and applications; plus critical ArcObjects elements. Experienced GIS developers will also benefit tremendously from the straightforward, no-nonsense presentation of information when it is used as a starting point for developing their own applications.
Rete GARR-B: Piano di routing IP multicast
Authors: Tiziana Ferrari, Antonio Pinizzotto, Damir Pobric, Marco Sommani
Venue:  (2000)

The IP multicast was introduced in the GARR network (Italian Network for University and Scientific Community) in 1993 with the connection to Mbone (worldwide virtual multicast network). Since then the Italian Mbone developed constantly allowing the test of protocols and applications. Nevertheless the original Mbone structure is not suitable for an efficient utilization of multicast potentialities and advantages, preventing from exploiting all the services on a large scale; moreover it doesn''t allow an interconnection with those ISP which are enabling multicast in their networks but with different technical solutions. This document, after a description of the limits of the present Mbone on GARR, proposes the steps for an updating plane: - IP multicast implementation on the production routers of the backbone, using the PIM-SM protocol; - choice and configuration of the Rendez-Vous Points; - definition of IP multicast boundary routers; - bandwidth limitation; - inter-domain routing (MSDP and MBGP); - international multicast connections. The document deals with some of IP multicast management tools, as well.
How to learn to interact?
Authors: Arnaud Mounier, Olivier Boissier, François Jacquenet
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The complexity of Multi-Agent Systems is constantly increasing. With the growth of the number of agents, interactions between them draw complex and huge conversations. In this paper, we present a knowledge discovery process based on conversation mining and used to infer conversation models. Conversations are made up of sequences of messages exchanged inside the system. In order to discover the underlying conversation models that agents use while interacting with each other, we apply stochastic grammatical inference techniques on the conversations. We present some experiments that show the process we design is a good candidate to equip agents with the capacity to learn to interact.
Chain Models of Physical Behavior for Engineering Analysis and Design
Authors: Richard S. Palmer, Vadim Shapiro
Venue:  (1993)

The relationship between geometry (form) and physical behavior (function) dominates many engineering activities. The lack of uniform and rigorous computational models for this relationship has resulted in a plethora of inconsistent (and thus usually incompatible) computer aided design (CAD) tools and systems, causing unreasonable overhead in time, effort, and cost, and limiting the extent to which CAD tools are used in practice. It seems clear that formalization of the relationship between form and function is a prerequisite to taking full advantage of computers in automating design and analysis of engineering systems. We present a unified computational model of physical behavior that explicitly links geometric and physical representations. The proposed approach characterizes physical systems in terms of their algebraic-topological properties: cell complexes, chains, and operations on them.
Bounding asymptotic dependability and performance measures
Authors: S. MahTvas, G. Rubino
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

One of the major drawbacks of Markov models is the size of the generated state space. Often its high value (sometimes infinite) makes the numerical analysis impossible to perform. A possible approach to deal with this problem is to bound the measures of interest. In recent years, some methods have been proposed in this direction, mainly for stationary dependability measures. In this paper, we propose a new approach which can be applied in more general conditions than previous ones. It allows, in particular, to derive performance measures of some analytically intractable queueing models. We illustrate it with examples of open models of tandem queues with blocking.
PADO: Learning Tree Structured Algorithms for Orchestration into an Object Recognition System
Authors: Astro E Teller, Manuela Veloso
Venue:  (1995)

Most artificial intelligence systems today work on simple problems and artificial domains because they rely on the accurate sensing of the task world. Object recognition is a crucial part of the sensing challenge and machine learning stands in a position to catapult object recognition into real world domains. Given that, to date, machine learning has not delivered general object recognition, we propose a different point of attack: the learning architectures themselves. We have developed a method for directly learning and combining algorithms in a new way that imposes little burden on or bias from the humans involved. This learning architecture, PADO, and the new results it brings to the problem of natural image object recognition is the focus of this report.
Race Analysis of Traces of Asynchronous Message-Passing Programs
Authors: Kuo-Chung Tai
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

An execution of a message-passing program is nondeterministic tf message races exist. In this paper, a formal definition of a message race for asynchronous communication is presented. The trace of an execution of a message-passing program is a sequence of send and receive events. For a receive event r in a trace T, its race set is the set of messages in T that have a race with the message received at r and can be received at r during some possible executions of the same program with the same input. A race analysis algorithm analyzes a trace to determine the race set for each receive event in the trace. Three race analysis algorithms are given for three dtgerent types of sequences of send and receive events. It is shown that these race analysis aIgorithms can be used to solve a number of problems in testing and debugging message-passing programs.
A Simple Fuzzy Statistical Evaluation for Process Control Performance
Authors: Tero Joronen
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This article presents a simple method for evaluating process control performance improvements by applying fuzzy conditional probability. The fuzzy conditional probability of an unwanted fuzzy event, while a known disturbance fuzzy event is active, is calculated beforeand after the control improvement. The probability is used as a measurement of the control error. A case study for a boiler control improvement is presented. 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
Replication-Based Incremental Copying Collection
Authors: Scott Nettles, James O''Toole, David Pierce, Nicholas Haines
Venue:  (1993)

We introduce a new ''replication-based'' copying garbage collection technique. We have implemented one simple variation of this method to provide incremental garbage collection on stock hardware with no special operating system or virtual memory support. The performance of the prototype implementation is excellent: major garbage collection pauses are completely eliminated with only a slight increase in minor collection pause times. Unlike the standard copying algorithm, the replication-based method does not destroy the original replica when a copy is created. Instead, multiple copies may exist, and various standard strategies for maintaining consistency may be applied. In our implementation for Standard ML of New Jersey, the mutator continues to use the from-space replicas until the collector has achieved a consistent replica of all live data in to-space. We present a design for a concurrent garbage collector using the replication-based technique. We also expect replication-based gc methods to be useful in providing services for persistence and distribution, and briefly discuss these possibilities.
Supporting product line development
Authors: R. Balzer
Venue: Proceedings of the 10th International Software Process Workshop (1996)

The author considers how the maturation of the software development field has been inextricably tied to its adoption of a product line orientation. Only by specializing in a particular application domain can software development organizations develop the expertise required for that domain, develop cost effective products, and establish a market niche. He argues that software development processes are fundamentally flawed because maintenance, including enhancement and evolution, is performed on source code. This source code has been hand optimized by programmers and that optimization has spread information and built up implicit dependencies among the parts.
High-Speed Networking: A Systematic Approach to High-Bandwidth Low-Latency Communication
Authors: James P. G. Sterbenz, Joseph D. Touch
Venue:  (2002)

:Leading authorities deliver the commandments for designing high-speed networksThere are no end of books touting the virtues of one or another high-speed networking technology, but until now, there were none offering networking professionals a framework for choosing and integrating the best ones for their organization's networking needs. Written by two world-renowned experts in the field of high-speed network design, this book outlines a total strategy for designing high-bandwidth, low-latency systems. Using real-world implementation examples to illustrate their points, the authors cover all aspects of network design, including network components, network architectures, topologies, protocols, application interactions, and more.
Emergence of Communication for Negotiation By a Recurrent Neural Network
Authors: Katsunari Shibata, Koji Ito
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

We believe that communication in multi-agent system has two major meanings. One of them is to transmit one agent's observed information to the other. The other meaning is to transmit what an agent is thinking. Here we focus the latter and aim to the emergence of the autonomous and decentralized arbitration through communication among some agents. The communication contents, strategy and representation are not prescribed and are acquired by learning using a reinforcement signal which is given to the agent after its action. The reinforcement signal is not shared with the other agents. In order to realize this learning, the agent often has to make a decision not only from the present communication signals but also from the past signals. Accordingly the system architecture using recurrent type (Elman) neural network is proposed. The ability of this architecture was examined by two and four agents negotiation problems. A variety of negotiation strategies emerged among the agents through the learning to avoid some conflict after their decisions.
Clustering of Web Users Using Session-Based Similarity Measures
Authors: Jitian Xiao, Yanchun Zhang
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

One important research topic in web usage mining is the clustering of web users based on their common properties. Informative knowledge obtained from web user clusters has been used for many applications, such as the prefetching of pages between web clients and proxies. This paper presents an approach for measuring similarity of interests among web users from their past access behaviors. The similarity measures are based on the user sessions extracted from the user's access logs. A multilevel scheme for clustering largenumber of web users is proposed, as an extension to the method proposed in our previous work [15]. Experiments have been conducted and the results have shown that our clustering method is capable of clustering web users with similar interests.
Performance Analysis of Rate-based Congestion Control Scheme and Choice of High and Low Thresholds
Authors: Yuan-Cheng Lai, Ying-Dar Lin
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

The paper presents a performance analysis of a rate-based congestion control mechanism. The switching capacity of the buffer is finite to reflect real conditions. Using a differential equation approach, we get the closed-form equations of cell loss probability and utilization. Numerical results are given to show that our analysis is correct. In rate-based control, the important issue is how to determine congestion occurrence and congestion relief. The most common method is to set two thresholds of queue length, a high threshold and a low threshold. The values of these two thresholds seriously influence the system performance. Hence, we present the concept of best area to determine how to set the high and low thresholds to guarantee good performance, i.e., cell loss probability is zero and utilization is one, if it is possible. When good performance is not achieved due to too many connections or too large propagation delay, some rules are also given to prevent unnecessary cell-loss and under-utilization.
On-Line Recognition of Handwritten Arabic Characters Using a Kohonen Neural Network
Authors: Neila Mezghani, Amar Mitiche, Mohamed Cheriet
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Neural networks have been applied to various pattern classification and recognition problems for their learning ability, discrimination power, and generalization ability. The neural network most referenced in the pattern recognition literature are the multi-layer perceptron, the Kohonen associative memory and the Capenter-Grossberg ART network. The Kohonen memory runs an unsupervised clustering algorithm. It is easily trained and has attractive properties such as topological ordering and good generalization. In this study an on-line system for the recognition of handwriting Arabic characters using a Kohonen network is investigated. The input of the neural network is a feature vector of elliptic Fourier coefficients extracted from the handwritten dynamic representation. Experimental results show that the network successfully recognizes both clearly and roughly written characters with good performance.
Visualizing Real Estate Property Information on the Web
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

We have designed and are implementing a system called ReV (Real estate Visualizer) for exploring real estate property listings on the world-wide web. Given the large number of different websites providing listings, each with its own presentation format, and the high-dimensionality of the property space itself, it is difficult to obtain a comprehensive single view of property data on the web. ReV addresses this problem by using grammar induction techniques to automatically learn to parse pages from new websites and collate all of their listings together. It them visualizes this listing data using a map-based color-coding technique. This work draws together a number of strands from the fields of information visualization, machine learning, and database integration. We also hypothesize that ReV will be adaptable to inducing structures from other types of web data.
Apparent Motion in Spatial Time-varying Data: A Variational Approach to Pointwise Tracking of Coherent Structures in Computational Fluid Dynamics
Authors: Mottl Vadim, Blinov Alexander, Zabusky Norman, Muchnik Ilya
Venue:  (1999)

By a massive time-varying data set is meant an experimentally acquired or mathematically simulated function of spatial coordinates and time which is to be analyzed with the purpose of studying behavior of the respective distributed dynamical system. We address here primarily problems of computational fluid dynamics that are concerned with the necessity to visualize and study overwhelming time-varying data sets generated by numerical unsteady simulations. Of a major interest is time tracking of persistent coherent structures of the fluid flow that use to arise, move in space for a time while, fade, and be replaced by new pattern building up from their remains. The spatial motion of persistent patterns in a time-varying data set is called here apparent motion because it does not coincide, in the general case, with mechanical motion of any physical particles. With the purpose of tracking coherent structures, it is proposed to evaluate the apparent motion in terms of apparent velocity of space points. The apparent velocity is to be estimated in the form of a time-varying vector field as result of processing the original time-varying data set or immediately in the course of numerical simulating the respective physical reality as solution of an additional system of partial differential equations. In both versions, we lean upon the variational approach to the analysis of massive data sets and estimate the vector field of apparent velocity as time-varying function that delivers the minimum value to a quadratic functional. In experiments with simulated two-dimensional time-varying spatial dynamics of the fluid''s density and vorticity in shock wave interaction with an elliptical bubble, the estimated apparent velocity provided long-term pointwise tracking of persistent coherent structures.
Numerical simulation of 2D semiconductor devices using high-order finite difference methods
Authors: Michel Fournie'', Paola Pietra
Venue:  (1999)

Numerical tests of a new accurate compact finite difference scheme for solving the 2D drift-diffusion system are presented EMAIL:: pietra@dragon.ian.pv.cnr.it
Using Virtual Synchrony to Develop Efficient Fault Tolerant Distributed Shared Memories
Authors: Roy Friedman
Venue:  (1995)

This paper shows how to define consistency conditions for distributed shared memories in virtually synchronous environments. Such definitions allow to develop fault tolerant implementations of distributed shared memories, in which during normal execution, operations can be performed very efficiently, and only those operations which take place during a configuration change must be delayed. Three well known consistency conditions, namely, linearizability, sequential consistency, and causal memory, are redefined for virtually synchronous environments. It is then shown how to provide efficient fault tolerant implementations for these definitions.
Generation and Search of Clustered Files
Authors: D. Bergmark, Gerard Salton, A. Wong
Venue:  (1977)

A classified, or clustered file is one where related, or similar records are grouped into classes, or clusters of items in such a way that all items within a cluster are jointly retrievable. Clustered files exhibit substantial advantages in many retrieval environments over the more conventional inverted list or multilist technologies. An inexpensive file clustering method applicable to large files is given together with appropriate file search methods. An abstract model is used to predict the retrieval effectiveness of various search methods in a clustered file environment, and experimental evidence is introduced to confirm the usefulness of the model. As an example, a collection of research papers in computer science is clustered automatically, and the resulting research clusters are compared with exissting, manually constructed taxonomies for the computer field.