ppxscal/embedding_network huggingface dataset:
Self-training Strategies for Handwriting Word Recognition
Authors: Volkmar Frinken, Horst Bunke
Venue: Proceedings of the 9th Industrial Conference on Advances in Data Mining. Applications and Theoretical Aspects (2009)

Handwriting recognition is an emerging subfield of human-computer interaction that has many potential industrial applications, e.g. in postal automation, bank check processing, and automatic form reading. Training a recognizer, however, requires a substantial amount of training examples together with their corresponding ground truth, which needs to be created by humans. A promising way to significantly reduce this effort, and hence cut system development costs, is offered by semi-supervised learning, in which both text with and text without transcription is used for training. However, until today there is no straightforward and established way of semi-supervised learning, particularly not for handwriting recognition. In the self-training approach, an initially trained recognition system creates a new training set from unlabeled data. Using this set, a new recognizer is created. The creation of the training set is done by selecting elements from the unlabeled set, according to their recognition confidence. The success of self-training depends crucially on the data selected. In this paper, we test and compare different rules used to select new training data for single word recognition with and without additional language information in the form of a dictionary. We demonstrate that it is possible to substantially increase the recognition accuracy for both systems.
Prediction and Analysis of Chinese CPI Based on RBF Neural Network
Authors: Wang Yu, Li Xudong
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Since 2007, CPI in our country has reached new high repeatedly, causes attention closely in society. Using data published by State Statistical Bureau, this article, after process, applies RBF neural network with momentum item to forecast separately CPI in 2008 and in 2009 will be respectively 109.4733 and 106.4275, and also puts forward some corresponding policy proposals.
Chinese Writer Identification Based on the Distribution of Character Skeleton
Authors: Luo Wei, Zhang Dexian, Wang Feng, Gong Zhile, Zhu Min, Bao Na
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

In this paper, a kind of Chinese character writer identification method is proposed and tested. Firstly, considering handwriting can be texture image in some sense, the Gabor wavelet is used to extract texture feature. Then a Local Direction Contribution Method (LDCM) is adopted to extract the local features of feature characters. In practice, we first skeletonise the character and then compute the skeleton direction distribution in each sub-region. Nearest neighbor classifier based on weighted Euclidean distance is utilized in classification. Experiment results verifies that the classification performance of LDCM is better than the Gabor method, and the correct identification rate of Top-3 candidates can reach 100% under the random combination of 3 feature characters.
Higher Radix Squaring Operations Employing Left-to-Right Dual Recoding
Authors: David W. Matula
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

We introduce a novel left-to-right leading digit first dual recoding of an operand for the purpose of designing the squaring operation on that operand. Our dual recoding yields an array of non-negative partial squares of size essentially one half that of a comparable multiplier partial product array for both radix-4 and radix-8 designs. For radix-8 design the 128-bit square of a 64-bit operand can be obtained from a consolidated partial square array of just 11 rows. We describe advantages of our left-to-right recoding compared to a previous right-to-left Booth-folding encoding applicable to radix-4. We also show simplifications available to the designs of a rounded floating point square operation and to a low precision approximate square.
Time-Sensitive Language Modelling for Online Term Recurrence Prediction
Authors: Dell Zhang, Jinsong Lu, Robert Mao, Jian-Yun Nie
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

We address the problem of online term recurrence prediction: for a stream of terms, at each time point predict what term is going to recur next in the stream given the term occurrence history so far. It has many applications, for example, in Web search and social tagging. In this paper, we propose a time-sensitive language modelling approach to this problem that effectively combines term frequency and term recency information, and describe how this approach can be implemented efficiently by an online learning algorithm. Our experiments on a real-world Web query log dataset show significant improvements over standard language modelling.
Improved Polynomial Identity Testing for Read-Once Formulas
Authors: Amir Shpilka, Ilya Volkovich
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are { + ,×} and such that every input variable labels at most one leaf. In this paper we study the problems of giving deterministic identity testing and reconstruction algorithms for ROFs. Our main result is an $n^{{\mathcal{O}}(k + \log n)}$ time deterministic algorithm for checking whether a black box holding the sum of k n-variate ROFs computes the zero polynomial. In other words, we provide a hitting set of size $n^{{\mathcal{O}}(k + \log n)}$ for the sum of k ROFs. This result greatly improves [27] where an $n^{{\mathcal{O}}(k^2 + \sqrt n)}$ algorithm was given for the problem.Using our new results we obtain a deterministic reconstruction algorithms for read-once formulas that runs in time $n^{{\mathcal{O}}(\log n)}$.In fact, our results also hold for the more general model of preprocessed read-once formulas that we define in this paper. In this model we are allowed to replace each variable x i with a polynomial T i (x i ).Our techniques are very close to the techniques in [27]. The main difference is that we obtain several tighter versions of the tools first used there. In particular we obtain a better version of the hardness of representation approach which was first used in [27]. This technique can be thought of as a very explicit way of transforming (mild) hardness of a very structured polynomial to an identity testing algorithm.
Relation Based Service Networks for Reliable Service Selection
Authors: Yi Wang, Jian Yang
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

With the steady growth of web services in recent years, service users are confronted with great difficulties in selecting suitable services from substantial functionally similar services in the complex service provisioning environment. Contradictions and incompatibilities arise during service selection in the design and maintenance of enterprize applications. To solve these problems, necessary relations such as inter-service dependencies as well as functional similarities should be explicitly clarified. In this paper we propose a concept of service networks (SNs) which can organize domain classified services in terms of relations. Service selection mechanisms based on the SNs are discussed. The SNs present a platform for service providers not only to publish services but to establish collaborations with other partners.
On the Design of Optimization Algorithms for Prediction of Molecular Interactions
Authors: Darby Tien-Hao Chang, Jung-Hsin Lin, Chih-Hung Hsieh, Yen-Jen Oyang
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

This article presents a comprehensive study on the main characteristics of a novel optimization algorithm specifically designed for simulation of protein-ligand interactions. Though design of optimization algorithms has been a research issue extensively studied by computer scientists for decades, the emerging applications in bioinformatics such as simulation of protein-ligand interactions and protein folding introduce additional challenges due to (1) the high dimensionality nature of the problem and (2) the highly rugged landscape of the energy function. As a result, optimization algorithms that are not carefully designed to tackle these two challenges may fail to deliver satisfactory performance. This study has been motivated by the observation that the RAME (Rank-based Adaptive Mutation Evolutionary) optimization algorithm specifically designed for simulation of protein-ligand docking has consistently outperformed the conventional optimization algorithms by a significant degree. Accordingly, it is of interest to conduct a comprehensive investigation on the characteristics of the proposed algorithm and to learn how it will perform in the more general cases.The experimental results reveal that the RAME algorithm proposed in this article is capable of delivering superior performance to several alternative versions of the genetic algorithm in handling highly-rugged functions in the high-dimensional vector space. This article also reports experiments conducted to analyze the causes of the observed performance difference. The experiences learned provide valuable clues for how the proposed algorithm can be effectively exploited to tackle other computational biology problems.
Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes
Authors: Leila Floriani, Daniele Panozzo, Annie Hui
Venue: Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition (2009)

Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its decomposition into a collection of components with a simpler topology. Here, we consider a decomposition of a non-manifold shape into components which are almost manifolds, and we present a novel graph representation which highlights the non-manifold singularities shared by the components as well as their connectivity relations. We describe an algorithm for computing the decomposition and its associated graph representation. We present a new tool for visualizing the shape decomposition and its graph as an effective support to modeling, analyzing and understanding non-manifold shapes.
Should Agents Speak Like, um, Humans? The Use of Conversational Fillers by Virtual Agents
Authors: Laura M. Pfeifer, Timothy Bickmore
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

We describe the design and evaluation of an agent that uses the fillers um and uh in its speech. We describe an empirical study of human-human dialogue, analyzing gaze behavior during the production of fillers and use this data to develop a model of agent-based gaze behavior. We find that speakers are significantly more likely to gaze away from their dialogue partner while uttering fillers, especially if the filler occurs at the beginning of a speaking turn. This model is evaluated in a preliminary experiment. Results indicate mixed attitudes towards an agent that uses conversational fillers in its speech.
Experiences with the Certification of a Generic Functional Safety Management Structure According to IEC 61508
Authors: Carlos G. Bilich, Zaijun Hu
Venue: Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security (2009)

This article summarizes the experiences undergone while supporting ABB Business Units (BUs) in achieving functional safety certification according to IEC 61508 for their safety related products. Being part of a large global organization, ABB BUs enjoy certain freedom in the way they implement their product development process both for hardware and software. Many times these processes are inherited from long standing and successful development tradition from companies that have been later incorporated by ABB. Given so, when faced to the increased demand of IEC 61508 compliant products, the BUs find themselves implementing IEC 61508 and adapting their development processes from scratch for each new product. As a consequence, there are many different ways throughout the organization of implementing similar artifacts with the same scope (i.e. templates, lifecycles, reports, etc.). Since the BUs have recognized that this is clearly not efficient for redundancy, repetition, and finally costs reasons we have undertaken the task of creating a generic process to be used as framework for developing safety compliant products according to IEC 61508 that can be reused for different products across BUs. The requirements of this framework are that it has to be easier to use than the original standard; self-contained (i.e. no need to look up information over the original standard), flexible (i.e. applicable for different kind of products across different BUs); be certifiable by any major certification body; coupled with ABB's stage-gate business decision model; and most importantly: be attractive to BUs so that it can be widely adopted throughouto the organization. In order to satisfy those requirements we have developed a method and a set of components that we call "Safety Add-on", to create and manage functional safety design and development activities according to IEC 61508. The Functional Safety Management module of the Safety Add-on has been certified by TÜV Rheinland and is being successfully used by several BUs across ABB.
Aggregation Functions (Encyclopedia of Mathematics and its Applications), 1st edition
Authors: Michel Grabisch, Jean-Luc Marichal, Radko Mesiar, Endre Pap
Venue:  (2009)

Aggregation is the process of combining several numerical values into a single representative value, and an aggregation function performs this operation. These functions arise wherever aggregating information is important: applied and pure mathematics (probability, statistics, decision theory, functional equations), operations research, computer science, and many applied fields (economics and finance, pattern recognition and image processing, data fusion, etc.). This is a comprehensive, rigorous and self-contained exposition of aggregation functions. Classes of aggregation functions covered include triangular norms and conorms, copulas, means and averages, and those based on nonadditive integrals. The properties of each method, as well as their interpretation and analysis, are studied in depth, together with construction methods and practical identification methods. Special attention is given to the nature of scales on which values to be aggregated are defined (ordinal, interval, ratio, bipolar). It is an ideal introduction for graduate students and a unique resource for researchers.
Poster abstract: Practical issues in image acquisition and transmission over wireless sensor network
Authors: F. J. Molina, J. Babancho, J. M. Mora, C. Leon
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Multimedia data have become an important objective in wireless sensor networks. Due to the node resource constraints (energy consumption, memory capacity, network latency and throughput) the incorporation of image sensor at the nodes is currently a challenge. In this paper, we study different node architectures, evaluating processing time, energy consumption, image quality and data delivery issues. The study shows that a specialized image co-processor is an optimal solution.
Evaluating Human Computer Interaction through Self-rated Emotion
Authors: Danielle Lottridge
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Research Area. Affective self-report, Emotion, Evaluation methods.Related Submissions. "Emotional Bandwidth: Information Theory Analysis of Affective Response Ratings Using a Continuous Slider" [12].Research Topic. This thesis investigates the tools, psychometric characteristics, physiological relationships, and overall benefits and limits of continuous self-rated emotion as a measure of conscious affective experience.
BRICK: a multi-context expression grained reconfigurable architecture
Authors: Juan Fernando Eusse, Michael Hübner, Ricardo Pezzuol Jacobi
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

In this work, we explore a new family of coarse grain reconfigurable architecture called BRICK, which is capable of mapping complete expressions and pipelines into one processing element with Multiple-Input, Multiple-Output characteristics while provided with a centralized control unit to synchronize the operation of each Processing Element (PE). Each PE has heterogeneous ALUs specialized in a particular type of operation. These ALUs can be interconnected to implement complex expressions, either sequential or combinational, increasing computational density and utilization rate of the reconfigurable Array. Preliminary synthesis results and application examples show that efficient mappings can be achieved with BRICK.
Term-Generic Logic
Authors: Andrei Popescu, Grigore Roşu
Venue: Recent Trends in Algebraic Development Techniques: 19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers (2009)

Term-generic logic (TGL) is a first-order logic parameterized with terms defined axiomatically (rather than constructively), by requiring them to only provide generic notions of free variable and substitution satisfying reasonable properties. TGL has a complete Gentzen system generalizing that of first-order logic. A certain fragment of TGL, called Horn 2, possesses a much simpler Gentzen system, similar to traditional typing derivation systems of ¿-calculi. Horn 2 appears to be sufficient for defining a whole plethora of ¿-calculi as theories inside the logic. Within intuitionistic TGL, a Horn 2 specification of a calculus is likely to be adequate by default. A bit of extra effort shows adequacy w.r.t. classic TGL as well, endowing the calculus with a complete loose semantics.
Mixture-model cluster analysis using information theoretical criteria
Authors: Jaime R. S. Fonseca, Margarida G. M. S. Cardoso
Venue: Intelligent Data Analysis (2007)

The estimation of mixture models has been proposed for quite some time as an approach for cluster analysis. Several variants of the Expectation-Maximization algorithm are currently available for this purpose. Estimation of mixture models simultaneously allows the determination of the number of clusters and yields distributional parameters for clustering base variables. There are several information criteria that help to support the selection of a particular model or clustering structure. However, a question remains concerning the selection of specific criteria that may be more suitable for particular applications. In the present work we analyze the relationship between the performance of information criteria and the type of measurement of clustering variables. In order to study this relationship we perform the analysis of forty-two data sets with known clustering structure and with clustering variables that are categorical, continuous and mixed type. We then compare eleven information-based criteria in their ability to recover the data sets' clustering structures. As a result, we select AIC3, BIC and ICL-BIC criteria as the best candidates for model selection that refers to models with categorical, continuous and mixed type clustering variables, respectively.
Identifying chemical names in biomedical text: an investigation of the substring co-occurrence based approaches
Authors: Alexander Vasserman
Venue: Proceedings of the Student Research Workshop at HLT-NAACL 2004 on XX (2004)

We investigate various strategies for finding chemicals in biomedical text using substring co-occurrence information. The goal is to build a system from readily available data with minimal human involvement. Our models are trained from a dictionary of chemical names and general biomedical text. We investigated several strategies including Na&iuml;ve Bayes classifiers and several types of N-gram models. We introduced a new way of interpolating N-grams that does not require tuning any parameters. We also found the task to be similar to Language Identification.
Research on Web Service-Based Interoperability of Heterogeneous PDM Systems
Authors: Yaping Wang, Jianghua Ge, Junpeng Shao, Songtao Han
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Aiming at the problems of interoperability of heterogeneous PDM Systems in the manufacturing enterprise ,we put forward an interoperation architecture of heterogeneous PDM systems based on the Web Services, which provides the real-time interaction of product data on heterogeneous platform for client by the way of web services, and provides implementation environment for the integration of product data between different enterprises by the way of the virtual data warehouse module to realize data mapping and interoperability. Finally, applying the architecture, we conduct an interoperation experiment to two heterogeneous PDM systems, SmarTeam and KM PDM.
Face Recognition Based on Image Transformation
Authors: Zhao Lihong, Song Ying, Zhu Yushi, Zhang Cheng, Zhang Xili
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Face Recognition is a very challenging topic in the field of pattern recognition, since illumination, gestures and expressions of face images are always different. In this paper, feature extraction is carried out on face images respectively through conventional methods of wavelet transform, Fourier transform, DCT, etc. Then these image transform methods are combined to process the face images. Nearest-neighbor classifiers using Euclidean distance and correlation coefficients used as similarity are adopted to recognize transformed face images. By this method, when more than five face images in a face database (ORL database) are selected as training samples, with the rest as testing samples, correct recognition rate can be 97% or higher. When five face images are from Yale face database, the correct recognition rate can be as high as 94.5%.