ppxscal/embedding_network huggingface dataset:
Fast dissemination of link states using bounded sequence numbers with no periodic updates or age fields
Authors: J. Behrens, J. J. Garcia-Luna-Aceves
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Routing protocols based on the distribution of link-state information rely on sequence numbers to validate information that a router receives. A fundamental problem is to bound the sequence-number space. We propose a new sequence-number reset algorithm that needs neither periodic retransmissions nor age fields. It is based on a recursive query-response procedure and is designed to handle resource failures during operation. This new algorithm is applicable to routing protocols based on both flooding and selective distribution of link-state information. The correctness of the algorithm is verified in the context of selective dissemination of topology information, and its complexity analyzed. Because the reset algorithm does not use any aging, the distribution of new link-state information or the purging of old information is always done in a time proportional to the time it takes to traverse the network.
Weighted colimits and formal balls in generalized metric spaces
Authors: J. J.M.M. Rutten
Venue:  (1997)

(a) Limits of Cauchy sequences in a (possibly non-symmetric) metric space are shown to be weighted colimits (a notion introduced by Borceux and Kelly, 1975). As a consequence, further insights from enriched category theory are applicable to the theory of metric spaces, thus continuing Lawvere''s (1973) approach. Many of the recently proposed definitions of generalized limit turn out to be theorems from enriched category theory.
Applying a combinatorial auction protocol to a coalition formation among agents in complex problems
Authors: Hiromitsu Hattori, Tadachika Ozono, Toramatsu Shintani
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We are trying to apply a combinatorial auction protocol to a coalition formation among agents to solve a scheduling problem that considers various constraints as a complex problem. Constraints on scheduling can be expressed as combinations of items (time slots). We formalize a combinatorial auction for scheduling as an MIP (Mixed Integer Programming) problem, which integrates the constraints on items and bids to express complex problems.
Wireless Security Essentials: Defending Mobile Systems from Data Piracy
Authors: Russell Dean Vines
Venue:  (2002)

:As wireless device usage increases worldwide, so does the potential for malicious code attacks. In this timely book, a leading national authority on wireless security describes security risks inherent in current wireless technologies and standards, and schools readers in proven security measures they can take to minimize the chance of attacks to their systems.
Introduction to Integer-Coordinate Crystalline Meshes
Authors: Vasiliki Chatzi, Franco P. Preparata
Venue:  (1999)

We introduce 2D and 3D integer-coordinate crystalline meshes and discuss their properties. We explain that crystalline meshes give us both the flexibility of variable element density in different parts of the domain as well as the ability to construct the system of equations quickly and accurately, which makes them ideal for problems where the domain has regions of interest. We also illustrate the versatility of crystalline meshes in the context of dynamic mesh adaptation, discussing in detail the refinement procedure. Finally, we give some experimental results and compare the computational behavior of crystalline meshes with that of current methods.
Application Design for a Smart Watch with a High Resolution Display
Authors: Chandra Narayanaswami, M. T. Raghunath
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

Advances in technology have made it possible to package a reasonably powerful processor and memory subsystem coupled with an ultra high-resolution display and wireless communication into a wristwatch. This introduces a set of challenges in the nature of input devices, navigation, applications, power management, and other areas. This paper describes a platform we have developed and the decisions we have made about how to address these challenges.
How to calm hyperactive agents
Authors: H. Van Dyke Parunak, Sven A. Brueckner, Robert Matthews, John Sauter
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

System performance in multi-agent resource allocation systems can often improve if individual agents reduce their activity. Agents need a way to modulate their individual behavior in light of the system's state, preferably without centralized control. We illustrate the problem of hyperactive agents in two domains related to resource allocation. A simple, decentralized scheme, inspired by insect pheromones, enables individual agents to adjust their activity as the system operates, and suggests a general approach to dealing with approaching deadlines.
GPS-Based Message Broadcasting for Inter-vehicle Communication
Authors: Min-te Sun, Wu-chi Feng, Ten-Hwang Lai, Kentaro Yamada, Hiromi Okada, Kikuo Fujimura
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Intelligent Transportation Systems (ITS) have become a focus for many countries. To achieve ITS, Inter Vehicle Communication (IVC) is required for the exchange and distribution of data such as congestion or emergency information. If this communication can be done without fixed infrastructure, the systems can be deployed quickly and on a larger scale. Ad hoc networking technologies are one such technology to achieve IVC. However, if generic ad hoc network solutions are applied directly to IVC, performance can degrade quickly as the system scales particularly for broadcast type messages. In this paper, we propose two new broadcast protocols that reduce bandwidth required for broadcast communication by taking advantage of a vehicle's highly directional movement and Global Positioning Information. To show the performance of our new protocols, we compare our approach with generic ad hoc broadcasting techniques. Our results show that it is possible to achieve several hundred percent improvement of bandwidth utilization with very slight sacrifice of reachability.
Wormhole Routing and its Chip Design
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

The wormhole routing is a key technique in the design of Dawning 1000 which is the first MPP system made in China. In this paper, the wormhole routing is introduced, and an algorithm based on wormhole routing, a chip architecture and its logic design are also described. Finally, an interconnection constructed by the wormhole routing chips is put forward for Dawning 1000 which indicates this kind of chip has a correct function and fast rate with reliability.
Orthogonalization of OFDM/OQAM pulse shaping filters using the discrete Zak transform
Authors: Helmut Bölcskei, Pierre Duhamel, Rima Hleiss
Venue: Signal Processing (2003)

We introduce a computationally efficient FFT-based algorithm for the design of OFDM/OQAM pulse shaping filters of arbitrary length and with arbitrary overlapping factors. The basic idea of our approach is to start from an arbitrary initial (nonorthogonal) filter and to perform an orthogonalization which yields an ISI- and ICI-free pulse shaping filter. The orthogonalization is performed in the discrete Zak transform domain and can be implemented using the FFT. We design filters for OFDM/OQAM systems with up to 1024 channels and overlapping factor 32. Finally, we present simulation examples assessing the performance of the designed pulse shaping filters in the presence of Doppler spread.
The Small-World Phenomenon: An Algorithmic Perspective
Authors: Jon Kleinberg
Venue:  (1999)

Long a matter of folklore, the ``small-world phenomenon'''' --the principle that we are all linked by short chains of acquaintances --was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960''s. This work was among the first to make the phenomenon quantitative, allowing people to speak of the ``six degrees of separation'''' between any two people in the United States. Since then, a number of network models have been proposed as frameworks in which to study the problem analytically. One of the most refined of these models was formulated in recent work of Watts and Strogatz; their framework provided compelling evidence that the small-world phenomenon is pervasive in a range of networks arising in nature and technology, and a fundamental ingredient in the evolution of the World Wide Web. But existing models are insufficient to explain the striking algorithmic component of Milgram''s original findings: that individuals using local information are collectively very effective at actually constructing short paths between two points in a social network. Although recently proposed network models are rich in short paths, we prove that no decentralized algorithm, operating with local information only, can construct short paths in these networks with non-negligible probability. We then define an infinite family of network models that naturally generalizes the Watts-Strogatz model, and show that for one of these models, there is a decentralized algorithm capable of finding short paths with high probability. More generally, we provide a strong characterization of this family of network models, showing that there is in fact a unique model within the family for which decentralized algorithms are effective.
Transformation Techniques for Toeplitz and Toeplitz-plus-Hankel Matrices Part II. Algorithms
Authors: A. W. Bojanczyk, George Heinig
Venue:  (1996)

In the first part of the paper transformations mapping Toeplitz and Toeplitz-plus-Hankel matrices into generalized Cauchy matrices were studied. In this second part fast algorithms for LU-factorization and inversion of generalized Cauchy matrices are discussed. It is shown that the combination of transformation pivoting techniques leads to algorithms for indefinite Toeplitz and Toeplitz-plus-Hankel matrices that are more stable than the classical ones Special attention is paid to the symmetric and hermitian cases.
Software For Estimating Sparse Hessian Matrices
Authors: Thomas F. Coleman, Burton S. Garbow, Jorge J. More
Venue:  (1985)

The solution of a nonlinear optimization problem often requires an estimate of the Hessian matrix for a function $f$. In large scale problems the Hessian matrix is usually sparse, and then estimation by differences of gradients is attractive because the number of differences can be small compared to the dimension of the problem. In this paper we describe a set of subroutines whose purpose is to estimate the Hessian matrix with the least possible number of gradient evaluations.
Checkpointing Protocol for Object-Based Systems
Authors: Katsuya Tanaka, Makoto Takizawa
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Object-based checkpoints are consistent in the object-based system but may be inconsistent according to the traditional message-based definition. We present a protocol for taking object-based checkpoints among objects. An object to take a checkpoint in the traditional message-based 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 object-based protocol.
Schürmann-Polynomials " Roots and Offsprings: Their Impact on Today's Pattern Recognition
Authors: Udo Miletzki
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Jürgen Schürmann died on January 19, 2001, much too early, at the age of 66 years. He was a grand pioneer in the field of pattern recognition and a tireless source and trigger of sophisticated theoretical ideas and their transformation into high performance recognitionproducts which are spread all over the world. For this reason, the programme committee of the 2002 "International Workshop on Frontiers of Handwriting Recognition" (IWFHR-8) has decided to dedicate this event to this extraordinary senior scientist of pattern recognition. In honour and in memory of this vivid, dynamic and creative man, we want to reflect the essenceof his oeuvre, gained during a life-long quest to find a way ¿ as he would put it ¿ "from pixel to meaning".This paper is focused on the following questions: Who was this man? What were his scientific roots? What was his basic contribution? What are the offsprings of his work? What impetus did he give to the scientific community?
DTCAP-a distributed tunable-channel access protocol for multi-channel photonic dual bus networks
Authors: Nen-Fu Huang, Shiann-Tsong Sheu
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In a multi-channel photonic dual bus network, each unidirectional bus contains a number of channels (wavelengths) and the bus headend periodically generates fixed length slots on each of the channels. Generally, one channel called the control channel is used to carry signals and the others are data channels. Each station is equipped with one-fixed-transmitter and one fixed-receiver which are permanently tuned to the dedicated control channel, and n tunable-transmitters and m tunable-receivers are tunable over the entire wavelength range. For non-overlapping traffic in the network, the maximum network throughput will be achieved by applying the wavelength reusing concept. Given a set of serving traffic, a set of new traffic requests, and c data channels (wavelengths), the wavelength/receiver assignment problem ((n, m, c)-WRAP) is to assign a transmission wavelength and a receiver for each request such that the network throughput is maximized and the number of assigned wavelengths is minimized. In this paper, we prove that the (n, m, c)-WRAP is NP-hard. An efficient distributed tunable-channel access protocol (DTCAP) is proposed for the (1, m, c)-WRAP. Based on the DTCAP, three different schemes are proposed for assigning the wavelength/receiver. The performance of the three proposed schemes on the DTCAP are evaluated and compared by simulation. Simulation results demonstrate that for a limited number of wavelengths and receivers, the proposed schemes substantially improve the network throughput and access delay under general traffic demands.
Organizing and Visualizing Related Work Events on Personal Information Management Systems
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper proposes a method to automatically organize and visualize related work events as a work-project structure. This is accomplished by accumulating and analyzing the target event and time of the user's operations such as registrations and references on a Personal Information Management system (PIM). Our processes for organization are : (1) extracting relations between events from the records of user's reference operations using balloon-help function, (2) intensifying the relations between events during interaction with the user by visualizing the relations and presenting them to the user, (3) making connections between events based on the extracted relations. Our visualization method represents the organized work events as connected graphs in which nodes and arcs indicate events and relations between events, and in which the intensity of the relation is represented with arcs of width in proportion to the intensity. Furthermore, in order to visualize a structure of collaboration among several users, our visualization method places each user's connected graph on the side planes of a three-dimensional multi-angular prism.
Video in the 21st Century
Authors: Scott Janus
Venue:  (2002)

:In the past few years, huge advancements have been made in the field of video. The DVD format was launched and has since gained wide consumer acceptance. High Definition Television has gone from specification to reality, with broadcasts now occurring daily throughout the United States. The IEEE1394/Firewire protocol and DV are putting professional-grade video into the hands of consumers. Exploring the key technologies that have made all of this possible, this engineering reference is filled with hard-to-find video information for hardware and software designers who design multimedia or digital video products. Topics covered include DVD, HDTV, MPEG-2, and flat panel displays.
On a Buzzword "Extensibility" What We Have Learned from the ORIENT Project?
Authors: Nan Zhang, Theo Härder
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

To meet the ever challenging requirements of today's applications, both database research and industry are being engaged in adding new features to database management systems (DBMSs). As a major effort in this direction, object-relational DBMSs (ORDBMSs) gain more and more popularity due to their extensibility, i. e., allowing user-defined facilities to be used in the same way as built-in ones.Inspired by this idea, we started to develop a prototype ORIENT to enhance DBMSs with complex relationship semantics that are versatile in the real world, but still insufficiently supported by the new database technology. Our work reveals that data model changes to accommodate relationship semantics imply extensions at the processing level, which are, however, not feasible in "extensible" ORDBMSs. Proper integration of new processing capabilities calls for a more open approach to database extensibility than what the current ORDBMSs exhibit.
Efficient Geometric Algorithms for Robot Sensing and Control
Authors: Amy Briggs
Venue:  (1995)

This thesis addresses the problem of automatically generating solutions to robotics tasks that are specified at a high level. In particular, we consider the problems of robot motion planning and the planning of sensor placements. These problems are made difficult by a number of inherent factors. Foremost among these are uncertainty and geometric complexity. Uncertainty arises from the fact that the actions of robots are subject to error. Geometric complexity reflects the fact that real-world task environments are often complex. If we want robot strategies that are both practical and robust, we must develop algorithms that successfully deal with uncertainty and complex geometry. Much of the previous work in the area of task-level planning for robots fails to address at least one of these issues. Many theoretical approaches are algorithmically sophisticated, but do not handle uncertainty, and may be unimplementable in practice. On the other hand, real robot systems often employ simplistic strategies that do not take into account complex geometric interactions. This thesis seeks to bridge the gap between these two extremes. We present efficient planning algorithms for motion and sensing that are both practical and algorithmically sophisticated. Our motion planning algorithm computes one-step motion strategies that guarantee reaching a specified goal in the plane. To deal with uncertainty in robot control, we employ a control model that allows the robot to slide along obstacle surfaces, or comply with the environment. Our analysis of this algorithm yields a precise characterization of the complexity of one-step compliant motion planning with uncertainty. Sensors are needed within autonomous systems to provide execution-time feedback. In this thesis we develop a framework for planning sensing strategies in a principled way. In particular, we present algorithms for computing the set of placements from which a sensor can monitor a region within a task environment. This work has many applications in the areas of assembly planning, cooperating robots, and robot surveillance. We have demonstrated the practicality of our approach by building a system of robot surveillance with mobile robots employing our strategies for sensor planning.
The Declarative Problem Frame: Designing Systems that Create and Use Norms
Authors: Roel J. Wieringa
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

This paper analyzes design guidelines for reactive systems that control a social environment. In contrast, to a physical environment, a social environment cannot be controlled by physical causation, but it can be controlled by symbolic interaction in combination with the appropriate norms. I show that this involves three kinds of norms: the desired effects of the system, norms needed to achieve these effects, and norms for the subject domain that are independent from the system. The norms presupposed by the responses of the system include the ability of the system to act on behalf of legal persons as well as responsibilities allocated to legal persons. The analysis leads to design guidelines and a problem frame for social control by machine.
Proposal for an Interactive Environment for Information Extraction
Authors: Claire Cardie, David Pierce
Venue:  (1998)

Information extraction systems have been successfully deployed for domains ranging from terrorist activities to medical records. However, building these systems remains costly for users who lack annotated training corpora or knowledge engineering expertise. This paper proposes a framework for an interactive information extraction environment in which the user trains the system by example and by feedback about performance. If successful, this will be the first system that allows end-users to create information extraction systems without the aid of computational linguists and NLP system designers.
Automatic Analysis of Composite Solvers
Authors: Evgueni Petrov, Eric Monfroy
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Cooperative constraint solving is an area of constraint programming which develops and studies methods for organizing interaction between constraint solvers. The goal of research in cooperative constraint solving is to discover the interaction patterns which amplify the positive qualities of individual constraint solvers.Analysis of composite solvers is a theoretically and practically important issue in cooperative constraint solving. In this paper, we present an analysis by means of set constraints which allows one to reason about the behaviour of composite solvers in terms of pre- and post-conditions.
Virtual memory management for database systems
Authors: Irving L. Traiger
Venue: ACM SIGOPS Operating Systems Review (1982)

Over the last several years, a number of hardware and software systems have been developed which map entire files directly into the virtual memory address spaces used by programs. Since all file contents are directly addressable, there is no need for a programmer to issue explicit file system actions, such as Read or Write. In addition, all of the buffer management problems are eliminated, since programmers do not have to squeeze pieces of large files into small virtual spaces. Although these advantages are tempting, we find that database systems have gone their own way. In this paper, we will look at two particular approaches to database system design, and see how (and why) they interface to file systems as they do. We will then look at the potential advantages and implications of working more closely with virtual memory management, and describe some of the functions and constraints that would have to be supported by a generalized page manager.