ppxscal/embedding_network huggingface dataset:
An RNN-based algorithm to detect prosodic phrase for Chinese TTS
Authors: Zhiwei Ying
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The goal of the work presented here is to automatically predict the prosodic phrase boundaries from the text for Chinese TTS (text-to-speech) by using the trigram of the POS (part-of-speech) with information of the breaks between the prior two word-pairs by using a RNN (recurrent neural network). Prosodic phrase boundaries are very important to a Chinese TTS system because they will influence the prosodic model for speech synthesis. In this paper, the algorithm tries to use RNN to find some mapping relationship between the POS sequence and prosodic phrase boundaries, and hopes to improve the naturalness of synthesized speech.
The Impact of Number of Query Words on Image Search Engines
Authors: Fuat Uluc, Erkan Emirzade, Yiltan Bitirim
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

In this article, the impact of increasing number of query words on information retrieval effectiveness of image search engines is investigated. First of all, four popular search engines, namely Google, Yahoo, Msn, and Ask are selected. Then, forty queries are extracted from the list of Wordtracker and categorized in four groups as one-word, two-word, three-word and four-word queries. After every query is run on the selected image search engines and binary human relevance judgment is done on first twenty image items retrieved, the performance evaluation of image search engines are done in terms of precision and normalized recall. Overall, Google appears to be the best image search engine. The information retrieval effectiveness of image search engines decreases, when the number of query words increases. Therefore, image search engines still need to be improved.
The Efficacy of "Little t" Theories
Authors: Scott L. Schneberger, Hugh J. Watson, Carol E. Pollard
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

While debates continue about the rigor and relevance of IS research, theories are still widely accepted as the bedrock of scientific research. This paper addresses the issues surrounding academic research rigor and relevance by discussing the rigor and relevance of research theories--in particular, big T and little t theories. Big T theories are usually highly recognized, refined, validated, and generalizable theories usually associated with rigorous research and publication. Little t theories may be relatively immature, little known, narrowly focused, simple, and highly relevant theories more generally appreciated by business practitioners. Little t theories have special characteristics that can be very useful to researchers and teachers, and highly relevant to business practitioners. Moreover, academics can take clear steps to build, publish, teach, and apply little t theories.
Selection Algorithm for Grid Services based on a Quality of Service Metric
Authors: Simone A. Ludwig, S. M. S. Reyhani
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

Grid computing is one of the main paradigms for resource-intensive scientific applications. It enables resource sharing and dynamic allocation of computational resources, thus increasing access to distributed data, promoting operational flexibility and collaboration, and allowing service providers to scale efficiently to meet variable demands. Large-scale grids are complex systems composed of many components from different domains. Quality of service (QoS) in such environments is an important issue due to the distributed nature of the services. In this paper we propose an allocation algorithm for matching service requests of Grid users with Grid services based on a QoS metric using either matchmaking or a well-tested genetic algorithm: NSGA-II. Experiments are performed and results are discussed for both approaches.
Making Java applications mobile or persistent
Authors: Sara Bouchenak
Venue: Proceedings of the 6th conference on USENIX Conference on Object-Oriented Technologies and Systems - Volume 6 (2001)

Today, mobility and persistence are important aspects of distributed applications. They have many fields of use such as load balancing, fault tolerance and dynamic reconfiguration of applications. In this context, the Java virtual machine provides many useful services such as dynamic class loading and object serialization which allow Java code and objects to be mobile or persistent. However, Java does not provide any service for the mobility or the persistence of control flows (threads), the execution state of a Java program remains inaccessible. We designed and implemented new services that make Java threads mobile or persistent. With these services, a running Java thread can, at an arbitrary state of its execution, migrate to a remote machine or be checkpointed on disk for a possible subsequent recovery. Therefore migrating a Java thread is simply performed by the call of our go primitive, by the thread itself or by an external thread. In other words, the migration or the checkpointing of a thread can be initiated by the thread itself or by another thread. We integrated these services into the JVM, so they provide reasonable and competitive performance figures without inducing an overhead on JVM performance. Finally, we experimented a dynamic reconfiguration tool based on our mobility service and applied to a running distributed application.
Information-theoretic analysis of watermarking
Authors: P. Moulin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

An information-theoretic analysis of watermarking is presented in this paper. We formulate watermarking as a communication problem with side information at the encoder and decoder and determine the hiding capacity, which upper-bounds the rates of reliable transmission and quantifies the fundamental tradeoff between three quantities: the achievable watermarking rates and the allowed distortion levels for the information hider and the attacker. The hiding capacity is the value of a game between the information hider and the attacker. The optimal attack strategy is the solution of a particular rate-distortion problem, and the optimal hiding strategy is the solution to a channel coding problem. For several important problems, the hiding capacity is the same whether or not the decoder knows the host data set. It is also shown that existing watermarking systems in the literature operate far below capacity.
Integrated CPU and l2 cache voltage scaling using machine learning
Authors: Nevine AbouGhazaleh, Alexandre Ferreira, Cosmin Rusu, Ruibin Xu, Frank Liberato, Bruce Childers, Daniel Mosse, Rami Melhem
Venue: ACM SIGPLAN Notices (2007)

Embedded systems serve an emerging and diverse set of applications. As a result, more computational and storage capabilities are added to accommodate ever more demanding applications. Unfortunately, adding more resources typically comes on the expense of higher energy costs. New chip design with Multiple Clock Domains (MCD) opens the opportunity for fine-grain power management within theprocessor chip. When used with dynamic voltage scaling (DVS), we can control the voltage and power of each domain independently. A significant power and energy improvement has been shown when using MCD design in comparison to managing a single voltage domain for the whole chip, as in traditional chips with global DVS. In this paper, we propose PACSL a Power-Aware Compiler-based approach using Supervised Learning. PACSL automatically derives an integrated CPU-core and on-chip L2 cache DVS policy tailored to a specific system and workload. Our approach uses supervised machine learning to discover a policy, which relies on monitoring a few performance counters. We present our approach detailing the role of a compiler in constructing a custom power management policy. We also discuss some implementation issues associated with our technique. We show that PACSL improves on traditional power management techniques that are used in general MCD chips. Our technique saves 22% on average (up to 46%) in energy-delay product over a DVS technique that applies independent DVS decisions in each domain. Compared to no-power management, our technique improves energy-delay product by 26% on average (up to 64%).
Dynamic population size in multiobjective evolutionary algorithms
Authors: Haiming Lu, G. G. Yen
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The authors propose a new evolutionary approach to multiobjective optimization problems; the Dynamic Multiobjective Evolutionary Algorithm (DMOEA). In DMOEA, a population growing and population decline strategies are designed, and several important indicators are defined in order to determine the adaptive individual "killing" scheme. By examining the selected performance indicators of a test function, DMOEA is found to be effective in directing the population into an optimal population size, keeping the diversity of the individuals along the trade-off surface, tending to extend the Pareto front to new areas, and finding a well-approximated Pareto optimal front.
Intelligent tutoring tools-a problem solving framework for learning and assessment
Authors: A. Patel
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

This paper states a model of Computer Integrated Learning Environment (CILE) and the role of an Intelligent Tutoring Tool (ITT) within this model. An ITT is a mixed initiative autonomous entity possessing rudimentary intelligence and operates on an overlay type of student model. The paper briefly discusses the structure, key features and enhanced functionalities of an ITT software. It also discusses how this approach can be used to create basic and linking ITTs to build a comprehensive tutoring system. Basic ITTs already exist for various topics in cost accounting and the approach is useful in any applied numeric discipline-particularly engineering topics. This is demonstrated in the paper with suitable examples. The development of Marker software as a Teaching Support Tool (TST) is also reviewed very briefly along with its ability to discriminate between the data interpretation error and solution derivation error.
AMulti-Agent Collabor ative Fr amework for Mobile E-Health
Authors: Victor Chan, Pradeep Ray, Nandan Parameswaran
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

With today's unstoppable rise in technological progression, we have seen a growing abundance of consumer health monitoring products in the openmarket. These devices allow patients to have their health signs monitored unobtrusively in their mobile environment. However, the uptake of these technologies is slow and there is a need for a new paradigm to support the cooperation of healthcare professionals using these technologies. The role of the CSCW approach via agents is to increase awareness and collaboration among patients and medical staff in the health monitoring process. The aim of this paper then, is to present a multi-agent collaborative framework for mobile e-health, based on the computer-supported cooperative work (CSCW) paradigm, along with a discussion on its possible workflow effects.
A Lower Bound on Effective Performance Testing for Digital Forensic Tools
Authors: Lei Pan, Lynn M. Batten
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

The increasing complexity and number of digital forensic tasks required in criminal inves- tigations demand the development of an effective and efficient testing methodology, enabling tools of similar functionalities to be compared based on their performance. Assuming that the tool tester is familiar with the underlying testing platform and has the ability to use the tools correctly, we provide a numerical solution for the lower bound on the number of testing cases needed to determine comparative capabilities of any set of digital forensic tools. We also present a case study on the performance testing of password cracking tools, which allows us to confirm that the lower bound on the number of testing runs needed is closely related to the row size of certain orthogonal arrays. We show how to reduce the number of test runs by using knowledge of the underlying system.
A project neural network for solving degenerate convex quadratic program
Authors: Xiaoping Xue, Wei Bian
Venue: Neurocomputing (2007)

This paper develops a project neural network for solving degenerate quadratic programming problems with general linear constraints. Compared with the existing neural networks for solving strict convex quadratic program, the proposed neural networks for solving degenerate convex quadratic program has a wider domain for implementation. In the theoretical aspects, the proposed neural network is shown to have complete convergence and finite-time convergence. Moreover, the nonsingular part of the output trajectory respect to Q has an exponentially convergent rate. Furthermore, through any equilibrium point of the proposed neural network, the information that whether the objective function can reach its minimum of R^n within the constraint conditions can be obtained easily. Illustrative examples further show the correctness of the results in this paper, and the good performance of the proposed neural network.
Task-based interaction with an integrated multilingual, multimedia information system: a formative evaluation
Authors: Pengyi Zhang, Lynne Plettenberg, Judith L. Klavans, Douglas W. Oard, Dagobert Soergel
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper describes a formative evaluation of an integrated multilingual, multimedia information system, a series of user studies designed to guide system development. The system includes automatic speech recognition for English, Chinese, and Arabic, automatic translation from Chinese and Arabic into English, and query-based and profile-based search options. The study design emphasizes repeated evaluation with the same (increasingly experienced) participants, exploration of alternative task designs, rich qualitative and quantitative data collection, and rapid analysis to provide the timely feedback needed to support iterative and responsive development. Results indicate that users presented with materials in a language that they do not know can generate remarkably useful work products, but that integration of transcription, translation, search and profile management poses challenges that would be less evident were each technology to be evaluated in isolation.
A life cycle software quality model using bayesian belief networks
Authors: Guy A. Schiavone
Venue:  (2006)

Software practitioners lack a consistent approach to assessing and predicting quality within their products. This research proposes a software quality model that accounts for the influences of development team skill/experience, process maturity, and problem complexity throughout the software engineering life cycle. The model is structured using Bayesian Belief Networks and, unlike previous efforts, uses widely-accepted software engineering standards and in-use industry techniques to quantify the indicators and measures of software quality. Data from 28 software engineering projects was acquired for this study, and was used for validation and comparison of the presented software quality models. Three Bayesian model structures are explored and the structure with the highest performance in terms of accuracy of fit and predictive validity is reported. In addition, the Bayesian Belief Networks are compared to both Least Squares Regression and Neural Networks in order to identify the technique is best suited to modeling software product quality. The results indicate that Bayesian Belief Networks outperform both Least Squares Regression and Neural Networks in terms of producing modeled software quality variables that fit the distribution of actual software quality values, and in accurately forecasting 25 different indicators of software quality. Between the Bayesian model structures, the simplest structure, which relates software quality variables to their correlated causal factors, was found to be the most effective in modeling software quality. In addition, the results reveal that the collective skill and experience of the development team, over process maturity or problem complexity, has the most significant impact on the quality of software products.
Tactile Vocabulary for Tactile Displays
Authors: Lynette A. Jones, Jacquelyn Kunkel, Edgar Torres
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Two experiments were conducted to identify a set of tactile patterns that could be recognized with high accuracy when presented using a tactile display on the back. These patterns could then serve as tactons to communicate simple commands and directions. The tactile display comprised a 4-by-4 array of tactors that was worn across the back. In the first experiment a set of seven commonly used military hand and arm signals were converted into tactile patterns that subjects were required to identify. When both a visual representation of the tactile pattern and a picture of the hand signal were available, subjects attained a mean score of 98% correct. In the second experiment involving 15 tactile patterns, performance was excellent with a mean score of 98% correct. These patterns provide the basis for developing a tactile vocabulary.
On reconciling data exchange, data integration, and peer data management
Authors: Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati
Venue: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2007)

Data exchange and virtual data integration have been the subject of several investigations in the recent literature. At the same time, the notion of peer data management has emerged as a powerful abstraction of many forms of flexible and dynamic data-centere ddistributed systems. Although research on the above issues has progressed considerably in the last years, a clear understanding on how to combine data exchange and data integration in peer data management is still missing. This is the subject of the present paper. We start our investigation by first proposing a novel framework for peer data exchange, showing that it is a generalization of the classical data exchange setting. We also present algorithms for all the relevant data exchange tasks, and show that they can all be done in polynomial time with respect to data complexity. Based on the motivation that typical mappings and integrity constraints found in data integration are not captured by peer data exchange, we extend the framework to incorporate these features. One of the main difficulties is that the constraints of this new class are not amenable to materialization. We address this issue by resorting to a suitable combination of virtual and materialized data exchange, showing that the resulting framework is a generalization of both classical data exchange and classical data integration, and that the new setting incorporates the most expressive types of mapping and constraints considered in the two contexts. Finally, we present algorithms for all the relevant data management tasks also in the new setting, and show that, again, their data complexity is polynomial.
Criteria for the DoD 2400 bps vocoder selection
Authors: M. A. Kohler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Use of vocoder competitions remains a prevalent method for selecting a candidate algorithm for low bit rate voice coding applications. Without proper safeguards in the evaluation process, the final selection may be perceived as biased or unfair. This paper describes the evaluation process that was used by DoD for the selection of a new 2400 bps standard. Specific attention was aimed at creating an evaluation environment such that each candidate received equitable treatment. This paper describes the structure of the evaluation team, the roles and responsibilities of its components, the information that was available for evaluation, and the equations and weights that were used to develop an overall figure of merit (FOM) for each candidate.
Learning classifier systems
Authors: Martin V. Butz
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

When Learning Classifier Systems (LCSs) were introduced by John H. Holland in the 1970s, the intention was the design of a highly adaptive cognitive system. Since then, LCSs came a long way. Interest strongly decreased in the late 80s and early 90s due the complex interactions of several learning mechanisms. However, since the introduction of the accuracy-based XCS classifier system by Stewart W. Wilson in 1995 and the modular analysis of several LCSs thereafter, interest re-gained momentum. Current research has shown that LCSs can effectively solve data-mining problems, reinforcement learning problems, other predictive problems, and cognitive control problems. Hereby, it was shown that performance is machine learning competitive, but learning is taking place online and is often more flexible and highly adaptive. Moreover, system knowledge can be easily extracted.The Learning Classifier System tutorial provides a gentle introduction to LCSs and their general functioning. It then surveys the current theoretical understanding of the systems and their proper application to various problem domains. Finally, we provide a suite of current successful LCS implementations and discuss the most promising areas for future research and applications.
Recovery in Multicomputers with Finite Error Detection Latency
Authors: P. Krishna, N. H. Vaidya, D. K. Pradhan
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

In most research on checkpointing and recovery, it has been assumed that the processor halts immediately in response to any internal failure (fail-stop model). This paper presents a recovery scheme (independent checkpointing and message logging) for a multicomputer system consisting of processors having a non-zero error detection latency. Our scheme tolerates bounded error detection latencies, thus, achieving a higher fault coverage. The simulation results show that for typical detection latency values, the recovery overhead is almost independent of the detection latency.
Model or Mould? A Challenge for Better Traceability
Authors: S. J. Morris, O. C. Z. Gotel
Venue: Proceedings of the International Workshop on Modeling in Software Engineering (2007)

This paper examines the notion of the model as it may be used in software engineering via the definition of a series of progressively more complex relationships between the modeller, the model and what is modelled. A gradual historical development is identified where the purpose of the model changes from its representation of a pre-existing subject to its action as a precedent and a definition for some subsequent artifact that is its object. The notion of a composite model type, or mould, combining both purposes is made explicit. Its implications for traceability in multi-model processes are being investigated.