ppxscal/embedding_network huggingface dataset:
Composing Web Services in an Open World: Issues of Quality of Service
Authors: Albert Benveniste
Venue: Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems (2008)

Orchestrating Web services has become the method of choice for building new services on top of existing ones. One area of interest for this technology is business processes. Languages and methods have been developed and are now getting widely used, BPEL being the typical instance. When exposing the profile of a Web service, Quality of Service (QoS) must be specified. Besides security aspects, QoS involves a variety of parameters related to performance, query throughput, as well as quality of the returned data. How should QoS be handled in this context of Web Services Orchestrations? A number of novel and not so well identified issues occur that make this topic deviating from QoS for networks in a substantial way.Firstly, since Web services aim at hiding details for the external world, no information regarding the infrastructure or resources supporting a Web service is generally exposed. This prevents from using classical resource based performance models. Contracts are preferred instead. Contracts expose what a service offers, in terms of both function and QoS; in turn, contracts may or may not assume certain constraints on how the service should be invoked.A second important feature is that, unlike in networks, the control in orchestrations may depend on the carried data. Consequently performance and data interfere, which can cause orchestrations to become non-monotonic with respect to QoS--improving the QoS of some called service may degrade the overall QoS of the orchestration. Unfortunately, relying on QoS contracts implicitly assumes monotonicity.In a contract-based framework, a central question is to relate the contract that the orchestration can offer to its customers, to the contracts it has established with its subcontractors regarding the called services. This is not so simple when dealing with Web Services Orchestrations because actual QoS parameters vary a lot for different calls and are better described by means of a probability distribution. I shall discuss probabilistic soft contracts and how to compose them. Such contracts must be monitored by the orchestration for possible violations. I shall advocate using testing techniques from statistics for this purpose.Orchestration reconfiguration (e.g., to cope with breaching) is another important issue that is beyond the scope of my presentation, however.
Transposition Distance Based on the Algebraic Formalism
Authors: Cleber V. Mira, Zanoni Dias, Hederson P. Santos, Guilherme A. Pinto, Maria Emilia Walter
Venue: Proceedings of the 3rd Brazilian symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2008)

In computational biology, genome rearrangements is a field in which we study mutational events affecting large portions of a genome. One such event is the transposition, that changes the position of contiguous blocks of genes inside a chromosome. This event generates the problem of transposition distance, that is to find the minimal number of transpositions transforming one chromosome into another. It is not known whether this problem is $\mathcal{NP}$-hard or has a polynomial time algorithm. Some approximation algorithms have been proposed in the literature, whose proofs are based on exhaustive analysis of graphical properties of suitable cycle graphs. In this paper, we follow a different, more formal approach to the problem, and present a 1.5-approximation algorithm using an algebraic formalism. Besides showing the feasibility of the approach, the presented algorithm exhibits good results, as our experiments show.
Assume-Guarantee Verification for Interface Automata
Authors: Michael Emmi, Dimitra Giannakopoulou, Corina S. Păsăreanu
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

Interface automata provide a formalism capturing the high level interactions between software components. Checking compatibility, and other safety properties, in an automata-based system suffers from the scalability issues inherent in exhaustive techniques such as model checking. This work develops a theoretical framework and automated algorithms for modular verification of interface automata. We propose sound and complete assume-guarantee rules for interface automata, and learning-based algorithms to automate assumption generation. Our algorithms have been implemented in a practical model-checking tool and have been applied to a realistic NASA case study.
A compound framework for sports results prediction: A football case study
Authors: Byungho Min, Jinhyuck Kim, Chongyoun Choe, Hyeonsang Eom, R. I. (Bob) McKay
Venue: Knowledge-Based Systems (2008)

We propose a framework for sports prediction using Bayesian inference and rule-based reasoning, together with an in-game time-series approach. The framework is novel in three ways. The framework consists of two major components: a rule-based reasoner and a Bayesian network component. The two different approaches cooperate in predicting the results of sports matches. It is motivated by the observation that sports matches are highly stochastic, but at the same time, the strategies of a team can be approximated by crisp logic rules. Furthermore, because of the rule-based component, our framework can give reasonably good predictions even when statistical data is scanty: it can be used to predict results of matches between teams which have had few previous encounters. Machine learning techniques have great difficulty in handling such situations of insufficient data. Second, our framework is able to consider many factors, such as current scores, morale, fatigue, skills, etc. when it predicts the results of sports matches: most previous work considered only one factor, usually the score. Third, in contrast to most previous work on sports results prediction, we use a knowledge-based in-game time-series approach to predict sports matches. This approach enables our framework to reflect the tides/flows of a sports match, making our predictions certainly more realistic, and somewhat more accurate. We have implemented a football results predictor called FRES (Football Result Expert System) based on this framework, and show that it gives reasonable and stable predictions.
Multi-agent Frame of Social Distances Model
Authors: Jarosław Wąs
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

The article focuses on a multi-agent frame of Social Distances model. It introduces characteristics of active and passive pedestrian behavior. It also presents possibility of using Social Distances model for complex modeling of pedestrian traffic. The presented model also includes a concept of familiar groups.
A Response Time Distribution Model for Zoned RAID
Authors: Abigail S. Lebrecht, Nicholas J. Dingle, William J. Knottenbelt
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

RAID systems are widely deployed, both as standalone storage solutions and as the building blocks of modern virtualised storage platforms. An accurate model of RAID system performance is therefore critical to understanding storage system performance. To this end, this paper presents a queueing network-based model of RAID systems comprised of zoned disks and operating at RAID level 0-1 or 5. The contribution over previous work is twofold. Firstly, our analysis approximates full I/O request response time distributions rather than just mean values. This provides the ability to reason about response time quantiles and higher moments of response time --- both of which are useful in the context of modern quality of service requirements. Secondly, we validate our model against measurements from a real RAID system rather than a software simulation. The close agreement between predicted and observed response time distributions gives a high level of confidence in the validity of our model.
Securing Web Banking Applications
Authors: Antonio San Martino, Xavier Perramon
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

This paper presents the main results of a PhD thesis work aimed at defining a model for secure operation of an Internet Banking environment, even in the presence of malware on the client side. Its goal is to be resistant to the nowadays too frequent phishing and pharming attacks, and also to more classical ones like social engineering or man-in-the-middle attacks, and those exploiting technical flaws like buffer overflows, SQL injection, cross site scripting, etc. The key point of this model is the need for mutual authentication, instead of simply basing the security on the digital certificate of the financial entity.
Achievements and Challenges in Cocomo-Based Software Resource Estimation
Authors: Barry W. Boehm, Ricardo Valerdi
Venue: IEEE Software (2008)

This article summarizes major achievements and challenges of software resource estimation over the last 40 years, emphasizing the Cocomo suite of models. Critical issues that have enabled major achievements include the development of good model forms, criteria for evaluating models, methods for integrating expert judgment and statistical data analysis, and processes for developing new models that cover new software development approaches. The article also projects future trends in software development and evolution processes, along with their implications and challenges for future software resource estimation capabilities.
On the Correlation Distribution of Kerdock Sequences
Authors: Xiaohu Tang, Tor Helleseth, Aina Johansen
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

For any even integer n, the binary Kerdock sequences of period 2(2 n ¿ 1) are optimal with respect to the well-known Welch bound. Until now the correlation distribution of this family has not been known. In this paper we completely determine its correlation distribution using connections between the correlation properties of binary sequences and quaternary sequences under the Gray map.
Studying solutions of traveling salesman problem with hybrid particle swarm optimization
Authors: Helga G. Martins, Mateus Barros, Bruno Tonsic De Araujo, Renato Y. Bo, Leandro Faleiros, Germano Lambert-Torres
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

This paper presents the application of the PSO (Particle Swarm Optimization) as a tool to solve the Traveling Salesman Problem. The proposed application consists of using a technique based on Artificial Intelligent - AI. It is based in the simulation of social interaction between individuals of a population. Here, each element of population moves in the hyper-space and they are attracted by positions that they considers promising.
Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines
Authors: Roberto Bruni, Leonardo Gaetano Mezzina
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

The notion of a session is fundamental in service-oriented applications, as it serves to separate interactions between clients and different instances of the same service, and to group together logical units of work. Recently, the Service Centered Calculus (SCC) has been proposed as a process calculus designed around the concept of a dyadic session between a service side and an invoker side, where interaction protocols and service orchestration can be conveniently expressed. In this paper we propose a generic type system to collect services' behaviours and then we fix a class of well-typed processes that are guaranteed to be deadlock free, in the sense that they either diverge by invoking new service instances or reach a normal form. The type system is based on previous research on traditional mobile calculi, here conveniently extended and simplified thanks to the neat discipline imposed by the linguistic primitives of SCC.
Abstract Interpretation Plugins for Type Systems
Authors: Tobias Gedell, Daniel Hedin
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

The precision of many type based analyses can be significantly increased given additional information about the programs' execution. For this reason it is not uncommon for such analyses to integrate supporting analyses computing, for instance, nil-pointer or alias information. Such integration is problematic for a number of reasons: 1) it obscures the original intention of the type system especially if multiple additional analyses are added, 2) it makes use of already available analyses difficult, since they have to be rephrased as type systems, and 3) it is non-modular: changing the supporting analyses implies changing the entire type system.Using ideas from abstract interpretation we present a method for parameterizing type systems over the results of abstract analyses in such a way that one modular correctness proof can be obtained. This is achieved by defining a general format for information transferal and use of the information provided by the abstract analyses. The key gain from this method is a clear separation between the correctness of the analyses and the type system, both in the implementation and correctness proof, which leads to a comparatively easy way of changing the parameterized analysis, and making use of precise, and hence complicated analyses.In addition, we exemplify the use of the framework by presenting a parameterized type system that uses additional information to improve the precision of exception types in a small imperative language with arrays.
Interactive Storytelling with Literary Feelings
Authors: David Pizzi, Fred Charles, Jean-Luc Lugrin, Marc Cavazza
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

In this paper, we describe the integration of Natural Language Processing (NLP) within an emotional planner to support Interactive Storytelling. Our emotional planner is based on a standard HSP planner, whose originality is drawn from altering the agents' beliefs and emotional states. Each character is driven by its own planner, while characters are able to operate on their reciprocal feelings thus affecting each other. Our baseline story is constituted by a classic XIXth century French novel from Gustave Flaubert in which characters feelings play a dominant role. This approach benefits from the fact that Flaubert has described a specific ontology for his characters feelings. The objective of NLP should be to uncover from natural language utterances the same kind of affective elements, which requires an integration between NLP and the planning component at the level of semantic content. This research is illustrated with examples from a first fully integrated prototype comprising NLP, emotional planning and real-time 3D animation.
An empirical study of a cross-level association rule mining approach to cold-start recommendations
Authors: Cane Wing-ki Leung, Stephen Chi-fai Chan, Fu-lai Chung
Venue: Knowledge-Based Systems (2008)

We propose a novel hybrid recommendation approach to address the well-known cold-start problem in Collaborative Filtering (CF). Our approach makes use of Cross-Level Association RulEs (CLARE) to integrate content information about domain items into collaborative filters. We first introduce a preference model comprising both user-item and item-item relationships in recommender systems, and present a motivating example of our work based on the model. We then describe how CLARE generates cold-start recommendations. We empirically evaluated the effectiveness of CLARE, which shows superior performance to related work in addressing the cold-start problem.
Efficient Mushroom Cloud Simulation on GPU
Authors: Xingquan Cai, Jinhong Li, Zhitong Su
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

In this paper, we present a method to simulate the Mushroom Cloud efficient on GPU using advanced particle system, and our particle system is a state-preserving simulation system. We provide the visual-only model of Mushroom Cloud and we divide the Mushroom Cloud into five portions. Then we present our advanced particle system method. Our particle system method processes the birth and death of particles via index on CPU and uses a pair of Floating Point Textures on GPU to store the dynamic attributes of particles. This method also updates the dynamic attributes of particles and renders the system on GPU. We also provide a three-layers hierarchical structure to manage the particle system and batch rendering the particles having the similar attributes. Finally, the experiments prove that our method is feasible and high performance.
Matching large ontologies: A divide-and-conquer approach
Authors: Wei Hu, Yuzhong Qu, Gong Cheng
Venue: Data Knowledge Engineering (2008)

Ontologies proliferate with the progress of the Semantic Web. Ontology matching is an important way of establishing interoperability between (Semantic) Web applications that use different but related ontologies. Due to their sizes and monolithic nature, large ontologies regarding real world domains bring a new challenge to the state of the art ontology matching technology. In this paper, we propose a divide-and-conquer approach to matching large ontologies. We develop a structure-based partitioning algorithm, which partitions entities of each ontology into a set of small clusters and constructs blocks by assigning RDF Sentences to those clusters. Then, the blocks from different ontologies are matched based on precalculated anchors, and the block mappings holding high similarities are selected. Finally, two powerful matchers, V-Doc and Gmo, are employed to discover alignments in the block mappings. Comprehensive evaluation on both synthetic and real world data sets demonstrates that our approach both solves the scalability problem and achieves good precision and recall with significant reduction of execution time.
Relational Databases in RDF: Keys and Foreign Keys
Authors: Georg Lausen
Venue: Semantic Web, Ontologies and Databases: VLDB Workshop, SWDB-ODBIS 2007, Vienna, Austria, September 24, 2007, Revised Selected Papers (2008)

Today, most of the data on the web resides in relational databases. To make the data available for the semantic web mappings into RDF can be used. Such mappings should preserve the information about the structure of keys and foreign keys, because otherwise important semantic information is lost. In this paper, we discuss several possible ways to map relational databases into an RDF graph. We discuss the problem of how to represent the original key and foreign key constraints in the resulting RDF graph and demonstrate, that different kinds of mappings require different solutions. We finally propose to explicitly represent the structure of keys and foreign keys by means of the vocabulary of a new RDF namespace.
Fuzzy ARTMAP with Explicit and Implicit Weights
Authors: Takeshi Kamio, Kenji Mori, Kunihiko Mitsubori, Chang-Jun Ahn, Hisato Fujisaka, Kazuhisa Haeiwa
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

ARTMAP is one of the famous supervised learning systems. Many learning methods for ARTMAP have been proposed since it was devised as a system to solve Stability-Plasticity Dilemma. AL-SLMAP was implemented by slightly modifying FCSR which was the original learning method for fuzzy ARTMAP (FAM). Although AL-SLMAP can solve pattern recognition problems in a noisy environment more effectively than FCSR, AL-SLMAP is less suitable for region classification problems than FCSR. This means that AL-SLMAP has some problems which do not exist in FCSR. In this paper, we propose a learning method for FAM with explicit and implicit weights to overcome the problems.
An ontology-driven semantic mashup of gene and biological pathway information: Application to the domain of nicotine dependence
Authors: Satya S. Sahoo, Olivier Bodenreider, Joni L. Rutter, Karen J. Skinner, Amit P. Sheth
Venue: Journal of Biomedical Informatics (2008)

Objectives: This paper illustrates how Semantic Web technologies (especially RDF, OWL, and SPARQL) can support information integration and make it easy to create semantic mashups (semantically integrated resources). In the context of understanding the genetic basis of nicotine dependence, we integrate gene and pathway information and show how three complex biological queries can be answered by the integrated knowledge base. Methods: We use an ontology-driven approach to integrate two gene resources (Entrez Gene and HomoloGene) and three pathway resources (KEGG, Reactome and BioCyc), for five organisms, including humans. We created the Entrez Knowledge Model (EKoM), an information model in OWL for the gene resources, and integrated it with the extant BioPAX ontology designed for pathway resources. The integrated schema is populated with data from the pathway resources, publicly available in BioPAX-compatible format, and gene resources for which a population procedure was created. The SPARQL query language is used to formulate queries over the integrated knowledge base to answer the three biological queries. Results: Simple SPARQL queries could easily identify hub genes, i.e., those genes whose gene products participate in many pathways or interact with many other gene products. The identification of the genes expressed in the brain turned out to be more difficult, due to the lack of a common identification scheme for proteins. Conclusion: Semantic Web technologies provide a valid framework for information integration in the life sciences. Ontology-driven integration represents a flexible, sustainable and extensible solution to the integration of large volumes of information. Additional resources, which enable the creation of mappings between information sources, are required to compensate for heterogeneity across namespaces. Resource page: http://knoesis.wright.edu/research/lifesci/integration/structured_data/JBI-2008/
A Distance Learning System for Robotics
Authors: Soon Hyuk Hong, Ji Hwan Park, Key Ho Kwon, Jae Wook Jeon
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

In order to help students to understand robotics concepts, various types of materials are needed, in addition to real robots. It is difficult for all students to perform actual experiments because of the lack of real robots. In order to solve these problems, this paper describes the development of a web-based distance learning system for robotics, which consists of multimedia contents and a 3D (3-dimensional) robot simulator. Students can easily access the multimedia contents and, in this way, understand the concept of robotics. Also, they can use a 3D robot simulator to perform virtual experiments using a virtual robot which can be connected to a real robot.