ppxscal/embedding_network huggingface dataset:
Constraint-based entity matching
Authors: Warren Shen, Xin Li, AnHai Doan
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Entity matching is the problem of deciding if two given mentions in the data, such as "Helen Hunt" and "H. M. Hunt", refer to the same real-world entity. Numerous solutions have been developed, but they have not considered in depth the problem of exploiting integrity constraints that frequently exist in the domains. Examples of such constraints include "a mention with age two cannot match a mention with salary 200K" and "if two paper citations match, then their authors are likely to match in the same order". In this paper we describe a probabilistic solution to entity matching that exploits such constraints to improve matching accuracy. At the heart of the solution is a generative model that takes into account the constraints during the generation process, and provides well-defined interpretations of the constraints. We describe a novel combination of EM and relaxation labeling algorithms that efficiently learns the model, thereby matching mentions in an unsupervised way, without the need for annotated training data. Experiments on several real-world domains show that our solution can exploit constraints to significantly improve matching accuracy, by 3-12% F-1, and that the solution scales up to large data sets.
Performance of Biological-Ecological Process for Rural Domestic Sewage Treatment in Taihu Lake Region
Authors: Zhaoqian Jing, Zheng Wang, Xiwu Lu, Xianning Li
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Rural domestic sewage is one of the main pollution sources of Taihu Lake. To seek suitable sewage treatment technology, investigation and pilot research was conducted in rural places in Taihu Lake region. Field investigation was done by questionnaire and sewage sampling analysis. Demonstration project was built with a biological-ecological process consisting of anaerobic hydrolysis, waterfall aeration contact oxidation and constructed wetland in a village named Linzhuang. The influent and effluent samples of this system were monitored for 6 months. Field investigation data showed sewage indexes in rural villages fluctuated greatly. Operation results of the pilot system indicated this combined process was efficient in pollutants removal. Chemical oxygen demand (COD), total phosphorus (TP) and total nitrogen (TN) in the effluent from this process was stably below 50 mg/l, 0.5 mg/l and 12.9 mg/l respectively. COD was mainly removed by anaerobic hydrolysis and contact oxidation, while nitrogen was mostly distripped by nitrification in contact oxidation unit and denitrification in hydrolysis unit. Most of TP removal was accomplished in the constructed wetland by filter interception, plant adsorption and microbial transformation. Owing to mutually complementary interaction between biological and ecological methods, the performance of this system was not obviously affected by influent and temperature fluctuation. This system was efficient in pollutants removal and cost effective in building and operating.
Generating Verified Java Components through RESOLVE
Authors: Hampton Smith, Heather Harton, David Frazier, Raghuveer Mohan, Murali Sitaraman
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

For software components to be reused with confidence, they must be correct. Unlike testing, formal verification can be used to certify that a component will behave correctly regardless of context, as long as that context satisfies component assumptions. Some verification systems for developing correct components in languages such as Java are simplified to be practical, but are not complete. Other systems that account for necessary semantic complications arising from underlying reference behavior demand non-trivial specification and verification. This paper describes an alternative. Under this approach, reusable components are specified, implemented, and verified in RESOLVE, a language with clean semantics, and are translated to Java. To improve confidence in the verification process, we are currently re-engineering the RESOLVE verification system itself with generated verified components.
Evaluation of the Competition Policy to Encourage MVNO System in Japan
Authors: Yuki Shoji
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Due to the government’s pro-competition policies, MVNO systems are emerging in Japan. In this paper, I will evaluate the competition policy of the government encouraging MVNO system in the context of one-way access charge.
Stochastic Data Streams
Authors: S. Muthukrishnan
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

The classical data stream problems are now greatly understood [1]. This talk will focus on problems with stochastic (rather than deterministic) streams where the underlying physical phenomenon generates probabilistic data or data distributions.
On Herding Artificial Cows: Using Jadex to Coordinate Cowboy Agents
Authors: Gregor Balthasar, Jan Sudeikat, Wolfgang Renz
Venue: Programming Multi-Agent Systems: 6th International Workshop, ProMAS 2008, Estoril, Portugal, May 13, 2008. Revised Invited and Selected Papers (2009)

The Cows and Herders scenario of the 2008 Multi---Agent Programming Contest provides a challenging testbed for the coordination of intelligent agents. Our first---time participation in this contest is based on a set of BDI agents which share knowledge and coordinate by a centralized planning guidance to cope with the (possibly) hostile environment. The conceived design has been implemented in the Jadex system which provides an execution environment for BDI---style agents on the basis of a distributed systems middleware.
The simulation of binaural hearing caused by a moving sound source
Authors: P. L. Lee, J. H. Wang
Venue: Computers and Structures (2009)

Auditory perception of the sound with respect to a moving sound source passing by the observer was investigated in this work. The sound pressure at the entrance of the external ear canal was calculated by the solution of the Ffowcs Williams-Hawkings equation. Furthermore, the Hilbert Huang transformation is used to find the instantaneous frequencies of acoustic signal. Results show that the Interaural Level Difference and the frequencies shifting are eventful cues to perceive the direction and the speed of the moving sound source. In addition, the perceived loudness level will be larger in the motional case than that found in the stationary cases.
Approaches to Decision Inference Rules Based on Concept Lattices
Authors: Guo-Fang Qiu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Four kinds of basic decision rule sets are respectively produced from the formal concept lattice, the dual formal concept lattice, the object-oriented concept lattice and the attribute-oriented concept lattice in a formal context. Based on these sets, two types of decision inferences are established via an inclusion degree. The corresponding decisions by inferences are proved to be the lower and the upper approximated decisions. Thus total decision rules described as the lower and the upper approximated decision rules are obtained. And they are accordant and consistent with the basic decision rule sets.
Research on the Genetic Neural Network for the Computation of Ship Resistance
Authors: Chen Ai-guo, Ye Jia-wei
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

The topology structure of the neural network for the computation of ship resistance is designed. The evaluation function adopts msereg. Applying the original experimental data of series 60 ship models, the overall arithmetical crossover and the adaptive mutation, optimize the Weights and threshold values of the neural network by genetic algorithm. Then, applying back propagation algorithm to go on training the neural network, develop the optimal genetic neural network for the computation of ship resistance. Easily and quickly calculating ship resistance, the neural network can be applied to research the performance of ship resistance, the optimization of hull form and the optimal matching design of ship engine and propeller.
On-line case-based plan adaptation for real-time strategy games
Authors: Neha Sugandh, Santiago Ontañón, Ashwin Ram
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Traditional artificial intelligence techniques do not perform well in applications such as real-time strategy games because of the extensive search spaces which need to be explored. In addition, this exploration must be carried out on-line during performance time; it cannot be precomputed. We have developed on-line case-based planning techniques that are effective in such domains. In this paper, we extend our earlier work using ideas from traditional planning to inform the real-time adaptation of plans. In our framework, when a plan is retrieved, a plan dependency graph is inferred to capture the relations between actions in the plan. The plan is then adapted in real-time using its plan dependency graph. This allows the system to create and adapt plans in an efficient and effective manner while performing the task. The approach is evaluated using WARGUS, a well-known real-time strategy game.
A Meta-information Based Rule Mining System for Vehicle Parking Decision Support
Authors: Jian Su, Wenyong Weng, Zebing Wang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Vehicle parking problem is a critical problem for most Chinese cities. In order to find out the rules hidden in the underlying data of vehicle parking, a rule mining system has been developed based on a meta-information mechanism. Meta-information is a simple data structure for describing a distributed information system or its subsystems of the rough set theory, and meta-information mechanism is a suitable basis to implement many rough set methods, such as rule extraction and attribute reduction. By the rule mining system, many meaningful rules will be extracted. The rule mining system is a typical application of meta-information mechanism, and will take advantages of the merits of meta-information mechanism.
A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata
Authors: Rodolfo Gómez
Venue: Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems (2009)

Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more natural representation of urgent actions, with the additional advantage of avoiding the most common form of timelocks. We offer a compositional translation of a practically useful subset of TAD to timed safety automata (the well-known variant of timed automata where time progress conditions are expressed by invariants). More precisely, we translate networks of TAD to the modeling language of Uppaal, a state-of-the-art verification tool for timed automata. We also describe an implementation of this translation, which allows Uppaal to aid the design and analysis of TAD models.
Correlation indicators of microchanges in technical states of control objects
Authors: T. A. Aliev, G. A. Guluyev, A. H. Rzayev, F. H. Pashayev
Venue: Cybernetics and Systems Analysis (2009)

The paper shows that due to the dynamics and varied characteristics of signals received from output sensors, there are some difficulties in indicating the initial period of changing the technical conditions of objects. Technologies are proposed to estimate correlated noise indicators, which provide a reliable reaction to incipient defects. This effect is achieved due to the excess-frequency analysis, which allows extracting additional information from both a useful signal and noise.
On the enactability of business protocols
Authors: Nirmit Desai, Munindar P. Singh
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Protocols specifying business interactions among autonomous parties enable reuse and promote interoperability. A protocol is specified from a global viewpoint, but enacted in a distributed manner by (agents playing) different roles. Each role describes a local representation. An ill-specified protocol may yield roles that fail to produce correct enactments of the protocol. Existing approaches lack a formal and comprehensive treatment of this problem. Building on recent work on declaratively specifying a protocol as a set of rules of causal logic, this paper formally defines the enactability of protocols. It presents necessary and sufficient conditions for the enactability of a protocol as well as a decision procedure for extracting correct roles from enactable protocols.
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Authors: Krishnam Raju Jampani, Anna Lubiw
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We introduce the simultaneous representation problem, defined for any graph class $\cal C$ characterized in terms of representations, e.g. any class of intersection graphs. Two graphs G 1 and G 2, sharing some vertices X (and the corresponding induced edges), are said to have a simultaneous representation with respect to a graph class $\cal C$, if there exist representations R 1 and R 2 of G 1 and G 2 that are "consistent" on X. Equivalently (for the classes $\cal C$ that we consider) there exist edges E¿ between G 1 ¿ X and G 2 ¿ X such that G 1 ¿ G 2 ¿ E¿ belongs to class $\cal C$.Simultaneous representation problems are related to graph sandwich problems, probe graph recognition problems and simultaneous planar embeddings and have applications in any situation where it is desirable to consistently represent two related graphs.In this paper we give efficient algorithms for the simultaneous representation problem on chordal, comparability and permutation graphs. These results complement the recent poly-time algorithms for recognizing probe graphs for the above classes and imply that the graph sandwich problem for these classes is solvable for an interesting special case: when the set of optional edges induce a complete bipartite graph. Moreover for comparability and permutation graphs, our results can be extended to solve a generalized version of the simultaneous representation problem when there are k graphs any two of which share a common vertex set X. This generalized version is equivalent to the graph sandwich problem when the set of optional edges induce a k-partite graph.
Refining the most frequent sense baseline
Authors: Judita Preiss, Jon Dehdari, Josh King, Dennis Mehay
Venue: Proceedings of the Workshop on Semantic Evaluations: Recent Achievements and Future Directions (2009)

We refine the most frequent sense baseline for word sense disambiguation using a number of novel word sense disambiguation techniques. Evaluating on the Senseval-3 English all words task, our combined system focuses on improving every stage of word sense disambiguation: starting with the lemmatization and part of speech tags used, through the accuracy of the most frequent sense baseline, to highly targeted individual systems. Our supervised systems include a ranking algorithm and a Wikipedia similarity measure.
Preliminary Study on Vibrotactile Messaging for Sharing Brief Information
Authors: Teruaki Ito
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Ubiquitous computing is spreading as a post-desktop model of human-computer interaction, in which information processing is thoroughly integrated into everyday objects and activities. This study focuses on the vibrotactile signals for sharing and feeling the brief information among several users. The information here is limited to brief information which does not include detailed information but does cover the rough idea of the content of the information, so that the data size of the information can be kept very small. This paper presents a prototype device for vibrotactile messaging called VIBRATO. Then it shows the experimental results regarding VIBRATO message under different conditions and clarifies how to use VIBRATO effectively for understanding vibrotactile messages. The simple vibration alert used in a silent mode of mobile phones does not fully exploit the potential of vibration as a means of communication. This experiment shows how to exploit this potentiality of vibration.
Achievable sum-rate analysis of correlated two-antenna MIMO uplink channels
Authors: Jin-Woo Lee, Yong-Hwan Lee
Venue: International Journal of Communication Systems (2009)

This paper analyzes the achievable sum-rate of correlated two-antenna multiple-input multiple-output (MIMO) uplink channels. Most of previous works have considered the case when a single user has multiple transmit antennas (i.e. multi-antenna single-user scenario). This paper considers the case when two-antenna MIMO uplink channels comprise two users with a single transmit antenna (i.e. single-antenna two-user scenario). The analytic and simulation results show that the achievable sum-rate of correlated single-antenna two-user MIMO uplink channels highly depends on the angle difference between the receive correlation coefficients of two users. It is also shown that the achievable sum-rate of correlated single-antenna two-user MIMO uplink channels is larger than that of correlated two-antenna single-user MIMO uplink channels and can even be larger than that of independent and identically distributed Rayleigh two-antenna MIMO uplink channels. Copyright &copy; 2009 John Wiley & Sons, Ltd.
The Integrative Storage and Management of Land Resources Data Center Based on Oracle Spatial
Authors: Mei Zhong, Dejun Xu, Qingyun Du, Zhiwei Ye
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

For the development of land resources informationization, the demand of data communion and information service becomes more and higher. It is necessary to construct integrative land resources data center to manage and maintain diversified thematic data, integrate dispersive and independent land resources information, in order to serve land resources management decision-making better and afford network social work. This paper proposes object-relation database management mode, and actualize integrative storage management and make the best of data center by Oracle Spatial. The paper analyses storage mode of data center, data structure of map document, and the integrative storage management of thematic layer based on Oracle Spatial technology. Experiment shows that proposed method performs very well in land resources management.
Study of Network-Based Approaches for Anonymous Communication
Authors: Zhao Jinguo, Gao Weimin
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

We first provide an overview of the better known network approaches for assuring anonymity and privacy over networks. Then analyze possible attacks on network, discuss the key approaches and their implementation design issues for network privacy. In the conclusion we discuss the results, indicating research opportunities in this domain.
JHU1: an unsupervised approach to person name disambiguation using web snippets
Authors: Delip Rao, Nikesh Garera, David Yarowsky
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper presents an approach to person name disambiguation using K-means clustering on rich-feature-enhanced document vectors, augmented with additional web-extracted snippets surrounding the polysemous names to facilitate term bridging. This yields a significant F-measure improvement on the shared task training data set. The paper also illustrates the significant divergence between the properties of the training and test data in this shared task, substantially skewing results. Our system optimized on F0.2 rather than F0.5 would have achieved top performance in the shared task.
Prottle: a probabilistic temporal planner
Authors: Iain Little, Douglas Aberdeen, Sylvie Thiébaux
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

Planning with concurrent durative actions and probabilistic effects, or probabilistic temporal planning, is a relatively new area of research. The challenge is to replicate the success of modern temporal and probabilistic planners with domains that exhibit an interaction between time and uncertainty. We present a general framework for probabilistic temporal planning in which effects, the time at which they occur, and action durations are all probabilistic. This framework includes a search space that is designed for solving probabilistic temporal planning problems via heuristic search, an algorithm that has been tailored to work with it and an effective heuristic based on an extension of the planning graph data structure. Prottle is a planner that implements this framework, and can solve problems expressed in an extension of PDDL.
Selling Practices in Online Fixed-Price Marketplaces
Authors: Adriano Pereira, Diego Duarte, Wagner Meira Jr., Paulo Goes
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

In the last decade, there has been an explosion of online commercial activity enabled by the World Wide Web (WWW). In Brazil, probably by cultural influence, online auctions are not so popular, since users prefer fixed-price for online negotiation. This work presents a characterization and analysis of fixed-price online negotiations. Using actual data from a Brazilian marketplace, we analyze selling practices, considering seller profiles and selling strategies. We study and confirm several important hypotheses about selling practices in online marketplaces, which allow us to state interesting conclusions, such as: the product category impacts the seller profile and the selling strategies; and the best selling practices vary for different products.
Global Optimal Multiple Object Detection Using the Fusion of Shape and Color Information
Authors: Marek Schikora
Venue: Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (2009)

In this work we present a novel method for detecting multiple objects of interest in one image, when the only available information about these objects are their shape and color. To solve this task we use a global optimal variational approach based on total variation. The presented energy functional can be minimized locally due its convex formulation. To improve the runtime of our algorithm we show how this approach can be scheduled in parallel.Our algorithm works fully automatically and does not need any user interaction. In experiments we show the capabilities in non-artificial images, e.g. aerial or bureau images. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player