ppxscal/embedding_network huggingface dataset:
Palindrome recognition using a multidimensional tape
Authors: Therese Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammadtaghi Hajiaghayi, Tomáš Vinař
Venue: Theoretical Computer Science (2003)

The problem of palindrome recognition using a Turing machine with one multidimensional tape is proved to, require Θ(n2/log n) time.
Queueing analysis for shared buffer switching networks for non-uniform traffic
Authors: E. Valdimarsson
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Uniform traffic does not represent a realistic view of traffic patterns in real systems. Non-uniform traffic models better reflect the traffic patterns that need to be accommodated. Such traffic may cause the network performance to deteriorate to much lower levels than the ones predicted by uniform traffic analysis. The authors extend the queueing analysis for buffered networks by providing methods for analyzing the queueing behavior of switching networks under non-uniform traffic patterns. They focus on shared buffer switch elements because they have better performance than input or output buffered elements. The analytical method for performance evaluation is compared with simulation on the basis of accuracy, where the performance is measured in terms of maximum throughput and probability of cell loss.
ImageRover: A Content-Based Image Browser for the World Wide Web
Authors: Stan Sclaroff, Leonid Taycher, Marco LaCascia
Venue:  (1997)

Abstract ImageRover is a search by image content navigation tool for the world wide web. To gather images expediently, the image collection subsystem utilizes a distributed fleet of WWW robots running on different computers. The image robots gather information about the images they find, computing the appropriate image decompositions and indices, and store this extracted information in vector form for searches based on image content. At search time, users can iteratively guide the search through the selection of relevant examples. Search performance is made efficient through the use of an approximate, optimized k-d tree algorithm. The system employs a novel relevance feedback algorithm that selects the Lm distance metrics appropriate for a particular query.
A Multi-version Approach to Conflict Resolution in Distributed Groupware Systems
Authors: Chengzheng Sun, David Chen
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Groupware systems are a special class of distributed computing systems, which support human-computer-human interaction. Real-time collaborative graphics editors allow a group of users to view and edit the same graphics document at the same time from geographically dispersed sites connected by communication networks. Resolving conflict access to shared objects is one of the core issues in the design of this type of systems.This paper proposes a novel distributed multi-version approach to conflict resolution. This approach aims to preserve the work concurrently produced by multiple users in the face of conflicts, and to minimize the number of object versions for accommodating combined effects of conflicting and compatible operations.Major technical contributions of this work include a formal specification of a unique combined effect for any group of conflicting and compatible operations, a distributed algorithm for incremental creation of multiple object versions, and a consistent object identification scheme for multi-version and multi-replica graphics editing systems. All algorithms and schemes presented in this paper have been used in the GRACE (GRAphics Collaborative Editing) system implemented in Java.
Modeling and Analysis of Power Distribution Networks for Gigabit Applications
Authors: Wendemagegnehu Beyene, Chuck Yuan, Joong-Ho Kim, Madhavan Swaminathan
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

As the operating frequency of digital systems increasesand voltage swing decreases, it becomes increasinglyimportant to accurately characterize and analyze powerdistribution networks (PDN). This paper presents themodeling, simulation, and measurement of a PDN in ahigh-speed FR4 printed circuit board (PCB) designed forchip-to-chip communication at a data rate of 3.2 Gbps andabove. The test board consists of two transceiver chipsplaced on wirebond plastic ball grid array (PBGA)packages. The applied analysis method is a hybridtechnique that combines the interactions of the powerplanes, interconnects, and the nonlinear drivers. Thepower planes and interconnects are modeled using thetransmission matrix method (TMM) and rationalinterpolation, respectively. Then macro modeling isapplied to generate reduced-order models to efficientlyanalyze the whole system including the nonlinear driversusing conventional circuit simulation tools such as SPICE.The transfer characteristics of the power planes arecalculated and the effects of the decoupling capacitors andpower supply noise are studied. The simulation results arealso correlated with measurement data to verify thevalidity of the method.
Petri net models for describing multimedia synchronization requirements
Authors: S. Vuong, K. Cooper, M. Ito
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

Synchronization constitutes an important research field in multimedia communication. The synchronization problem has been addressed in the literature in two distinct levels: specification and design. On the specification level, several formal models have been proposed, which are mostly variations of the Petri net model. Although some models are deemed to be better than others in some aspects, there has not been a comprehensive comparison of these specification models. This paper provides a critical review of the existing Petri net specification approaches for specifying synchronization constraints, including object composition, extended object composition, dynamic timed and time stream Petri net models, and applies them to the specification of an interesting, relatively straightforward synchronization example for a qualitative and quantitative evaluation of their strengths and weaknesses
Camel Sequences and Their Applications
Authors: Gurvich V., Sheng Li
Venue:  (1999)

Given an even cyclic (0,1) sequence $s = (s_1,..., s_{2n})$ which consists of $n$ ones and $n$ zeros, let us compute $i + j (mod 2n)$ for all $n^2$ (0,1)-pairs $(s_i,s_j)$ and distribute obtained $n^2$ numbers between $2n$ "boxes" $1,2,...,2n-1,2n=0 (mod 2n)$. Obviously, the average cardinality of a box is $\frac{n^2}{2n}=\frac{n}{2}$. The following five sequences have quite remarcable box-distributions, "almost average everywhere with two big humps": $n=3$, $s = (110100)$, $B = (112113) = (1^2 \, 2 \, 1^2 \, 3)$; $n=7$, $s = (11101000110100)$, $B = (33333363333337) = (3^6 \, 6 \, 3^6 \, 7)$; $n=11$, $s = (1110001001011100010110)$, $B = (5^{10} \, 10 \; 5^{10} \, 11)$; $n=5$, $s = (1110010100)$, $B = (3333133330) = (3^4 \, 1 \, 3^4 \, 0)$; $n=17$, $s = (1111101000110001011011010001100010)$, $B = (9^{16} \, 1 \, 9^{16} \, 0)$. In general, given an {\em odd} $n$, box-distributions $(\lfloor\frac{n}{2}\rfloor^{n-1} (n-1) \lfloor\frac{n}{2}\rfloor^{n-1} n)$ and $(\lceil\frac{n}{2}\rceil^{n-1} \; 1 \lceil\frac{n}{2}\rceil^{n-1} \; 0)$ as well as the generating sequences will be called the {\em camel distributions} and the {\em camel sequences}, respectively {\em up-camel} and {\em down-camel}. We conjecture that there are infinitely many of them, both types, though only five are known. The first three sequences above are up-camel, and the last two are down-camel. We consider some applications of camel sequences in extremal graph theory. Key Words: (0,1)-sequence, camel sequence, maximin, minimax, extremal graph theory, vertex-enumerated graphs
Microsoft Exchange Server 2003 Administrator's Pocket Consultant
Authors: William Stanek
Venue:  (2003)

The fast-answers, on-the-go guide to administering Microsoft Exchange Server 2003. This pocket-sized reference features concise tables, listings, and step-by-step instructions for concise, accurate answers on the spot.
Parallel Computer Needs at Dartmouth College
Authors: David Kotz, Fillia Makedon, Matt Bishop, Robert L. S Drysdale, Donald B. Johnson, Panagiotis Metaxas
Venue:  (1992)

To determine the need for a parallel computer on campus, a committee of the Graduate Program in Computer Science surveyed selected Dartmouth College faculty and students in December, 1991, and January, 1992. We hope that the information in this report can be used by many groups on campus, including the Computer Science graduate program and DAGS summer institute, Kiewit''s NH Supercomputer Initiative, and by numerous researchers hoping to collaborate with people in other disciplines. We found significant interest in parallel supercomputing on campus. An on-campus parallel supercomputing facility would not only support numerous courses and research projects, but would provide a locus for intellectual activity in parallel computing, encouraging interdisciplinary collaboration. We believe that this report is a first step in that direction.
A Framework for Migration of Networked Intercommunication Processes
Authors: Daniel Azuma, James Lin, Eugene Chun, Matthew Richardson
Venue:  (1997)

No abstract available.
Design and implementation of DIRK integrators for stiff systems
Authors: Roger Alexander
Venue: Applied Numerical Mathematics (2003)

This paper presents new four-stage diagonally implicit Runge-Kutta integration formulas for stiff initial value problems, designed to be L-stable and have optimal order of accuracy. The design makes estimation of local error and interpolation of the solution possible without additional stages. It also enables improved prediction of stage values in a software implementation. Correctly monitoring the convergence rate of simplified Newton iterations improves the implementation too, by providing a sound basis for deciding on Jacobian updates.
Chain Models and Finite Element Analysis
Authors: Richard S. Palmer
Venue:  (1994)

Algebraic-topological chains defined over finite cell complexes have been proposed as a uniform computational means of representing physical objects, systems and properties. In this article, we introduce CHAINS, an algebraic-topological computer language for representing and computing the properties of a wide variety physical systems. In particular, we develop a CHAINS program that implements a finite element approximation to linear elasticity. In the process we illustrate the relationship between finite element analysis and the chain models methodology, showing that while finite element analysis is a specific numerical approximation scheme, CHAINS is a computer language for specifying and representing a variety of physical systems and approximations, of which finite element computations are one example.
The unification problem for confluent right-ground term rewriting systems
Authors: Michio Oyamaguchi, Yoshikatsu Ohta
Venue: Information and Computation (2003)

The unification problem for term rewriting systems (TRSs) is the problem of deciding, for a given TRS R and two terms M and N, whether there exists a substitution θ such that Mθ and Nθ are congruent modulo R (i.e., Mθ ↔R* Nθ). In this paper, the unification problem for confluent right-ground TRSs is shown to be decidable. To show this, the notion of minimal terms is introduced and a new unification algorithm for obtaining a substitution whose range consists of minimal terms is proposed. Our result extends the decidability of unification for canonical (i.e., terminating and confluent) right-ground TRSs given by Hullot [Proceedings of the 5th Conference on Automated Deduction, LNCS, vol. 87, 1980, p. 318] in the sense that the termination condition can be omitted.
Pál-type interpolation on nonuniformly distributed nodes on the unit circle
Authors: H. P. Dikshit
Venue: Journal of Computational and Applied Mathematics (2003)

We study here the regularity of certain Pál-type interpolation problems involving the Möbius transforms of the zeros of zn + 1 and zn - 1 along with one additional point ζ or two additional points ζ and 1.
An Information Retrieval System for Performing Hierarchical Document Clustering
Authors: Eric Hagen
Venue:  (1997)

This thesis presents a system for web-based information retrieval that supports precise and informative post-query organization (automated document clustering by topic) to decrease real search time on the part of the user. Most existing Information Retrieval systems depend on the user to perform intelligent, specific queries with Boolean operators in order to minimize the set of returned documents. The user essentially must guess the appropriate keywords before performing the query. Other systems use a vector space model which is more suitable to performing the document similarity operations which permit hierarchical clustering of returned documents by topic. This allows "post query" refinement by the user. The system we propose is a hybrid beween these two systems, compatibile with the former, while providing the enhanced document organization permissable by the latter. 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
Correctness Proof of Ben-Or''s Randomized Consensus Algorithm
Authors: Marcos K Aguilera, Sam Toueg
Venue:  (1998)

We present a correctness proof for Ben-Or''s Randomized Consensus Algorithm for the case in which processes can fail by crashing, and a majority of processes is correct. This is the first time that the proof of Ben-Or''s algorithm appears for this case. The proof has been extracted from [AT96]: it is a simplification of the correctness proof of a more complex consensus algorithm that involves both randomization and failure detection.
Tools and techniques for performance measurement of large distributed multiagent systems
Authors: Aaron Helsinger, Richard Lazarus, William Wright, John Zinky
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Performance measurement of large distributed multiagent systems (MAS) offers challenges that must be addressed explicitly in the agent infrastructure. Performance data is widely distributed and voluminous, and poor data collection can impact the operation of the system itself. However, performance metrics are essential to internal system function, e.g., autonomous adaptation to dynamic environments, as well as to external assessment. In this paper we describe the tools, techniques, and results of performance characterization of the Cougaar distributed agent architecture. These techniques include infrastructure instrumentation, plugin-based instrumentation of agents, and dynamic control of metric collection. We introduce multiple redundant "channels" for metric delivery, each serving separate quality of service requirements. We present our techniques for instrumenting the agent society, justify the metrics chosen, and describe the tools developed for collecting these metrics. We also present results from distributed agent societies comprising hundreds of agents.
WWW.BDD-Portal.ORG: an experimentation platform for binary decision diagram algorithms
Authors: Christoph Meinel, Harald Sack, Arno Wagner
Venue: Experimental algorithmics: from algorithm design to robust and efficient software (2002)

There is an upcoming need for World Wide Web portal sites to facilitate access to resources for specific research communities. The portal site described in this paper provides a testbed functionality besides additional information resources that are of interest in the research in Binary Decision Diagrams (BDDs). In the last decade, BDDs have proven to be the state-of-the-art data structure in computer aided design of integrated digital circuits. To assess the strengths and weaknesses of manipulation algorithms for BDDs, benchmark calculation is one of the most important methods in BDD-research. Due to the inherent high sensitivity of these algorithms to the particular experimental setup it is rather difficult or even impossible to reproduce benchmark results for comparison or for independent result verification. We have designed and implemented a WWW based BDD-testbed that overcomes these problems and greatly facilitates BDD algorithm comparison.
Characterizations of near hexagons by means of one local space
Authors: Bart De Bruyn
Venue: Journal of Combinatorial Theory Series A (2003)

We characterize the classical and glued near hexagons by means of the local space at one point. We also show that the local space cannot be isomorphic to an affine plane if the near hexagon has thick lines.
Diversity evolution
Authors: Russell K. Standish
Venue: Proceedings of the eighth international conference on Artificial life (2002)

Bedau has developed a general set of evolutionary statistics that quantify the adaptive component of evolutionary processes. On the basis of these measures, he has proposed a set of 4 classes of evolutionary system. All artificial life sytems so far looked at fall into the first 3 classes, whereas the biosphere, and possibly the human economy belongs to the 4th class. The challenge to the artificial life community is to identify exactly what is difference between these natural evolutionary systems, and existing artificial life systems.At ALife VII, I presented a study using an artificial evolutionary ecology called EcoLab. Bedau's statistics captured the qualitative behaviour of the model. EcoLab exhibited behaviour from the first 3 classes, but not class 4, which is characterised by unbounded growth in diversify. EcoLab exhibits a critical surface given by an inverse relationship between connectivity and diversity, above which the model cannot tarry long. Thus in order to get unbounded diversity increase, there needs to be a corresponding connectivity reducing (or food web pruning) process. This paper reexamines this question in light of two possible processes that reduce ecosystem connectivity: a tendency for specialisation and increase in biogeographic zones through continental drift.
Topic analysis using a finite mixture model
Authors: Hang Li, Kenji Yamanishi
Venue: Information Processing and Management: an International Journal (2003)

Addressed here is the issue of 'topic analysis' which is used to determine a text's topic structure, a representation indicating what topics are included in a text and how those topics change within the text. Topic analysis consists of two main tasks: topic identification and text segmentation. While topic analysis would be extremely useful in a variety of text processing applications, no previous study has so far sufficiently addressed it. A statistical learning approach to the issue is proposed in this paper. More specifically, topics here are represented by means of word clusters, and a finite mixture model, referred to as a stochastic topic model (STM), is employed to represent a word distribution within a text. In topic analysis, a given text is segmented by detecting significant differences between STMs, and topics are identified by means of estimation of STMs. Experimental results indicate that the proposed method significantly outperforms methods that combine existing techniques.
SND-MAC: An Efficient Media Access Control Method for Integrated Services in High Speed Wireless Networks
Authors: Zhijun Cai, Mi Lu
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

With the development of the wireless communication technology, a wide range of services such as the voice, video, and data communication should be provided to users. To support integrated services, efficient Medium Access Control (MAC) methods should be developed. In this paper, a new MAC, reservation-scheme and contention-scheme combined, termed the Sequence Number based Dynamic MAC (SND-MAC), is proposed to efficiently realize the integrated service in wireless communication networks. The SND-MAC can fit for the integrated service overload in the network adaptively to keep the performance always good. The reservation scheme used in the Heavy Overload Mode (HOM) of the SND-MAC is different from traditional ones in the sense that wireless terminals need not send reserve requests, which will cause collisions to the control center. The method can greatly improve the channel utility. Under the HOM of the SND-MAC, there are no collisions during the communication. No slots will be wasted and the frame can be fully utilized. Moreover, no hidden terminal problems will happen. The SND-MAC will improve the system performance significantly, especially in the case where the integrated communication overload in the wireless network is heavy. It allows the voice, video and data terminals to share the wireless channel efficiently, and makes it possible to realize integrated services based on wireless networks efficiently. The SND-MAC can also be applied to wired networks with the control center, such as HFC (Hybrid of Fiber and Cable) networks.
An asynchronous complete method for distributed constraint optimization
Authors: Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Makoto Yokoo
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi agent systems where a solution within given quality parameters must be found. Existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while operating both efficiently and asynchronously. Adopt is guaranteed to find an optimal solution, or a solution within a user-specified distance from the optimal, while allowing agents to execute asynchronously and in parallel. Adopt obtains these properties via a distributed search algorithm with several novel characteristics including the ability for each agent to make local decisions based on currently available information and without necessarily having global certainty. Theoretical analysis shows that Adopt provides provable quality guarantees, while experimental results show that Adopt is significantly more efficient than synchronous methods. The speedups are shown to be partly due to the novel search strategy employed and partly due to the asynchrony of the algorithm.
A Structured Analysis of the New ISO Standard on Functional Size Measurement?? Definition of Concepts
Authors: Alain Abran, Jean-Philippe Jacquet
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

The ISO 14143-1 standard is the first in a set of five documents constituting the international standard on Functional Size Measurement for software. This first document specifies a mandatory set of concepts required for functional size measurement and tackles it from a measurement method perspective. This is a unique perspective, in contrast to other standardization work in progress on software. This article presents a structured analysis of ISO 14143-1 to analyze its completeness and mapping to measurement principles and related concepts. This analysis is carried out following the structure of a process model for software engineering measurement methods identifying the distinct steps involved, from the design of a measurement method to the exploitation of the measurement results. Strengths and weaknesses are identified and then discussed from the perspective of the intended users of this standard: users and designers of functional size measurement methods.