ppxscal/embedding_network huggingface dataset:
VPM tokens: virtual machine-aware power budgeting in datacenters
Authors: Ripal Nathuji, Karsten Schwan, Ankit Somani, Yogendra Joshi
Venue: Cluster Computing (2009)

Power consumption and cooling overheads are becoming increasingly significant for enterprise datacenters, affecting overall costs and the ability to extend resource capacities. To help mitigate these issues, active power management technologies are being deployed aggressively, including power budgeting, which enables improved power provisioning and can address critical periods when power delivery or cooling capabilities are temporarily reduced. Given the use of virtualization to encapsulate application components into virtual machines (VMs), however, such power management capabilities must address the interplay between budgeting physical resources and the performance of the virtual machines used to run these applications. This paper proposes a set of management components and abstractions for use by software power budgeting policies. The key idea is to manage power from a VM-centric point of view, where the goal is to be aware of global utility tradeoffs between different virtual machines (and their applications) when maintaining power constraints for the physical hardware on which they run. Our approach to VM-aware power budgeting uses multiple distributed managers integrated into the VirtualPower Management (VPM) framework whose actions are coordinated via a new abstraction, termed VPM tokens. An implementation with the Xen hypervisor illustrates technical benefits of VPM tokens that include up to 43% improvements in global utility, highlighting the ability to dynamically improve cluster performance while still meeting power budgets. We also demonstrate how VirtualPower based budgeting technologies can be leveraged to improve datacenter efficiency in the context of cooling infrastructure management.
Estimating Mean Frequency for Narrowband Lowpass Signals by Pisarenko Harmonic Decomposition
Authors: Lu Ruihua, Liu Guangyuan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

This paper presents a mean frequency estimation method for narrowband lowpass signals. The fundamental idea of this method is that the single frequency approximation for a narrowband lowpass signal embedded in white noise usingPisarenko harmonic decomposition (PHD) algorithm is approximately the power-weighted mean frequency of the signal. In this method, Fourier transform as an indispensable processing link in the conventional power spectrum estimation is given up as well as the convolution effects between the real frequency spectrum and the frequency spectrum of data intercepting window function caused by limited data length are excluded. Experimental results show that the PHD method outperforms the commonly used mean frequency estimation method based on Fourier transform
A specification paradigm for the design and implementation of tangible user interfaces
Authors: Orit Shaer, Robert J.K. Jacob
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2009)

Tangible interaction shows promise to significantly enhance computer-mediated support for activities such as learning, problem solving, and design. However, tangible user interfaces are currently considered challenging to design and build. Designers and developers of these interfaces encounter several conceptual, methodological, and technical difficulties. Among others, these challenges include: the lack of appropriate interaction abstractions, the shortcomings of current user interface software tools to address continuous and parallel interactions, as well as the excessive effort required to integrate novel input and output technologies. To address these challenges, we propose a specification paradigm for designing and implementing Tangible User Interfaces (TUIs), that enables TUI developers to specify the structure and behavior of a tangible user interface using high-level constructs which abstract away implementation details. An important benefit of this approach, which is based on User Interface Description Language (UIDL) research, is that these specifications could be automatically or semi-automatically converted into concrete TUI implementations. In addition, such specifications could serve as a common ground for investigating both design and implementation concerns by TUI developers from different disciplines. Thus, the primary contribution of this article is a high-level UIDL that provides developers from different disciplines means for effectively specifying, discussing, and programming a broad range of tangible user interfaces. There are three distinct elements to this contribution: a visual specification technique that is based on Statecharts and Petri nets, an XML-compliant language that extends this visual specification technique, as well as a proof-of-concept prototype of a Tangible User Interface Management System (TUIMS) that semi-automatically translates high-level specifications into a program controlling specific target technologies.
A 32-bit Decimal Floating-Point Logarithmic Converter
Authors: Dongdong Chen, Yu Zhang, Younhee Choi, Moon Ho Lee, Seok-Bum Ko
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

This paper presents a new design and implementation of a 32-bit decimal floating-point (DFP) logarithmic converter based on the digit-recurrence algorithm. The converter can calculate accurate logarithms of 32-bit DFP numbers which are defined in the IEEE 754-2008 standard. Redundant digit e1 is obtained by look-up table in the first iteration and the rest redundant digits ej are selected by rounding the scaled remainder during the succeeding iterations. The sequential architecture of the proposed 32-bit DFP logarithmic converter is implemented on Xilinx Virtex-II Pro P30 FPGA device and then synthesized with TMSC 0.18-um standard cell library. The implementation results indicate that the maximum frequency of the proposed architecture is 47.7 MHz in FPGA and 107.9 MHz in TMSC 0.18-um technology. The faithful 32-bit DFP logarithm results can be obtained in 18 cycles.
Illumination Chromaticity Estimation Based on Dichromatic Reflection Model and Imperfect Segmentation
Authors: Johji Tajima
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

The illumination chromaticity estimation based on the dichromatic reflection model has not been made practicable, since the method needs image segmentation beforehand. However, its two-dimensional model is sufficiently robust, when it is combined with the least square method. The proposed algorithm executes the color space division instead of the segmentation. The original image is divided into small color regions, each of which corresponds to one of color sub-spaces. Though this division is imperfect image segmentation, the illumination chromaticity estimation based on the chromaticity distribution in the color regions is possible. Experimental result shows that this method is also applicable to images of apparently matt surfaces.
Towards a Framework for the Development of Adaptive Multimodal User Interfaces for Ambient Assisted Living Environments
Authors: Marco Blumendorf, Sahin Albayrak
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

In this paper we analyse the requirements and challenges ambient assisted living and smart environments pose on interactive systems. We present a framework for the provisioning of user interfaces for such environments. The framework incorporates model-based user interface development technologies to create a runtime system that manages interaction resources and context information to adapt interaction. This approach allows the creation of adaptive and multimodal interactive ambient assisted living applications.
Underwater Acoustic Networks - Survey on Communication Challenges with Transmission Simulations
Authors: Håkon Riksfjord, Ole Trygve Haug, Jens M. Hovem
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Underwater sensor networks may be used in many underwater applications and some of these applications may transmit large amounts of data. Underwater acoustic communication is limited by several physical factors affecting communication. Time spread caused by multipath effects and frequency selective fading are major concerns.The choice of modulation technique is important. Due to the high data rate required in network applications coherent modulation techniques should be considered. In the choice of multiple access method Code Division Multiple Access is considered the most promising technique because of its robustness and resistance against frequency selective fading. Also by using a Rake receiver multipath arrivals can coherently be combined.To get an idea of multipath effects for different propagation conditions the acoustic modeling program EasyPLR is used. Sound speed profiles from different seasons of 2005 are implemented to display the seasonal variations. The results indicate multipath effects and time spread for all seasons at short range. For ranges up to 3 km time spread is kept at tens of micro seconds.
DiagSplit: parallel, crack-free, adaptive tessellation for micropolygon rendering
Authors: Matthew Fisher, Kayvon Fatahalian, Solomon Boulos, Kurt Akeley, William R. Mark, Pat Hanrahan
Venue: ACM Transactions on Graphics (TOG) (2009)

We present DiagSplit, a parallel algorithm for adaptively tessellating displaced parametric surfaces into high-quality, crack-free micropolygon meshes. DiagSplit modifies the split-dice tessellation algorithm to allow splits along non-isoparametric directions in the surface's parametric domain, and uses a dicing scheme that supports unique tessellation factors for each subpatch edge. Edge tessellation factors are computed using only information local to subpatch edges. These modifications allow all subpatches generated by DiagSplit to be processed independently without introducing T-junctions or mesh cracks and without incurring the tessellation overhead of binary dicing. We demonstrate that DiagSplit produces output that is better (in terms of image quality and number of micropolygons produced) than existing parallel tessellation schemes, and as good as highly adaptive split-dice implementations that are less amenable to parallelization.
Video-Based Human Motion Estimation System
Authors: Mariofanna Milanova, Leonardo Bocchi
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

This paper presents the system designed to estimate body silhouette representation from sequences of images. The accuracy of human motion estimation can be improved by increasing the complexity of any of the three fundamental building blocks: the measured data, the prior model, or the optimization method. The vast majority of existing literature on human motion estimation has focused on just one of these building blocks: improving the methods for optimization, also called inference. In contrast, our approach seeks to explore the hypothesis that the other two building blocks are critical components, using extremely high accuracy measured data and shape of body motion priors, so that the objective function is more precise and less noisy, resulting in an easier solution. Our main goal is to develop a new module for extracting accuracy measured data from video imagery.
Speaking more like you: lexical, acoustic/prosodic, and discourse entrainment in spoken dialogue systems
Authors: Julia Hirschberg
Venue: Proceedings of the 9th SIGdial Workshop on Discourse and Dialogue (2008)

When people engage in conversation, they adapt the way they speak to the speaking style of their conversational partner in a variety of ways. For example, they may adopt a certain way of describing something based upon the way their conversational partner describes it, or adapt their pitch range or speaking rate to a conversational partner's. They may even align their turn-taking style or use of cue phrases to match their partner's. These types of entrainment have been shown to correlate with various measures of task success and dialogue naturalness. While there is considerable evidence for lexical entrainment from laboratory experiments, much less is known about other types of acoustic-prosodic and discourse-level entrainment and little work has been done to examine entrainments in multiple modalities for the same dialogue. We will discuss work on entrainment in multiple dimensions in the Columbia Games Corpus. Our goal is to understand how the different varieties of entrainment correlate with one another and to determine which types of entrainment will be both useful and feasible for Spoken Dialogue Systems.
Fault diagnosis and test of DNA sensor arrays by using IFA approach
Authors: Daniela De Venuto, Bruno Riccò
Venue: Microelectronics Journal (2009)

This paper presents a fault analysis applied to a novel optical, label-free sensors array for DNA detection. The inductive fault analysis approach to extract and model the possible defects has been used. A critical equivalent resistance for the possible faults has been defined and it allowed defining the threshold values of current to discriminate the occurrence of the failures mechanisms. Particularly critical is the shorts occurrence: in this failure mode the current changes can generate a wrong information that can be confused with the current reduction due to DNA detection. At the end a test strategy for structural test is proposed.
TOA Estimate Algorithm Based UWB Location
Authors: Xu Yubin, Jiang Weilin, Sha Xuejun
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Combining with UWB location technology, TOA location algorithm is presented. The first step is statistically averaging the received signals to mitigate impact of AWGN as long as possible. Using incoherent power detection algorithm obtain rude TOA estimation which is made incoherent power detection once more in the second step so as to further optimize in time. The simulation results show that the algorithm under low computational complexity can effectively improve ranging performance and location precision.
Examination of Evaluation Method for Appearance Similarity of PTP Sheets
Authors: Yoshitaka Ootsuki, Akira Izumiya, Michiko Ohkura, Fumito Tsuchiya
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

In recent years, many accidents concerned with medicine have been caused by the confusing design of pharmaceutical packages and displays. We concentrate on the appearance similarity of PTP sheets, which are most commonly used for wrapping tablets in Japan, to clarify the factors and the degrees of their effects on appearance similarity. This paper describes our experiments that examined evaluation methods of the appearance similarity of PTP sheets.
Increasing Reuse in Component Models through Genericity
Authors: Julien Bigot, Christian Pérez
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

A current limitation to component reusability is that component models target to describe a deployed assembly and thus bind the behavior of a component to the data-types it manipulates. This paper studies the feasibility of supporting genericity within component models, including component and port types. The proposed approach works by extending the meta-model of an existing component model. It is applied to the SCA component model; a working prototype shows its feasibility.
Japan's Arcade Games and Their Technology
Authors: Yukiharu Sambe
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

The Japanese computer entertainment market is $20 billion in size. Of that, the arcade market makes up the biggest share of revenue ($6 billion), with the home market and mobile phone market following at $3.5 billion and $2 billion, respectively. Abroad, however, home console gaming dominates and revenues from arcades make up only a small portion of the total market. In this session, I will introduce the arcade machines and supporting technology, discuss reasons for the enduring widespread popularity of arcade gaming in Japan, and explore potential directions for the future of arcade technology .The Author. 1979 Joined Taito Corporation. Worked in the field of arcade machine research and development. 1992 Invented network karaoke (via server client karaoke machines), transforming the service into a viable business. 1995 Established the home network karaoke business. 1995 Promoted to Executive Director. 1999 Founded TAITO's mobile content business. 2004 Assigned as Senior Executive Director. 2006 Created TAITO's Key Technology Research Center R D Division for new business 2007 Named TAITO's Chief Technology Officer (after resigning as Senior Executive Director).Awards. 1993: Nihon Keizai Shimbun: Recognition for establishing the network karaoke business. 1995: Nihon Keizai Shimbun: Recognition for contributions to the home network karaoke business. Member of The Institution of Professional Engineers, Japan Technology Committee Member of CESA (Computer Entertainment Supplier's Association) The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Inexact Parallel Relaxed Multisplitting Algorithm for Linear Complementarity Problem
Authors: Banxiang Duan, Xiaoping Zhu, Jiaoyu Wu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

In this paper, the authors ﬁrst set up the inexact parallel relaxed multisplitting Algorithm for solving the linear complementarity problems, which is based on the inexact splitting method, parallel computation and the multisplitting method. This new Algorithm provides a speciﬁc realization for the multisplitting method and generalizes many existing matrix splitting methods for linear complementarity problems. And then, the global convergence theory of this new Algorithm is proved when the coefﬁcient matrix is an H−matrix with positive diagonal elements. Last, a speciﬁc iteration form for this inexact multisplitting Algorithm is presented, where the inner iterations are implemented through a matrix splitting method. Convergence properties for this speciﬁc form are analyzed.
Negative binomial mixed models for analysis of stuttering rates
Authors: Mark Jones, Annette Dobson, Mark Onslow, Brenda Carey
Venue: Computational Statistics Data Analysis (2009)

Stuttering involves disruptions to normal verbal behavior. The rate that these disruptions occur within individuals who stutter varies across time and also with speaking situation. Therefore multiple samples of speech are commonly taken from individuals, in an attempt to obtain a realistic estimate of the severity of their condition. Stuttering rates are commonly reported as the proportion of syllables stuttered. Traditionally, general linear models have been used to analyze and compare stuttering rates. However, the distribution of this type of data is not normal, the duration of the individual speech samples is not usually taken into account, and repeated measurements on individuals are often aggregated prior to analysis. We propose that these issues can be resolved by using a negative binomial mixed model approach. In this paper, we argue why this is sensible and then show that the model is practical to implement, drawing on data from two randomized controlled trials of interventions for treatment of stuttering. We also show how to estimate sample size for our proposed model based on a negative binomial distribution.
Provisioning heterogeneous and unreliable providers for service workftows
Authors: Sebastian Stein, Nicholas R. Jennings, Terry R. Payne
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Service-oriented technologies enable software agents to dynamically discover and provision remote services for their workflows. Current work has typically assumed these services to be reliable and deterministic, but this is unrealistic in open systems, such as the Web, where they are offered by autonomous agents and are, therefore, inherently unreliable. To address this potential unreliability (in particular, uncertain service durations and failures), we consider the provisioning of abstract workflows, where many heterogeneous providers offer services at differing levels of quality. More specifically, we show that service provisioning is NP-hard, and then devise two heuristic strategies that use service redundancy in a flexible manner to address uncertainty and failure. In empirical experiments, we show that these heuristic strategies can achieve significant improvements over standard approaches in a wide range of environments.
Data Mining Technology and Its Application in CRM of Commercial Banks
Authors: Bin Fang, Shoufeng Ma
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

CRM is an innovative marketing strategy centered on customer and a comprehensive management and technological method. The application of Data Mining (DW) technology in CRM plays an important role in improving the level and efficiency of CRM in commercial banks. This paper mainly introduces structures of CRM in commercial banks and DM technology, and emphasizes the application of DM technology in the CRM of the commercial bank and finally discusses some key problems related to this application of DM in the CRM.
EventJava: An Extension of Java for Event Correlation
Authors: Patrick Eugster, K. R. Jayaram
Venue: Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming (2009)

Event correlation has become the cornerstone of many reactive applications, particularly in distributed systems. However, support for programming with complex events is still rather specific and rudimentary. This paper presents EventJava, an extension of Java with generic support for event-based distributed programming. EventJava seamlessly integrates events with methods, and broadcasting with unicasting of events; it supports reactions to combinations of events, and predicates guarding those reactions. EventJava is implemented as a framework to allow for customization of event semantics, matching, and dispatching. We present its implementation, based on a compiler transforming specific primitives to Java, along with a reference implementation of the framework. We discuss ordering properties of EventJava through a formalization of its core as an extension of Featherweight Java. In a performance evaluation, we show that EventJava compares favorably to a highly tuned database-backed event correlation engine as well as to a comparably lightweight concurrency mechanism.
A Particle Swarm Optimization Algorithm with Crossover for Resource Constrained Project Scheduling Problem
Authors: Ming Li, Yuanbiao Zhang, Weigang Jiang, Jianwen Xie
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Resource and project optimization scheduling has become the key of the success of researching project in the enterprises. In order to solve the mass resource constrained project scheduling problem, in this paper, an improved particle swarm algorithm (PSO) called particle swarm algorithm with crossover (CPSO) was presented. This improved algorithm is based on PSO and genetic algorithm (GA). Through comparing with SPSO and GA on RCPSP, it is indicated that CPSO not only avoids premature convergence to a high degree, but also keeps a faster convergence rate than SPSO and GA.