ppxscal/embedding_network huggingface dataset:
New Digital Signature Scheme in Gaussian Monoid
Authors: Eligijus Sakalauskas
Venue: Informatica (2004)

A new digital signature scheme in non-commutative Gaussian monoid is presented. Two algebraic structures are employed: Gaussian monoid and a certain module being compatible with a monoid. For both monoid and module, presentation and action level attributes are defined. Monoid action level is defined as monoid element (word) action on module element as an operator. A module is a set of functions (elements) with special properties and could be treated as some generalization of vector space. Signature scheme is based on the one-way functions (OWF) design using: three recognized hard problems in monoid presentation level, one postulated hard problem in monoid action level and one provable hard problem in module action level. For signature creation and verification the word equivalence problem is solved in monoid action level thus avoiding solving it in monoid presentation level. Then the three recognized hard problems in monoid presentation level can be essentially as hard as possible to increase signature security. Thus they do not influence on the word problem complexity and, consequently, on the complexity of signature realization. The investigation of signature scheme security against four kind of attacks is presented. It is shown that the signature has a provable security property with respect to the list of attacks presented here, which are postulated to be complete.
The cyber trust tension in E-government: Balancing identity, privacy, security
Authors: William Dutton, Gerardo A. Guerra, Daniel J. Zizzo, Malcolm Peltu
Venue: Information Polity (2005)

The growing use of the Internet and other information and communication technologies (ICTs) in e-government services raises important new issues of 'cyber trust' that could have a significant influence on governance structures and practices in the future. This paper argues that at the heart of debates about cyber trust in e-government is a 'trust tension' between the need to collect data on individuals as the basis for providing services and fears about the inappropriate use of personal information gathered, stored, and analysed using ICTs. It draws on studies of experiences in e-commerce and e-business, as well as e-government, to illuminate the nature of cyber trust and its wider social dimensions, including the main related challenges faced in e-government and some strategies, products and services for dealing with them.
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs
Authors: A. Gupta, M. Karimi, E. J. Kim, A. Rafiey
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

For digraphs G and H, a homomorphism of G to H is a mapping such that uv ¿ A(G) implies f(u)f(v) ¿ A(H). In the minimum cost homomorphism problem we associate costs c i (u), u ¿ V(G), i ¿ V(H) with the mapping of u to i and the cost of a homomorphism f is defined ¿ u ¿ V(G) c f(u)(u) accordingly. Here the minimum cost homomorphism problem for a fixed digraph H, denoted by MinHOM(H), is to check whether there exists a homomorphism of G to H and to obtain one of minimum cost, if one does exit.The minimum cost homomorphism problem is now well understood for digraphs with loops. For loopless digraphs only partial results are known. In this paper, we find a full dichotomy classification of MinHom(H), when H is a locally in-semicomplete digraph. This is one of the largest classes of loopless digraphs for which such dichotomy classification has been proved. This paper extends the previous result for locally semicomplete digraphs.
Game Sound: An Introduction to the History, Theory, and Practice of Video Game Music and Sound Design
Authors: Karen Collins
Venue:  (2008)

A distinguishing feature of video games is their interactivity, and sound plays an important role in this: a player's actions can trigger dialogue, sound effects, ambient sound, and music. And yet game sound has been neglected in the growing literature on game studies. This book fills that gap, introducing readers to the many complex aspects of game audio, from its development in early games to theoretical discussions of immersion and realism. In Game Sound, Karen Collins draws on a range of sources--including composers, sound designers, voice-over actors and other industry professionals, Internet articles, fan sites, industry conferences, magazines, patent documents, and, of course, the games themselves--to offer a broad overview of the history, theory, and production practice of video game audio. Game Sound has two underlying themes: how and why games are different from or similar to film or other linear audiovisual media; and technology and the constraints it has placed on the production of game audio. Collins focuses first on the historical development of game audio, from penny arcades through the rise of home games and the recent rapid developments in the industry. She then examines the production process for a contemporary game at a large game company, discussing the roles of composers, sound designers, voice talent, and audio programmers; considers the growing presence of licensed intellectual property (particularly popular music and films) in games; and explores the function of audio in games in theoretical terms. Finally, she discusses the difficulties posed by nonlinearity and interactivity for the composer of game music.
Flexible Path Planning Using Corridor Maps
Authors: Mark Overmars, Ioannis Karamouzas, Roland Geraerts
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired locations. These paths must avoid collisions with the environment and with other moving characters. Also a chosen path must be natural, meaning that it is the kind of path a real human being could take. The algorithms for planning such paths must be able to handle hundreds of characters in real-time and must be flexible.The Corridor Map Method (cmm) was recently introduced as a flexible path planning method in interactive virtual environments and games. The method is fast and flexible and the resulting paths are reasonable. However, the paths tend to take unnatural turns when characters get close to other characters or small obstacles. In this paper we will improve on the cmm by decoupling collision avoidance with the environment and local steering behavior. The result is a method that keeps the advantages of the cmm but has much more natural steering. Also the method allows for more flexibility in the desired routes of the characters.
Using the αβ-Neighborhood for Adaptive Document Filtering
Authors: Adrian Fonseca-Bruzón, Reynaldo Gil-García, Aurora Pons-Porrata
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this paper, we address the problem of adaptive document filtering. Traditionally, user profiles are represented by the centroid of the available examples, assuming that these are homogeneously distributed around this centroid. However, these examples may be irregularly distributed, being some areas more populated than others. While, in this case, the homogeneity assumption may not be globally true, it may still hold locally. In order to handle this phenomenon, we introduce a new approach in which a binary classifier for each user profile is used and more than one document is considered in the classification task. To decide whether a new document is relevant to the user or not, our approach uses a Nearest Neighbor classifier based on a neighborhood which inspects a sufficiently small area surrounding the new document. Experiments carried out on the TREC-11 collection show the effectiveness of the proposed method.
XWiki Concerto: A P2P Wiki System Supporting Disconnected Work
Authors: Gérôme Canals, Pascal Molli, Julien Maire, Stéphane Laurière, Esther Pacitti, Mounir Tlili
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

This paper presents the XWiki Concerto system, the P2P version of the XWiki server. This system is based on replicating wiki pages on a network of wiki servers. The approach, based on the Woot algorithm, has been designed to be scalable, to support the dynamic aspect of P2P networks and network partitions. These characteristics make our system capable of supporting disconnected edition and sub-groups, making it very flexible and usable.
Pin-Collinear Body-and-Pin Frameworks and the&#x00a0;Molecular Conjecture
Authors: Bill Jackson, Tibor Jord&#x00e1;n
Venue: Discrete Computational Geometry (2008)

T.-S. Tay and W. Whiteley independently characterized the multigraphs which can be realized as an infinitesimally rigid d-dimensional body-and-hinge framework. In 1984 they jointly conjectured that each graph in this family can be realized as an infinitesimally rigid framework with the additional property that the hinges incident to each body lie in a common hyperplane. This conjecture has become known as the Molecular Conjecture because of its implication for the rigidity of molecules in 3-dimensional space. Whiteley gave a partial solution for the 2-dimensional form of the conjecture in 1989 by showing that it holds for multigraphs G=(V,E) in the family which have the minimum number of edges, i.e. satisfy 2|E|=3|V|&#x2212;3. In this paper, we give a complete solution for the 2-dimensional version of the Molecular Conjecture. Our proof relies on a new formula for the maximum rank of a pin-collinear body-and-pin realization of a multigraph as a 2-dimensional bar-and-joint framework.
Large Scale Knowledge Representation of Distributed Biomedical Information
Authors: Volker Stümpflen, Thorsten Barnickel, Karamfilka Nenova
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

Within the last years the Web dramatically influenced biomedical research. Although it allows for almost instantaneous access to a huge amount of distributed information the problem how to retrieve useful information still persist. With semantic technologies (especially Topic Maps) the solution becomes tangible. We will discuss in this paper concepts and a technical realization for knowledge representation within the biomedical domain. This includes not only the semantic access of distributed and heterogeneous resources based on state-of-the-art enterprise integration technologies (J2EE, Web Services) but also an approach for Topic Map based views on unstructured information from scientific publications. We will furthermore present the implementation of an information portal based on the seamless semantic integration of ~ 500 genome databases and ~16.000.000 abstracts.
Cooperative Interactions: An Exchange Values Model
Authors: Maíra R. Rodrigues, Michael Luck
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

In non-economic cooperative applications with resource constraints, explicitly motivating cooperation is important so that autonomous service providers have incentives to cooperate. When participants of such applications have different skills and expectations over services, it may be that an agent receives less than expected from a cooperation. A decision-making strategy over interactions in this context must consider not only the motivation to cooperate, but also which interactions to perform to cope with resource limitations. In this paper, we present a computational approach for modelling non-economic cooperative interactions based on the theory of exchange values. Here, exchange values are used to motivate cooperative interactions, and to allow agents to identify successful and unsuccessful cooperations with others, in order to limit service provision and to improve the number of successful interactions. We also present a scenario in which agents participate in a cooperative application in the bioinformatics domain, and show how agents can improve their interactions using the proposed approach.
Robust Impulsive Synchronization of Coupled Delayed Neural Networks
Authors: Lan Xiang, Jin Zhou, Zengrong Liu
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

The present paper studies robust impulsive synchronization of coupled delayed neural networks. Based on impulsive control theory on dynamical systems, a simple yet less conservative criteria ensuring robust impulsive synchronization of coupled delayed neural networks is established. Furthermore, the theoretical result is applied to a typical scale-free (SF) network composing of the representative chaotic delayed Hopfield neural network nodes, and numerical results are presented to demonstrate the effectiveness of the proposed control techniques.
General Mode Controller for Software on Artificial Satellite with Model-Based Validation Tool
Authors: Toshihiro Obata, Teiichiro Inoue
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

High quality and flexibility are strongly required for embedded software on artificial satellites. High quality is very important because any single halt is not allowed over 15 years operation period without any significant maintenance. Flexibility is also important to adapt customer requirements which may vary after operation experiences. A quick and reliable way to modify the software functions is required. The model-based approach will contribute to solve this problem. Mitsubishi Electric Corporation, one of the representing artificial satellite suppliers in Japan, is now implementing a General Mode Controller on on-board software of satellites. We noticed functions related to modes and sequences are often required to modify from previous projects. The General Mode Controller can modify them in a reliable way by changing control parameters without modifying source code. The control parameters are verified by using a model-based tool, Matlab Simulink and Stateflow, to enable quick and low risk modifications.
On the complexity of bandwidth allocation in radio networks
Authors: Ralf Klasing, Nelson Morales, Stéphane Pérennes
Venue: Theoretical Computer Science (2008)

We define and study an optimization problem that is motivated by bandwidth allocation in radio networks. Because radio transmissions are subject to interference constraints in radio networks, physical space is a common resource that the nodes have to share in such a way, that concurrent transmissions do not interfere. The bandwidth allocation problem we study under these constraints is the following. Given bandwidth (traffic) demands between the nodes of the network, the objective is to schedule the radio transmissions in such a way that the traffic demands are satisfied. The problem is similar to a multicommodity flow problem, where the capacity constraints are replaced by the more complex notion of non-interfering transmissions. We provide a formal specification of the problem that we call round weighting. By modeling non-interfering radio transmissions as independent sets, we relate the complexity of round weighting to the complexity of various independent set problems (e.g. maximum weight independent set, vertex coloring, fractional coloring). From this relation, we deduce that in general, round weighting is hard to approximate within n^1^-^@e (n being the size of the radio network). We also provide polynomial (exact or approximation) algorithms e.g. in the following two cases: (a) when the interference constraints are specific (for instance for a network whose vertices belong to the Euclidean space), or (b) when the traffic demands are directed towards a unique node in the network (also called gathering, analogous to single commodity flow).
Workflow Integration in VL-e Medical
Authors: Tristan Glatard, Kamel Boulebiar, Silvia D. Olabarriaga
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

This paper presents the integration of a workflow management system into the VL-e Medical software architecture. Workflows are designed with the Taverna workbench, and then executed with the MOTEUR engine on the EGEE grid through the VBrowser, which is the basic front-end for grid-enabled applications in the VL-e Medical project. Data management is handled by the Virtual File System of the VL-e Toolkit. The resulting system provides a high-level interface to execute grid applications.
Fuzzy rough approximations of process data
Authors: Alicja Mieszkowicz-Rolka, Leszek Rolka
Venue: International Journal of Approximate Reasoning (2008)

This paper concerns the variable precision fuzzy rough set (VPFRS) model with asymmetric bounds. The discussion of the presented approach is preceded by a comparison of the original crisp rough set paradigm to the variable precision crisp rough set model. As a new aspect, a unified form of expressing the lower and upper crisp approximations is considered. It can be applied to defining new fuzzy rough set models. Crucial notions of the VPFRS model are redefined and explained. A new way of determining the upper variable precision fuzzy rough approximation is proposed. The VPFRS model is used for describing and analyzing the control actions which are accomplished by a human operator, who controls a complex dynamic system. The decision model is expressed by means of a decision table with fuzzy attributes. Decision tables are generated by the fuzzification of crisp data based on a set of fuzzy linguistic values of the attributes. A T-similarity relation is chosen for comparing elements of the universe. In an illustrative example, the task of stabilization of the aircraft's bank angle during a turn maneuver is analyzed.
Wireless Cyber Assets Discovery Visualization
Authors: Kenneth Prole, John R. Goodall, Anita D. D'Amico, Jason K. Kopylec
Venue: Proceedings of the 5th international workshop on Visualization for Computer Security (2008)

As wireless networking has become near ubiquitous, the ability to discover, identify, and locate mobile cyber assets over time is becoming increasingly important to information security auditors, penetration testers, and network administrators. We describe a new prototype called MeerCAT (Mobile Cyber Asset Tracks) for visualizing wireless assets, including their location, security attributes, and relationships. This paper highlights our latest iteration of our prototype for visual analysis of wireless asset data, including user requirements and the various coordinated visualizations.
The strategic value of enterprise mobility: Case study insights
Authors: Eusebio Scornavacca, Stuart J. Barnes
Venue: Information-Knowledge-Systems Management (2008)

The rapidly improving price-performance of wireless technologies is providing an unprecedented platform for the development of wireless applications for businesses. This paper aims to explore the strategic value of enterprise mobility. In order to achieve this goal, it provides an overview of the literature related to mobile business applications in the work domain and highlights the findings of four studies developed in New Zealand. The paper concludes with a discussion about present challenges and the future of the mobile enterprise.
Context-Aware Agents to Guide Visitors in Museums
Authors: Ichiro Satoh
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

This paper presents an agent-based system for building and operating context-aware services in public museums. Using RFID-tags or location-sensors, the system detects the locations of users and deploys user-assistant agents at computers near the their current locations. When users move between exhibits in a museum, this enables agents to follow them to annotate the exhibits in personalized form and navigate them to the next exhibits along their routes. It provides users with intelligent virtual agents in the real-world and enables them to easily interact with their agents though user movement between physical places. To demonstrate the utility and effectiveness of the system, we constructed and operated location/user-aware visitor-guide services in a science museum as a case study in our development of agent-based ambient computing in wide public spaces.
Online Tracing Scanning Worm with Sliding Window
Authors: Yang Xiang, Qiang Li
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

Breaking out of network worms brings a tremendous damage to the Internet. Launch the worm defense and response can improve anti-attack capability of networks. Tracing worm propagation process after its outbreak can reconstruct not only the earliest infected nodes but also the timing order of victims been infected. Based on the improvement of existing offline worm tracing algorithm, we can realize the near real-time tracing for the propagation process of scanning worm: Network traffic data are real-time collected by the detection points from different LANs, then separated into continuous-time detection sliding windows; in every time window, we repeatedly and randomly collect paths that contain worm scanning and infected flow rate, reconstruct path of worm propagation in the current detection window. Results accumulated in sequential detection sliding windows continues doing feedback amendment, real-time reflect the process of worm propagation. we establish a virtual experimental environment of worm propagation and tracing to evaluate the algorithm. Tracing network worm propagation from the initial attack can inhibit continuous spread of the worm, ensure that no more host is infected by the worm, and provide basis for the determination of worm attack origin.
Using DESs for Temporal Diagnosis of Multi-agent Plan Execution
Authors: Femke Jonge, Nico Roos, Huib Aldewereld
Venue: Proceedings of the 5th German conference on Multiagent System Technologies (2007)

The most common reason for plan repair are the violation of a plan's temporal constraints. Air Traffic Control is an example of an area in which violations of the plan's temporal constraints is rather a rule than an exception. In such domains there is a need for identifying the underlying causes of the constraint violations in order to improve plan repairs and to anticipate future constraint violations. This paper presents a model for identifying the causes of the temporal constraint violations.
Bringing order into the neighborhoods: relaxation guided variable neighborhood search
Authors: Jakob Puchinger, Günther R. Raidl
Venue: Journal of Heuristics (2008)

In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new Variable Neighborhood Descent (VND) algorithm. The ordering of the neighborhood structures in this VND is determined dynamically by solving relaxations of them. The objective values of these relaxations are used as indicators for the potential gains of searching the corresponding neighborhoods. We tested this new approach on the well-studied multidimensional knapsack problem. Computational experiments show that our approach is beneficial to the search, improving the obtained results. The concept is, in principle, more generally applicable and seems to be promising for many other combinatorial optimization problems approached by VNS.