ppxscal/embedding_network huggingface dataset:
Declarative Semantics for Active Integrity Constraints
Authors: Luciano Caroprese, Mirosław Truszczyński
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

We study active integrity constraints, a formalism designed to describe integrity constraints on databases and to specify preferred ways to enforce them. The original semantics proposed for active integrity constraints is based on the concept of a founded repair. We point out that groundedness underlying founded repairs does not prevent cyclic justifications and so, may be inappropriate in some applications. Thus, using a different notion of grounding, with roots in logic programming and revision programming, we introduce two new semantics: of justified weak repairs, and of justified repairs. We study properties of these semantics, relate them to earlier semantics of active integrity constraints, and establish the complexity of basic decision problems.
It feels better than filing: everyday work experiences in an activity-based computing system
Authors: Stephen Voida, Elizabeth D. Mynatt
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Activity-based computing represents an alternative to the dominant application- and document-centric model at the foundation of most mainstream desktop computing interfaces. In this paper, we present in-depth results from an in situ, longitudinal study of an activity-based computing system, Giornata. We detail the ways that the specific features of this system influenced the everyday work experiences of a small cohort of knowledge workers. Our analysis provides contributions at several levels of granularity-we provide concrete design recommendations based on participants' reactions to the particular features of the Giornata system and a discussion about how our findings can provide insight about the broader understanding of knowledge work and activity within HCI.
Schema Matching and Mapping-based Data Integration: Architecture, Approaches and Evaluation
Authors: Do,  Hong Hai
Venue:  (2007)

The book focuses on Schema Matching, the task of (semi-)automatically identifying semantic correspondences between elements of metadata structures, such as, database schemas, ontologies, and XML message formats. It is of key importance for interoperability and data integration in numerous applications, such as data warehousing, integration of web-sources, message mapping in E-business, and ontology alignment on the Semantic Web. However, in today's systems, schema matching is still manual; a time-consuming, tedious, and error-prone process, which becomes increasingly impractical considering the high complexity and number of schemas and data sources to be dealt with. In this book, the author Do Hong Hai describes the architecture, functionality, and evaluation of the schema matching system COMA++ (Combining Matchers), which was developed by himself in his Ph.d thesis. COMA++ represents a generic and customizable system for semi-automatic schema matching, which can combine different match algorithms in a flexible way. In comprehensive evaluations using large real-world schemas and ontologies, COMA++ has shown high quality as compared to the state of the art, proving its practicability for different domains. In addition, the book describes a new data integration approach, GenMapper (Generic Mapper), which utilizes instance-level correspondences between objects of data sources.
Tracing for web 3.0: trace compilation for the next generation web applications
Authors: Mason Chang, Edwin Smith, Rick Reitmaier, Michael Bebenita, Andreas Gal, Christian Wimmer, Brendan Eich, Michael Franz
Venue: Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments (2009)

Today's web applications are pushing the limits of modern web browsers. The emergence of the browser as the platform of choice for rich client-side applications has shifted the use of in-browser JavaScript from small scripting programs to large computationally intensive application logic. For many web applications, JavaScript performance has become one of the bottlenecks preventing the development of even more interactive client side applications. While traditional just-in-time compilation is successful for statically typed virtual machine based languages like Java, compiling JavaScript turns out to be a challenging task. Many JavaScript programs and scripts are short-lived, and users expect a responsive browser during page loading. This leaves little time for compilation of JavaScript to generate machine code. We present a trace-based just-in-time compiler for JavaScript that uses run-time profiling to identify frequently executed code paths, which are compiled to executable machine code. Our approach increases execution performance by up to 116% by decomposing complex JavaScript instructions into a simple Forth-based representation, and then recording the actually executed code path through this low-level IR. Giving developers more computational horsepower enables a new generation of innovative web applications.
A Multi-objective Differential Evolutionary Algorithm Based on Spacial Distance
Authors: Jinhua Zheng, Jun Wu, Hui Lv
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Differential Evolution (DE) is a relatively new EA and it has become a major branch of EA. Based on the classical Differential Evolution, we proposed a new Multi-Objective Differential Evolutionary Algorithm in this paper. Compared with NSGA-II and ¿-MOEA, the experimental results demonstrate that the new algorithm tends to be more effective in obtaining good convergence and can converge to the true Pareto front with comparable efficiency.
Assessment of land suitability potentials for agriculture using a remote sensing and GIS based approach
Authors: S. Bandyopadhyay, R. K. Jaiswal, V. S. Hegde, V. Jayaraman
Venue: International Journal of Remote Sensing (2009)

Land suitability potential evaluation is an important step to detect the environmental limit in sustainable land use planning. It deals with the assessment of land performances for the specific use that is crop production. In the present study, a land suitability evaluation in a watershed has been carried out through close examination of the indicators of land suitability. The parameters taken into consideration were soil texture, organic matter content, soil depth, slope and land use/land cover. Satellite images of the study area have been classified for land use/land cover map preparation, while toposheet and ancillary data have been used for slope maps and soil properties determination. An integrated land suitability potential (LSP) index was computed considering the contribution of various parameters of land suitability. The watershed was categorized as good, fair, moderate, average, poor and not suitable by adopting the logical criteria. These categories were arrived at by integrating the various layers with corresponding weights in a geographical information system (GIS). The study demonstrates that a watershed can be categorized into spatially distributed agriculture potential zones based on the soil properties, terrain characteristics and analysing present land use.
De Boor-Fix dual functionals for transformation from polynomial basis to convolution basis
Authors: Lim Yohanes Stefanus
Venue: ACM Communications in Computer Algebra (2009)

Basis transformation plays a central role in data representations and in many problem solving techniques such as Fourier transform and wavelet transform. A pertinent basis gives pertinent information. Dual functionals are a mathematical tool for basis transformation. This work presents, from the perspective of algebraic computing, a generalization of the de Boor-Fix dual functionals for the Bernstein basis functions to the case of the convolution basis functions. The convolution basis functions can be characterized as polar forms of the corresponding Bernstein basis functions. These new dual functionals can be used for computing algebraically the expansion coefficients of any polynomial over the convolution basis which has applications in computer-aided geometric design and secret information encoding.
Spread Spectrum Watermark Embedder Optimization Using Genetic Algorithms
Authors: Seba Maity, Santi P. Maity, Jaya Sil
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

This paper looks Spread Spectrum (SS) watermarking from a different angle where number of cover signal points, payload capacity and watermark signal-to-interference ratio are optimized. The objective is to meet an acceptable BER (bit error rate) and peak-to-average distortion (PAD)on a single point of the cover signal under the constraint of a given embedding distortion and cover size. First, a new model of spread spectrum (SS) watermarking is proposed where each watermark bit is spread using a distinct code pattern over N-mutually orthogonal signal points. Decision variable for each bit of watermark decoding is formed from the weighted average of N-decision statistics. Each watermarked signal point is then modified (attack channel) as Rayleigh distribution followed by AWGN (additive white Gaussian noise). Genetic algorithm (GA) isused to reduce the searching time in this multidimensional nonlinear problem of conflicting nature. Simulation results show that optimizing the number of cover signal points, payload capacity and watermark signal-to-interference ratio (WSIR), better acceptable values of both BER and PAD can be achieved simultaneously.
Matching and Retrieval Based on the Vocabulary and Grammar of Color Patterns
Authors: A. Mojsilovic, J. Kovacevic, J. Hu, R. J. Safranek, S. K. Ganapathy
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

While it is recognized that images are described through color, texture and shapes of objects in the scene, the general image understanding is still difficult. Thus, to perform image retrieval in a human-like manner one has to chose a specific domain, understand how users achieve similarity within that domain and then build a system that duplicates human performance. Since color and texture are fundamental aspects of human perception we propose a set of techniques for retrieval of color patterns. To determine how humans judge similarity of color patterns we performed a subjective study. Based on the results of the study five most relevant visual categories for the perception of pattern similarity were identified. We also determined the hierarchy of rules governing the use of these categories. Based on these results we designed a system which accepts one or more texture images as input, and depending on the query, produces a set of choices that follow human behavior in pattern matching. Processing steps in our model follow those of the human visual system, resulting in perceptually based features and distance measures. As expected, search results closely correlate with human choices.
Do the blocks rock: a tangible interface for play and exploration
Authors: Frank G. Feltham
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

In this paper I present the Sonic Blocks. A Tangible User Interface (TUI) for collaborative exploration of digital music with children. Based on the notion of exploratory Tangible User Interfaces this paper gives an account of the design, development and initial observations of the Sonic Blocks in use. The findings gathered from these observations reveal that TUIs through their physical engagement can enable unique approaches to thinking and cognition that contrast significantly to the visual model of interaction offered by the Graphical user Interface (GUI).
Benchmarking e-Government - A Comparative Review of Three International Benchmarking Studies
Authors: Lasse Berntzen, Morten Goodwin Olsen
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

This paper makes a range of comparisons between e-government developments and performance worldwide. In order to make such comparisons, it is necessary to use a set of indicators. This paper examines the evolution of indicators used by three widely referenced international e-government studies, from the early days of e-government benchmarking until today. Some critical remarks related to the current state-of-the-art are given. The authors conclude that all three studies have their strengths and weaknesses, and propose automatic assessment of e-government services as a potential solution to some of the problems experienced by current benchmarking studies.
On Pure and (Approximate) Strong Equilibria of Facility Location Games
Authors: Thomas Dueholm Hansen, Orestis A. Telelis
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We study social cost losses in Facility Location games, where n selfish agents install facilities over a network and connect to them, so as to forward their local demand (expressed by a non-negative weight per agent). Agents using the same facility share fairly its installation cost, but every agent pays individually a (weighted) connection cost to the chosen location. We study the Price of Stability (PoS) of pure Nash equilibria and the Price of Anarchy of strong equilibria (SPoA), that generalize pure equilibria by being resilient to coalitional deviations. For unweighted agents on metric networks we prove upper and lower bounds on PoS, while an O(ln n) upper bound implied by previous work is tight for non-metric networks. We also prove a constant upper bound for the SPoA of metric networks when strong equilibria exist. For the weighted game on general networks we prove existence of e-approximate (e&thinsp;=&thinsp;2.718...) strong equilibria and an upper bound of O(ln W) on SPoA (W is the sum of agents&rsquo; weights), which becomes tight &Theta;(ln n) for unweighted agents.
SeqStream: Mining Closed Sequential Patterns over Stream Sliding Windows
Authors: Lei Chang, Tengjiao Wang, Dongqing Yang, Hua Luan
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Previous studies have shown mining closed patterns provides more benefits than mining the complete set of frequent patterns, since closed pattern mining leads to more compact results and more efficient algorithms. It is quite useful in a data stream environment where memory and computation power are major concerns. This paper studies the problem of mining closed sequential patterns over data stream sliding windows. A synopsis structure IST (Inverse Closed Sequence Tree) is designed to keep inverse closed sequential patterns in current window. An efficient algorithm SeqStream is developed to mine closed sequential patterns in stream windows incrementally, and various novel strategies are adopted in SeqStream to prune search space aggressively. Extensive experiments on both real and synthetic data sets show that SeqStream outperforms PrefixSpan, CloSpan and BIDE by a factor of about one to two orders of magnitude.
Approximating the Metric TSP in Linear Time
Authors: Davide Bilò, Luca Forlizzi, Guido Proietti
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Given a metric graph G = (V,E) of n vertices, i.e., a complete graph with an edge cost function c:V ×V ¿¿ ¿ 0 satisfying the triangle inequality, the metricity degree of G is defined as $\beta=\max_{x,y,z \in V} \big\{ \frac{c(x,y)}{c(x,z)+c(y,z)}\big\} \in \big[\frac{1}{2},1\big]$. This value is instrumental to establish the approximability of several NP-hard optimization problems definable on G, like for instance the prominent traveling salesman problem, which asks for finding a Hamiltonian cycle of G of minimum total cost. In fact, this problem can be approximated quite accurately depending on the metricity degree of G, namely by a ratio of either $\frac{2-\beta}{3(1-\beta)}$ or $\frac{3\beta^2}{3 \beta^2-2\beta+1}$, for $\beta or $\beta \geq \frac{2}{3}$, respectively. Nevertheless, these approximation algorithms have O(n 3) and O(n 2.5 log1.5 n) running time, respectively, and therefore they are superlinear in the ¿(n 2) input size. Thus, since many real-world problems are modeled by graphs of huge size, their use might turn out to be unfeasible in the practice, and alternative approaches requiring only O(n 2) time are sought. However, with this restriction, all the currently available approaches can only guarantee a 2-approximation ratio for the case ß= 1, which means a $\frac{2\beta^2}{2\beta^2-2\beta+1}$-approximation ratio for general ß< 1. In this paper, we show how to enhance ---without affecting the space and time complexity--- one of these approaches, namely the classic double-MST heuristic, in order to obtain a 2ß-approximate solution. This improvement is effective, since we show that the double-MST heuristic has in general a performance ratio strictly larger that 2 ß, and we further show that any re-elaboration of the shortcutting phase therein provided, cannot lead to a performance ratio better than 2ß.
Security for FLUTE over Satellite Networks
Authors: L. Liang, S. Iyengar, H. Cruickshank, Z. Sun, C. Kulatunga, G. Fairhurst
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Data transmission, such as software update, large file broadcasting and video on demand, can take advantage of the wide coverage and the broadcasting features of the satellite networks. The multicast technologies provide the support for these applications by efficiently using the expensive satellite bandwidth. One of them is the File Delivery over Unidirectional Transport (FLUTE) protocol [1] that is ideally for bulk of data reliable transmission over the satellite. However, FLUTE does not address any congestion control and security mechanisms. This paper is analyzing the advantages and drawbacks for security over different layers in a satellite network and presenting security considerations for the FLUTE over satellite networks by analyzing the threats and trying to provide security approaches at the Reliable Multicast Transport (RMT) layer for it. The work presented in this paper also analyzes the logical key hierarchy (LHK) for FLUTE protocol and gives the recommendation on the hierarchy structure for efficient re-key.
An Algorithm for Content-based Retrieval in Multimedia Databases
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

We propose a linear time algorithm, referred to as mbox{SIM}_{vs}, for processing spatial similarity queries in multimedia databases. mbox{SIM}_{vs} computes the degree to which the spatial relationships among the objects in a database image conform to those specified in the query. mbox{SIM}_{vs} recognizes translation, scale, rotation variants of an image and variants generated by an arbitrary composition of translation, scale, and rotation transformations. Performance of mbox{SIM}_{vs} is compared with those of two previously known algorithms using a testbed image collection. This comparison demonstrates that mbox{SIM}_{vs} is not only more efficient but performs as well as or better than the other algorithms. 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
A Design Process for the Development of an Interactive and Adaptive GIS
Authors: Mathieu Petit, Christophe Claramunt, Cyril Ray, Gaëlle Calvary
Venue: Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems (2008)

Geographical Information Systems (GIS) have long bridged the gap between geo-information databases and applications. Although conceptual modelling approaches for GIS have been particularly successful in the representation of the specific properties of geographical information, there is still a need for a better integration of user intentions and usage. This paper introduces a conceptual framework applied to GIS and defined not only as a "Geographic Information System", but also as a "Geographic Interactive System". This approach extends the conceptual framework of a general purpose mobile interactive system to the geographical context. Beside a description of user tasks and the domain data layout, the proposed framework considers the geographical environment as an additional component to the design approach. The role of the spatial dimension in the design of such an interactive system is illustrated all along the conception of a real-time ship tracking system.
2009 Special Issue: Implicit and explicit representations
Authors: Nicolas P. Rougier
Venue: Neural Networks (2009)

During the past decades, the symbol grounding problem, as has been identified by Harnard [Harnard, S. (1990). The symbol grounding problem. Physica D: Nonlinear Phenomena, 42, 335-346], became a prominent problem in the cognitive science society. The idea that a symbol is much more than a mere meaningless token that can be processed through some algorithm, sheds new light on higher brain functions such as language and cognition. We present in this article a computational framework that may help in our understanding of the nature of grounded representations. Two models are briefly introduced that aim at emphasizing the difference we make between implicit and explicit representations.
A new assessment methodology for virtual reality surgical simulators
Authors: Sof&thinsp;ía Bayona, José Manuel Fernández-Arroyo, Pilar Bayona, Luis Pastor
Venue: Computer Animation and Virtual Worlds (2009)

This paper presents an assessment methodology to validate surgical simulators which will help researchers in avoiding most common errors by providing a complete structured guide. The methodology organizes the questions depending on the validities they are related to, helping in objectives' definition and consistent hypothesis formulation. We will define the study depending on its purpose, time course and the study factor assignment, taking into account legal and ethical issues and choosing the population and sample size. If it is an experimental study, we will determine if there exist a control group and the operational definition of variables. We will avoid extraneous variables and make our study blind, establishing the final evaluation procedure, and stipulating actuation and observation protocols. A feasibility study will be performed before executing the pilot and final studies in which we will analyse the data as indicated by the statistical plan, obtaining our results and conclusions. We provide an example, applying the assessment methodology step by step to the evaluation of a virtual reality arthroscopy simulator with haptic feedback. Finally, possible experiments are proposed as well as a conscientious study of different alternatives for the final evaluation procedure, and an extended proposal of surgical competence assessment measures. Copyright &copy; 2009 John Wiley & Sons, Ltd.