ppxscal/embedding_network huggingface dataset:
Performance evaluation of a mobile agent-based platform for ubiquitous service provision
Authors: V. Baousis, M. Kyriakakos, S. Hadjiefthymiades, L. Merakos
Venue: Pervasive and Mobile Computing (2008)

The Virtual Home Environment (VHE) is a very important mechanism in the upcoming mobile telecommunications infrastructure, providing a ubiquitous approach in the delivery of services. The universality of systems like UMTS and WLANs increases the need for efficient introduction of VHE. In this paper, we discuss the adoption of Mobile Agents (MA) for coping with the VHE technical challenges. We present the detailed design of an integrated, open and extensible architecture, by taking into account a variety of use cases and technical alternatives (mobile devices, fixed terminals). Relevant implementations are presented to indicate the feasibility of the technical orientation discussed. Finally, we study and compare the performance of the proposed agent based framework with a conventional solution.
Mutual Information Estimation in Higher Dimensions: A Speed-Up of a k-Nearest Neighbor Based Estimator
Authors: Martin Vejmelka, Kateřina Hlaváčková-Schindler
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

We focus on the recently introduced nearest neighbor based entropy estimator from Kraskov, Stögbauer and Grassberger (KSG) [10], the nearest neighbor search of which is performed by the so called box assisted algorithm [7]. We compare the performance of KSG with respect to three spatial indexing methods: box-assisted, k-D trie and projection method, on a problem of mutual information estimation of a variety of pdfs and dimensionalities. We conclude that the k-D trie method is significantly faster then box-assisted search in fixed-mass and fixed-radius neighborhood searches in higher dimensions. The projection method is much slower than both alternatives and not recommended for practical use.
Quasi-opportunistic Supercomputing in Grid Environments
Authors: Valentin Kravtsov, David Carmeli, Werner Dubitzky, Ariel Orda, Assaf Schuster, Mark Silberstein, Benny Yoshpa
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

The ultimate vision of grid computing are virtual supercomputers of unprecedented power, through utilization of geographically dispersed distributively owned resources. Despite the overwhelming success of grids there still exist many demanding applications considered the exclusive prerogative of real supercomputers (i.e. tightly coupled parallel applications like complex systems simulations). These rely on a static execution environment with predictable performance, provided through efficient co-allocation of a large number of reliable interconnected resources. In this paper, we describe a novel quasi-opportunistic supercomputer system that enables execution of demanding parallel applications in grids through identification and implementation of the set of key technologies required to realize the vision of grids as (virtual) supercomputers. These technologies include an incentive-based framework basic on ideas from economics; a co-allocation subsystem that is enhanced by communication topology-aware allocation mechanisms; a fault tolerant message passing library that hides the failures of the underlying resources; and data pre-staging orchestration.
Semantics and Experience in the Future Web
Authors: Enric Plaza
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

The Web is a vibrant environment for innovation in computer science, AI, and social interaction; these innovations come in such great number and speed that it is unlikely to follow them. This paper will focus on some emerging aspects on the web that are an opportunity and challenge for Case-based Reasoning, specifically the large amount of experiences that individual people share in the Web. The talk will try to characterize this experiences, these bits of practical knowledge that go from simple but practical facts to complex problem solving descriptions. Then, I'll focus on how CBR ideas could be brought to bear in sharing and reusing this experiential knowledge, and finally on the challenging issues that have to be addressed for that purpose.
Protocols to efficiently support nested NEMO (NEMO+)
Authors: Ben McCarthy, Matthew Jakeman, Chris Edwards, Pascal Thubert
Venue: Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture (2008)

The NEMO Basic Support (NEMO BS) protocol provides a technique for enabling entire networks of IPv6 hosts to gain Internet access and remain reachable via constant, unaltered addresses whilst their underlying location in the Internet changes. In addition to individual hosts, this NEMO model also supports entire mobile networks connecting to other mobile networks, resulting in topologies known as Nested NEMO networks. In this paper we explain the inefficiencies that arise if NEMO BS is used to support this type of scenario and introduce our NEMO+ suite of protocols which are designed to optimise performance in Nested NEMO networks. We detail the Tree Discovery (TD), Network In Node Advertisement (NINA) and Reverse Routing Header (RRH) protocols that make up the NEMO+ suite and provide experimental evaluation results from a testbed comprising of our two distinct protocol implementation platforms (Linux and Cisco IOS). In addition we present simulation results based on scenarios of mass deployment of NEMO+ enabled mobile networks in order to determine the feasibility of our approach to efficiently support Nested NEMO networks.
The Schizophrenic Brain: A Broken Hermeneutic Circle
Authors: Péter Érdi, Vaibhav Diwadkar, Balázs Ujfalussy
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

A unifying picture to the hermeneutical approach to schizophrenia is given by combining the philosophical and the experimental/computational approaches.
Grounding OWL-S in SAWSDL
Authors: Massimo Paolucci, Matthias Wagner, David Martin
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

SAWSDL and OWL-S are Semantic Web services languages that both aim at enriching WSDL with semantic annotation. In this paper, we analyze the similarities and differences between the two languages, with the objective of showing how OWL-S annotations could take advantage of SAWSDL annotations. In the process, we discover and analyze representational trade-offs between the two languages.
Multiagent Reinforcement Learning for Urban Traffic Control Using Coordination Graphs
Authors: Lior Kuyer, Shimon Whiteson, Bram Bakker, Nikos Vlassis
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Since traffic jams are ubiquitous in the modern world, optimizing the behavior of traffic lights for efficient traffic flow is a critically important goal. Though most current traffic lights use simple heuristic protocols, more efficient controllers can be discovered automatically via multiagent reinforcement learning, where each agent controls a single traffic light. However, in previous work on this approach, agents select only locally optimal actions without coordinating their behavior. This paper extends this approach to include explicit coordination between neighboring traffic lights. Coordination is achieved using the max-plus algorithm, which estimates the optimal joint action by sending locally optimized messages among connected agents. This paper presents the first application of max-plus to a large-scale problem and thus verifies its efficacy in realistic settings. It also provides empirical evidence that max-plus performs well on cyclic graphs, though it has been proven to converge only for tree-structured graphs. Furthermore, it provides a new understanding of the properties a traffic network must have for such coordination to be beneficial and shows that max-plus outperforms previous methods on networks that possess those properties.
Velocity Distribution Profile for Robot Arm Motion Using Rational Frenet-Serret Curves
Authors: Reza Ravani, Ali Meghdari
Venue: Informatica (2006)

The aim of this paper is to demonstrate that the techniques of Computer Aided Geometric Design such as spatial rational curves and surfaces could be applied to Kinematics, Computer Animation and Robotics. For this purpose we represent a method which utilizes a special class of rational curves called Rational Frenet-Serret (RF) curves for robot trajectory planning. RF curves distinguished by the property that the motion of their Frenet-Serret frame is rational. We describe an algorithm for interpolation of positions by a rational Frenet-Serret motion. Further more we present an algorithm for tracking the constructed RF motion to achieve the desired velocity distribution profile of robot arm.
Public-Key Cryptosystems with Primitive Power Roots of Unity
Authors: Takato Hirano, Koichiro Wada, Keisuke Tanaka
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

We first consider a variant of the Schmidt-Samoa---Takagi encryption scheme without losing additively homomorphic properties. We show that this variant is secure in the sense of IND-CPA under the decisional composite residuosity assumption, and of OW-CPA under the assumption on the hardness of factoring n = p 2 q. Second, we introduce new cryptographic properties "affine" and "pre-image restriction", which are closely related to homomorphism. Intuitively, "affine" is a tuple of functions which have a special homomorphic property, and "pre-image restriction" is a function which can restrict the receiver to having information on the encrypted message. Then, we propose an encryption scheme with primitive power roots of unity in $({\mathbb Z}/n^{s+1})^{\times}$. We show that our scheme has the above cryptographic properties.
Music, Heart Rate, and Emotions in the Context of Stimulating Technologies
Authors: Jenni Anttonen, Veikko Surakka
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

The present aim was to explore heart rate responses when stimulating participants with technology primarily aimed at the rehabilitation of older adults. Heart rate responses were measured from 31 participants while they listened to emotionally provoking negative, neutral, and positive musical clips. Ratings of emotional experiences were also collected. The results showed that heart rate responses to negative musical stimuli differed significantly from responses to neutral stimuli. The use of emotion-related physiological responses evoked by stimulating devices offers a possibility to enhance, for example, emotionally stimulating or otherwise therapeutic sessions.
Improved Balanced Power Allocation in Uplink MIMO System
Authors: Yilei Yao, Shangzhi Xu, Xinhong Wang
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

This paper studies a balanced power allocation scheme to approach the capacity limits and power consumption reduce simultaneously of orthogonal-frequency- division-multiplexing multiple-input multiple-output (OFDM-MIMO) channels under the assumption that perfect channel state information (CSI) is available at both the transmitter and the receiver. In this paper, We build a function to describe the coordinate performance of capacity and total power, and use convex optimization methodto solve this question, and an adaptive power allocation scheme is proposed according to the interior-point method.By numerical example we verify our analysis and show that proposed approach, compared to the optimal water-filling algorithm, actually achieves significantly lower total power consumption with similar performance in capacity.
Patterns and Pattern Diagrams for Access Control
Authors: Eduardo B. Fernandez, Günther Pernul, Maria M. Larrondo-Petrie
Venue: Proceedings of the 5th international conference on Trust, Privacy and Security in Digital Business (2008)

Access control is a fundamental aspect of security. There are many variations of the basic access control models and it is confusing for a software developer to select an appropriate model for her application. The result in practice is that only basic models are used and the power of more advanced models is thus lost. We try to clarify this panorama here through the use of patterns. In particular, we use pattern diagrams to navigate the pattern space. A pattern diagram shows relationships between patterns and we can see how different models relate to each other. A subproduct of our work is the analysis of which patterns are available for use and which need to be written. Pattern maps are also useful to perform semi-automatic model transformations as required for Model-Driven Development (MDD). The idea is to provide the designer of a secure system with a navigation tool that she can use to select an appropriate pattern from a catalog of security patterns. We also indicate how to compose new access control models by adding features to an existing pattern and how to define patterns by analogy.
On a Parameterized Antidivision Operator for Database Flexible Querying
Authors: Patrick Bosc, Olivier Pivert
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

In this paper, we introduce an algebraic relational operator called antidivision and we describe a range of interpretations that can be attached to this operator in the context of databases with fuzzy relations (i.e., relations that contain weighted tuples).
New Sky Pattern Recognition Algorithm
Authors: Wojciech Makowiecki, Witold Alda
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

We present here a new algorithm which enables the identification of stars in astronomical photographs using readily available star catalogs for this purpose. The algorithm was implemented in a stand-alone application called `Skyprint` capable of performing a matching process. The computational aspect of the problem can be designated to the wide class of image recognition methods and analysis of multidimensional data. The astronomical aspect concentrates on astrometry --- the method of determining the coordinates of stars in the celestial sphere. The problem of identifying star patterns occurs most often in such areas as cosmic probe navigation, adjusting and merging numerous photographs of the sky together, or in recovering missing information in relation to a fragment of the sky represented in the photograph.
A Web-Based Autonomous Weather Monitoring System of the Town of Palermo and Its Utilization for Temperature Nowcasting
Authors: Giorgio Beccali, Maurizio Cellura, Simona Culotta, Valerio Lo Brano, Antonino Marvuglia
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Weather data are crucial to correctly design buildings and their heating and cooling systems and to assess their energy performances. In the intensely urbanized towns the effect of climatic parameters is further emphasized by the "urban heat island" phenomenon, known as the increase in the air temperature of urban areas, compared to the conditions measured in the extra-urban areas. The analysis of the heat island needs detailed local climate data which can be collected only by a dedicated weather monitoring system. The Department of Energy and Environmental Researches of the University of Palermo has built up a weather monitoring system that works 24 hours per day and makes data available in real-time at the web site: www.dream.unipa.it/meteo. The data collected by the system have been used to implement a NNARMAX model aiming to obtain short-term forecasts of the temperature and map them over the monitored area.
Constraint-based Modeling and Ambiguity
Authors: Wolfgang Menzel
Venue: International Journal of Artificial Intelligence in Education (2006)

Constraint-based modeling has been used in many application areas of Intelligent Tutoring Systems as a powerful means to analyse erroneous student solutions and generate helpful feedback. In contrast to domains where the structure of the problem under consideration allows a constraint to (almost) uniquely determine the possible cause of a particular student error, there are other applications where a multitude of competing error explanations has to be considered. In such cases constraint-based models alone hardly meet the requirements for a student model. Instead a constraint-based model clearly serves the purpose of error diagnosis and needs to be complemented by additional components for diagnosis selection based on general or individually tailored heuristics. By investigating the apparent and strong parallelism between constraint-based modeling and model-based diagnosis, this paper identifies four major sources of ambiguity that need to be considered when using constraint-based modeling and describes options for dealing with situations in which alternative error descriptions are available. Examples are primarily drawn from the area of foreign language learning.
Adaptive control with fuzzy logic solution for servo hydraulic linear axis
Authors: Claudiu Ioan Ratiu, Camelia Ioana Ucenic
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

The applicative research conducted by the authors was oriented in the direction of optimizing the static and dynamic performances of the servo-hydraulic linear axes and it aimed at the elaboration of a set of numerical simulation programs that could provide valuable information for the design of servo-hydraulic linear axes, according to the performances requested by up-to-date applications. These are simpler than the electronic ones, they are stronger and they have superior dynamic behavior. Their precision can be upgraded a lot by the use of adaptive electronic controller, whether analogical or digital. With means of compensation of the non-linearity that are the responsibility of the adaptive controllers, in this case the variable rigidity of the oil level inside the engine, can be performed using a position sensor with a positioning precision of ±1 µm/100mm. An experimental research has been conducted to correct and validate the mathematical model and the numerical simulation program of the adaptive controller.
Parallel Array Classes and Lightweight Sharing Mechanisms
Authors: Steve W. Otto
Venue: Scientific Programming (1993)

We discuss a set of parallel array classes, MetaMP, for distributed-memory architectures. The classes are implemented in C++ and interface to the PVM or Intel NX message-passing systems. An array class implements a partitioned array as a set of objects distributed across the nodes - a "collective" object. Object methods hide the low-level message-passing and implement meaningful array operations. These include transparent guard strips (or sharing regions) that support finite-difference stencils, reductions and multibroadcasts for support of pivoting and row operations, and interpolation/contraction operations for support of multigrid algorithms. The concept of guard strips is generalized to an object implementation of lightweight sharing mechanisms for finite element method (FEM) and particle-in-cell (PIC) algorithms. The sharing is accomplished through the mechanism of weak memory coherence and can be efficiently implemented. The price of the efficient implementation is memory usage and the need to explicitly specify the coherence operations. An intriguing feature of this programming model is that it maps well to both distributed-memory and shared-memory architectures.
Limited view CT reconstruction and segmentation via constrained metric labeling
Authors: Vikas Singh, Lopamudra Mukherjee, Petru M. Dinu, Jinhui Xu, Kenneth R. Hoffmann
Venue: Computer Vision and Image Understanding (2008)

This paper proposes a new discrete optimization framework for tomographic reconstruction and segmentation of CT volumes when only a few projection views are available. The problem has important clinical applications in coronary angiographic imaging. We first show that the limited view reconstruction and segmentation problem can be formulated as a 'constrained' version of the metric labeling problem. This lays the groundwork for a linear programming framework that brings metric labeling classification and classical algebraic tomographic reconstruction (ART) together in a unified model. If the imaged volume is known to be comprised of a finite set of attenuation coefficients (a realistic assumption), given a regular limited view reconstruction, we view it as a task of voxels reassignment subject to maximally maintaining consistency with the input reconstruction and the objective of ART simultaneously. The approach can reliably reconstruct (or segment) volumes with several multiple contrast objects. We present evaluations using experiments on cone beam computed tomography.
A Conceptual Graph Approach to Feature Modeling
Authors: Randall C. Bachmeyer, Harry S. Delugach
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

A software product-line is a set of products built from a core set of software components. Although software engineers develop software product-lines for various application types, they are most commonly used for embedded systems development, where the variability of hardware features requires variability in the supporting firmware. Feature models are used to represent the variability in these software product-lines. Various feature modeling approaches have been proposed, including feature diagrams, domain specific languages, constraint languages, and the semantic web language OWL. This paper explores a conceptual graph approach to feature modeling in an effort to produce feature models that have a more natural, and more easily expressed mapping to the problem domain. It demonstrates the approach using a standard Graph Product-line problem that has been discussed in various software product-line papers. A conceptual graph feature model is developed for the graph product-line and it is compared to other feature models for this product-line.
The Legal Environment of Digital Curation --- A Question of Balance for the Digital Librarian
Authors: Mags Mcginley
Venue: Proceedings of the 11th European conference on Research and Advanced Technology for Digital Libraries (2007)

Digital curation is about maintaining and adding value to a trusted body of digital information for current and future use. This requires active management and on-going appraisal over the entire life-cycle of scholarly and scientific materials.Whether there is a desire to make materials as open as possible or a requirement to keep them closed and private (for example in the case of sensitive personal data), legal elements can have a huge impact on the overall ability to effectively curate and preserve digital information over time.The DCC advocates the development of a framework for any curation activity that includes consideration of legal matters throughout. - from copyright and licensing models, to freedom of information and data protection.