ppxscal/embedding_network huggingface dataset:
High Quality Voice Conversion through Phoneme-Based Linear Mapping Functions with STRAIGHT for Mandarin
Authors: Kun Liu, Jianping Zhang, Yonghong Yan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

A novel voice conversion system using phoneme-based linear mapping functions on main vowel phonemes is proposed in this paper. Our voice conversion algorithm has the following three improvements. First, instead of using all the Vocal Tract Resonance (VTR) vectors in the portion of a phoneme, we use the VTR vector at the steady-state of each phoneme to train phoneme-based GMM. Second, different linear mapping functions have been trained to describe the mapping relationships for corresponding phonemes. Third, in the transformation procedure, the transformed formant frequencies at the main vowel phonemes are obtained using the corresponding GMM. Besides, prosody parameters are also transformed. Finally the converted speech is re- synthesized with the transformed parameters by high quality speech manipulation framework STRAIGHT (Speech Transformation and Representation based on Adaptive Interpolation of weiGHTed spectrogram). Perceptual results for F-M and M-F conversion show that our MOS score of the converted voice is improved from 3.8 to 4.1 and ABX score from 3.3 to 3.8 compared with IBM's system. Comparisons with other systems are also given in this paper. Keywords--Voice conversion, formant transitions, main vowel, phoneme-based mapping functions
Fuzzy Database Mining and Information Retrieval A Chaos-Based Fragile Watermarking Scheme with Recovery
Authors: Hongjie He, Jiashu Zhang, Fan Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The digital image over the network is inevitably affected by the channel additive noise. However the existing fragile watermarking techniques with recovery are susceptible to random noise. To overcome this problem, this paper presents a chaos-based fragile watermarking scheme with recovery. In the proposed algorithm, the original image is divided into 2 ×2 blocks. The watermark embedding position of every image block is randomly generated based on chaotic system. These strategies can effectively improve the ability of our algorithm against not only random noise but also the synchronous counterfeiting attack. The experiment demonstrates that the proposed scheme can detect and localize any malicious alterations and can recover a tampered image to an intelligible one even if the tested image is polluted by the random noise.
Study on Fuzzy AHP Group Decision-Making Method Based on Set-Valued Statistics
Authors: Hong Tang, Jie Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

With respect to fuzzy AHP group decision-making problem in which the result is fuzzy number, a new method of fuzzy AHP is presented based on set-valued statistics. Firstly the definition of uniformly interval number judgment matrix is given; secondly interval number weight vector is calculated based on interval number eigenvector method. At last, a real number result is derived. An example is given to demonstrate the feasibility and rationality of the proposed method. Compared with gray relational analysis method, it is more simply and conveniently.
A cost-estimation component for statement sequences
Authors: Tobias Kraft
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Query generators producing sequences of SQL statements are embedded in many applications. As the execution time of such sequences is often far from optimal, their optimization is an important issue. Therefore, in [5] we proposed a rule-based optimization approach, which we called CGO (Coarse-Grained Optimization). Our first prototype used a heuristic, priority-based control strategy to choose the rewrite rules that should be applied to a given statement sequence. This worked well but there is still potential for improvements. Thus, in [4] we have introduced an approach to provide cost estimates for statement sequences which is the basis for a cost-based CGO optimizer. It exploits histogram propagation and the optimizer of the underlying database system for this purpose. In this demonstration, we want to showcase the functionality and the effectiveness of our approach. Thereto, we present a prototype of a cost-estimation component for statement sequences which implements this approach. It includes a graphical user interface to explain the histogram-propagation process and to report the results of the cost-estimation process. In the setup for this demonstration, we use a TPC-H benchmark database with an appropriate set of sequences as sample scenario.
The ∂-theory for inverse problems associated with schrödinger operators on hyperbolic spaces
Authors: Hiroshi Isozaki
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

An analogue of the Faddeev scattering amplitude is introduced for Schrödinger operators on hyperbolic spaces. It satisfies a ∂--equation and enables us to derive an integral representation of the potential.
Full-rank representation of generalized inverse AT,S(2) and its application
Authors: Xingping Sheng, Guoliang Chen
Venue: Computers Mathematics with Applications (2007)

In this paper, we introduce a full-rank representation of the generalized inverse A"T","S^(^2^) of a given complex matrix A, which is based on an arbitrary full-rank decomposition of G, where G is a matrix such that R(G)=T and N(G)=S. Using this representation, we introduce the minor of the generalized inverse A"T","S^(^2^); as a special case of the minor, a determinantal representation of the generalized inverse A"T","S^(^2^) is obtained. As an application, we use an example to demonstrate that this representation is correct.
The Economics of Architecture-First
Authors: Grady Booch
Venue: IEEE Software (2007)

The architect, either as an individual, a role, or a team, lovingly crafts, grows, and governs that architecture as it emerges from the thousands of individual design decisions of which it's composed. In this sense, an architecture-first approach appears to be a reflection of sound development practices.
Shifting nonlinear phenomena in a DC-DC converter using a fuzzy logic controller
Authors: K. Guesmi, N. Essounbouli, A. Hamzaoui, J. Zaytoon, N. Manamanni
Venue: Mathematics and Computers in Simulation (2008)

The occurrence of nonlinear phenomena in DC-DC power converters makes their analysis and control difficult. We propose a converter model that takes into account the internal resistances of the converter elements. A fuzzy logic controller is then used to shift the nonlinear phenomena outside the operating domain, and to ensure current regulation over a wide range of parameters. To validate the achieved performance, a comparative study is presented.
Feature Space Enrichment by Incorporation of Implicit Features for Effective Classification
Authors: Abhishek Srivastava, Osmar R. Zaiane, Maria-Luiza Antonie
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Feature Space Conversion for classifiers is the process by which the data that is to be fed into the classifier is transformed from one form to another. The motivation behind doing this is to enhance the "discriminative power" of the data together with preserving its "information content". In this paper, a new method of feature space conversion is explored, wherein "enrichment" of the feature space is carried out by the augmentation of the existing features with new "implicit" features. The modus operandi involves generation of association rules in one case and closed frequent patterns in another and the extraction of the new features from these. This new feature space is first made use of independently to feed the classifier and then it is used in unison with the original feature space. The effectiveness of these methods is subsequently verified experimentally and expressed in terms of the classification accuracy achieved by the classifier.
Examining the Performance of a Constraint-Based Database Cache
Authors: Andreas Buhmann, Joachim Klein
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Constraint-based database caching aims at correctly answering SQL query predicates from a local cache database by exploiting constraints that have previously been used in selecting sets of records to be cached from a remote database. In this paper, we take our first steps in look- ing at performance aspects of our prototype Adaptive Constraint-based Cache (ACCache), which is realized in a middleware manner on top of regular databases. Within our measurement setup, the initial focus is on two central ACCache functions: query processing and cache loading. To demonstrate their time behavior and interaction, we have chosen a scenario based on the TPC-W specification. We conclude with a discussion of our first measurement results.
A Collaborative Retrieval System--Full Text Base and Database
Authors: Chuanyao Yang, Yuqin Li, Zhenghua Wang, Chenghong Zhang, Yunfa Hu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In the past two decades, database systems have been developed rapidly. Much research has been done about the techniques of index and retrieval. In relational database, B tree or B+ tree is used to index the structured data; in full text database, inverted list or sorted duality inter-relevant Successive Trees Model is used to index the full text. But in an integrated database, the efficiency of using traditional way to do retrieving is far from practical in the scenario of mass data and high responsive requirement. In this paper we propose a new collaborative retrieving approach to solve this problem. And the experiment shows this approach helps to improve the efficiency of retrieving.
Random-Walk Term Weighting for Improved Text Classification
Authors: Samer Hassan, Rada Mihalcea, Carmen Banea
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This paper describes a new approach for estimating term weights in a document, and shows how the new weighting scheme can be used to improve the accuracy of a text classifier. The method uses term co-occurrence as a measure of dependency between word features. A random-walk model is applied on a graph encoding words and co-occurrence dependencies, resulting in scores that represent a quantification of how a particular word feature contributes to a given context. Experiments performed on three standard classification datasets show that the new random-walk based approach outperforms the traditional term frequency approach of feature weighting.
Zeros of the Macdonald function of complex order
Authors: Erasmo M. Ferreira, Javier Sesma
Venue: Journal of Computational and Applied Mathematics (2008)

The z-zeros of the modified Bessel function of the third kind K"@n(z), also known as modified Hankel function or Macdonald function, are considered for arbitrary complex values of the order @n. Approximate expressions for the zeros, applicable in the cases of very small or very large |@n|, are given. The behaviour of the zeros for varying |@n| or arg@n, obtained numerically, is illustrated by means of some graphics.
Comments on "A New Random-Error-Correction Code"
Authors: E. Paaske
Venue: IEEE Transactions on Computers (1979)

This correspondence investigates the error propagation properties of six different systems using a (12, 6) systematic double-error-correcting convolutional encoder and a one-step majority-logic feedback decoder. For the generally accepted assumption that channel errors are much more likely to occur than hardware errors in the decoder, it is shown that the system proposed by Massey outperforms the
A Stochastic Differential Equation Model for Queues on Network Video Traffic
Authors: Wenyan Hu, Dejian Ye
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Although a lot of study and research have been focused on buffer control and traffic smoothing on server side, which is one of the critical issues in network video traffic area, the problem has not been solved satisfactorily because of lacking of basic theory and the complexity of its internal characteristic. In this paper, we introduce PDSDE (Poisson Driven Stochastic Differential Equation) to model the traffic fluid queueing properly and show that ltd item, which will be neglected in normal Riemann Integral, has great impact on the statistical queueing length both theoretically and ex- perimentally. We construct a well-defined module for real network video traffic environment and give the explicit sta- tistical length of the dynamic buffer precisely, which lays the foundation of studying buffer control and rate smooth- ing quantitatively for further work.
Robust Face Matching Under Large Occlusions
Authors: Georgy Gimel'farb, Patrice Delmas, John Morris, Al Shorin
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Outliers due to occlusions and contrast and offset signal deviations notably hinder recognition and retrieval of facial images. We propose a new maximum likelihood matching score with "soft masking" of outliers which is robust in these conditions. Differences between two images are modelled by unknown contrast and offset deviations from an unknown template and by independent pixel-wise errors. The error distribution is a mixture of a zero-centred Gaussian noise with an unknown variance and uniformly distributed outliers. The matching score combines the maximum likelihood estimates of model parameters and the soft masks being produced by a simple iterative Expectation- Maximisation algorithm. Experiments with facial images from the MIT Face Database show the robustness of this technique in the presence of large occlusions.
Fair Energy Consumption Protocol with Two Base Stations for Wireless Sensor Networks
Authors: Bao Nguyen Nguyen, Deokjai Choi
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Smart Home is getting popular. An essential element of smart home is sensor network to convey environment information to the control station. There have been many communication protocols for this sensor network. One problem of previous protocols is unbalanced energy consumption among sensor nodes. Even though they tried to overcome energy unbalanced consumption, they could not solve this problem satisfactorily yet. In this paper, we find that basic reason for this unbalanced energy consumption is that there is normally one base node. Because of this architectural problem, the nodes around this sink node lose their energy more easily relative to other nodes. So, we propose the sensor network architecture with 2 base stations, and its corresponding communication protocol.
Psychologically Inspired Anticipation and Dynamic Response for Impacts to the Head and Upper Body
Authors: Ronald Metoyer, Victor Zordan, Benjamin Hermens, Chun-Chi Wu, Marc Soriano
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

We present a psychology-inspired approach for generating a character' s anticipation of and response to an impending head or upper body impact. Protective anticipatory movement is built upon several actions that have been identified in the psychology literature as response mechanisms in monkeys and in humans. These actions are parameterized by a model of the approaching object (the threat) and are defined as procedural rules. We present a hybrid forward and inverse kinematic blending technique to guide the character to the pose that results from these rules while maintaining properties of a balanced posture as well as characteristics of the behavior just prior to the interaction. In our case, these characteristics are determined by a motion capture sequence. We combine our anticipation model with a physically-based dynamic response to produce animations where a character anticipates an impact before collision and reacts to the contact, physically, after the collision. We present a variety of examples including threats that vary in approach direction, size and speed.
Flexible intrusion tolerant voting architecture
Authors: Soontaree Tanaraksiritavorn, Shivakant Mishra
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

We propose to design and implement a voting architecture that efficiently tolerates byzantine failure, supports inexact matching of inputs, and preserves privacy. Its functionality includes integrating replies from different correct servers whose data may differ slightly from one another due to environmental factors, filtering out replies from faulty servers to protect any intentional or unintentional leakage of confidential data, and dynamically adapting to different applications by incorporating new rules. We also explore how to distribute replies and cryptographic key so that a compromised voter would reveal only a partial key or partial replies.
Transformation invariant SOM clustering in Document Image Analysis
Authors: Simone Marinai, Emanuele Marino, Giovanni Soda
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

In this paper, we propose the combination of the Self Organizing Map (SOM) and of the tangent distance for effective clustering in Document Image Analysis. The proposed model (SOM TD) is used for character and layout clustering, with applications to word retrieval and to page classification. By using the tangent distance it is possible to improve the SOM clustering so as to be more tolerant with respect to small local transformations of the input patterns.
Early planning for clock skew scheduling during register binding
Authors: Min Ni, Seda Ogrenci Memik
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Design decisions made during high-level synthesis usually have great impacts on the later design stages. In this paper, We present a general framework, which plans for the clock skew scheduling in physical design stages during register binding in high-level synthesis. Our proposed technique pursues the optimality of the native objective functions of the register binding problem. At the same time, it ensures not invalidating the subsequent clock skew scheduling for optimizing the clock period. We use the switching power as the native objective of our register binding problem. The problem is first formulated as a MILP problem. An acceleration scheme based on the concept of weakly compatible edge set(WCES) is proposed to speed up the MILP solver to obtain the optimal solution. Then, we present our heuristic algorithm to reduce the running time further. The experimental results show that on average our acceleration scheme can speed up the solver by 8.6 times, and our heuristic is 70 times faster than the solver with a 5.25% degradation of the native objective. The minimum and maximum degradation among our benchmark set are 0.82% and 12.2% respectively.
TITAN: a Framework for Aspect Oriented System Evolution
Authors: Miguel A. Perez-Toledano, Amparo Navasa, Juan M. Murillo, Carlos Canal
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Aspect Oriented Software Development provides a suitable support for software system evolution. The system properties are better encapsulated resulting in easier manipulation. Besides, new properties or changes can be added to the systems as new aspects, reducing cost, effort and time. However, adding new aspects to an existing AO system could produce unexpected behaviour. In particular, when there is an aspect already operating in the same joint point that the new one, the two aspects may interfere each other. In this context, TITAN is a framework that supports system evolution through aspect oriented techniques, allowing to verify whether the added behaviour produces the expected results. The starting point is the UML specification of both the initial system and the aspects. From that point, the specification is validated generating a CCS algebraic description of the system. Next, extended (finite) state machines are automatically generated to verify, simulate, and test the modelled system behaviour. Additionally, the result of that process can also be compared with the behaviour of the new running system.
Mining Generalized Association Rules from a Different Perspective
Authors: Yeong-Chyi Lee, Tzung-Pei Hong, and Tien-Chin Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In this paper, we introduce a mining algorithm from a different perspective for discovery of generalized association rules with multiple minimum supports. The perspective can be easily explained from the operations of union and intersection. Under the perspective, the characteristic of downward closure can be kept, such that the original Apriori algorithm can easily be extended to finding large itemsets. The proposed algorithm can thus meet the mining requirements of generating association rules under multiple minimum supports and managing taxonomic relationships among items. Experimental results show the effects of the parameters used in the proposed mining algorithm.
Flow Time Minimization under Energy Constraints
Authors: Jian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hseuh-I Lu
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Power-aware and energy-efficient designs play important roles for modern hardware and software designs, especially for embedded systems. This paper targets a scheduling problem on a processor with the capability of dynamic voltage scaling (DVS), which could reduce the power consumption by slowing down the processor speed. The objective of the targeting problem is to minimize the average flow time of a set of jobs under a given energy constraint, where the flow time of a job is defined as the interval length between the arrival and the completion of the job. We consider two types of processors, which have a continuous spectrum of the available speeds or have only a finite number of discrete speeds. Two algorithms are given: (1) An algorithm is proposed to derive optimal solutions for processors with a continuous spectrum of the available speeds. (2) A greedy algorithm is designed for the derivation of optimal solutions for processors with a finite number of discrete speeds. The proposed algorithms are extended to cope with jobs with different weights for the minimization of the average weighted flow time. The proposed algorithms are also evaluated with comparisons to schedules which execute jobs at a common effective speed.
Wireless LAN Positioning based on Received Signal Strength from Mobile device and Access Points
Authors: Wilson M. Yeung, Joseph K. Ng
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Most of the WLAN positioning systems use Received Signal Strength (RSS) as an important information to estimate the location of a mobile station. In fact, RSS can be obtained at the access points or at the mobile device, and most of the previous works use either way to collect this information. In this paper, we propose a new WLAN positioning approach by making use of the RSS collected at both the access points and mobile device. Besides, our new approach is positioning algorithm independent, which means the user can apply any location estimation algorithm with our new data acquisition approach. With our new data acquisition approach, our experiments had shown that the accuracy of location estimation can be improved by 12.84% to 38.23% on the average, as compare to the previous work which only uses the RSS information from either access points or the mobile device.