ppxscal/embedding_network huggingface dataset:
On possible applications of rough mereology to handling granularity in ontological knowledge
Authors: Pavel Klinov, Lawrence J. Mazlack
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Representing and reasoning about knowledge is critical in Artificial Intelligence. There is a distinction between factual and ontological knowledge. Factual knowledge represents a set of facts about individual objects that are known or believed whereas ontological (background) knowledge represents implicit concepts and relationships that are assumed to exist in the world. Ontological knowledge is often represented as a hierarchy of concepts because splitting things of the real world into categories and sub-categories is a natural way of human thinking. One example of conceptual hierarchies in AI is ontologies that are widely used in such areas as Natural Language Processing, Semantic Web, etc. Representation of both types of knowledge becomes difficult when the knowledge is imprecise. One example of imprecision is granularity i.e. inability to distinguish between the individual objects. In this case, knowledge cannot be represented precisely but can be approximated with respect to the granularity of the domain. Approximation of factual knowledge has been extensively researched and often employs Rough Set Theory (Pawlak 1982) for dealing with indiscernibility of objects. Similar approach has been applied to ontologies to approximate concepts in the hierarchy (Doherty et al. 2003). The open problem is the approximations of hierarchical relationships (such as "is-a", "part-of') between concepts. This paper addresses this issue using Rough Mereology (Polkowski & Skowron 1996) complemented with Interval Analysis (Moore 1966). The principal contribution is to provide rough mereological functions that can be used for representation and reasoning with formal ontologies in approximation spaces. Specifically, approximate concept membership and approximate concept subsumption functions will be provided. It can be demonstrated that the interval based functions are free of the shortcomings of the previously suggested definitions (Cao, Sui, & Zhang 2003) (Klinov & Mazlack 2007).
On User Data Protocol of SMS in Remote Monitoring System
Authors: Yu Zhen, Sun Qiuwei
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

This paper looks into the features of SMS (short message service) relevant to building a remote monitoring system. Based on the analysis of SMS, a set of guidelines for customizing the user data protocol of short messages are presented. The paper brings forward a method for encapsulating a Modbus message into a short message. It also discusses user data protocol of ASCII-coded immediate alarm messages for alarm systems and instruction messages that are transmitted between monitoring systems and mobile handsets. Based on the presented user data protocols for SMS, the paper expounds on the design of the gateway of a remote monitoring system from a software perspective.
Reasoning about Relations with Dependent Types: Application to Context-Aware Applications
Authors: Richard Dapoigny, Patrick Barlatier
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

Generally, ontological relations are modeled using fragments of first order logic (FOL) and difficulties arise when meta-reasoning is done over ontological properties, leading to reason outside the logic. Moreover, when such systems are used to reason about knowledge and meta-knowledge, classical languages are not able to cope with different levels of abstraction in a clear and simple way. In order to address these problems, we suggest a formal framework using a dependent (higher order) type theory. It maximizes the expressiveness while preserving decidability of type checking and results in a coherent theory. Two examples of meta-reasoning with transitivity and distributivity and a case study illustrate this approach.
An approach to multi-attribute negotiation between semantic web services
Authors: Sandeep Kumar, R. B. Mishra
Venue: International Journal of Web Engineering and Technology (2009)

In a semantic web-based system, before taking the services of a Service Provider (SP), the requester may need to negotiate with it on various issues. This paper presents a Multi-Attribute Negotiation (MAN) approach for negotiation between Semantic Web Services (SWSs). The communication model along with the algorithms for various actions involved in the negotiation process is described. A novel concept of negotiation feedback using a novel data structure, an Agreement Table (AT), is proposed to expedite the negotiation process. The paper also proposes a multi-attribute-based utility model which is based on the novel understanding that if the price, response time and other such attributes of a service are changed appropriately with a change in quality, then the utility of the service should remain intact. In support of the presented approach, a prototype system providing negotiation between SWSs is implemented. The presented work is evaluated against existing similar works and its advantages are reported.
Toward an underspecifiable corpus annotation scheme
Authors: Yuka Tateisi
Venue: Coling 2008: Proceedings of the workshop on Cross-Framework and Cross-Domain Parser Evaluation (2008)

The Wall Street Journal corpora provided for the Workshop on Cross-Framework and Cross-Domain Parser Evaluation Shared Task are investigated in order to see how the structures that are difficult for an annotator of dependency structure are encoded in the different schemes. Non-trivial differences among the schemes are found. The paper also investigates the possibility of merging the information encoded in the different corpora.
Technical communique: Risk-sensitive control for a class of homing problems
Authors: Cloud Makasu
Venue: Automatica (Journal of IFAC) (2009)

A result of Lefebvre [Lefebvre, M. (2001). A different class of homing problems. Systems & Control Letters 42, 347-352] is here extended to a two-dimensional homing problem with a risk-sensitive cost criterion. It is shown that the optimal control is given explicitly, and moreover, the optimal value function has a simple probabilistic representation associated with a backward stochastic differential equation with a random terminal time.
Refutation by randomised general resolution
Authors: Steven Prestwich, Inês Lynce
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Local search is widely applied to satisfiable SAT problems, and on some problem classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAllester in 1997 is to use it instead to prove unsatisfiability. We design a greedy randomised resolution algorithm called RANGER that will eventually refute any unsatisfiable instance while using only bounded memory. RANGER can refute some problems more quickly than systematic resolution or backtracking with clause learning. We believe that non-systematic but greedy inference is an interesting research direction for powerful proof systems such as general resolution.
Two-Dimensional Multilabel Active Learning with an Efficient Online Adaptation Model for Image Classification
Authors: Guo-Jun Qi, Xian-Sheng Hua, Yong Rui, Jinhui Tang, Hong-Jiang Zhang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Conventional active learning dynamically constructs the training set only along the sample dimension. While this is the right strategy in binary classification, it is suboptimal for multilabel image classification. We argue that for each selected sample, only some effective labels need to be annotated while others can be inferred by exploring the label correlations. The reason is that the contributions of different labels to minimizing the classification error are different due to the inherent label correlations. To this end, we propose to select sample-label pairs, rather than only samples, to minimize a multilabel Bayesian classification error bound. We call it two-dimensional active learning because it considers both the sample dimension and the label dimension. Furthermore, as the number of training samples increases rapidly over time due to active learning, it becomes intractable for the offline learner to retrain a new model on the whole training set. So we develop an efficient online learner to adapt the existing model with the new one by minimizing their model distance under a set of multilabel constraints. The effectiveness and efficiency of the proposed method are evaluated on two benchmark data sets and a realistic image collection from a real-world image sharing Web site—Corbis.
How Many Election Officials Does It Take to Change an Election?
Authors: P. Y. Ryan
Venue: Foundations and Applications of Security Analysis: Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, ARSPA-WITS 2009, York, UK, March 28-29, 2009, Revised Selected Papers (2009)

Electronic voting technologies have been quite widely deployed in a number of democracies. In the US for example, approximately 30% of the electorate used Direct Recorded Electronic (DRE) machines in the 2004 and 2008 presidential election. These systems have come in for significant criticism leading many experts to conclude that all digital technology used in voting must be flawed. While these critiques are fully justified and documented, to conclude that all voting technology must be irredeemably flawed is not in our view justified. The purpose of this note is to argue that, while it is undoubtedly true that careless introduction of information technology can undermine democracy, high assurance, verifiable voting schemes do exist and are worthy of serious consideration. Furthermore, such verifiable schemes can provide higher levels of trustworthiness than traditional pencil and paper, hand counting systems. The challenge remains to convince the various stakeholders of the trustworthiness of such schemes. 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
GEP-Based Temporal Data Aggregation in Wireless Sensor Networks
Authors: Honglei Gao, Wenzhong Guo, Guolong Chen, Jiawen Lin, Yanhua Liu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

In order to decrease the traffic in the wireless sensor networks, a Gene Expression Programming based temporal data aggregation technique (GEPWSNDA) is presented. Two matching predictors with the same GEP-WSNDA models are deployed at the server and the node respectively, which predict the next immediate sampling value simultaneously. The sampling value and new model are sent to the server only when the difference between the actual and the predicted value at the node exceeds a certain threshold. Besides, since its own intrinsic characteristics, GEP-WSNDA solves the problem that the traditional time series methods can't make an accurate prediction without the pre-knowledge. By employing GEP-WSNDA, the experiments on ocean air temperature data 2007 reached the expectation and made a precise prediction. When error threshold is 0.05°, it can filter about 80% data and remain high precision.
A Calculus to Detect Guessing Attacks
Authors: Bogdan Groza, Marius Minea
Venue: Proceedings of the 12th International Conference on Information Security (2009)

We present a calculus for detecting guessing attacks, based on oracles that instantiate cryptographic functions. Adversaries can observe oracles, or control them either on-line or off-line. These relations can be established by protocol analysis in the presence of a Dolev-Yao intruder, and the derived guessing rules can be used together with standard intruder deductions. Our rules also handle partial verifiers that fit more than one secret. We show how to derive a known weakness in the Anderson-Lomas protocol, and new vulnerabilities for a known faulty ATM system.
Probabilistic Modeling and Visualization of the Flexibility in Morphable Models
Authors: M. Lüthi, T. Albrecht, T. Vetter
Venue: Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII (2009)

Statistical shape models, and in particular morphable models, have gained widespread use in computer vision, computer graphics and medical imaging. Researchers have started to build models of almost any anatomical structure in the human body. While these models provide a useful prior for many image analysis task, relatively little information about the shape represented by the morphable model is exploited. We propose a method for computing and visualizing the remaining flexibility, when a part of the shape is fixed. Our method, which is based on Probabilistic PCA, not only leads to an approach for reconstructing the full shape from partial information, but also allows us to investigate and visualize the uncertainty of a reconstruction. To show the feasibility of our approach we performed experiments on a statistical model of the human face and the femur bone. The visualization of the remaining flexibility allows for greater insight into the statistical properties of the shape.
Speedup of Color Palette Indexing in Self---Organization of Kohonen Feature Map
Authors: Kuo-Liang Chung, Jyun-Pin Wang, Ming-Shao Cheng, Yong-Huai Huang
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Based on the self---organization of Kohonen feature map (SOFM), recently, Pei et al. presented an efficient color palette indexing method to construct a color table for compression. Taking their palette indexing method as a representative, this paper presents two new strategies, the pruning---based search strategy and the lookup table (LUT)---based update strategy, to speed up the learning process in the SOFM. Based on four typical testing images, experimental results demonstrate that our proposed two strategies have 35% execution---time improvement ratio in average. In fact, our proposed two strategies could be used to speed up the other SOFM---based learning processes in different applications.
A Method of Eye Location Based on Image Complexity
Authors: Zhu Xiajun
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Eye location in face recognition is widely used in machine vision. On the basis of the characteristic that the changes of the human eye grey scale are very obvious, the present article brings forward a new algorithm of eye location in face recognition. Firstly, we divide the searched area of eyes into small patches, and calculate the degree of image complexity of each small patch; then find the 16 patches with largest image complexity; lastly, locate eyes accurately according to the structural centralization degree of image patches. Compared with other methods, this algorithm has characteristics of accurate location and high arithmetic speed.
IMT: a mixed-initiative data mapping and search toolkit
Authors: Michael Zang, Adam Gray, Joe Kriege, Kalyan Moy Gupta, David W. Aha
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Interoperability requires the resolution of syntactic and semantic variations among system data models. To address this problem, we developed the Intelligent Mapping Toolkit (IMT), which employs a distributed multi-agent architecture to enable the mixed-initiative mapping of metadata and instances. This architecture includes a novel federation of service-encapsulated matching agents that leverage case-based reasoning methods. We recently used the IMT matching service to develop several domain-specific search applications in addition to the IMT mapping application.
Study on Organization and Capacity of Waiting-Area for Through Vehicles at Signalized Intersection
Authors: Ming Yang, Xiaoming He, Jie Li, Rong Lu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Abstract— In order to improve the capacity of the at-grade intersections, at home and abroad many scholars has taken many effective measures to resolve it. The waiting-area for left-turn vehicles has been settled in many cities, the spare area of the intersection isn’t made good use to increase the capacity of the intersection. This paper did some work on the traffic organization and capacity of waiting-area for through vehicles and the second stop-line, at the same time gives the ways of Capacity calculation. Both the theory study and practice have proved that the settlement of waiting-area for through vehicles can improve the capacity of the signalized intersections greatly, and ensure the pedestrian’s safety when they come cross the intersection, So it will have a good prospect of application and extension.
Spatial Combination Interpolation Model Based on Panel Data and Its Empirical Study
Authors: Jiansheng Gan
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

To discuss the spatial interpolation based on panel data with spatial autocorrelation, the first-order spatial autoregressive interpolation model and the Kriging algorithm interpolation model are established from the perspective of the cross-sectional data. Genetic algorithm back-propagation neural network interpolation model is established from the perspective of the time-series data. A spatial combination interpolation model is established by the results of these models. The weights of the combination model is calculated by a new method of spatial drift. An empirical study is carried out with interpolation some areas’ GDP per capita in Fujian 2007, China. The result shows that the most effective one is the spatial combination interpolation model.
Max-ASP: Maximum Satisfiability of Answer Set Programs
Authors: Emilia Oikarinen, Matti Järvisalo
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

This paper studies answer set programming (ASP) in the generalized context of soft constraints and optimization criteria. In analogy to the well-known Max-SAT problem of maximum satisfiability of propositional formulas, we introduce the problems of unweighted and weighted Max-ASP. Given a normal logic program P, in Max-ASP the goal is to find so called optimal Max-ASP models, which minimize the total cost of unsatisfied rules in P and are at the same time answer sets for the set of satisfied rules in P. Inference rules for Max-ASP are developed, resulting in a complete branch-and-bound algorithm for finding optimal models for weighted Max-ASP instances. Differences between the Max-ASP problem and earlier proposed related concepts in the context of ASP are also discussed. Furthermore, translations between Max-ASP and Max-SAT are studied.
Fast annotation and modeling with a single-point laser range finder
Authors: Jason Wither, Chris Coffin, Jonathan Ventura, Tobias Hollerer
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

This paper presents methodology for integrating a small, single-point laser range finder into a wearable augmented reality system. We first present a way of creating object-aligned annotations with very little user effort. Second, we describe techniques to segment and pop-up foreground objects. Finally, we introduce a method using the laser range finder to incrementally build 3D panoramas from a fixed observer’s location. To build a 3D panorama semi-automatically, we track the system’s orientation and use the sparse range data acquired as the user looks around in conjunction with real-time image processing to construct geometry around the user’s position. Using full 3D panoramic geometry, it is possible for new virtual objects to be placed in the scene with proper lighting and occlusion by real world objects, which increases the expressivity of the AR experience.
Nodal discontinuous Galerkin methods on graphics processors
Authors: A. Klöckner, T. Warburton, J. Bridge, J. S. Hesthaven
Venue: Journal of Computational Physics (2009)

Discontinuous Galerkin (DG) methods for the numerical solution of partial differential equations have enjoyed considerable success because they are both flexible and robust: They allow arbitrary unstructured geometries and easy control of accuracy without compromising simulation stability. Lately, another property of DG has been growing in importance: The majority of a DG operator is applied in an element-local way, with weak penalty-based element-to-element coupling. The resulting locality in memory access is one of the factors that enables DG to run on off-the-shelf, massively parallel graphics processors (GPUs). In addition, DG's high-order nature lets it require fewer data points per represented wavelength and hence fewer memory accesses, in exchange for higher arithmetic intensity. Both of these factors work significantly in favor of a GPU implementation of DG. Using a single US$400 Nvidia GTX 280 GPU, we accelerate a solver for Maxwell's equations on a general 3D unstructured grid by a factor of around 50 relative to a serial computation on a current-generation CPU. In many cases, our algorithms exhibit full use of the device's available memory bandwidth. Example computations achieve and surpass 200gigaflops/s of net application-level floating point work. In this article, we describe and derive the techniques used to reach this level of performance. In addition, we present comprehensive data on the accuracy and runtime behavior of the method.
Is Hillary Rodham Clinton the president?: disambiguating names across documents
Authors: Yael Ravin, Zunaid Kazi
Venue: Proceedings of the Workshop on Coreference and its Applications (1999)

A number of research and software development groups have developed name identification technology, but few have addressed the issue of cross-document coreference, or identifying the same named entities across documents. In a collection of documents, where there are multiple discourse contexts, there exists a many-to-many correspondence between names and entities, making it a challenge to automatically map them correctly. Recently, Bagga and Baldwin proposed a method for determining whether two names refer to the same entity by measuring the similarity between the document contexts in which they appear. Inspired by their approach, we have revisited our current cross-document coreference heuristics that make relatively simple decisions based on matching strings and entity types. We have devised an improved and promising algorithm, which we discuss in this paper.
The valve location problem: Minimizing environmental damage of a spill in long oil pipelines
Authors: Alexander Grigoriev, Nadejda V. Grigorieva
Venue: Computers and Industrial Engineering (2009)

A shutoff valve is a control device that blocks oil flow in a pipeline in order to reduce the oil escape. This paper addresses the valve location problem where, given a pipeline network and a number of valves for installation, the task is to find a valve location that minimizes the maximum environmental damage of an oil spill. We present the first complete framework for fast computing of an optimal valve location in a general oil pipeline network. To achieve this, we formalize the problem and explain how to quantify environmental damages. Next, we present two fast algorithms optimally solving the valve location problem on linear pipeline segments. Further, we show how to extend the algorithms to solve the problem on a general pipeline network. We conclude with a computational study showing that solutions provided by our framework can reduce the adverse effects of a spill by up to 37% compared to the currently used solutions.