ppxscal/embedding_network huggingface dataset:
Reliable Streaming Transmission Using PR-SCTP
Authors: Tomotaka Maeda, Masahiro Kozuka, Yasuo Okabe
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Combination of RTP and UDP is commonly used in real-time video streaming, today. In fear of packet loss, FEC may be used to recover the lost packet data in RTP. But there is a limit in the tolerance to a burst packet loss. We propose to transmit real-time video streams that have tolerance to a burst packet loss by combining RTP with PR-SCTP. By retransmission within the range of the delay restriction specified by PR-SCTP while doing buffering, the tolerance to a burst packet loss can be improved in exchange for some delay.We have implemented the proposed method as a translator of RTP in consideration of interoperability with the existing application implemented with RTP/UDP. And we artificially caused the burst-packet loss as an experiment in the translator and evaluate the outcome of an experiment.
From Entity Relationship to XML Schema: A Graph-Theoretic Approach
Authors: Massimo Franceschet, Donatella Gubiani, Angelo Montanari, Carla Piazza
Venue: Proceedings of the 6th International XML Database Symposium on Database and XML Technologies (2009)

We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constraints are preserved, no redundance is introduced, different hierarchical views of the conceptual information are available, the resulting XML structure is highly connected, and the design is reversible. We investigate two different ways to nest the XML structure: a maximum connectivity nesting, that minimizes the number of schema constraints used in the mapping of the conceptual schema reducing the validation overhead, and a maximum depth nesting, that keeps low the number of (expensive) join operations that are necessary to reconstruct the information at query time using the mapped schema. We propose a graph-theoretic linear-time algorithm to find a maximum connectivity nesting and show that finding a maximum depth nesting is NP-complete. We complement our investigation with an implementation of the devised translation and we embed the implemented module in a software framework for the conceptual and logical design of spatio-temporal databases.
A grid portal for solving geoscience problems using distributed knowledge discovery services
Authors: Gianluigi Folino, Agostino Forestiero, Giuseppe Papuzzo, Giandomenico Spezzano
Venue: Future Generation Computer Systems (2010)

This paper describes our research effort to employ Grid technologies to enable the development of geoscience applications by integrating workflow technologies with data mining resources and a portal framework in unique work environment called MOSE. Using MOSE, a user can easily compose and execute geo-workflows for analyzing and managing natural disasters such as landslides, earthquakes, floods, wildfires, etc. MOSE is designed to be applicable both for the implementation of response strategies when emergencies occur and for disaster prevention. It takes advantage of the standardized resource access and workflow support for loosely coupled software components provided by web/grid services technologies. The integration of workflows with data mining services significantly improves data analysis. Geospatial data management and mining are critical areas of modern-day geosciences research. An important challenge for geospatial information mining is the distributed nature of the data. MOSE provides knowledge discovery services based on the WEKA data mining library and novel distributed data mining algorithms for spatial data analysis. A P2P bio-inspired algorithm for distributed spatial clustering as an example of distributed knowledge discovery service for intensive data analysis is presented. A real case application for the analysis of landslide hazard areas in the Campania Region near the Sarno area shows the advantages of using the portal.
Designing plush toys with a computer
Authors: Yuki Igarashi, Takeo Igarashi
Venue: Communications of the ACM (2009)

We introduce Plushie, an interactive system that allows nonprofessional users to design their own original plush toys. To design a plush toy, one needs to construct an appropriate two-dimensional (2D) pattern. However, it is difficult for nonprofessional users to appropriately design a 2D pattern. Some recent systems automatically generate a 2D pattern for a given three-dimensional (3D) model, but constructing a 3D model is itself a challenge. Furthermore, an arbitrary 3D model cannot necessarily be realized as a real plush toy, and the final sewn result can be very different from the original 3D model. We avoid this mismatch by constructing appropriate 2D patterns and applying simple physical simulation to it on the fly during 3D modeling. In this way, the model on the screen is always a good approximation of the final sewn result, which makes the design process much more efficient. We use a sketching interface for 3D modeling and also provide various editing operations tailored for plush-toy design. Internally, the system constructs a 2D cloth pattern in such a way that the simulation result matches the user's input stroke. We successfully demonstrated that nonprofessional users could design plush toys or balloon easily using Plushie.
On Entropy-Compressed Text Indexing in External Memory
Authors: Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) and also simultaneously achieve good query performance. Two popular indexes, namely the FM-index [Ferragina and Manzini, 2005] and the CSA [Grossi and Vitter 2005], achieve this goal by exploiting the Burrows-Wheeler transform (BWT) [Burrows and Wheeler, 1994]. However, due to the intricate permutation structure of BWT, no locality of reference can be guaranteed when we perform pattern matching with these indexes. Chien et al. [2008] gave an alternative text index which is based on sparsifying the traditional suffix tree and maintaining an auxiliary 2-D range query structure. Given a text T of length n drawn from a ¿-sized alphabet set, they achieved O(n log¿)-bit index for T and showed that this index can preserve locality in pattern matching and hence is amenable to be used in external-memory settings. We improve upon this index and show how to apply entropy compression to reduce index space. Our index takes O(n(H k + 1)) + o(nlog¿) bits of space where H k is the kth-order empirical entropy of the text. This is achieved by creating variable length blocks of text using arithmetic coding.
A Hybrid Image Quality Measure for Automatic Image Quality Assessment
Authors: Atif Bin Mansoor, Maaz Haider, Ajmal S. Mian, Shoab A. Khan
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

Automatic image quality assessment has many diverse applications. Existing quality measures are not accurate representatives of the human perception. We present a hybrid image quality (HIQ) measure, which is a combination of four existing measures using an `n' degree polynomial to accurately model the human image perception. First we undertook time consuming human experiments to subjectively evaluate a given set of training images, and resultantly formed a Human Perception Curve (HPC). Next we define a HIQ measure that closely follows the HPC using curve fitting techniques. The HIQ measure is then validated on a separate set of images by similar human subjective experiments and is compared to the HPC.The coefficients and degree of the polynomial are estimated using regression on training data obtained from human subjects. Validation of the resultant HIQ was performed on a separate validation data. Our results show that HIQ gives an RMS error of 5.1 compared to the best RMS error of 5.8 by a second degree polynomial of an individual measure HVS (Human Visual System) absolute norm (H 1) amongst the four considered metrics. Our data contains subjective quality assessment (by 100 individuals) of 174 images with various degrees of fast fading distortion. Each image was evaluated by 50 different human subjects using double stimulus quality scale, resulting in an overall 8,700 judgements.
Certified Static Analysis by Abstract Interpretation
Authors: Frédéric Besson, David Cachera, Thomas Jensen, David Pichardie
Venue: Foundations of Security Analysis and Design V: FOSAD 2007/2008/2009 Tutorial Lectures (2009)

A certified static analysis is an analysis whose semantic validity has been formally proved correct with a proof assistant. We propose a tutorial on building a certified static analysis in Coq. We study a simple bytecode language for which we propose an interval analysis that allows to verify statically that no array-out-of-bounds accesses will occur.
MaHCO
Authors: David S. DeLuca, Elena Beisswanger, Joachim Wermter, Peter A. Horn, Udo Hahn, Rainer Blasczyk
Venue: Bioinformatics (2009)

Motivation: The high level of polymorphism associated with the major histocompatibility complex (MHC) poses a challenge to organizing associated bioinformatic data, particularly in the area of hematopoietic stem cell transplantation. Thus, this area of research has great potential to profit from the ongoing development of biomedical ontologies, which offer structure and definition to MHC-data related communication and portability issues. Results: We introduce the design considerations, methodological foundations and implementational issues underlying MaHCO, an ontology which represents the alleles and encoded molecules of the major histocompatibility complex. Importantly for human immunogenetics, it includes a detailed level of human leukocyte antigen (HLA) classification. We then present an ontology browser, search interfaces for immunogenetic fact and document retrieval, and the specification of an annotation language for semantic metadata, based on MaHCO. These use cases are intended to demonstrate the utility of ontology-driven bioinformatics in the field of immunogenetics. Availability and Implementation: The MaHCO Ontology is available via the BioPortal: http://www.bioontology.org/tools/portal/bioportal.html, and at: http://purl.org/stemnet/ Contact: david_deluca@dfci.harvard.edu Supplementary information:Supplementary data are available at Bioinformatics online.
Differential Space-Time Block Coding for IR-UWB
Authors: Rui Ding, Xiaoying Sun, Qiaoling Du
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In order to enhance the transmission performance of the IR-UWB (impulse radio ultra wideband) system, the space-time technology of MIMO (multiple input and multiple output) has been considered. In view of the low power in the UWB mobile terminal, we need to estimate the channel in the receiver when using the space-time code. However, the complexity of the terminal is increased. For this reason, the UWB difference space-time block code (DSTBC) is proposed for BPSK (Binary Phase Shift Keying) IR-UWB in this paper, which does not need to estimate the channel in the receiver and simplified the terminal complexity. the simulation show the performance of the scheme and prove it efficient and available.
Dynamic Simulation of Clutch Robot Leg of Robot Driver Based on ADAMS
Authors: Zhigang Niu, Yonghui Ma, Lili Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The kinematics analysis and dynamics simulation for clutch leg of robot driver are presented in this paper. By the dynamic simulation of clutch leg of robot driver based on ADAMS when turning on the engine, the curves of the key joint’s sanction and the clutch pedal pad velocity are obtained, and also the data for clutch robot leg design are offered. The simulation results are beneficial to characteristic evaluation and optimal design of robot drivers.
Developments of Interferometric Synthetic Aperture Radar About Monitoring Deformation
Authors: Chun-lai Dong
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Now, application of InSAR (Interferometric Synthetic Aperture Radar) to deformation monitoring has become a hotspot for monitoring deformation. The basic principles and data processing procedures of InSAR are introduced in this paper, at the same time, main progresses made in InSAR technology and its application to deformation monitoring are summarized. Through actual examples of application and research from home and abroad, the article figures out existing problems and future of application of InSAR.
Automatic extraction of data points and text blocks from 2-dimensional plots in digital documents
Authors: Saurabh Kataria, William Browuer, Prasenjit Mitra, C. Lee Giles
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Two dimensional plots (2-D) in digital documents on the web are an important source of information that is largely under-utilized. In this paper, we outline how data and text can be extracted automatically from these 2-D plots, thus eliminating a time consuming manual process. Our information extraction algorithm identifies the axes of the figures, extracts text blocks like axes-labels and legends and identifies data points in the figure. It also extracts the units appearing in the axes labels and segments the legends to identify the different lines in the legend, the different symbols and their associated text explanations. Our algorithm also performs the challenging task of separating out overlapping text and data points effectively. Our experiments indicate that these techniques are computationally efficient and provide acceptable accuracy.
A Novel Approach for Motif Identification in Unaligned Molecular Sequences
Authors: R. M. Chen, M. T. Hou, Jeffrey J. P. Tsai
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

Repetitive sequences of DNA are important to a number of regulatory functions; hence, to find repetitive DNA sequences is of considerable importance and worth to study. The purpose of this paper is to look for all possible repetitive sequences of DNA in a great deal and then to provide the biologists the repetitive sequences to do further work. Our approach first predicts the possible lengths of repetitive sequences based on the Fourier transform, and then proposes a so-called motif-identification algorithm (MIA) to find the repetitive patterns of the corresponding motif lengths. Our method compares favorably against some common motif-finding approaches, such as Spectral Repeat Finder and Gibbs sampler in all cases, and performs very well for the synthetic and real datasets.
Depth-bounded discrepancy search
Authors: Toby Walsh
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Many search trees are impractically large to explore exhaustively. Recently, techniques like limited discrepancy search have been proposed for improving the chance of finding a goal in a limited amount of search. Depth-bounded discrepancy search offers such a hope. The motivation behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top of the tree than at the bottom. We therefore combine one of the best features of limited discrepancy search-the ability to undo early mistakes-with the completeness of iterative deepening search. We show theoretically and experimentally that this novel combination outperforms existing techniques.
Discovering near symmetry in graphs
Authors: Maria Fox, Derek Long, Julie Porteous
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Symmetry is a widespread phenomenon that can offer opportunities for powerful exploitation in areas as diverse as molecular chemistry, pure mathematics, circuit design, biology and architecture. Graphs are an abstract way to represent relational structures. The search for symmetry in many contexts can thus be reduced to the attempt to find graph automorphisms. Brendan McKay's NAUTY system (McKay 1990) is an example of one of the highly successful products of research into this task. Erdös and Rényi showed that almost all large graphs are asymmetric, but it is readily observed that many graphs representing structures of real Interest contain symmetry. Even more graphs are nearly symmmetric, in the sense that to each graph there is a closely Similar graph that is symmetric. In this paper we explore the problem of finding near symmetries in graphs and describe the techniques we are developing for performing this task.
The Numerical Solutions for an Elliptic Control Problem
Authors: Razvan Stefanescu, Viorel Arnautu
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

The aim of our paper is to solve numerically a second order elliptic BVP, using a collocation method. Then, an optimal control problem governed by an elliptic equation is considered and numerical solutions are presented.
Overview of the INEX 2008 Entity Ranking Track
Authors: Gianluca Demartini, Arjen P. Vries, Tereza Iofciu, Jianhan Zhu
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

In many contexts a search engine user would prefer to retrieve entities instead of just documents. Example queries include "Italian nobel prize winners", "Formula 1 drivers that won the Monaco Grand Prix", or "German spoken Swiss cantons". The XML Entity Ranking (XER) track at INEX creates a discussion forum aimed at standardizing evaluation procedures for entity retrieval. This paper describes the XER tasks and the evaluation procedure used at the XER track in 2008, focusing specifically on the sampled pooling strategy applied first this year. We conclude with a brief discussion of the predominant participant approaches and their effectiveness.
A new clustering approach using similarity of patterns texture
Authors: Ghorban Kheradmandian, Mohammad Rahmati
Venue: Intelligent Data Analysis (2009)

In this paper, we proposed a new clustering method where each cluster is created based on its characteristic that we call texture. Extraction of the texture relies on measuring the similarity of neighboring patterns. Our proposed clustering algorithm consists of two stages. In the first stage, sub-clusters are created based on the similarity of their structures and in the second stage, the sub-clusters with similar textures and closeness of their distance are hierarchically combined to create a larger cluster. A theoretical justification for the proposed cluster isolation measure has been represented. Experimental results with complex data reveal that the performance of our method is superior than the well known K-means and Single Link methods. The proposed clustering algorithm is independent of the order of training samples appearance and its computational complexity is less than that of the traditional hierarchical algorithms.
Multidimensional Extension of Matsui's Algorithm 2
Authors: Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg
Venue: Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers (2009)

Matsui's one-dimensional Alg. 2 can be used for recovering bits of the last round key of a block cipher. In this paper a truly multidimensional extension of Alg. 2 based on established statistical theory is presented. Two possible methods, an optimal method based on the log-likelihood ratio and a ¿ 2-based goodness-of-fit test are compared in theory and by practical experiments on reduced round Serpent. The theory of advantage by Selçuk is generalised in multiple dimensions and the advantages and data, time and memory complexities for both methods are derived.
Brain Activities Supporting Finger Operations, Analyzed by Neuro-NIRS
Authors: Miki Fuchigami, Akira Okada, Hiroshi Tamura
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Brain activities are analyzed for the button selection task using Neuro-NIRS, which is analysis method of quick component of NIRS. Quick component of NIRS is numerically quantifies by short time average of absolute value. The average is represented by, maximum and density. Since button selection task is short time event, it seems the instantaneous activities, like maximum is playing major roles in finger selection to operate button.
BPM 3.0
Authors: August-Wilhelm Scheer, Joerg Klueckmann
Venue: Proceedings of the 7th International Conference on Business Process Management (2009)

Business Process Management (BPM) is an established management discipline. Since today's organizations expect every employee to think and act like an entrepreneur, i.e., like a manager, BPM is also increasingly becoming part of everyday operations. But merely adopting a process-based approach across the enterprise is not enough to enable BPM at every level. What is needed is a combination of organizational forms and technologies that support distributed BPM initiatives while simultaneously consolidating them company-wide. Every employee must be empowered to model and optimize their own processes. At the same time, the entire BPM community needs a platform that brings together all the individual initiatives. This is the only way to leverage the full potential of process-oriented management. In the following article, the authors describe the trends in BPM development that are turning users into process managers and supporting the creation of a BPM community.
Distances in Classification
Authors: Claus Weihs, Gero Szepannek
Venue: Proceedings of the 9th Industrial Conference on Advances in Data Mining. Applications and Theoretical Aspects (2009)

The notion of distance is the most important basis for classification. This is especially true for unsupervised learning, i.e. clustering, since there is no validation mechanism by means of objects of known groups. But also for supervised learning standard distances often do not lead to appropriate results. For every individual problem the adequate distance is to be decided upon. This is demonstrated by means of three practical examples from very different application areas, namely social science, music science, and production economics. In social science, clustering is applied to spatial regions with very irregular borders. Then adequate spatial distances may have to be taken into account for clustering. In statistical musicology the main problem is often to find an adequate transformation of the input time series as an adequate basis for distance definition. Also, local modelling is proposed in order to account for different subpopulations, e.g. instruments. In production economics often many quality criteria have to be taken into account with very different scaling. In order to find a compromise optimum classification, this leads to a pre-transformation onto the same scale, called desirability.
A flexemic tagset for Polish
Authors: Adam Przepiórkowski, Marcin Woliński
Venue: Proceedings of the 2003 EACL Workshop on Morphological Processing of Slavic Languages (2003)

The article notes certain weaknesses of current efforts aiming at the standardization of POS tagsets for morphologically rich languages and argues that, in order to achieve clear mappings between tagsets, it is necessary to have clear and formal rules of delimiting POSs and grammatical categories within any given tagset. An attempt at constructing such a tagset for Polish is presented.