ppxscal/embedding_network huggingface dataset:
Internet Packet Loss: Measurement and Implications for End-to-End QoS
Authors: Michael S. Borella, Debbie Swider, Suleyman Uludag, Gregory B. Brewster
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

We analyze a month of Internet packet loss statistics forspeech transmission using three different sets of transmitter/receiver host pairs. Our results indicate that packet lossis highly bursty, with the majority of individual losses occurringin a relatively small number of bursts. We find that lossexhibits dependence in most cases, but is not always well-modeledas dependent. We introduce an analytical techniquefor measuring loss dependency. We also consider theasymmetry of round-trip packet loss, and find that most losson a round-trip path occurs in either one direction or theother. We introduce a normalized metric for measuring lossasymmetry and apply it to our measurements. Finally wediscuss the implications of our study for the next generationof real-time voice services in the Internet.
Practical Programming in Tcl & Tk, 4 edition
Authors: Welch, Ken Jones, Jeffrey Hobbs
Venue:  (2003)

:"The world's #1 guide to Tcl/Tk has been updated to reflect Tcl/Tk 8.4's powerful improvements in functionality, flexibility, and performance. Brent Welch, Ken Jones, and Jeffrey Hobbs, three of the world's leading Tcl/Tk experts, cover every facet of Tcl/Tk programming, including cross-platform scripting and GUI development, networking, enterprise application integration, and much more." "Coverage includes: systematic explanations and sample code for all Tcl/Tk 8.4 core commands; complete Tk GUI development guidance - perfect for developers working with Perl, Python, or Ruby; insider's insights into Tcl 8.4's key enhancements - VFS layer, internationalized font/character set support, new widgets, and more; definitive coverage of TclHttpd web server (written by its creator); new ways to leverage Tcl/Tk 8.4's major performance improvements; and advanced coverage - threading, Safe Tcl, Tcl script library, regular expressions, and namespaces." Whether you're upgrading to Tcl/Tk 8.4, or building GUIs for applications created with other languages or just searching for a better cross-platform scripting solution, Practical Programming in Tcl and Tk, Fourth Edition delivers all you need to get results.
Close to close packing
Authors: Penrose Oliver, Stell George
Venue:  (2000)

For various lattice gas models with nearest neighbour exclusion (and, in one case, second-nearest neighbour exclusion as well), we obtain lower bounds on $m$, the average number of particles on the non-excluded lattice sites closest to a given particle. They are all of the form $$ m/m_{cp} \ge 1 - \hbox{~const.}(N_{cp}/N - 1) $$ where $N$ is the number of occupied sites, $m_{cp}$ is the coordination number, snd $N_{cp}$ is the value of $N$ at close packing. An analogous result exists for hard disks in the plane.
A Taxonomy for artificial embryogeny
Authors: Kenneth O. Stanley, Risto Miikkulainen
Venue: Artificial Life (2003)

A major challenge for evolutionary computation is to evolve phenotypes such as neural networks, sensory systems, or motor controllers at the same level of complexity as found in biological organisms. In order to meet this challenge, many researchers are proposing indirect encodings, that is, evolutionary mechanisms where the same genes are used multiple times in the process of building a phenotype. Such gene reuse allows compact representations of very complex phenotypes. Development is a natural choice for implementing indirect encodings, if only because nature itself uses this very process. Motivated by the development of embryos in nature, we define artificial embryogeny (AE) as the subdiscipline of evolutionary computation (EC) in which phenotypes undergo a developmental phase. An increasing number of AE systems are currently being developed, and a need has arisen for a principled approach to comparing and contrasting, and ultimately building, such systems. Thus, in this paper, we develop a principled taxonomy for AE. This taxonomy provides a unified context for long-term research in AE, so that implementation decisions can be compared and contrasted along known dimensions in the design space of embryogenic systems. It also allows predicting how the settings of various AE parameters affect the capacity to efficiently evolve complex phenotypes.
Improved Sampling with Applications to Dynamic Graph Algorithms
Authors: Monika Henzinger, Mikkel Thorup
Venue:  (1995)

We state a new sampling lemma and use it to improve the running time of dynamic graph algorithms. For the dynamic connectivity problem the previously best randomized algorithm takes expected time $O(\log^3n)$ per update, amortized over $\Omega(m)$ updates. Using the new sampling lemma, we improve its running time to $O(\log^2n)$. There exists a lower bound in the cell probe model for the time per operation of $\Omega(\log n/\log \log n)$ for this problem. Similarly improved running times are achieved for the following dynamic problems: (1) $O(\log^3 n)$ to maintain the bridges in a graph (the 2-edge connectivity problem); (2) $O(k \log^2n)$ to maintain a minimum spanning tree in a graph with $k$ different weights (the $k$-weight minimum spanning tree problem); (3) $O(\log^2n \log U/\epsilon'')$ to maintain a spanning tree whose weight is a $(1+\epsilon'')$-approximation of the weight of the minimum spanning tree, where $U$ is the maximum weight in the graph (the $(1+\epsilon'')$-approximate minimum spanning tree problem); and (4) $O(\log^2 n)$ to test if the graph is bipartite (the bipartiteness-testing problem).
Catalyst: A DSIP Design Flow Development in Industry
Authors: W. de Rammelaere, K. Eckert, E. Hilkens, T. Lawell, R. McGarity, P. Le Moenner, F. Steininger
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

The Motorola System on Chip Design Technologies (SoCDT) team aims at providing a system design environment for its customers. The Toulouse branch concentrates on design efforts incorporating DSP functionality. This is referred to as the Catalyst methodology. We found that in current systems very often the software development cycle is longer than that of the silicon development. To ease the software burden, we have changed the silicon architecture and its flow to permit the DSP software to be written in the C language instead of assembler code, as is normally done. The resulting architecture is domain specific; it is smaller, has a reduced design cycle and is simpler to implement because it is tuned to the application software we are providing. This paper will describe the methodology which we are developing to create domain specific architectures, it shows one example architecture and aspects which are critical for industry acceptance.
On Isomorphisms and Density of NP and Other Complete Sets
Authors: Juris Hartmanis, L. Berman
Venue:  (1975)

If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P $\neq$ NP and if all PTAPE complete sets are p-isomorphic then P $\neq$ PTAPE. We show that all NP complete sets known (in the literature) are indeed p-isomorphic and so are the known PTAPE complete sets. Thus showing that, in spite of the radically different origins and attempted simplification of these sets, all the known NP complete sets are identical but for polynomially time bounded permutations. Furthermore, if all NP complete sets are p-isomorphic then they must have similar densities and, for example, no language over a single letter alphabet can be NP complete, nor can any sparse language over an arbitrary alphabet be NP complete. We show that complete sets in EXPTIME and EXPTAPE cannot be sparse and therefore they cannot be over a single letter alphabet. Similarly, we show that the hardest context-sensitive languages cannot be sparse. We also relate the existence of sparse complete sets to the existence of simple combinatorial circuits for the corresponding truncated recognition problem of these languages.
Seeing Eye to Eye: A Shared Mediated Reality Using EyeTap Devices and the VideoOrbits Gyroscopic Head Tracker
Authors: Felix Tang, Chris Aimone, James Fung, Andrej Marjan, Steve Mann
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

We present a system which allows wearable computer users to share their views of their current environments with each other. Our system uses an EyeTap: a device which allows the eye of the wearer to function both as a camera and a display. A wearer, by looking around his/her environment, "paints" or "builds" an environment map composed of images from the EyeTap device, along with head-tracking information recording the orientation of each image.The head-tracking algorithm uses a featureless image motion estimation algorithm coupled with a head mounted gyroscope. The environment map is then transmitted to another user, who, through their own head-tracking EyeTap system, browses the first user's environment solely by head motion, seeing the environment as though it were their own. As a result of browsing the transmitted environment map, the viewer builds and extends his/her own environment map, and thus this is a data-producing head-tracking system. These environment maps can then be shared reciprocally between wearers.
Enabling DIR(Designing-In-Reliability) through CAD Capabilities
Authors: Wonjae Kang, Brad Potts, Ray Hokinson, John Riley, David Doman, Frank Cano, N. S. Nagaraj, Noel Durrant
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Chip designs are continuously getting larger and more complex. In response to these trends, design methodologies and tool requirements used in recent high-performance designs have been changing rapidly. A Design-In Reliability Team was formed at SEMATECH and is composed of DIR and CAD tool experts from the member companies. The team's primary goals are to define and develop tool requirement needs of the members and to communicate those needs to the EDA industry, in turn fostering development of new and improved tools. In this paper, the DIR project goals and recommendations will be presented along with prioritized tool needs or gaps. The tool gaps are put in two categories: CAD tool/data interface and DIR point solutions. CAD tool/data interface deals with core design tools that enable correct-by-construction such as reliability-constraint place-and-route tools. The DIR point solutions refer to reliability simulation or verification tools. Moreover high-level tool requirements on top five prioritized tool requirements will be presented. In addition, maturity matrix on DIR tool capabilities will be presented in order to show both current and future DIR tool gaps. Also, a high-level roadmap of the team and future projects will be presented. Chip designs are continuously getting larger and more complex. In response to these trends, design methodologies and tool requirements used in recent high-performance designs have been changing rapidly. A Design-In Reliability Team was formed at SEMATECH and is composed of DIR and CAD tool experts from the member companies. The team's primary goals are to define and develop tool requirement needs of the members and to communicate those needs to the EDA industry, in turn fostering development of new and improved tools. In this paper, the DIR project goals and recommendations will be presented along with prioritized tool needs or gaps. The tool gaps are put in two categories: CAD tool/data interface and DIR point solutions. CAD tool/data interface deals with core design tools that enable correct-by-construction such as reliability-constraint place-and-route tools. The DIR point solutions refer to reliability simulation or verification tools. Moreover high-level tool requirements on top five prioritized tool requirements will be presented. In addition, maturity matrix on DIR tool capabilities will be presented in order to show both current and future DIR tool gaps. Also, a high-level roadmap of the team and future projects will be presented.
An Effective File Migration Algorithm in Cluster File Systems
Authors: Wei Liu, Weimin Zheng, Meiming Shen, Xinming Ou, Min Wu
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

I/O balancing is an attractive problem in distributed systems. With the fast growth of high-speed network technology, file migration becomes an effective way to solve the problem. In this paper, we present an effective file migration algorithm in our cluster file system - TH-CluFS. Our algorithm moves files from congested nodes to relatively un-congested nodes according to the information of current system states. The algorithm makes each file migration beneficial to the mean response time of file requests. Moreover, we use simulation to demonstrate that file migration can improve system overall performance greatly in cluster file systems. Our results indicate that the cluster system with file migration algorithm not only achieves higher scalability and more powerful processing capability, but also makes the effect of network traffic reduced about 12%.
What's New in Visual FoxPro 7.0
Authors: Tamar E. Granor, Doug Hennig, Kevin McNeish
Venue:  (2002)

:Visual FoxPro 7.0 has been called the most revolutionary upgrade since 3.0. This concise guide explores what's new and how to use it.
An Analysis of Approximate Nonlinear Elimination
Authors: J P Lanzkron, J D Rose
Venue:  (1993)

We present a method for solving systems of nonlinear equations suitable to problems where convergence of an approximate Newton method is initially slow. The method, nonlinear elimination (NlEm), eliminates the nonlinear equations and appropriate variables deemed to be causing the problem. We give an analysis of the method. The analysis leads to a detailed algorithm which we show reduces automatically to approximate Newton method near the root of the system of equations. We conclude with several examples demonstrating the efficacy of the method.
Smooth Rational Motion of a Rigid Triangle in R3
Authors: Farzana S. Chaudhry
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Using rational motions it is possible to apply many fundamental Bézier spline (or B-spline) techniques to the designs of motion. This paper develops and tests a simple automatic algorithm for representing C 1 smooth motion of a rigid triangle 4 in R3 , by means of piecewise parametric rational curves of degree 2m=2m for some m,when measurements of the positions of the vertices of the triangle 4 at a sequence of times ti; i = 0; 1; : : : ; n,in R3 are given. The method presented in this paper can be applied to various problems in computer animation as well as in robotics.
An Architecture for Designing Distributed Spoken Dialogue Interfaces
Authors: Clement Allen, Sara Stoecklin, Patrick Bobbie, Qian Chen, Ping Wu
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

A spoken dialogue interface allows a user to interact with a computer application using speech. The user engages in a conversation with the application to achieve some goal, for example to obtain travel information or to book theatre tickets. In this paper, we describe an architecture and development environment for designing distributed spoken dialogue interfaces. A distributed spoken dialogue interface allows multiple users, distributed throughout a computer network, to interact with an application using speech. With a distributed spoken dialogue interface, several users engage in a conversation with the application, at different times, to achieve some goal. Our approach to distributed spoken dialogue interfaces is based on the idea of an intelligent agent that coordinates the activities of the multiple users interacting with the application. To support our model of distributed spoken dialogues, we have created a software development environment, JSBB, that can be used to design both distributed and non-distributed spoken dialogue interfaces.
Certified Macromedia Flash MX Designer Study Guide
Authors: Tim Parker, Christopher Hayes
Venue:  (2002)

:UntitledCertified Macromedia Flash MX Designer Study Guide is not strictly intended to teach Flash design; rather, it works as a review and study guide for those Flash designers looking to pass the Certified Flash Designer exam. Readers will learn how to design, structure and optimize for the most efficient Flash animations possible. Each subject is presented in clear and direct language, with useful and well-explained examples and extensive graphical elements. Sample questions accompany each subject, as will references to recommended reading (documentation, course work, and existing Macromedia Press ColdFusion books).
TCP-PR: TCP for Persistent Packet Reordering
Authors: Stephan Bohacek, João P. Hespanha, Junsoo Lee, Chansook Lim, Katia Obraczka
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Most standard implementations of TCP perform poorly when packets are reordered.In this paper, wepropose a new version of TCP that maintains highthroughput when reordering occurs and yet, whenpacket reordering does not occur, is friendly to otherversions of TCP.The proposed TCP variant, or TCP-PR,does not rely on duplicate acknowledgements to detecta packet loss.Instead, timers are maintained to keeptrack of how long ago a packet was transmitted.Incase the corresponding acknowledgement has not yetarrived and the elapsed time since the packet was sentis larger than a given threshold, the packet is assumedlost.Because TCP-PR does not rely on duplicateackowledgments, packet reordering (including out-of-orderacknowledgments) has no effect on TCP-PR'sperformance.Through extensive simulations, we show that TCP-PRperforms consistently better than existing mechanismsthat try to make TCP more robust to packet reordering.When the case that packets are not reordered, we verifythat TCP-PR maintains the same throughput as typicalimplementations of TCP (specifically, TCP-SACK) andshares network resources fairly.
Encapsulating Mobile Objects
Authors: Hermann Haertig, Lars Reuther
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

The paper describes a technique to effectively isolate mobile objects or processes that execute downloaded, potentially suspicious programs. It relies on wish lists, trust lists and capability lists. Wish lists are carried along with programs or mobile objects and denote the resources requested by the program to do what it claims to do. Wish lists are transformed into capability lists when downloaded programs are started. Trust lists reside on stations and are used to determine which members of wish lists are taken over into capability lists. The capability lists are enforced during the execution of programs. All lists are symbolic to enable their interpretation in heterogeneous environments. The paper describes the technique, its integration in a Linux environment and first experiences.
With Probability One, a Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy
Authors: Jin Cai
Venue:  (1985)

We consider how much error a fixed depth Boolean circuit has to make for computing the parity function. We show that with an exponential bound of the form $exp(n^{\lambda})$ on the size of the circuits, they make asymptotically 50% error on all possible input, uniformly. As a consequence, we show that with a random oracle set $A,Pr.(PSPACE^{A} \supseteq PH^{A} = 1$.
Testing Multivariate Linear Functions:Overcoming the Generator Bottleneck
Authors: Funda Ergun
Venue:  (1994)

The problem of testing program correctness has received considerable attention in computer science. One approach to this problem is the notion of self-testing programs \cite{BlumLubyRubinfeld}. Self-testing usually becomes more costly in the case of testing multivariate functions. In this paper we present efficient methods for self-testing multivariate linear functions. We then apply these methods to several multivariate linear problems to construct efficient self-testers.
Certification of reusable software components: summary of work in progress
Authors: S. L. Rohde, K. A. Dyson, P. T. Geriner, D. A. Cerino
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

This paper provides a synopsis of in-progress research and development in reuse and certification of software components at Rome Laboratory of the Air Force Materiel Command, Rome, NY. A Certification Framework for software components was developed which is sensitive to varying domains, business strategies and component types. A cost benefit plan, an operational concept, a suite of certification tools, and a prototype were defined. Field trial procedures were developed, applied, and the results reported.
Generation of key predistribution schemes using secret sharing schemes
Authors: Germán Sáez
Venue: Discrete Applied Mathematics (2003)

In a key predistribution scheme a trusted authority distributes pieces of information among a set of users in such a way that users belonging to a specified privileged subset can compute individually a secret key common to this subset. In such a scheme, a family of forbidden subsets of users cannot obtain any information about the value of the secret. In this paper, we present a new construction of a key predistribution scheme using a family of vector space secret sharing schemes. The set of privileged users and the family of forbidden subsets is described in terms of the family of vector space access structures. A generalization using linear secret sharing schemes is given. We show that a particular case of this construction is any key predistribution scheme in which pieces of information and secrets are linear combinations of random numbers. Using this result, we show explicitly that the most important key predistribution schemes can be seen as a particular case of this construction. For this construction, the question of when given secrets can be predistributed is discussed.
Accounting for Realities When Estimating the Field Failure Rate of Software
Authors: Daniel R. Jeske, Xuemei Zhang, Loan Pham
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

A realistic estimate of the field failure rate of software is essential in order to decide when to release the software while maintaining an appropriate balance between reliability, time-to-mar et and development cost.Typically, software reliability models are applied tosystem test data with the hope of obtaining an estimate of the software failure rate that will be observed in the field.Unfortunately, test environments are usually quite different from field environments.In this paper, we use a calibration factor to characterize the mismatch betweenthe system test environment and the field environment, and then incorporate the factor into a widely used software reliability model.For projects that have both system test data and field data for one or more previous releases, the calibration factor can be empirically evaluated and used to estimate the field failure rate of a new release based on its system test data.For newprojects, the calibration factor can be estimated by matching the software to related projects that have both system test data and field data.