ppxscal/embedding_network huggingface dataset:
A Computationally Efficient Technique for Image Colorization
Authors: Adrian Pipirigeanu, Vladimir Bochko, Jussi Parkkinen
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

In this paper, the fast technique for image colorization is considered. The proposed method transfers colors from the color image (source) to the gray level image (target). For the source image, we use the segmented uniformly colored regions (dielectric surfaces) under single color illumination. This method maps the gray level image into the color space by means of parametrical mapping learnt using PCA and principal components regression. The experiments show the method's feasibility for colorizing the objects, and textures, as well.
Efficient Scheme for Scaleless Band Identification of Vibration Signal
Authors: Bi-qiang Du, Gui-fu Deng, Jun-jie Shi
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

An efficient scheme for fractal scaleless band automatic identification is proposed, which is based curve-line-curve fitting piecewise. The G-P correlation integral algorithm and the distribution rule of the correlation integral series for vibration signal are studied. Based on the result, a new and more efficient curve-line-curve piecewise fitting scheme instead of the conventional three-line fitting scheme can help to get the more precise correlation dimension of vibration signal. Applications on some real vibration signals which were tested in different operation conditions or rotate speeds and comparison with the conventional three-line fitting scheme showed this point.
Polynomial Time Construction Algorithm of BCNC for Network Coding in Cyclic Networks
Authors: Jiaqing Huang, Liang Wang, Wenqing Cheng, Hui Li
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Network coding in cyclic networks meets more problems than in acyclic networks. Recently, S.-Y.R.Li et al.proposed a framework of convolutional network coding (CNC) as well as its four properties for cyclic networks with theoretic fundamentals of discrete valuation ring (DVR). The four properties, Convolutional Multicast (CM), Convolutional Broadcast (CB), Convolutional Dispersion (CD) and Basic Convolutional NetworkCode (BCNC), are notions of increasing strength in this order with regard to linear independence among the global encoding kernels. The existence of a BCNC then implies the existence ofthe rest. That is, BCNC is the best convolutional network code in terms of linear independence. However, the code construction algorithm of BCNC was not presented explicitly. To the best of our knowledge, this is the first paper to propose a polynomial time construction algorithm of BCNC for network coding in cyclic networks, which can deal with different characteristics of cycles in terms of topology, including link cycles but flow acyclic, simpleflow cycles and knots. Finally, polynomial time complexity of the algorithm was proved as well as its effectiveness.
A Readability Checker Based on Deep Semantic Indicators
Authors: Tim Brück, Sven Hartrumpf
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

One major reason that readability checkers are still far away from judging the understandability of texts consists in the fact that no semantic information is used. Syntactic, lexical, or morphological information can only give limited access for estimating the cognitive difficulties for a human being to comprehend a text. In this paper however, we present a readability checker which uses semantic information in addition. This information is represented as semantic networks and is derived by a deep syntactico-semantic analysis. We investigate in which situations a semantic readability indicator can lead to superior results in comparison with ordinary surface indicators like sentence length. Finally, we compute the weights of our semantic indicators in the readability function based on the user ratings collected in an online evaluation.
A Novel Control Method for Magnetic-Valve Controllable Reactor
Authors: Xuxuan Chen, Baichao Chen, Cuihua Tian
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Accurate and swift control is the base of operating magnetic-valve controllable reactor (MCR). In this paper, a novel control method for the MCR is proposed, this method uses a flexible algorithm to get a synchro signal from line-to-line voltage by special signal process first, and then divides the synchro signal into six controllable trigger pulses precisely, operate the MCR according to associated roles that stored in memory in advance; the algorithm can be implemented by hardware easily and the requirement of high performance can be met. Based on the algorithm, a model of MCR is introduced and the algorithm is implemented by FPGA and PLC mainly. The application of the system shows that the new device has quick response, good precision, well ability of anti-electromagnetic disturbance, strong adaptability of the environment and can also operate stably for a long time.
Feature Selection Method with Multi-Population Agent Genetic Algorithm
Authors: Yongming Li, Xiaoping Zeng
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

The multi-population agent genetic algorithm (MPAGAFS) for feature selection is proposed. The double chain-like agent structure is introduced to enhance the diversity of population. The structure can help to construct multi-population agent GA, thereby realizing parallel searching for an optimal feature subset. The experimental results show that the MPAGAFS can not only be used for serial feature selection but also parallel feature selection with satisfying precision.
UPV-SI: word sense induction using self term expansion
Authors: David Pinto, Paolo Rosso, Héctor Jiménez-Salazar
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

In this paper we are reporting the results obtained participating in the "Evaluating Word Sense Induction and Discrimination Systems" task of Semeval 2007. Our totally unsupervised system performed an automatic self-term expansion process by mean of co-ocurrence terms and, thereafter, it executed the unsupervised KStar clustering method. Two ranking tables with different evaluation measures were calculated by the task organizers, every table with two baselines and six runs submitted by different teams. We were ranked third place in both ranking tables obtaining a better performance than three different baselines, and outperforming the average score.
Multi-aspect permutation tests in shape analysis with small sample size
Authors: Chiara Brombin, Luigi Salmaso
Venue: Computational Statistics Data Analysis (2009)

Inferential methods known in the shape analysis literature make use of configurations of landmarks optimally superimposed using a least-squares procedure or analyze matrices of interlandmark distances. For example, in the two independent sample case, a practical method for comparing the mean shapes in the two groups is to use the Procrustes tangent space coordinates, if data are concentrated, calculate the Mahalanobis distance and then the Hotelling T^2-test statistic. Under the assumption of isotropy, another simple approach is to work with statistics based on the squared Procrustes distance and then consider the Goodall F-test statistic. Despite their widespread use, on the one hand it is well known that Hotelling's T^2-test may not be very powerful unless there are a large number of observations available, and on the other hand the underlying model required by Goodall's F-test is very restrictive. For these reasons, an extension of the nonparametric combination (NPC) methodology to shape analysis is proposed. Focussing on the two independent sample case, through a comparative simulation study and an application to the Mediterranean monk seal skulls dataset, the behaviour of some nonparametric permutation tests has been evaluated, showing that the proposed tests are very powerful, for both balanced and unbalanced sample sizes.
OpenFst: an open-source, weighted finite-state transducer library and its applications to speech and language
Authors: Michael Riley, Cyril Allauzen, Martin Jansche
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Tutorial Abstracts (2009)

Finite-state methods are well established in language and speech processing. OpenFst (available from www.openfst.org) is a free and open-source software library for building and using finite automata, in particular, weighted finite-state transducers (FSTs). This tutorial is an introduction to weighted finite-state transducers and their uses in speech and language processing. While there are other weighted finite-state transducer libraries, OpenFst (a) offers, we believe, the most comprehensive, general and efficient set of operations; (b) makes available full source code; (c) exposes high- and low-level C++ APIs that make it easy to embed and extend; and (d) is a platform for active research and use among many colleagues.
Decomposability of translation metrics for improved evaluation and efficient algorithms
Authors: David Chiang, Steve DeNeefe, Yee Seng Chan, Hwee Tou Ng
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

Bleu is the de facto standard for evaluation and development of statistical machine translation systems. We describe three real-world situations involving comparisons between different versions of the same systems where one can obtain improvements in Bleu scores that are questionable or even absurd. These situations arise because Bleu lacks the property of decomposability, a property which is also computationally convenient for various applications. We propose a very conservative modification to Bleu and a cross between Bleu and word error rate that address these issues while improving correlation with human judgments.
How to improve the diagnosis of kinetic energy in δf PIC codes
Authors: S. Hess, F. Mottez
Venue: Journal of Computational Physics (2009)

This paper propose to analyse the effect of the shape factor that is used in plasma PIC @df codes to make interpolations between the grid and the particles positions. In @df codes, the total density fluctuates, even when it should be conserved. We show that, in some cases, the computed non-physical part of the particle kinetic energy fluctuations is dependent on those of the total density. We deduce a method that can reduce drastically the statistical fluctuations in the diagnostics of the kinetic energy.
A Revised Concept of Safety for General Answer Set Programs
Authors: Pedro Cabalar, David Pearce, Agustín Valverde
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

To ensure a close relation between the answer sets of a program and those of its ground version, some answer set solvers deal with variables by requiring a safety condition on program rules. If we go beyond the syntax of disjunctive programs, for instance by allowing rules with nested expressions, or perhaps even arbitrary first-order formulas, new definitions of safety are required. In this paper we consider a new concept of safety for formulas in quantified equilibrium logic where answer sets can be defined for arbitrary first-order formulas. The new concept captures and generalises two recently proposed safety definitions: that of Lee, Lifschitz and Palla (2008) as well as that of Bria, Faber and Leone (2008). We study the main metalogical properties of safe formulas.
Ethnographic User Study and Concept Design for Chinese Migrant Workers' Social Networks
Authors: Jie Wang, Wei Wang, Ying Liu, Xia Wang, Qiuhong Chen
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

Online social networking services are hot in the recent years, but most of theses services in China aimed at the college students and business people, ignoring that Chinese migrant workers could be one of the biggest potential user groups of mobile social networking services in the future. This paper presents an ethnographic user study on Chinese rural-urban migrant workers' social networks in daily life and proposes a new mobile social networking service concept design for helping them to improve their social networks in daily life.
An effective learning method for max-min neural networks
Authors: Loo-Nin Teow, Kia-Fock Loe
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

Max and min operations have interesting properties that facilitate the exchange of information between the symbolic and real-valued domains. As such, neural networks that employ max-min activation functions have been a subject of interest in recent years. Since max-min functions are not strictly differentiate, we propose a mathematically sound learning method based on using Fourier convergence analysis of side-derivatives to derive a gradient descent technique for max-min error functions. This method is applied to a "typical" fuzzy-neural network model employing max-rnin activation functions. We show how this network can be trained to perform function approximation; its performance was found to be better than that of a conventional feedforward neural network.
Assessing aspects of reading by a connectionist model
Authors: J. Ignacio Serrano, M. Dolores del Castillo, Ángel Iglesias, Jesús Oliva
Venue: Neurocomputing (2009)

Anthropocentrism of computational systems is totally justified when the task concerns to natural language. Computational linguistics systems usually rely on mathematical and statistical formalisms, which are efficient and useful but far from human procedures and therefore not so skilled. The presented work proposes a computational model of natural language reading, called cognitive reading indexing model (CRIM), inspired by some aspects of human cognition, trying to become as psychologically plausible as possible. The model relies on a semantic neural network and it produces nets of activated concepts as text representations. The experimental evaluation shows that the system is suitable to model human reading, and it provides a framework to validate and assess hypothesis concerning reading from other cognitive science fields.
Improved accuracy for the approximate factorization of parabolic equations
Authors: S. Karaa
Venue: Computing (2009)

A general procedure to construct alternating direction implicit (ADI) schemes for multidimensional problems was originated by Beam and Warming, using the method of approximate factorization. The technique which can be combined with a high-order linear multistep (LM) method introduces a factorization error that is of order two in the time step &#x0394;t. Thus, the approximate factorization method imposes a second-order temporal accuracy limitation independent of the accuracy of the LM method chosen as the time differencing approximation. We introduce a correction term to the right-hand side of a factored scheme to increase the order of the factorization error in &#x0394;t, and recover the temporal order of the original scheme. The method leads in particular to the modified ADI scheme proposed by Douglas and Kim. A convergence proof is given for the improved scheme based on the BDF2 method.
Collaboration Design System Using Internet and Virtual Reality Technology
Authors: Hideki Aoyama, Rie Iida
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

Globalization of manufacturing industry makes production bases covering two or more areas and countries. Moreover, in order to timely offer products which respond to consumer needs, it has been becoming important to shorten the lead time of product development. Opportunities to do collaboration work with designers/engineers existing different places are thus increasing. A support system for collaboration design work without physical moving of designers/engineers is strongly demanded to cut down time and cost. This research aims at proposing the intuitive 3-dimensional geometric model construction method and developing a system which supports collaboration design work for the discussion stage of ideas in the upstream of design processes. In this paper, a system which can intuitively build a 3D model and support collaboration design work for designers/engineers being different places by sharing mutually a design object through the Internet is described.
Non-redundant Subgroup Discovery Using a Closure System
Authors: Mario Boley, Henrik Grosskreutz
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I (2009)

Subgroup discovery is a local pattern discovery task, in which descriptions of subpopulations of a database are evaluated against some quality function. As standard quality functions are functions of the described subpopulation, we propose to search for equivalence classes of descriptions with respect to their extension in the database rather than individual descriptions. These equivalence classes have unique maximal representatives forming a closure system. We show that minimum cardinality representatives of each equivalence class can be found during the enumeration process of that closure system without additional cost, while finding a minimum representative of a single equivalence class is NP-hard. With several real-world datasets we demonstrate that search space and output are significantly reduced by considering equivalence classes instead of individual descriptions and that the minimum representatives constitute a family of subgroup descriptions that is of same or better expressive power than those generated by traditional methods.
Numerical Techniques in Electromagnetics with MATLAB, Third Edition, 3rd edition
Authors: Matthew N. O. Sadiku
Venue:  (2009)

Continuing in the bestselling tradition of the first edition, this edition demonstrates how to pose, numerically analyze, and solve electromagnetic problems (EM). Significant updates include the transition of all FORTRAN code into the more widely used MATLAB format as well as improvements made to the standard algorithm for the finite difference time domain (FDTD) method and the treatment of absorbing boundary conditions in FDTD, the finite element method, and the transmission-line-matrix method. In addition to updated examples and new homework problems throughout, the second edition adds a chapter on the method of lines. An appendix covers use of MATLAB code. A solution manual is available for qualifying instructors
Achieving better performance through true best effort in scavenging grid computing
Authors: Raphael de Aquino Gomes, Fábio Moreira Costa, Fouad Joseph Georges
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

In addition to an untuned performance, inefficient resource management in hinders any attempt to offer Quality of Service in scavenging grids. In this case, Best-Effort mechanisms are synonym to unreliability. Evidently it would be impossible, with undedicated resources, to offer any deterministic warranty (if based on a classic reservation of resources) to service access. Although the usage of scavenging grids for real-time execution remains a challenge, new "Service Qualities" may be proposed to compatiblize applications' preferences versus system oscillations.
Case Study and Maturity Model for Business Process Management Implementation
Authors: Michael Rohloff
Venue: Proceedings of the 7th International Conference on Business Process Management (2009)

This paper presents the implementation of Business Process Management in a large international company. The business case illustrates the main objectives and approach taken with the BPM initiative. It introduces a process management maturity assessment which was developed to assess the implementation of Business Process Management and the achievements. The maturity model is based on nine categories which comprehensively cover all aspects which impact the success of Business Process Management. Some findings of the first assessment cycle are pinpointed to illustrate the benefits and best practice exchange as a result of the assessment.
Performance Evaluation of Enterprise MIS Based on Grey-fuzzy Theory in Informationization Environment
Authors: Yong-qing Chen, Yong-yue Zhu
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Performance evaluation of enterprise MIS is a complex project involving many factors. Based on an analysis of the factors that affect the performance of enterprise MIS, this paper constructs a comprehensive index system for evaluating the performance of enterprise MIS. It also establishes a comprehensive evaluation model for MIS performance by applying the grey-fuzzy theory, and verifies the model's feasibility and practicality through case study.
ION Framework --- A Simulation Environment for Worlds with Virtual Agents
Authors: Marco Vala, Guilherme Raimundo, Pedro Sequeira, Pedro Cuba, Rui Prada, Carlos Martinho, Ana Paiva
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Agents cannot be decoupled from their environment. An agent perceives and acts in a world and the model of the world influences how the agent makes decisions. Most systems with virtual embodied agents simulate the environment within a specific realization engine such as the graphics engine. As a consequence, these agents are bound to a particular kind of environment which compromises their reusability across different applications. We propose the ION Framework, a framework for simulating virtual environments which separates the simulation environment from the realization engine. In doing so, it facilitates the integration and reuse of the several components of the system. The ION Framework was used to create several 3D virtual worlds populated with autonomous embodied agents that were tested with hundreds of users.
Interplay between Usability Evaluation and Software Development (I-USED 2009)
Authors: Silvia Abrahão, Kasper Hornbæk, Effie Law, Jan Stage
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

This workshop is aimed at bringing together researchers and practitioners from the Human-Computer Interaction (HCI) and Software Engineering (SE) fields to determine the state-of-the-art in the interplay between usability evaluation and software development and to generate ideas for new and improved relations between these activities. The aim is to base the determination of the current state on empirical studies. Presentations of new ideas on how to improve the interplay between HCI SE to the design of usable software systems should also be based on empirical studies.