ppxscal/embedding_network huggingface dataset:
Quality assessment of interactive voice applications
Authors: Ana Paula Couto da Silva, Martín Varela, Edmundo de Souza e Silva, Rosa M. M. Leão, Gerardo Rubino
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The conversational quality of a VoIP communication is dependent on several factors such as the coding process used, the network conditions and the type of error correction or concealment employed. Furthermore, the quality perceived by the users is also dependent on the characteristics of the conversation itself. Assessing this kind of communication is a very difficult problem, and most of the studies available in the literature simplify the issue by restricting the analysis to only one or two parameters. However, the number of potentially affecting factors is typically higher, and their joint effect on quality is complex. In this paper we study the combined effects of bit rate, forward error correction, loss rate, loss distribution, delay and jitter on the perceived conversational quality. In order to achieve this we use the pseudo-subjective quality assessment (PSQA) technique, which allows us to obtain accurate, subjective-like assessments, in real time if necessary. Our contributions are thus twofold: firstly, we offer a detailed analysis of the impact of these parameters and their interactions on the perceived conversational quality. Secondly, we show how the PSQA methodology can be used to provide accurate conversational quality estimations.
Mathematical morphology based automated control point detection from human facial image
Authors: Md. Haider Ali, Ishrat Rahman Sami, Mahzabeen Islam, Mohammad Shahiduzzaman
Venue: Machine Graphics Vision International Journal (2007)

The ultimate goal of this research is to incorporate facial animation based on image morphing in a very narrow bandwidth video transmission, especially in video conferencing, news telecast etc., where the background as well as the object in the image change little. As a part of the whole work, in this paper, an efficient mathematical morphology-based facial feature control point detection technique is proposed. By facial feature control point we mean facial feature (i.e. eye, lip etc.) surrounding points and other important points in the face which can be utilized to create facial animation based on image metamorphosis. In the experiment, mathematical morphology tools are used both for filtering and pattern matching. At first, intensity-independent, color-based segmentation is used with some morphological processing on the input image to separate skin regions. Then, the parallel eye segments are searched by erosion of the edge-thinned image with eye corner structuring elements. By combining them, the probable eye segment pair is identified. Then, using facial structural knowledge, the lips and other control points are detected. The accuracy of the proposed method is within quite acceptable limits; moreover, the method is capable of working with images of average quality or close to average quality.
Structure of the Thai Web Graph
Authors: Kulwadee Somboonviwat, Shinji Suzuki, Masaru Kitsuregawa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper presents structural properties of the Thai Web graph. We conduct an empirical study on the Webgraphs induced from two Thai web snapshots crawled during January 2007 (5.7M nodes and 12M directed edges) and May 2007 (18.8M nodes and 70M directed edges). From each Thai web snapshot, we extract statistical and structural properties of the associated graph including degree distribution, weakly and strongly connected components, and macroscopic structure. Our main findings are: (1) Although differing in scale and sampled time both samples of the Thai Web exhibit similar graphical properties, and (2) The macroscopic structure of the Thai Web differs from other Web subgraphs studied earlier.
Improvement of active contour model with decentralized cooperative processing and its application to remote sensing
Authors: Noriko Matsumoto, Norihiko Yoshida, Shuji Narazaki
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

Active Contour Model, "Snake", is one of the most popular boundary detection methods. Its principle is an energy-minimizing spline for estimating the closest contour of a target object in an image gradually from an initial contour. However, this method has difficulty to determine an initial contour and parameters, and it cannot detect the target boundary precisely when the target image does not have clear edges or uniform feature. In this paper, we propose decentralized cooperative processing applied to Snake, which applied multiple Snakes to a single region, to improve its detection accuracy. The multiple Snakes run in coorperation with each other so as to increase the possibility of reaching the global optimum, and improve the estimation qualities. We verify the effectiveness of our proposal, in particular Multi-Snakes with different parameter sets, and Multi-Snakes applied to RGB-decomposed images, through the experiments using artificial images and real images. We then apply it to multi-spectral remote sensing, and show that our proposal detected the boundary with enough accuracy.
Grouping Levels of Exposure with Same Observable Effects before Class Prediction in Toxicogenomics
Authors: Vincent Guillemot, Cathy Philippe, Arthur Tenenhaus, Jérôme Rollin, Xavier Gidrol, Vincent Frouin
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

Gene expression profiling in toxicogenomics is often used to find molecular signature of toxicants. The range of doses chosen in toxicogenomics studies does not always represent all the possible effects on gene expression: several doses of toxicant can lead to the same observable effect on the transcriptome. This makes the problem of dose exposure prediction difficult to address. We propose a strategy allowing to gather the doses with similar effects prior to the computing of a molecular signature. The different gatherings of doses are compared with criteria based on likelihood or Monte Carlo Cross Validation. The molecular signature is then determined via a voting algorithm. Experimental results point out that the obtained classifier has better prediction performances than the classifier computed according to the original labeling.
A tree-based scheme for security of many-to-many communications
Authors: Ren-Hung Lin, Jinn-Ke Jan
Venue: Journal of High Speed Networks (2007)

In many-to-many group secure communications, group members may broadcast or receive messages during any session. A fast session key distribution scheme is desirable for handling highly changeable message flows among group members. In this paper, we propose a group keying scheme using tree structures for many-to-many group secure communications. The key storage and computational complexity of the proposed scheme are acceptable and practical for real-life applications. Moreover, once keys are distributed, group members will be able to freely communicate with any member in security with no need of a group controller.
Time-optimum packet scheduling for many-to-one routing in wireless sensor networks
Authors: Wen-Zhan Song, Fenghua Yuan, Richard LaHusen, Behrooz Shirazi
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

This paper studies the wireless sensor networks (WSN) application scenario with periodical traffic from all sensors to a sink. We present a time-optimum and energy-efficient packet scheduling algorithm and its distributed implementation. We first give a general many-to-one packet scheduling algorithm for wireless networks, and then prove that it is time-optimum and costs [image omitted] , N(u0) - 1) time slots, assuming each node reports one unit of data in each round. Here [image omitted]  is the total number of sensors, while [image omitted]  denotes the number of sensors in a sink's largest branch subtree. With a few adjustments, we then show that our algorithm also achieves time-optimum scheduling in heterogeneous scenarios, where each sensor reports a heterogeneous amount of data in each round. Then we give a distributed implementation to let each node calculate its duty-cycle locally and maximize efficiency globally. In this packet-scheduling algorithm, each node goes to sleep whenever it is not transceiving, so that the energy waste of idle listening is also mitigated. Finally, simulations are conducted to evaluate network performance using the Qualnet simulator. Among other contributions, our study also identifies the maximum reporting frequency that a deployed sensor network can handle.
Domain-specific languages as key tools for ulssis engineering
Authors: Jan Heering, Marjan Mernik
Venue: Proceedings of the 2nd international workshop on Ultra-large-scale software-intensive systems (2008)

We briefly discuss the potential of domain-specific languages and domain-specific modeling languages for ULSSIS engineering, some of the scaling challenges involved, and the possibilities for raising expressiveness beyond current levels.
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract
Authors: Rahul Jain, Hartmut Klauck, Ashwin Nayak
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

A basic question in complexity theory is whether the computational resources required for solving k independent instances of the same problem scale as k times the resources required for one instance. We investigate this question in various models of classical communication complexity. We introduce a new measure, the subdistribution bound , which is a relaxation of the well-studied rectangle or corruption bound in communication complexity. We nonetheless show that for the communication complexity of Boolean functions with constant error, the subdistribution bound is the same as the latter measure, up to a constant factor. We prove that the one-way version of this bound tightly captures the one-way public-coin randomized communication complexity of any relation, and the two-way version bounds the two-way public-coin randomized communication complexity from below. More importantly, we show that the bound satisfies the strong direct product property under product distributions for both one- and two-way protocols, and the weak direct product property under arbitrary distributions for two-way protocols. These results subsume and strengthen, in a unified manner, several recent results on the direct product question. The simplicity and broad applicability of our technique is perhaps an indication of its potential to solve yet more challenging questions regarding the direct product problem.
Nonterminal Complexity of Some Operations on Context-Free Languages
Authors: Jürgen Dassow, Ralf Stiebe
Venue: Fundamenta Informaticae (2008)

We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals necessary to generate a language. More specifically, we consider the behaviour of this measure with respect to language-theoretic operations. For given numbers c$_1$, c$_2$, &mldr;, c$_n$ and an n-ary operation &tau; on language, we discuss the range of Var (&tau;(L$_1$,L$_2$,&mldr;L$_n$)) where for 1 &les;i&les;n, L$_i$ is a context-free language with Var (L$_i$) = c$_i$. The operations under discussion are the six AFL-operations: union, concatenation, Kleene-closure, homomorphisms, inverse homomorphisms and intersections by regular sets.
Constructing difference tools for models using the SiDiff framework
Authors: Maik Schmidt, Tilman Gloetzner
Venue: Companion of the 30th international conference on Software engineering (2008)

Model-driven development requires a full set of development tools. While technologies for constructing graphical editors, compilers etc. are readily available, there is a lack of approaches for constructing version management tools which compare models and show their difference. The general problem is aggravated by the fact that such tools must consider the semantics of each particular model (or diagram) type, i.e. a whole family of tools needs to be constructed. This research demonstration shows how such families of difference tools can be constructed using the SiDiff framework.
Time-decaying aggregates in out-of-order streams
Authors: Graham Cormode, Flip Korn, Srikanta Tirthapura
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events such as stock feeds, sensor readings, or IP traffic measurements, data tuples pertaining to recent events are typically more important than older ones. This can be formalized via time-decay functions, which assign weights to data based on the age of data. Decay functions such as sliding windows and exponential decay have been studied under the assumption of well-ordered arrivals, i.e., data arrives in non-decreasing order of time stamps. However, data quality issues are prevalent in massive streams (due to network asynchrony and delays etc.), and correct arrival order is not guaranteed. We focus on the computation of decayed aggregates such as range queries, quantiles, and heavy hitters on out-of-order streams, where elements do not necessarily arrive in increasing order of timestamps. Existing techniques such as Exponential Histograms and Waves are unable to handle out-of-order streams. We give the first deterministic algorithms for approximating these aggregates under popular decay functions such as sliding window and polynomial decay. We study the overhead of allowing out-of-order arrivals when compared to well-ordered arrivals, both analytically and experimentally. Our experiments confirm that these algorithms can be applied in practice, and compare the relative performance of different approaches for handling out-of-order arrivals.
Radix Plus Length Based Insert Sort
Authors: Yongcheng Zhang
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Many applications depend on efficient sort algorithm to sort large sets of distinct string keys in memory. For example, sorting records for databases in which type of prime key is string. We propose a new improved radix sort algorithm, radix plus length based insert sort algorithm(R-LI), to sort large sets of string keys. The algorithm are used to sort set with length-changeable string key. R-LI algorithm is improvement of R-S algorithm given by M.DONALD Maclaren at 1966. Any radix sort method can be used as the first step of R-LI algorithm. The algorithm are based on characters which we give in this article as theorems. Detailed performance analysis is also given. R-LI algorithm is very faster than any simple radix sort which be used as first step of R-LI algorithm.
(S, N)- and R-implications: A state-of-the-art survey
Authors: Michał Baczyński, Balasubramaniam Jayaram
Venue: Fuzzy Sets and Systems (2008)

In this work we give a state-of-the-art review of two of the most established classes of fuzzy implications, viz., (S,N)- and R-implications. Firstly, we discuss their properties, characterizations and representations. Many new results concerning fuzzy negations and (S,N)-implications, notably their characterizations with respect to the identity principle and ordering property, are presented, which give rise to some representation results. Finally, using the presented facts, an almost complete characterization of the intersections that exist among some subfamilies of (S,N)- and R-implications are obtained.
Technical communique: Adaptive ILC for a class of discrete-time systems with iteration-varying trajectory and random initial condition
Authors: Ronghu Chi, Zhongsheng Hou, Jianxin Xu
Venue: Automatica (Journal of IFAC) (2008)

In this work we present a discrete-time adaptive iterative learning control (AILC) scheme to deal with systems with time-varying parametric uncertainties. Using the analogy between the discrete-time axis and the iterative learning axis, the new adaptive ILC can incorporate a Recursive Least Squares (RLS) algorithm, hence the learning gain can be tuned iteratively along the learning axis and pointwisely along the time axis. When the initial states are random and the reference trajectory is iteration-varying, the new AILC can achieve the pointwise convergence over a finite time interval asymptotically along the iterative learning axis.
Introducing Variable Gap Penalties into Three-Sequence Alignment for Protein Sequences
Authors: Che-Lun Hung, Chun-Yuan Lin, Yeh-Ching Chung, Chuan Yi Tang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The common-use gap penalty strategies, constant penalty and affine gap penalty, have been adopted in the traditional three-sequence alignment algorithm which considers the insertion, deletion, and substitution. However, these strategies are not suitable to protein sequence alignments. For the alignment accuracy of protein sequences, the gap penalty is a major determinant. Incorporating protein structure information to vary the gap penalties can lead to more biologically correct alignments. Here, we present an algorithm to find a global and optimal alignment among three protein sequences by using position-specific gap penalties which allow gap penalties to be varied. Thus, residue-dependent information and protein structure information can be applied to the three-sequence alignment. The experimental results show that our algorithm achieves the significant improvement in the accuracy of alignments than the three-sequence alignment algorithm with the affine gap penalty for protein sequences.
A novel method for parameter optimization in two-dimensional dynamical models
Authors: Guanyu Wang
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

A new method is given to optimize parameters of a dynamical model by supplementing the conventional methods with a contractive mapping procedure. Numerical results indicate that the present method is more efficient than conventional methods.
Design and Implementation of a JXTA-Overlay P2P System and Smart Box Environment
Authors: Keita Matsuo, Leonard Barolli, Fatos Xhafa, Akio Koyama, Arjan Durresi, Makoto Takizawa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we present the design and implementation of the JXTA-based e-Learning P2P system. We also show the design and implementation of a smart box environment that will be used for stimulating the learners to increase the learning efficiency. The smart box is intended to be integrated with our P2P system as a useful tool for monitoring and controlling learners' activity. Finally, it is also useful to evaluate the feasibility of our P2P platform to integrate different computational devices.
A ranking method based on users' contexts for information recommendation
Authors: Kenta Oku, Shinsuke Nakajima, Jun Miyazaki, Shunsuke Uemura, Hirokazu Kato
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

We propose a ranking method using a Support Vector Machine for information recommendation. By using the SVM, a recommendation method can determine suitable items for a user from enormous item sets. However, it can decide based on just two classes: whether the user likes a thing or not. When there is a large number of recommended items, it is not easy for the user to find the best item by herself. To resolve this issue, it is desirable to rank the items based on the user's preferences. Moreover, the user's preferences change depending on the context. Based on the above problem, we propose a context-aware ranking method for information recommendation. Our method considers a user's context when ranking items. Our method consists of the following two steps: (1) Predicting important feature parameters for the user. (2) Calculating a ranking score of each item in recommendation candidates. In this paper, we describe our method and show experimental results.
EEG Analysis Using HHT: One Step Toward Automatic Drowsiness Scoring
Authors: Hassan Sharabaty, Bruno Jammes, Daniel Esteve
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper proposes an algorithm for automatic location of alpha and theta waves in electroencephalogram. This algorithm is a part of developments that aim to process EEG and electroocculogram in order to estimate the drowsiness level of active subjects. Our algorithm is based on a method recently developed to analyse non-stationary signals: Hilbert Huang Transform (HHT). This transform proposes to decompose multi-modal signals into a sum of mono-contribution functions called Intrinsic Mode Functions, then to use the Hilbert Transform to compute the instantaneous frequency of each IMF. After a brief review of HHT principles, we propose a qualitative analysis of Hilbert transform accuracy and a method to decrease computation errors that appears when amplitude of the analysed signal is small. The last section of this paper presents the algorithm proposed to locate alpha and theta waves and preliminary results.
Numerical primary decomposition
Authors: Anton Leykin
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

Consider an ideal I ⊂ R = C[x1,...,xn] defining a complex affine variety X ⊂ Cn. We describe the components associated to I by means of numerical primary decomposition (NPD). The method is based on the construction of deflation ideal I(d) that defines the deflated variety X(d) in a complex space of higher dimension. For every embedded component there exists d and an isolated component Y(d) of I(d) projecting onto Y. In turn, Y(d) can be discovered by existing methods for prime decomposition, in particular, the numerical irreducible decomposition, applied to X(d). The concept of NPD gives a full description of the scheme Spec(R/I) by representing each component with a witness set. We propose an algorithm to produce a collection of witness sets that contains a NPD and that can be used to solve the ideal membership problem for I.
On the Precision and Accuracy of Impact Analysis Techniques
Authors: Lile Hattori, Dalton Guerrero, Jorge Figueiredo, João Brunet, Jemerson Damásio
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Several techniques and algorithms for impact analysis of software systems have been recently published in literature. Most of them, however, are not practical enough to be applied in the software industry because, among other reasons, they produce too many false results (either positive or negative). In this paper, we propose and evaluate the use of two measures from information retrieval, namely precision and recall, to help express and compare precision and accuracy of impact analysis techniques and algorithms.
A modular framework for iterative combinatorial auctions
Authors: Séstien Lahaie, David C. Parkes
Venue: ACM SIGecom Exchanges (2008)

We describe a modular elicitation framework for iterative combinatorial auctions. The framework includes proxy agents, each of which can adopt an individualized bidding language to represent partial value information of a bidder. The framework leverages algorithms from query learning to elicit value information via bids as the auction progresses. The approach reduces the multi-agent elicitation problem to isolated, single-agent learning problems, with competitive equilibrium prices used to facilitate auction clearing even without complete learning.