ppxscal/embedding_network huggingface dataset:
Data Driven for Gray Relational Analysis of Recognizing Oil-bearing Characteristics in Reservoir
Authors: Xiang Jun, Guo Hai-xiang, Zhu Ke-jun, Li Lan-lan, Ding Chan
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

The paper proposed a method of data driven gray relational analysis for recognizing oil-bearing characteristics in reservoir. The method follows the objective process from data to information and from information to recognition. Firstly, reduce attributes based on training data and obtain the key attributes for recognizing oil-bearing characteristics (oil layer, inferior oil layer, dry layer and water layer) by fusion of genetic algorithm and fuzzy c-means. Secondly, take the center of clusters (different oil-bearing formation characteristics) of training data as the reference sequence of recognizing oil-bearing characteristics in reservoir. Thirdly, obtain the weight of each key attribute through relief algorithm. At last, the testing data was estimated by data driven gray relational analysis. The paper takes oilsk81 well data in Jianghan oilfield of China as training data and takes oilsk83 well data as testing data, the estimated results are the same as the real oil-bearing characteristics of each layer in oilsk83 well.
Identification of sparse audio tampering using distributed source coding and compressive sensing techniques
Authors: G. Valenzise, G. Prandi, M. Tagliasacchi, A. Sarti
Venue: Journal on Image and Video Processing (2009)

The increasing development of peer-to-peer networks for delivering and sharing multimedia files poses the problem of how to protect these contents from unauthorized manipulations. In the past few years, a large amount of techniques have been proposed to identify whether a multimedia content has been illegally tampered or not. Nevertheless, very few efforts have been devoted to identifying which kind of attack has been carried out, especially due to the large data required for this task. We propose a novel hashing scheme which exploits the paradigms of compressive sensing and distributed source coding to generate a compact hash signature, and apply it to the case of audio content protection. The audio content provider produces a small hash signature by computing a limited number of random projections of a perceptual, time-frequency representation of the original audio stream; the audio hash is given by the syndrome bits of an LDPC code applied to the projections. At the content user side, the hash is decoded using distributed source coding tools. If the tampering is sparsifiable or compressible in some orthonormal basis or redundant dictionary, it is possible to identify the time-frequency position of the attack, with a hash size as small as 200 bits/second; the bit saving obtained by introducing distributed source coding ranges between 20% to 70%.
Problematic Internet use and psychosocial well-being among MMO players
Authors: Scott Caplan, Dmitri Williams, Nick Yee
Venue: Computers in Human Behavior (2009)

The current study examined problematic Internet use (PIU) among people who play MMO games and sought to determine whether aspects of the MMO experience are useful predictors of PIU. The study sought to determine whether game-related variables could predict PIU scores after accounting for their relationships with psychosocial well-being. Novel methods allowed us, for the first time, to connect in-game behaviors with survey results of over 4000 MMO players. The results revealed that MMO gaming variables contributed a substantively small, but statistically significant amount of explained variance to PIU scores.
Automatic algorithm configuration based on local search
Authors: Frank Hutter, Holger H. Hoos, Thomas Stützle
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

The determination of appropriate values for free algorithm parameters is a challenging and tedious task in the design of effective algorithms for hard problems. Such parameters include categorical choices (e.g., neighborhood structure in local search or variable/value ordering heuristics in tree search), as well as numerical parameters (e.g., noise or restart timing). In practice, tuning of these parameters is largely carried out manually by applying rules of thumb and crude heuristics, while more principled approaches are only rarely used. In this paper, we present a local search approach for algorithm configuration and prove its convergence to the globally optimal parameter configuration. Our approach is very versatile: it can, e.g., be used for minimising run-time in decision problems or for maximising solution quality in optimisation problems. It further applies to arbitrary algorithms, including heuristic tree search and local search algorithms, with no limitation on the number of parameters. Experiments in four algorithm configuration scenarios demonstrate that our automatically determined parameter settings always outperform the algorithm defaults, sometimes by several orders of magnitude. Our approach also shows better performance and greater flexibility than the recent CALIBRA system. Our ParamILS code, along with instructions on how to use it for tuning your own algorithms, is available on-line at http://www.cs.ubc.ca/labs/beta/Projects/ParamILS.
The Fuzzy Synthesize Assess in Reliability and Maintainability of Military Engineer Machinery
Authors: Xiaonan Zhang, Anxin Liu, Bin Liu, Jun Yan, Yaoming Gao, Hongliang Liu
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

This article systematically analyzes the index in the reliability and maintainability of military engineer machinery and synthetically assesses the composed elements by the Fuzzy. Furthermore, the article combining the experts’ markings with AHP theory distributing weights, shows the Fuzzy synthesize assess model, based on the application of the qualitative and quantitative analysis.
PHYLO-ASP: Phylogenetic Systematics with Answer Set Programming
Authors: Esra Erdem
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

This note summarizes the use of Answer Set Programming to solve various computational problems to infer phylogenetic trees and phylogenetic networks, and discusses its applicability and effectiveness on some real taxa.
Tree Projections: Game Characterization and Computational Aspects
Authors: Georg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello, Thomas Schwentick
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

The notion of tree projection provides a natural generalization for various structural decomposition methods, which have been proposed in the literature in order to single out classes of nearly-acyclic (hyper)graphs. In this paper, the mathematical properties of the notion of tree projection are surveyed, and the complexity of the basic tree projection problem (of deciding the existence of a tree projection) is pinpointed. In more details, a game-theoretic characterization (in terms of the Robber and Captain game [15] ) for tree projections is described, which yields a simple argument for the membership in NP of the tree projection problem. Eventually, the main ideas proposed in [14] and underlying the proof of NP-hardness of the tree projection problem are discussed.
UPAR7: a knowledge-based system for headline sentiment tagging
Authors: François-Régis Chaumartin
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

For the Affective Text task at SemEval-2007, University Paris 7's system first evaluates emotion and valence on all words of a news headline (using enriched versions of SentiWordNet and a subset of WordNet-Affect). We use a parser to find the head word, considering that it has a major importance. We also detect contrasts (between positive and negative words) that shift valence. Our knowledge-based system achieves high accuracy on emotion and valence annotation. These results show that working with linguistic techniques and a broad-coverage lexicon is a viable approach to sentiment analysis of headlines.
Verifying Semistructured Data Normalization Using SWRL
Authors: Yuan Fang Li, Jing Sun, Gillian Dobbie, Scott Lee, Hai H. Wang
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Semistructured data has become more and more prominent in the fast growing areas of web information technology. XML has been used as a standard format for semistructured data in representing and exchanging information in various applications. However, the lack of formality and verification support in the design of a good semistructured data model may hinder its development. For example, redundant data in XML must be removed or minimized to avoid inconsistent and inefficient information processing. Normalization algorithms have been developed to overcome these problems by transforming the schema of a semistructured document into a better form. Therefore, it is essential to ensure that a transformed schema model preserves the same information that its original form holds. In this paper, we present an approach to investigate and verify the no-data-loss property of semistructured data normalization. We encode the verification criteria in the Semantic Web Rule Language (SWRL) and make use of its ontology reasoning engine to provide automated support for the checking process. In summary, our approach not only investigates the information preserving aspect of semistructured data normalization, but also provides a scalable and automated solution towards the problem.
Optimal Design of Cognitive Radio Wireless Parameters based on Non-dominated Neighbor Distribution Genetic Algorithm
Authors: Jinghui Ma, Hong Jiang, Yongchun Hu, Yujun Bao
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Cognitive radio (CR) wireless parameter optimization is a typical multi-objective optimization problem. In order to optimize wireless parameters, a Non-dominated Neighbor Distribution multi-objective Genetic Algorithm (NNDA) is presented in this paper. Based on non-dominated sorting, NNDA increases the probability that superior individuals pass down to next generation by crowding distance and distribution mechanism. Comparative studies are performed between the NNDA and NNIA by typical test functions. Simulation results show that NNDA can effectively solve the multi-objective optimization problems and has a more fast convergence and reasonable result than NNIA. By applying the NNDA to the optimization problem of CR, the simulation results show that the algorithm is effective in the optimization of cognitive radio parameters design.
Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium
Venue: Human Language Technology Conference (2009)

Welcome to the NAACL HLT 2009 Student Research Workshop and Doctoral Consortium! We are pleased to continue this established tradition at ACL conferences. The Student Research Workshop and Doctoral Consortium provides a venue for student researchers in Computational Linguistics, Natural Language Processing, and Human Language Technologies to present their work and receive feedback from the community. Unlike regular conference sessions, the workshop welcomes work in progress. In the tradition of previous doctoral consortia, we recruited expert panelists to provide a brief commentary on each oral presentation. We hope that as a result of this workshop, the student participants are able to obtain exposure to the NAACL community and that it helps with their future careers in this field. This year we received 29 submissions from 11 countries. With a strong program committee of 86 reviewers, from advanced graduate students to senior experts in their field, we were able to keep the individual reviewing load light and assign to each paper a team of three to six reviewers. Most papers were reviewed by two student reviewers and two established researchers.
Debugging for Model Expansion
Authors: Johan Wittocx, Hanne Vlaeminck, Marc Denecker
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

Due to the development of efficient solvers, declarative problem solving frameworks based on model generation are becoming more and more applicable in practice. However, there are almost no tools to support debugging in these frameworks. For several reasons, current solvers are not suitable for debugging by tracing. In this paper, we propose a new solver algorithm for one of these frameworks, namely Model Expansion, that allows for debugging by tracing. We explain how to explore the trace of this solver in order to quickly locate a bug and we compare our debugging method with existing ones for Answer Set Programming and the Alloy system.
Competitive generative models with structure learning for NLP classification tasks
Authors: Kristina Toutanova
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

In this paper we show that generative models are competitive with and sometimes superior to discriminative models, when both kinds of models are allowed to learn structures that are optimal for discrimination. In particular, we compare Bayesian Networks and Conditional loglinear models on two NLP tasks. We observe that when the structure of the generative model encodes very strong independence assumptions (a la Naive Bayes), a discriminative model is superior, but when the generative model is allowed to weaken these independence assumptions via learning a more complex structure, it can achieve very similar or better performance than a corresponding discriminative model. In addition, as structure learning for generative models is far more efficient, they may be preferable for some tasks.
Research on the Economical Evaluation for Airlines Code Sharing
Authors: Ling-Yu Kong, Xiao-jin Li, Shu-long Zhao, Bo Jiang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Code share agreements, whereby an airline can market seats on some of its partners’ ﬂights, have been a common practice in the airline industry for the past thirty years. The quantitative analysis is very valuable for China civil aviation to research the economics of code sharing. In this paper, based on relevant assumptions, the Maximum Profit Function (MPF) among different code sharing options has been established , in which the optimum fare can be gained to calculate the airlines maximum profit. Then the results would be tested by the air passengers' welfare function. Finally, the method is applied in practice successfully.
UbiGesture: Customizing and Profiling Hand Gestures in Ubiquitous Environment
Authors: Ayman Atia, Shin Takahashi, Kazuo Misue, Jiro Tanaka
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

One of the main challenges of interaction in a ubiquitous environment is the use of hand gestures for interacting with day to day applications. This interaction may be negatively affected due to the change in the user's position, interaction device, or the level of social acceptance of a specific hand gesture. We present UbiGesture as architecture for developers and users who frequently change locations while interacting in ubiquitous environments. The architecture enables applications to be operated by using hand gestures. Normal users can customize their own hand gestures when interacting with computers in context-aware ubiquitous environments. UbiGesture is based on combining user preferences, location, input/output devices, applications, and hand gestures into one profile. A prototype implementation application for UbiGesture is presented. Then a subjective and objective primary evaluation for UbiGesture while interacting in different locations with different hand gesture profiles is presented.
Does This Set of Clauses Overlap with at Least One MUS?
Authors: Éric Grégoire, Bertrand Mazure, Cédric Piette
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

This paper is concerned with the problem of checking whether a given subset Γ of an unsatisfiable Boolean CNF formula Σ takes part in the basic causes of the inconsistency of Σ. More precisely, an original approach is introduced to check whether Γ overlaps with at least one minimally unsatisfiable subset (MUS) of Σ. In the positive case, it intends to compute and deliver one such MUS. The approach re-expresses the problem within an evolving coarser-grained framework where clusters of clauses of Σ are formed and examined according to their levels of mutual conflicts when they are interpreted as basic interacting entities. It then progressively refines the framework and the solution by splitting most promising clusters and pruning the useless ones until either some maximal preset computational resources are exhausted, or a final solution is discovered. The viability and the usefulness of the approach are illustrated through benchmarks experimentations.
Workflow-Based Office Automation Decision-Making Support System
Authors: Feng Ye, Xia Liu, Dan-dan Sun, Jian-hu Cai
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

This article is about how to design and realistic a workflow-based office automation decision-making support system, it focuses on how to control workflow circulation through authorize control and how to use the knowledge that produced in the process of workflow through knowledge storage and inference. How to collect information from workflow files is always a problem, this article introduce an easy solution to solve it, through embed an ActiveX control DsoFramer into the web, which can edit word files and abstract information from it automation. The system is based on B/S structure, which has the advantage of convenient for maintain. To make usage more facility and efficiency, system assembled document and graphic processing module on one web page, user can modify work related graphic and insert it into working documents easily.
Optimal design for inspection and maintenance policy based on the CCC chart
Authors: Ling-Yau Chan, Shaomin Wu
Venue: Computers and Industrial Engineering (2009)

In this paper, the concept of cumulative count of conforming chart (CCC chart) is applied in inspection and maintenance planning for systems where minor inspection, major inspection, minor maintenance and major maintenance are available. Several inspection and maintenance plans are defined and studied quantitatively. Analytic expressions of relevant statistics and their expectations are derived. These inspection and maintenance plans are optimized from an economic consideration.
The Study of Using Computer Mediated Communication (CMC) to Promote EFL Learning
Authors: Sun Zhuo, Yang Min, Song Yunxia
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

With the development of information technology in the past 10 years, computers have been widely used in the field of English learning. This dissertation is devoted to discovering the possibilities of utilizing Computer Mediated Communication (CMC) as an instructional tool in promoting EFL learning.
A Study of Auditory Warning Signals for the Design Guidelines of Man-Machine Interfaces
Authors: Mie Nakatani, Daisuke Suzuki, Nobuchika Sakata, Shogo Nishida
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

This paper presents an experimental study of the effects of respective sound parameters on human behavior in an emergency. In recent years, there are many natural disasters. The evacuation procedure is one of the pressing problems. Some audible alerts are entrenched in our daily life, such as police siren, ambulance siren, emergency bell, fire alarm and so on. Most people, however, don't escape by hearing the alert. People have a cry-wolf syndrome. Some researches have been studied for people to take appropriate action. One is going in the direction of education or training for people. Another is going in the direction of improved evacuation call. We have studied about auditory warning signals to assist the design of the warning systems. In this paper, the dynamic change of the sound parameters due to a degree of danger is focused. First, the reference values of parameters are settled by the reaction time experiment. Then the effect of dynamically change in parameters is subjectively evaluated.
Mobile Agent Technology and Its Application in Distributed Data Mining
Authors: Ma Yubao, Ding Renyuan
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

Agent technology was now a great deal, due to the distributed artificial intelligence technology and the development of the birth of the Mobile Agent technology. Mobile Agent is an Agent, it has self-government, smart and lasting cooperation, as well as features. At present Mobile Agent technology has been a long-term development. Mobile Agent technology in the field of distributed applications in a wide range of applications. In this paper, distributed spatial data mining Agent framework model, which is to make mobile Agent technology in data mining a try.
Challenges for the Multi-dimensional Personalised Web
Authors: Vincent Wade
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Adaptive hypermedia and adaptive web research have been reasonable successful in researching personalisation in closed corpus content and to a much lesser extent in open corpus content. From a commercial perspective, web adaptivity has been more focused on adaptive content retrieval rather than adaptive content composition. However, personal use of the web extends far beyond just content, and encompasses many dimensions which need to be addressed concurrently e.g. tasks activities, cultural preferences, and social interaction etc. We need to consider new directions and dimensions in personalised, adaptive web and how they can be addressed within the same personal experience. In this talk I will investigate key challenges involving integrated open corpus service personalisation, cultural adaptivity (including multilingual personalisation), dialogue and simulation personalisation and the power of the crowd, which could greatly empower web users of the future. I will also consider emerging approaches to tackle these problems and examine what this might mean to current web based personalisation engines and platforms.
WSPR*: Web-Service Planner Augmented with A* Algorithm
Authors: Seog-Chan Oh, Ju-Yeon Lee, Seon-Hwa Cheong, Soo-Min Lim, Min-Woo Kim, Sang-Seok Lee, Jin-Bum Park, Sang-Do Noh, Mye M. Sohn
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

When there are a large number of web services in use, it is non-trivial to quickly find web services satisfying the given request. Furthermore, when no single web service satisfies the given request fully, one needs to “compose” multiple web services to fulfill the goal. It is important to have a wise decision on underlying web-service composition framework because the search space for such a composition problem is in general exponentially increasing. Furthermore, if semantic and QoS issues are concerned, the composition problems become easily intractable. Toward this problem, in this paper, we present WSPR* - Web-Service PlanneR augmented with A* algorithm (a Label Correcting variation algorithm) to compose web services effectively.