ppxscal/embedding_network huggingface dataset:
Designing an optimized enterprise windows NT/95/98 client backup solution with intelligent data management
Authors: Kevin M. Workman, Earl Waud, Steven Downs, Mikel Featherstone
Venue: Proceedings of the 1998 Conference on Large Installation System Administration of Windows NT (1998)

Recent times have seen a vast increase in the number of PC's deployed on company networks, as well as a significant increase in the drive space attached to those machines. This situation presents a growing problem for those responsible for both maintaining corporate networks and insuring the integrity and safety of corporate data. The increase in the enterprise data set translates to an increase in the amount of data on the wire, as it is sent over the network to be archived, as well as an increase in the amount of tape media that must be used to protect the data. Faced with an ever-increasing amount of data to support, it is becoming necessary to discover a means to identify business critical data, so that only the necessary files are committed to long-term storage. At the same time, the non-critical data must also be tracked, so that machines can be fully recovered in case of machine failure. In this paper we will discuss the concept behind our system of intelligently managing redundant and unneeded information in the enterprise. Our method employs a rule system that allows us to reduce or eliminate the redundant and useless information that we backup while still providing quick restore times in the event of data loss.
Adaptive overload control for busy internet servers
Authors: Matt Welsh, David Culler
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

As Internet services become more popular and pervasive, a critical problem that arises is managing the performance of services under extreme overload. This paper presents a set of techniques for managing overload in complex, dynamic Internet services. These techniques are based on an adaptive admission control mechanism that attempts to bound the 90th-percentile response time of requests flowing through the service. This is accomplished by internally monitoring the performance of the service, which is decomposed into a set of event-driven stages connected with request queues. By controlling the rate at which each stage admits requests, the service can perform focused overload management, for example, by filtering only those requests that lead to resource bottlenecks. We present two extensions of this basic controller that provide class-based service differentiation as well as application-specific service degradation. We evaluate these mechanisms using a complex Web-based e-mail service that is subjected to a realistic user load, as well as a simpler Web server benchmark.
A local-field extrapolation algorithm for improving the spatial resolution in magnetic resonance dynamic imaging
Authors: A. S. Fahmy
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In magnetic resonance imaging (MRI), data are collected as spectrum samples. The acquisition time is proportional to the number of the spectrum lines. Therefore, only few lines of the data space may be required in order to track rapid changes of an object. In the current techniques, the missed lines may be zeroed or replaced by the corresponding lines in a reference image, which is acquired a priori for the same anatomical cross-section. However, this always comes at the expense of the spatial-resolution. In this study, we propose an extrapolation iterative algorithm to provide an improved estimate of the missed lines. Additional spatial and spatial-frequency constraints of the reference image are incorporated to enhance the convergence and obtain a better estimate of the initial conditions of the iterations. Results from simulated data verify the theory and indicate that the algorithm may provide better reconstruction in dynamic imaging studies.
A Configurable Asynchronous Pseudorandom Bit Sequence Generator
Authors: Alex Chow, William S. Coates, David Hopkins
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

We present a method of building pseudorandom bit sequence (PRBS) generators using coupled asynchronous FIFO rings. A traditional PRBS generator using a linear feedback shift register (LFSR) can only generate a single maximal-length pattern with a fixed period. Our proposed FIFO implementation allows a single circuit to produce many different patterns of dfferentperiods, all of which are maximal- length,based on the initialization of the circuit. It also provides intrinsic fine-grain pipelining which alleviates the large feedback logic overhead in configurations with many taps, making such implementations practical. With an asynchronous-to-clochd inteifiuce, one can use the circuit in a synchronous environment. Detailed simulation results are presented.
Performance Diagnosis for Changing Workloads
Authors: Darcy G. Benoit
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

A key issue in the performance of computer programs is the allocation of resources within the program itself. Complex relationships between program resources, coupled with the demands that these resources make on the underlying hardware and operating system, make tuning many software systems a difficult task. As time progresses, system workloads often change, resulting in reduced performance and the need to retune the system. In this paper, we overview an automatic diagnosis framework designed to determine the cause of performance and resource problems. We present our results demonstrating the ability to correctly identify system bottlenecks in a complex software system. We also show that the system is able to handle changes in workload.
Speaker background models for connected digit password speaker verification
Authors: A. E. Rosenberg
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Likelihood ratio or cohort normalized scoring has been shown to be effective for improving the performance of speaker verification systems. An important problem in this connection is the establishment of principles for constructing speaker background or cohort models which provide the most effective normalized scores. Several kinds of speaker background models are studied. These include individual speaker models, models constructed from the pooled utterances of different numbers of speakers, models selected on the basis of similarity with customer models, models constructed from random selections of speakers, and models constructed from databases recorded under different conditions than the customer models. The results of experiments show that pooled models based on similarity to the reference speaker perform better than individual cohort models from the same similar set of speakers. Pooled background models from a small number of speakers based on similarity perform about the best, but not significantly better than a random selection of 40 or more gender balanced speakers with training conditions matched to the reference speakers.
Enhancing the Security of Local DangerWarnings in VANETs - A Simulative Analysis of Voting Schemes
Authors: Benedikt Ostermaier, Florian Dotzer, Markus Strassberger
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The upcoming deployment of vehicular ad-hoc networks does not only facilitate novel telematics applications, but also poses strong requirements on security. Especially the adoption of active safety applications may raise new threats to road safety if security issues are not properly handled, thus thwarting their initial purpose. In this paper, a special active safety application is considered that enables cooperative foresighted driving through the exchange of local danger warnings, which are based on individual observations and refer to the current road condition. From a security point of view, the decision whether or not such an application should rely on a reported hazard, is a crucial issue, which cannot be completely protected by conventional security measures. We propose an additional security mechanism based on an information centric evaluation of the plausibility of received hazard messages. We developed four decision methods, which are based on voting schemes, and evaluated them by simulation using two attacks trying to manipulate the decision process by distributing false information. Our results indicate that the proposed information centric evaluation of remote observations is a reasonable means to increase the stability and security of a cooperative local danger warning service.
Variational iteration method for solving two-point boundary value problems
Authors: Junfeng Lu
Venue: Journal of Computational and Applied Mathematics (2007)

Variational iteration method is introduced to solve two-point boundary value problems. Numerical results demonstrate that the method is promising and may overcome the difficulty arising in Adomian decomposition method.
An Analytical Model of a BitTorrent Peer
Authors: Mario Barbera, Alfio Lombardo, Giovanni Schembra, Mirco Tribastone
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

In this paper we propose a Markovian model of BitTorrent. Unlike already developed works which capture demographic dynamics, it focuses on the behavior of individual peers. To this end, we center our attention on a generic peer, called tagged peer (TP); for each possible logical state of a BT peer-to-peer connection maintained by the TP, we consider a stochastic process which counts the number of such links, and characterize them according to their state. Validation is carried out and steady-state analysis is performed in order to illustrate how performance evaluation can be extracted from our model.
The methodological and technological dimensions of technology transfer for embedded systems in aeronautics and space
Authors: Thierry Pardessus, Heinrich Daembkes, Richard Arning
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This tutorial is in two parts, to elaborate the two pillars of technology transfer in the context of the aeronautics and space industry. The first part illustrates the methodological pillar, showing the state of the art in the industrial approaches to technology transfer. The second part illustrates the technological pillar, giving an overview of recent successes in technology transfer and emerging trends and opportunities, for both hardware and software. These two pillars are further mirrored in the two technical sessions.
Effect of employing beamforming on OFDM systems in Rician channel
Authors: M. Nakagawa, V. K. Dubey
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

We analyze the inter-carrier-interference (ICI) caused by multiple Rician path and Doppler spreading in orthogonal frequency division multiplexing (OFDM) systems. The general form for the ICI power is derived by taking into consideration the correlation equation of the Rician channel. We have derived a equation for estimating the frequency tracking parameter. We also present examples by using ideal beamforming at the mobile. For a multiple Rician channel, it shows that the reduction in ICI power is not as much as in the case of Rayleigh channel. However, in the presence of only one Rician path, the reduction in ICI power is marginally better than the Rayleigh channel.
Comparison of neural network natural and ordinary gradient algorithms for satellite down link identification
Authors: F. Langlet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

We present a neural network architecture that belongs to the multilayer perceptron family, associated with two different algorithms: the ordinary gradient and the natural gradient, we compare the performances of those algorithms. The identification of a non-normalized power amplifier yielded to the introduction of an additional weight in the classical multilayer perceptron structure. The application of this network is space telecommunications: identification of satellite communication channels, and especially the down link. This link is made up with two elements. The first one is a high power amplifier (non-linearity). The second one is a filter (memory).
Face Recognition Using Kernel PCA and Hierarchical RBF Network
Authors: Jin Zhou, Yang Liu, Yuehui Chen
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

This paper proposes a new face recognition approach by using Kernel Principal Component analysis (KPCA) and Hierarchical Radial Basis Function (HRBF) network classification model. To improve the quality of the face images, a series of image pre-processing techniques, which include histogram equalization, edge detection and geometrical transformation are used. The KPCA is employed to extract features for reducing the dimension of the face pattern, and the HRBF network is used to identify the faces. To accelerate the convergence of the HRBF network and improve the quality of the solutions, the Extended Compact Genetic Programming (ECGP) and Particle Swarm Optimization (PSO) is applied to optimize the HRBF network structure and parameters. The experimental results show that the proposed framework is efficient for face recognition.
Estimating Information Rates with Confidence Intervals in Neural Spike Trains
Authors: Jonathon Shlens, Matthew B. Kennel, Henry D. I. Abarbanel, E. J. Chichilnisky
Venue: Neural Computation (2007)

Information theory provides a natural set of statistics to quantify the amount of knowledge a neuron conveys about a stimulus. A related work (Kennel, Shlens, Abarbanel, & Chichilnisky, 2005) demonstrated how to reliably estimate, with a Bayesian confidence interval, the entropy rate from a discrete, observed time series. We extend this method to measure the rate of novel information that a neural spike train encodes about a stimulus---the average and specific mutual information rates. Our estimator makes few assumptions about the underlying neural dynamics, shows excellent performance in experimentally relevant regimes, and uniquely provides confidence intervals bounding the range of information rates compatible with the observed spike train. We validate this estimator with simulations of spike trains and highlight how stimulus parameters affect its convergence in bias and variance. Finally, we apply these ideas to a recording from a guinea pig retinal ganglion cell and compare results to a simple linear decoder.
Performance Analysis of Combining Multistage Interconnection Networks
Authors: Prasant Mohapatra, Sheldon Wong, Chita R. Das
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Concurrent access to a shared variable may cause network saturation in parallel computers. This problem, commonly termed as hot spot contention, can be alliviated by combining requests destined to the hot memory module. In this paper, we propose an analytical model to predict performance of combining multistage interconnection networks. The model considers realistic assumptions like finite length buffers in the switches, deterministic service time, finite degree of combining. Simulation results are used to validate the analytical model.
A textbook with two target audiences
Authors: Scott Davidson
Venue: IEEE Design Test (2007)

This is a review of VLSI Test Principles and Architectures (edited by Laung-Terng Wang, Cheng-Wen Wu, and Xiaoqing Wen), which is partly a textbook and partly a collection of survey articles on testing by top experts. The book's strengths include the practical aspects discussed, the good examples presented, and the depth of many of its chapters. The weaknesses include a lack of consistency of target audience across chapters and a lack of cohesiveness. Nearly everyone will get something out of this book, but prospective purchasers should review the topics of interest to see if the level is right for them.
Computer engineering technology-a new option
Authors: T. W. Schultz
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

A new curriculum option has been added to the EET (Electrical Engineering Technology) program with an emphasis on computers-CpET. This paper describes the rationale for initiating such an option and the lengthy process to establish the content and obtain approval. In addition to presenting the final curriculum, it discusses the impact the change has had on the regular EET program and suggests that a general increase in enrollment is due in part to the new option.
Use of online digital learning materials and digital libraries: comparison by discipline
Authors: Alan J. Wolf, Ellen R. Iverson, Cathryn Manduca, Flora McMartin, Glenda Morgan, Joshua Morrill
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

In this paper, we describe the results of a national survey of higher education faculty concerning their use of digital resources and collections of these resources. We explore the differences in resource use by discipline groups and suggest implications for development of discipline specific libraries and faculty development practices.
Vulnerability Analysis of EMAP-An Efficient RFID Mutual Authentication Protocol
Authors: Tieyan Li, Robert Deng
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

In this paper, we analyze the security vulnerabilities of EMAP, an efficient RFID mutual authentication protocol recently proposed by Peris-Lopez et al. [15]. We present two effective attacks, a de-synchronization attack and a fulldisclosure attack, against the protocol. The former permanently disables the authentication capability of a RFID tag by destroying synchronization between the tag and the RFID reader. The latter completely compromises a tag by extracting all the secret information stored in the tag. The de-synchronization attack can be carried out in just round of interaction in EMAP while the full-disclosure attack is accomplished across several runs of EMAP. We also discuss ways to counter the attacks.
Speaker Tracking and Identifying Based on Indoor Localization System and Microphone Array
Authors: Xiaojie Chen, Yuanchun Shi, Wenfeng Jiang
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper presents a novel multimodal system to track the participants and identify the active speaker in the smart meeting room. Indoor localization system, Cicada, is used to obtain the location and identity information of the participants. Cicada, developed by our research group, can provide much higher localization precision than most visual tracking systems available. Four eight-element microphone arrays are used to estimate TDOA (Time Difference of Arrival) of the audio signals, which are indicators of the location of the speaker. Integrating these two cues from Cicada and microphone arrays into a statistical framework, results in a more robust solution to speaker localization and identification. The experiments show that the average error in the participant location estimation is about 15 cm and the system can achieve approximately 90% accuracy in speaker identification on average.
A Smaller Sleeping Bag for a Baby Snake
Authors: J. H&#x00e5;stad, S. Linusson, J. W&#x00e4;stlund
Venue: Discrete Computational Geometry (2001)

By a sleeping bag for a baby snake in d dimensions we mean a subset of Rd which can cover, by rotation and translation, every curve of unit length. We construct sleeping bags which are smaller than any previously known in dimensions 3 and higher. In particular, we construct a three-dimensional sleeping bag of volume approximately 0.075803. For large d we construct d-dimensional sleeping bags with volume less than (c\sqrt log&#x00a0; d)d / d3d/2 for some constant c. To obtain the last result, we show that every curve of unit length in Rd lies between two parallel hyperplanes at distance at most c1d-3/2\sqrt log&#x00a0; d , for some constant c1 .
Simulation-based reusable posynomial models for MOS transistor parameters
Authors: Varun Aggarwal, Una-May O'Reilly
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We present an algorithm to automatically design posynomial models for parameters of the MOS transistors using simulation data. These models improve the accuracy of the Geometric Programming flow for automatic circuit sizing. The models are reusable for multiple circuits on a given Silicon technology and hence don't adversely affect the scalability of the Geometric Programming approach. The proposed method is a combination of genetic algorithms and Quadratic Programming. It is the only approach for posynomial modeling with real-valued exponents which is easily extensible to different error metrics. We compare the proposed technique with state-of-art posynomial/monomial modeling techniques and show its superiority.
Register pointer architecture for efficient embedded processors
Authors: JongSoo Park, Sung-Boem Park, James D. Balfour, David Black-Schaffer, Christos Kozyrakis, William J. Dally
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Conventional register file architectures cannot optimally exploit temporal locality in data references due to their limited capacity and static encoding of register addresses in instructions. In conventional embedded architectures, the register file capacity cannot be increased without resorting to longer instruction words. Similarly, loop unrolling is often required to exploit locality in the register file accesses across iterations because naming registers statically is inflexible. Both optimizations lead to significant code size increases, which is undesirable in embedded systems. In this paper, we introduce the Register Pointer Architecture (RPA), which allows registers to be accessed indirectly through register pointers. Indirection allows a larger register file to be used without increasing the length of instruction words. Additional register file capacity allows many loads and stores, such as those introduced by spill code, to be eliminated, which improves performance and reduces energy consumption. Moreover, indirection affords additional flexibility in naming registers, which reduces the need to apply loop unrolling in order to maximize reuse of register allocated variables.
Existence, uniqueness and asymptotic behavior of the solutions of a fuzzy differential equation with piecewise constant argument
Authors: G. Papaschinopoulos, G. Stefanidou, P. Efraimidis
Venue: Information Sciences: an International Journal (2007)

In this paper we study the existence, the uniqueness and the asymptotic behavior of the solutions of the fuzzy differential equation of the form:x^'(t)=px(t)+qx([t]),t@?[0,~),where p, q are constant real numbers and the initial value x"0 is a fuzzy number.