ppxscal/embedding_network huggingface dataset:
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
Authors: Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

A graph class is sandwich monotone if, for every pair of its graphs G 1 = (V,E 1) and G 2 = (V,E 2) with E 1 ¿ E 2, there is an ordering e 1, ..., e k of the edges in E 2 ¿ E 1 such that G = (V, E 1 ¿ {e 1, ..., e i }) belongs to the class for every i between 1 and k. In this paper we show that strongly chordal graphs and chordal bipartite graphs are sandwich monotone, answering an open question by Bakonyi and Bono from 1997. So far, very few classes have been proved to be sandwich monotone, and the most famous of these are chordal graphs. Sandwich monotonicity of a graph class implies that minimal completions of arbitrary graphs into that class can be recognized and computed in polynomial time. For minimal completions into strongly chordal or chordal bipartite graphs no polynomial-time algorithm has been known. With our results such algorithms follow for both classes. In addition, from our results it follows that all strongly chordal graphs and all chordal bipartite graphs with edge constraints can be listed efficiently.
Robust and secure routing scheme for wireless multihop network
Authors: Binod Vaidya, Sang-Soo Yeo, Dong-You Choi, Seungjo Han
Venue: Personal and Ubiquitous Computing (2009)

Mobile ad hoc network (MANET) is an appealing technology that has attracted lots of research efforts. On-demand routing protocol such as AODV may suffer from frequent topological changes. Due to frequent communication failures, multipath MANET is preferred than single-path MANET in many applications as former is used for achieving robustness and load balancing and improving reliability. Although multipath MANET is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; MANETs are known to be particularly vulnerable to security attack. The paper presents a design of robust and secure framework for multipath MANET. In this paper, we propose not only a robust multipath routing protocol but also an extended security scheme. We discuss security analysis for proposed security scheme. And we also conduct simulation to evaluate such a framework through different performance metrics. Results show that the proposed routing protocol achieves better performance in terms of various metrics than other protocols.
A Better x86 Memory Model: x86-TSO
Authors: Scott Owens, Susmit Sarkar, Peter Sewell
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

Real multiprocessors do not provide the sequentially consistent memory that is assumed by most work on semantics and verification. Instead, they have relaxed memory models, typically described in ambiguous prose, which lead to widespread confusion. These are prime targets for mechanized formalization. In previous work we produced a rigorous x86-CC model, formalizing the Intel and AMD architecture specifications of the time, but those turned out to be unsound with respect to actual hardware, as well as arguably too weak to program above. We discuss these issues and present a new x86-TSO model that suffers from neither problem, formalized in HOL4. We believe it is sound with respect to real processors, reflects better the vendor's intentions, and is also better suited for programming. We give two equivalent definitions of x86-TSO: an intuitive operational model based on local write buffers, and an axiomatic total store ordering model, similar to that of the SPARCv8. Both are adapted to handle x86-specific features. We have implemented the axiomatic model in our memevents tool, which calculates the set of all valid executions of test programs, and, for greater confidence, verify the witnesses of such executions directly, with code extracted from a third, more algorithmic, equivalent version of the definition.
Efficient Parallel Implementation of Evolutionary Algorithms on GPGPU Cards
Authors: Ogier Maitre, Nicolas Lachiche, Philippe Clauss, Laurent Baumes, Avelino Corma, Pierre Collet
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

A parallel solution to the implementation of evolutionary algorithms is proposed, where the most costly part of the whole evolutionary algorithm computations (the population evaluation), is deported to a GPGPU card. Experiments are presented for two benchmark examples on two models of GPGPU cards: first a "toy" problem is used to illustrate some noticable behaviour characteristics before a real problem is tested out. Results show a speed-up of up to 100 times compared to an execution on a standard micro-processor. To our knowledge, this solution is the first showing such an efficiency with GPGPU cards. Finally, the EASEA language and its compiler are also extended to allow users to easily specify and generate efficient parallel implementations of evolutionay algorithms using GPGPU cards.
Modeling impression in probabilistic transliteration into Chinese
Authors: LiLi Xu, Atsushi Fujii, Tetsuya Ishikawa
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

For transliterating foreign words into Chinese, the pronunciation of a source word is spelled out with Kanji characters. Because Kanji comprises ideograms, an individual pronunciation may be represented by more than one character. However, because different Kanji characters convey different meanings and impressions, characters must be selected carefully. In this paper, we propose a transliteration method that models both pronunciation and impression, whereas existing methods do not model impression. Given a source word and impression keywords related to the source word, our method derives possible transliteration candidates and sorts them according to their probability. We evaluate our method experimentally.
Identifying non-referential it: a machine learning approach incorporating linguistically motivated patterns
Authors: Adriane Boyd, Whitney Gegg-Harrison, Donna Byron
Venue: Proceedings of the ACL Workshop on Feature Engineering for Machine Learning in Natural Language Processing (2005)

In this paper, we present a machine learning system for identifying non-referential it. Types of non-referential it are examined to determine relevant linguistic patterns. The patterns are incorporated as features in a machine learning system which performs a binary classification of it as referential or non-referential in a POS-tagged corpus. The selection of relevant, generalized patterns leads to a significant improvement in performance.
Obstacles to Option Setting: Initial Results with a Heuristic Walkthrough Method
Authors: Silvia Gabrielli, Anthony Jameson
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

This short paper is the first step in a line of research that aims to deepen understanding of the difficulties that users often have with option setting interfaces: those parts of a system that allow the user to set parameters that influence the system's behavior and appearance. On the basis of a theoretical distinction of three things that users may fail to understand about a given option, we introduce a simple variant of the heuristic walkthrough method that helps evaluators to uncover likely obstacles. We give a quantitative and qualitative overview of the obstacles found through the application of this heuristic walkthrough to parts of four popular applications.
Classification Theory for Abstract Elementary Classes
Authors: Saharon Shelah
Venue: Studies In Logic Series (2009)

An abstract elementary class is a class of structures of the same vocabulary (like a class of rings, or a class of fields), with a partial order that generalizes the relation "A is a substructure (or an elementary substructure) of B". The requirements are that the class is closed under isomorphism, and that isomorphic structures have isomorphic (generalized) substructures; we also require that our classes share some of the most basic properties of elementary classes, like closure under unions of increasing chains of substructures. We would like to classify this general family; in the sense of proving dichotomies: either we can understand the structure of all models in our class or there are many to some extent. More specifically we would like to generalize the theory about categoricity and superstability to this context. 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
Discriminative training of Markov logic networks
Authors: Parag Singla, Pedro Domingos
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Many machine learning applications require a combination of probability and first-order logic. Markov logic networks (MLNs) accomplish this by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Model parameters (i.e., clause weights) can be learned by maximizing the likelihood of a relational database, but this can be quite costly and lead to suboptimal results for any given prediction task. In this paper we propose a discriminative approach to training MLNs, one which optimizes the conditional likelihood of the query predicates given the evidence ones, rather than the joint likelihood of all predicates. We extend Collins's (2002) voted perceptron algorithm for HMMs to MLNs by replacing the Viterbi algorithm with a weighted satisfiability solver. Experiments on entity resolution and link prediction tasks show the advantages of this approach compared to generative MLN training, as well as compared to purely probabilistic and purely logical approaches.
Improved delay-dependent bounded real lemma for uncertain time-delay systems
Authors: Tao Li, Lei Guo, Xin Xin
Venue: Information Sciences: an International Journal (2009)

This paper concerns reducing the conservatism of delay-dependent bounded real lemma (BRL) of time-delay systems with uncertainty described by a linear fractional form. By introducing an augmented Lyapunov functional, an improved BRL is established in terms of linear matrix inequalities (LMIs). Theoretical comparisons show that the obtained BRL is less conservative than some previous ones and the recent results in [S.Y. Xu, L. James, Y. Zou, New results on delay-dependent robust H"~ control for systems with time-varying delays, Automatica 42 (2006) 343-348; T. Li, L. Guo, C. Lin, Y.M. Zhang, Delay-range-dependent bounded real lemma for time-delay systems, Asian Journal of Control 10 (2008) 708-717] are actually equivalent to the special cases of the obtained BRL. Numerical examples are also given to demonstrate the effectiveness of the proposed result.
Automatic computation of pebble roundness using digital imagery and discrete geometry
Authors: Tristan Roussillon, Hervé Piégay, Isabelle Sivignon, Laure Tougne, Franck Lavigne
Venue: Computers Geosciences (2009)

The shape of sedimentary particles is an important property, from which geographical hypotheses related to abrasion, distance of transport, river behavior, etc. can be formulated. In this paper, we use digital image analysis, especially discrete geometry, to automatically compute some shape parameters such as roundness, i.e. a measure of how much the corners and edges of a particle have been worn away. In contrast to previous work in which traditional digital images analysis techniques, such as Fourier transform, are used, we opted for a discrete geometry approach that allowed us to implement Wadell's original index, which is known to be more accurate, but more time consuming to implement in the field. Our implementation of Wadell's original index is highly correlated (92%) with the roundness classes of Krumbein's chart, used as a ground-truth. In addition, we show that other geometrical parameters, which are easier to compute, can be used to provide good approximations of roundness. We also used our shape parameters to study a set of pebbles digital images taken from the Progo basin river network (Indonesia). The results we obtained are in agreement with previous work and open new possibilities for geomorphologists thanks to automatic computation.
Ubiquitous Society --- Cultural Factors Driving Mobile Innovations and Adoption in Japan
Authors: Henning Breuer
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

Streets without names, golden silence on the subway, cables installed above-ground, experimental drive of developers and nosy customers prepare the ground for ultimate perfection. This article analyzes and describes culturally embedded usability scenarios, research activities and geographical and political frameworks of developing mobile technologies in Japan. Furthermore, decisive factors contributing to the development of a mobile and ubiquitous scociety in Japan are outlined. This aims at raising awareness for new starting-points of mobile innovation in Europe.
An RFID Based System for the Underwater Tracking of Pebbles on Artificial Coarse Beaches
Authors: Giuliano Benelli, Alessandro Pozzebon, Gianluca Raguseo, Duccio Bertoni, Giovanni Sarti
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Coastal erosion represents one of the most significant environmental emergencies, due to the fact that it affects locations distributed all over the world, including tourist sites and urban centers. Several solutions have been studied during the last years, including the use of gravel beaches as shore protections against the effects of waves. These solutions seem to provide a good protection, but efficient studies on the movement of sediments are very difficult to be performed due to the absence of effective technical solutions. In this article we propose the use of RFID automatic identification technology to keep trace of single pebbles shifting on a gravel beach. The tracking operations are made possible in the sea as well as on the beach providing a tool to perform accurate and global studies on the dynamics of artificial coarse beaches for what concerns both its under and outside water sectors.
Direct position determination of cyclostationary signals
Authors: Alit Mendelson Reuven, Anthony J. Weiss
Venue: Signal Processing (2009)

Direct position determination (DPD) was recently proposed as a new method for passive localization of narrowband radio transmitters. Its superior performance, especially in the low signal-to-noise ratio (SNR) regime, is ascribed to both the joint optimization it performs over all base stations that participate in the estimation process and the direct determination of the emitter position as opposed to conventional methods which typically process the information from the individual base stations separately and determine the location using two estimation steps. In this paper, we introduce the cyclic direct position determination (CDPD) algorithm, a novel method which is the cyclostationary counterpart of the DPD. Despite its name, the CDPD is not a simple extension of the DPD but a unique algorithm which deviates substantially from its ancestor. Yet, the CDPD enjoys both the benefits of the DPD algorithm and the great performance robustness in the presence of narrowband interferences thanks to its cyclostationarity exploitation.
Coarse-to-Fine Tracking of Articulated Objects Using a Hierarchical Spring System
Authors: Nicole Artner, Adrian Ion, Walter Kropatsch
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Tracking of articulated objects is a challenging task in Computer Vision. A highly target specific model can improve the robustness of the tracking by eliminating or reducing the ambiguities in the association task. This paper presents a flexible framework, which allows to build target specific, part-based models for arbitrary articulated objects. The rigid parts are described by hierarchical spring systems in form of attributed graph pyramids and connected via articulation points, which transfer position information between the adjacent parts. 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
Drawing Graphs with Right Angle Crossings
Authors: Walter Didimo, Peter Eades, Giuseppe Liotta
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

Cognitive experiments show that humans can read graph drawings in which all edge crossings are at right angles equally well as they can read planar drawings; they also show that the readability of a drawing is heavily affected by the number of bends along the edges. A graph visualization whose edges can only cross perpendicularly is called a RAC (Right Angle Crossing) drawing. This paper initiates the study of combinatorial and algorithmic questions related with the problem of computing RAC drawings with few bends per edge. Namely, we study the interplay between number of bends per edge and total number of edges in RAC drawings. We establish upper and lower bounds on these quantities by considering two classical graph drawing scenarios: The one where the algorithm can choose the combinatorial embedding of the input graph and the one where this embedding is fixed.
Cognitive Chance Discovery
Authors: Akinori Abe
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

Dementia is the progressive decline in cognitive function due to damage or disease in the body beyond what might be expected from normal aging. Dementia persons cannot reasonably live their lives. In order to support dementia persons' lives, various approaches are proposed. Bozeat and Hodges showed affordance might give a certain support to (semantic) dementia persons of understanding (meanings of) objects. In this paper, based on the concept of affordance, abduction, and chance discovery, a dementia care under the concept of affordance is proposed. 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
An iterative agent bidding mechanism for responsive manufacturing
Authors: M. K. Lim, Z. Zhang, W. T. Goh
Venue: Engineering Applications of Artificial Intelligence (2009)

In today's market, the global competition has put manufacturing businesses in great pressures to respond rapidly to dynamic variations in demand patterns across products and changing product mixes. To achieve substantial responsiveness, the manufacturing activities associated with production planning and control must be integrated dynamically, efficiently and cost-effectively. This paper presents an iterative agent bidding mechanism, which performs dynamic integration of process planning and production scheduling to generate optimised process plans and schedules in response to dynamic changes in the market and production environment. The iterative bidding procedure is carried out based on currency-like metrics in which all operations (e.g. machining processes) to be performed are assigned with virtual currency values, and resource agents bid for the operations if the costs incurred for performing them are lower than the currency values. The currency values are adjusted iteratively and resource agents re-bid for the operations based on the new set of currency values until the total production cost is minimised. A simulated annealing optimisation technique is employed to optimise the currency values iteratively. The feasibility of the proposed methodology has been validated using a test case and results obtained have proven the method outperforming non-agent-based methods.
Evolution and evaluation of document retrieval queries
Authors: Robert Steele, David Powers
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

This short paper introduces some ideas for the application of Genetic Programming to the task of producing queries for the accurate retrieval of documents on a particular topic of interest. This application will involve expanding the initial query given by the user, using extra words that have various semantic relationships to the words of the original query via the use of a system such as WordNet, and using Genetic Programming to optimize how this expansion is done. The aim is to produce an optimal general template of expansion, that can be used for any particular query a user may make. The method suggested is one that will be used to produce a search enhancer that can be used with existing search engines.
Towards a Spreadsheet-Based Service Composition Framework
Authors: Dat Dac Hoang, Boualem Benatallah, Hye-Young Paik
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

The spreadsheet is a popular productivity tool. Recently, it has gained attention as a potential service integration environment targeted towards end-users. We discuss four possible ways of implementing web service composition in a spreadsheet environment, highlighting their significance and limitations. We, then, propose our approach which aims to address the need of service composition while maintaining all of the spreadsheet characteristics the users are familiar with. We briefly discuss the progress so far as well as the future plans.
The Anticipation of Human Behavior Using "Parasitic Humanoid"
Authors: Hiroyuki Iizuka, Hideyuki Ando, Taro Maeda
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

This paper proposes the concept of Parasitic Humanoid (PH) that can realize a wearable robot to establish intuitive interactions with wearers rather than conventional counter-intuitive ways like key-typing. It requires a different paradigm or interface technology which is called behavioral or ambient interface that can harmonize human-environment interactions to naturally lead to a more suitable state with the integration of information science and biologically inspired technology. We re-examine the use of wearable computers or devices from the viewpoint of behavioral information. Then, a possible way to realize PH is shown as integrated wearable interface devices. In order that PH establishes the harmonic interaction with wearers, a mutually anticipated interaction between a computer and human is necessary. To establish the harmonic interaction, we investigate the social interaction by experiments of human interactions where inputs and outputs of subjects are restricted in a low dimension at the behavioral level. The results of experiments are discussed with the attractor superimposition. Finally, we will discuss integrated PH system for human supports.