ppxscal/embedding_network huggingface dataset:
Blind identification of colored signals distorted by FIR channels
Authors: Y. Hua
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper presents a new approach for blind identification of multiple colored stationary/nonstationary signals distorted by unknown FIR channels. The key idea of this approach is to use a bank of decorrelators to transform a multiple-input and multiple output system (driven by the desired signals) into a bank of single-input and single-output systems. This approach is referred to as BID, i.e., blind identification via decorrelation. The BID approach can uniquely (up to a permutation and scaling) identify the signals if (a) the signals are mutually uncorrelated and of distinct power spectra, and (b) each column of the system function is a coprime polynomial vector. No other method known to date can uniquely identify the signals under the above condition. The BID approach achieves the optimal identifiability potential predicted by Hua and Tugnait.
A Regression-Based Analytic Model for Dynamic Resource Provisioning of Multi-Tier Applications
Authors: Qi Zhang, Ludmila Cherkasova, Evgenia Smirni
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

The multi-tier implementation has become the industry standard for developing scalable client-server enterprise applications. Since these applications are performance sensitive, effective models for dynamic resource provisioning and for delivering quality of service to these applications become critical. Workloads in such environments are characterized by client sessions of interdependent requests with changing transaction mix and load over time, making model adaptivity to the observed workload changes a critical requirement for model effectiveness. In this work, we apply a regression-based approximation of the CPU demand of client transactions on a given hardware. Then we use this approximation in an analytic model of a simple network of queues, each queue representing a tier, and show the approximation's effectiveness for modeling diverse workloads with a changing transaction mix over time. Using the TPCW benchmark and its three different transaction mixes we investigate factors that impact the efficiency and accuracy of the proposed performance prediction models. Experimental results show that this regression-based approach provides a simple and powerful solution for efficient capacity planning and resource provisioning of multi-tier applications under changing workload conditions.
A systematic approach for Failure Modes and Effects Analysis of System-On-Chips
Authors: R. Mariani, G. Boschi
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

This paper proposes a method to perform Failure Mode and Effects Analysis (FMEA) on System-On- Chips (SoC). An automatic tool extracts information from the SoC description and uses them to estimate the intrinsic criticality of invariant and elementary "sensitive zones" and to compute metrics such failure rates, safe failures fraction and diagnostic coverage. A validation flow based on fault injection and fault simulation is included to cross check the FMEA.
Formalising Flash Memory: First Steps
Authors: Andrew Butterfield, Jim Woodcock
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

We present first steps in the construction of formal models of NAND Flash memory, based on a recently emerged open standard for such devices. The model is at a level of abstraction that captures the internal architecture of such a device, as well as the commands that are used to operate it. The model is intended as a key step in a plan to develop a verified filestore system, by providing a description of the hardware devices that would be used in it implementation.
A caching model of operating system kernel functionality
Authors: David R. Cheriton, Kenneth J. Duda
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

Operating system research has endeavored to develop micro-kernels that provide modularity, reliability and security improvements over conventional monolithic kernels. However, the resulting kernels have been slower, larger and more error-prone than desired. These efforts have also failed to provide sufficient application control of resource management required by sophisticated applications. This paper describes a caching model of operating system functionality as implemented in the Cache Kernel, the supervisor-mode component of the V++ operating system. The Cache Kernel caches operating system objects such as threads and address spaces just as conventional hardware caches memory data. User-mode application kernels handle the loading and writeback of these objects, implementing application-specific management policies and mechanisms. Experience with implementing the Cache Kernel and measurements of its performance on a multiprocessor suggest that the caching model can provide competitive performance with conventional monolithic operating systems, yet provides application-level control of system resources, better modularity, better scalability, smaller size and a basis for fault containment.
Compact hardware design of Whirlpool hashing core
Authors: Timo Alho, Panu Hämäläinen, Marko Hännikäinen, Timo D. Hämäläinen
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Weaknesses have recently been found in the widely used cryptographic hash functions SHA-1 and MD5. A potential alternative for these algorithms is the Whirlpool hash function, which has been standardized by ISO/IEC and evaluated in the European research project NESSIE. In this paper we present a Whirlpool hashing hardware core suited for devices in which low cost is desired. The core constitutes of a novel 8-bit architecture that allows compact realizations of the algorithm. In the Xilinx Virtex-II Pro XC2VP40 FPGA, our implementation consumes 376 slices and achieves the throughput of 81.5 Mbit/s. The resource utilization of our design is one fourth of the smallest Whirlpool implementation presented to date.
A Parallel Program Tuning Environment
Authors: Gary J. Nutt
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

A parallel program tuning environment is descibed to assist shared memory application programmers. The tools rely on a spectrum of underlying support and analysis tools.
Facilitating focused internet measurements
Authors: Zhihua Wen, Sipat Triukose, Michael Rabinovich
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

This paper describes our implementation of and initial experiences with DipZoom (for "Deep Internet Performance Zoom"), a novel approach to provide focused, on-demand Internet measurements. Unlike existing approaches that face a difficult challenge of building a measurement platform with sufficiently diverse measurements and measuring hosts, DipZoom implements a matchmaking service instead, which uses P2P concepts to bring together experimenters in need of measurements with external measurement providers. DipZoom offers the following two main contributions. First,since it is just a facilitator for an open community of participants, it promises unprecedented availability of diverse measurements and measuring points. Second, it can be used as a veneer over existing measurement platforms, automating the planning and execution of complex measurements.
Efficient Simulation of Large-Scale P2P Networks: Modeling Network Transmission Times
Authors: Gerald Kunzmann, Robert Nagel, Tobias Hossfeld, Andreas Binzenhofer, Kolja Eger
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

The ongoing process of globalization leads to a huge demand for highly scalable applications that are able to deal with millions of participants distributed all over the world. Peer-to-Peer (p2p) technology enables an arbitrary large number of users to participate in distributed services like content distribution or collaboration tools. In order to verify a new protocol's performance and scalability simulation is a commonly used tool. First, predicting the network and peer behavior in the real world is only feasible if the simulation, i.e. all applied models as well as the peer state, is as realistic as possible. Second, many properties of the system only become observable when the number of participants is sufficiently large. Therefore, verifying the scalability of a system requires simulating huge worldwide networks. Due to limited processing power, central memory and availabe time, both requirements can only be fullfilled if the applied models are very efficient. In this paper we take a closer look at the network layer. We compare the most commonly-used network models and present a very efficient model for applying real-world network transmission times in large scale simulations.
A Case Study-based Performance Evaluation Framework for CSCF Processes on a Blade-Server
Authors: Preetam Ghosh, Nirmalya Roy, Kalyan Basu, Sajal Das, Paul Wilson, Prabir Das
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The study of protocol behavior and traffic characteristics in a simulated environment is commonly supported by ad-hoc or general purpose simulators (e.g., Opnet, NS-2). But as the complexity of the network to be simulated grows, eventdriven simulation could become the bottleneck of any performance analysis. Here, we propose an analytical technique for a real system performance evaluation of the Proxy(P)-CSCF and Serving(S)- CSCF components of an IMS network on a dual processor blade server. Based on this approach, we derive a specific model which can be applied to different network scenarios for performance evaluation and system engineering purposes. In particular, we study the optimal allocation of the traffic load in a bladeserver generated by the CSCF processes to predict the maximum system capacity. The results indicate that our methodology (a) is effective in maximizing the blade utilization (b) points toward the benefits of hyper-threading and identifies the appropriate scheduling discipline at the local linux schedulers and (c) provides a quantification of the optimal number of blades required to serve a predefined P/S-CSCF process arrival rate.
Parallel Downloading Using Variable Length Blocks for Proxy Servers
Authors: Atsushi Kawano, Junichi Funasaka, Kenji Ishida
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

The parallel downloading is one of the technologies which fetch a file at high speed. This technology retrieves each divided piece from a different server in parallel. On the other hand, we have proposed a proxy server which distributes the most recent files. As the technology that combines those, we have proposed a proxy server which gets the most recent files at high speed by using the parallel downloading technology. When this proxy server retrieves pieces, it must buffer them because of unordered arrivals so that it can provide a client with them in order. After that, the pieces are reordered and sent to a client. However, this proxy server has the problem that the buffer might become too big. We proposed in our previous study a substitution download method which alleviate the buffer growth, while it generates redundant traffic in some cases because of asynchronous retrieval of fixed sized blocks. In order to solve the problem, we propose a parallel downloading method for proxy servers using variable length blocks. The block size is determined dynamically according to the network condition so that the occupied buffer space shrinks. In this paper, we compare the proposed parallel downloading using variable length blocks to the existing method using fixed length blocks by simulation experiments. As a result, it is confirmed that our proposal reduces the redundant traffic and the buffer size required for proxy systems compared to the existing method without degrading the download time. This proposal which absorbs the difference in performance among servers is one of the key technologies for network assurance.
Data Hiding based Compression Mechanism for 3D Models
Authors: Hui Li, Parag Agarwal, Balakrishnan Prabhakaran
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Different compression methods [2] such as progressive meshes and single refinement mesh compression exist for mesh representation for 3D models and improving them is a challenge. This paper is a step in this direction, where we show that data hiding methods can be used to significantly improve the compression achieved for such methods. 3D meshes are made up of connectivity (edge set E) and geometric (vertices set V) information.
A note on the Harris-Kesten Theorem
Authors: Béla Bollobás, Oliver Riordan
Venue: European Journal of Combinatorics (2007)

A short proof of the Harris-Kesten result that the critical probability for bond percolation in the planar square lattice is 1/2 was given in [B. Bollobas, O.M. Riordan, A short proof of the Harris-Kesten Theorem, Bull. London Math. Soc. 38 (2006) 470-484], using a sharp-threshold result of Friedgut and Kalai. Here we point out that a key part of this proof may be replaced by an argument of Russo [L. Russo, An approximate zero-one law, Z. Wahrscheinlichkeitstheor. Verwandte Geb. 61 (1982) 129-139] from 1982, using his approximate zero-one law in place of the Friedgut-Kalai result. Russo's paper gave a new proof of the Harris-Kesten Theorem that seems to have received little attention.
2007 Special Issue: A variational EM approach to predictive uncertainty
Authors: Markus Harva
Venue: Neural Networks (2007)

In many applications of regression, the conditional average of the target variable is not sufficient for prediction. The dependencies between the explanatory variables and the target variable can be complex calling for modelling of the full conditional probability density. The ubiquitous problem with such methods is overfitting since due to the flexibility of the model the likelihood of any datapoint can be made arbitrarily large. In this paper a method for predicting uncertainty by modelling the conditional density is presented based on conditioning the scale parameter of the noise process on the explanatory variables. The model is constructed in such a manner that the unpredictability of the scale of the target distribution translates into a more robust predictive distribution. The overfitting problems are solved by learning the model using variational EM. The method is experimentally demonstrated with synthetic data as well as with real-world environmental data. The viability of the approach was put to test in the 'Predictive uncertainty in environmental modelling' competition held at WCCI'06. The proposed method won the competition.
Kernelizing PLS, degrees of freedom, and efficient model selection
Authors: Nicole Krämer, Mikio L. Braun
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Kernelizing partial least squares (PLS), an algorithm which has been particularly popular in chemometrics, leads to kernel PLS which has several interesting properties, including a sub-cubic runtime for learning, and an iterative construction of directions which are relevant for predicting the outputs. We show that the kernelization of PLS introduces interesting properties not found in ordinary PLS, giving novel insights into the workings of kernel PLS and the connections to kernel ridge regression and conjugate gradient descent methods. Furthermore, we show how to correctly define the degrees of freedom for kernel PLS and how to efficiently compute an unbiased estimate. Finally, we address the practical problem of model selection. We demonstrate how to use the degrees of freedom estimate to perform effective model selection, and discuss how to implement crossvalidation schemes efficiently.
Improving Performance of Chemical Autonomic Information Diffusion Protocol
Authors: Navid Ghazisaidi, Ali Ghazisaeidi
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

The information diffusion protocol represents a prototype for transferring the information from the source to its destination. The Chemical Information Diffusion (CID) protocol is a type of information diffusion method used in the autonomic networks. In this protocol, network resembles a glass of the water and nodes work as molecules of it. The goal of this research is to apply a special novel algorithm on CID protocol to improve the performance of it. This paper describes a special non-uniform algorithm for improving the performance of the original CID protocol. This paper also briefly describes some other spreading algorithms and compares the behavior of them and proposed non-uniform algorithm on the original CID protocol. In addition it shows the reason and the power of improving the CID protocol when it uses proposed non-uniform algorithm.
A Survey of Location Privacy and an Approach for Solitary Users
Authors: Calvert L. Bowen,  III, Thomas L. Martin
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Location-Based Systems (LBS) continue to grow in popularity as applications are developed to use an estimate of a user's location. Location estimates can be created using a variety of information including true location sources and network information. Regardless of the source or type of location information, aggregating all available information may produce a more accurate estimate of a user's location. A user cannot manage the use of his location and network information once it has been sent to the LBS, and must assume that an observer has access to this information and can use it to estimate the user's location. Anyone with access to this information can use the same algorithm to estimate the user's location. This creates an issue of location privacy that must be addressed. This survey frames the problem of location privacy through related work and presents an alternate approach to preserving a user's privacy for consideration.
Inter-Domain QoS Control Mechanism in IMS based Horizontally Converged Networks
Authors: Mehdi Mani, Noel Crespi
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

IP Multimedia Subsystem standardized by 3GPP has attracted the endorsement of other network technology providers. IMS is the most complete IP-based service control and management overlay (using SIP) that sets up an overlay on the under-laying transport infrastructure and provides the possibility of end to end IP based services. Adopting IMS as the service control overlay in different technologies like WLAN, xDSL and Cable allows their operators to share their infrastructure with 3G wireless networks not only in transport level but also in service level. This convergence which is called Horizontal Convergence is sought in NGN-Next Generation Network architecture. Provisioning end-to-end QoS in such heterogeneous paradigms is a challenging task according to the different strategies of resource reservation over different technologies. In this paper we have defined new architecture to resolve some of the existing problems existing in IMS Policy based QoS control model that don't let end-to-end QoS control between different technologies and domains.
Impact of the execution context on Grid job performances
Authors: Tristan Glatard, Diane Lingrand, Johan Montagnat, Michel Riveill
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

In this paper, we examine how the execution context of grid jobs can help to refine submission strategies on a production grid. On this kind of infrastructure, the latency highly impacts performances. We present experiments that quantify the dependencies between the grid latency and both internal and external context parameters on the EGEE grid infrastructure. We show how job submission managers, job execution sites and the submission date can be statistically correlated to grid performances.
Maximum likelihood estimates for exponential type density families
Authors: S. Basu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We consider a parametric family of density functions of the type exp(-|x|/sup /spl alpha//2/) for modeling acoustic feature vectors used in automatic recognition of speech. The parameter /spl alpha/ is a measure of the impulsiveness as well as the nongaussian nature of the data. While previous work has focused on estimating the mean and the variance of the data here we attempt to estimate the impulsiveness /spl alpha/ from the data on a maximum likelihood basis. We show that there is a balance between /spl alpha/ and the number of data points N that must be satisfied before maximum likelihood estimation is carried out. Numerical experiments are performed on multidimensional vectors obtained from speech data.
Evolutionary diffusion optimization. II. Performance assessment
Authors: Wenjiang Pei, Jiming Liu
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

A new population-based stochastic search algorithm called evolutionary diffusion optimization (EDO) inspired by diffusion in nature has been proposed. This article compares the performance of EDO with simulated annealing and fast evolutionary programming. Experimental results show that EDO performs better than SA and FEP in some cases.
Asynchronous Agreement and Its Relation with Error-Correcting Codes
Authors: Roy Friedman, Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal
Venue: IEEE Transactions on Computers (2007)

The condition-based approach identifies sets of input vectors, called conditions, for which it is possible to design an asynchronous protocol solving a distributed problem despite process crashes. This paper establishes a direct correlation between distributed agreement problems and error-correcting codes. In particular, crash failures in distributed agreement problems correspond to erasure failures in error-correcting codes and Byzantine and value domain faults correspond to corruption errors. This correlation is exemplified by concentrating on two well-known agreement problems, namely, consensus and interactive consistency, in the context of the condition-based approach. Specifically, the paper presents the following results: First, it shows that the conditions that allow interactive consistency to be solved despite f_{c} crashes and f_{e} value domain faults correspond exactly to the set of error-correcting codes capable of recovering from f_{c} erasures and f_{e} corruptions. Second, the paper proves that consensus can be solved despite f_{c} crash failures iff the condition corresponds to a code whose Hamming distance is f_{c} + 1 and Byzantine consensus can be solved despite f_{b} Byzantine faults iff the Hamming distance of the code is 2f_{b} + 1. Finally, the paper uses the above relations to establish several results in distributed agreement that are derived from known results in error-correcting codes and vice versa.