ppxscal/embedding_network huggingface dataset:
Examining Statistics of Workflow Evolution Provenance: A First Study
Authors: Lauro Lins, David Koop, Erik W. Anderson, Steven P. Callahan, Emanuele Santos, Carlos E. Scheidegger, Juliana Freire, Cláudio T. Silva
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Provenance (also referred to as audit trail, lineage, and pedigree) captures information about the steps used to generate a given data product. Such information provides documentation that is key to determining data quality and authorship, and necessary for preserving, reproducing, sharing and publishing the data. Workflow design, in particular for exploratory tasks (e.g., creating a visualization, mining a data set), requires an involved, trial-and-error process. To solve a problem, a user has to iteratively refine a workflow to experiment with different techniques and try different parameter values, as she formulates and test hypotheses. The maintenance of detailed provenance (or history) of this process has many benefits that go beyond documentation and result reproducibility. Notably, it supports several operations that facilitate exploration, including the ability to return to a previous workflow version in an intuitive way, to undo bad changes, to compare different workflows, and to be reminded of the actions that led to a particular result [2].
A comprehensive theory of trichotomous evaluative linguistic expressions
Authors: Vilém Novák
Venue: Fuzzy Sets and Systems (2008)

In this paper, a logical theory of the, so-called, trichotomous evaluative linguistic expressions (TEv-expressions) is presented. These are frequent expressions of natural language, such as ''small, very small, roughly medium, extremely big'', etc. The theory is developed using the formal system of higher-order fuzzy logic, namely the fuzzy type theory (generalization of classical type theory). First, we discuss informally what are properties of the meaning of TEv-expressions. Then we construct step by step axioms of a formal logical theory T^E^v of TEv-expressions and prove various properties of T^E^v. All the proofs are syntactical and so, our theory is very general. We also outline construction of a canonical model of T^E^v. The main elegancy of our theory consists in the fact that semantics of all kinds of evaluative expressions is modeled in a unified way. We also prove theorems demonstrating that essential properties of the vagueness phenomenon can be captured within our theory.
Modeling and Simulation of Biochemical Processes Using Stochastic Hybrid Systems: The Sugar Cataract Development Process
Authors: Derek Riley, Xenofon Koutsoukos, Kasandra Riley
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

As biomedical research advances there is an increasing need to model and simulate more complicated systems to better understand them. Since biochemical processes are inherently stochastic and often contain both continuous and discrete behavior, stochastic hybrid systems are an ideal modeling paradigm for capturing their dynamics. In this paper we present a framework for modeling biochemical systems and demonstrate the approach for the sugar cataract development process including two methods of modeling drug treatment. Further, we present a simulation method that uses second-order Taylor approximations for the continuous dynamics and an improved method for detecting boundary hits. We use the sugar cataract development process to demonstrate the results of the method.
Efficiency of parallel genetic algorithm for solving N-queens problem on multicomputer platform
Authors: Milena Lazarova
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

The paper investigates the efficiency of parallel genetic algorithm for solving N-queens problem on a multicomputer platform. The proposed parallel computational model of the genetic algorithm is based on a parallel algorithmic paradigm of synchronous iterations. Dynamic migration of randomly selected chromosomes in a bidirectional circular model is utilized. The algorithm is implemented using both flat (pure MPI) and hybrid (MPI+OpenMP) programming models. The target parallel multicomputer platform is a cluster of SMPs. Performance profiling and scalability analyses have been made in respect of both the workload (board size) and the size of the parallel system.
Synthesizing scalable system software for wireless sensor networks
Authors: Raju Pandey
Venue:  (2007)

Sensor networks are being deployed at massive scales, containing a range of sensors and underlying computing platforms. Programming paradigms for sensor networks should meet the attendant challenges of scale and heterogeneity. Furthermore, with sensor networks expected to be deployed for long periods of time, the ability to reprogram them remotely is necessary in order to provide new services, fix bugs, and enhance applications and system software. The operating system and whole system reprogramming approach in use today will have limited use in the future, given the envisioned scales of sensor network deployments. In order to address this challenge, researchers have treated virtual machines as system software. However, to satisfy the resource limitations of sensor nodes, they usually export only a minimal set of services to the application programmer. This makes applications of even moderate complexity difficult to implement.In this dissertation, methods to implement virtual machines that scale and export comprehensive service-suites on a per-application basis are presented. The use of fine-grained software synthesis and scaling to build resource-efficient system software is advocated, and a new incremental linking technique to reduce the cost of application evolution to facilitate both application changes and system software upgrades at run-time is introduced, as is the design and implementation of VM&star;&mdash;a framework for building resource-efficient virtual machines that embodies this philosophy. I show how VM&star; is effective in meeting the difficult demands of heterogeneity and reprogrammability in wireless sensor networks through the cooperating use of software synthesis techniques, virtual machine system software, and incremental update. A major impediment to the widespread adoption of virtual machines is the high performance overhead&mdash;to this end. I describe various techniques to optimize system software and provide guidelines for designing efficient virtual machines for resource-constrained computing platforms.
Learning task-specific trust decisions
Authors: Ikpeme Erete, Erin Ferguson, Sandip Sen
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We study the problem of agents locating other agents that are both capable and willing to help complete assigned tasks. An agent incurs a fixed cost for each help request it sends out. To minimize this cost, the performance metric used in our work, an agent should learn based on past interactions to identify agents likely to help on a given task. We compare three trust mechanisms: success-based, learning-based, and random. We also consider different agent social attitudes: selfish, reciprocative, and helpful. We evaluate the performance of these social attitudes with both homogeneous and mixed societies. Our results show that learning-based trust decisions consistently performed better than other schemes. We also observed that the success rate is significantly better for reciprocative agents over selfish agents.
Grid Computing in Time-Dependent Quantum Reactive Dynamics
Authors: Amaia Saracibar, Carlos Sánchez, Ernesto Garcia, Antonio Laganà, Dimitris Skouteris
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

A study of the dependence of the cross section on the rotational energy for the N + N2 reaction is presented. Cross sections have been calculated using a time-dependent quantum method and applying the centrifugal sudden approximation. This approximation decouples the projections of the total angular momentum and therefore breaks the calculations into several thousand runs suitable for distribution on a computing Grid. In order to handle this computational burden a procedure managing the submission of jobs and the subsequent retrieval of results has been designed. The procedure has been implemented on the EGEE production Grid and the related performance has been measured.
Mechanisms for database intrusion detection and response
Authors: Ashish Kamra, Elisa Bertino, Guy Lebanon
Venue: Proceedings of the 2nd SIGMOD PhD workshop on Innovative database research (2008)

Data represent today a valuable asset for companies and organizations and must be protected. Most of an organization's sensitive and proprietary data resides in a Database Management System (DBMS). The focus of this thesis is to develop advanced security solutions for protecting the data residing in a DBMS. Our strategy is to develop an Intrusion Detection (ID) mechanism, implemented within the database server, that is capable of detecting anomalous user requests to a DBMS. The key idea is to learn profiles of users and applications interacting with a database. A database request that deviates from these profiles is then termed as anomalous. A major component of this work involves prototype implementation of this ID mechanism in the Post-greSQL database server. We also propose to augment the ID mechanism with an Intrusion Response engine that is capable of issuing an appropriate response to an anomalous database request.
The magic lens box: simplifying the development of mixed reality games
Authors: Richard Wetzel, Irma Lindt, Annika Waern, Staffan Johnson
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

Mixed Reality games are becoming more and more popular these days and offer unique experiences to the players. However, development of such games typically still requires expert knowledge and access to Mixed Reality toolkits or frameworks. In this paper, we present the so-called Magic Lens Box that follows a different approach. Based on standard hardware The Magic Lens Box enables game designers with little technological background to create their own Mixed Reality games in a simple yet powerful fashion. We further outline the development process of the magic Lens Box, describe the conceptual model behind it and discuss three games that have been developed with our system. Evaluation of these games shows the viability of our approach, enabling the creation of a variety of rather different Mixed reality games while keeping the development process simple.
Ugo Montanari and Concurrency Theory
Authors: Roberto Gorrieri
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

This short note introduces the reader to the contributed papers in the area of concurrency theory that have been written in honour of Ugo Montanari. I also draw the attention to one of the contributions of Ugo in this area that, in my opinion, constitutes a pearl in theoretical computer science and would deserve to be investigated further.
A Funny Thing Happened on the Way to the Marketplace
Authors: S. W. Smith, Jothy Rosenberg, Adam Golodner
Venue: IEEE Security and Privacy (2003)

This installment of Secure Systems explores this marketplace dimension of building secure systems in the real world. Besides the technology, what else should we consider? Jothy Rosenberg, founder, CEO and CTO of Service Integrity a Web service monitoring and analysis software firm, and Adam Golodner, Associate Director for Policy at the Institute for Security Technology Studies, offered some insight into the subject.
User's gestural exploration of different virtual agents' expressive profiles
Authors: Matthieu Courgeon Jean-Claude Martin
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Designing affective user interfaces involving expressive characters raises several questions. The system should be able to display facial expressions of complex emotions as dynamic and realtime reactions to user's inputs. From a cognitive point of view, designers need to know how the user will perceive the dynamics of these facial expressions as a function of his/her input. We aim at evaluating if users can perceive different expressive profiles of a virtual character by manually controlling its expressions and observing its reaction to his/her input. This paper describes our platform that enables a virtual character to display blended facial expressions of emotions as realtime continuous reactions to users' gesture input. We explain the techniques underlying the computation of intermediate facial expressions of emotion, and their control in the 3D space PAD (Pleasure, Arousal, Dominance) using gesture input. Preliminary results of a perceptive study show the potential of such an approach for assessing the dynamics of the perception of emotional expressions during gesture interaction with virtual characters endowed with different expressive profiles.
Neuro-IG: A Hybrid System for Selection and Elimination of Predictor Variables and non Relevant Individuals
Authors: Baghdad Atmani_aff1n2, Bouziane Beldjilali
Venue: Informatica (2007)

In this article we present the general architecture of a hybrid neuro-symbolic system for the selection and stepwise elimination of predictor variables and non-relevant individuals for the construction of a model. Our purpose is to design tools for extracting the relevant variables and the relevant individuals for an automatic training from data. The objective is to reduce the complexity of storage, therefore the complexity of calculation, and to gradually improve the performance of ordering, that is to say to arrive at a good quality training.
TEC-Tree: A Low-Cost, Parallelizable Tree for Efficient Defense Against Memory Replay Attacks
Authors: Reouven Elbaz, David Champagne, Ruby B. Lee, Lionel Torres, Gilles Sassatelli, Pierre Guillemin
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

Replay attacks are often the most costly attacks to thwart when dealing with off-chip memory integrity. With a trusted System-on-Chip, the existing countermeasures against replay require a large amount of on-chip memory to provide tamper-proof storage for metadata such as hash values or nonces. Tree-based strategies can be deployed to reduce this unacceptable overhead; for example, the well-known Merkle tree technique decreases this overhead to a single hash value. However, it comes at the cost of performance-killing characteristics for embedded systems --- e.g. non-parallelizable hash computations on tree updates. In this paper, we propose an alternative solution: the Tamper-Evident Counter Tree (TEC-Tree). It allows for tamper-evident off-chip storage of the nonces involved in a replay countermeasure; TEC-Tree parallelizes the computations involved in both the authentication and tree update processes. Moreover, because our tree relies on block encryption, it provides data confidentiality at no extra cost. TEC-Tree is a deployable solution for memory integrity, with low performance hit and hardware cost.
Realizations and LP
Authors: Melvin Fitting
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

LP can be seen as a logic of knowledge with justifications. Artemov's Realization Theorem says justifications can be extracted from validities in the Hintikka-style logic of knowledge S4, where they are not explicitly present. We provide tools for reasoning about justifications directly. Among other things, we provide machinery for combining two realizations of the same formula, and for replacing subformulas by equivalent subformulas. The results are algorithmic in nature--semantics for LP plays no role. We apply our results to provide a new algorithmic proof of Artemov's Realization Theorem itself.
Automated Preoperative Planning of Femoral Component for Total Hip Arthroplasty (THA) from 3D CT Images
Authors: Itaru Otomaru, Masahiko Nakamoto, Masaki Takao, Nobuhiko Sugano, Yoshiyuki Kagiyama, Hideki Yoshikawa, Yukio Tada, Yoshinobu Sato
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

This paper describes a method for 3D automated preoperative planning of the femoral stem in total hip arthroplasty (THA). The stem planning is formulated as a problem to determine the optimal position, rotation, and size, on the 3D surface model of femur reconstructed from CT images. We obtain the parameters that maximize the fitness between the femoral canal and stem surfaces subject to the positional and rotational constraints. The maximization is performed by local optimization from multiple initial positions. The proposed method was experimentally evaluated by the difference from planning results of an experienced surgeon in 7 cases. The average positional and rotational differences were 1.9 mm and 2.5 deg., respectively, and there was size difference only in 1 case for the proposed method while these differences were 2.8 mm, 5.0 deg., and 5 cases for an existing method. The proposed method showed better performance than the existing method.
Noun Compound Interpretation Using Paraphrasing Verbs: Feasibility Study
Authors: Preslav Nakov
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

The paper addresses an important challenge for the automatic processing of English written text: understanding noun compounds' semantics. Following Downing (1977) [1], we define noun compounds as sequences of nouns acting as a single noun, e.g., bee honey, apple cake, stem cell, etc. In our view, they are best characterised by the set of all possible paraphrasing verbs that can connect the target nouns, with associated weights, e.g., malaria mosquito can be represented as follows: carry (23), spread (16), cause (12), transmit (9), etc. These verbs are directly usable as paraphrases, and using multiple of them simultaneously yields an appealing fine-grained semantic representation.In the present paper, we describe the process of constructing such representations for 250 noun-noun compounds previously proposed in the linguistic literature by Levi (1978) [2]. In particular, using human subjects recruited through Amazon Mechanical Turk Web Service, we create a valuable manually-annotated resource for noun compound interpretation, which we make publicly available with the hope to inspire further research in paraphrase-based noun compound interpretation. We further perform a number of experiments, including a comparison to automatically generated weight vectors, in order to assess the dataset quality and the feasibility of the idea of using paraphrasing verbs to characterise noun compounds' semantics; the results are quite promising.
Taming Web Services from the Wild
Authors: M. Brian Blake, Michael F. Nowlan
Venue: IEEE Internet Computing (2008)

Service-oriented computing is about building new cross-organizational applications by combining, composing, consuming, or interconnecting existing services. So, why do most composite Web service-based systems currently rely on pre-established relationships that aren't created by automated, dynamic discovery and integration? One perceived reason is the inconsistency in service-based interface descriptions and message names. Here, the authors investigate whether human nature — specifically, software developers' tendencies to name service descriptions in significantly consistent ways — can provide syntactical methods for service discovery.
GPU-Accelerated Montgomery Exponentiation
Authors: Sebastian Fleissner
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

The computing power and programmability of graphics processing units (GPUs) has been successfully exploited for calculations unrelated to graphics, such as data processing, numerical algorithms, and secret key cryptography. In this paper, a new variant of the Montgomery exponentiation algorithm that exploits the processing power and parallelism of GPUs is designed and implemented. Furthermore, performance tests are conducted and the suitability of the proposed algorithm for accelerating public key encryption is discussed.
SuperDreamCity: An Immersive Virtual Reality Experience That Responds to Electrodermal Activity
Authors: Doron Friedman, Kana Suji, Mel Slater
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

In this paper we describe an artistic exhibition that took place in our highly-immersive virtual-reality laboratory. We have allowed visitors to explore a virtual landscape based on the content of night dreams, where the navigation inside the landscape was based on an online feedback from their electrodermal response. We analyze a subset of the physiology data captured from participants and describe a new method for analyzing dynamic physiological experiences based on hidden Markov models.
Providing Relative Service Differentiation to TCP Flows over Split-TCP Geostationary Bandwidth on Demand Satellite Networks
Authors: Wei Koong Chai, Merkourios Karaliopoulos, George Pavlou
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

We propose a combined transport --- medium access control (MAC) layer scheme to provide relative service differentiation to Transmission Control Protocol (TCP) flows over a geostationary (GEO) bandwidth on demand (BoD) satellite networks. Our approach involves the joint configuration of TCP-Performance Enhancing Proxy (TCP-PEP) agents at the transport layer and the scheduling algorithm controlling the resource allocation at the MAC layer. The scheme is independent of the TCP variant used in the network. Extensive simulation results show that the two mechanisms exhibit complementary behavior in achieving the desired differentiation throughout the traffic load space: the TCP-PEP agents control differentiation at low system utilization, whereas the MAC scheduler becomes the dominant differentiation factor at high load.
HRG: A Graph Structure for Fast Similarity Search in Metric Spaces
Authors: Omar U. Florez, Seungjin Lim
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

Indexing is the most effective technique to speed up queries in databases. While traditional indexing approaches are used for exact search, a query object may not be always identical to an existing data object in similarity search. This paper proposes a new dynamic data structure called Hypherspherical Region Graph (HRG) to efficiently index a large volume of data objects as a graph for similarity search in metric spaces. HRG encodes the given dataset in a smaller number of vertices than the known graph index, Incremental-RNG, while providing flexible traversal without incurring backtracking as observed in tree-based indices. An empirical analysis performed on search time shows that HRG outperforms Incremental-RNG in both cases. HRG, however, outperforms tree-based indices in range search only when the data dimensionality is not so high.