ppxscal/embedding_network huggingface dataset:
A corpus-based singing voice synthesis system for mandarin Chinese
Authors: Cheng-Yuan Lin, Tzu-Ying Lin, J.-S. Roger Jang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, the design and implementation of a corpus-based singing voice synthesis (SVS) system for Mandarin Chinese was introduced. The design rules of three corpora for singing voice synthesis were proposed. After that, two distance functions were defined and the Viterbi search algorithm was applied to identify the optimal combinations of synthesis units from the three corpora. For better performance, several sound effects with synthesized outputs were combined. Finally, we conduct a listening experiment to demonstrate the feasibility of this system.
Analyzing large biological networks: protein-protein interactions example
Authors: Natasa Przulj
Venue:  (2005)

Understanding the inner workings of the cell constitutes the foremast fundamental problem of modern biology. The information contained in large protein-protein interaction (PPI) networks is being exploited for understanding the cell and developing new drugs. Currently available PPI networks of model organisms, containing thousands of nodes (proteins) and tens of thousands of edges (interactions), are noisy and largely incomplete. PPI networks of higher organisms will be much larger. As these data sets grow, it is important that our models keep representing the data well, since the models can be used for data cleaning and experimental planning. The currently accepted scale-free model of PPI networks is based on global statistical properties of PPI networks. However, global measures are very weak, since qualitatively different graphs can have equal values in these measures. It is possible that the observed global proper ties of PPI networks are an artifact of noisy, high-throughput experimental techniques used to detect PPIs, as well as the incompleteness of the data. Fortunately, some parts of PPI networks have been extensively studied due to their importance for basic biological function and human disease. We expect the local structural properties of these highly studied portions of PPI networks to give a much better indication of the true structure of PPI networks. Therefore, we use a sensitive, local structure approach. We measure local structural properties of a PPI network by finding and counting all instances of 3-, 4-, and 5-node connected induced subgraphs, called graphlets. We compare the graphlet frequency distributions of the PPI and various model networks with the same number of nodes and edges as the PPI network. Using this measure of local network structure, we show that PPI networks are better modeled by geometric random graphs than by previously proposed models, including scale-free networks. In a geometric random graph, nodes correspond to uniformly randomly distributed points in a metric space; two nodes are adjacent in the graph if they are close enough in the metric space. We use this new model to develop efficient and scalable heuristic algorithms for estimating graphlet frequency distribution patterns in PPI and geometric random networks.
General fast generation of random variables for discrete distributions
Authors: Theodore Brown
Venue: ACM SIGSIM Simulation Digest (1980)

Recently a new method, the alais method has been introduced for generating a discrete, finite valued distribution (1, 2). The method is exceptionally fast and can be broadly applied. It should have wide appeal. The purpose of this note is to introduce the method, place it in prospective with other fast, generally applied methods and to provide a Fortran program to generate constants needed by the method for any given distribution.
Wireless portals with wifidog
Authors: Michael Lenczner
Venue: Linux Journal (2005)

Wifidog teaches WIFI hotspots new tricks. Leave your Wi-Fi access point open, but control and monitor its use.
Semantic relations across syntactic levels
Authors: Viviana A. Nastase
Venue:  (2004)

In order to make sense of a message conveyed to us via a spoken or written utterance, we understand what things are talked about, and how they are connected. From this point of view, do these sentences convey different messages? (1) I will arrive at 11 am. and I will arrive when you arrive. (2) I will meet you in the office. and I will meet you where we met last time. (3) Sweets before dinner spoil your appetite. and (4) Eating sweets before dinner spoils your appetite. I will arrive at a certain point in time: at 11 am., or when you arrive. I will meet you at a certain place: in the office, or where we met last time. We can talk about sweets and mean eating sweets. Literature review suggests that the relations exemplified by these pairs of sentences are different, because they connect different types of syntactic units. The first relation in each pair connects a verb and one of its arguments, the second&mdash;two clauses. Such distinctions are artificial. Semantic relations link concepts, and will surface on the syntactic level on which the concepts they connect surface. We aim to give an account of semantic relations that does not depend on syntactic levels. We will justify a unified view of semantic relations across syntactic levels. Such a view has a positive effect on text analysis. It will allow us to gather evidence for a particular semantic relation from all levels at which it appears. Having such information that is not separated according to syntactic levels will allow a text analysis and knowledge acquisition system to use at each processing step, all the evidence previously gathered. We will show that this translates into faster learning and better results. We can take semantic relation analysis onto another level. We can look for descriptions of concepts connected by a specific semantic relation to find what characteristics or features of the concepts connected make them interact in this way. (1) blue book, happy person, interesting study; (2) paper bag, wooden chair, iron gate; (3) oak tree, cumulus cloud, flounder fish. Blue, happy, interesting are properties, and paper, wood, iron are materials. Oak is a specific type of tree, cumulus is a type of cloud, and flounder is a type of fish. We will use ontologies to find similarities between concepts that explain or give us indications about the semantic relations in which they are involved. All these aspects we explore serve to improve text analysis. We propose a uniform processing of texts that allows us to extracts pairs of concepts that interact, and to describe this interaction through semantic relations.
Natural image statistics for digital image forensics
Authors: Siwei Lyu
Venue:  (2005)

We describe a set of natural image statistics that are built upon two multi-scale image decompositions, the quadrature mirror filter pyramid decomposition and the local angular harmonic decomposition. These image statistics consist of first- and higher-order statistics that capture certain statistical regularities of natural images. We propose to apply these image statistics, together with classification techniques, to three problems in digital image forensics: (1) differentiating photographic images from computer-generated photorealistic images, (2) generic steganalysis; (3) rebroadcast image detection. We also apply these image statistics to the traditional art authentication for forgery detection and identification of artists in an art work. For each application we show the effectiveness of these image statistics and analyze their sensitivity and robustness.
A discovery and analysis of influencing factors of pair programming
Authors: Fadi P. Deek, Il Im
Venue:  (2004)

The exploration into the underlying psychosocial links of pair programming, a new and unorthodox programming paradigm in which two programmers share one keyboard and monitor during real-time programming sessions, is undertaken. These complex psychosocial relationships, along with cognitive process exchanges, ultimately mold the programming output as well as determine the level of communication, satisfaction, confidence and compatibility. Laying the framework for this research, a thorough review of traditional and contemporary paradigms with a special focus on their limitations and a list of current software development problems are presented. Next, a detailed summary of pair programming and related agile software paradigms, such as extreme programming, which lists pair programming as one of its twelve principles, is given. From earlier pair programming studies, a number of programming benefits have been unveiled and these are listed and discussed. However, a lack of formal studies pertaining to the psychosocial aspects of pair programming exists. Given this void, a field survey is administered to a group of professional programmers and a resulting list of influencing factors on pair programming emerges. From the list, the most popular factor, personality, and two other factors, communication and gender, have been selected in order to study their impact on pair programming product outcome and the level of communication, satisfaction, confidence and compatibility. An experiment focusing on these factors is designed and implemented. From the experimental findings, the personality of the two partners in pair programming is found to have a significant impact on the pair programming output. Also, it is discovered that same gender pairs exhibited an unusually high level of communication, satisfaction and compatibility between each other, especially among female-female pairs. A detailed statistical experiment result based on research hypotheses is reported.
Search performance analysis and robust search algorithm in unstructured peer-to-peer networks
Authors: Tsungnan Lin, Hsinping Wang, Jianming Wang
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

Recently peer-to-peer networks (P2P) have gained great attention and popularity. One key challenging aspect in a P2P resource sharing environment is an efficient searching algorithm. This is especially important for Gnutella-like decentralized and unstructured networks due to the power-law degree distributions. We propose a hybrid search algorithm that decides the number of running walkers dynamically with respect to peers' topological information and search time state. It is able to control the extent of messages generating temporally by the simulated annealing mechanism, thus being a scalable search. Furthermore, we present a unified quantitative search performance metric, search efficiency, to objectively capture dynamic behavior of various search algorithms in terms of scalability, reliability and responsiveness. We quantitatively characterize, through simulations, the performance of various existing search algorithms. The proposed algorithm outperforms others in terms of search efficiency in both the local and global search spaces.
Guest Editors' Introduction: New Dimensions in 3D Integration
Authors: Sachin Sapatnekar, Kevin Nowka
Venue: IEEE Design Test (2005)

Although various forms of 3D fabrication technology have existed for a few decades, only in recent years have researchers developed highly integrated 3D design technologies that are potentially manufacturable and economically feasible. Several companies are already marketing 3D structures built by wafer stacking, where the distance between the 3D layers on a wafer are on the order of the wafer thickness. But 3D technology must also surmount several challenges, such as exploiting the design space to build high-performance systems and architectures to gain the fullest advantage achievable. The articles in this special issue highlight these advances and challenges, providing an excellent snapshot of the state of 3D technology as it stands today.
An Operational Semantics for DFM, a Formal Notation for Modelling Asynchronous Web Services Coordination
Authors: Jingtao Yang, Corina Cirstea, Peter Henderson
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

This paper presents the DFM notation and its operational semantics. DFM (Document Flow Model) is a message-based workflow notation for modelling asynchronous web services communication, which uses coordination mechanisms to support dynamic configurations and long-running business processes. The operational semantics of a DFM specification describes the possible behaviours of a system of interrelated web services, in terms of the messages that can be exchanged during the execution of one or more business processes, and the effect each message execution has on the business process state
Development and validation of a methodology to assess privacy sensitivity
Authors: Alfred Alexander Hamilton
Venue:  (2005)

Individual privacy has always been a significant issue with consumers. However, with the advent of the Internet and the commercial use of the Internet, it has taken on a much greater significance. Over the years, technology has gradually caused the erosion of the distinction between what is private and what is public. The value of personal information for organizations has increased. As a result, online businesses are economically motivated to gather and use greater amounts of personal information. In order to maintain market advantage, organizations need to develop ways to determine what personal information should be collected and with whom that information should be shared. The purpose of this study was to explore the concept of privacy sensitivity, which was defined as the attitudinal disposition of an individual's willingness to share information of a personal nature. The study explored this concept by examining response latency, which is a proposed determinant of privacy sensitivity. Response latency is defined as the amount of time it takes a respondent to respond to a request. Response latency has been extensively examined in the marketing and advertising industry. Additionally, this study conducted a field simulation exercise, which explored various privacy items and determined which of those items people are most sensitive about. This study addressed the following questions: (1) What is privacy sensitivity and how may it be measured and (2) How do different dimensions of privacy sensitivity vary with response latency? Results of this study provided two important factors: (1) It provided organizations the foundation to improve and develop Internet technologies, which address individual privacy concerns; and (2) it provided a methodology for organizations to determine what personal information individuals are sensitive about. The establishment of a foundational base for understanding the concept of privacy sensitivity could affect the future development of privacy-friendly Internet technologies. The ultimate significance of this study was to further define privacy sensitivity and to provide a baseline for further research on this topic.
Automatic discovery of query-class-dependent models for multimodal search
Authors: Lyndon S. Kennedy, Apostol (Paul) Natsev, Shih-Fu Chang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We develop a framework for the automatic discovery of query classes for query-class-dependent search models in multimodal retrieval. The framework automatically discovers useful query classes by clustering queries in a training set according to the performance of various unimodal search methods, yielding classes of queries which have similar fusion strategies for the combination of unimodal components for multimodal search. We further combine these performance features with the semantic features of the queries during clustering in order to make discovered classes meaningful. The inclusion of the semantic space also makes it possible to choose the correct class for new, unseen queries, which have unknown performance space features. We evaluate the system against the TRECVID 2004 automatic video search task and find that the automatically discovered query classes give an improvement of 18% in MAP over hand-defined query classes used in previous works. We also find that some hand-defined query classes, such as "Named Person" and "Sports" do, indeed, have similarities in search method performance and are useful for query-class-dependent multimodal search, while other hand-defined classes, such as "Named Object" and "General Object" do not have consistent search method performance and should be split apart or replaced with other classes. The proposed framework is general and can be applied to any new domain without expert domain knowledge.
A New Space-Time Multiple Trellis Coded Modulation Scheme Using Transmit Symbol Phase Rotation
Authors: Susu Jiang, Ryuji Kohno
Venue: Wireless Personal Communications: An International Journal (2005)

Space-time multiple trellis coded modulation (ST-MTCM) has been introduced in order to achieve maximum transmit diversity gain and larger coding gain with the existence of parallel paths. In our previous research, we designed a new coded modulation scheme for ST-MTCM which simultaneously maximizes the coding gain and diversity gain utilizing Hadamard Matrix giving the maximum determinant. This scheme, however, cannot achieve full transmit rate. In this paper, we extend our research so as to achieve full rate transmission as well as maximum coding and diversity gain. In addition, Super-Orthogonal Space-Time Trellis Code (SO-STTC) is well known for its high coding gain, full diversity gain and full transmit rate. Even though our proposed scheme is essentially the same as SO-STTC, we show in this paper that our proposed code design is different from SO-STTC, and achieves better performance. Our proposed code design utilizes transmit symbol phase rotation at a certain time slot so as to avoid same path transition in trellis, which occurs with conventional SO-STTC scheme. We design codes with different way of phase rotation for different MPSK modulation scheme, and simulation results show the improvements of our proposed codes for MPSK modulation with different number of states.
Millimeter wave up-converted UWB based positioning system
Authors: Michael Bocquet, Christophe Loyez, Aziz Benlarbi-Delaï
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Ad hoc network connectivity and efficient energy communication require the use of optimized routing algorithms. Input data of such algorithms are the spatial coordinates of each mobile station (MS). These coordinates could be given by GPS based system or by alternative ways involving modern technology able to ensure both communication and location.An original solution, based on a like Ultra Wide Band (UWB) technology, uses millimeter multitone dual transmission acting like a pulse composite signal and a basic millimeter receiver involving Enhanced Time Difference Of Arrival (E-TDOA) measurements.
Cheating in Visual Cryptography
Authors: Gwoboa Horng, Tzungher Chen, Du-Shiau Tsai
Venue: Designs, Codes and Cryptography (2006)

A secret sharing scheme allows a secret to be shared among a set of participants, P, such that only authorized subsets of P can recover the secret, but any unauthorized subset cannot recover the secret. In 1995, Naor and Shamir proposed a variant of secret sharing, called visual cryptography, where the shares given to participants are xeroxed onto transparencies. If X is an authorized subset of P, then the participants in X can visually recover the secret image by stacking their transparencies together without performing any computation. In this paper, we address the issue of cheating by dishonest participants, called cheaters, in visual cryptography. The experimental results demonstrate that cheating is possible when the cheaters form a coalition in order to deceive honest participants. We also propose two simple cheating prevention visual cryptographic schemes.
Keeping encountered information
Authors: Catherine C. Marshall, William Jones
Venue: Communications of the ACM (2006)

Utility, serendipity, and the pleasure of encountering what we save relies on more than search alone when using PIM tools.
Relative Perturbation Bounds for Positive Polar Factors of Graded Matrices
Authors: Ren-Cang Li
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

Let $B$ be an $m\times n$ ($m\ge n$) complex (or real) matrix. It is known that there is a unique {\em polar decomposition} $B=QH$, where $Q^*Q=I$, the $n\times n$ identity matrix, and $H$ is positive definite, provided that $B$ has full column rank. If $B$ is perturbed to $\wtd B$, how do the polar factors $Q$ and $H$ change? This question has been investigated quite extensively, but most work so far has been on how the perturbation changed the unitary polar factor $Q$, with very little on the positive polar factor $H$, except $\|H-\wtd H\|_{\F}\le\sqrt 2\|B-\wtd B\|_{\F}$ in the Frobenius norm, due to [F. Kittaneh, {\em Comm.\ Math.\ Phys.}, 104 (1986), pp. 307--310], where $\wtd Q$ and $\wtd H$ are the corresponding polar factors of $\wtd B$. While this inequality of Kittaneh shows that $H$ is always well behaved under perturbations, it does not tell much about smaller entries of $H$ in the case when $H$'s entries vary a great deal in magnitude. This paper is intended to fill the gap by addressing the variations of $H$ for a graded matrix $B=GS$, where $S$ is a scaling matrix and usually diagonal (but may not be). The elements of $S$ can vary wildly, while $G$ is well conditioned. In such cases, the magnitudes of $H$'s entries indeed often vary a lot, and thus any bound on $\|H-\wtd H\|_{\F}$ means little, if anything, to the accuracy of $\wtd H$'s smaller entries. This paper proposes a new way of measuring the errors in the $H$ factor via bounding the scaled difference $(\wtd H-H)S^{-1}$, as well as accurately computing the factor when $S$ {\em is\/} diagonal. Numerical examples are presented.The results are also extended to the matrix square root of a graded positive definite matrix.
A Scientific Approach to Cyberattack Detection
Authors: Nong Ye, Toni Farley
Venue: Computer (2005)

Attack-norm separation uses rigorous signal detection models to isolate attack signals from normal data before attack identification. By drawing from science instead of heuristics, this approach promises more efficient, accurate, and inclusive attack identification.
Suboptimal Alignments Improve the Detection of Weak Homologs in Sequence Database Searches
Authors: Yuheng Li, Mario Lauria, Ralf Bundschuh
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

PSI-BLAST remains one of the popular tools for searching remote homologs in sequence databases. We recently demonstrated that hybrid alignment can function as the alignment core for PSI-BLAST without loss of sensitivity. Here, we start to exploit the benefits of hybrid alignment. We show that incorporating information about the suboptimal alignments, otherwise ignored in PSI-BLAST, already improves the sensitivity of our enhanced version of PSI-BLAST. More interestingly, we find a set of sequences on which our tool disagrees with the classification given by SCOP. Careful examination points to a possible misclassificationin SCOP. Cross-referencing with two other methods of protein structure classification, CATH and DALI, supports this view, indicating that the enriched information from suboptimal alignments is valuable for detecting more weakly homologous sequences.