ppxscal/embedding_network huggingface dataset:
Joint extraction of entities and relations for opinion recognition
Authors: Yejin Choi, Eric Breck, Claire Cardie
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

We present an approach for the joint extraction of entities and relations in the context of opinion recognition and analysis. We identify two types of opinion-related entities --- expressions of opinions and sources of opinions --- along with the linking relation that exists between them. Inspired by Roth and Yih (2004), we employ an integer linear programming approach to solve the joint opinion recognition task, and show that global, constraint-based inference can significantly boost the performance of both relation extraction and the extraction of opinion-related entities. Performance further improves when a semantic role labeling system is incorporated. The resulting system achieves F-measures of 79 and 69 for entity and relation extraction, respectively, improving substantially over prior results in the area.
Mechanism of Using Activated Carbon for Mercury Removal in Flue Gas
Authors: Hong-liang Gao, Jing Hou
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

A bench-scale experimental system was conducted to study properties of activated carbon adsorption for mercury removal in flue gas. The test method used here for mercury concentration was cold-vapor atomic fluorescence spectroscopy (CVAAS). Mercury breakthrough efficiencies of activated carbon in different simulated flue gas systems were studied in typical constituent flue gas system. The conclusions are as follows: Mercury breakthrough efficiencies will become higher with adsorption temperature becoming higher; Mercury breakthrough efficiencies will become lower with C/Hg becoming higher; In order to make small dosage and cost-effective mercury adsorbents, two modified activated carbons were prepared by chemical methods including activated carbon impregnated with activated MnO2, and activated carbon impregnated with FeCl3. After analyzing the adsorbent mechanism of activated carbon and modified activated carbons, it is believed that there is chemical adsorption other than physical adsorption during the adsorption process of modified activated carbons.
Towards large scale argumentation support on the semantic web
Authors: Iyad Rahwan, Fouad Zablith, Chris Reed
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

This paper lays theoretical and software foundations for a World Wide Argument Web (WWAW): a large-scale Web of inter-connected arguments posted by individuals to express their opinions in a structured manner. First, we extend the recently proposed Argument Interchange Format (AIF) to express arguments with a structure based on Walton's theory of argumentation schemes. Then, we describe an implementation of this ontology using the RDF Schema language, and demonstrate how our ontology enables the representation of networks of arguments on the Semantic Web. Finally, we present a pilot Semantic Web-based system, ArgDF, through which users can create arguments using different argumentation schemes and can query arguments using a Semantic Web query language. Users can also attack or support parts of existing arguments, use existing parts of an argument in the creation of new arguments, or create new argumentation schemes. As such, this initial public-domain tool is intended to seed a variety of future applications for authoring, linking, navigating, searching, and evaluating arguments on the Web.
Constraint solving in common Lisp
Authors: Stephan Frank
Venue: Proceedings of the 2007 International Lisp Conference (2007)

Constraint solving has become an established approach for the handling of complex combinatorial and scheduling problems. We present a constraint solver framework that enables the interchange of most solver aspects through its extensive modular design. Here, we especially focus on the search protocol design. The system is compared to the renowned Screamer approach and shown to improve performance for several benchmark cases.
The Last Byte: The HLS tipping point
Authors: Jason Cong, Wolfgang Rosenstiel
Venue: IEEE Design Test (2009)

This column presents several reasons why the authors feel that the tipping point of high-level synthesis is getting close, including the needs of design space exploration, power optimization, behavior-level physical synthesis, and integrated design and validation.
Study on New Methods of Improving the Accuracy of Leak Detection and Location of Natural Gas Pipeline
Authors: Shuqing Zhang, Tianye Gao, Hong Xu, Guangpu Hao, Zhongdong Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

As negative pressure wave is applied to leak detection and location of natural gas pipeline, the key is how to realize accurate measurement of propagation velocity of pressure wave and time difference. However, there exists problem of lower accuracy in negative pressure wave method. Aiming at the problems of velocity measurement formula with low precision and low accuracy of leaking location, a modified velocity measurement formula is proposed. In addition, based on the theory of singularity detection of wavelet transform, the singular characteristic of the transform wave caused by pipeline leakage is detected accurately. The experimental results show that it can achieve leak detection and location of natural gas with higher accuracy through these methods.
A Study on Noisy Speech Recognition
Authors: Khalid Saeed, Adam Szczepanski
Venue: Proceedings of the 2009 International Conference on Biometrics and Kansei Engineering (2009)

The paper concentrates on a speech recognition algorithm to work with speech samples of nonhomogeneous quality. The speech samples are acquired using different microphones and are of different quality. Two algorithms of feature extraction are utilized,including the use of Toeplitz matrices and distances of feature points from the Cartesian origin point (0;0) as a reference point. For classification the Nearest Neighbor approach is used. The obtained results are promising.The paper also involves the description of the process in the preparation of speech samples. The approach to estimate the frequency range which contains enough information for proper speech recognition is undertaken. The studies in this paper show that cutting frequencies above 2200 Hz have rather low influence on the proper recognition but may rather lead to increase the error rate.
A Multi-objective Model of Information System Outsourcing Decision for Suppliers Selection
Authors: Cao Ping, Chen Fuji, Zhang Jian
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Supplier selection is a critical issue in information systems(IS) outsourcing decision, and it is a difficult problem which includes both tangible and intangible factors. Besides cost and benefit analysis, some intangible factors such as risk also need to be considered. In this paper, a multi-objective programming model is proposed to help outsourcers to select IS providers. This model considers cost and risk factor simultaneously in distribution of modules among candidate suppliers to minimize the total cost and failure rate. Then according to the difficulty of solving of this complicated nonlinear integer programming model, a modified hybrid algorithm is proposed to obtain the most preferred non-dominated solution. This algorithm is a hybrid algorithm combining genetic algorithm and particle swarm algorithm. Finally, a numerical example shows the effectiveness and feasibility of the model, and proved the convergence of the hybrid algorithm.
Meet continuity properties of posets
Authors: Xuxin Mao, Luoshan Xu
Venue: Theoretical Computer Science (2009)

In this paper we consider a number of properties of posets that are not directed complete: in particular, meet continuous posets, locally meet continuous posets and PI-meet continuous posets are introduced. Characterizations of (locally) meet continuous posets are presented. The main results are: (1) A poset is meet continuous iff its lattice of Scott closed subsets is a complete Heyting algebra; (2) A poset is a meet continuous poset with a lower hereditary Scott topology iff its upper topology is contained in its local Scott topology and the lattice of all local Scott closed sets is a complete Heyting algebra; and (3) A poset with a lower hereditary Scott topology is meet continuous iff it is locally meet continuous, iff it is PI-meet continuous.
Bayesian network, a model for NLP?
Authors: Davy Weissenbacher
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

The NLP systems often have low performances because they rely on unreliable and heterogeneous knowledge. We show on the task of non-anaphoric it identification how to overcome these handicaps with the Bayesian Network (BN) formalism. The first results are very encouraging compared with the state-of-the-art systems.
Towards an Approach to Ethics and HCI Development Based on Løgstrup's Ideas
Authors: Sandra Burri Gram-Hansen
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

Concurrent with interactive technologies playing an increasingly large part of the lives of people all over the world, ethical reflections concerning the use of such technology are becoming more and more important. Most often ethical evaluations of a technology are based on either a utilitarian or a deontological approach. Both kinds of approaches to the ethics of information technology appear to be inadequate. This paper suggests an alternative based on the works of the Danish philosopher K.E. Løgstrup (1905-1981). On this basis it is argued that an attitude change is required amongst the developers of interactive technologies in order for new technologies to be developed in a truly ethical manner.
Non-deterministic Explanation of Immune Responses: A Computer Model
Authors: Anastasio Salazar-Bañuelos
Venue: Proceedings of the 8th International Conference on Artificial Immune Systems (2009)

Classically, immune responses are considered to be antigen-driven, implying a direct or indirect pattern recognition. This deterministic, instructionalist view of the immune system relies on molecular recognition; hence, the occurrence of immune responses depends exclusively on the differentiation between "Self" and "Non-Self" molecules[1,2]. A different approach is to consider immune responses as the emergent phenomena of a complex dynamic system as it is understood in System Biology[3]. Here, I present a computer simulation in NetLogo4.0.3[4] based on a theory that considers the emergence of inflammation as the defining phenomena of an immune response. Whereas the theory recognizes that microscopic events such as molecular recognition are part of the dynamics of the system, it maintains that immune phenomena cannot be understood from the study of individual events alone. The theoretical basis for this work is described elsewhere [5]. 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
Animated Transitions for Adaptive Small Size Mobile Menus
Authors: Jussi Huhtala, Jani Mäntyjärvi, Aino Ahtinen, Leena Ventä, Minna Isomursu
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part I (2009)

This paper explores how the user interface of a mobile device could support human perception and conception of changes in its environment. Animated transition effects may hold potential for visualizing changes in the resources available for the user through the context-aware user interface. Four different transition types are investigated. Each transition represents a different approach for visualizing changes in UI. The transitions are evaluated with 40 test subjects, half in India and half in Europe. Statistical analysis of the results indicates that animated transition effects have a clear positive effect on perception and conception of change.
Jointly combining implicit constraints improves temporal ordering
Authors: Nathanael Chambers, Dan Jurafsky
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

Previous work on ordering events in text has typically focused on local pairwise decisions, ignoring globally inconsistent labels. However, temporal ordering is the type of domain in which global constraints should be relatively easy to represent and reason over. This paper presents a framework that informs local decisions with two types of implicit global constraints: transitivity (A before B and B before C implies A before C) and time expression normalization (e.g. last month is before yesterday). We show how these constraints can be used to create a more densely-connected network of events, and how global consistency can be enforced by incorporating these constraints into an integer linear programming framework. We present results on two event ordering tasks, showing a 3.6% absolute increase in the accuracy of before/after classification over a pairwise model.
The Extension-Based Ant Colony Optimization of Finding Rough Set Reducts
Authors: Zhao Sujuan, Zeng Tao, Yu Yongquan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Ant colony algorithm is a simulated evolutionary algorithm, which shows many excellent characters and has succeeded in solving many difficult combinatorial optimization problems. However, it is not perfect now. Inspired by Dependent Function of Extension Theory, a new statue transition rule and local updating rule based on Dependent Function have been presented in this paper. And experimental results show that our algorithm is effective and useful.
Shoe-last design innovation for better shoe fitting
Authors: Ameersing Luximon, Yan Luximon
Venue: Computers in Industry (2009)

Shoe-last, a 3D mould used for making footwear, influence the shape, size and fitting of footwear. Current shoe-last design software has focused mainly on reverse engineering of existing shoe-last and modification. Shoe-last designers have generally preferred to design the shoe-last manually due to limitations of design software. In order to solve these problems, a new software based on CATIA platform was developed. The shoe-last model is based on foot shape measurement data and foot biomechanics. Using the existing shoe-last design standards and the sections from existing shoe-lasts, design tables and relationship equations enables the design of shoe-last with different toe type, heel height and custom shoe-last. The design includes comfort and fit aspects as well as design aspect, therefore enables design of aesthetical comfortable shoes. Since the design can be modified instantaneously, the designers could visualize design changes leading to a reduction in shoe-last design cycle.
Information retrieval oriented word segmentation based on character associative strength ranking
Authors: Yixuan Liu, Bin Wang, Fan Ding, Sheng Xu
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

This paper presents a novel, ranking-style word segmentation approach, called RSVM-Seg, which is well tailored to Chinese information retrieval(CIR). This strategy makes segmentation decision based on the ranking of the internal associative strength between each pair of adjacent characters of the sentence. On the training corpus composed of query items, a ranking model is learned by a widely-used tool Ranking SVM, with some useful statistical features, such as mutual information, difference of t-test, frequency and dictionary information. Experimental results show that, this method is able to eliminate overlapping ambiguity much more effectively, compared to the current word segmentation methods. Furthermore, as this strategy naturally generates segmentation results with different granularity, the performance of CIR systems is improved and achieves the state of the art.
Improved reconstruction of protolanguage word forms
Authors: Alexandre Bouchard-Côté, Thomas L. Griffiths, Dan Klein
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

We present an unsupervised approach to reconstructing ancient word forms. The present work addresses three limitations of previous work. First, previous work focused on faithfulness features, which model changes between successive languages. We add markedness features, which model well-formedness within each language. Second, we introduce universal features, which support generalizations across languages. Finally, we increase the number of languages to which these methods can be applied by an order of magnitude by using improved inference methods. Experiments on the reconstruction of Proto-Oceanic, Proto-Malayo-Javanic, and Classical Latin show substantial reductions in error rate, giving the best results to date.
Native Client: A Sandbox for Portable, Untrusted x86 Native Code
Authors: Bennet Yee, David Sehr, Gregory Dardyk, J. Bradley Chen, Robert Muth, Tavis Ormandy, Shiki Okasaka, Neha Narula, Nicholas Fullagar
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

This paper describes the design, implementation and evaluation of Native Client, a sandbox for untrusted x86 native code. Native Client aims to give browser-based applications the computational performance of native applications without compromising safety. Native Client uses software fault isolation and a secure runtime to direct system interaction and side effects through interfaces managed by Native Client. Native Client provides operating system portability for binary code while supporting performance-oriented features generally absent from web application programming environments, such as thread support, instruction set extensions such as SSE, and use of compiler intrinsics and hand-coded assembler. We combine these properties in an open architecture that encourages community review and 3rd-party tools.
On-line planning and scheduling: an application to controlling modular printers
Authors: Minh B. Do, Wheeler Ruml, Rong Zhou
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

This paper summarizes recent work reported at ICAPS on applying artificial intelligence techniques to the control of production printing equipment. Like many other real-world applications, such as mobile robotics, this complex domain requires real-time autonomous decision-making and robust continual operation. To our knowledge, this work represents the first successful industrial application of embedded domain-independent temporal planning. At the heart of our system is an on-line algorithm that combines techniques from state-space planning and partial-order scheduling. For example, our planning-graph-based planning heuristic takes resource contention into account when estimating makespan remaining. We suggest that this general architecture may prove useful as more intelligent systems operate in continual, on-line settings. Our system has enabled a new product architecture for our industrial partner and has been used to drive several commercial prototypes. When compared with state-of-the-art off-line planners, our system is hundreds of times faster and often finds better plans.
Using Heuristics to Automate Parameter Generation for Benchmarking of Java Methods
Authors: Michael Kuperberg, Fouad Omri
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Automated generation of method parameters is needed in benchmarking scenarios where manual or random generation of parameters are not suitable, do not scale or are too costly. However, for a method to execute correctly, the generated input parameters must not violate implicit semantical constraints, such as ranges of numeric parameters or the maximum length of a collection. For most methods, such constraints have no formal documentation, and human-readable documentation of them is usually incomplete and ambiguous. Random search of appropriate parameter values is possible but extremely ineffective and does not pay respect to such implicit constraints. Also, the role of polymorphism and of the method invocation targets is often not taken into account. Most existing approaches that claim automation focus on a single method and ignore the structure of the surrounding APIs where those exist. In this paper, we present HeuriGenJ, a novel heuristics-based approach for automatically finding legal and appropriate method input parameters and invocation targets, by approximating the implicit constraints imposed on them. Our approach is designed to support systematic benchmarking of API methods written in the Java language. We evaluate the presented approach by applying it to two frequently-used packages of the Java platform API, and demonstrating its coverage and effectiveness.
It Is Not Just a Game!
Authors: Martin Shubik
Venue: Simulation and Gaming (2009)

An overall view of the development of gaming and simulation is presented. This includes a consideration of some observations on what had been predicted and what happened, as well as some predictions concerning the future. Stress is given to prediction based on what is technically feasible and prediction based on the sociopolitical environment. It is suggested that âto planâ is an irregular verb with four tenses: the past imperfect, the present unclear, the future perfect, and finally, the future probable.
The Similarity of Text Based on Hierarchical Network of Concept
Authors: Xu Xiaoqing, Wang Jingzhong
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

A model of semantic-based text formalization, Context Framework Model, is presented in this paper. Based on the similarity of Context Framework, the filtering task can be transferred to the similarity computing among semantic terms. The algorithm, dealing with the domain of the text and the semantic role of the object, computes the synonymy, polysemy and the combination among concepts, and focus on the confusion of commendatory and derogatory.
PMMR: A Method for Masking Repeats in DNA Fragment Assembly
Authors: Kui Cai, Jincai Yang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

A method named PMMR (previously merging for masking repeats) is proposed in this paper for masking repeats in DNA fragment assembly. The method firstly identifies and counts the fragments including a same k-mer substring by scanning the shotgun data set. Then, it merges these fragments by the same k-mer substring. Based on merging, the method can not only mark the position of the repeats, but also reduce the scale of shotgun data set. The computer simulations show that the rate of repeats recognition is enhanced in this method, and the CPU time of DNA fragment assembly will be reduced.