ppxscal/embedding_network huggingface dataset:
An Argument-Based Approach to Using Multiple Ontologies
Authors: Elizabeth Black, Anthony Hunter, Jeff Z. Pan
Venue: Proceedings of the 3rd International Conference on Scalable Uncertainty Management (2009)

Logic-based argumentation offers an approach to querying and revising multiple ontologies that are inconsistent or incoherent. A common assumption for logic-based argumentation is that an argument is a pair ¿¿,¿¿ where ¿ is a minimal subset of the knowledgebase such that ¿ is consistent and ¿ entails the claim ¿. Using dialogue games, agents (each with its own ontology) can exchange arguments and counterarguments concerning formulae of interest. In this paper, we present a novel framework for logic-based argumentation with ontological knowledge. As far as we know, this is the first proposal for argumentation with multiple ontologies via dialogues. It allows two agents to discuss the answer to queries concerning their knowledge (even if it is inconsistent) without one agent having to copy all of their ontology to the other, and without the other agent having to expend time and effort merging that ontology with theirs. Furthermore, it offers the potential for the agents to incrementally improve their knowledge based on the dialogue by checking how it differs from the other agent's.
SenSearch: GPS and Witness Assisted Tracking for Delay Tolerant Sensor Networks
Authors: Lun Jiang, Jyh-How Huang, Ankur Kamthe, Tao Liu, Ian Freeman, John Ledbetter, Shivakant Mishra, Richard Han, Alberto Cerpa
Venue: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks (2009)

This paper describes the design, implementation and performance evaluation of SenSearch, an outdoors, GPS assisted personnel tracking system using MICA motes. SenSearch is a mobile wireless ad-hoc network comprised of sensor nodes worn by users. These nodes store and forward information about the location of other nodes in an environment that lacks communication infrastructure. A key feature of SenSearch is that it does not require a continuously connected network for its operation. It is designed for a delay tolerant network that provides only occasional connectivity between nodes. It uses the distributed storage available through multiple nodes and the mobility provided by users to propagate the history of nodes' GPS locations to the processing center. The main contribution of this paper is an extensive, experimental evaluation of the system under controlled as well as uncontrolled environments. The paper discusses in detail the effects of a number of experimental parameters on the performance of the system.
An Improved Multi-Objective Adaptive Genetic Algorithm Based on Pareto Front
Authors: Jingjun Zhang, Yanmin Shang, Ruizhen Gao, Yuzhen Dong
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

For multi-objective optimization problems, an improved multi-objective adaptive genetic algorithm based on Pareto Front is proposed in this paper. In this Algorithm, the non-dominated-set is constructed by the method of exclusion.The evolution population adopts the adaptive-crossover and adaptive-mutation probability, which can adjust the search scope according to solution quality. The experimental results show that this algorithm convergent faster and is able to achieve a broader distribution of the Pareto optimal solution.
Denoising of Digital Radiographic Images with Automatic Regularization Based on Total Variation
Authors: Mirko Lucchese, N. Alberto Borghese
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

We report here a principled method for setting the regularization parameter in total variation filtering, that is based on the analysis of the distribution of the gray levels on the noisy image. We also report the results of an experimental investigation of the application of this framework to very low photon count digital radiography that shows the effectiveness of the method in denoising such images. Total variation regularization leads to a non-linear optimization problem that is solved here with a new generation adaptive first order method. Results suggest a further investigation of both the convergence criteria and/or the scheduling of the optimization parameters of this method.
Detection of Ambiguous Patterns Using SVMs: Application to Handwritten Numeral Recognition
Authors: Leticia Seijas, Enrique Segura
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

This work presents a pattern recognition system that is able to detect ambiguous patterns and explain its answers. The system consists of a set of parallel Support Vector Machine (SVM) classifiers, each one dedicated to a representative feature extracted from the input, followed by an analysing module based on a bayesian strategy in charge of defining the system answer. We apply the system to the recognition of handwritten numerals. Experiments were carried out on the MNIST database, which is generally accepted as one of the standards in most of the literature in the field.
Design of Power Quality Monitoring System Based on LabVIEW
Authors: Qiu Tang, Zhaosheng Teng, Siyu Guo, Yaonan Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

A multifunctional vitual power quality monitoring system is designed and implemented in LabVIEW environment. S-transform is introduced and applied to perform time-frequency analysis on power quality disturbances. The root mean square(RMS) value, the waveforms of three-phase voltage and current, the harmonic components, the total harmonic distortion(THD) and S-transform analysis waveforms of the three-phase voltage and current signals can be calculated and displayed in the system. Furthermore, the remote transfer of measured results is implemented using the AppletVIEW Toolkit in LabVIEW adopting a B/S framework. Measurement results show the feasibility and validity of the system.
Reliability Demonstration Testing Procedure for Weibull Distribution about Zero Failure-Data
Authors: Yang Xingqiong, Wan Lin
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

In this thesis, When the parameters are unknown. in the posterior risk criteria, two Bayesian methods are applied to the reliability demonstration testing procedure for Weibull distribution about zero failure-data. First the noninformative prior distribution of the parameters is derived. Then the prior probability density function of reliability function is given combining with prior information according to Bayesian theorem, assuming the certain reliability index being a fixed figure, the the reliability demonstration testing procedure about the zero failure-data of Weibull distribution is given. The second using a series of function substitution, and the Jeffreys principle, the posterior edge density function of reliability function is given, the reliability demonstration testing procedure for Weibull distribution about zero failure-data is given. The reliability demonstration testing procedure is analyzed taking into consideration the consumer's and producer's profit. Concrete steps of the reliability demonstration testing procedure Compare the two methods, The first method can not full consideration the of producers, the second method is more useful.
Fast Way-Prediction Instruction Cache for Energy Efficiency and High Performance
Authors: Cuiping Xu, Ge Zhang, Shouqing Hao
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

This paper introduces a new way-prediction scheme for achieving low energy consumption and high performance for set-associative instruction cache. The proposed scheme is based on the different cases of how program execution proceeds. By predicting for the sequential instruction flow and non-sequential one respectively, we can achieve a high way prediction hit rate. Since way-prediction doesn’t increase the cache access time, we call it Fast way-prediction cache (FWPC).Then we implement FWPC for instruction cache on GS232 processor. The experimental results came from FPGA shows that it has very high way prediction hit rate, which is 97.932% on average. The energy dissipation of instruction cache is reduced by 64.83% compared to conventional cache at the cost of 0.2% performance penalty, in which the way prediction miss only cost 0.38% power.
Current Practice, Problems and Factors in COSD Application - A Component Users Perspective
Authors: Hazleen Aris, Faridah Hani Mohamed Salleh, Zailani Ibrahim, Siti Salwah Salim
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Motivated by the absence of information on the status of component-oriented software development (COSD) application in Malaysia, a study was carried out to investigate the current state of COSD application amongst the software developers. The required information was obtained from the questionnaires distributed to the software developers working at various software development companies in Malaysia. The software developers are broadly categorised into component users and non-component users, where the former use components in their software development and the latter do not. In this paper, information on the component users' practice and the problems that they face in applying COSD is presented. Factors affecting the application of COSD are also included. Information on the current practice shows that the prospect of component users to continue using COSD is high and the room for improvement is wide. Therefore, a list of possible research areas were identified from the problems and factors gathered. The list of research areas, which is arranged in the order of influence, can serve as a basis for researchers to determine a COSD research area to be pursued.
Answer credibility: a language modeling approach to answer validation
Authors: Protima Banerjee, Hyoil Han
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

Answer Validation is a topic of significant interest within the Question Answering community. In this paper, we propose the use of language modeling methodologies for Answer Validation, using corpus-based methods that do not require the use of external sources. Specifically, we propose a model for Answer Credibility which quantifies the reliability of a source document that contains a candidate answer and the Question's Context Model.
The Generalized Product Neuron Model in Complex Domain
Authors: B. K. Tripathi, B. Chandra, P. K. Kalra
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

This paper proposes a complex valued generalized product neuron (GPN) which tries to incorporate polynomial structure in the aggregation of inputs. The advantage of using this model is to bring in the non-linearity in aggregation function by taking a product of linear terms in each dimension of the input space. This aggregation function has the ability to capture higher-order correlations in the input data. Such neurons are capable of learning any problem irrespective of whether the multi dimensional data is linearly separable or not which resembles higher order neurons. But these neurons do not have combinatorial increase of the number of weights in the dimensions of inputs as higher order neurons. The learning and generalization capabilities of proposed neuron are demonstrated through variety of problems. It has been shown that some benchmark problems can be solved with single GPN only without hidden layer.
Personalizing the Shared Mobile Phone
Authors: Nimmi Rangaswamy, Supriya Singh
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

Sharing mobile phones, an enduring practice in developing nations, finds insufficient empirical effort or theoretical scrutiny as a sociological phenomena. Predominant conceptions of design for a mobile phone are aimed at independent and private behaviour as the device is perceived and designed to be a private object for personal use. In this paper we draw attention to the need for designing personalized spaces within the shared or familial culture around the mobile phone. We report on a qualitative case-study of shared mobile phones in low-middle income families in Mumbai city and Dharamshala, reframing personal communication devices as shared objects.
Mathematical Modeling of Wave Phenomena: 3rd Conference on Mathematical Modeling of Wave Phenomena, 20th Nordic Conference on Radio Science and Communications, 1st edition
Authors: Borje E. Nilsson, Louis Fishman, Anders Karlsson, Sven Nordebo
Venue:  (2009)

This conference illuminates and benefits from relations between different types of waves, i.e., quantum physics methods in classical wave modeling. The proceedings are intended for researchers and graduate students in fundamental as well as applied sciences. The preface classifies and summarizes the conference, giving relations between the papers.
Process Mining of RFID-Based Supply Chains
Authors: Kerstin Gerke, Alexander Claus, Jan Mendling
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

Process mining facilitates the analysis of business processes by extracting a process model from event logs. Most mining algorithms perform well on single-system event logs that explicitly refer to a process instance or case. However, in many operational environments such case identifiers are not directly recorded. In supply chain processes there are even further challenges, since different identification numbers and numerous aggregation steps prevent individual work items to become traceable as a case. In this paper, we investigate how the EPCglobal standard for processing Radio Frequency Identification (RFID) events can make supply chain data accessible for process mining. Our contribution is an algorithm that is able to deal with challenges of case identification and focus shifts. We present a prototypicalimplementation and use a process based on the Supply Chain Operations Reference (SCOR) Model to evaluate our implementation.
Poster abstract: A distributed algorithm to compute spatial skyline in wireless sensor networks
Authors: SunHee Yoon, Cyrus Shahabi
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

Spatial skyline queries can be used in wireless sensor networks for collaborative positioning of multiple objects. However, designing a distributed spatial skyline algorithm in resource constrained wireless environments introduces several research challenges: how to combine multi-dimensional data, (e.g. distances to multiple events) to compute the skylines efficiently, accurately, quickly, progressively, and concurrently while dealing with the network and event dynamics. We address this challenge by designing Distributed Spatial Skyline (DSS) algorithm. DSS is the first distributed algorithm to compute spatial skylines. In a network of 554 nodes, DSS reduces the communication overhead by up to 91% over a centralized algorithm with 100% accuracy.
Color Harmony Based on Fitting Functions
Authors: Mengshu Sun, Qingjie Sun, Xiaoyun Xu
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Color harmony for digital image is an interesting research topic. In this paper, we present a novel algorithm for color harmony based on fitting functions. In order to specify the standard and the style of color harmony, a reference image and its corresponding painting made by an artist should be given, and we will derive two fitting functions from them. When the user inputs a digital image, we apply the fitting functions to it to get a new harmonized image with the specified art style. The Experiments show that our algorithm can generate new images with good color harmony.
A REST protocol and composite format for interactive web documents
Authors: John M. Boyer, Charles F. Wiecha, Rahul P. Akolkar
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

Documents allow end-users to encapsulate information related to a collaborative business process into a package that can be saved, emailed, digitally signed, and used as the basis of interaction in an activity or an ad hoc workflow. While documents are used incidentally today in web applications, for example in HTML presentations of content stored otherwise in back-end systems, they are not yet the central artifact for developers of dynamic, data intensive web applications. This paper unifies the storage and management of the various artifacts of web applications into an Interactive Web Document (IWD). Data content, presentation, behavior, attachments, and digital signatures collected throughout the business process are unified into a single composite web resource. We describe a REST-based protocol for interacting with IWDs and a standards-based approach to packaging their multiple constituent artifacts into IWD archives based on the Open Document Format standard.
Active learning for pipeline models
Authors: Dan Roth, Kevin Small
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

For many machine learning solutions to complex applications, there are significant performance advantages to decomposing the overall task into several simpler sequential stages, commonly referred to as a pipeline model. Typically, such scenarios are also characterized by high sample complexity, motivating the study of active learning for these situations. While most active learning research examines single predictions, we extend such work to applications which utilize pipelined predictions. Specifically, we present an adaptive strategy for combining local active learning strategies into one that minimizes the annotation requirements for the overall task. Empirical results for a three-stage entity and relation extraction system demonstrate a significant reduction in supervised data requirements when using the proposed method.
Interleaved depth-first search
Authors: Pedro Meseguer
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before good ones (with goals in their subtrees), DFS has to unsuccessfully traverse the whole bad subtree before finding a goal. To prevent this useless work, we present a new strategy called interleaved depthfirst search (IDFS), which searches depth-first several subtrees -- called active -- in parallel. IDFS assumes a single processor on which it interleaves DFS on active subtrees. When IDFS finds a mistake, it traverses partially the bad subtree. IDFS does not reexpand nodes and uses a memory amount linear in search depth (with a bounded number of active subtrees). IDFS outperforms DFS if the heuristic improves from the first to the second tree level. Experimental results on hard solvable problems confirm the practical validity of IDFS.
Research on Particle Swarm Optimization for Grain Logistics Vehicle Routing Problem
Authors: Qifeng Zhang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Based on traditional vehicle routing problem, grain logistics vehicle routing problem with time windows and the characteristics of grain logistics are fully considered in this paper. A model for grain logistics VRPTM was established, where the aim is to complete the maximum tasks with minimum cost. A PSO algorithm is proposed to solve the grain logistics VRPTW, the comparative experiments were made between PSO and basic GA algorithm, and experimental results manifest that the proposed method is effective and can find optimal solution quickly.
A Tool for Analyzing Categorical Data Visually with Granular Representation
Authors: Kousuke Shiraishi, Kazuo Misue, Jiro Tanaka
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)

Categorical data appears in various places, and dealing with it has been a major concern in analysis fields. However, representing not only global trends but also local trends of data simultaneously by conventional techniques is difficult. We propose a visualization method called "granular representation" for analyzing categorical data visually. Our approach visually represents data as a set of objects and allows intuitive analysis instead of the traditional way with tables of numbers. We developed a tool by integrating granular representation and bar charts. The effectiveness of the tool is demonstrated using real data about media consumption.