ppxscal/embedding_network huggingface dataset:
An Attribute Value Reduction Algorithm Based on Set Operations
Authors: Mingchen Yao, Jie Yang, Huisheng Zhang, Wei Wu
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

An algorithm for attribute value reduction is proposed based on discernibility matrix by using set operations instead of Boolean operations. Time complexity analysis of the algorithm is carried out and an example of application is provided to show the efficiency of the algorithm.
A New Data Gathering Protocol of Wireless Sensor Networks
Authors: Zhou Xin-Lian, Hu Yang-Bin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

This paper presented an idea of differentiated Service. Based on the idea, we designed a algorithm named DSDG which use differentiated service mechanism, it both use in-network data aggregation technology to efficiently collect data periodically and meet the requirement of urgent data processing. DSDG use differentiated service on network data flow, on the other hand, this algorithm use high efficient network data fusion technology on data transmission process. Simulate experiment indicate that comparing with LEACH and HEED, DSDG can make the WSN possess longer lifetime and better expansibility.
Empowering Provenance in Data Integration
Authors: Haridimos Kondylakis, Martin Doerr, Dimitris Plexousakis
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

The provenance of data has recently been recognized as central to the trust one places in data. This paper presents a novel framework in order to empower provenance in a mediator based data integration system. We use a simple mapping language for mapping schema constructs, between an ontology and relational sources, capable to carry provenance information. This language extends the traditional data exchange setting by translating our mapping specifications into source-to-target tuple generating dependencies (s-t tgds). Then we define formally the provenance information we want to retrieve i.e. annotation, source and tuple provenance. We provide three algorithms to retrieve provenance information using information stored on the mappings and the sources. We show the feasibility of our solution and the advantages of our framework.
A Research on the Causality Relationship between Services Industry and Economy Growth in China
Authors: Renfa Yang, Qiong Huang
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

In order to discuss the causality relationship between services industry and economy growth in China ,this paper makes an empirical analysis of the causality relationship between services industry and economy growth using Granger causality test, unit root rest and cointegration test according to the corresponding data from 1980 to 2007 in China. The results show that there is some causality and a long-term stable equilibrium relationship between services industry and economy growth. The economy growth increased 0.8766% as that of the services industry increased 1% in China. Chinese services industry and economy growth are the Granger causality of each other. The development of services industry plays an important role in economy growth. The relevant suggestions should be taken to accelerate the development of services industry.
When Harry met Harri: cross-lingual name spelling normalization
Authors: Fei Huang, Ahmad Emami, Imed Zitouni
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

Foreign name translations typically include multiple spelling variants. These variants cause data sparseness problems, increase Out-of-Vocabulary (OOV) rate, and present challenges for machine translation, information extraction and other NLP tasks. This paper aims to identify name spelling variants in the target language using the source name as an anchor. Based on word-to-word translation and transliteration probabilities, as well as the string edit distance metric, target name translations with similar spellings are clustered. With this approach tens of thousands of high precision name translation spelling variants are extracted from sentence-aligned bilingual corpora. When these name spelling variants are applied to Machine Translation and Information Extraction tasks, improvements over strong baseline systems are observed in both cases.
Finite-state morphological analysis of Persian
Authors: Karine Megerdoomian
Venue: Proceedings of the Workshop on Computational Approaches to Arabic Script-based Languages (2004)

This paper describes a two-level morphological analyzer for Persian using a system based on the Xerox finite state tools. Persian language presents certain challenges to computational analysis: There is a complex verbal conjugation paradigm which includes long-distance morphological dependencies; phonological alternations apply at morpheme boundaries; word and noun phrase boundaries are difficult to define since morphemes may be detached from their stems and distinct words can appear without an intervening space. In this work, we develop these problems and provide solutions in a finite-state morphology system.
Multi-view local learning
Authors: Dan Zhang, Fei Wang, Changshui Zhang, Tao Li
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

The idea of local learning, i.e., classifying a particular example based on its neighbors, has been successfully applied to many semi-supervised and clustering problems recently. However, the local learning methods developed so far are all devised for single-view problems. In fact, in many real-world applications, examples are represented by multiple sets of features. In this paper, we extend the idea of local learning to multi-view problem, design a multi-view local model for each example, and propose a Multi-View Local Learning Regularization (MVLL-Reg) matrix. Both its linear and kernel version are given. Experiments are conducted to demonstrate the superiority of the proposed method over several state-of-the-art ones.
Groebner Bases and Solutions to Diophantine Equations
Authors: Mihai Cipu
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

The aim of this paper is to discuss a novel application of Gr\" obner bases in the study of Diophantine equations. The idea appeared during some work on the number of solutions of systems of Pell equations, but can be useful in other circumstances as well.
Roles of initiators and interaction patterns: exploring an informal online community at the interpersonal plane
Authors: Gyeong Mi Heo, Alain Breuleux
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

We present a study exploring learning in an informal online community (OC) for foodservice professionals according to three planes (i.e., community, interpersonal, and individual planes). Among these planes, this paper focuses on the interpersonal plane (i.e., how do participants interact with each other and what do they share through their interactions?) and highlight the importance of initiators' roles and the subsequent interaction patterns. To investigate interaction and learning processes, we collected 227 discussion threads posted in the year 2006, analyzed them through a multi-layered analysis approach, and graphically presented the results to show the complex components of interactions at a glance. Finally, we discuss the characteristics of interaction and learning processes in this OC and the relationship between initiators roles and interaction patterns.
Factors affecting consumers' responses to mobile advertising from a social norm theoretical perspective
Authors: Sandra Soroa-Koury, Kenneth C. C. Yang
Venue: Telematics and Informatics (2010)

As mobile technology continues to diffuse, the numbers of mobile subscribers continue to grow. With a high penetration of mobile subscribers in the United States, the mobile phone and network is promptly becoming a feasible marketing channel as mobile phones facilitate the exposure to advertisements deliver through a variety of mobile technologies. The purpose of this study was to examine whether misperceptions of social norms of mobile advertising play any role in predicting consumers' responses to mobile advertising. The study used a questionnaire survey method to measure mobile users' attitudes, perceived usefulness (PU), perceived-ease-of-use (PEOU), and adoption intention of mobile advertising. A total of 343 college students from a large southwestern public university were recruited to participate in this study. The study demonstrated that misperceptions of social norms predicted consumers' perceived usefulness (PU) and perceived ease of use (PEOU) of mobile advertising. Both PU and PEOU are critical variables predicting consumers' adoption of technologies. The study also found that PU predicted attitude towards mobile advertising, whereas PEOU did not predict attitude towards mobile advertising. Lastly attitude towards mobile advertising significantly predicted the intention to adopt mobile advertising.
Visualizations for assessing convergence and mixing of Markov chain Monte Carlo simulations
Authors: Jaakko Peltonen, Jarkko Venna, Samuel Kaski
Venue: Computational Statistics Data Analysis (2009)

Bayesian inference often requires approximating the posterior distribution by Markov chain Monte Carlo sampling. The samples come from the true distribution only after the simulation has converged, which makes detecting convergence a central problem. Commonly, several simulation chains are started from different points, and their overlap is used as a measure of convergence. Convergence measures cannot tell the analyst the cause of convergence problems; it is suggested that complementing them with proper visualization will help. A novel connection is pointed out: linear discriminant analysis (LDA) minimizes the overlap of the simulation chains measured by a common multivariate convergence measure. LDA is thus justified for visualizing convergence. However, LDA makes restrictive assumptions about the chains, which can be relaxed by a recent extension called discriminative component analysis (DCA). Lastly, methods are introduced for unidentifiable models and model families with variable number of parameters, where straightforward visualization in the parameter space is not feasible.
Dynamic regime identification and prediction based on observed behavior in electronic marketplaces
Authors: Wolfgang Ketter
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 4 (2005)

We present a method for an autonomous agent to identify dominant market conditions, such as oversupply or scarcity. The characteristics of economic regimes are learned from historic data and used, together with real-time observable information, to identify the current market regime and to forecast market changes. The approach is validated with data from the Trading Agent Competition for Supply Chain Management.
CITYU-HIF: WSD with human-informed feature preference
Authors: Oi Yee Kwong
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper describes our word sense disambiguation (WSD) system participating in the SemEval-2007 tasks. The core system is a fully supervised system based on a Na&iuml;ve Bayes classifier using multiple knowledge sources. Toward a larger goal of incorporating the intrinsic nature of individual target words in disambiguation, thus introducing a cognitive element in automatic WSD, we tried to fine-tune the results obtained from the core system with human-informed feature preference, and compared it with automatic feature selection as commonly practised in statistical WSD. Despite the insignificant improvement observed in this preliminary attempt, more systematic analysis remains to be done for a cognitively plausible account of the factors underlying the lexical sensitivity of WSD, which would inform and enhance the development of WSD systems in return.
Multi-auction Approach for Solving Task Allocation Problem
Authors: Chi-Kong Chan, Ho-Fung Leung
Venue: Multi-Agent Systems for Society: 8th Pacific Rim International Workshop on Multi-Agents, PRIMA 2005, Kuala Lumpur, Malaysia, September 26-28, 2005, Revised Selected Papers (2009)

Request for Proposal (RFP) problem is a type of task allocation problem where task managers need to recruit service provider agents to handle complex tasks composed of multiple sub-tasks, with the objective being to assign each sub-task to a capable agent while keeping the cost as low as possible. Most existing approaches either involve centralized algorithms or require each agent's cost for doing each sub-task to be known publicly beforehand, or attempt to force the agents to disclose such information by means of truth-telling mechanism, which is not practical in many problems where such information is sensitive and private. In this paper, we present an efficient multi-auction based mechanism that can produce near-optimal solutions without violating the privacy of the participating agents. By including an extra verification step after each bid, we can guarantee convergence to a solution while achieving optimal results in over 97% of the times in a series of experiment.
Effective Project Management: Traditional, Agile, Extreme, 5th edition
Authors: Robert K. Wysocki
Venue:  (2009)

With 200 pages of new content, the fifth edition of this popular guide gives new or veteran project managers a comprehensive overview of all of the best-of-breed project management approaches and tools today, including Traditional (Linear and Incremental), Agile (Iterative and Adaptive), and Extreme. Step-by-step instruction and practical case studies show you how to use these tools effectively to achieve better outcomes of projects at hand. Plus, the book provides full coverage on managing continuous process improvement, procurement management, managing distressed projects, and managing multiple team projects. The companion Web site includes exercises and solutions that accompany the project management instruction in the book.
High-efficiency dynamic supply CMOS audio power amplifier for low-power applications
Authors: J. Gubelmann, P. A. Dal Fabbro, M. Pastre, M. Kayal
Venue: Microelectronics Journal (2009)

This paper describes the analysis and design of a dynamic supply CMOS audio power amplifier for low-power applications. The dynamic supply technique is used to increase the efficiency of a class AB power amplifier. The polarization of its output stage is adaptive so that the maximum efficiency enhancement can be achieved without jeopardizing the linearity of the system. Two types of adaptive polarization are proposed and compared. A concept of power supplies switching is also proposed. Simulation results are presented showing that an efficiency of 53.6% at a total harmonic distortion (THD) of less than 0.1% can be achieved, whereas the maximal theoretical value for a class AB amplifier is approximately 33.3%.
Optimal run lengths in deteriorating production processes in random fuzzy environments
Authors: Chao Zhang, Ruiqing Zhao, Wansheng Tang
Venue: Computers and Industrial Engineering (2009)

This paper presents a random fuzzy economic manufacturing quantity (EMQ) model in a deteriorating process. It is assumed that the setup cost and the average holding cost are characterized as fuzzy variables and the elapsed time until shift is a random fuzzy variable. As a function of these parameters, the average total cost is also a random fuzzy variable, and the unimodality of its expected value is studied. To obtain the optimal run length and the minimum average cost, simultaneous perturbation stochastic approximation (SPSA) algorithm based on random fuzzy simulation is provided. Random fuzzy EMQ models with fuzzy deterioration, fuzzy linear deterioration and fuzzy exponential deterioration are presented, respectively. These models can be solved by the proposed algorithm. Numerical examples are presented in the end.
On Basing ZK ≠ BPP on the Hardness of PAC Learning
Authors: David Xiao
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

Learning is a central task in computer science, and there are various formalisms for capturing the notion. One important model studied in computational learning theory is the PAC model of Valiant (CACM 1984). On the other hand, in cryptography the notion of "learning nothing'' is often modelled by the simulation paradigm: in an interactive protocol, a party learns nothing if it can produce a transcript of the protocol by itself that is indistinguishable from what it gets by interacting with other parties. The most famous example of this paradigm is zero knowledge proofs, introduced by Goldwasser, Micali, and Rackoff (SICOMP 1989). Applebaum et al. (FOCS 2008) observed that a theorem of Ostrovsky and Wigderson (ISTCS 1993) combined with the transformation of one-way functions to pseudo-random functions (Hastad et al. SICOMP 1999, Goldreich et al. J. ACM 1986) implies that if there exist non-trivial languages with zero-knowledge arguments, then no efficient algorithm can PAC learn polynomial-size circuits. They also prove a weak reverse implication, that if a certain non-standard learning task is hard, then zero knowledge is non-trivial. This motivates the question we explore here: can one prove that hardness of PAC learning is equivalent to non-triviality of zero-knowledge? We show that this statement cannot be proven via the following techniques: 1. Relativizing techniques: there exists an oracle relative to which learning polynomial-size circuits is hard and yet the class of languages with zero knowledge arguments is trivial. 2. Semi-black-box techniques: if there is a black-box construction of a zero-knowledge argument for an NP-complete language (possibly with a non-black-box security reduction) based on hardness of PAC learning, then NP has statistical zero knowledge proofs, namely NP is contained in SZK. Under the standard conjecture that NP is not contained in SZK, our results imply that most standard techniques do not suffice to prove the equivalence between the non-triviality of zero knowledge and the hardness of PAC learning. Our results hold even when considering non-uniform hardness of PAC learning with membership queries. In addition, our technique relies on a new kind of separating oracle that may be of independent interest.
Modelling Product-User Interaction for Inclusive Design
Authors: Anna Mieczakowski, Patrick Langdon, P. John Clarkson
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

Despite continuing technological advances, there are still many daily living products that are unusable for broad sections of the population, including older and impaired users. Therefore, in order to design more accessible and usable products, designers need better models that can predict how people with varying levels of capability interpret and use different features on product interfaces. The aim of this paper is to survey the background of modelling product-user interaction, discuss strengths and weaknesses of various approaches and focus on appropriate methodology to investigate inclusive interaction with everyday products. This paper concludes that a model of product-user interaction should include three representations of specific information: (1) what people want to do when operating a product (goals); (2) what people actually do while operating a product (actions); and (3) what happens to the functional parts of the product during the operation (objects). Further research is necessary in order to identify methods for combining goal, action and object approaches and developing a usable and inclusive model of product-user interaction.
Single-channel talker localization based on discrimination of acoustic transfer functions
Authors: Tetsuya Takiguchi, Yuji Sumida, Ryoichi Takashima, Yasuo Ariki
Venue: EURASIP Journal on Advances in Signal Processing (2009)

This paper presents a sound source (talker) localization method using only a single microphone, where a Gaussian Mixture Model (GMM) of clean speech is introduced to estimate the acoustic transfer function from a user's position. The new method is able to carry out this estimation without measuring impulse responses. The frame sequence of the acoustic transfer function is estimated by maximizing the likelihood of training data uttered from a given position, where the cepstral parameters are used to effectively represent useful clean speech. Using the estimated frame sequence data, the GMM of the acoustic transfer function is created to deal with the influence of a room impulse response. Then, for each test dataset, we find a maximum-likelihood (ML) GMM from among the estimated GMMs corresponding to each position. The effectiveness of this method has been confirmed by talker localization experiments performed in a room environment.
An Ad Hoc Information Retrieval Perspective on PLSI through Language Model Identification
Authors: Jean-Cédric Chappelier, Emmanuel Eckard
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

This paper proposes a new document---query similarity for PLSI that allows queries to be used in PLSI without folding-in. We compare this similarity to Fisher kernels, the state-of-the-art approach for PLSI, on a corpus of 1M+ word occurrences coming from TREC---AP.
Simulation of PMSM Vector Control System Based on Matlab/Simulink
Authors: Ting-ting Liu, Yu Tan, Gang Wu, Shu-mao Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

At the basis of analysis of the mathematical model of the permanent-magnet synchronous motor (PMSM) and the principle of field-orientated vector control, a novel method for modeling and simulink of PMSM system based on SVPWM is proposed. In Matlab/simulink, the simulation model of the whole system is built, two control loops are used, which are inner current-loop and the outer speed-loop. By simulating the specific motor, the waveforms are presented, which achieves the expected effect, and the reasonability and validity has been proved.
Neurocognitive Approach to Creativity in the Domain of Word-Invention
Authors: Maciej Pilichowski, Włodzisław Duch
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

One of the simplest creative act is the invention of a new word that captures some characteristics of objects or processes, for example industrial or software products, activity of companies, or the main topic of web pages. Neurocognitive mechanisms responsible for this process are partially understood and in a simplified form may be implemented in a computational model. An algorithm based on such inspirations is described and tested, generating many interesting novel names associated with a set of keywords.