ppxscal/embedding_network huggingface dataset:
Look around and get engaged
Authors: Joel Chadabe
Venue: Organised Sound (2004)

The term &lsquo;computer music&rsquo;, for those of us who lived through the beginnings, became meaningful during the pioneering period from the late 1950s through the 1970s. It was a positive term. It identified a specific genre of music, a major effort in musical experiment, research and exploration, a wealth of new sound-generating techniques, and a large palette of new sounds. Jean-Claude Risset, in Inharmonique, for example, used additive synthesis to extend principles of tonality into the microworld of spectral progression. John Chowning, in Stria, used the Golden Mean to define FM frequency ratios. For many of us, these were interesting ideas and beautiful sounds.
Haptic Feedback and Sensory Substitution during Telemanipulated Suturing
Authors: M. Tavakoli, R. V. Patel, M. Moallem
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Various modes of sensory feedback to the user have the potential to enhance performance in robot-assisted surgery. In this paper, it is hypothesized that substituting or augmenting force feedback by visual representation of the force levels can potentially assist the user in limiting the amount of applied forces. In addition to confirming the above for a telemanipulated suturing task, the results indicate that there is a trade-off between the magnitudes of applied forces and the time required to complete the task.
Dry Granular Flows Need Special Tools
Authors: Alberto Biancardi, Paolo Ghilardi, Matteo Pagliardi
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Owing to their destructive power, debris flow are the subjects of extensive investigations aiming at charaterizing and modeling their inner nature. Laboratory experiments on simulated dam breaks are one important way to trigger and study debris-flow waves. High-speed recordings of granular flows arising from a dam-break-like event can be processed to extract useful information about the flow dynamics. Although the techniques for measuring of velocities in liquid end gas flows are well established, they cannot be used directly on the flows arising from a dam break: this paper presents two required additions that were made to compute such flows. All the resulting quantities are being used to tune a mathematical model describing the observed flows.
A near-optimal similarity join algorithm and performance evaluation
Authors: Zhengwu Yang, Guoqiang Yang
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

Similarity join, a basic operation for multi-media databases, amounts to combinations of all pairs of points, with the distance between each pair bounded by a given parameter ε In this paper, properties of index-based join algorithms are studied and a highly efficient and near-optimal similarity join algorithm is proposed. Our algorithm utilizes the Breadth-First strategy, and guides the join computation and I/O access through the cache content. In contrast with many other proposed join algorithms, our algorithm is advantageous due to the essential independence of the ordering strategies and the minimal cache capacity requirement. As a result, a more precise plan for the sequence of join computations and I/O access can be realized. Generally, processing and accessing each page can be done with only one attempt. Qualitative and quantitative analysis of the performance of the algorithm is provided. Although only R-tree (a common index structure) based similarity join is discussed in this paper, the idea can be generalized to implement other join algorithms without substantial difficulties. Experiments based on our analysis indicate that the new algorithm yields superior performances across a wide range of dimensions and sizes of databases.
MultiArray: a C&plus;&plus; library for generic programming with arrays
Authors: Ronald Garcia, Andrew Lumsdaine
Venue: Software&mdash;Practice Experience (2005)

In C&plus;&plus;, multi-dimensional arrays are often used but the language provides limited native support for them. The language, in its Standard Library, supplies sophisticated interfaces for manipulating sequential data, but relies on its bare-bones C heritage for arrays. The MultiArray library, a part of the Boost library collection, enhances a C&plus;&plus; programmer's tool set with versatile multi-dimensional array abstractions. It includes a general array class template and native array adaptors that support idiomatic array operations and interoperate with C&plus;&plus; Standard Library containers and algorithms. The arrays share a common interface, expressed as a generic programming concept, in terms of which generic array algorithms can be implemented. We present the library design, introduce a generic interface for array programming, demonstrate how the arrays integrate with the C&plus;&plus; Standard Library, and discuss the essential aspects of their implementation. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Modeling human subjectivity: personality profiles and impressions
Authors: James M. Piette
Venue: Journal of Computing Sciences in Colleges (2005)

Computers have the ability to objectively analyze data. Humans, however, may draw subjective conclusions from data because their "personality" affects the way that they interpret data. This abstract discusses the creation of a model which uses personality traits to derive varying perspectives on a data set. This model also helps to predict the interpretation of a data set given specific personality traits.
Hardware Enhanced Function Allocation Management in Reconfigurable Systems
Authors: Michael Ullmann, Wansheng Jin, Jurgen Becker
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

We present a new approach for a function allocation manager supporting multiple reconfigurable devices. It is a rule-based approach considering resource usage and power consumption. An essential main component which is in the focus of this contribution is a retrieval-unit for function-requests. This unit adopts methodologies from the domain of knowledge-based systems by accounting quality-of-service related parameters from the calling application's function request.
Resource allocation and QoS in mobile ad hoc networks
Authors: Hussein Ali, Mohammad Inayatullah, Shmuel Rotenstreich
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

Quality of Service support in MANET is a challenging and difficult due to the dynamic nature of the ad hoc network, nodes may leave, and join the network or move around at anytime. In order to support certain level of service quality, a mechanism for recourses allocations/reservation has to be implemented to provide the needed assurance for the desired level of quality.However, in such a mobile environment (unlike networks with fixed topology), no service guarantee can be assured by any reservation/allocation mechanism and all what those mechanisms can offer is a better chance or a promise for better service. Several mechanisms have been developed, they differ in the level of assurance they can provide ranging from no assurance to relatively high level of assurance.In this paper, we present a survey of the current research that has developed to address the problem. Some of those mechanisms are, DiffServ, DSRRSVP, DRSVP and MRSVP. We also compare them based on certain criteria (complexity, scalability, level of assurance, control overhead, and types of environments that they support).
On Multigrid for Overlapping Grids
Authors: William D. Henshaw
Venue: SIAM Journal on Scientific Computing (2005)

The solution of elliptic partial differential equations on composite overlapping grids using multigrid is discussed. An approach is described that provides a fast and memory efficient scheme for the solution of boundary value problems in complex geometries. The key aspects of the new scheme are an automatic coarse grid generation algorithm, an adaptive smoothing technique for adjusting residuals on different component grids, and the use of local smoothing near interpolation boundaries. Other important features include optimizations for Cartesian component grids, the use of over-relaxed red-black smoothers, and the generation of coarse grid operators through Galerkin averaging. Numerical results in two and three dimensions show that very good multigrid convergence rates can be obtained for Dirichlet, Neumann, and mixed boundary conditions. A comparison to Krylov-based solvers shows that the multigrid solver can be much faster and require significantly less memory.
A Countermeasure for EM Attack of a Wireless PDA
Authors: C. H. Gebotys, C. C. Tiu, X. Chen
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Future wireless embedded systems will be increasingly powerful, supporting many more applications including one of the most crucial, security. Although many wireless devices offer more resistance to bus probing and power analysis attacks due to their compact size, susceptibility to electromagnetic (EM) attacks must be analyzed. This paper demonstrates, for the first time, a real EM attack on a PDA. A new low energy countermeasure and a new first order differential frequency analysis (DFA) is presented. Real energy measurements are also used to compare the energy overheads of different countermeasures. Results show that the low energy countermeasure thwarts first order differential analysis without large overheads of table regeneration or excessive storage. With the emergence of security applications in PDAs, cellphones, etc, low energy countermeasures for resistance to DFA are crucial for supporting future secure wireless embedded systems.
Sextant: a unified node and event localization framework using non-convex constraints
Authors: Saikat Guha, Rohan Murty, Emin Gün Sirer
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Determining node and event locations is a canonical task for many wireless network applications. Yet dedicated infrastructure for determining position information is expensive, energy-consuming, and simply unavailable in many deployment scenarios. This paper presents an accurate, cheap and scalable framework, called Sextant, for determining node position and event location in sensor networks. Sextant operates by setting up and solving a system of geographic constraints based on connectivity information from the underlying communication network. Sextant achieves high accuracy by enabling non-convex constraints to be used to refine position estimates. It represents position estimates as potentially non-contiguous collections of points. This general representation enables Sextant to use _negative information_, that is, information on where a node or event is not located, to refine location estimates. Sextant unifies both node and event detection within the same general framework. It can provide high precision without dedicated localization hardware by aggressively extracting constraints from the link layer, representing areas precisely with Bézier-enclosed polygons and probability distributions, and using event detection to refine node position estimates. A compact representation and a fully distributed implementation make the framework practical for resource-limited devices. The framework has been implemented, deployed and tested on laptops, PDAs and Mica-2 motes. Physical experiments show that a large number (98%) of the nodes in a network can determine their positions based on a small number (30%) of landmark nodes and that a large number (90%) of events can be located with low median error.
On robust signal reconstruction in noisy filter banks
Authors: Haris Vikalo, Babak Hassibi, Alper T. Erdogan, Thomas Kailath
Venue: Signal Processing (2005)

We study the design of synthesis filters in noisy filter bank systems using an H∞ estimation point of view. The H∞ approach is most promising in situations where the statistical properties of the disturbances (arising from quantization, compression, etc.) in each subband of the filter bank is unknown, or is too difficult to model and analyze. For the important special case of unitary analysis polyphase matrices we obtain an explicit expression for the minimum achievable disturbance attenuation. For arbitrary analysis polyphase matrices, standard state-space H∞ techniques can be employed to obtain numerical solutions. When the synthesis filters are restricted to being FIR, as is often the case in practice, the design can be cast as a finite-dimensional semi-definite program. In this case, we can effectively exploit the inherent non-uniqueness of the H∞ solution to optimize for an additional criteria. By optimizing for average performance in addition to the H∞ criteria, we obtain mixed H2/H∞ optimal FIR synthesis filters. Alternatively, if the additional criteria is concerned with penalizing occasional occurrence of large values of reconstruction errors more than frequent occurrence of small to moderate ones, we obtain risk-sensitive FIR synthesis filters. Numerical examples and comparisons with existing methods are also included.
Fast and Exact Warping of Time Series Using Adaptive Segmental Approximations
Authors: Yutao Shou, Nikos Mamoulis, David W. Cheung
Venue: Machine Learning (2005)

Similarity search is a core module of many data analysis tasks, including search by example, classification, and clustering. For time series data, Dynamic Time Warping (DTW) has been proven a very effective similarity measure, since it minimizes the effects of shifting and distortion in time. However, the quadratic cost of DTW computation to the length of the matched sequences makes its direct application on databases of long time series very expensive. We propose a technique that decomposes the sequences into a number of segments and uses cheap approximations thereof to compute fast lower bounds for their warping distances. We present several, progressively tighter bounds, relying on the existence or not of warping constraints. Finally, we develop an index and a multi-step technique that uses the proposed bounds and performs two levels of filtering to efficiently process similarity queries. A thorough experimental study suggests that our method consistently outperforms state-of-the-art methods for DTW similarity search.
Meteorological command and control: an end-to-end architecture for a hazardous weather detection sensor network
Authors: Michael Zink, David Westbrook, Sherief Abdallah, Bryan Horling, Vijay Lakamraju, Eric Lyons, Victoria Manfredi, Jim Kurose, Kurt Hondl
Venue: Proceedings of the 2005 workshop on End-to-end, sense-and-respond systems, applications and services (2005)

We overview the software architecture for a network of low-powered radars (sensors) that collaboratively and adaptively sense the lowest few kilometers of the earth's atmosphere. We focus on the system's main control loop -- ingesting data from remote radars, identifying meteorological features in this data, and determining each radar's future scan strategy based on detected features and end-user requirements. Our initial benchmarks show that that these components generally have sub-second execution times, making them well-suited for our NetRad system.
Technical challenges in exploiting the web as a business resource
Authors: Andrew Tomkins
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this talk, I'll describe some recent indicators suggesting that businesses are on the cusp of operational exploitation of the web as a decision support resource. From consumer research and purchasing behavior to enterprise brand tracking, intelligence gathering, and advertising, the web is suddenly on everybody's mind - not as an exciting future possibility, but as an exploitable resource. I'll describe some technological approaches to employing this resource, talk about what's possible today, and describe some challenges for the future. As a running example, I'll cover IBM's WebFountain system: its architecture, analytical model, and applications.
Maran Illustrated Mac OS X v.10.4 Tiger
Authors: Ruth Maran
Venue:  (2005)

Coverage includes- Features a unique two-page spread, over 500 full-color screen shots, illustrations, and useful tips that appeal to and engage visual learners and simplify the learning process. Provides extensive coverage of OS X Tiger, the latest version of Apple's popular operating system, including new features such as Spotlight, Dashboard, VoiceOver, Parental Controls, and much more. Using simple, easy-to-understand and concise text, this book covers over 120 essential OS X Tiger topics, making it a great reference for all skill levels. Written using "Visual Grammar," a proven method that combines instructions with full-color screen shots to provide the best synergistic learning experience available.
An efficient scheme for authenticating public keys in sensor networks
Authors: Wenliang Du, Ronghua Wang, Peng Ning
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

With the advance of technology, Public Key Cryptography (PKC) will sooner or later be widely used in wireless sensor networks. Recently, it has been shown that the performance of some public-key algorithms, such as Elliptic Curve Cryptography (ECC), is already close to being practical on sensor nodes. However, the energy consumption of PKC is still expensive, especially compared to symmetric-key algorithms. To maximize the lifetime of batteries, we should minimize the use of PKC whenever possible in sensor networks.This paper investigates how to replace one of the important PKC operations--the public key authentication--with symmetric key operations that are much more efficient. Public key authentication is to verify the authenticity of another party's public key to make sure that the public key is really owned by the person it is claimed to belong to. In PKC, this operation involves an expensive signature verification on a certificate. We propose an efficient alternative that uses one-way hash function only. Our scheme uses all sensor's public keys to construct a forest of Merkle trees of different heights. By optimally selecting the height of each tree, we can minimize the computation and communication costs. The performance of our scheme is evaluated in the paper.
Footprint Heavy Pressure Surface Pick-Up and Description
Authors: Weidong Wang, Xijian Ping, Yihong Ding
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The distribution of footprint heavy pressure surface reflects the behavior feature and the physiological feature of human body. So, footprint heavy pressure surface pick-up and description is the foundation of footprint biological feature identification. We put forward a kind of footprint heavy pressure surfaces pick-up method based on Gauss curvature and average curvature. This method can pick-up effectively footprint heavy pressure surfaces that we are interested. And on this foundation, we still put forward the description method based on footprint range image overall and regional features which can reflect the built-in biological feature of human body. The result of experiment shows that this description method is simple and practicality.
A Realistic Network/Application Model for Scheduling Divisible Loads on Large-Scale Platforms
Authors: L. Marchal, Y. Yang, H. Casanova, Y. Robert
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Divisible load applications consist of an amount of data and associated computation that can be divided arbitrarily into any number of independent pieces. Thismodel is a good approximation of many real-world scientific applications, lends itself to a natural master-worker implementation, and has thus received a lot of attention. The issue of divisible load scheduling has been studied extensively. However, only a few authors have explored the simultaneous scheduling of multiple such applications on a distributed computing platform.Wefocus on this increasingly relevant scenario and make the following contributions. We use a novel and more realistic platform model that captures some of the fundamental network properties of grid platforms. We formulate the steady-state multiapplication scheduling problem as a linear program that expresses a notion of fairness between applications. This scheduling problem is NP-complete and we propose several heuristics that we evaluate and compare via extensive simulation experiments. Our main finding is that some of our heuristics can achieve performance close to optimal and we quantify the trade-offs between achieved performance and heuristic complexity.
Error control in the numerical inversion of the eigenvector matrix
Authors: M. D. Francis
Venue: ACM SIGNUM Newsletter (1981)

The numerical inversion of the eigenvector matrix is an essential mathematical operation in various branches of mathematics, science and engineering. There is no single method which yields an exact inverse of any given matrix. There are several applications where we are free to rearrange the columns of the eigenvector matrix in any order we like provided the eigen values are also shifted accordingly and the matrix with the best column arrangement (which reduces the errors in the inverse) can be used for inversion.
It's a jungle out there: practical considerations for evaluation in the city
Authors: Melanie Kellar, Derek Reilly, Kirstie Hawkey, Malcolm Rodgers, Bonnie MacKay, David Dearman, Vicki Ha, W. Joseph MacInnes, Michael Nunes, Karen Parker, Tara Whalen, Kori M. Inkpen
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

An essential aspect of mobile and ubiquitous computing research is evaluation within the expected usage context, including environment. When that environment is an urban center, it can be dynamic, expansive, and unpredictable. Methodologies that focus on genuine use in the environment can uncover valuable insights, although they may also limit measurement and control. In this paper, we present our experiences applying traditional experimental techniques for field research in two separate projects set in urban environments. We argue that although traditional methods may be difficult to apply in cities, the challenges are surmountable, and this kind of field research can be a crucial component of evaluation.