ppxscal/embedding_network huggingface dataset:
Decentralized network algorithms
Authors: Bruce Hajek
Venue:  (2006)

An important characteristic of modern communication networks is their decentralized nature. Users in such networks may have to operate with limited information about the overall system. Also, they may have local objectives different from that of efficient system wide utilization. The focus of this dissertation is the design of algorithms that lead to good system performance in such scenarios. This work is divided into two parts. In the first part, we investigate three communication network scenarios where users act selfishly: the allocation of bandwidth on a single link to competing flows, the efficient provisioning of a public resource in the presence of free-riding users, and selfish routing in the presence of congestion-induced delays. For the bandwidth allocation problem, we develop a new mechanism that requests as bids the total amounts users are willing to pay. For two buyers this mechanism is shown to guarantee higher worst-case fractional efficiency, at Nash equilibria, than any other mechanism that interprets bids as total payments. For the public good problem, we design a class of novel mechanisms that ensure efficient production at Nash equilibria. For the routing problem we bound the inefficiency of Nash equilibria as a function of the number of users. In the second part of this dissertation we investigate the problem of disseminating a large file to a large network of users. The file is divided into pieces, and different pieces are initially uploaded to different users. The users then exchange pieces to complete their individual collections. In such networks, a crucial task is piece selection: users must decide which piece to request from their neighbors based only on local information. We characterize the performance of several piece selection algorithms, and also develop algorithms that ensure efficient dissemination of all pieces to all users.
A novel decision grid theory for dynamic decision making
Authors: Yingxu Wang
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

A decision is a preferred option or a course of actions chosen from among a set of alternatives based on certain criteria. Decision theories have been focused on static and single decision making techniques. However, a wide range of problems and real-world challenges require serial decision making methodologies and a theoretical framework. This paper introduces a new decision and operation theory, known as the decision grid, for modeling and supporting dynamic and serial decision making. The mathematical model of decision grid is introduced and the properties of decision grids are rigorously described. The formal treatment of serial decision makings with limited or unlimited trails are modeled by decision grids. Decision grids can be applied in a wide range of serial and dynamic decision making situations in management science, operation studies, cognitive science, sociology, economy, software engineering, systems engineering, political science, statistics, as well as everyday lives.
Balanced Distributed Memory Parallel Computers
Authors: F. Cappello, J-L Bechennec, F. Delaplace, C. Germain, J-L Giavitto, V. Neri, D. Etiemble
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Mismatches between on-chip high performance CPU and data access times is the basic reason for the increasing gap between peak and sustained performance in distributed memory parallel computers. We propose the concept of balanced architectures, based on a network with a dynamic topology and communication patterns determined at compile time. The corresponding processing element is a cacheless CPU, which can achieve a 1 FLOP/clock cycle rate. Network and PE features are presented. An example shows that balanced architectures keep efficiency when scaling.
Greedy Beta-Skeleton in Three Dimensions
Authors: Hisamoto Hiyoshi
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

In two dimensions, the \beta-skeleton is one of the most practical methods for reconstructing smooth curves from a given unorganized point set because of its provable guarantee. In three dimensions, however, the \beta-skeleton cannot be used for surface reconstruction because it may contain unwanted holes omnipresently, no matter how high sampling density is. To overcome this difficulty, an extension of the \beta-skeleton, called greedy \beta-skeleton, is proposed. It is shown by computational experiments that the unwanted holes do not appear in the greedy \beta-skeleton even when the dimension is three. In addition, the greedy \beta-skeletons are computed for several practical inputs, and their fairness is examined. Computation results for some variants of the greedy \beta-skeleton are also reported.
Graphics programming in icon version 9
Authors: Clinton L. Jeffery, Ralph E. Griswold, Gregg M. Townsend
Venue: Proceedings of the USENIX 1994 Very High Level Languages Symposium Proceedings on USENIX 1994 Very High Level Languages Symposium Proceedings (1994)

Version 9 of the Icon programming language introduces support for graphics and user interface programming as an extension of the existing file-based input/output model, rather than introducing graphics as a disjoint facility. Simplicity, generality, and portability are the primary emphases. The result is a language in which common graphic effects are easy to write using ordinary procedural code. Complex techniques such as event-driven programming are optional and not forced on the programmer when they are not needed.
Tuning branch predictors to support virtual method invocation in java
Authors: N. Vijaykrishnan, N. Ranganathan
Venue: Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5 (1999)

Java's object oriented nature along with its distributed nature make it a good choice for network computing. The use of virtual methods associated with Java's object oriented behavior requires accurate target prediction for indirect branches. This is critical to the performance of Java applications executed on deeply pipelined, wide issue processors. In this paper, we investigate the use of a path history based predictor to accurately determine the target of these virtual methods. The effect of varying the various parameters of the predictor on the misprediction rates is studied using various Java benchmarks. Results from this study show that the execution of Java code will benefit from more sophisticated branch-predictors.
Multi-step linear predictors-based blind equalization of multiple-input multiple-output channels
Authors: J. K. Tugnait
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Blind equalization of MIMO (multiple-input multiple-output) communications channels is considered using primarily the second-order statistics of the data. In several applications the underlying equivalent discrete-time mathematical model is that of a MIMO linear system where the number of inputs equals the number of users (sources) and the number of outputs is related to the number of sensors and the sampling rate. Previously we investigated the structure of multi-step linear predictors for IIR/FIR MIMO systems with irreducible transfer functions and derived an upper bound on its length (Tugnait 1998). In the past multi-step linear predictors have been considered in the literature only for single-input multiple-output models. In this paper we apply the results of Tugnait (1998) for blind equalization of MIMO channels using MMSE linear equalizers. Extensions to the case where the "subchannel" transfer functions have common zeros/factors is also investigated. An illustrative simulation example is provided.
Performance evaluation and comparison of ITU-T/ETSI voice activity detectors
Authors: F. Beritelli
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The paper proposes a performance evaluation and comparison of recent ITU-T and ETSI voice activity detection algorithms. The comparison was made using both objective and psychoacoustic parameters, so as to have reliable judgements that were close to subjective ones. A highly varied speech database was also set up to evaluate the extent to which VAD depend on language, the signal to noise ratio, or the power level.
DSP application in e-commerce security
Authors: Jiankun Hu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This is a case study on using a DSP board to construct an encryption/decryption module embedded in a e-commerce Web server. The idea of using DSP is to push beyond the key length limits of encryption/decryption algorithms and computational power in a software environment while avoiding the heavy investment in a dedicated hardware encryptor/encryptor. The low cost, high computational power, high flexibility of DSP and the ubiquitous availability of a PC peripheral component interconnect slot for the DSP can provide any Web browser or Web server an excellent cost-effective option to improve the security level of Internet applications. The paper provides a step-by-step procedure and reveals every detail of a successful implementation of a DSP RSA encryptor/decryptor for an e-commerce Web server by using the latest TMS320C6000/sup TM/ Evaluation Module (EVM) DSP hardware. A strong prime concept and Garner algorithm are introduced to generate more secure keys and compute encryption/decryption more efficiently than that of recent publications. Experiments show that the performance of using DSP hardware encryption can be 300 times faster than that in software environment.
Accelerating Soft Error Rate Testing Through Pattern Selection
Authors: Alodeep Sanyal, Kunal Ganeshpure, Sandip Kundu
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

In this paper we propose a technique for increasing the rate of failure due to soft errors by carefully choosing the patterns for soft-error detection. It is well known that all circuit nodes are not equally vulnerable to soft error. We propose a metric for measuring vulnerability of a node to soft-error. The pattern selection approach constructs a test set to maximize the node vulnerability metric. In order to facilitate scan based application of these tests, we propose a test-per-clock DFT scheme that allows counting of such errors. The test set thus derived is applied repeatedly to accelerate the soft error rate measurement. Acceleration reported for this technique over random pattern testing on ISCAS-85 benchmarks ranges from 5X to infinity.
A Convolution Algorithm for Evaluating Supply Chain Delivery Performance
Authors: Alfred L. Guiffrida, Robert A. Rzepka, Mohamad Y. Jaber
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The effective management of a supply chain requires performance measures that accurately represent the underlying structure of the supply chain. Measures such as delivery performance to the final customer often require summing a set of random variables that capture the stochastic nature of activities across the various stages of the supply chain. The convolution calculus required to evaluate these measures is complex and often leads to intractable results. In this paper we present a discrete convolution algorithm that simplifies this evaluation. The algorithm is demonstrated for a delivery performance measure in a three stage serial supply chain. Numerical results and a supporting error analysis are presented for a set of experiments utilizing reproductive and nonreproductive probability density functions.
Computing in Bioinformatics and Computational Biology: A Collection
Authors: Milan Lathia
Venue: IEEE Distributed Systems Online (2007)

A review of "Parallel Computing for Bioinformatics and Computational Biology: Models, Enabling Technologies, and Case Studies," Albert Y. Zomaya, ed.
Mixed-domain coding of speech at 3 kb/s
Authors: J. C. De Martin, A. Gersho
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We present a speech coding algorithm called mixed-domain residual coding (MDRC) wherein a prototype pitch cycle in each frame of the speech residual is coded in the time-domain while interpolation of the residual signal is performed in the frequency-domain. A novel quantization scheme takes into account time scaling and differentially codes successive prototypes with a closed-loop perceptually-weighted search. A fixed-rate (3.15 kb/s) implementation of MDRC achieves quality better or comparable to higher rate coders such as FS 1016 CELP and IMBE.
Automated wrapping of a C++ class library into Tcl
Authors: Ken Martin
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

In this paper we describe an approach to wrapping a preexisting C++ class library into the interpreted Tcl environment. Specifically, we look at our efforts over the past two years to add the Tcl interpreted environment on top of the Visualization Toolkit which consists of over three hundred C++ classes. We address how we over-came the fundamental issues involved in wrapping existing C++ code and what limitations we had to accept. We contrast our approach to other Tcl object oriented extensions such as Object Tcl and [incr Tcl] and explain why they were not suitable. We conclude by looking at future directions for our work.
Modelling and Optimisation of a Traffic Intersection Based on Queue Theory and Markov Decision Control Methods
Authors: Azura Che Soh, Mohammad Hamiruce Marhaban, Marzuki Khalid, Rubiyah Yusof
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Traffic models play an important role in both today's traffic research and in many traffic applications such as traffic flow prediction, incident detection and traffic control. Modelling traffic dynamics and optimising the control signal are two interrelated problems. Modelling provides fundamental understanding of traffic dynamics and behaviour. In this paper, traffic signal is modelled as a M/M/1 queueing theory. The validation of a simulation model (M/M/1 queue) with different arrival rates is presented. From the result, a traffic light model was developed by applying M/M/1 queue theory for single intersection. In the optimisation strategy, the Markov decision control is applied to minimize queue length and waiting time. Simulation results show the excellent potential of this approach.
Service placement in a shared wide-area platform
Authors: David Oppenheimer, Brent Chun, David Patterson, Alex C. Snoeren, Amin Vahdat
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Emerging federated computing environments offer attractive platforms to test and deploy global-scale distributed applications. When nodes in these platforms are timeshared among competing applications, available resources vary across nodes and over time. Thus, one open architectural question in such systems is how to map applications to available nodes--that is, how to discover and select resources. Using a six-month trace of PlanetLab resource utilization data and of resource demands from three long-running PlanetLab services, we quantitatively characterize resource availability and application usage behavior across nodes and over time, and investigate the potential to mitigate the application impact of resource variability through intelligent service placement and migration. We find that usage of CPU and network resources is heavy and highly variable. We argue that this variability calls for intelligently mapping applications to available nodes. Further, we find that node placement decisions can become ill-suited after about 30 minutes, suggesting that some applications can benefit from migration at that timescale, and that placement and migration decisions can be safely based on data collected at roughly that timescale. We find that inter-node latency is stable and is a good predictor of available bandwidth; this observation argues for collecting latency data at relatively coarse timescales and bandwidth data at even coarser timescales, using the former to predict the latter between measurements. Finally, we find that although the utilization of a particular resource on a particular node is a good predictor of that node's utilization of that resource in the near future, there do not exist correlations to support predicting one resource's availability based on availability of other resources on the same node at the same time, on availability of the same resource on other nodes at the same site, or on time-series forecasts that assume a daily or weekly regression to the mean.
Analysis of Functional Magnetic Resonance Imaging in Python
Authors: K. Jarrod Millman, Matthew Brett
Venue: Computing in Science and Engineering (2007)

The authors describe a package for analyzing magnetic resonance imaging (MRI) and functional MRI (fMRI) data, which is part of the Neuroimaging in Python (NIPY) project. An international group of leading statisticians, physicists, programmers, and neuroimaging methodologists are developing NIPY for wider use.
Inside Architecture Evaluation: Analysis and Representation of Optimization Potential
Authors: Bastian Florentz
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

The share of software in embedded systems has been growing permanently in the recent years. Thus, software architecture as well as its evaluation has become an important part of embedded systems design to define, assess, and assure architecture and system quality. Furthermore, design space exploration can be based on architecture evaluation. To achieve an efficient exploration process, architectural decisions need to be well considered. In this paper, analysis of architecture evaluation is performed to uncover dependencies of the quality attributes which are the first class citizens of architecture evaluation. With an explicit representation of such dependencies, valuable changes of an architecture can be calculated. Next to the exploration support, the analysis results help to document architecture knowledge and make architectural decisions explicit and traceable. The development process can now be based on dependable and well documented architectural decisions. Effects of changes become more predictable. Time and costs can be saved by avoiding suboptimal changes.
Toward an analytical approach for effective Web site design: A framework for modeling, evaluation and enhancement
Authors: Benjamin Yen, Paul Jen-Hwa Hu, May Wang
Venue: Electronic Commerce Research and Applications (2007)

Effective website design is critical to the success of electronic commerce and digital government. We consider website designs as structural problems and propose a conceptual framework for classifying different design scenarios into generic categories. We describe each generic design category using objective and constraints, and map it to a specific graph model analyzable or solvable analytically. By modeling website designs using well-defined structures and established analytical methods, our framework allows systematic and quantitative design evaluations and improvements. The proposed framework can complement existing practices by enhancing the design process and quality with increasing ease of analysis, implementation and continuous improvement.
Markovian traffic equilibrium
Authors: J.-B. Baillon, R. Cominetti
Venue: Mathematical Programming: Series A and B (2007)

We analyze an equilibrium model for traffic networks based on stochastic dynamic programming. In this model passengers move towards their destinations by a sequential process of arc selection based on a discrete choice model at every intermediate node in their trip. Route selection is the outcome of this sequential process while network flows correspond to the invariant measures of the underlying Markov chains. The approach may handle different discrete choice models at every node, including the possibility of mixing deterministic and stochastic distribution rules. It can also be used over a multi-modal network in order to model the simultaneous selection of mode and route, as well as to treat the case of elastic demands. We establish the existence of a unique equilibrium, which is characterized as the solution of an unconstrained strictly convex minimization problem of low dimension. We report some numerical experiences comparing the performance of the method of successive averages (MSA) and Newton&#x2019;s method on one small and one large network, providing a formal convergence proof for MSA.
Supporting mobility in MosquitoNet
Authors: Mary G. Baker, Xinhua Zhao, Stuart Cheshire, Jonathan Stone
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

The goal of the MosquitoNet project is to provide continuous Internet connectivity to mobile hosts. Mobile hosts must be able to take advantage of the best network connectivity available in any location, whether wired or wireless. We have implemented a mobile IP system that supports seamless switching between different networks and communication devices. In contrast to previous approaches to mobile IP, we believe mobile hosts should not assume any explicit mobility support from the networks they visit, aside from basic Internet connectivity. This decision places extra responsibilities on the mobile hosts themselves. In this paper, we describe the design and implications of such a system. Measurements of our implementation show that the inherent overhead to switch networks (below 10ms) is insignificant compared to the time required to bring up a new communication device.
Estimation of missing LSF parameters using Gaussian mixture models
Authors: R. Martin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Speech transmission over packet networks has to cope with packet delays and packet losses. When a packet loss occurs the missing information must be estimated. We focus on restoring the spectral parameters of a speech coder. A novel approach to estimating missing line spectral frequency (LSF) parameters using Gaussian mixture models (GMM) is proposed. We present the estimation algorithm and study its performance when one or several LSF parameters are lost. We show that a GMM of a relatively low order is sufficient to achieve a substantial improvement in the parameter SNR. Therefore, the new estimation procedure requires much less memory than histogram based estimation methods.
Protecting TCP from a misbehaving receiver
Authors: Rung-Shiang Cheng, Hui-Tang Lin
Venue: International Journal of Network Management (2007)

This study presents the design and implementation of a robust TCP congestion control algorithm. TCP was originally designed for cooperative environments, and its evolution over the years has been built on the same basis. TCP expects the end hosts to cooperate with the TCP senders in implementing end-to-end congestion control. Therefore, misbehavior of a TCP receiver may result in an unfair division of the available bandwidth between the conforming flows and the irresponsible flows. Accordingly, this study examines the issues arising when conforming TCP connections are obliged to coexist with misbehaving connections. A modification to the TCP protocol is proposed to deal with various types of TCP misbehavior.