ppxscal/embedding_network huggingface dataset:
Balancing intrusion detection resources in ubiquitous computing networks
Authors: Bo Zhou, Qi Shi, Madjid Merabti
Venue: Computer Communications (2008)

A service-oriented and user-centric intrusion detection system (SUIDS) is proposed in our previous work for a ubiquitous/pervasive computing network. The inherent features of ubiquitous computing request an IDS to give special concerns over the issue of resource-efficiency. In this paper, we present a comprehensive analysis of the resource constraints in SUIDS and propose a new method in order to reduce the resource consumptions. Specifically, the paper shows how a node's computing availability is measured by correlating with its energy usage; how a node's trust level is estimated based on multi-factors; and how a hybrid metric is used to balance these limited resources together. As a result, SUIDS achieves better performance in terms of resource efficiency with enhanced security.
Agent Based Analytical Model for Energy Consumption among Border Nodes in Wireless Sensor Networks
Authors: Haroon Malik, Elhadi Shakshuki, Tarek Sheltami
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

This paper presents an agent-based analytical model to minimize the energy consumption for border nodes in Sensor-Medium Access Control (S-MAC), a cluster-based contention protocol. The S-MAC protocol is based on a unique feature; it conserves battery power at nodes by powering off nodes that are not actively transmitting or receiving packets. In doing so, nodes also turn off their radios. Inspired by the energy conservation mechanism of the S-MAC, the paper further augments the node life time in sensor networks by reducing the duty cycle of border nodes. These border nodes act as shared nodes between virtual clusters. Virtual clusters are formed on the basis of sleep/listen schedule of nodes. Towards this end, not only our proposed approach allows border nodes to join cluster where they experience minimum energy drain. Indeed, it stops the formation of abrupt communication holes due to hastily burning of border nodes. Thereby, prolonging network life and preventing disgraceful segmentations of wireless sensor network. To validate the proposed approach, a java based custom simulator is implemented. The results demonstrate, quantitatively, the trade of between energy consumption and node placement to prolong the life time of border nodes in S-MAC.
Net'O'Drom--- An Example for the Development of Networked Immersive VR Applications
Authors: Christoph Anthes, Alexander Wilhelm, Roland Landertshamer, Helmut Bressler, Jens Volkert
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Developing Networked Virtual Environments (NVEs) is a challenging task. Designers and programmers of such an application can encounter many pitfalls. For a public event, a night of science, a networked Virtual Reality (VR) application had to be designed and implemented. This paper will describe the technical and conceptual design of this application - The Net'O'Drom game. Possible pitfalls during the design and implementation of NVEs will be pointed out and suggestions on how to overcome these issues will be given. A closer look at the problem areas of physics, network communication and graphical effects is taken.
A Novel Cryptographic Key Assignment Scheme with ID-Based Access Control in a Hierachy
Authors: Hui-Feng Huang, Chin-Chen Chang
Venue: Fundamenta Informaticae (2008)

The hierarchical cryptographic key assignment is used to assign cryptographic keys to a set of partially ordered classes so that the user in a higher class can derive the cryptographic key for users in a lower class. However, the existing secure schemes for the cryptographic key assignment in a hierarchy do not consider the situation where a user may be employed for only a period of time. If a user resigned from his position and he premeditatedly eavesdrops on data transmissions, then he can also decrypt some data to obtain useful messages. Thus, all messages are likely to be compromised throughout the system. In this paper, we propose a new cryptographic key assignment scheme in which the cryptographic keys are generated from the identity number of users. Our aim is to minimize the potential damage over a public network. Therefore, as a user who has resigned from his class premeditatedly eavesdrops on later messages, he cannot decrypt the message with his old keys. Moreover, in the proposed method, the key generation and key derivation are quite simple, and the number of the public/secret parameters for each authenticated user is fixed which differs from most previously proposed schemes.
An Integrated Approach to Context Specification and Recognition in Smart Homes
Authors: Fulvio Mastrogiovanni, Antonello Scalmato, Antonio Sgorbissa, Renato Zaccaria
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

This paper introduces a framework for integrating ontology- and logic-based approaches for context-awareness in Ambient Intelligence. A context description language is described, which allows to easily specify patterns of events which occurrences are monitored by an actual system. As long as the system evolves, symbolic information originating from heterogeneous sources is aggregated and classified according to well-formed formulas. Experimental results in a Smart Home environment are presented and discussed.
Voice Translator Based on Associative Memories
Authors: Roberto A. Vázquez, Humberto Sossa
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

An associative memory is a particular type of neural network for recalling output patterns from input patterns that might be altered by noise. During the last 50 years, several associative models have emerged and they only have been applied to solve problems where input patterns are images. Most of these models have several constraints that limit their applicability in complex problems. Recently in [13] it was introduced a new associative model based on some aspects of the human brain. This model is robust under different type of noises and image transformations, and useful in complex problems such as face and 3d object recognition. In this paper we adopt this model and apply it to problems that not involve images patterns, we applied to speech recognition problems. In this paper it is described a novel application where an associative memory works as a voice translator device performing a speech recognition process. In order to achieve this, the associative memory is trained using a corpus of 40 English words with their corresponding translation to Spanish. Each association used during training phase is composed by a voice signal in English and a voice signal in Spanish. Once trained our English-Spanish translator, when a voice signal in English is used to stimulate the associative memory we expect that the memory recalls the corresponding voice signal in Spanish. In order to test the accuracy of the proposal, a benchmark of 14500 altered versions of the original voice signals were used.
A series of slowly synchronizing automata with a zero state over a small alphabet
Authors: P. V. Martugin
Venue: Information and Computation (2008)

For each integer n>=8, we construct an n-state synchronizing automation with a zero state and only 2 input letters such that the minimum length of reset words for the automaton is n^2+6n-164.
Decentralized Deployment of Mobile Sensors for Optimal Connected Sensing Coverage
Authors: Adriano Fagiolini, Lisa Tani, Antonio Bicchi, Gianluca Dini
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

In this paper, we address the optimal connected sensing coverage problem, i.e., how mobile sensors with limited sensing capabilities can cooperatively adjust their locations so as to maximize the extension of the covered area while avoiding any internal "holes", areas that are not covered by any sensor. Our solution consists in a distributed motion algorithm that is based on an original extension of the Voronoi tessellation.
A Generalization of Cobham's Theorem to Automata over Real Numbers
Authors: Bernard Boigelot, Julien Brusten
Venue: Proceedings of the 34th international colloquium on Automata, Languages and Programming (2007)

This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in the first-order additive theory of real and integer variables ¿¿, ¿, + , < ¿ can all be recognized by weak deterministic Büchi automata, regardless of the encoding base r > 1. In this paper, we prove the reciprocal property, i.e., that a subset of ¿ that is recognizable by weak deterministic automata in every base r > 1 is necessarily definable in ¿¿, ¿, + , < ¿. This result generalizes to real numbers the well-known Cobham's theorem on the finite-state recognizability of sets of integers. Our proof gives interesting insight into the internal structure of automata recognizing sets of real numbers, which may lead to efficient data structures for handling these sets.
Modelling Combined Subaerial-Subaqueous Flow-Like Landslides by Cellular Automata
Authors: Maria Vittoria Avolio, Valeria Lupiano, Paolo Mazzanti, Salvatore Gregorio
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Macroscopic Cellular Automata characterize a methodological approach for modelling large scale (extended for kilometres) complex acentric phenomena, e.g. surface flows as lava flows, debris flows etc.. This paper concerns the extension of such a method in order to simulate combined subaerial-subaqueous flow-like landslides. The occurrence of heterogeneous interacting processes requires a more physical description of the energy balance and an explicit velocity management. The model SCIDDICA-SS2 proposes some empirical solutions, such as the computation at each step and inside each cell, of departing flows which are characterized by their mass centre position and velocity. An application to combined subaerial-subaqueous landslide is exhibited together with simulation results of the 1997 Albano lake (Rome, Italy) debris flow.
Automatic Generation of Students' Conceptual Models from Answers in Plain Text
Authors: D. Pérez-Marín, E. Alfonseca, P. Rodríguez, I. Pascual-Nieto
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Recently, we have introduced a new procedure to automatically generate students' conceptual models to assist teachers in finding out their students' main misconceptions and lack of concepts, from their interaction with an automatic and adaptive free-text scoring system. In this paper, we present an improvement of this procedure: the models can be built from the students' answers in plain text and they refer not only to one particular student but to the whole class. We also introduce a new tool called COMOV (COnceptual MOdels Viewer) to display the models as concept maps, tables, bar charts or text summaries. Finally, we provide an evaluation of this new approach.
Constraint Programming Approach to Time-Window and Multiresource-Constrained Projects Portfolio Prototyping
Authors: Irena Bach, Grzegorz Bocewicz, Zbigniew Banaszak
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

Constraint Programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in the area of integrated production planning. In that context, CP can be considered as an appropriate framework for development of decision making software supporting small and medium sized enterprises (SMEs) in the course of projects portfolio prototyping. The paper deals with problem considered multiresource problem in which more than one resource type may be required by every activity in the project and the availability of each type is time-windows limited. The problem belongs to a class of NP-complete ones. The aim of the paper is to present a CP based projects portfolio prototyping framework providing a prompt service to a set of routine queries stated both in straight and reverse way, e.g., concerning the projects portfolio makespan implied by a given resources allocation, and the feasible resources allocation guaranteeing an assumed projects portfolio makespan. The way the responses to the routine queries can be guaranteed while may be available in an on-line mode is illustrated in the example enclosed.
Grid4All: Open Market Places for Democratic Grids
Authors: Ruby Krishnaswamy, Leandro Navarro, René Brunner, Xavier León, Xavier Vilajosana
Venue: Proceedings of the 5th international workshop on Grid Economics and Business Models (2008)

The Grid4All project is focused on the provision of the benefits and opportunities of Grids for everyone, including small organizations such as schools, families, non-governmental organizations, or small businesses. This involves multiple relevant and related aspects despite the scale of the global system: (i) self-management of applications as they adapt to environmental changes, (ii) the complexity of developing and using applications in that situation by multiple users, (iii) and the need to organize, govern, and regulate the community. Grid4All promotes the concept of a democratic Grid, virtual organizations and self-management systems, based on decentralized overlays. Thereby, the providers offer resources and services either for a shared-interest within a virtual organization (pooling) or for an open market across virtual organizations. These two models of distributing resources that co-exist locally, contribute to achieve global regulation. We propose an architecture according to these ideas, which are inspired by real-world cases, which include a collection of data sharing and execution services, used by collaborative applications.
Fuzzy techniques in optimization: based analog design
Authors: Gabriel Oltean
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

Cell-level analog circuit design is a very challenging task for several reasons: the design problem is usually underconstrained with many degrees of freedom, most analog modules require a custom optimized design, the performance requirements must be traded off as they usually are competing design objectives, to encounter the most important ones. This paper presents some applications of fuzzy techniques in the design of analog modules. Our research direction turns into account the opportunities offered by fuzzy techniques in the optimization-based design of analog circuits field. In our approach, all the phases of the optimization process involve fuzzy methods. Fuzzy sets are involved in the formulation of the optimization objectives and in the initial guess of the design parameters, while some fuzzy systems address the performance evaluation issues (evaluation engine) and new parameter values computation (optimization engine). Two CAD tools at the cell level were developed in Matlab. The operation of these CAD tools is validated by a large collection of experimental results. Basic analog modules as simple transconductance operational amplifier, Miller operational transconductance amplifier, and common-emitter stage were designed for several sets of design requirements with very good results.
A Note on Persistent Petri Nets
Authors: Eike Best
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

Petri nets have traditionally been motivated by their ability to express concurrency. Subclasses of Petri nets with concurrency but without choices or conflicts have been studied extensively. One of the best known - and comparatively restricted - such class are the marked graphs [4]. However, perhaps the largest class of (intuitively) choice-free nets are the persistent nets [7], a class of nets that is significantly larger than marked graphs.Some early results about persistent nets are Keller's theorem [6], which will be recalled in a later part of this paper, and the famous semilinearity result of Landweber and Robertson [7], which states that the set of reachable markings of a persistent net is semilinear. In this paper, we show that in bounded persistent nets, the smallest cycles of its reachability graph enjoy a uniqueness property.
Visualizing the ground motions of the 1906 San Francisco earthquake
Authors: Amit Chourasia, Steve Cutchin, Brad Aagaard
Venue: Computers Geosciences (2008)

With advances in computational capabilities and refinement of seismic wave-propagation models in the past decade large three-dimensional simulations of earthquake ground motion have become possible. The resulting datasets from these simulations are multivariate, temporal and multi-terabyte in size. Past visual representations of results from seismic studies have been largely confined to static two-dimensional maps. New visual representations provide scientists with alternate ways of viewing and interacting with these results potentially leading to new and significant insight into the physical phenomena. Visualizations can also be used for pedagogic and general dissemination purposes. We present a workflow for visual representation of the data from a ground motion simulation of the great 1906 San Francisco earthquake. We have employed state of the art animation tools for visualization of the ground motions with a high degree of accuracy and visual realism.
Reducing a class of polygonal path tracking to straight line tracking via nonlinear strip-wise affine transformation
Authors: George Moustris, Spyros G. Tzafestas
Venue: Mathematics and Computers in Simulation (2008)

In this paper a piecewise linear homeomorphism is presented that maps a strictly monotone polygonal chain to a straight line. This mapping enables one to reduce the path tracking task for mobile robots to straight line tracking. Due to the simplicity of the transformation, closed form solutions for the direct and inverse mapping are presented. Furthermore, the transformation also defines a feedback equivalence relation between the original and the transformed system equations of the mobile robot. It is shown that the form of the system equations is preserved and that the transformation essentially maps a car-like robot in the original domain, to a car-like robot in the transformed domain. This enables one to use straight line trackers developed solely for this system, for the tracking of arbitrary strictly monotone polygonal curves. Finally, it is shown that the use of this mapping can also simplify the application of existing path tracking controllers since they only need to track straight line paths. In general, one can eliminate from the existing path controllers all parameters that are needed for non-straight paths, thus obtaining respective simplified controllers. For example, it is shown that a fuzzy path controller with 135 rules can be reduced to an equivalent fuzzy straight line tracking controller with 45 rules.
Feature Selection Based on Sensitivity Analysis
Authors: Noelia Sánchez-Maroño, Amparo Alonso-Betanzos
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

In this paper an incremental version of the ANOVA and Functional Networks Feature Selection (AFN-FS) method is presented. This new wrapper method (IAFN-FS) is based on an incremental functional decomposition, thus eliminating the main drawback of the basic method: the exponential complexity of the functional decomposition. This complexity limited its scope of applicability, being only applicable to datasets with a relatively small number of features. The performance of the incremental version of the method was tested against several real data sets. The results show that IAFN-FS outperforms the accuracy obtained by other standard and novel feature selection methods, using a small set of features.
A note on information entropy measures for vague sets and its applications
Authors: Qian-Sheng Zhang, Sheng-Yi Jiang
Venue: Information Sciences: an International Journal (2008)

A new nonprobabilistic entropy of a vague set is proposed by means of the intersection and union of the membership degree and nonmembership degree of the vague set. The concept called vague cross-entropy of vague sets will also be discussed and its definition is given by analogy with the cross-entropy of probability distributions. Finally, two numeric examples are presented to illustrate the applications of vague cross-entropy to pattern recognition and medical diagnosis.
Knowledge Processing and Contextualisation by Automatical Metadata Extraction and Semantic Analysis
Authors: Wolfgang Reinhardt, Christian Mletzko, Benedikt Schmidt, Johannes Magenheim, Tobias Schauerte
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

The third project of the MoKEx project series focused on organisational issues that arise in the context of blended learning scenarios and knowledge management. We developed MetaXsA (Metadata Extraction and semantic Analysis) - a module that analyses given knowledge assets and returns a metadata file, which is stored in a global metadata database. This paper gives an introduction to MetaXsA and the surrounding Single Point of Information architecture.
Highly Realistic 3D Presentation Agents with Visual Attention Capability
Authors: Arjen Hoekstra, Helmut Prendinger, Nikolaus Bee, Dirk Heylen, Mitsuru Ishizuka
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

This research proposes 3D graphical agents in the role of virtual presenters with a new type of functionality --- the capability to process and respond to visual attention of users communicated by their eye movements. Eye gaze is an excellent clue to users' attention, visual interest, and visual preference. Using state-of-the-art non-contact eye tracking technology, eye movements can be assessed in a unobtrusive way. By analyzing and interpreting eye behavior in real-time, our proposed system can adapt to the current (visual) interest state of the user, and thus provide a more personalized, context-aware, and `attentive' experience of the presentation. The system implements a virtual presentation room, where research content of our institute is presented by a team of two highly realistic 3D agents in a dynamic and interactive way. A small preliminary study was conducted to investigate users' gaze behavior with a non-interactive version of the system. A demo video based on our system was awarded as the best application of life-like agents at the GALA event in 2006.