ppxscal/embedding_network huggingface dataset:
A Platform for Object-Action Semantic Web Interaction
Authors: Roberto García, Juan Manuel Gimeno, Ferran Perdrix, Rosa Gil, Marta Oliva
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

Semantic Web applications tests show that their usability is seriously compromised. This motivates the exploration of alternative interaction paradigms, different from the "traditional" Web or desktop applications ones. The Rhizomer platform is based on the object-action interaction paradigm, which is better suited for heterogeneous resource spaces such as those common in the Semantic Web. Resources, described by means of RDF metadata, correspond to the objects from the interaction point of view and Rhizomer provides browsing mechanisms for them. Semantic web services, dynamically associated to these objects, correspond to the actions. Rhizomer has been applied in the context of a media house to build an audiovisual content management system. End-users of this system, journalists and archivists, are able to navigate the content repository through semantic metadata describing content pieces and the domain knowledge these pieces are referring to. Those resources constitute the objects to which, when the user selects one of them, semantic web services dynamically associate specialized visualization and interaction views, the actions.
Importance sampling in rate-sharing networks
Authors: P. Lieshout, M. Mandjes
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

We consider a network supporting elastic traffic, where the service capacity is shared among the various classes according to an alpha-fair sharing policy. Assuming Poisson arrivals and exponentially distributed service requirements for each class, the dynamics of the user population may be described by a Markov process. We focus on the probability that, given that the network is in some state n0 at time 0, the network is in some set of states A at time T. In particular, we assume that the underlying event is rare, i.e., the probability of interest is small. As in general no explicit expressions are known for this probability, an attractive approach may be to resort to Monte-Carlo (MC) simulation. However, due to the rarity of the event under consideration, MC simulation is infeasible. A natural approach to speed up the simulation is to use Importance Sampling (IS). We present an IS algorithm to accelerate the simulation that is based on large deviations results. With extensive simulation experiments we assess the performance of the algorithm; under rather general conditions a considerable speed-up is achieved.
Categorizing Evolved CoreWar Warriors Using EM and Attribute Evaluation
Authors: Doni Pracner, Nenad Tomašev, Miloš Radovanović, Mirjana Ivanović
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

CoreWar is a computer simulation where two programs written in an assembly language called redcode compete in a virtual memory array. These programs are referred to as warriors. Over more than twenty years of development a number of different battle strategies have emerged, making it possible to identify different warrior types. Systems for automatic warrior creation appeared more recently, evolvers being the dominant kind. This paper describes an attempt to analyze the output of the CCAI evolver, and explores the possibilities for performing automatic categorization by warrior type using representations based on redcode source, as opposed to instruction execution frequency. Analysis was performed using EM clustering, as well as information gain and gain ratio attribute evaluators, and revealed which mainly brute-force types of warriors were being generated. This, along with the observed correlation between clustering and the workings of the evolutionary algorithm justifies our approach and calls for more extensive experiments based on annotated warrior benchmark collections.
Real-Time Communications Over Cluster-Tree Sensor Networks with Mobile Sink Behaviour
Authors: Petr Jurcík, Ricardo Severino, Anis Koubâa, Mário Alves, Eduardo Tovar
Venue: Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2008)

Modelling the fundamental performance limits of Wireless Sensor Networks (WSNs) is of paramount importance to understand the behaviour of WSN under worst case conditions and to make the appropriate design choices. In that direction, this paper contributes with a methodology for modelling cluster tree WSNs with a mobile sink. We propose closed form recurrent expressions for computing the worst case end to end delays, buffering and bandwidth requirements across any source-destination path in the cluster tree assuming error free channel. We show how to apply our theoretical results to the specific case of IEEE 802.15.4/ZigBee WSNs. Finally, we demonstrate the validity and analyze the accuracy of our methodology through a comprehensive experimental study, therefore validating the theoretical results through experimentation.
Wasp Swarm Algorithm for Dynamic MAX-SAT Problems
Authors: Pedro C. Pinto, Thomas A. Runkler, João M. Sousa
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

This paper proposes a wasp swarm optimization algorithm, which is applied to the dynamic variant of the maximum satisfiability problem, or MAX-SAT. Here, we describe the changes implemented to optimize the dynamic problem and analyze the parameters of the new algorithm. Wasp swarm optimization accomplishes very well the task of adapting to systematic changes of dynamic MAX-SAT instances derived from static problems, and significantly outperforms the local search algorithm used as benchmark.
Comparison of overlapping cell Vertex and Galerkin finite volume methods for sub-grid scale modeling of turbulent flow
Authors: Saeed-Reza Sabbagh-Yazdi, Farzad Meysami Azad, Nikos E. Mastorakis
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

Application of the computer simulation for solving the incompressible flow problems motivates developing efficient and accurate numerical models. For this purpose, incompressible form of 2D Navier-stokes equations is combined with a Sub-Grid Scale turbulent eddy viscosity model, and, artificial dissipation terms are added to discrete for of the equations which are obtained by application of Cell Vertex and Galerkin finite volume methods. In this paper, the accuracy of Cell Vertex and Galerkin finite volume methods two-dimensional incompressible flow solution of the turbulent flow around circular cylinder at supercritical Reynolds number on unstructured triangular meshes are assessed by comparison of computed results with experimental coefficient of pressure measurements. The computed results are presented in terms of color coded maps of pressure and velocity fields as well as velocity vectors on boundary surfaces of the solution domain.
Disclosure Risks of Distance Preserving Data Transformations
Authors: E. Onur Turgay, Thomas B. Pedersen, Yücel Saygın, Erkay Savaş, Albert Levi
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

One of the fundamental challenges that the data mining community faces today is privacy. The question "How are we going to do data mining without violating the privacy of individuals?" is still on the table, and research is being conducted to find efficient methods to do that. Data transformation was previously proposed as one efficient method for privacy preserving data mining when a party needs to out-source the data mining task, or when distributed data mining needs to be performed among multiple parties without each party disclosing its actual data. In this paper we study the safety of distance preserving data transformations proposed for privacy preserving data mining. We show that an adversary can recover the original data values with very high confidence via knowledge of mutual distances between data objects together with the probability distribution from which they are drawn. Experiments conducted on real and synthetic data sets demonstrate the effectiveness of the theoretical results.
Analyzing sliding bifurcations on discontinuity boundary of Filippov systems
Authors: Iván Arango, John Alexander Taborda
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In this paper, we propose a novel method to analyze sliding bifurcations in discontinuous piecewise smooth autonomous systems (denominated Filippov systems) on the planar neighborhood of the discontinuity boundary (DB). We use a classification recently proposed of points and events on DB to characterize the one-parameter sliding bifurcations. For each parameter value, crossing and sliding segments on DB are determined by means of existence conditions of two crossing points (C), four non-singular sliding points (S) and thirty-five singular sliding points (T, V, Π, Ψ, Q or Φ). Boolean-valued functions are used to formulate these conditions based on geometric criterions. This method was proven with the full catalog of local bifurcations that it was proposed recently. A topological normal form is used as illustrative example of the method.
Data Mining for Navigation Generating System with Unorganized Web Resources
Authors: Diana Purwitasari, Yasuhisa Okazaki, Kenzi Watanabe
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

Users prefer to navigate subjects from organized topics in an abundance resources than to list pages retrieved from search engines. We propose a framework to cluster frequent itemsets (sets of common words) into topics, produce a hierarchical list, and then generate topics sequence from a collection of documents. The framework will regenerate a next sequence when users click a topic. Consider browsing to any topic as a kind of searching for that topic, the framework makes an inquiry using feature terms within the document representation of selected topic as query keywords. Our ranking method in searching process considers content analysis that still retaining spatial information of search keywords and link analysis of documents. Utilizing implementation of navigation generating system the experiments show that a navigation list from clustering results can be settled with regard to variance ratio of between and within distances. Agglomerative clustering is used in restructuring the extracted topics in order to produce a hierarchical navigation list.
Historical and Conceptual Foundation of Diagrammatical Ontology
Authors: Peter Øhrstrøm, Sara L. Uckelman, Henrik Schärfe
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

During the Renaissance there was a growing interest for the use of diagrams within conceptual studies. This paper investigates the historical and philosophical foundation of this renewed use of diagrams in ontology as well as the modern relevance of this foundation. We discuss the historical and philosophical background for Jacob Lorhard's invention of the word `ontology' as well as the scientific status of ontology in the 16th and 17th century. We also consider the use of Ramean style diagrams and diagrammatic ontology in general. A modern implementation of Lorhard's ontology is discussed and this classical ontology is compared to some modern ontologies.
A Simulation Framework for Studying Economic Resource Management in Grids
Authors: Kurt Vanmechelen, Wim Depoorter, Jan Broeckhove
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Economic principles are increasingly being regarded as a way to address conflicting user requirements, to improve the effectiveness of grid resource management systems, and to deliver incentives for providers to join virtual organizations. Because economic resource management mechanisms can encourage grid participants to reveal the true valuations of their jobs and resources, the system becomes capable of making better scheduling decisions. A lot of exploratory research into different market mechanisms for grids is ongoing. Since it is impractical to conduct analysis of novel mechanisms on operational grids, most of this research is being carried out using simulation. This paper presents the Grid Economics Simulator (GES) in support of such research. The key design goals of the framework are enabling a wide variety of economic and non-economic forms of resource management while simultaneously supporting distributed execution of simulations and exhibiting good scalability properties.
Fuzzy Measures: Collectors of Entropies
Authors: Doretta Vivona, Maria Divari
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In the fuzzy setting we define a collector of entropies, which allows us to consider the reliability of observers. This leads to a system of functional equations. We are able to find the general solution of the system for collectors, which are compatible with a law of the kind "Inf" in [2]. Finally we give a class of solutions for a collector for which we dont'n take into account a law of compositivity for entropies.
Methodology and Tools for End-to-End SOA Security Configurations
Authors: Fumiko Satoh, Yuichi Nakamura, Nirmal K. Mukhi, Michiaki Tatsubori, Kouichi Ono
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

The configuration of non-functional requirements, such as security, has become important for SOA applications, but the configuration process has not been discussed comprehensively. In current development processes, the security requirements are not considered in upstream phases and a developer at a downstream phase is responsible for writing the security configuration. However, configuring security requirements properly is quite difficult for developers because the SOA security is cross-domain and all required information is not available in the downstream phase. To resolve this problem, we clarify how to configure security in the SOA application development process, and define the developer’s roles in each phase. Additionally, supporting technologies to generate security configurations are proposed: Model-Driven Security and Pattern-based Policy Configuration. Our contribution is proposing a methodology for end-to-end security configuration for SOA applications and tools for generating detailed security configurations from the requirements specified in upstream phases model transformations, making it possible to configure security properly without increasing developers’ workloads.
Synthesis of strategies from interaction traces
Authors: Tsz-Chiu Au, Sarit Kraus, Dana Nau
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an algorithm that, in polynomial time, can generate the best such composite strategy. We describe how to incorporate the composite strategy into an existing agent, as an enhancement of the agent's original strategy. We provide experimental results using interaction traces from 126 agents (most of them written by students as class projects) for the Iterated Prisoner's Dilemma, Iterated Chicken Game, and Iterated Battle of the Sexes. We compared each agent with the enhanced version of that agent produced by our algorithm. The enhancements improved the agents' scores by about 5% in the IPD, 11% in the ICG, and 26% in the IBS, and improved their rank by about 12% in the IPD, 38% in the ICG, and 33% in the IBS.
Building Verifiable Sensing Applications Through Temporal Logic Specification
Authors: Asad Awan, Ahmed Sameh, Suresh Jagannathan, Ananth Grama
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized networks of heterogeneous devices with severe resource constraints. As a consequence, developers must explicitly deal with low-level details, making programming time-consuming and error-prone. To reduce this burden, current sensor network programming languages espouse a model that relies on packaged reusable components to implement relevant pieces of a distributed communication infrastructure. Unfortunately, programmers are often forced to understand the mechanisms used by these implementations in order to optimize resource utilization and performance, and to ensure application requirements are met. To address these issues, we propose a novel and high-level programming model that directly exposes control over sensor network behavior using temporal logic specifications, in conjunction with a set of system state abstractions to specify, generate, and automatically validate resource and communication behavior for sensor network applications. TLA+ (the temporal logic of actions) is used as the underlying specification language to express global state abstractions as well as user invariants. We develop a synthesis engine that utilizes TLC (a temporal logic model-checker) to generate detailed actions so that user-provided behavioral properties can be satisfied, guaranteeing program correctness. The synthesis engine generates specifications in TLA+, which are compiled down to sensor node primitive actions. We illustrate our model using a detailed experimental evaluation on our structural sensing and control testbed. The proposed framework is integrated into the COSMOS macroprogramming environment, which is extensively used to develop sensing and control applications at the Bowen Lab for Structural Engineering at Purdue.
The CONCUR framework forcommunity maintenance of curated resources
Authors: Patrick Schmitz
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

The increasing use of computational linguistics for semantic search and discovery tools requires much work on development and maintenance of associated ontologies. Related applications depend upon curated resources like dictionaries, gazetteers, etc. In order to scale these application models and leverage the respective communities of interest, a new set of tools is needed that facilitate community development and extension of these resources while retaining the curatorial model to ensure a reliable, high quality resource. We describe the requirements and principles for such a system, and present the CONCUR framework that addresses these needs. CONCUR defines a reputation model and a set of reusable infrastructure services to maintain the resource. The reputation model combines correctness as well as utility of participants' contributions, tracked over time and by sub-domain within the resource. We describe the architectural issues of the model, potential applications, and continuing research on the model.
Lattice Boltzmann Simulation of Some Nonlinear Complex Equations
Authors: Baochang Shi
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

In this paper, the lattice Boltzmann method for convection-diffusion equation with source term is applied directly to solve some important nonlinear complex equations, including nonlinear Schrödinger (NLS) equation, coupled NLS equations, Klein-Gordon equation and coupled Klein-Gordon-Schrödinger equations, by using complex-valued distribution function and relaxation time. Detailed simulations of these equations are carried out. Numerical results agree well with the analytical solutions, which show that the lattice Boltzmann method is an effective numerical solver for complex nonlinear systems.
From Fuzzy Beliefs to Goals
Authors: Célia Costa Pereira, Andrea G. Tettamanzi
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In this paper, we propose a new approach to deal with beliefs by supposing that a rational agent has a degree of trustiness for each information it disposes of. We propose (i) a new framework for dealing with imprecise beliefs and desires; (ii) two algorithms for updating the mental state of an agent in this new setting; (iii) three ways for comparing the resulting fuzzy set of desires and (iv) two postulates which the goal election function must obey.
Conversions between three methods for representing 3D surface textures under arbitrary illumination directions
Authors: Junyu Dong, Guimei Sun, Guojiang Chen
Venue: Image and Vision Computing (2008)

Representing the appearances of surfaces illuminated from different directions has long been an active research topic. While many representation methods have been proposed, the relationships and conversion between different representations have been less well researched. These relationships are important, as they provide (a) an insight as to the different capabilities of the surface representations, and (b) a means by which they may be converted to common formats for computer graphic applications. In this paper, we introduce a single mathematical framework and use it to express three commonly used surface texture relighting representations: surface gradients (Gradient), Polynomial Texture Maps (PTM) and eigen base images (Eigen). The framework explicitly reveals the relations between the three methods, and from this we propose a set of conversion methods. We use 26 rough surface textures illuminated from 36 directions for our experiments and perform both quantitative and qualitative assessments to evaluate the conversion methods. The quantitative assessment uses a normalized root-mean-squared error as metric to compare the original images and those produced by proposed representation methods. The qualitative assessment is based on psychophysical experiments and non-parametric statistics. The results from the two assessments are consistent and show that the original Eigen representation produces the best performance. The second best performances are achieved by the original PTM representation and the conversion between Polynomial Texture Maps (PTM) and eigen base images (Eigen), while the performances of other representations are not significantly different.
A Two-Layered Management Architecture for Building Adaptive Real-Time Systems
Authors: Florian Kluge, Sascha Uhrig, Jörg Mische, Theo Ungerer
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

The concepts of Autonomic and Organic Computing (AC/OC) promise to make modern computer systems more secure and easier to manage. In this paper, we extend the observer/controller architecture typically used in AC/OC systems towards a new target area --- embedded real-time systems. As a result we present a two-layered management architecture. We discuss aspects of internal communication and design a communication model. Finally, we present a generic classification system for the upper layer of the management architecture.