ppxscal/embedding_network huggingface dataset:
Analysis and improvement of fairness between TCP Reno and Vegas for deployment of TCP Vegas to the Internet
Authors: G. Hasegawa, K. Kurata, M. Murata
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

According to past research, a TCP Vegas version is able to achieve higher throughput than TCP Tahoe and Reno versions, which are widely used in the current Internet. However we need to consider a migration path for TCP Vegas to be deployed in the Internet. In this paper, by focusing on the situation where TCP Reno and Vegas connections share the bottleneck link, we investigate the fairness between two versions. From the analysis and the simulation results, we find that the performance of TCP Vegas is much smaller than that of TCP Reno as opposed to an expectation on TCP Vegas. The RED algorithm improves the fairness to some degree, but there may still be an inevitable trade-off between fairness and throughput. Accordingly, we consider two approaches to improve the fairness. The first one is to modify the congestion control algorithm of TCP Vegas, and the other is to modify the RED algorithm to detect misbehaved connections and drop more packets from those connections. We use both of analysis and simulation experiment for evaluating the fairness, and validate the effectiveness of the proposed mechanisms.
I-V Fast IDDQ Current Sensor for On-Line Mixed-Signal/Analog Test
Authors: Martin Margala, Srdjan Dragic, Ahmed El-Abasiry, Samuel Ekpe, Viera Stopjaková
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

This paper proposes a novel, ultra low-voltage design of a built-in current sensor for testing mixed-signal and analog circuits. Designed in 0.18um CMOS technology, the monitor is based on the principle of a current mirror that is supported by the converting and output stages. The design is easily applicable to test mixed-signal and analog circuits. The sensor is designed for the power supply of 1.0 V that offers acceptance in ultra low-voltage test applications. Presented results demonstrate excellent performances of the on-chip monitor.
Spreading Associative Neural Network Recognizes the Shape and Position of an Object Simultaneously
Authors: Kiyomi Nakamura, Noriki Kinoshita, Hirokazu Kanayama, Takashi Minami
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Paying attention to the spatial recognition system in the brain (i.e. parietal cortex), we proposed a spreading associative neural network (SAN net), which had double spreading neural layers. We investigated whether the SAN net could represent multiple spatial frames of reference and multiple object shape information simultaneously. The SAN net not only recognized the shape of the object (e.g. human faces and Arabic numerals) in the two-dimensional space irrespective of its position, but also recognized its position irrespective of its shape in the input pattern at the same time. The nonlinear transformation using spatial double spreading in the SAN net is crucial for the simultaneous recognition of both the shape and the spatial position of an object. The results showed that the SAN net could represent not only multiple spatial frames of reference but also multiple object shape information simultaneously.
A Gossip-Style Failure Detection Service
Authors: Robbert Van Renesse, Yaron Minsky, Mark Hayden
Venue:  (1998)

Failure Detection is valuable for system management, replication, load balancing, and other distributed services. To date, Failure Detection Services scale badly in the number of members that are being monitored. This paper describes a new protocol based on gossiping that does scale well and provides timely detection. We analyze the protocol, and then extend it to discover and leverage the underlying network topology for much improved resource utilization. We then combine it with another protocol, based on broadcast, that is used to handle partition failures.
Automatic restoration of telecommunication networks
Authors: M. O. Mansour, F. Wong
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The paper provides a set of guidelines to design and evaluate automatic restoration for telecommunication networks. The operation of a telecommunications network is defined to be in one of three modes: normal, abnormal and restorative. The paper emphasizes the coordinated performance of a network management system (NMS) and an automatic restoration system (RS). The NMS detects the abnormal mode, and the RS restores normal operating conditions. The paper defines and explains the necessary steps of real-time restoration, provides design and evaluation parameters for automatic restoration and presents the operational reliability considerations.
Load Profiling for Efficient Route Selection in Multi-Class Networks
Authors: Azer Bestavros, Ibrahim Matta
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

High-speed networks, such as ATM networks, are expected to support real-time Quality of Service (QoS) guarantees required by many applications such as those that involve voice and video communication. To support such services, routing algorithms that allow for the reservation of the needed bandwidth over a Virtual Circuit (VC) have been proposed. Commonly, these algorithms assign VCs to routes using the least-loaded concept, and thus result in balancing the load over the set of all candidate routes. In this paper, we show that for such reservation-based VC routing algorithms---which allow for the exclusive use of a preset fraction of a resource's bandwidth for an extended period of time---load balancing is not desirable as it results in resource fragmentation, which adversely affects the likelihood of accepting new VC requests. We present an on-line VC routing scheme that is based on the concept of ``load profiling'', which allows a distribution of ``available'' bandwidth across a set of candidate routes to match the characteristics of incoming VC QoS requests. We show the effectiveness of our load-profiling approach when compared to traditional load-balancing and load-packing VC routing schemes.
Relaxed consistency requirements for replicated objects
Authors: Manhoi Choy
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Shared objects are usually replicated in a distributed environment for higher availability and fault tolerance. Coherent or strongly consistent implementation of replicated objects have been studied extensively in the literature. This paper concentrates on a general method for specifying and implementing replicated objects that only require weaker consistency conditions. The weakness of the objects is left open and users are allowed to specify their objects by defining how concurrent sets of operations should be performed. The implementation of a replicated object consists of two modules: one module is an algorithm to identify concurrent sets from a distributed computation, and the other module is a user defined procedure to process the concurrent sets. We show examples of weaker objects that can be defined and implemented efficiently because of the less stringent requirements imposed on these objects. In particular, the ordered set dictionary problem is used to demonstrate our scheme and we show that non-blocking implementation of the dictionary is possible.
The Power of Sequence Design in DNA Computing
Authors: Masanori Arita, Satoshi Kobayashi
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Sequence design is a crucial problem in DNA-based computation.We shall introduceA simple strategy called T emulate method, which can systematically generate a setOf sequences such as any sequence will have at least 4 mismatches with other sequences and with concatenated part of other sequences.
Effect of virtual circuit rerouting on application performance
Authors: P. P. Mishra, M. Srivastava
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

One of the key problems in extending ATM protocols to support host mobility is designing virtual circuit rerouting protocols to maintain continual network connectivity to a mobile host. Ideally, VC rerouting must be done fast enough so as to cause minimal disruption to applications, running on mobile hosts. In this paper, we evaluate the impact of several virtual circuit rerouting strategies on application performance. Our results show that using simple and fast rerouting policies results in good performance for both data and real-time traffic.
Runtime Systems for Fine-Grain Multicomputers
Authors: Nanette J Boden
Venue:  (1993)

Abstract to be added.
A Formal Framework for Evaluating Heuristic Programs
Authors: Lenore Cowen, Joan Feigenbaum, Sampath Kannan
Venue:  (1995)

We address the question of how one evaluates the usefulness of a heuristic program on a particular input. If theoretical tools do not allow us to decide for every instance whether a particular heuristic is fast enough, might we at least write a simple, fast companion program that makes this decision on some inputs of interest? We call such a companion program a timer for the heuristic. Timers are related to program checkers, as defined by Blum, in the following sense: Checkers are companion programs that check the correctness of the output produced by (unproven but bounded-time) programs on particular instances; timers, on the other hand, are companion programs that attempt to bound the running time on particular instances of correct programs whose running times have not been fully analyzed. This paper provides a family of definitions that formalize the notion of a timer and some preliminary results that demonstrate the utility of these definitions.
Testing Applications on the Web: Test Planning for Mobile and Internet-Based Systems, 2 edition
Authors: Hung Quoc Nguyen, Bob Johnson, Robert Johnson, Michael Hackett
Venue:  (2002)

:This completely revised and updated book shows the latest technologies and expert tools, tips, and techniques for testing Web applications that run across many platforms and networks, including desktop and wired/wireless mobile clients. You'll quickly be able to maximize productivity, minimize quality risks, and optimize success in the Internet economy.
Tight Binding Electronic Structure Calculations and Tight Binding Molecular Dynamics with Localized Orbitals
Authors: S. Goedecker, M. Teter
Venue:  (1994)

We describe in detail and extend our recent algorithm for tight binding total energy calculations and tight binding molecular dynamics, which scales quadratically with the size of the system for small systems and linearly for big systems. It is intrinsically parallel and gives excellent performance on parallel computers. The central quantity in this algorithm are the localized orbitals. We show in the context of various examples, that our localized orbital algorithm is not only fast, but gives us a better physical undersatnding than conventional extended orbitals and more flexibility in treating complicated geometries. The algorithm can also efficiently handle metallic systems and does not lead to unphysical distortions of the electronic density of states around the Fermi level.
Measurement of Weight from the Images of Pigs
Authors: Shlomo Geva, Kurt Malmstrom, David Preston
Venue:  (1994)

This project examines the possibility of determining the live weight of a pig from its video image. A large emphasis was placed on producing a system that is cost effective and that can be implemented with minimal changes to existing pig rearing environments. We describe the method of approximating the weight of a pig using images obtained from mounting a camera directly above the pig. We describe the methods in which a simple system can be implemented to obtain images of a pig including methods of increasing the image quality and discuss ways to increase the image quality further. We show that the imaging system is capable of producing a high level of accuracy and discuss the advantages and applications of the system in monitoring animal growth performance.
Largest Placement of One Convex Polygon Inside Another
Authors: K P Agarwal, Amenta,  N, Micha Sharir
Venue:  (1995)

We show that the largest similar copy of a convex polygon $P$ with $m$ edges inside a convex polygon $Q$ with $n$ edges can be computed in $O(mn^2\log n)$ time. We also show that the combinatorial complexity of the space of all similar copies of $P$ inside $Q$ is $O(mn^2)$, and that it can also be computed in $O(mn^2\log n)$ time.
A Representation of a Family of Secret Sharing Matroids
Authors: Siaw-lynn Ng
Venue: Designs, Codes and Cryptography (2003)

Deciding whether a matroid is secret sharing or not is a well-known open problem. In Ng and Walker [6] it was shown that a matroid decomposes into uniform matroids under strong connectivity. The question then becomes as follows: when is a matroid m with N uniform components secret sharing? When N &equals; 1, m corresponds to a uniform matroid and hence is secret sharing. In this paper we show, by constructing a representation using projective geometry, that all connected matroids with two uniform components are secret sharing
SPEEDO: A Study in Supercomputer/Workstation Cooperative Processing
Authors: Donna Bergmark, Caroline Hecht
Venue:  (1989)

Researchers running large codes on supercomputers are often concerned with how fast their code runs, where the cycles are burned up, and which subroutines are worth rewriting. Scientists who are post-processing their data to visualize it on their own workstations are interested in integrating the graphics with the computation in order to be able to modify or stop the program if they see that something is wrong. While these two kinds of requests interactive execution monitoring, and control of the scientific application may at first sound quite different, their implementation is nearly identical. We want to make the scientist''s life as easy as possible, and at the same time impact his productivity as little as possible. This implies a minimum of time spent changing the source code, minimal execution-time overhead for the instrumentation code, and a minimum of time spent learning to use new tools. Project Speedo is our first step in providing these kinds of tools. At the present time, we have a C program (an X Window client) that displays the execution speed and percent vectorized of a properly instrumented Fortran code running on the IBM 3090-600 supercomputer. Speedo can monitor a running Fortran program, or it can be run in replay mode, generating the same display from data saved in a file. Our future goals include expanding the functionality of speedo to allow the user to monitor other performance information, such as the processors being used by a Parallel Fortran job, incorporating interactive control of the scientific program, automatically instrumenting the Fortran code to output the necessary data for execution monitoring, and providing a graphical user interface for display program customization.
The Semantics of Evidence
Authors: Robert L. Constable
Venue:  (1985)

The usual meaning of a sentence in the predicate calculus is its truth value. In this paper we show that there is associated with every statement a set of elements comprising evidence for it. A statement is true in a model exactly when there is evidence for it. Proofs can be regarded as expressions which denote evidence. A statement is constructively true when the evidence can be computed from its proofs. Proofs are useful in practical computations when evidence for statements is needed. They are especially valuable in relating computations to the problems they solve.
b = int g
Authors: F. Brezzi, L. P. Franca, T. J. R. Hughes, A. Russo
Venue:  (1996)

In this paper we show the equivalence between the variational multiscale and the residual-free bubbles concepts.
Implementation Techniques for Scoping Contructs in Logic Programming
Authors: Bharat Jayaraman, Gopalan Nadathur
Venue:  (1991)

\indent Introducing universal quantifiers and some forms of implications into goals provides for scoping constructs in logic programming. We address the new implementation problems raised by the addition of these logical symbols. The presence of mixed sequences universal and existential quantifiers in goals requires unification to respect this ordering, a problem we solve by using a scheme for tagging constants and variables. A few changes to existing WAM (Warren Abstract Machine) instructions suffice to implement this scheme. Implication in goals cause new program clauses to be introduced, and the implementation must therefore accommodate a dynamically changing set of program clauses. A naive asserting and retracting of program clauses is an unsatisfactory solution to this problem in view of backtracking. Further, when an implication goal is surrounded by existential quantifiers, the introduced program clauses may have to be {\em parameterized} by the bindings for these existential variables, thus requiring program clauses to be treated as {\em program closures}. We use a hash-table for efficient access to the clauses and a new kind of record, called an {\em implication point} record, to manage the interaction between backtracking and dynamic nesting of implication goals. New instructions for the WAM are proposed for compiling quantifiers and implications in goals.
A cluster algorithm for graphs
Authors: Stijn Dongen
Venue:  (2000)

A cluster algorithm for graphs called the \emph{Markov Cluster algorithm} (MCL~algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL~process. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The MCL~algorithm simulates flow in $G$ by first identifying $G$ in a canonical way with a Markov graph $G_1$. Flow is then alternatingly expanded and contracted, leading to a row of Markov Graphs $G_{(i)}$. Flow expansion corresponds with taking the~$k^{th}$~power of a stochastic matrix, where~$k\in\N$. Flow contraction corresponds with a parametrized operator~$\Gamma_r$, $r\geq 0$, which maps the set of (column) stochastic matrices onto itself. The image~$\Gamma_r M$ is obtained by raising each entry in~$M$ to the~$r^{th}$~power and rescaling each column to have sum~$1$ again. The heuristic underlying this approach is the expectation that flow between dense regions which are sparsely connected will evaporate. The invariant limits of the process are easily derived and in practice the process converges very fast to such a limit, the structure of which has a generic interpretation as an overlapping clustering of the graph~$G$. Overlap is limited to cases where the input graph has a symmetric structure inducing it. The contraction and expansion parameters of the MCL~process influence the granularity of the output. The algorithm is space and time efficient and lends itself to drastic scaling. This report describes the MCL~algorithm and process, convergence towards equilibrium states, interpretation of the states as clusterings, and implementation and scalability. The algorithm is introduced by first considering several related proposals towards graph clustering, of both combinatorial and probabilistic nature.
The Digital Songstream: Mastering the World of Digital Music
Authors: Brad Hill
Venue:  (2003)

:The Digital Songstream is the first practical guide to getting up and running in the new digital world of music. Cutting through myths, it offers a step-by-step introduction to what's possible for performers, composers, and listeners-addressing legal and ethical issues as well as the nuts and bolts of what equipment to buy and what services are available.Written in a friendly, easy-to-understand way by a master musician and computer expert, The Digital Songstream will be the first-and only-reference needed for anyone wishing to enter the world of computer music.
Constructive Neural Networks in Forecasting Weekly River Flow
Authors: Meuser Valenca, Teresa Ludermir
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

This paper presents an constructive neural network model for seasonal streamflow forecasting.This Surface water hydrology is basic to the design and operation of the reservoir.A good example is the operation of a reservoir with an uncontrolled inflow but having a means of regulating the outflow.If information on the nature of the inflow is determinable in advance, then the reservoir can be operated by some decision rule to minimize downstream flood damage.For this reasons, several companies in the Brazilian Electrical Sector use the linear time-series models such as PARMA (Periodic Auto regressiveMoving Average) models developed by Box-Jenkins.This paper provides for river flow prediction a numerical comparison between neural networks, called non-linear sigmoidal regression Blocks networks (NSRBN) and PARMA models.The model was implemented to forecast weekly average inflow on an step-ahead basis.It was tested on four hydroelectric plants located in different river basins in Brazil.The results obtained in the evaluation of the performance of NSRBN were better than the results obtained with PARMA models.
Multi-threading and remote latency in software DSMs
Authors: K. Thitikamol, P. Keleher
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

This paper evaluates the use of per-node multi-threading to hide remote memory and synchronization latencies in a software DSM. As with hardware systems, multi-threading in software systems can be used to reduce the costs of remote requests by switching threads when the current thread blocks. We added multi-threading to the CVM software DSM and evaluated its impact on performance for a suite of common shared memory programs. Multi-threading resulted in speed improvements of at least 17% in three of the seven applications in our suite, and lesser improvements in the other applications. However, we found that: good performance is not always achievable transparently for non-trivial applications; multi-threading can negatively interact with DSM operations; multi-threading decreases cache and TLB locality; and any multi-threading speedup is dependent on available work.
A New Design Cost Model For The 2001 Itrs
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

For four decades, the semiconductor industry has distinguished itself by the rapid pace of improvement in its products. The principal categories of improvement trends are shown in Table A with examples of each. Most of these trends have resulted principally from the industry's ability to exponentially decrease the minimum feature sizes used to fabricate integrated circuits. Of course, the most frequently cited trend is in integration level, which is usually expressed as Moore's Law ("the number of components per chip doubles every 18 months"). The most significant trend for society is the decreasing cost-per-function, which has led to significant improvements of productivity and quality of life through proliferation of computers, electronic communication, and consumer electronics.