ppxscal/embedding_network huggingface dataset:
Peer-to-peer information retrieval using self-organizing semantic overlay networks
Authors: Chunqiang Tang, Zhichen Xu, Sandhya Dwarkadas
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Content-based full-text search is a challenging problem in Peer-to-Peer (P2P) systems. Traditional approaches have either been centralized or use flooding to ensure accuracy of the results returned.In this paper, we present pSearch, a decentralized non-flooding P2P information retrieval system. pSearch distributes document indices through the P2P network based on document semantics generated by Latent Semantic Indexing (LSI). The search cost (in terms of different nodes searched and data transmitted) for a given query is thereby reduced, since the indices of semantically related documents are likely to be co located in the network.We also describe techniques that help distribute the indices more evenly across the nodes, and further reduce the number of nodes accessed using appropriate index distribution as well as using index samples and recently processed queries to guide the search.Experiments show that pSearch can achieve performance comparable to centralized information retrieval systems by searching only a small number of nodes. For a system with 128,000 nodes and 528,543 documents (from news, magazines, etc.), pSearch searches only 19 nodes and transmits only 95.5KB data during the search, whereas the top 15 documents returned by pSearch and LSI have a 91.7% intersection.
Enterprise Java and Uml, 2 edition
Authors: C. T. Arrington, Syed H. Rayhan
Venue:  (2003)

:The first book to show Java programmers how to utilize UML when building applications is now completely up-to-date with new coverage on UML 2.0, JCP UML to EJB Mappings, J2EE 1.4, and Web servicesBreaks down common situations that a development team will most likely face in the field and discusses the tradeoffs of using different technologies in different combinationsCompanion Web site includes the code for the full working sample application used in the book as well as third-party software
On queueing with customer impatience until the beginning of service
Authors: A. Movaghar
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

We study queueing systems where customers have strict deadlines until the beginning of their service. An analytic method is given for the analysis of a class of such queues, namely, M(n)/M/m/FCFS+G and M(n)/M/m/FCFS/K+G models. These are queues with state-dependent Poisson arrival process, exponential service times, multiple servers, FCFS service discipline, infinite or finite capacity, and general customer impatience. The state of the system is viewed to be the number of customers in the system. This will allow a unified framework for the analysis of infinite-capacity models as well as finite-capacity models. The principal measure of performance is the probability measure induced by the offered waiting time. Other measures of interest are the probability of missing deadline and the probability of blocking. Closed-form solutions are derived for some important modeling variables and parameters. The efficacy of our method is illustrated through a numerical example.
Three-Dimensional Embedding of Binary Trees
Authors: W. Bein, L. Larmore, C. Shields,  Jr., H. Sudborough
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

We describe total congestion 1 embeddings of complete binary trees into three dimensional grids with expansion ratios 1.172 and 1.25. That is, we give a one-to-one embedding of any complete binary tree into a hexahedron shaped grid such that1. the number of nodes in the grid is at most 1.172 (1.25) times the number of nodes in the tree, and2. no tree nodes or edges occupy the same grid positions.The first strategy embeds trees into cube shaped 3D grids. That is, 3D grids in which all dimensions are roughly equal, in size. The second strategy embeds trees into flat 3D grid shapes. That is, it maps complete binary trees into 3D grids with a fixed, small number of layers. An application suggests which embedding to use. For simulations in parallel computer environments, or possibly graph drawing, a cube shaped 3D grid is appropriate. For the sake of VLSI, or other graph drawing applications, embeddings with a small number of layers are better.
Tree-Structured Neural Networks: Efficient Evaluation of Higher-Order Derivatives and Integrals
Authors: Alois P. Heinz
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Tree-structured neural networks (TSNN) are universal approximators that have extremely fast evaluation procedures if so-called lazy activation functions are used. In this paper, it is shown how to choose a proper lazy activation function such that the existence of continuous derivatives of order n and less is guaranteed. A fast algorithm is presented that evaluates the n-th order derivative of a univariate multidimensional TSNN function using Taylor expansions of a functional decomposition. The same technique is used to derive a fast algorithm for the evaluation of definite integrals.
Computational Complexity and the Existence of Complexity Gaps
Authors: Allan B. Borodin
Venue:  (1969)

NO SUPPLIED
Incremental Specification of Telecommunication Services
Authors: Bruno Mermet, Dominique Mery
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

This paper presents the specification of telecommunication services using B abstract machines, and it defines the feature interaction problem as an interference issue among processes sharing common resources. The work reported here is experimental in nature as we explore the way in which to use the B method to tackle the feature interaction problem in telecommunication services. The B method is a tool for specifying, refining and developing systems in a mathematical and rigorous, but simple, way. Services are specified using the B method and the feature interaction problem is modeled as a violation of invariant properties. The B method is supported by software that helps the specifier of services and features. We have not only modeled services within the B technology, but we have also extended the B methodology with a novel way of combining abstract machines.
Recurrence-based Heuristics for the Hamiltonian Path Inclusion and Exclusion and Exclusion Algorithm
Authors: Eric Bax
Venue:  (1994)

For many problem instances, the inclusion and exclusion formula has many cancellations and symmetries. By imposing a hierarchy on the formula''s terms, we develop general reductions for inclusion and exclusion algorithms. We apply these reductions to an algorithm which counts Hamiltonian paths, and we develop a branch and bound algorithm to detect Hamiltonian paths. Then we show how to apply the reductions to other inclusion and exclusion algorithms.
A Three Layers Software Development Method: Foundations and Definition
Authors: Salem Dakhli, Claudine Toffolon
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

The role of Information Systems in modern organizations is constantly growing. They become today an essential component of their competitiveness. But, the software industry isn't mature and still in crisis. Certainly, all solutions proposed nowadays contribute in a large part to improve the software's development process productivity and products quality, but they are not sufficient, partly because they ignore some aspects of the software. In this paper, we propose a three layers software development method which takes into account aspects of software that are not always considered. This methodology is based on ten software dimensions and relies on three processes: organizational engineering, software engineering and architecture definition.
I/O Overhead and Parallel VLSI Architectures for Lattice Computations
Authors: Mark H. Nodine, Daniel P. Lopresti, Jeffrey S Vitter
Venue:  (1989)

In this paper we introduce a complexity measure for inputs and outputs (I/Os) in two-dimensional lattice computations called the I/O overhead \verb+\(*Q+. We show by pebbling arguments that a lower bound for the I/O overhead is proportional to $n ^ {-1}$, when there are $n ^ 2$ processing elements available for the computation. We show that if the results are required to be read at every generation, then the lower bound is the constant 2. We then examine four architectures and show that one of them, the multi-generation sweep architecture, also has I/O overhead proportional to $n ^ {-1}$ and we derive and compare the constants of proportionality. Finally, we prove a closed form for the discrete minimization equation giving the optimal number of generations to compute for the multi-generation sweep architecture.
Multi-Agent coordination based on tokens: reduction of the bullwhip effect in a forest supply chain
Authors: Thierry Moyaux, Brahim Chaib-draa, Sophie D'Amours
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we focus on the supply chain as a multi-agent system and we propose a new coordination technique to reduce the fluctuations of orders placed by each company to its suppliers in such a supply chain. This problem of amplification of the demand variability is called the bullwhip effect. To reduce such a bullwhip effect, we propose a technique based on tokens to achieve a decentralized coordination. Precisely, classical orders manage the demand itself whereas tokens manage effects on company inventory due to variations of this demand. Finally, the proposed approach is validated by the Wood Supply Game, which is a supply chain model used to make players aware of the bullwhip effect. We experimentally verify that our coordination technique leads to less variable orders (i.e. the standard deviation of orders is reduced) while inventory levels are not excessively high but sufficient to avoid backorders.
Bursty and Hierarchical Structure in Streams
Authors: Jon Kleinberg
Venue: Data Mining and Knowledge Discovery (2003)

A fundamental problem in text data mining is to extract meaningful structure from document streams that arrive continuously over time. E-mail and news articles are two natural examples of such streams, each characterized by topics that appear, grow in intensity for a period of time, and then fade away. The published literature in a particular research field can be seen to exhibit similar phenomena over a much longer time scale. Underlying much of the text mining work in this area is the following intuitive premise&mdash;that the appearance of a topic in a document stream is signaled by a &ldquo;burst of activity,&rdquo; with certain features rising sharply in frequency as the topic emerges.The goal of the present work is to develop a formal approach for modeling such &ldquo;bursts,&rdquo; in such a way that they can be robustly and efficiently identified, and can provide an organizational framework for analyzing the underlying content. The approach is based on modeling the stream using an infinite-state automaton, in which bursts appear naturally as state transitions&semi; it can be viewed as drawing an analogy with models from queueing theory for bursty network traffic. The resulting algorithms are highly efficient, and yield a nested representation of the set of bursts that imposes a hierarchical structure on the overall stream. Experiments with e-mail and research paper archives suggest that the resulting structures have a natural meaning in terms of the content that gave rise to them.
An Initial Evaluation of the FPS T-20
Authors: Donna Bergmark
Venue:  (1986)

An FPS T-20 hypercube has been on site at Cornell University since the end of May, 1986. I have been evaluating this machine; this report is one of a series of bi-monthly reports on the results of the benchmarking efforts. We hope that the study will not only determine the suitability of the T-20 for scientific programs but also provide an early warning of problems that might be present. The first section of this report discusses benchmark results so far, and where they have fallen a bit short of expectations. There is then a section dealing with programming issues. Finally (for local consumption), there is a discussion of what could be done at Cornell to enhance the usability of the machine in general and the benchmarking effort in particular.
An Introduction to Web Application Development with IBM WebSphere Studio: WebSphere Certification Study Guide
Authors: Gary Craig, Peter Jakab
Venue:  (2003)

:IBM has developed a world class certification program for professionals to establish standards that identify required levels of competency. This is the first study guide designed specifically for professionals who are preparing for test 345. With this guide, IBM now provides a quick and easy way to learn about IBM WebSphere Studio Application Developer and prepare for the IBM certification exam. This book will take you through the basics of using WebSphere Studio Application Developer from fundamental concepts through the actual development of a complete Web application. You will learn everything from an introduction to development, to debugging techniques, to implementing a complete application with HTML pages. Also included is information on JSPs, Servlets and back-end database access. Whether you need individual education or want to prepare for the certification testing, you will find this book to be an excellent resource. This book covers the essential issues you need to know about WebSphere Studio: How to Get Up and Running Java development Debugging techniques HTML Extracting parameters and handling form data Servlets MVC Fundamentals Java Server Pages API Review Accessing databases with JDBC Deployment to WebSphere Express Security Performance monitoring and analysis
Towards a Discipline of System Engineering: Validation of Dependable Systems Architectures.
Authors: Luca Simoncini
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

Computer controlled systems are used in many fields of applications, with different levels of criticality requirements. A common characteristic of such systems is the increasing complexity in intrinsic terms (management of distribution, redundancy, layering of functionalities, etc.) and of the in-the-field operation (interfaces towards the environment, timing constraints, criticality of the controlled applications, etc). This increasing complexity rarely can be completely mastered and usual design practices often suffer from partial approaches, overlooked details, inadequate modeling, insufficient prototyping, limited design tools or techniques available; not to deal with incorrect or incomplete or not understood user requirements, which are often the cause of the final failure of a design or system.The way to try to approach a solution to this situation is far away to be reached, but for sure requires the development and the testing in the field of design processes which address the "system" in its entirety and integrate as many as possible relevant requirements, including the interactions with the environment.The actual disciplines of hardware, firmware, software, application engineering, commonly considered as separated issues have to evolve towards a discipline of "system engineering" which encompass all the previous ones, if we have to rely on systems which control critical environments.
Sparks: coherence as an abstract type
Authors: P. J. Keleher
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Sparks is a protocol construction framework that treats records of coherence actions as abstract types. Sparks' central abstraction is the coherence history, an object that summarizes past coherence actions to shared segments. Histories provide high-level access to coherence guarantees. The author motivates his work by discussing synchronization design in distributed shared memory systems, and shows how histories can be used to cleanly create more efficient synchronization than is currently used.
Origami Modeling Method of Leaves of Plants and CG Image Generation of Flower Arrangement
Authors: Keimei Kaino, Kuniaki Yajima, Norishige Chiba
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

When certain types of digitate leaves are folded up along their main veins as in leaf buds, their margins of leaves are found to form a simple curve or a few lines. From the viewpoint that the venation and the folding leaf buds would be closely related each other, we will propose an origami modeling method. By use of this method, it is shown that complex digitate shapes such as Acer, Cacalia yatabei and Humulus lupulus would be well produced. We will apply this method to get grass stems and twigs of trees and then generate their CG images. We will see that the poetic beauty of wild plants is well produced by our method. To show this fact we will generate CG images of flower arrangement with plants obtained by our method.
Generalized load sharing for packet-switching networks
Authors: Ka-Cheong Leung, V. O. K. Li
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

We propose a framework to study how to effectively perform load sharing in multipath communication networks. A generalized load sharing (GLS) model has been developed to conceptualize how traffic is split ideally, on a set of active paths. A simple traffic splitting algorithm, called weighted fair routing (WFR), has been developed at two different granularity levels, namely, the packet level, and the call level, to approximate GLS with the given routing weight vector. The packet-by-packet WFR (PWFR) mimics GLS by transmitting each packet as a whole whereas the call-by-call WFR (CWFR) imitates GLS so that all packets belonging to a single flow are sent on the same path. We have developed some performance bounds for PWFR and formed that PWFR is a deterministically fair traffic splitting algorithm. This attractive property is useful in the provision of service with guaranteed performance when multiple paths can be used simultaneously to transmit packets which belong to the same flow. Our simulation studies, based on a collection of Internet backbone traces, reveal that WFR outperforms two other traffic splitting algorithms, namely, generalized round robin routing (GRR), and probabilistic routing (PRR). These promising results form a basis for designing future adaptive constraint-based multipoint path routing protocols.
Adaptive QoS Support for Distributed, Java-Based Applications
Authors: Saurav Chatterjee, Bikash Sabata, Michael Brown
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

In this paper, we describe the SRI International (SRI) End-to-End Resource Management of Distributed Systems (ERDoS) project. ERDoS is a distributed middleware with comprehensive resource management support, including application scheduling, resource allocation, and graceful adaptation. We discuss how we have implemented this resource management as part of the Java Virtual Machine (JVM). We have also provided a resource management application programmers interface (API) as a new Java class library. The ERDoS development environment enables nonprogrammers to create complex distributed applications by simply stringing together multiple Java methods. The ERDoS run-time environment utilizes a structuring algorithm to create a distributed Java application dynamically, and then provides allocation, scheduling, and content-based, graceful, adaptive QoS support to these applications. We demonstrate the benefits of content-based adaptation and of dynamic structuring of distributed applications, using a set of video applications.
Power Reduction in Test-Per-Scan BIST
Authors: Xiaodong Zhang, Kaushik Roy
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

The input signal activities during test can be much higher than during test. Hence, it is important to reduce power consumption to avoid any failures during test. In this paper, we propose techniques to reduce power dissipations in both the combinational block and the scan chain for Test-Per-Scan BIST. Some extra circuitry is introduced between the combinational logic and the scan chain to make the combinational block idle during the scan-in and scan-out operation, and the scan chain is re-ordered so that the number of signal transitions in it is minimized. Compared to the standard weighted random pattern (WRP) testing (without re-ordering), the number of signal transitions in the scan chain can be reduced by 43.8%. With some extra circuitry, the power dissipation in the combinational block can be reduced to less than 0.86%, compared to the standard Test-Per-Scan BIST.
On Minimally Imperfect Graphs with Circular Symmetry
Authors: Gabor Bacso, Endre Boros, Vladimir Gurvich, Frederic Maffray, Myriam Preissmann
Venue:  (1997)

Results of Lovasz and Padberg entail that the class of so-called partitionable graphs contains all the potential counterexamples to Berge''s famous Strong Perfect Graph Conjecture (which asserts that the only minimally imperfect graphs are the odd chordless cycles with at least five vertices and their complements). Only two constructions (due to Chvatal, Graham, Perold and Whitesides) are known for making partitionable graphs. The first one does not produce any counterexample to Berge''s Conjecture, as shown by Sebo. Here we prove that the second construction does not produce any counterexample either. We conjecture that every partitionable graph with circular symmetry can be generated by this second construction, and give results in this direction. We also show that, regardless of this conjecture, every minimally imperfect graph with circular symmetry must have an odd number of vertices.