ppxscal/embedding_network huggingface dataset:
On a Pitch Alteration for Speech Synthesis Systems
Authors: Jongkuk Kim, Hernsoo Hahn, Uei-Joong Yoon, Myungjin Bae
Venue: Wireless Personal Communications: An International Journal (2009)

Speech synthesis can be classified into waveform coding, source coding, or hybrid coding by the synthesis method. Among these, waveform coding is especially suitable for high-quality speech synthesis. However, synthesis techniques using syllable or phoneme unit is not desirable since it fails to separate the excitation and the formant part to handle speech. Therefore, there is a need for a pitch alteration method to apply in synthesis using waveform coding. This study proposes a pitch alteration method that uses spectrum scaling after flattening the spectra by a sub-band linear approximation to minimize the spectrum distortion. A comparison with LPC (Linear Predictive Coding), Cepstrum and lifter function is presented to show the better performance of the proposed method. Estimation method seeks each of the distributions of the flattened signal and measures the degree of the flattened spectrum Signal, which is normalized, so the highest point amounts to zero, and the distribution of the signal, whose average is zero, is calculated. The results are presented by the spectrum distortion rate to estimate the performance of the proposed method. The average spectrum distortion rate kept below the average 2.12%, showing the proposed method's superiority in comparison with the other existing approaches.
Policy Processing: Don't Take it for Granted
Authors: Joseane Fidalgo, Carlos Kamienski, Ramide Dantas, Djamel Sadok, Börje Ohlman
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

The new advanced services and limitations of current Internet have driven a lot of initiatives in architectures for Future Internet. Ambient Networks is one of these initiatives, focused in providing a seamless cooperation of resources in an environment with a multitude of access technologies, network operators and business actors. There are many efforts using Policy based Management as a practical solution for addressing the challenges for the management of Future Internet such as cross-domain management, integration and manipulation of data across the world, seamless mobility, reliability, performance and heterogeneity support. However, not much attention has been given to the policy processing itself. In this paper we present our policy processing system, currently used in the PBMAN project, a policy based management architecture and prototype for Ambient Networks. The primary contribution of this paper is to give real attention to the components of policy systems that can determine its performance as well as its successful adoption.
PSMalloc: content based memory management for MPI applications
Authors: Susmit Biswas, Diana Franklin, Timothy Sherwood, Frederic T. Chong, Bronis R. de Supinski, Martin Schulz
Venue: Proceedings of the 10th MEDEA workshop on MEmory performance: DEaling with Applications, systems and architecture (2009)

Multicore processors have come to dominate the commodity market upon which many large scale systems are based. The number of cores is increasing with the speed of Moore's law and as a direct consequence, the memory available per core is decreasing, often severely limiting the problem size for programs running on such platforms. Thus, mechanisms to store memory efficiently in DRAM, increasing the effective capacity of DRAM, in a way that requires no reprogramming, would dramatically increase the benefits of multicore nodes for large scale systems. We observe that MPI programs replicate a significant amount of data across all processes. With multiple MPI tasks running on a single node, this replication leads to identical data residing in multiple locations in that node's DRAM, an ideal candidate for potential savings. We have found that most of the redundant data resides in the heap. Thus, smart memory allocation can remove this redundancy and increase the effective memory capacity. We present PSMalloc, a memory allocation library that keeps a single copy of identical pages from a set of MPI tasks. PSMalloc is implemented as a user level library that can be linked at runtime, avoiding changes in the application or the operating system. To the best of our knowledge, our work is the first that reduces physical memory footprints of MPI tasks in a multicore node without requiring kernel level modifications. We experiment with four MPI applications from the ASC Sequoia benchmark suite and show that we can achieve a reduction in memory footprint up to 22% and 11.18% in average.
Automatic Discovery and Quantification of Information Leaks
Authors: Michael Backes, Boris Kopf, Andrey Rybalchenko
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

Information-flow analysis is a powerful technique for reasoning about the sensitive information exposed by a program during its execution. We present the first automatic method for information-flow analysis that discovers what information is leaked and computes its comprehensive quantitative interpretation. The leaked information is characterized by an equivalence relation on secret artifacts, and is represented by a logical assertion over the corresponding program variables. Our measurement procedure computes the number of discovered equivalence classes and their sizes. This provides a basis for computing a set of quantitative properties, which includes all established information-theoretic measures in quantitative information-flow. Our method exploits an inherent connection between formal models of qualitative information-flow and program verification techniques.We provide an implementation of our method that builds upon existing tools for program verification and information-theoretic analysis. Our experimental evaluation indicates the practical applicability of the presented method.
Classification of Physical Interactions between Two Subjects
Authors: Ruzena Bajcsy, Alessandro Borri, Maria Domenica Di Benedetto, Annarita Giani, Claire Tomlin
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

This work addresses the problem of detecting and classifying the interaction between two subjects. While the use of Wireless Sensor Networks (WSN) for human action detection has been widely investigated, the use of this technology for detecting actions that involve multiple subjects has not been explored yet. We explain what we mean for interaction between subjects and we also give the motivation behind this research. Our approach is then presented wherein we perform classification in a particular case study.
On Polygons Enclosing Point Sets II
Authors: F. Hurtado, C. Merino, D. Oliveros, T. Sakai, J. Urrutia, I. Ventura
Venue: Graphs and Combinatorics (2009)

Let R and B be disjoint point sets such that R &#x222a; B is in general position. We say that B encloses by R if there is a simple polygon P with vertex set B such that all the elements in R belong to the interior of P. In this paper we prove that if the vertices of the convex hull of R &#x222a; B belong to B, and |R| &#x2264;&#x00a0;|Conv(B)|&#x00a0;&#x2212;&#x00a0;1 then B encloses R. The bound is tight. This improves on results of a previous paper in which it was proved that if |R| &#x2264; 56 |Conv(B)| then B encloses R. To obtain our result we prove the next result which is interesting on its own right: Let P be a convex polygon with n vertices p 1 , ... , p n and S a set of m points contained in the interior of P, m &#x2264; n&#x00a0;&#x2212;&#x00a0;1. Then there is a convex decomposition {P 1 , ... , P n } of P such that all points from S lie on the boundaries of P 1 , ... , P n , and each P i contains a whole edge of P on its boundary.
The Real Citrix CCA Exam Preparation Kit: Prepare for XenApp 5.0
Authors: Shawn Tooley
Venue:  (2009)

The Citrix Certified Administrator (CCA) credential is the first tier of Citrix certification. The CCA is most often sought out by IT professionals whose networks employ Citrix virtualization technology, and for those IT professionals who are seeking a broad base of general network expertise. The number of CCAs is estimated at between 65 and 70K, up from 45,000 in 2003. Citrix recently released a new version of its most popular product, XenApp (formerly Presentation Server). This new version is fully compatible with Windows Server 2008. To retain their CCA credential, all current CCAs will need to upgrade to the new software. This will be particularly important to those companies enrolled in Citrix partner programs, as current certification is a requirement of the program. When packaged with practice exams, this prep kit will offer an affordable, effective solution for CCA certification and re-certification. *Complete exam-prep package includes full coverage of new XenApp 5.0 objectives*Authored by a Citrix expert with hundreds of implementations to his credit*This preparation kit can also be used as a reference guide for administrators who need to integrate XenApp 5.0 with their networks 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
Affordance Conditions of Product Parts in User-Product Interaction
Authors: Li-Hao Chen, Chang-Franw Lee, Sy-Gia Kiong
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

The purpose of this study is to identify the influences of affordance conditions, both perceptible and hidden affordances, in product interfaces on user-product interactions. An analysis scheme was used to analysis the affordance conditions of a digital camera's parts used as example. Moreover, a usability evaluation was carried out to examine what affordance conditions would influence users' operations while they practiced the operational tasks. The results show that affordances for functionality should not only be perceptible, but more importantly, also should be lucid for users in user-product interactions; the evidence presented by other comprehensive perceptual information and conventional layouts can deal with affordances being hidden in interfaces of a product.
Applying a Web and Simulation-Based System for Adaptive Competence Assessment of Spinal Anaesthesia
Authors: Cord Hockemeyer, Alexander Nussbaumer, Erik Lövquist, Annette Aboulafia, Dorothy Breen, George Shorten, Dietrich Albert
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

The authors present an approach for implementing a system for the assessment of medical competences using a haptic simulation device. Based on Competence based Knowledge Space Theory (CbKST), information on the learners' competences is gathered from different sources (test questions, data from the simulator, and supervising experts' assessments).The envisaged architecture consists of three core modules, an LMS (Moodle) containing user model and content objects and realising the interface between system and user, a simulator interface as an own service connecting the LMS to the (external) simulator system, and a CbKST service offering the assessment logic and visualisations of the assessment result for learner and teacher.
Learning to transform natural to formal languages
Authors: Rohit J. Kate, Yuk Wah Wong, Raymond J. Mooney
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

This paper presents a method for inducing transformation rules that map natural-language sentences into a formal query or command language. The approach assumes a formal grammar for the target representation language and learns transformation rules that exploit the non-terminal symbols in this grammar. The learned transformation rules incrementally map a natural-language sentence or its syntactic parse tree into a parse-tree for the target formal language. Experimental results are presented for two corpora. one which maps English instructions into an existing formal coaching language for simulated RoboCup soccer agents, and another which maps English U.S.-geography questions into a database query language. We show that our method performs overall better and faster than previous approaches in both domains.
Anonymity and Historical-Anonymity in Location-Based Services
Authors: Claudio Bettini, Sergio Mascetti, X. Sean Wang, Dario Freni, Sushil Jajodia
Venue: Privacy in Location-Based Applications: Research Issues and Emerging Trends (2009)

The problem of protecting user's privacy in Location-Based Services (LBS) has been extensively studied recently and several defense techniques have been proposed. In this contribution, we first present a categorization of privacy attacks and related defenses. Then, we consider the class of defense techniques that aim at providing privacy through anonymity and in particular algorithms achieving "historical k- anonymity" in the case of the adversary obtaining a trace of requests recognized as being issued by the same (anonymous) user. Finally, we investigate the issues involved in the experimental evaluation of anonymity based defense techniques; we show that user movement simulations based on mostly random movements can lead to overestimate the privacy protection in some cases and to overprotective techniques in other cases. The above results are obtained by comparison to a more realistic simulation with an agent-based simulator, considering a specific deployment scenario.
Torbit: Design of an open source security flaw measurement suite
Authors: Robert S. Fourney, Austin D. Hanson
Venue: Journal of Computational Methods in Sciences and Engineering (2009)

We present our experience in developing an open source tool for the measurement of security flaws. Since security flaws result from the unauthorized flow of information, our tool shows how these flaws can be measured and compared based on the amount of information that flows, how "far" it flows, and the value of the information. Flaws can then be compared and careful security testers can maximize the amount of security for a limited set of resources. The development of a tool to partially automate this process will prove to be an asset to the open source community in that the "many eyes" can be directed and these resources prioritized in order to patch flaws in the most efficient manner and minimize downtime and risk.
Quadratic spline quasi-interpolants and collocation methods
Authors: Françoise Foucher, Paul Sablonnière
Venue: Mathematics and Computers in Simulation (2009)

Univariate and multivariate quadratic spline quasi-interpolants provide interesting approximation formulas for derivatives of approximated functions that can be very accurate at some points thanks to the superconvergence properties of these operators. Moreover, they also give rise to good global approximations of derivatives on the whole domain of definition. From these results, some collocation methods are deduced for the solution of ordinary or partial differential equations with boundary conditions. Their convergence properties are illustrated and compared with finite difference methods on some numerical examples of elliptic boundary value problems.
Introduction
Authors: Gerd Kortuem, Henk Eertink, Christian Prehofer, Martin Strohbach
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The convergence of wireless networks with mobile devices and embedded sensing technologies has a tremendous impact on how to model, develop and evaluate computer and software systems. Consequently, new computing and system models such as context-aware computing, spatially-aware computing and physically-embedded computing are supplementing or replacing traditional notions of distributed and parallel computing. This topic explores fundamental and practical research questions related to these emerging concepts and mobile and ubiquitous computing in general. This topic is new in the scope of the EuroPar series of conferences. It attracted 4 submissions, of which one was accepted, reflecting a 25% acceptance rate. This particular paper is quite representative for the ubiquitous computing area: it presents solutions for (near) optimal broadcasting, focusing on energy-efficiency in particular. This is very important for battery-powered wireless sensor networks, where broadcasting is the main communication mechanism, and energy efficiency is the key deployment requirement.
An Efficient Topology Control and Dynamic Interval Scheduling Scheme for 6LoWPAN
Authors: Sun-Min Hwang, Eui-Nam Huh
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

This paper introduces a novel interval scheduling and efficient topology control scheme in wireless sensor networks for long-term periodical monitoring applications. Due to the unreliable nature of wireless communication, it is essential to design a new management system and efficient scheduling algorithm for such networks, as to achieve network energy efficiency, reliability, and timeliness. In this paper, we introduce the concept of dynamic interval scheduling algorithm that optimizes the data delivery ratio and communication energy consumption. And also we propose an efficient scheme of sensor network management on 6LoWPAN by considering the property of the event-driven WSN.
Deep grammars in a tree labeling approach to syntax-based statistical machine translation
Authors: Mark Hopkins, Jonas Kuhn
Venue: Proceedings of the Workshop on Deep Linguistic Processing (2007)

In this paper, we propose a new syntaxbased machine translation (MT) approach based on reducing the MT task to a tree-labeling task, which is further decomposed into a sequence of simple decisions for which discriminative classifiers can be trained. The approach is very flexible and we believe that it is particularly well-suited for exploiting the linguistic knowledge encoded in deep grammars whenever possible, while at the same time taking advantage of data-based techniques that have proven a powerful basis for MT, as recent advances in statistical MT show. A full system using the Lexical-Functional Grammar (LFG) parsing system XLE and the grammars from the Parallel Grammar development project (ParGram; (Butt et al., 2002)) has been implemented, and we present preliminary results on English-to-German translation with a tree-labeling system trained on a small subsection of the Europarl corpus.
Efficient Universal Quantum Circuits
Authors: Debajyoti Bera, Stephen Fenner, Frederic Green, Steve Homer
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central quantum circuit classes and used to capture the computational power of the simulated class. For depth we construct universal circuits whose depth is the same order as the circuits being simulated. For size, there is a log factor blow-up in the universal circuits constructed here which is nearly optimal for polynomial size circuits.
An introduction to inductive programming
Authors: Pierre Flener, Ute Schmid
Venue: Artificial Intelligence Review (2008)

The research field of inductive programming is concerned with the design of algorithms for learning computer programs with complex flow of control (typically recursive calls) from incomplete specifications such as examples. We introduce a basic algorithmic approach for inductive programming and illustrate it with three systems: dialogs learns logic programs by combining inductive and abductive reasoning; the classical thesys system and its extension igor1 learn functional programs based on a recurrence detection mechanism in traces; igor2 learns functional programs over algebraic data-types making use of constructor-term rewriting systems. Furthermore, we give a short history of inductive programming, discuss related approaches, and give hints about current applications and possible future directions of research.
Modular resource development and diagnostic evaluation framework for fast NLP system improvement
Authors: Gaël de Chalendar, Damien Nouvel
Venue: Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2009)

Natural Language Processing systems are large-scale softwares, whose development involves many man-years of work, in terms of both coding and resource development. Given a dictionary of 110k lemmas, a few hundred syntactic analysis rules, 20k ngrams matrices and other resources, what will be the impact on a syntactic analyzer of adding a new possible category to a given verb? What will be the consequences of a new syntactic rules addition? Any modification may imply, besides what was expected, unforeseeable side-effects and the complexity of the system makes it difficult to guess the overall impact of even small changes. We present here a framework designed to effectively and iteratively improve the accuracy of our linguistic analyzer LIMA by iterative refinements of its linguistic resources. These improvements are continuously assessed by evaluating the analyzer performance against a reference corpus. Our first results show that this framework is really helpful towards this goal.
The automated text adaptation tool
Authors: Jill Burstein, Jane Shore, John Sabatini, Yong-Won Lee, Matthew Ventura
Venue: Proceedings of Human Language Technologies: The Annual Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations on XX (2007)

Text adaptation is a teacher practice used to help with reading comprehension and English language skills development for English language learners (ELLs) (Carlo, August, McLaughlin, Snow, Dressler, Lippman, Lively, & White, 2004; Echevarria, Vogt and Short, 2004; Yano, Long and Ross, 1994). The practice of text adaptation involves a teacher's modification of texts to make them more understandable, given a student's reading level. Teacher adaptations include text summaries, vocabulary support (e.g., providing synonyms), and translation. It is a time-consuming, but critical practice for K-12 teachers who teach ELLs, since reading-level appropriate texts are often hard to find. To this end, we have implemented the Automated Text Adaptation Tool v. 1.0 (ATA v. 1.0): an innovative, educational tool that automatically generates text adaptations similar to those teachers might create. We have also completed a teacher pilot study. Schwarm and Ostendorf (2005), and Heilman, Collins-Thompson, Callan, and Eskenazi (2006) describe related research addressing the development of NLP-based reading support tools.