ppxscal/embedding_network huggingface dataset:
Limiting the power consumption of main memory
Authors: Bruno Diniz, Dorgival Guedes, Wagner Meira,  Jr., Ricardo Bianchini
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

The peak power consumption of hardware components affects their powersupply, packaging, and cooling requirements. When the peak power consumption is high, the hardware components or the systems that use them can become expensive and bulky. Given that components and systems rarely (if ever) actually require peak power, it is highly desirable to limit power consumption to a less-than-peak power budget, based on which power supply, packaging, and cooling infrastructure scan be more intelligently provisioned. In this paper, we study dynamic approaches for limiting the powerconsumption of main memories. Specifically, we propose four techniques that limit consumption by adjusting the power states of thememory devices, as a function of the load on the memory subsystem. Our simulations of applications from three benchmarks demonstrate that our techniques can consistently limit power to a pre-established budget. Two of the techniques can limit power with very low performance degradation. Our results also show that, when using these superior techniques, limiting power is at least as effective an energy-conservation approach as state-of-the-art technique sexplicitly designed for performance-aware energy conservation. These latter results represent a departure from current energy management research and practice.
Armed for the Spam Battle: A Technological and Organizational Infrastructure Framework
Authors: Guido Schryen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Spamming remains a form of Internet abuse, which burdens the Internet infrastructure, is generally regarded as an annoyance, and is said to cause economic harm to the tune of about several billion US$ per year. Many technological, organizational, and legislative anti-spam measures have already been proposed and implemented, but have not led to any substantial decrease in the number of spam e-mails. We propose here a new infrastructure framework that combines several anti-spam measures in a framework that features both a technological and an organizational facet. The key element of our infrastructure is a new organizational unit that reliably and transparently limits the number of e-mails that can be sent per day and per account. This paper first gives an overview of the framework, then it provides technological and organizational details of the infrastructure, the deployment of which depends to a large degree on its acceptance and propagation by the ICANN, the ISOC, and by large e-mail service providers. Finally, the paper discusses the limitations and drawbacks of the proposed framework.
Road Extracting Based on Texture Analysis
Authors: Gu Hui, Lou Jilin, Lu Yaya
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, an automatic method for road network extraction from high resolution aerial image is presented, the recommended input is merely the color image. The modified technique, TPA, and a new way of initial road point extraction are applied. The whole method consists of three modules: 1) the first road detection; 2) statistics and fusing; 3) the second road detection, evaluating and completing the final result.
IGameFloor: a platform for co-located collaborative games
Authors: Kaj Grønbæk, Ole S. Iversen, Karen Johanne Kortbek, Kaspar Rosengreen Nielsen, Louise Aagaard
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

This paper introduces a novel interactive floor platform for social games and entertainment involving multiple co-located users in a collaborative game environment. The interactive floor used as the prototype platform, is a 12 m2 glass surface with bottom projection and camera based tracking of limb (e.g. foot, hand, and knee) contact points. The iGameFloor platform supports tracking of limb points for more than 10 users at the same time. This paper describes the technological platform and the interaction techniques used for social gaming and entertainment. Three iGameFloor applications are discussed with the purpose of displaying the potential of the physical computer game platform. Experiences and perspectives for further development of the iGameFloor platform are discussed.
Assigning Sites to Redundant Clusters in a Distributed Storage System
Authors: Antoine N. Mourad, W. Kent Fuchs, Daniel G. Saab
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Redundant Arrays of Distributed Disks (RADD) can be used in a distributed computing system or database system to provide recovery in the presence of disk crashes and temporary and permanent failures of single sites. In this paper, we look at the problem of partitioning the sites of a distributed storage system into redundant arrays in such a way that the communication costs for maintaining the parity information are minimized. We show that the partitioning problem is NP-hard. We then propose and evaluate several heuristic algorithms for finding approximate solutions. Simulation results show that significant reduction in remote parity update costs can be achieved by optimizing the site partitioning scheme.
The restoration of missing data using Bayesian numerical methods
Authors: W. J. Fitzgerald
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Summary form only given. This paper outlines a method for restoring missing samples in digital signals. The missing samples are imputed using a Markov Chain Monte Carlo approach and an introduction to these numerical techniques is given. One application area is presented from the area of digital audio restoration where clicks are a familiar problem, and can take the form of sudden unexpected bursts of impulsive noise with random but finite duration. These bursts of noise have numerous causes such as dirt, electrical interference or mechanical damage to the storage medium. The original signal is often effectively lost. Several methods of detecting clicks have been devised, with the best approaches being model based. Once a click has been detected the "suspect" samples are removed and replaced by interpolation. Results obtained on both synthetic and real data are given.
Computing as an Evolving Discipline: 10 Observations
Authors: Jiming Liu
Venue: Computer (2007)

The profession must strive to make computing schools and departments the pillars of technological advancement.
Building Privacy into Software Products and Services
Authors: Tina R. Knutson
Venue: IEEE Security and Privacy (2007)

To avoid privacy pitfalls and build products and services that empower customers, companies must develop holistic strategies for addressing privacy in the development process.
Multi-Valued Model Checking via Groebner Basis Approach
Authors: Jinzhao Wu, Lin Zhao
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

The management of uncertainty and imprecision is becoming essential for modeling many real problems. Multivalued model checking, a generalization of classical model checking, is useful for analyzing models that contain uncertainty or inconsistency. This paper shows that Groebner bases can provide canonical symbolic representations for multi-valued logics, and therefore, can be applied to symbolic multi-valued model checking. We propose a general polynomial form of multi-valued logics, and then present a modified model checking algorithm based on the algebraic representations of mv-Kripke structures as well as mv-CTL formulas. This algebraic approach to multi-valued model checking could serve as a useful supplement to the existent method based on Multi-valued Decision Diagrams, and may give new guidance for verifying properties of systems containing uncertain or inconsistent information.
Log monitors in BSD UNIX
Authors: Brett Glass
Venue: Proceedings of the BSD Conference 2002 on BSD Conference (2002)

A log monitor is a process, or daemon, which monitors log messages produced by a computer system and the programs which run on it. A properly designed log monitor can recognize unusual activity (or inactivity), alert an administrator to problems, gather statistics about system activity, and/or take automatic action to contain a threat. It can even "learn," over time, what is normal and identify message traffic that may betray an abnormal situation. Languages which facilitate string processing and pattern matching, such as Perl and SNOBOL4, are good choices for the implementation of log monitors for this reason. Included in this paper is source code for a log monitor that identifies and blocks attacks from Code Red, sadmind/IIS, Nimda, and similar worms. Policy issues -- including the usefulness of "amnesty" to prevent inadvertent blocking of innocent third parties -- are discussed. The work described in this paper --which is still progressing at this writing -- will hopefully culminate in the release of a general purpose log monitoring facility. [Note: Because the camera-ready copy of this paper was submitted two months prior to the BSDCon 2002 conference to allow time for printing, and was required to conform to strict size limits, the version which appears online may contain more detail as well as new information gleaned from ongoing work. For the latest version, and/or to follow up the many references via HTML links, access the master copy at http://www.brettglass.com/logmonitors/paper.html on the World Wide Web.]
2007 Special Issue: From memory-based decisions to decision-based movements: A model of interval discrimination followed by action selection
Authors: Prashant Joshi
Venue: Neural Networks (2007)

The interval discrimination task is a classical experimental paradigm that is employed to study working memory and decision making and typically involves four phases. First, the subject receives a stimulus, then holds it in the working memory, then makes a decision by comparing it with another stimulus and finally acts on this decision, usually by pressing one of the two buttons corresponding to the binary decision. This article demonstrates that simple linear readouts from generic neural microcircuits that send feedback of their activity to the circuit, can be trained using identical learning mechanisms to perform quite separate tasks of decision making and generation of subsequent motor commands. In this sense, the neurocomputational algorithm presented here is able to integrate the four computational stages into a single unified framework. The algorithm is tested using two-interval discrimination and delayed-match-to-sample experimental paradigms as benchmarks.
Domain Modelling for Ubiquitous Computing Applications
Authors: Anthony Harrington, Vinny Cahill
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Many Ubiquitous computing applications can be considered as planning and acting problems in environments characterised by uncertainty and partial observability. Such systems rely on sensor data for information about their environment and use stochastic or probabilistic reasoning algorithms to infer system state from sensor data. We propose a domain modelling technique that characterises the sensor and actuator infrastructure and the set of system states in Ubicomp application domains. We capture the location and geometry of all domainmodel elements and use these spatial properties to tailor system state determination to reflect the quality and spread of the sensor and actuator platform. The domain model is used to support the development of Ubicomp applications and allows us calculate the degree of observability that exists over the state space in the environment. The degree of observability over the state space can act as an input into determining the state inference and action selection algorithms used in Ubicomp systems. In this paper we present the design of our Ubicomp domain model. We show that the proposed model contains information necessary to support Ubicomp application development. The expressiveness of the proposed design has been tested by building a model of an Urban Traffic Control application for Dublin city.
Numerical Methods for Second-Order Stochastic Differential Equations
Authors: Kevin Burrage, Ian Lenane, Grant Lythe
Venue: SIAM Journal on Scientific Computing (2007)

We seek numerical methods for second-order stochastic differential equations that reproduce the stationary density accurately for all values of damping. A complete analysis is possible for scalar linear second-order equations (damped harmonic oscillators with additive noise), where the statistics are Gaussian and can be calculated exactly in the continuous-time and discrete-time cases. A matrix equation is given for the stationary variances and correlation for methods using one Gaussian random variable per timestep. The only Runge-Kutta method with a nonsingular tableau matrix that gives the exact steady state density for all values of damping is the implicit midpoint rule. Numerical experiments, comparing the implicit midpoint rule with Heun and leapfrog methods on nonlinear equations with additive or multiplicative noise, produce behavior similar to the linear case.
Dynamic resource allocation algorithm for next generation wireless multimedia. services
Authors: G. Sivaradje, P. Dananjayan
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

A predictive resource allocation scheme that provides high wireless network utilization is proposed by dynamically reserving only those resources that are needed. The algorithm exploits the structure of the MPEG video stream and allocates bandwidth on a scene basis, wherein the mobile users change their bandwidth requirement only for scene boundaries. This will result in a high bandwidth gain, which will improve the overall network performance. The proposed scheme is dynamic and also facilitates bandwidth management. It automatically adjusts the amount of reserved resources, while the required QoS are also guaranteed. The algorithm is simulated and evaluated using model encoded video data.
Scoop: A Complete Methodology for Cooperative Systems Modeling and Analysis
Authors: David Saint-Voirin, Christophe Lang, Herve Guyennet, Noureddine Zerhouni
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

In this paper, we present our methodology proposal for cooperative remote systems modeling. Its aim is to develop models of existing or planned cooperative systems. These models are used to specify systems or to create dynamic working simulations. Comparative performances are deduced from the latter. The associated meta-model proposal is based, among other things, on the use of multi-agent systems, Petri nets and stochastics Petri nets. After having described the whole methodology concepts, we show a set of general results extracted from simulations.
Tashkent+: memory-aware load balancing and update filtering in replicated databases
Authors: Sameh Elnikety, Steven Dropsho, Willy Zwaenepoel
Venue: ACM SIGOPS Operating Systems Review (2007)

We present a memory-aware load balancing (MALB) technique to dispatch transactions to replicas in a replicated database. Our MALB algorithm exploits knowledge of the working sets of transactions to assign them to replicas in such a way that they execute in main memory, thereby reducing disk I/O. In support of MALB, we introduce a method to estimate the size and the contents of transaction working sets. We also present an optimization called update filtering that reduces the overhead of update propagation between replicas. We show that MALB greatly improves performance over other load balancing techniques -- such as round robin, least connections, and locality-aware request distribution (LARD) -- that do not use explicit information on how transactions use memory. In particular, LARD demonstrates good performance for read-only static content Web workloads, but it gives performance inferior to MALB for database workloads as it does not efficiently handle large requests. MALB combined with update filtering further boosts performance over LARD. We build a prototype replicated system, called Tashkent+, with which we demonstrate that MALB and update filtering techniques improve performance of the TPC-W and RUBiS benchmarks. In particular, in a 16-replica cluster and using the ordering mix of TPC-W, MALB doubles the throughput over least connections and improves throughput 52% over LARD. MALB with update filtering further improves throughput to triple that of least connections and more than double that of LARD. Our techniques exhibit super-linear speedup; the throughput of the 16-replica cluster is 37 times the peak throughput of a standalone database due to better use of the cluster's memory.
Code Generation and Optimization for Transactional Memory Constructs in an Unmanaged Language
Authors: Cheng Wang, Wei-Yu Chen, Youfeng Wu, Bratin Saha, Ali-Reza Adl-Tabatabai
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Transactional memory offers significant advantages for concurrency control compared to locks. This paper presents the design and implementation of transactional memory constructs in an unmanaged language. Unmanaged languages pose a unique set of challenges to transactional memory constructs - for example, lack of type and memory safety, use of function pointers, aliasing of local variables, and others. This paper describes novel compiler and runtime mechanisms that address these challenges and optimize the performance of transactions in an unmanaged environment. We have implemented these mechanisms in a production-quality C compiler and a high-performance software transactional memory runtime. We measure the effectiveness of these optimizations and compare the performance of lock-based versus transaction-based programming on a set of concurrent data structures and the SPLASH-2 benchmark suite. On a 16 processor SMP system, the transaction-based version of the SPLASH-2 benchmarks scales much better than the coarse-grain locking version and performs comparably to the fine-grain locking version. Compiler optimizations significantly reduce the overheads of transactional memory so that, on a single thread, the transaction-based version incurs only about 6.4% overhead compared to the lock-based version for the SPLASH-2 benchmark suite. Thus, our system is the first to demonstrate that transactions integrate well with an unmanaged language, and can perform as well as fine-grain locking while providing the programming ease of coarse-grain locking even on an unmanaged environment.
Wavelet domain Wiener filtering for ECG denoising using improved signal estimate
Authors: N. Nikolaev
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

A new two-stage algorithm for electrocardiographic (EGG) signal denoising has been proposed. It combines wavelet shrinkage with Wiener filtering in the translation-invariant wavelet domain. A time-frequency dependent thresholding has been proposed and grounded for obtaining a more adequate signal estimate in the first stage of the algorithm. It is related to ECG signal morphology and hence outperforms other thresholding approaches in this area. The experiments carried out on pathological and normal ECGs have shown better algorithm capabilities in comparison with other thresholding algorithms while suppressing parasite electromyographic (EMG) signals (the noise) and preserving diagnostically important ECG signal features.
A simplified global least mean square algorithm for adaptive IIR filtering
Authors: W. W. Edmonson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

In this paper we develop a LMS algorithm that converges to the global minimum of the mean square output error (MSE) objective function. This is accomplished by estimating the gradient as a smoothed version of the MSE. The smoothed MSE objective function begins as a convex functional. A cooling schedule is then applied such that over time it becomes the true MSE as the algorithm converges to the global minimum. We show that this smoothing process is achieved by convolving the objective function with a Gaussian probability density function, resulting in the LMS algorithm with a variable source appended to it. Simulation studies indicate that the proposed method consistently converges to the global minimum. We have shown a performance improvement over the IIR-LMS algorithm and the Steiglitz-McBride algorithm.
An Analysis of the Security Patterns Landscape
Authors: Thomas Heyman, Koen Yskout, Riccardo Scandariato, Wouter Joosen
Venue: Proceedings of the Third International Workshop on Software Engineering for Secure Systems (2007)

Architectural and design patterns represent effective techniques to package expert knowledge in a reusable way. Over time, they have proven to be very successful in software engineering. Moreover, in the security discipline, a well-known principle calls for the use of standard, time-tested solutions rather than inventing ad-hoc solutions from scratch. Clearly, security patterns provide a way to adhere to this principle. However, their adoption does not live up to their potential. To understand the reasons, this paper analyzes an extensive set of published security patterns according to several dimensions and outlines the directions for improvement.
Shortening the Switching Times of Gradients for MR Tomography and Spectroscopy
Authors: Eva Gescheidtova, Radek Kubasek, Karel Bartusek, Zdenek Smekal
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The magnetic resonance (MR) imaging techniques of tomography and spectroscopy are exploited in many applications. For the MR instruments to function properly it is necessary to maintain a high quality of homogeneity of the fundamental magnetic field. The pre-emphasis compensation of the generated gradient field increases the homogeneity of the generated magnetic field and reduces the minimum switching times of the gradients. This enables measuring the MR images of incisions in the human body, the relaxation properties of nuclei, self-diffusion processes, flows of liquids and movements of solids faster and more accurately.
Closed-form and real-time wordlength adaptation
Authors: P. D. Fiore
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

FPGA and configurable computing-based DSP algorithms have demonstrated significant performance improvements over software implementations. This has caused renewed interest in developing or mapping DSP algorithms to custom hardware. An algorithm will be successfully mapped if the intermediate wordlengths can be reduced to maintain reasonable hardware size. We consider linear hardware cost functions, for which we can derive closed-form expressions for the reduced wordlengths. We then apply these results to an adaptive LMS filter, where we adapt not only the tap weights, but also the wordlengths as a function of the data in real-time.