ppxscal/embedding_network huggingface dataset:
Belief Merging-Based Case Combination
Authors: Julien Cojan, Jean Lieber
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

Integrity constraint belief merging aims at producing from several knowledge bases, that may be mutually inconsistent, a synthetic knowledge base satisfying a given integrity constraint. It is applied here to case combination for case-based reasoning. This approach is shown to extend Eyke Hüllermeier's credible case-based inference and to be reducible under some assumptions to linear programming.
An Augmented Reality museum guide
Authors: T. Miyashita, P. Meier, T. Tachikawa, S. Orlic, T. Eble, V. Scholz, A. Gapel, O. Gerl, S. Arnaudov, S. Lieberknecht
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

Recent years have seen advances in many enabling Augmented Reality technologies. Furthermore, much research has been carried out on how Augmented Reality can be used to enhance existing applications. This paper describes our experiences with an AR-museum guide that combines some of the latest technologies. Amongst other technologies, markerless tracking, hybrid tracking, and an Ultra-Mobile-PC were used. Like existing audio guides, the AR-guide can be used by any museum visitor, during a six-month exhibition on Islamic art. We provide a detailed description of the museum’s motivation for using AR, of our experiences in developing the system, and the initial results of user surveys. Taking this information into account, we can derive possible system improvements.
From Plain Prolog to Logtalk Objects: Effective Code Encapsulation and Reuse
Authors: Paulo Moura
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

Prolog affords concise, elegant, and clean solutions for many interesting problems, but is not immune to the software engineering challenges of large-scale application development. Code modularization, using modules or objects, is a key feature to keep projects manageable. Since most literature, instruction, and practice focus exclusively on object-oriented languages derived from imperative languages, objects are perceived as alien to logic programming while modules are considered a natural fit. Logtalk is an object-oriented logic programming language that can use most Prolog implementations as a back-end compiler. Logtalk objects are about code encapsulation and reuse, providing an alternative to Prolog module systems, and enabling natural solutions for a wide range of problems that would be awkward to solve using modules. This talk presents the Logtalk design goals, followed by a tutorial on Logtalk programming and some application examples. The talk ends with a discussion on the problems and benefits of developing Logtalk as a portable Prolog application.
Evaluating patents using damage awards of infringement lawsuits: A case study
Authors: Yi-Hsuan Lai, Hui-Chung Che
Venue: Journal of Engineering and Technology Management (2009)

As the era of knowledge economics rose, the patent became one kind of knowledge outcome. This study aimed at the basis of the patent law and proposed an integrated evaluator for patent management. The damage award of a patent infringement lawsuit was deemed to be the legal value of the patent. 65 effective samples were extracted from 4289 patent infringement lawsuits retrieved from the U.S. district courts. 17 indicators were summarized to quantitatively describe the dimensions of the patents. Back-Propagation Neural Network was applied to build the patent valuation model, wherein the 17 indicators were the inputs and the damage award was the output. The patent valuation model was validated to be feasible by error analysis. The integrated evaluator for patents was then established by transforming the output of the patent valuation model via the Z-score. The proposed integrated evaluator accommodated to the patent management effectively.
An Interactive-Content Technique Based Approach to Generating Personalized Advertisement for Privacy Protection
Authors: Wook-Hee Min, Yun-Gyung Cheong
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)

Personalized contents have been getting more attention from industry and academia due to its effective communicative role in product advertisements. However, there exist potential threats to the customer's privacy in conventional approaches where a data server containing customer profiles is employed or the customer profiles is required to be sent over the public network. To address this, this paper describes a framework that employs a script-based interactive content technique for privacy protection. We illustrate our approach by a sample scenario.
Accelerating sequence searching: dimensionality reduction method
Authors: Guojie Song, Bin Cui, Baihua Zheng, Kunqing Xie, Dongqing Yang
Venue: Knowledge and Information Systems (2009)

Similarity search over long sequence dataset becomes increasingly popular in many emerging applications, such as text retrieval, genetic sequences exploring, etc. In this paper, a novel index structure, namely Sequence Embedding Multiset tree (SEM&#x00a0;&#x2212;&#x00a0;tree), has been proposed to speed up the searching process over long sequences. The SEM-tree is a multi-level structure where each level represents the sequence data with different compression level of multiset, and the length of multiset increases towards the leaf level which contains original sequences. The multisets, obtained using sequence embedding algorithms, have the desirable property that they do not need to keep the character order in the sequence, i.e. shorter representation, but can reserve the majority of distance information of sequences. Each level of the tree serves to prune the search space more efficiently as the multisets utilize the predicability to finish the searching process beforehand and reduce the computational cost greatly. A set of comprehensive experiments are conducted to evaluate the performance of the SEM-tree, and the experimental results show that the proposed method is much more efficient than existing representative methods.
Auditory and Visual Guidance for Reducing Cognitive Load
Authors: Hiroko Akatsu, Akinori Komatsubara
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Auditory and visual guidance are often used as means to make IT equipment easier to use and decrease cognitive load. However, the effective use of the guidance is not yet clarified. Accordingly, there is a case that the guidance disturbs user operation because of inappropriate use of guidance. This paper discusses the effective use of auditory and visual guidance to reduce user's cognitive loads through experiments with simulated ATM systems.
Adapting a Virtual Agent to Users' Vocabulary and Needs
Authors: Ana Cristina Mendes, Rui Prada, Luísa Coheur
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Duarte Digital is an agent that engages in inquiry-oriented conversations about an art artifact. Since it was build for a Museum, interactions are supposed to be directed to different types of audience: an interaction with an art expert should be carried out in a different way than an interaction with a child; likewise, interactions with users interested in learning should be distinct from interactions with users having only entertainment goals. Being so, an agent needs to undergo two tasks: it must understand the user's knowledge about the topic, and his/her learning goals; it should adapt its vocabulary and dialogue strategy to cope with the user's characteristics and expectations.This paper presents a simple and straighforward model of interaction that allows a virtual agent to understand its interlocutors based on their vocabulary and to adapt to their expertise and needs.
An evaluation of graphical context when the graphics are outside of the task area
Authors: Cindy M. Robertson, Blair MacIntyre, Bruce N. Walker
Venue: Proceedings of the 7th IEEE/ACM International Symposium on Mixed and Augmented Reality (2008)

An ongoing research problem in Augmented Reality (AR) is to improve tracking and display technology in order to minimize registration errors. However, perfect registration is not always necessary for users to understand the intent of an augmentation. This paper describes the results of an experiment to evaluate the effects of graphical context in a Lego block placement task when the graphics are located outside of the task area. Four conditions were compared: fully registered AR; non-registered AR; a head-sup display (HUD) with the graphics always visible in the field of view; and a HUD with the graphics not always visible in the field of view. The results of this experiment indicated that registered AR outperforms both non-registered AR and graphics displayed on a HUD. The results also indicated that non-registered AR does not offer any significant performance advantages over a HUD, but is rated as less intrusive and can keep non-registered graphics from cluttering the task space.
A niching genetic k-means algorithm and its applications to gene expression data
Authors: Weiguo Sheng, Allan Tucker, Xiaohui Liu
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

Partitional clustering is a common approach to cluster analysis. Although many algorithms have been proposed, partitional clustering remains a challenging problem with respect to the reliability and efficiency of recovering high quality solutions in terms of its criterion functions. In this paper, we propose a niching genetic k-means algorithm (NGKA) for partitional clustering, which aims at reliably and efficiently identifying high quality solutions in terms of the sum of squared errors criterion. Within the NGKA, we design a niching method, which encourages mating among similar clustering solutions while allowing for some competitions among dissimilar solutions, and integrate it into a genetic algorithm to prevent premature convergence during the evolutionary clustering search. Further, we incorporate one step of k-means operation into the regeneration steps of the resulted niching genetic algorithm to improve its computational efficiency. The proposed algorithm was applied to cluster both simulated data and gene expression data and compared with previous work. Experimental results clear show that the NGKA is an effective clustering algorithm and outperforms two other genetic algorithm based clustering methods implemented for comparison.
Generalized bang-bang control for feedforward constrained regulation
Authors: Luca Consolini, Aurelio Piazzi
Venue: Automatica (Journal of IFAC) (2009)

In the behavioral framework for continuous-time linear scalar systems, simple sufficient conditions for the solution of the minimum-time rest-to-rest feedforward constrained control problem are provided. The investigation of the time-optimal input-output pair reveals that the input or the output saturates on the assigned constraints at all times except for a set of zero measure. The resulting optimal input is composed of sequences of bang-bang functions and linear combinations of the modes associated to the zero dynamics. This signal behavior constitutes a generalized bang-bang control that can be fruitfully exploited for feedforward constrained regulation. Using discretization, an arbitrarily good approximation of the optimal generalized bang-bang control is found by solving a sequence of linear programming problems. Numerical examples are included.
Metabolic Network Expansion with Answer Set Programming
Authors: Torsten Schaub, Sven Thiele
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

We propose a qualitative approach to elaborating the biosynthetic capacities of metabolic networks. In fact, large-scale metabolic networks as well as measured datasets suffer from substantial incompleteness. Moreover, traditional formal approaches to biosynthesis require kinetic information, which is rarely available. Our approach builds upon a formal method for analyzing large-scale metabolic networks. Mapping its principles into Answer Set Programming (ASP) allows us to address various biologically relevant problems. In particular, our approach benefits from the intrinsic incompleteness-tolerating capacities of ASP. Our approach is endorsed by recent complexity results, showing that the reconstruction of metabolic networks and related problems are NP-hard.
Supporting manual mapping revision using logical reasoning
Authors: Christian Meilicke, Heiner Stuckenschmidt, Andrei Tamilin
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Finding correct semantic correspondences between ontologies is one of the most challenging problems in the area of semantic web technologies. Experiences with benchmarking matching systems revealed that even the manual revision of automatically generated mappings is a very difficult problem because it has to take the semantics of the ontologies as well as interactions between correspondences into account. In this paper, we propose methods for supporting human experts in the task of reviSing automatically created mappings. In particular, we present non-standard reasoning methods for detecting and propagating implications of expert decisions on the correctness of a mapping. We show that the use of these reasoning methods significantly reduces the effort of mapping revision in terms of the number of decisions that have to be made by the expert.
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6
Authors: Vadim E. Levit, David Tankus
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NPC. The complexity status of the problem is not known if the input is restricted to graphs with no cycles of length 4. We conjecture that the problem is polynomial if the input graph does not contain cycles of length 4 and 6, and prove several theorems supporting our conjecture.
Features Need Stories
Authors: Sidney C. Bailin
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

We present an extension of the notion of feature models. An ontology of stories clarifies the meaning of potentially ambiguous features in situations where there is no unified domain model, and where candidates for reuse have varied provenance.
A Clustering Based Method for Edge Detection in Hyperspectral Images
Authors: V. C. Dinh, Raimund Leitner, Pavel Paclik, Robert P. Duin
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

Edge detection in hyperspectral images is an intrinsically difficult problem as the gray value intensity images related to single spectral bands may show different edges. The few existing approaches are either based on a straight forward combining of these individual edge images, or on finding the outliers in a region segmentation. As an alternative, we propose a clustering of all image pixels in a feature space constructed by the spatial gradients in the spectral bands. An initial comparative study shows the differences and properties of these approaches and makes clear that the proposal has interesting properties that should be studied further.
Designing a Metamodel-Based Recommender System
Authors: Sven Radde, Bettina Zach, Burkhard Freitag
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

Current recommender systems have to cope with a certain reservation because they are considered to be hard to maintain and to give rather schematic advice. This paper presents an approach to increase maintainability by generating essential parts of the recommender system based on thorough metamodeling. Moreover, preferences are elicited on the basis of user needs rather than product features thus leading to a more user-oriented behavior. The metamodel-based design allows to efficiently adapt all domain-dependent parts of the system.
Authenticating ubiquitous services: a study of wireless hotspot access
Authors: Tim Kindberg, Chris Bevan, Eamonn O'Neill, James Mitchell, Jim Grimmett, Dawn Woodgate
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

This paper concerns the problem of phishing attacks in ubiquitous computing environments. The embedding of ubiquitous services into our everyday environments may make fake services seem plausible but it also enables us to authenticate them with respect to those environments. We propose physical and virtual linkage as two types of authenticating evidence in ubiquitous environments and two protocols based on them. We describe an experiment to test hypotheses concerning user responses to physical and virtual linkage with respect to fake Wi-Fi hotspots. Based on our experience we derive an improved protocol for authenticating spontaneously accessed ubiquitous services.
An Intelligent Model for Vulnerability Analysis Using Attack Graph
Authors: Wang Yi, Xiao Jinghua
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Constructing attack graph is an important approach to analyze vulnerabilities. Although automated generating attack graph have been proposed to discover the possible attack graphs efficiently, they still require manual effort and expert knowledge to describe the attack templates before the computerized model checking procedure can be performed. Moreover, without considering the configuration changes and attackers' goals in large complicated network, many attack graphs generated may be impractical in real attack. In this paper, we proposed an intelligent model for vulnerability analysis, taking into account of the attackers' goals and configuration information, which automatically generates attack graphs by defining a series of prolog facts and rules.
Research on Microwave Measurement for Grain Moisture Content in Granary
Authors: Yuying Jiang, Yuan Zhang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

A new method of grain moisture content measurement in granary is developed; it is based on the measuring principle and characteristics of microwave moisture content determination techniques. According to the relationship between the power attenuation, signal parameter variation and moisture content of grain when the microwave penetrates the grain, a model of grain moisture content measuring was established. Experiments are made to compare with the traditional method on solving this problem. The results show that this method can measure the grain moisture content quickly and efficiently, and satisfy the requirement of grain moisture content determination in granary.
Delegation in Global Software Teams: Leading or Managing?
Authors: Suling Zhang, Marilyn Tremaine, Allen E. Milewski, Felix Kobler
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Global teams are an important work structure in software development projects. However, little is known about how to handle the conflicting roles a global software team manager should play when delegating. This study investigated delegation practices in global software teams. It was found that global software team managers delegate more like a manager than a leader by delegating primarily to competent remote team members. In this paper, we explore the reasons behind such practices and offer suggestions on how to improve delegation decisions in global software teams.
Entropy-based metrics in swarm clustering
Authors: Bo Liu, Jiuhui Pan, R. I. (Bob) McKay
Venue: International Journal of Intelligent Systems (2009)

Ant-based clustering methods have received significant attention as robust methods for clustering. Most ant-based algorithms use local density as a metric for determining the ants' propensities to pick up or deposit a data item; however, a number of authors in classical clustering methods have pointed out the advantages of entropy-based metrics for clustering. We introduced an entropy metric into an ant-based clustering algorithm and compared it with other closely related algorithms using local density. The results strongly support the value of entropy metrics, obtaining faster and more accurate results. Entropy governs the pickup and drop behaviors, while movement is guided by the density gradient. Entropy measures also require fewer training parameters than density-based clustering. The remaining parameters are subjected to robustness studies, and a detailed analysis is performed. In the second phase of the study, we further investigated Ramos and Abraham's (In: Proc 2003 IEEE Congr Evol Comput, Hoboken, NJ: IEEE Press; 2003. pp 1370&ndash;1375) contention that ant-based methods are particularly suited to incremental clustering. Contrary to expectations, we did not find substantial differences between the efficiencies of incremental and nonincremental approaches to data clustering. &copy; 2009 Wiley Periodicals, Inc.
Towards semantic event processing
Authors: Kia Teymourian, Adrian Paschke
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

The developments and successes of the Semantic Web research community in building standards and tools for semantic technologies such as formalized vocabularies/ontologies and declarative rules are opening novel research and application areas. One of these promising application areas is semantic event processing. Semantic models of events can improve the quality of event processing by using event meta-data in combination with ontologies and rules (knowledge bases).
Complex rational Bézier curves
Authors: J. Sánchez-Reyes
Venue: Computer Aided Geometric Design (2009)

We extend the rational Bezier model for planar curves, by allowing complex weights. The key idea to endow this representation with a geometric meaning is the use of weight points (Farin points), which are no longer constrained to lie on the line segment defined by two successive control points. Instead of a control polygon, we have now the complex quotient of two control polygons, that is, a control curve made up of circular arcs, whose shape is controlled by the weight points. In the complex version of the rational de Casteljau algorithm, ratios become complex magnitudes, and repeated interpolation on lines is substituted by interpolation on circles. Invariance with respect to perspective transformations is replaced with invariance with respect to Mobius transformations. Therefore, not only enjoy these complex curves the customary linear precision, but also circular precision, i.e., if all control points and weight points lie on a circle, then an arc on the circle is reproduced. This complex model furnishes an intrinsically simpler representation for several remarkable curves, whose degree is halved with respect to the customary Bezier form. Circles are linear instead of quadratic, whereas remarkable epitrochoids (including the cardioid), Joukowski profiles and the Lemniscate of Bernoulli, are quadratic instead of quartic.