ppxscal/embedding_network huggingface dataset:
Graph-based mobility model for urban areas fueled with real world datasets
Authors: Jochen Koberstein, Hagen Peters, Norbert Luttenberger
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Mobile ad-hoc networks (MANETs) and especially mobile Wireless Sensor Networks (mWSNs) are embedded in the environment and therefore stand under strong influence of its specific characteristics. Beside e.g. sensor input, nodes motion patterns are supposed to be a very basic factor regarding performance. Hence simulations may need to account scenario specific mobility patterns while keeping the tradeoff related to simulation complexity in mind. This contribution proposes a graph based mobility model, designed to resemble probabilistic node movements according to real world node paths like they may be induced by road grids. The model is presented along with a real world mWSN sample deployment from which the paths are extracted and against which the simulation fine-tuned.
A Method for Semi-automatic Standard Integration in Systems Biology
Authors: Dagmar Köhn, Lena Strömbäck
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

The development of standards for biological pathways has led to a huge amount of model data stored in a variety of different formats represented in XML (e.g. SBML) or OWL (e.g. BioPAX). There is an urgent need for the conversion of data between the formats, but the fact that the transformation is hard to realize hampers the integration of data in the area. This article proposes a general, semi-automatic solution by transforming XML Schema based data into an OWL format. Biologists will be supported in querying data of any format and comparing different data files or schemas to each other using OWL as a common format for matching. Additionally, a backwards transformation to XML Schema is provided. The paper presents a first architectural approach and its prototype implementation. The evaluation showed that the approach is promising.
Monotonic Abstraction in Action
Authors: Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

We consider verification of safety properties for parameterized distributed protocols. Such a protocol consists of an arbitrary number of (infinite-state) processes that communicate asynchronously over FIFO channels. The aim is to perform parameterized verification, i.e., showing correctness regardless of the number of processes inside the system. We consider two non-trivial case studies: the distributed Lamport and Ricart-Agrawala mutual exclusion protocols. We adapt the method of monotonic abstraction that considers an over-approximation of the system, in which the behavior is monotonic with respect to a given pre-order on the set of configurations. We report on an implementation which is able to fully automatically verify mutual exclusion for both protocols.
Homography-Based Tracking Control for Mobile Robots
Authors: Carlos Soria, Lizardo Pari, Ricardo Carelli, José M. Sebastián, A. Traslosheros
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This work presents a control strategy that allows a follower robot to track a target vehicle moving along an unknown trajectory with unknown velocity. It uses only artificial vision to establish both the robot's position and orientation relative to the target. The control system is proved to be asymptotically stable at the equilibrium point, which corresponds to the navigation objective. Experimental results with two robots, a leader and a follower, are included to show the performance of the proposed vision-based tracking control system.
A heuristic algorithm for the scheduling problem of parallel machines with mold constraints
Authors: Tzung-Pei Hong, Pei-Chen Sun, Shin-Dai Li
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

This paper addresses the scheduling problem of parallel machines with mold constraints. Each machine has to load one kind of molds to process a specific job in the production environment. Because it takes lots of time to change one mold to another on a same machine for producing jobs with different types, it will be efficient to put all similar jobs together as a batch production. This way will, however, result in the total tardiness of jobs increasing due to the different due dates of jobs. This kind of problems is an NP-hard problem. In the paper, we build a model to describe the problem and present a heuristic algorithm to solve it.
Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
Authors: Morgan Magnin, Didier Lime, Olivier (H. Roux
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Contrary to TPNs, SwPNs encompass the notion of actions that can be reset, stopped and started. Models can be defined either with discrete-time or dense-time semantics. Unlike dense-time, discrete-time leads to combinatorial explosion (state space is computed by an exhaustive enumeration of states). We can however take advantage from discrete-time, especially when it comes to SwPNs: state and marking reachability problems, undecidable even for bounded nets, become decidable once discrete-time is considered. Thus, to mitigate the issue of combinatorial explosion, we now aim to extend the well-known symbolic handling of time (using convex polyhedra) to the discrete-time setting. This is basically done by computing the state space of discrete-time nets as the discretization of the state space of the corresponding dense-time model. First, we prove that this technique is correct for TPNs but not for SwPNs in general: in fact, for the latter, it may add behaviors that do not really belong to the evolution of the discrete-time net. To overcome this problem, we propose a splitting of the general polyhedron that encompasses the temporal information of the net into an union of simpler polyhedra which are safe with respect to the symbolic successor computation. We then give an algorithm that computes symbolically the state space of discrete-time SwPNs and finally exhibit a way to perform TCTL model-checking on this model.
Computer Networks
Authors: C. G. Bell
Venue: Computer (1970)

Computer networks have the ability to bring the power of large machines to work on a single problem and to provide reliable computer services to large populations. They also may become an unmanageable structure that can cripple itself in a fashion akin to the great Northeast power failure in 1965. Imagine the following sequence: computer X does not have the sine subprogram but relies on computer Y for it; computer Y on the other hand solves the sine subprogram using the cosine subprogram which it doesn't have; computer Y therefore calls X for a cosine; X solves for cosine using sine which it asks Y for.& Of course, you say, no computer network would be so simplistic. But would you guarantee it could never happen for any set of computer resources among N computers-and that the network might not head for the buried recursive disaster like a lemming for a cliff?
Face view synthesis using a single image
Authors: Henry Schneiderman
Venue:  (2007)

Face view synthesis involves using one view of a face to artificially render another view. It is an interesting problem in computer vision and computer graphics, and can be applied in the entertainment industry for animated movies and video games. The fact that the input is only a single image, makes the problem very difficult. Previous approaches learn a linear model on pair of poses from 2D training data and then predict the unknown pose in the test example. Such 2D approaches are much more practical than approaches requiring 3D data and more computationally efficient. However they perform inadequately when dealing with large angles between poses. In this thesis, we seek to improve performance through better choices in probabilistic modeling. As a first step, we have implemented a statistical model combining distance in feature space (DIPS) and distance from feature space (DFFS) for such pair of poses. Such a representation leads to better performance. As a second step, we model the relationship between the poses using a Bayesian network. This representation takes advantage of the sparse statistical structure of faces. In particular, we have observed that a given pixel is often statistically correlated with only a small number of other pixel variables. The Bayesian network provides a concise representation for this behavior reducing the susceptibility to over-fitting. Compared with the linear method, the Bayesian network more accurately predicts small and localized features.
Modulatory Influence of Motivations on a Schema-Based Architecture: A Simulative Study
Authors: Giovanni Pezzulo, Gianguglielmo Calvi
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

We analyze the role of motivations in living organisms, and the nature of their influences on behavior with the aim to propose a design methodology for schema-based agent architectures. We propose that motivations have a modulatory influence on behavior, and in our design methodology they regulate the allocation of resources to the sensorimotor system and schemas. We describe an agent architecture incorporating this principle and we highlight its performance in a simulative study.
Doping-induced structure and property variations in alkali-cluster halides: Li$_{13}$F & Li$_{13}$F$_{2}$
Authors: Fedor Y. Naumkin
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

Thirteen-atom lithium cluster mono- and di-fluorides are investigated at a DFT level of theory in both neutral and ionic states. The original shape of the metal moiety undergoes a spectrum of transformations for different spin multiplicities and charges (and relative locations of F atoms in di-fluorides), though in most cases preserving the original pattern of Li-Li bonds. There exists a series of Li$_{13}$F$_{2}$ isomers originating from (higher-energy) closed-shell Li$_{13}$F with the metal-moiety compressed along the system axis, which represent the lowest-energy states of the clusters. The "compressed" Li$_{13}$F isomer shows unusual charge-layers in the direction from the F atom. Natural-charge distributions exhibit always negative central Li atom of the Li$_{13}$ moiety strongly polarized by the fluorines, the value of the charge on Li$_{central}$ changing oppositely to the overall charge of the system. Extra charges in cluster ions concentrate entirely on the metal moiety, making it an "extreme superhalogen" in the anionic system. Addition of the F atoms to Li$_{13}$ affects the electron affinity and ionization energy of the system moderately for the 1st and very weakly for the 2nd fluorine.
Biomedical Signal and Image Processing for Decision Support in Heart Failure
Authors: Franco Chiarugi, Sara Colantonio, Dimitra Emmanouilidou, Davide Moroni, Ovidio Salvetti
Venue: Proceedings of the 3rd international conference on Advances in Mass Data Analysis of Images and Signals in Medicine, Biotechnology, Chemistry and Food Industry (2008)

Signal and imaging investigations are currently a basic step of the diagnostic, prognostic and follow-up processes of heart diseases. Besides, the need of a more efficient, cost-effective and personalized care has lead nowadays to a renaissance of clinical decision support systems (CDSS).The purpose of this paper is to present an effective way to achieve a high-level integration of signal and image processing methods in the general process of care, by means of a clinical decision support system, and to discuss the advantages of such an approach.Among several heart diseases, we treat heart failure, that for its complexity highlights best the benefits of this integration.Architectural details of the related components of the CDSS are provided with special attention to their seamless integration in the general IT infrastructure. In particular, significant and suitably designed image and signal processing algorithms are introduced to objectively and reliably evaluate important features that, in collaboration with the CDSS, can facilitate decisional problems in the heart failure domain. Furthermore, additional signal and image processing tools enrich the model base of the CDSS.
Sequences, DFT and Resistance against Fast Algebraic Attacks
Authors: Guang Gong
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

The discrete Fourier transform (DFT) of a boolean function yields a trace representation or equivalently, a polynomial representation, of the boolean function, which is identical to the DFT of the sequence associated with the boolean function. Using this tool, we investigate characterizations of boolean functions for which the fast algebraic attack is applicable. In order to apply the fast algebraic attack, the question that needs to be answered is that: for a given boolean function f in n variables and a pair of positive integers (d, e), when there exists a function g with degree at most d such that $h=fg\ne 0$ where h's degree is at most e. We give a sufficient and necessary condition for the existence of those multipliers of f. An algorithm for finding those multipliers is given in terms of a polynomial basis of 2 n dimensional space over $\mathbb{F}_2$ which is established by an arbitrary m-sequence of period 2 n ¿ 1 together with all its decimations and certain shifts. We then provide analysis for degenerated cases and introduce a new concept of resistance against the fast algebraic attack in terms of the DFT of sequences or boolean functions. Some functions which made the fast algebraic attack inefficient are identified.
Proving Conditional Termination
Authors: Byron Cook, Sumit Gulwani, Tal Lev-Ami, Andrey Rybalchenko, Mooly Sagiv
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

We describe a method for synthesizing reasonable underapproximations to weakest preconditions for termination--a long-standing open problem. The paper provides experimental evidence to demonstrate the usefulness of the new procedure.
Survey on Real-Time Crowds Simulation
Authors: Mohamed Adi Azahar, Mohd Shahrizal Sunar, Daut Daman, Abdullah Bade
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

The simulation of human massive crowds play an important role in real-time application such as games and walkthrough system. This kind of applications can provide an immersive feeling of life into the static scene and enhance the reality of the system. In recent years, there are many significant research and techniques have been developed, mainly focus on the entertainment industry for both real-time and non-real time rendering. This paper will give an overview on crowd behavior in real-time crowd simulation. The work will also cover numerous crowd modeling and rendering techniques.
A physically faithful multigrid method for fast cloth simulation
Authors: SeungWoo Oh
Venue: Computer Animation and Virtual Worlds (2008)

We present an efficient multigrid algorithm that is adequate to solve a heavy linear system given in cloth simulation. Although a multigrid solver has been successfully employed to the Poisson problems, it is hard to apply the solver to complicated cloth deformations due to its lack of physical meaning in level construction. We address this problem by developing a physically faithful technique ensuring the conservation of all physical quantities across levels. The performance of our approach is demonstrated on a number of garment simulations implemented by the state of the art techniques: the implicit integration, the triangle-based in-plane energy model, and the curvature-based bending energy model. Our multigrid algorithm is about four times faster than the preconditioned Conjugate Gradient method for a garment with 20K particles. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Artificial Immune System Based Robot Anomaly Detection Engine for Fault Tolerant Robots
Authors: Bojan Jakimovski, Erik Maehle
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

Robot anomaly detection method described in this paper uses an approach inspired by an immune system for detecting failures within autonomous robot system. The concept is based on self-nonself discrimination and clonal selection principles found within the natural immune system. The approach applies principles of fuzzy logic for representing and processing the information within the artificial immune system. Throughout the paper we explain the working principle of RADE (Robot Anomaly Detection Engine) approach and we show its practical effectiveness through several experimental test cases.
Productivity, Polysemy, and Predicate Indexicality
Authors: Peter Bosch
Venue: Logic, Language, and Computation: 6th International Tbilisi Symposium on Logic, Language, and Computation,TbiLLC 2005 Batumi, Georgia, September 12-16, 2005. Revised Selected Papers (2007)

This paper argues that at least some cases of productive language use, specif ic ally cases of apparent variation in word sense, require a treatment at the conceptual level rather than a lexical semantic solution. It is argued that the lexical semantics should be left underspecified in these cases, and the observed variation in truth-conditions should be attributed to differences in conceptual represent ation that result from differences in the utterance context. This involves rather drastic changes in our conception of the semantics-pragmatics interface, which are discussed in this paper.
Information systems continuance intention of web-based applications customers: The case of online banking
Authors: Banphot Vatanasombut, Magid Igbaria, Antonis C. Stylianou, Waymond Rodgers
Venue: Information and Management (2008)

The proliferation of the Internet has not only allowed businesses to offer their products and services through web-based applications, but it has also undermined their ability to retain their customers. It has reduced search costs, opened up barriers to entry, and diminished distinctiveness of firms. Effective retention of customers allows firms to grow in size and popularity, thereby increasing their profitability. We extended Commitment-Trust theory, an expectation-confirmation model, and technology acceptance theory to develop a model of IS continuance intention of customers of web-based applications. Relationship commitment and trust were found to be central to IS continuance intention. Also, perceived empowerment influenced relationship commitment, while perceived security influenced trust. Our findings thus supported traditional intention factors, highlighting the role of trust as a stronger predictor of intention than commitment but, contradicting findings from marketing research, trust was found to be a stronger predictor of retention in the e-commerce context.
Dublin City University at CLEF 2007: Cross-Language Speech Retrieval Experiments
Authors: Ying Zhang, Gareth J. Jones, Ke Zhang
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

The Dublin City University participation in the CLEF 2007 CL-SR English task concentrated primarily on issues of topic translation. Our retrieval system used the BM25F model and pseudo relevance feedback. Topics were translated into English using the Yahoo! BabelFish free online service combined with domain-specific translation lexicons gathered automatically from Wikipedia. We explored alternative topic translation methods using these resources. Our results indicate that extending machine translation tools using automatically generated domain-specific translation lexicons can provide improved CLIR effectiveness for this task.
Guiding Search in QCSP + with Back-Propagation
Authors: Guillaume Verger, Christian Bessiere
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universal ones). Despite the expressiveness of QCSP, many problems, such as two-players games or motion planning of robots, remain difficult to express. Two more modeler-friendly frameworks have been proposed to handle this difficulty, the Strategic CSP and the QCSP + . We define what we name back-propagation on QCSP + . We show how back-propagation can be used to define a goal-driven value ordering heuristic and we present experimental results on board games.
Exploiting the Locality Properties of Peano Curves for Parallel Matrix Multiplication
Authors: Michael Bader
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

The present work studies an approach to exploit the locality properties of an inherently cache-efficient algorithm for matrix multiplication in a parallel implementation. The algorithm is based on a blockwise element layout and an execution order that are derived from a Peano space-filling curve. The strong locality properties induced in the resulting algorithm motivate a parallel algorithm that replicates matrix blocks in local caches that will prefetch remote blocks before they are used. As a consequence, the block size for matrix multiplication and the cache sizes, and hence the granularity of communication, can be chosen independently. The influence of these parameters on parallel efficiency is studied on a compute cluster with 128 processors. Performance studies show that the largest influence on performance stems from the size of the local caches, which makes the algorithm an interesting option for all situations where memory is scarce, or where existing cache hierarchies can be exploited (as in future manycore environments, e.g.).
COTS Selection Best Practices in Literature and in Industry
Authors: Rikard Land, Laurens Blankers, Michel Chaudron, Ivica Crnković
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

This paper presents an extensive literature survey of the software COTS component selection methods published to date, followed by a meta-model consolidating the activities and practices of these methods. Together with data collected from practitioners and researchers in the embedded systems domain, we provide concrete recommendations which will enable organizations to identify suitable practices when designing a customized selection processes.