ppxscal/embedding_network huggingface dataset:
Models and algorithms for distributed computation in wireless sensor systems
Authors: Viktor K. Prasanna
Venue:  (2006)

The proliferation of networked embedded devices such as wireless sensor nodes ushers in an entirely new class of computing platforms, which unlike traditional systems, interact with the real world. The focus of sensor research till now has been on design of hardware and networking protocols to enable remote sensing and data collection. The next challenge in sensor system design is to exploit the in-network computing capabilities to make them intelligent and capable of autonomous operation. The focus of this thesis is on investigating models and algorithms for facilitating distributed computation in wireless sensor systems. A model of computation is defined to abstract the class of dense, uniformly deployed, wirelessly-connected, localized, two-dimensional, static sensor systems. The model is used for design and analysis of algorithms for solving several non-trivial computation problems in sensor systems. The benefits of our approach are demonstrated by end-to-end design of a sensor system, which exploits the computation and storage capabilities of the sensor nodes for efficient routing and resolution of topographic queries. We define the cluster-based, heterogeneous model for wireless sensor systems (COSMOS), which abstracts the network as an asynchronous, distributed system consisting of a set of uniquely-identifiable nodes, organized in a clustered mesh topology. It models several features specific to sensor systems, not abstracted by the traditional computation models, such as the variable radio range and power management of the sensor nodes. Time and energy optimal, and energy-balanced algorithms are discussed for sorting and selection in single-hop sensor systems---for single-channel and multi-channel networks. We also present time efficient and energy optimal algorithms for sorting and summing in multi-hop sensor systems. We discuss energy-efficient and fault-tolerant resolution of topographic queries in sensor systems. Our approach is based on prior construction of the topographic map of features of interest in the network. Once constructed, the map is used for resolving a large number of queries efficiently. We show that our approach is time and energy efficient, and recovers more reliably from node failures in the network in comparison to the state-of-the-art techniques.
Foundations of Measurement Theory Applied to the Evaluation of Dependability Attributes
Authors: Andrea Bondavalli, Andrea Ceccarelli, Lorenzo Falai, Michele Vadursi
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Increasing interest is being paid to quantitative evaluation based on measurements of dependability attributes and metrics of computer systems and infrastructures. Despite measurands are generally sensibly identified, different approaches make it difficult to compare different results. Moreover, measurement tools are seldom recognized for what they are: measuring instruments. In this paper, many measurement tools, present in the literature, are critically evaluated at the light of metrology concepts and rules. With no claim of being exhaustive, the paper i) investigates if and how deeply such tools have been validated in accordance to measurement theory, and ii) tries to evaluate (if possible) their measurement properties. The intention is to take advantage of knowledge available in a recognized discipline such as metrology and to propose criteria and indicators taken from such discipline to improve the quality of measurements performed in evaluation of dependability attributes.
Audio coding using a psychoacoustic pre- and post-filter
Authors: B. Edler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

A novel concept for perceptual audio coding is presented which is based on the combination of a pre- and post-filter, controlled by a psychoacoustic model, with a transform coding scheme. This paradigm allows modeling of the temporal and spectral shape of the masked threshold with a resolution independent of the used transform. By using frequency warping techniques the maximum possible detail for a given filter order can be made frequency-dependent and thus better adapted to the human auditory system. The filter coefficients are represented efficiently by LSF parameters which can be adaptively interpolated over time. First experiments with a system obtained by extending an existing transform codec showed that this approach can significantly improve the performance for speech signals, while the performance for other signals remained the same.
Subjective evaluation of actively controlled interior car noise
Authors: M. de Diego
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This work is a preliminary study which focuses on subjective improvements of vehicle interior noise by using active noise control techniques. A local active noise control system has been mounted inside a room in order to reduce synthesized and real engine noise in the area around the headrest of a typical car seat. Recordings before and after cancellation have been made using a head acoustics mannequin positioned in the seat with two calibrated microphones at the ear-canals. Two methods were used to evaluate the comfort improvements achieved by active noise control. First, a prediction model of comfort based on four psychoacoustic descriptors (loudness, roughness, sharpness and tonality) was applied. Secondly, the subjective evaluation of controlled signals was carried out by means of a jury test. The reduction of noise levels does not necessarily reduce the annoyance of car engine noise that depends on spectral characteristics of noise.
Analysis of Broadband Diffusion in OECD Countries
Authors: Mohsen Gerami, JunSeok Hwang
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

This article focus on broadband penetration in OECD countries. We examine statistic comparisons related to broadband deployment and economic factors in the OECD countries and compare the result for investment opportunity in these countries. With analyze The Standard Deviation of average Monthly charge and speed of broadband will the spread range of broadband calculate and probability of their spread with the Normal distribution demonstrate.
Learning topographic representation for multi-view image patterns
Authors: S. Z. Li
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

In 3D object detection and recognition, the object of interest in an image is subject to changes in view-point as well as illumination. It is benefit for the detection and recognition if a representation can be derived to account for view and illumination changes in an effective and meaningful way. In this paper, we propose a method for learning such a representation from a set of un-labeled images containing the appearances of the object viewed from various poses and in various illuminations. Topographic Independent Component Analysis (TICA) is applied for the unsupervised learning to produce an emergent result, that is a topographic map of basis components. The map is topographic in the following sense: the basis components as the units of the map are ordered in the 2D map such that components of similar viewing angle are group in one axis and changes in illumination are accounted for in the other axis. This provides a meaningful set of basis vectors that may be used to construct view subspaces for appearance based multi-view object detection and recognition.
Decimal Floating-Point Adder and Multifunction Unit with Injection-Based Rounding
Authors: Liang-Kai Wang, Michael J. Schulte
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

Shrinking feature sizes gives more headroom for designers to extend the functionality of microprocessors. The IEEE 754R working group has revised the IEEE 754-1985 Standard for Binary Floating-Point Arithmetic to include specifications for decimal floating-point arithmetic and IBM recently announced incorporating a decimal floatingpoint unit into their POWER6 processor. As processor support for decimal floating-point arithmetic emerges, it is important to investigate efficient algorithms and hardware designs for common decimal floating-point arithmetic algorithms. This paper presents novel designs for a decimal floating-point adder and a decimal floating-point multifunction unit. To reduce their delay, both the adder and the multifunction unit use decimal injection-based rounding, a new form of decimal operand alignment, and a fast flag-based method for rounding and overflow detection. Synthesis results indicate that the proposed adder is roughly 21% faster and 1.6% smaller than a previous decimal floating-point adder design, when implemented in the same technology. Compared to the decimal floating-point adder, the decimal floating-point multifunction unit provides six additional operations, yet only has 2.8%more delay and 9.7% more area.
First-Order System Least-Squares for Darcy-Stokes Flow
Authors: Garvin Danisch, Gerhard Starke
Venue: SIAM Journal on Numerical Analysis (2007)

The subject of this paper is a first-order system least-squares formulation for the Stokes equation which remains uniformly valid in the limit of vanishing viscosity. For this so-called Darcy-Stokes flow problem we establish continuity and coercivity of the corresponding least-squares functional in appropriate norms. Two types of finite element spaces for the approximation of the velocity field are investigated in detail: the well-known Raviart-Thomas elements and an element recently introduced by Mardal, Tai, and Winther specifically for mixed approaches to Darcy-Stokes flow. The computational results derived with next-to-lowest order Raviart-Thomas elements as well as the Mardal-Tai-Winther elements confirm our analysis.
Integrating Distributed Component and Mobile Agents programming models in Grid computing
Authors: Salvatore Venticinque, Beniamino Di Martino, Rocco Aversa, Richard Olejnik, Iyad Alshabani, Bernard Toursel
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

In this paper we investigate the feasibility of integration of two different programming models in order to exploit the advantages of each one and to overcome their weakness in a heterogeneous environment made of desktop networks and Virtual Organizations sharing powerful Grid platforms. We present a possible approach that will be exploited to integrate two already available frameworks (DG-ADAJ and MAgDA), which adopt respectively the Distributed Components and the Mobile Agents models to support distributed programming.
Detection in dense signal environments via the Gabor transform
Authors: R. S. Orr
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The matched filter is the classical solution for detection of an isolated, known signal in Gaussian noise. In dense signal environments consisting of numerous overlapped pulses, the matched filter is not necessarily the optimum detector. In this paper we explore Gabor-based detectors for dense environments, in order to capitalize on the potentially favorable trade-off of detector signal-to-noise ratio (SNR/sub DET/) vs. resolution. Theory and experiments are presented that compare Gabor and matched filter detectors under various environments and support the conclusion that the Gabor detector is superior, as measured by the receiver operating characteristic, under suitably dense environments.
Towards Deeper Understanding of the Search Interfaces of the Deep Web
Authors: Hai He, Weiyi Meng, Yiyao Lu, Clement Yu, Zonghuan Wu
Venue: World Wide Web (2007)

Many databases have become Web-accessible through form-based search interfaces (i.e., HTML forms) that allow users to specify complex and precise queries to access the underlying databases. In general, such a Web search interface can be considered as containing an interface schema with multiple attributes and rich semantic/meta-information; however, the schema is not formally defined in HTML. Many Web applications, such as Web database integration and deep Web crawling, require the construction of the schemas. In this paper, we first propose a schema model for representing complex search interfaces, and then present a layout-expression based approach to automatically extract the logical attributes from search interfaces. We also rephrase the identification of different types of semantic information as a classification problem, and design several Bayesian classifiers to help derive semantic information from extracted attributes. A system, WISE-iExtractor, has been implemented to automatically construct the schema from any Web search interfaces. Our experimental results on real search interfaces indicate that this system is highly effective.
Two Models Used as a Basis for Development of Electronic Data Collection Software to Support Clinical Trials
Authors: Ivan Pavlovic, Ivan Lazarevic
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

This paper is a presentation of some of the results of modeling web-based clinical trial electronic data collection process. Clinical trial data collection is usually a paper-based process. Here we propose a new process of electronic data collection adjusted for the utilization of the web-based technology. Two models that we present here are the basis for the development of the electronic data collection software to support clinical trials. The first one defines use cases of the actors using the system. The second one is a model of the structure of the electronic Case Report Form (eCRF) document. Descriptions of these two models are presented at a high level of abstraction using the standard UML (Unified Modeling Language) version 2.0.
What Constitutes a Scientific Database?
Authors: John L. Pfaltz
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

We propose that a scientific database should be inherently different from, say a business database. The difference is based on the nature of science itself, in which hypotheses, or logical implications, form an essential part of the discipline. Empirical observations give rise to tentative hypotheses. Individual hypotheses are then tested, refuted or refined, by further empirical observation. In the paper, we propose representing the observational data of science in a lattice format that also conveys all the logical implications that can be supported by those observations. We claim that such a structure can be incrementally created and that the hypotheses formed will adapt to new data. We demonstrate its practicality by presenting two real situations in which it has been used. Finally, we look at the rather considerable storage costs associated with this approach and discuss other limitations that are still unresolved in this new approach to the representation of scientific data.
Affine scaling transformation based methods for computing low complexity sparse solutions
Authors: B. D. Rao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper presents affine scaling transformation based methods for finding low complexity sparse solutions to optimization problems. The methods achieve sparse solutions in a more general context, and generalize our earlier work on FOCUSS developed to deal with the underdetermined linear inverse problem. The key result is a theorem which shows a simple condition that a sequence has to satisfy for it to converge to a sparse limiting solution. Three approaches to incorporate this condition into optimization problems are presented. These consist of either imposing the condition as an additional optimization constraint, or suitably modifying the cost function, or using a combination of the two. The benefits of the methodology when applied to the linear inverse problem are twofold. Firstly, it allows for the treatment of the overdetermined problem in addition to the underdetermined problem, and secondly it enables establishing sufficient conditions under which regularized versions of FOCUSS are assured of convergence to sparse solutions.
Nonlinear Diffusion Governed by McKean-Vlasov Equation on Hilbert Space and Optimal Control
Authors: N. U. Ahmed
Venue: SIAM Journal on Control and Optimization (2007)

This paper deals with optimal feedback control of measure-valued solutions of nonlinear diffusion governed by McKean-Vlasov equations. Questions of existence, uniqueness, and regularity properties of measure-valued solutions are addressed. A class of feedback controls furnished with a weak topology is introduced, and some important topological properties of the attainable set corresponding to these controls are presented. We consider several typical control problems with objective functionals which are functions of measures and prove the existence of optimal controls.
Multiple trace composition and its uses
Authors: Adam Sah
Venue: Proceedings of the 3rd Annual USENIX Workshop on Tcl/Tk - Volume 3 (1995)

Traces are code attachments to variables that cause designated blocks of code to be executed on reads or writes to the given variable. Traces have numerous uses, including rules ("on 〈condition〉 do 〈action〉" statements), autoloading and initialization based on data access, transparent remote data access, paging and swapping, and persistence. Traces are usually limited to ad-hoc, hard-coded composition, making it difficult to placemultiple traces on the same variable. Multiple traces are useful for putting a rule on a persistent variable, or several rules on a variable. This paper presents a design for a low-level mechanism for reasoning about and configuring multiple traces on a single variable. Although the work is based on a prototype using a modified version of Tcl's trace command, this mechanism easily applies to any language or library capable of implementing traps. This includes systems such as data breakpoints[WLG93] in C and overloadable get() and set() methods in prototype-based object-oriented systems. The specifics of the prototype are presented, including a facility for writing persistent Tcl scripts. The prototype requires Tcl7.x with Tk3.x or later and may be downloaded from ftp://ginsberg.cs.berkeley.edu/pub/ asah/dmt/tcl-proto.tar.gz
Discovering Significant Patterns
Authors: Geoffrey I. Webb
Venue: Machine Learning (2007)

Pattern discovery techniques, such as association rule discovery, explore large search spaces of potential patterns to find those that satisfy some user-specified constraints. Due to the large number of patterns considered, they suffer from an extreme risk of type-1 error, that is, of finding patterns that appear due to chance alone to satisfy the constraints on the sample data. This paper proposes techniques to overcome this problem by applying well-established statistical practices. These allow the user to enforce a strict upper limit on the risk of experimentwise error. Empirical studies demonstrate that standard pattern discovery techniques can discover numerous spurious patterns when applied to random data and when applied to real-world data result in large numbers of patterns that are rejected when subjected to sound statistical evaluation. They also reveal that a number of pragmatic choices about how such tests are performed can greatly affect their power.
Global convergence for two-pulse rest-to-rest learning for single-degree-of-freedom systems with stick-slip Coulomb friction
Authors: Brian J. Driessen, Nader Sadegh
Venue: Robotica (2007)

In this paper, we consider the problem of rest-to-rest maneu-ver learning, via iterative learning control (ILC), for single-degree-of-freedom systems with stick-slip Coulomb friction and input bounds. The static coefficient of friction is allowed to be as large as three times the kinetic coefficient of friction. The input is restricted to be a two-pulse one. The desired input's first pulse magnitude is required to be five times the largest possible kinetic (sliding) friction force. The theory therefore allows the stiction force to be as large as the desired second input pulse. Under these conditions, we prove global convergence of a simple iterative learning controller. To the best of our knowledge, such a global-convergence proof has not been presented previously in the literature for the rest-to-rest problem with stick-slip Coulomb friction.
An argument structure abstraction for bayesian belief networks: just outcomes in on-line dispute resolution
Authors: Nial Muecke, Andrew Stranieri
Venue: Proceedings of the fourth Asia-Pacific conference on Comceptual modelling - Volume 67 (2007)

There are many different approaches for settling disputes on-line, such as simple email systems, fixed bid systems and intelligent systems. However, to date there have been no attempts to integrate decision support methods into the dispute resolution process for the purpose of supporting outcomes that are consistent with judicial reasoning. This paper describes how a model of judicial reasoning can be used to assist divorcees with the resolution of property issues online, in a manner that is consistent with decisions a judge would make if the matter was heard in Court. The approach uses an argument based model of the discretionary nature of decisions made by judges in Australian Family Law. This is integrated with a protocol for online dispute dialogue. Predictions of the likelihood of alternates outcomes is achieved with a series of Bayesian Belief Networks.
Simulating Indirect Network Effects in the Video Game Market
Authors: Jochen Strube, Sven Schade, Patrick Schmidt, Peter Buxmann
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Since the 1970s, seven generations of consoles have competed in the video games market. Today video game industry sales even surpass the box-office results of the movie industry. The history of video games provides numerous examples of former successful console vendors failing to establish technologically superior successors of their consoles. This is mostly due to dependencies of console manufacturers on game publishers. Therefore, this paper examines strategies of console vendors against the background of indirect network effects on the video game market. We apply a simulation approach based on the agent-based computational economics paradigm to simulate an artificial video game market consisting of console vendors, game publishers and customers. This enables the examination of various competition scenarios. As an example application of our model we evaluate pricing strategies of console manufacturer showing that penetration pricing is a possible way to gain ground in the market or even to increase revenues.
Estimation of band-limited spectra, a reflection coefficients approach
Authors: T. Chonavel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this paper, we study band-limited spectrum estimation under band-limiting and correlation constraints. We use an approach based on reflection coefficients, that appears to be more convenient than those based on correlation coefficients. We study the properties of reflection coefficients of band-limited spectra and derive a band-limited spectrum estimator that can be seen as an extension to the band-limited case of the classical AR maximum entropy spectrum estimator. We check that this estimator yields good results in practice. Furthermore, we briefly explain how the results derived for a symmetric interval can be extended to the cases of a non symmetric interval and of several intervals.