ppxscal/embedding_network huggingface dataset:
Automatic Generation of CSP || B Skeletons from xUML Models
Authors: Edward Turner, Helen Treharne, Steve Schneider, Neil Evans
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

CSP ¿ B is a formal approach to specification that combines CSP and B. In this paper we present our tool that automatically translates a subset of executable UML (xUML) models into CSP ¿ B, for the purpose of verification and increased validation at the early stages of a software engineering development lifecycle. The tool is being developed for our industrial collaborators, AWE plc, in order to strengthen their software engineering process which uses xUML. As part of this process, AWE and Kennedy Carter Ltd. have built an xUML to SPARK Ada code generator, which is also employed to contribute a higher level of safety assurance at the latter stages of the lifecycle. Our tool is based on a model-text transformation strategy that uses the xUML meta-model to map to CSP and B constructs. The tool generates machine readable CSP and B; we present a simple example to demonstrate the transformation strategy, and the analysis of the resulting specification.
A Tool for Building Collaborative Applications by Invocation of Grid Operations
Authors: Maciej Malawski, Tomasz Bartyński, Marian Bubak
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The motivation for this work is the need for providing tools which facilitate building scientific applications that are developed and executed on various Grid systems, implemented with different technologies. As a solution to this problem, we have developed the Grid Operation Invoker (GOI) which offers object-oriented method invocation semantics for interacting with computational services accessible with diverse middleware frameworks. GOI forms the core of the ViroLab virtual laboratory engine and it is used to invoke operations from within experiments described using a scripting notation. In this paper, after outlining the features of GOI, we describe how it is enhanced with a mechanism of so-called local gems which allows adding high-level support for middleware technologies based on the batch job-processing model, e.g. EGEE LCG/gLite. As a result, we demonstrate how a molecular dynamics program called NAMD, deployed on EGEE, was integrated with the ViroLab virtual laboratory.
Multi-view Moving Human Detection and Correspondence Based on Object Occupancy Random Field
Authors: Jian Xu, Xiao-Qing Ding, Sheng-Jin Wang, You-Shou Wu
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

In this paper, we address the problem of detection and correspondence of moving persons in a multi-camera set. A novel algorithm is proposed based on object occupancy random field (abbreviated by OORF), which has a robust performance even under severe occlusions and a fast implementation speed. The core of our algorithm is OORF and object window structure. The latter is essential to compute OORF and provides a scheme to detect and correspond objects simultaneously.
Reflective Symmetry Detection Based on Parallel Projection
Authors: Ju-Whan Song, Ou-Bong Gwun
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

Reflective symmetry is useful for various areas such as computer vision, medical imaging, and 3D model retrieval system. This paper presents an intuitive reflective symmetry detection method for 3D polygon objects. Without any mapping process the method detects the reflective symmetry plane by parallel projection. This paper defines a continuous measure to estimate how much an object is reflective symmetrical for a projection plane through the center of the object. Also it explores the method to detect the reflective symmetry plane with the measure. The proposed method can detect up to 99% reflective symmetry plane not exceeding 4 degree angle for perfect symmetry objects and detect up to 85% reflective symmetry plane not exceeding 10 degree angle for near symmetry objects using Princeton Shape Benchmark.
On Significance of Ontology Quality in Ontology-Driven Web Search
Authors: Darijus Strasunskas, Stein L. Tomassen
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

Web search performance and efficiency is critical for many people and organizations in knowledge society. Nowadays, ontologies are being applied in a number of ontology-based information retrieval systems in order to improve the performance of these systems. However, quality of ontology plays an important role in these applications. In order to feasibly assess the impact, evaluation criteria need to be connected to scenarios of use with a purpose to enhance particular search tasks. In this article discussed preliminary results of the experiment showing how different ontology quality aspect can improve ontology-driven Web search performance.
From Microscopic to Macroscopic Modeling of Supersonic Seeded Atomic Beam
Authors: Savino Longo, Paola Diomede, Annarita Laricchiuta, Gianpiero Colonna, Mario Capitelli, Daniela Ascenzi, Mario Scotoni, Paolo Tosi, Fernando Pirani
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Two new techniques have been applied to the study of seeded atomic beams produced by expansion in vacuum. The first technique is a calculation of gas kinetic cross sections based on an improved Lennard-Jones potential. The second one is a new version of the Test Particle Monte Carlo method, able to treat at the same time the flow of majority and seed species in a quasi-continuum flow. Gas kinetic and transport cross sections for He/He and He/Ar scattering are calculated and discussed in comparison with available data. The momentum transfer cross section is included in the Monte Carlo model. Monte Carlo calculations are produced for macroscopic quantities in axial symmetric geometry and discussed in comparison with those obtained assuming rigid sphere scattering. The perspectives opened by the present procedure to seeded molecular beam investigations and to ion reaction studies are also shortly discussed.
Voting in Combinatorial Domains: What Logic and AI Have to Say
Authors: Jérôme Lang
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

This talk is half-way between a survey and a report on ongoing research, most of which is joint work with Vincent Conitzer and Lirong Xia. The first part of the talk owes a lot to two survey papers co-authored with Yann Chevaleyre, Ulle Endriss and Nicolas Maudet [5,6].
Memory Offset Assignment for DSPs
Authors: Jinpyo Hong, J. Ramanujam
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Compact code generation is very important for an embedded system that has to be implemented on a chip with a severely limited amount of size. Even though on-chip data memory optimization technique has been given more attention, on-chip instruction memory optimization should not be neglected. We propose in this paper some algorithms for a memory offset assignment for embedded DSP processors in order to minimize the number of instructions for address register operations. Extensive experimental results demonstrate the efficacy of our solution.
GoodRelations: An Ontology for Describing Products and Services Offers on the Web
Authors: Martin Hepp
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

A promising application domain for Semantic Web technology is the annotation of products and services offerings on the Web so that consumers and enterprises can search for suitable suppliers using products and services ontologies. While there has been substantial progress in developing ontologies for types of products and services, namely eClassOWL, this alone does not provide the representational means required for e-commerce on the Semantic Web. Particularly missing is an ontology that allows describing the relationships between (1) Web resources, (2) offerings made by means of those Web resources, (3) legal entities, (4) prices, (5) terms and conditions, and the aforementioned ontologies for products and services (6). For example, we must be able to say that a particular Web site describes an offer to sell cell phones of a certain make and model at a certain price, that a piano house offers maintenance for pianos that weigh less than 150 kg, or that a car rental company leases out cars of a certain make and model from a set of branches across the country. In this paper, we analyze the complexity of product description on the Semantic Web and define the GoodRelations ontology that covers the representational needs of typical business scenarios for commodity products and services.
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
Authors: Rhonda Chaytor, Patricia A. Evans, Todd Wareham
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k ¿ 1) other records in the dataset. The basic k-anonymization problem, which minimizes the number of dataset entries that must be suppressed to achieve k-anonymity, is NP-hard and hence not solvable both quickly and optimally in general. We apply parameterized complexity analysis to explore algorithmic options for restricted versions of this problem that occur in practice. We present the first fixed-parameter algorithms for this problem and identify key techniques that can be applied to this and other k-anonymization problems.
SEEMP: An Semantic Interoperability Infrastructure for e-Government Services in the Employment Sector
Authors: E. Valle, D. Cerizza, I. Celino, J. Estublier, G. Vega, M. Kerrigan, J. Ramírez, B. Villazon, P. Guarrera, G. Zhao, G. Monteleone
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

This paper presents SEEMP, a marketplace to coordinate and integrate public and private employment services (ESs) around the EU Member States. The need for flexible collaboration in the marketplace gives rise to the issue of interoperability in both data exchange and share of services. SEEMP proposes a mixed approach that relies on the concepts of services and semantics. SEEMP approach combines Software Engineering and Semantic Web methodologies/tools in an infrastructure that allows for a meaningful service-based communication among ESs.
Range-Dependence Compensation Method for Bistatic STAP Radar
Authors: Wenchong Xie, Yongliang Wang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

In this paper, we study the problem of detecting slow-moving targets using space-time adaptive processing (STAP). The construction of the optimum weights at each range implies the estimation of the interference-plus-noise covariance matrix. This is typically done by straight averaging of snapshots at neighboring ranges. However, in most bistatic configurations, snapshot statistics are range dependent. Straight averaging results thus in poor performance. This paper proposes a new method of obtaining an estimate of the covariance matrix using power spectrum registration based on nonuniform frequency sampling technique. Simulation results show a significant improvement in processor performance as compared to conventional STAP methods.
A New Method to Compare Dynamical Systems
Authors: Juan Moreno-Garcia, Jose Jesus Castro-Schez, Luis Jimenez
Venue: Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing (2007)

This work presents a new method to compare two Temporal Fuzzy Chains (TFCs). The TFCs comparison is used to compare the temporal evolution of two dynamical systems (TFCs). Firstly, the two TFCs that represent the two DSs are obtained. After that, the two obtained TFCs are compared, so the similarity of the two TFCs is obtained. This "similarity" is done by using linguistic labels.
A language for specifying compiler optimizations for generic software
Authors: Andrew Lumsdaine
Venue:  (2007)

Compiler optimization is important to software performance, and modern processor architectures make optimization even more critical. However, many modern software applications use libraries providing high levels of abstraction. Such libraries often hinder effective optimization&mdash;the libraries are difficult to analyze using current compiler technology. For example, high-level libraries often use dynamic memory allocation and indirectly expressed control structures, such as iterator-based loops. Programs using these libraries often cannot achieve an optimal level of performance. On the other hand, software libraries have also been recognized as potentially aiding in program optimization. One proposed implementation of library-based optimization is to allow the library author, or a library user, to define custom analyses and optimizations. Only limited systems have been created to take advantage of this potential, however. One problem in creating a framework for defining new optimizations and analyses is how users are to specify them: implementing them by hand inside a compiler is difficult and prone to errors. Thus, a domain-specific language for library-based compiler optimizations would be beneficial. Many optimization specification languages have appeared in the literature, but they tend to be either limited in power or unnecessarily difficult to use. Therefore, I have designed, implemented, and evaluated the Pavilion language for specifying program analyses and optimizations, designed for library authors and users. These analyses and optimizations can be based on the implementation of a particular library, its use in a specific program, or on the properties of a broad range of types, expressed through concepts. The new system is intended to provide a high level of expressiveness, even though the intended users are unlikely to be compiler experts.
A Cross-Cultural Study on Attitudes toward Risk, Safety and Security
Authors: Yumiko Nara
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In this paper, the author aims to examine the status quo of people's attitude toward risk and safety as well as the differences between risk attitudes in Japan, USA and China. The social survey was carried out in February and March of 2008. It used questionnaires to obtain data of people: male and female, 20-69 years, in each country, using random sampling. The survey has clarified the status quo and differences about perception toward 19 items of risk, effects of safety perception and risk image based on people's anxiety. It has been found that Japanese people fear most strongly the bad influence of life risks. The effect of risk image on anxiety was relatively strong in China and Japan, the effect of safety perception was stronger in the US.
Combining Preprocessor Slicing with C/C++ Language Slicing
Authors: László Vidács, Judit Jász, Árpád Beszédes, Tibor Gyimóthy
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

Slicing C programs has been one of the most popular ways for the implementation of slicing algorithms; out of the very few practical implementations that exist many deal with this programming language. Yet, preprocessor related issues have been addressed very marginally by these slicers, despite the fact that ignoring (or handling poorly) these constructs may lead to serious inaccuracies in the slicing results and hence in the comprehension process. Recently, an accurate slicing method for preprocessor related constructs has been proposed which - when combined with existing C/C++ language slicers - can provide a more complete comprehension of these languages. In this paper, we overview our approach for this combination and report its benefits in terms of the completeness of the resulting slices.
THESUS, a Closer View on Web Content Management Enhanced with Link Semantics
Authors: Iraklis Varlamis Michalis Vazirgiannis Maria Halkidi
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

With the unstoppable growth of the World Wide Web, the great success of Web Search Engines, such as Google and Alta-Vista, users now turn to the Web whenever looking for information. However, many users are neophytes when it comes to computer science, yet they are often specialists of a certain domain. These users would like to add more semantics to guide their search through World Wide Web material, whereas currently most search features are based on raw lexical content. We show in this paper how the use of the incoming links of a page can be used efficiently to classify a page in a concise manner. This enhances the browsing and querying of Web pages. In this article, we focus on the tools needed in order to manage the links and their semantics. We further process these links using a hierarchy of concepts, akin to an ontology, and a thesaurus. This work is demonstrated by an prototype system, called THESUS, that organizes thematic Web documents into semantic clusters. Our contributions in this paper are the following: 1) a model and language to exploit link semantics information, 2) the THESUS prototype system, 3) its innovative aspects and algorithms, more specifically, the novel similarity measure between Web documents applied to different clustering schemes (DB-Scan and COBWEB), and 4) a thorough experimental evaluation proving the value of our approach.
Social Odometry in Populations of Autonomous Robots
Authors: Álvaro Gutiérrez, Alexandre Campo, Francisco C. Santos, Carlo Pinciroli, Marco Dorigo
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

The improvement of odometry systems in collective robotics remains an important challenge for several applications. In this work, we propose a localisation strategy in which robots have no access to centralised information. Each robot has an estimate of its own location and an associated confidence level that decreases with distance travelled. Robots use estimates advertised by neighbouring robots to correct their own location estimates at each time-step. This simple online social form of odometry is shown to allow a group of robots to both increase the quality of individuals' estimates and efficiently improve their collective performance. Furthermore, social odometry produces a successful self-organised collective pattern.
A Supervised Subspace Learning Algorithm: Supervised Neighborhood Preserving Embedding
Authors: Xianhua Zeng, Siwei Luo
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

Neighborhood Preserving Embedding (NPE) is an unsupervised manifold learning algorithm with subspace learning characteristic. In fact, NPE is a linear approximation to Locally Linear Embedding (LLE). So it can provide an unsupervised subspace learning technique. In this paper, we proposed a new Supervised Neighborhood Preserving Embedding (SNPE) algorithm which can use the label or category information of training samples to better describe the intrinsic structure of original data in low-dimensional space. Furthermore, when a new unknown data needs to be processed, SNPE, as a supervised subspace learning technique, may be conducted in the original high-dimensional space. Several experiments on USPS digit database demonstrate the effectiveness of our algorithm.
Formalizing `Living Guidelines' Using LASSIE: A Multi-step Information Extraction Method
Authors: Katharina Kaiser, Silvia Miksch
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Living guidelines are documents presenting up-to-date and state-of-the-art knowledge to practitioners. To have guidelines implemented by computer-support they firstly have to be formalized in a computer-interpretable form. Due to the complexity of such formats the formalization process is challenging, but burdensome and time-consuming.The LASSIE methodology supports this task by formalizing guidelines in several steps from the textual form to the guideline representation language Asbru using a document-centric approach. LASSIE uses Information Extraction technique to semi-automatically accomplish these steps.We apply LASSIE to support the implementation of living guidelines. Based on a living guideline published by the Scottish Intercollegiate Guidelines Network (SIGN) we show that adaptations of previously formalized guidelines can be accomplished easily and fast. By using this new approach only new and changed text parts have to be modeled. Furthermore, models can be inherited from previously modeled guideline versions that were added by domain experts.
Constant Complements, Reversibility and Universal View Updates
Authors: Michael Johnson, Robert Rosebrugh
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

The algebraic specification of information systems (including databases) has been advanced by the introduction of category theoretic sketches and in particular by the authors' Sketch Data Model (SkDM). The SkDM led to a new treatment of view updating using universal properties already studied in category theory. We call the new treatment succinctly "universal updating". This paper outlines the theory of universal updating and studies the relationships between it and recent theoretical results of Hegner and Lechtenbörger which in turn studied the classical "constant complement" approach to view updates. The main results demonstrate that constant complement updates are universal, that on the other hand there are sometimes universal updates even in the absence of constant complements, and that in the SkDM constant complement updates are reversible. We show further that there may be universal updates which are reversible even for views which have no complement. In short, the universal updates provide an attractive option including reversibility, even when constant complements are not available. The paper is predominantly theoretical studying different algebraic approaches to information system software but it also has important practical implications since it shows that universal updates have important properties in common with classical updates but they may be available even when classical approaches fail.
An empirical study of hierarchical division for mesh-structured networks
Authors: Dajin Wang
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

A parallel/distributed system consists of a collection of processes, which are distributed over a network of processors, and work in a cooperative manner to fulfill various tasks. A hierarchical approach is to group and organize the distributed processes into a logical hierarchy of multiple levels to achieve better system performance. It has been proposed as an effective way to solve various problems in distributed computing, such as distributed monitoring, resource scheduling, and network routing. In [21], we studied hierarchical configuration for mesh and hypercube networks to the end of achieving better system performance. In particular, we proposed theoretically optimal hierarchy for mesh and hypercube, so that the total traffic flow over the network is minimized. In this paper, we present the experimental results to establish the practical relevance of mesh hierarchy proposed in [21]. We simulated situations for multi-level division, real network loading scenarios, random data aggregation rates, and different division sizes other than derived in [21]. The simulation results not only show that the analytically obtained hierarchy works well for many realistic settings, but also offer some useful insights into the proposed hierarchy scheme.