ppxscal/embedding_network huggingface dataset:
Using wavelets to synthesize stochastic-based sounds for immersive virtual environments
Authors: Nadine E. Miner, Thomas P. Caudell
Venue: ACM Transactions on Applied Perception (TAP) (2005)

Stochastic, or nonpitched, sounds fill our real-world environment. Humans almost continuously hear stochastic sounds, such as wind, rain, motor sounds, and different types of impact sounds. Because of their prevalence in real-world environments, it is important to include these types of sounds for realistic virtual environment simulations. This paper describes a synthesis approach that uses wavelets for modeling stochastic-based sounds. Parameterizations of the wavelet models yield a variety of related sounds from a small set of models. The result is dynamic sound models that can change according to changes in the virtual environment. This paper contains a description of the sound synthesis process, several developed models, and the on-going perceptual experiments for validating the sound synthesis veracity. The developed models and results demonstrate proof of the concept and illustrate the potential of this approach.
A generic UPnP architecture for ambient intelligence meeting rooms and a control point allowing for integrated 2D and 3D interaction
Authors: Ali A. Nazari Shirehjini
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

In this paper we present a generic UPnP Presentation Architecture for AmI meeting rooms. It allows the development of applications based on standardized access mechanisms. This architecture introduces besides standard lighting devices also a UPnP design for complex projection settings, analog audio-video devices, shutter blinds and media repositories. Using this architecture, AmI developers benefit form UPnP device discovery as well as standardized access to devices and media repositories. This allows the development of interaction solutions working in various AmI environments that may be composed by different device infrastructures. Based on this architecture, we present the PECo system, a novel Control Point which provides integrated and intuitive access to the user's surrounding and media repositories [1] allowing to control and manage intelligent environments. PECo uses an automatically created 3D visualization of the environment. Entering a room, PECo discovers the infrastructure and available devices and builds the integrated user interface. The 3D visualization creates a logical link between physical devices and their virtual representation on the user's PDA. By doing so, the user can easily identify a device within his environment based on its position, orientation and form. There he can access the identified devices through the 3D interface and manipulate them directly within the scene. For example he can click on a 3D object to turn on a light. The 3D interface allows the user to access the infrastructure without demanding knowledge about specific device names, IP-numbers, URLs etc.
Efficient Allocation for VoIP Packet Losses Detection Services in Programmable and Active Networks
Authors: Juan J. Ramos-Munoz, Juan M. Lopez-Soler
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

In this work we propose an algorithm for efficient packet loss detection services allocation in VoIP environments. We aim to increase the final user voice perceived quality. Given a path between the sender and the receiver, the algorithm will determine the optimal location of the packet loss detector by considering a subjective voice quality measure. More precisely, by using a simplified version of the E-model, the algorithm estimates the loss detection agent location which maximizes the expected end to end subjective quality. To achieve this, beside of the proposed algorithm, analytical expressions for the prediction of the loss probability and the mean delay are provided. The proposed procedure is evaluated and validated by means of simulation.
A Pervasive Internet Approach to Fine-Grain Power-Aware Computing
Authors: Ahmed Abukmail, Abdelsalam (Sumi) Helal
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

We present a novel approach to conserve power in networked mobile devices. Our approach exploits communication within a pervasive smart space as an opportunity to save power as opposed to the classic view of communication as a drain on resources. We outsource intensive computations to the network whenever a pervasive connection to the Internet exists and when it pays off to do so. At compile-time our approach generates two versions of the program being compiled, a client version and a server version, each containing the necessary code to handle the run-time decision of executing code locally on the mobile device or remotely to the server based on power efficiency. We utilize a technique from Real-Time systems to help the compiler generate highly accurate code by calculating the number of loop iterations for each candidate section of code. This approach has the advantage of analyzing applications at a finer granularity than other similar methodologies. This is because the candidate code sections are CPU blocks represented mostly by loops. Our experimental results performed on Intel's XScale architecture and the Wi-Fi wireless technology show significant savings in power consumption by the mobile device.
AMMP-Vis: a collaborative virtual environment for molecular modeling
Authors: Jeffrey W. Chastine, Jeremy C. Brooks, Ying Zhu, G. Scott Owen, Robert W. Harrison, Irene T. Weber
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

Molecular modeling is an important research area, helping scientists develop new drugs against diseases such as AIDS and cancer. Prior studies have demonstrated that immersive virtual environments have unique advantages over desktop systems in visualizing molecular models. However, exploration and interaction in existing molecular modeling virtual environments is often limited to a single user, lacking strong support for collaboration. In addition, scientists are often reluctant to adopt these systems because of their lack of availability and high cost. We propose an affordable immersive system that allows biologists and chemists to manipulate molecular models via natural gestures, receive and visualize real-time feedback from a molecular dynamics simulator, allow the sharing of customized views, and provide support for both local and remote collaborative research.
The Cell Processor Architecture
Authors: Jim Kahle
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

This talk will present the Cell processor, jointly developed by the STI (Sony-Toshiba-IBM) partnership. Cell is a non-homogeneous chip multiprocessor intended for general-purpose applications but with a particular emphasis on multimedia performance. The Cell processor combines a 64bit Power Architecture(TM) core with 8 Synergistic Processors. In many cases, it delivers more than an order of magnitude more performance than conventional PC processors. Cell achieves this performance and power efficiency improvement by a new division of labor between the Power core and the Synergistic Processors. Cell allows for a wide variety of programming models, a selection of which will be presented in this talk. We will end the talk by discussing some applications that seem to fit the Cell processor particularly well, and by indicating areas of further exploration.
A Metamodel Based Model Transformation Approach
Authors: Yucong Duan, S. C. Cheung, Xiaolan Fu
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

The information transformation problem of model driven software development (MDSD) processes is gaining increasing attentions. In this paper, we present an indepth analysis of the major causes leading to the ambiguities of existing transformation. A metamodel based approach is then proposed to address these causes. A mechanism to generate transformation rules is devised based on a classification of the UML metamodel elements to be used in subsequent transformation processes. Some other critical issues relating to the generated transformation system are also discussed.
Macroblock mode decision for H.264
Authors: Tran Duc Hai Du
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

A complexity reduction algorithm for an H.264 encoder is proposed. This comes at the cost of the number of increased macroblock modes and the complex mode decision procedure using the rate-distortion optimization [1]. Computational savings are achieved by identifying, prior to motion estimation, macroblocks that are likely to be skipped and hence saving futher computational processing of these macroblocks. This early prediction is made by estimating a Lagrangian rate-distortion cost function. In this paper, we propose a fast mode decision algorithm using mode classification for H.264/AVC. Simulation results show that the proposed algorithm can reduce the encoding time by 29.67% on average and the rate-distortion computation complexity by 89,14% (depending on the source sequence) with no significant loss of rate-distortion performance.
A Graphical Simulation System for Modeling and Analysis of Sensor Networks
Authors: Yan Luo, Jeffrey J. P. Tsai
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Formal model and verification techniques can be used to design and analyze many kinds of systems. However, there are few formal models for verification and analysis of sensor networks in the literature. In this paper, we present a graphical simulation system for modeling and analysis of sensor networks. A formal model of sensor networks is proposed based on Space Time Petri Net (STPN). STPN is a formal model language which is extended from Time Petri Nets (TPN) and Colored Petri Nets (CPN). The idea is to add space information to the places of the original TPN to model the space information in sensor networks, such as the locations of sensor nodes. And based on this modeling idea, a set of new concepts are proposed, such as space place, broadcast transition, and dynamic topology. The STPN not only can model the various characteristics of sensor networks, such as temporal and spatial information, but also can simulate the different behavior of sensor networks. A prototype system has been implemented to model and analyze the behavior of sensor networks systems.
Formal Verification of Dead Code Elimination in Isabelle/HOL
Authors: Jan Olaf Blech, Lars Gesellensetter, Sabine Glesner
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Correct compilers are a vital precondition to ensure software correctness. Optimizations are the most error-prone phases in compilers. In this paper, we formally verify dead code elimination (DCE) within the theorem prover Isabelle/ HOL. DCE is a popular optimization in compilers which is typically performed on the intermediate representation. In our work, we reformulate the algorithm for DCE so that it is applicable to static single assignment (SSA) form which is a state of the art intermediate representation in modern compilers, thereby showing that DCE is significantly simpler on SSA form than on classical intermediate representations. Moreover, we formally prove our algorithm correct within the theorem prover Isabelle/HOL. Our program equivalence criterion used in this proof is based on bisimulation and, hence, captures also the case of nontermination adequately. Finally we report on our implementation of this verified DCE algorithm in the industrialstrength Scale compiler system.
An analytic placer for mixed-size placement and timing-driven placement
Authors: A. B. Kahng, Q. Wang
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

We extend the APlace wirelength-driven standard-cell analytic placement framework of A.A. Kennings and I.L. Markov (2002) to address timing-driven and mixed-size ("boulders and dust") placement. Compared with timing-driven industry tools, evaluated by commercial detailed routing and STA, we achieve an average of 8.4% reduction in cycle time and 7.5% reduction in wirelength for a set of six industry testcases. For mixed-size placement, we achieve an average of 4% wirelength reduction on ISPD02 mixed-size placement benchmarks compared to results of the leading-edge solver, Feng Shui (v2.4) (Khatkhate et al., 2004). We are currently evaluating our placer on industry testcases that combine the challenges of timing constraints, large instance sizes, and embedded blocks (both fixed and unfixed).
Commuting extensions and cubature formulae
Authors: Ilan Degani, Jeremy Schiff, David J. Tannor
Venue: Numerische Mathematik (2005)

Based on a novel point of view on 1-dimensional Gaussian quadrature, we present a new approach to d-dimensional cubature formulae. It is well known that the nodes of 1-dimensional Gaussian quadrature can be computed as eigenvalues of the so-called Jacobi matrix. The d-dimensional analog is that cubature nodes can be obtained from the eigenvalues of certain mutually commuting matrices. These are obtained by extending (adding rows and columns to) certain noncommuting matrices A1,...,Ad, related to the coordinate operators x1,...,xd, in Rd. We prove a correspondence between cubature formulae and &#x201c;commuting extensions&#x201d; of A1,...,Ad, satisfying a compatibility condition which, in appropriate coordinates, constrains certain blocks in the extended matrices to be zero. Thus, the problem of finding cubature formulae can be transformed to the problem of computing (and then simultaneously diagonalizing) commuting extensions. We give a general discussion of existence and of the expected size of commuting extensions and briefly describe our attempts at computing them.
A graphical model for chord progressions embedded in a psychoacoustic space
Authors: Jean-François Paiement, Douglas Eck, Samy Bengio, David Barber
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Chord progressions are the building blocks from which tonal music is constructed. Inferring chord progressions is thus an essential step towards modeling long term dependencies in music. In this paper, a distributed representation for chords is designed such that Euclidean distances roughly correspond to psychoacoustic dissimilarities. Parameters in the graphical models are learnt with the EM algorithm and the classical Junction Tree algorithm. Various model architectures are compared in terms of conditional out-of-sample likelihood. Both perceptual and statistical evidence show that binary trees related to meter are well suited to capture chord dependencies.
Reasoning about XACML policies using CSP
Authors: Jery Bryans
Venue: Proceedings of the 2005 workshop on Secure web services (2005)

In this work we explore the use of process algebra in formalising and analysing access control policies. We do this by considering a standard access control language (XACML) and show how the core concepts in the language can be represented in CSP. We then show how properties of these policies may also be described in CSP, and how model checking may be used to verify that a policy meets the property.We further consider how we may introduce a notion of workflow into this framework, and show that a simple appreciation of the workflow context may limit the things we need to verify about a policy.
On ip over wdm burst-switched long haul and metropolitan area networks
Authors: Nirwar Ansari, Teunis Ott
Venue:  (2004)

The IP over Wavelength Division Multiplexing (WDM) network is a natural evolution ushered in by the phenomenal advances in networking technologies and technical breakthroughs in optical communications, fueled by the increasing demand in the reduction of operation costs and the network management complexity. The unprecedented bandwidth provisioning capability and the multi-service supportability of the WDM technology, in synergy with the data-oriented internetworking mechanisms, facilitates a common shared infrastructure for the Next Generation Internet (NGI). While NGI targets to perform packet processing directly on the optical transport layer, a smooth evolution is critical to success. Intense research has been conducted to design the new generation optical networks that retain the advantages of packet-oriented transport prototypes while rendering elastic network resource utilization and graded levels of service. This dissertation is focused on the control architecture, enabling technologies, and performance analysis of the WDM burst-switched long haul and Metropolitan Area Networks (MANs). Theoretical analysis and simulation results are reported to demonstrate the system performance and efficiency of proposed algorithms. A novel transmission mechanism, namely, the Forward Resource Reservation (FRR) mechanism, is proposed to reduce the end-to-end delay for an Optical Burst Switching (OBS)-based IP over WDM system. The FRR scheme adopts a Linear Predictive Filter and an aggressive reservation strategy for data burst length prediction and resource reservation, respectively, and is extended to facilitate Quality of Service (QoS) differentiation at network edges. The FRR scheme improves the real-time communication services for applications with time constraints without deleterious system costs. The aggressive strategy for channel holding time reservations is proposed. Specifically, two algorithms, the success probability-driven (SPD) and the bandwidth usage-driven (BUD) ones, are proposed for resource reservations in the FRR-enabled scheme. These algorithms render explicit control on the latency reduction improvement and bandwidth usage efficiency, respectively, both of which are important figures of performance metrics. The optimization issue for the FRR-enabled system is studied based on two disciplines&mdash;addressing the static and dynamic models targeting different desired objectives (in terms of algorithm efficiency and system performance), and developing a &ldquo;crank back&rdquo; based signaling mechanism to provide bandwidth usage efficiency. (Abstract shortened by UMI.)
Design of a Minimal Interface for two-way strategic information flow for urban operations
Authors: James Cross, Chris Baber, Robert J. Houghton
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

In the field, a wearable computer could have the ability to act as a communications hub in addition to displaying live, shared strategic information for a particular operation. Using a wearable in the field without having a negative effect on the user is a significant and interesting challenge that is shared by many application areas of wearable technologies. In this work we identify. "Minimal Interface" requirements, and present ideas, such as the use of pie menus, to try and develop a simple interface that can be used with only three buttons, enhancing and reducing the burden on limited communication channels.
Dynamic Routing of Reliability-Differentiated Connections in WDM Optical Networks
Authors: Peng Ma, Luying Zhou, Gurusamy Mohan
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Protection schemes for WDM mesh networks are typically based on the single-failure scenario. However, the single-failure model is not realistic since the failure of network components is probabilistic. On the other hand, different applications or end users need different levels of fault tolerance. In this work, we assume a probabilistic failure environment and choose the connection reliability as a parameter to denote the level of fault tolerance. We propose a partial segment-based protection approach to accommodate lightpath requests according to their differentiated reliability requirements. We also consider incorporating backup sharing in such an environment. We conduct extensive simulation experiments to evaluate the effectiveness of the proposed scheme. Simulation results show that establishing connections according to their differentiated reliability requirements can effectively improve network blocking performance and the proposed partial segment-based protection scheme outperforms the partial path-based protection scheme proposed in the literature in terms of connection blocking probability.
Error Estimation and Control for ODEs
Authors: L. F. Shampine
Venue: Journal of Scientific Computing (2005)

This article is about the numerical solution of initial value problems for systems of ordinary differential equations. At first these problems were solved with a fixed method and constant step size, but nowadays the general-purpose codes vary the step size, and possibly the method, as the integration proceeds. Estimating and controlling some measure of error by variation of step size/method inspires some confidence in the numerical solution and makes possible the solution of hard problems. Common ways of doing this are explained briefly in the article
Identification of Gates for Covering all Critical Paths
Authors: M. Moiz Khan, Spyros Tragoudas, Magdy Abadir, Brandon Liu
Venue: Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (2004)

A Zero-Suppressed Binary Decision Diagram (ZBDD) based method is presented to identify a small set of gates so that every critical path contains at least one of the selected gates. All paths above a threshold Dth are stored in a ZBDD. Static implications are used to eliminate unsensitizable paths. A min-cut method on the ZBDD is then used to identify a small set of gates in the circuit for buffer insertion or resizing to optimize delay of the whole circuit. It is observed that the methodology identifies a very small set of gates and its effectiveness demonstrated experimentally on ISCAS'85 and ITC'99 benchmarks.
Validation: the bottleneck in system simulation
Authors: Gordon D. Edgecomb, Richard J. Thompson
Venue: ACM SIGSIM Simulation Digest (1976)

In simulation exercises some degree of validation is necessary in order to create confidence in the results obtained. Experienced users of generalized simulation software and commercially available simulation tools often find that the majority of their simulation efforts are localized in the validation cycle. Discussed in this paper are some of the factors which have caused the validation process to become more complicated and more time consuming. This paper also summarizes the major problems with simulating complex computer systems and suggests some basic requirements and design philosophies for new simulation packages.
Average Number of Frequent (Closed) Patterns in Bernouilli and Markovian Databases
Authors: Francois Rioult, Arnaud Soulet
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In data mining, enumerate the frequent or the closed patterns is often the first difficult task leading to the association rules discovery. The number of these patterns represents a great interest. The lower bound is known to be constant whereas the upper bound is exponential, but both situations correspond to pathological cases. For the first time, we give an average analysis of the number of frequent or closed patterns. Average analysis is often closer to real situations and gives more information about the role of the parameters. In this paper, two probabilistic models are studied: a BERNOULLI and a MARKOVIAN. In both models and for large databases, we prove that the number of frequent patterns, for a fixed frequency threshold , is exponential in the number of items and polynomial in the number of transactions. On the other hand, for a proportional frequency threshold , the number of frequent patterns is polynomial in the number of items and does not involve the number of transactions. Finally, we prove in the BERNOULLI model that the number of closed patterns, for a proportional frequency threshold, is polynomial in the number of items.