ppxscal/embedding_network huggingface dataset:
The Contact Scheduling Process of the Galileo Navigation System
Authors: Tiago Franco, Flávio Moreira, Stewart Hall, Henrique Oliveira
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

Galileo [1] is a joint initiative of the European Commission and the European Space Agency (ESA) for the development of a Global Satellite Navigation System. This system will provide a highly accurate, guaranteed global positioning service under civilian control. The fully deployed Galileo system consists of 30 satellites (27 operational + 3 spares) and 5 globally distributed ground stations. The Spacecraft Constellation Planning Facility is the element responsible for generating the plans of contacts between satellites and ground stations for the entire constellation for the purpose of maintenance and corrective actions. This element includes the Contact Scheduler, the component with the scheduling functionalities of generating conflict free Contact Plans. This document describes the Galileo's contact scheduling problem, the design and implementation of the scheduler and the validation results.
Software asset management processes and model
Authors: David Dery
Venue:  (2008)

Au fil des ans, les organisations ont achet&eacute; une quantit&eacute; importante de logiciels et elles doivent maintenant g&eacute;rer les co&ucirc;ts qui y sont associ&eacute;s tout en s'assurant que les termes et conditions des licences soient respect&eacute;s. L'industrie s'accorde sur le besoin d'am&eacute;liorer la gestion des biens de logiciels mais ne s'entend pas sur la fa&ccedil;on de le faire. Cette th&egrave;se propose une d&eacute;finition de ce qu'est la gestion des biens de logiciels et fournit une analyse descriptive ainsi qu'une m&eacute;thode d'&eacute;valuation de l'organisation face &agrave; ces processus afin que l'organisation puisse se servir imm&eacute;diatement des processus. Tout au long de ce projet de recherche, l'auteur de cette th&egrave;se a particip&eacute; activement &agrave; la r&eacute;daction de la norme ISO/1EC 19770-1 sur la gestion des biens de logiciels afin de bien aligner les r&eacute;sultats de cette recherche avec les besoins de l'industrie. 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
Computer-Generated Holograms in Biology and Medicine
Authors: Robert Perlmutter, Stephen Friedland
Venue: IEEE Computer Graphics and Applications (1983)

Holographic images of diagnostic scan data can be invaluable in many medical procedures. The method described here makes possible the efficient computer generation of holograms.
Deformable Image Registration - A Critical Evaluation: Demons, B-Spline FFD and Spring Mass System
Authors: Jian-Kun Shen, Bogdan J. Matuszewski, Lik-Kwan Shark, Andrzej Skalski, Tomasz Zielinski, Christopher J. Moore
Venue: Proceedings of the 2008 Fifth International Conference BioMedical Visualization: Information Visualization in Medical and Biomedical Informatics (2008)

This paper describes results of a quantitative evaluation of a flexible spring mass system image registration technique previously proposed by the authors. The method is assessed against two well-known registration algorithms namely the Demons and the B spline Free Form Deformations (FFD) implemented in Insight Segmentation and Registration Toolkit (ITK). The evaluation has been performed using simulated data as well as real CT images of the radiotherapy prostate and the head and neck patients. Whereas for the simulated data the quality of registration has been measured using the dense displacement field, the discrete anatomical landmarks have been used with the real CT images. The results show the method using spring mass system achieves comparable registration accuracy with the Demons and B-spline FFD for the data with no noise or Gaussian noise, but it outperforms these methods when structured noise is present in the data. Moreover, the method using spring mass system can offer more accurate registration quality if some additional information, in the form of feature landmarks and/or segmented anatomical structures, is available. Throughout the paper a special attention has been given to the effective visualisation of the results.
Personal identity management in the information polity: The case of the UK national identity card
Authors: Paul Beynon-Davies
Venue: Information Polity (2006)

In the Information Society an individual may take on an identity for each electronic service with which he or she engages. As a consequence, an individual may accumulate a vast array of personal identifiers for such 'services' and is also likely to accrue a range of physical representations of such multiple identification: credit card, debit card, driving licence, passport, library card, parking permit etc. Hence, multiple identity management is a significant issue for individuals and organisations. In this paper we unpack this issue in terms of a semiotic framework consisting of three interrelated processes - authentication, identification and enrolment. These processes serve to locate the three elements of the person, identifiers and identity that help define the socio-technical network which comprises the issue of personal identity in the Information Age. We test the explanatory utility of this framework against a contemporary and prominent case from the UK - an attempt by the government to introduce a national identity card. Such an identity token offers numerous potential benefits for individuals and organisations but raises major challenges to data protection, data privacy and public trust in the information governance of the UK.
Model-Based Testing Service on the Web
Authors: Antti Jääskeläinen, Mika Katara, Antti Kervinen, Henri Heiskanen, Mika Maunumaa, Tuula Pääkkönen
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

Model-based testing (MBT) seems to be technically superior to conventional test automation. However, MBT features some difficulties that can hamper its deployment in industrial contexts. We are developing a domain-specific MBT solution for graphical user interface (GUI) testing of Symbian S60 smartphone applications. We believe that such a tailor-made solution can be easier to deploy than ones that are more generic. In this paper, we present a service concept and an associated web interface that hide the inherent complexity of the test generation algorithms and large test models. The interface enables an easy-to-use MBT service based on the well-known keyword concept. With this solution, a better separation of concerns can be obtained between the test modeling tasks that often require special expertise, and test execution that can be performed by testers. We believe that this can significantly speed up the industrial transfer of model-based testing technologies, at least in this context.
A Multi-copy Join Optimization of Information Integration Systems Based on a Genetic Algorithm
Authors: Liying Fang, Pu Wang, Jianzhuo Yan
Venue: Proceedings of the 2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008) (2008)

In view of inevitable redundancies in local data sources in heterogeneous information integration systems, a multi-copy join optimization method (MuCoJo for short) based on a genetic algorithm is proposed. MuCoJo can choose appropriate redundant copies of the tables to participate a joint query and optimizes the join order of it. By using the redundant copies, MuCoJo enlarges the search space so that the concurrent executions of different local sources can be best used. Meanwhile, MuCoJo could take advantage of redundancies features in such systems and get faster joint query response time. Experimental results show the computational efficiency of the MuCoJo and its necessity in information integration system. Moreover, during the population initialization, controlling invalid solutions can reduce the search space effectively at the cost of initialization time consuming.
Radial Basis Function Neural Network Predictor for Parameter Estimation in Chaotic Noise
Authors: Hongmei Xie, Xiaoyi Feng
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

Chaotic noise cancellation has potential application in both secret communication and radar target identification. To solve the problem of parameter estimation in chaotic noise, a novel radial basis function neural network (RBF-NN) -based chaotic time series data modeling method is presented in this paper. Together with the spectral analysis technique, the algorithm combines neural network's ability to approximate any nonlinear function. Based on the flexibility of RBF-NN predictor and classical amplitude spectral analysis technique, this paper proposes a new algorithm for parameter estimation in chaotic noise. Analysis of the proposed algorithm's principle and simulation experiments results are given out, which show the effective of the proposed method. We conclude that the study has potential application in various fields as in secret communication for narrow band interference rejection or attenuation and in radar signal processing for weak target detection and identification in sea clutter.
A novel migration-based NUCA design for chip multiprocessors
Authors: Mahmut Kandemir, Feihui Li, Mary Jane Irwin, Seung Woo Son
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

Chip Multiprocessors (CMFs) and Non-Uniform Cache Architectures (NUCAs) represent two emerging trends in computer architecture. Targeting future CMP based systems with NUCA type L2 caches, this paper proposes a novel data migration algorithm for parallel applications and evaluates it. The goal of this migration scheme is to determine a suitable location for each data block within a large L2 space at any given point during execution. A unique characteristic of the proposed scheme is that it models the problem of optimal data placement in the L2 cache space as a two-dimensional post office placement problem, presents a practical architectural implementation of this model, and gives a detailed evaluation of the proposed implementation. In our experimental evaluation, we also compare our approach to a previously-proposed NUCA management scheme using applications from the specomp suite, oltp, specjbb, and specweb. These experiments show that our migration approach generates about 35% improvement, on average, in average L2 access latency over the previous migration scheme, and these L2 latency savings translate, on average, to 9.5% improvement in IPC (instructions per cycle). We also observed during our experiments that both the careful initial placement of data (which itself triggers migrations within the L2 space) and subsequent migrations (due to inter-processor data sharing) play an important role in achieving our performance improvements.
Marrying Words and Trees
Authors: Rajeev Alur
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

We discuss the model of nested words for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linear-hierarchical structure include annotated linguistic data, executions of structured programs, and HTML/XML documents. Nested words generalize both words and ordered trees, and allow both word and tree operations. We define nested word automata--finite-state acceptors for nested words, and show that the resulting class of regular languages of nested words has all the appealing theoretical properties that the classical regular word languages enjoy such as determinization, closure under a variety of operations, decidability of emptiness as well as equivalence, and characterization using monadic second order logic. The linear encodings of nested words gives the class of visibly pushdown languages of words, and this class lies between balanced languages and deterministic context-free languages. We argue that for algorithmic verification of structured programs, instead of viewing the program as a context-free language over words, one should view it as a regular language of nested words (or equivalently, as a visibly pushdown language), and this would allow model checking of many properties (such as stack inspection, pre-post conditions) that are not expressible in existing specification logics. We also study the relationship between ordered trees and nested words, and the corresponding automata: while the analysis complexity of nested word automata is the same as that of classical tree automata, they combine both bottom-up and top-down traversals, and enjoy expressiveness and succinctness benefits over tree automata. There is a rapidly growing literature related to nested words, and we will briefly survey results on languages infinite nested words, nested trees, temporal logics over nested words, and new decidability results based on visibility.
Note separation of polyphonic music by energy split
Authors: Kristóf Aczél, István Vajk
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

A polyphonic musical recording is the superposition of many separate tracks which are downmixed to fewer channels. Decomposition of such a signal to separate instrument tracks or notes has always been a challenge. It is theoretically impossible to extract the component tracks without the information that was lost at the superposition. In this paper a new way of sound separation of mono-aural digital recordings is proposed where lost information is recovered by using a model of real instruments in order to make the separation of individual musical notes possible.
Graph Structural Mining in Terrorist Networks
Authors: Muhammad Akram Shaikh, Jiaxin Wang, Zehong Yang, Yixu Song
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

Law enforcement agencies and intelligence analysts frequently face the problems of identifying the actor importance and possible roles among a specific group of entities in a terrorist network. However, such tasks can be fairly time consuming and labor-intensive without the help of some efficient methods. In this paper we will discuss how graph structural mining is applied in the context of terrorist networks using structural measures or properties from social network analysis (SNA) research. Structural properties are determined by the graph structure of the network. These properties are used to evaluate the relationship between entities and identifying different roles. The graph structural mining concept is also demonstrated by using publicly available data on terrorists network in two ways i.e., one for identifying different roles (leaders, brokers, and outliers) known as role structural mining and other for ranking important actors known as rank structural mining. In addition to this we also illustrate how terrorist network is disrupt by knowing the actor importance in a network using rank structural mining.
Influence of Neural Delay in Sensorimotor Systems on the Control Performance and Mechanism in Bicycle Riding
Authors: Yusuke Azuma, Akira Hirose
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Neural sensorimotor systems have unavoidable delay in the processing. In this paper, we investigate the influence of the delay on its control performance and mechanism in numerical experiment with a simple network. The result suggests not only the fact that the delay degrades control performance of reflex motion in proportion to the amount of the delay, but also that the delay influences signal generation for relevant volitional motion. A moderate delay can even be in favor of volitional motion learning. The motion generation mechanism also seems dependent on the amount of delay. That is, a feedback strategy changes into a feedforward one with rough prediction.
Context-Dependent Adaptive Behavior Generated in the Theta Phase Coding Network
Authors: Hiroaki Wagatsuma, Yoko Yamaguchi
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

The real world changes in space over time. Our brains need real-time interaction with the external world and will update various internal representations even when events happen only one-time. Such one-time experiences are evaluated in relation to what happens for us in joy and sorrow. Recent brain studies suggest that the dynamic coordination of different representations in brain areas is governed by the synchronization of the brain oscillation, such as theta rhythms. In the rodent hippocampus, the temporal coding mechanism with the theta rhythm, theta phase coding, provides the ability to encode and retrieve behavioral sequences even in the one-time experience, by using successive firing phases in every theta cycle. We here extended the theory to the large-scale brain network and hypothesized that the phase coding not only represents the current behavioral context, but also properly associates it with the evaluation of what happened in the external environment. It is necessary for the animal to predict events in the near future and to update the current and next executive action. In a maze task on our robotic platform, the acquisition of spatial-temporal sequences and spatial-reward associations were demonstrated, even in few trials, and the association contributes to the current action selection. This result suggests that theta rhythms may contribute to coordinate different neural activities to enable contextual decision-making in the real environment.
Graph Transformation for Topology Modelling
Authors: Mathieu Poudret, Agnès Arnould, Jean-Paul Comet, Pascale Gall
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our proposal is motivated by the need of describing specific operations to be done on topological representations of objects in computer graphics, especially for simulation of complex structured systems where rearrangements of compartments are subject to change. We also define application of such meta-rules and prove that it preserves some necessary conditions for G-maps.
Optimization Strategies Using Hybrid MPI+OpenMP Parallelization for Large-Scale Data Visualization on Earth Simulator
Authors: Li Chen, Issei Fujishiro
Venue: Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era (2007)

An efficient parallel visualization library has been developed for the Earth Simulator. Due to its SMP cluster architecture, a three-level hybrid parallel programming model, including message passing for inter-SMP node communication, loop directives by OpenMP for intra-SMP node parallelization and vectorization for each processing element (PE) was adopted. In order to get good speedup performance with OpenMP parallelization, many strategies are used in implementing the visualization modules such as thread parallelization by OpenMP considering seed point distributions and flow features for parallel streamline generation, multi-coloring reordering to avoid data race of shared variables, some kinds of coherence removal, and hybrid image-space and object-space parallel for volume rendering. Experimental results on the Earth Simulator demonstrate the feasibility and effectiveness of our methods.
Distributed Verification of Mixing - Local Forking Proofs Model
Authors: Jacek Cichoń, Marek Klonowski, Mirosław Kutyłowski
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

One of generic techniques to achieve anonymity is to process messages through a batch of cryptographic mixes. In order to guarantee proper execution verifiable mixes are constructed: each mix provides a proof of correctness together with its output. However, if a mix is working on a huge number of messages at a time, the proof itself is huge since it concerns processing all messages. So in practice only a few verifiers would download the proofs and in turn we would have to trust what they are saying.We consider a different model in which there are many verifiers, but each of them is going to download only a limited number of bits in order to check the mixes. Distributed character of the process ensures effectiveness even if many verifiers are dishonest and do not report irregularities found.We concern a fully distributed and intuitive verification scheme which we call local forking proofs. For each intermediate ciphertext a verifier may ask for a proof that its re-encrypted version is in the output of the mix concerned. The proof shows that the re-encrypted version is within some subset of k ciphertexts from the output of the mix, and it can be performed with strong zero-knowledge or algebraic methods. They should work efficiently concerning communication complexity, if k is a relatively small constant.There are many issues concerning stochastic properties of local forking proofs. In this paper we examine just one: we estimate quite precisely how many mixes are required so that if a local proof is provided for each message, then a plaintext hidden in an input message can appear on any position of the final output set.
Transductive Learning from Relational Data
Authors: Michelangelo Ceci, Annalisa Appice, Nicola Barile, Donato Malerba
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Transduction is an inference mechanism "from particular to particular". Its application to classification tasks implies the use of both labeled (training) data and unlabeled (working) data to build a classifier whose main goal is that of classifying (only) unlabeled data as accurately as possible. Unlike the classical inductive setting, no general rule valid for all possible instances is generated. Transductive learning is most suited for those applications where the examples for which a prediction is needed are already known when training the classifier. Several approaches have been proposed in the literature on building transductive classifiers from data stored in a single table of a relational database. Nonetheless, no attention has been paid to the application of the transduction principle in a (multi-)relational setting, where data are stored in multiple tables of a relational database. In this paper we propose a new transductive classifier, named TRANSC, which is based on a probabilistic approach to making transductive inferences from relational data. This new method works in a transductive setting and employs a principled probabilistic classification in multi-relational data mining to face the challenges posed by some spatial data mining problems. Probabilistic inference allows us to compute the class probability and return, in addition to result of transductive classification, the confidence in the classification. The predictive accuracy of TRANSC has been compared to that of its inductive counterpart in an empirical study involving both a benchmark relational dataset and two spatial datasets. The results obtained are generally in favor of TRANSC, although improvements are small by a narrow margin.