ppxscal/embedding_network huggingface dataset:
Towards a Delegation Framework for Aerial Robotic Mission Scenarios
Authors: P. Doherty, John-Jules Ch. Meyer
Venue: Proceedings of the 11th international workshop on Cooperative Information Agents XI (2007)

The concept of delegation is central to an understanding of the interactions between agents in cooperative agent problem-solving contexts. In fact, the concept of delegation offers a means for studying the formal connections between mixed-initiative problem-solving, adjustable autonomy and cooperative agent goal achievement. In this paper, we present an exploratory study of the delegation concept grounded in the context of a relatively complex multi-platform Unmanned Aerial Vehicle (UAV) catastrophe assistance scenario, where UAVs must cooperatively scan a geographic region for injured persons. We first present the scenario as a case study, showing how it is instantiated with actual UAV platforms and what a real mission implies in terms of pragmatics. We then take a step back and present a formal theory of delegation based on the use of 2APL and KARO. We then return to the scenario and use the new theory of delegation to formally specify many of the communicative interactions related to delegation used in achieving the goal of cooperative UAV scanning. The development of theory and its empirical evaluation is integrated from the start in order to ensure that the gap between this evolving theory of delegation and its actual use remains closely synchronized as the research progresses. The results presented here may be considered a first iteration of the theory and ideas.
A Lightweight Mobile TV Recommender
Authors: Arian Bär, Andreas Berger, Sebastian Egger, Raimund Schatz
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

In this paper we present a novel program recommender for DVB-H based Mobile TV systems. It addresses the restriction of low processing resources on the client devices and is fully compliant to the OMA BCAST standard. There is no learning phase included and hence users can instantly start using the system. Based on the proposed, highly scalable architecture design we implemented a prototype application that employs a powerful, though minimal, mobile user interface.
The repeatability analysis of industrial robot under loaded conditions and various distances
Authors: Ahmad Rasdan Ismail, Azmi Hassan, Syamimi Syamsuddin, Mohd Zaki Nuawi, Shahrum Abdullah, Hairunnisa Mohamad Ibrahim
Venue: Proceedings of the 8th WSEAS International Conference on Robotics, Control and Manufacturing Technology (2008)

The increasing usage of robots in manufacturing operations is due to its flexibility and its ability to be reprogrammed easily when the old task changes. The main obstacle in the robotics applications is to minimize the positional errors when it is under real working conditions. This implies that robots have to perform accurately under loaded conditions at any location within the working envelope. The aim of this research is to evaluate the performance of industrial robot under payload and various distances within the working envelope. Relationship between the location and payload versus repeatability are to be obtained. The experimental work and statistical analysis was performed in order to achieve the desired objective of the research. The study of linear performance has been carried out and the results show that the FANUC Robot Arc Mate 100i under the study has the linear repeatability of 2.125 mm. The repeatability value obtained was not the same compare to the manufacturer specification due to various factors that cannot be avoided. Statistical analysis shows that the distance from robot center has significantly affects the repeatability performance of the robot.
An Agent-Based Architecture to Add Security in a Cooperative Information System
Authors: L. Huin, D. Boulanger
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Nowadays, information is considered a strategic, rather than an operational, resource for those organizations needing to share, and access to, heterogeneous and geographically widely-distributed information sources. Solutions proposed in industrial or academic research solve the problems linked to technical and semantic heterogeneity and take into account the principles of autonomy, transparency and evolutivity. However, few of these solutions consider the critical aspect of access control security in these architectures. This paper deals with this security aspect in a cooperative information system and is about the design of a system able to manage and control access security to global information shared among its stakeholders.
Component Adaptation Architectures A Formal Approach
Authors: Andreea Vescan
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

Component selection and component adaptation are crucial problems in Component Based Software Engineering. In any component selection method, it is unrealistic to expect a perfect match between components needed and components available. Adapting the selected components to meet the specific need of the user is not an easy task. The aim of this research is to provide a formal mathematical model for component function adaptation. We introduce four component adaptation architectures for component functional adaptation. The behavior adaptation constraints for each architecture are discussed.
Reexamining the MKM Value Proposition: From Math Web Search to Math Web ReSearch
Authors: Andrea Kohlhase, Michael Kohlhase
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

The interest of the field of Mathematical Knowledge Management is predicated on the assumption that by investing into markup or formalization of mathematical knowledge, we can reap benefits in managing (creating, classifying, reusing, verifying, and finding) mathematical theories, statements, and objects. This global value proposition has been used to motivate the pursuit of technologies that can add machine support to these knowledge management tasks. But this (rather naive) technology-centered motivation takes a view merely from the global (macro) perspective, and almost totally disregards the user's point of view and motivations for using it, the local (micro) perspective.In this paper we go a first step into a more principled analysis of the MKM value proposition by focusing on motivations for mathematical search engines from the micro perspective. We will use a table-based method called the "Added-Value Analysis" (AVA) developed by one of the authors. Even though we apply the AVA only to mathematical search engines, the method quickly leads to value considerations that are relevant for the whole field of MKM.
Thread Priority-Aware Random Replacement in TLBs for a High-Performance Real-Time SMT Processor
Authors: Emre Özer, Stuart Biles
Venue: Proceedings of the 12th Asia-Pacific conference on Advances in Computer Systems Architecture (2007)

This paper proposes a novel random replacement method in fully or set associative structures such as TLBs to improve the performance of the main or high-priority thread running in an SMT processor along with other low-priority threads. The proposed random replacement technique considers the thread priorities when performing a random selection of evicted entries in the table. The replacement scheme increases the probability of evicting a low-priority thread entry by generating more than one random number index. We have shown that this simple and low-cost random replacement logic can boost the performance of the high-priority thread significantly with only minimal additional hardware support. Our results indicate that generating only 3 random numbers can increase the performance of the high-priority thread by about 9%, and provides the highest overall IPC for an 8-entry data TLB.
Utilizing RFIDs for Location Aware Computing
Authors: Benjamin Becker, Manuel Huber, Gudrun Klinker
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

This paper focuses on the possibilities of utilizing infrastructural RFIDs for location aware computing.A key to automated computer aided work is location and situation awareness. This allows the system to operate independently from direct user input, minimizing the impact on the original process. For demonstration purposes a large area tracking system using existing RFID technology and infrastructure is developed and evaluated. As a first possible application we embed the system into an aircraft cabin.The localization procedure is based on the coordinates of the RFID transponders detected by the RFID reader, as well as the orientation information measured by a gyroscope. Position estimation is accomplished through an iterative algorithm, optimizing the position of the antenna's readability field with respect to the currently visible tags. The average error is below half a meter.Possible use cases range from maintenance assistance to way finding in commercial shops or underground parking lots.
Manetkit: A Framework for MANET Routing Protocols
Authors: Rajiv Ramdhany, Geoff Coulson
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Research in MANETs has resulted in the development of numerous and diverse routing protocols. We argue in this paper that this diversity is inherent to the MANET domain and therefore it will be important in future environments to simultaneously support multiple MANET protocols. On this basis, we propose a highly configurable component framework that facilitates the support of multiple MANET protocols and accommodates pluggable protocol functionality. Importantly, the framework also allows protocols to be composed, decomposed and hybridised in a variety of ways to create value-added functionality. In addition, it has coherent support for dynamic reconfiguration which opens the possibility for protocol hybridisation strategies to be safely executed at run-time. The paper outlines the functionality of the framework, illustrates its configurability, and offers a preliminary performance evaluation that demonstrates acceptable overhead.
A Model-Based Approach to Supporting Configuration in Ubiquitous Systems
Authors: Tony Mcbryan, Phil Gray
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

This paper presents an approach for representing, and providing computer support for, the configuration of interactive systems, particularly ubiquitous systems, that offers a flexible method for combining a wide range of configuration techniques. There are many existing techniques offering dynamic adaptation, ranging from fully automatic through context-sensitive to user-driven. We propose a model that unifies all of these techniques and offers a rich choice of ways of combining them, based on the concept of configuration possibilities, evaluation functions applicable to sets of these possibilities and approaches for parameterising the functions and combining the results. We present a concept demonstrator implementation of the model, designed for home care systems, and describe a set of use cases based on this prototype implementation that illustrate the power and flexibility of the approach.
Most Power Reliable Paths Algorithm for Maximizing the Lifetime of Energy Constrained Sensor Networks
Authors: Moonseong Kim, Hyunseung Choo, Won Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

In wireless sensor networks, maximizing battery life (network lifetime), and thus the number of messages the networks can support (network capacity), is a key issue. In this paper, we propose an algorithm, called Most Power Reliable Paths (MoPoRePa), for on-line message routing in energy constrained wireless sensor networks. The time complexity of MoPoRePa is significantly lower than the well-known max min zP min algorithm. Moreover, simulation studies show that MoPoRePa about 14.75 % and 8.05 % improvement over the max min zP min algorithm in terms of network capacity and the network lifetime, respectively.
A Service Oriented Approach to Traffic Dependent Navigation Systems
Authors: Petra Brosch
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Navigation systems play an important role in planning of routes for transportation and individual traffic. The calculated routes are not always optimal, because routing relies on static speeds for different road types and on outdated and error prone Traffic Message Channel (TMC) data which do not reflect current traffic situations. This leads to the effect, that vehicles are directed to “preferred” routes for at least some time resulting in traffic jam on these routes. In order to overcome the suboptimal solution, floating car data (FCD) reflecting the real time traffic has to be integrated in the calculation. In this paper we present an architecture for real time traffic dependent navigation systems that is based on a service oriented approach. This architecture considers mediation of real time traffic input, data preprocessing ensuring correct and reliable traffic data, and service provisioning. We discuss the challenges in each of these areas.
Lattice paths and generalized cluster complexes
Authors: Sen-Peng Eu, Tung-Shan Fu
Venue: Journal of Combinatorial Theory Series A (2008)

In this paper we propose a variant of the generalized Schroder paths and generalized Delannoy paths by giving a restriction on the positions of certain steps. This generalization turns out to be reasonable, as attested by the connection with the faces of generalized cluster complexes of types A and B. As a result, we derive Krattenthaler's F-triangles for these two types by a combinatorial approach in terms of lattice paths.
Multilevel algorithms for Rannacher&#x2013;Turek finite element approximation of 3D elliptic problems
Authors: I. Georgiev, J. Kraus, S. Margenov
Venue: Computing (2008)

Generalizing the approach of a previous work of the authors, dealing with two-dimensional (2D) problems, we present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher Turek non-conforming finite elements. Preconditioners based on various multilevel extensions of two-level finite element methods (FEM) lead to iterative methods which often have an optimal order computational complexity with respect to the number of degrees of freedom of the system. Such methods were first presented by Axelsson and Vassilevski in the late-1980s, and are based on (recursive) two-level splittings of the finite element space. An important point to make is that in the case of non-conforming elements the finite element spaces corresponding to two successive levels of mesh refinement are not nested in general. To handle this, a proper two-level basis is required to enable us to fit the general framework for the construction of two-level preconditioners for conforming finite elements and to generalize the method to the multilevel case. In the present paper new estimates of the constant &#x03b3; in the strengthened Cauchy&#x2013;Bunyakowski&#x2013;Schwarz (CBS) inequality are derived that allow an efficient multilevel extension of the related two-level preconditioners. Representative numerical tests well illustrate the optimal complexity of the resulting iterative solver, also for the case of non-smooth coefficients. The second important achievement concerns the experimental study of AMLI solvers applied to the case of micro finite element (&#x03bc;FEM) simulation. Here the coefficient jumps are resolved on the finest mesh only and therefore the classical CBS inequality based convergence theory is not directly applicable. The obtained results, however, demonstrate the efficiency of the proposed algorithms in this case also, as is illustrated by an example of microstructure analysis of bones.
Cellular automata and two-level systems dynamics - Spreading of disorder
Authors: A. Kowalewska-Kudłaszyk, W. Leoński
Venue: Journal of Computational Methods in Sciences and Engineering (2008)

We focus on description of disorder in a system which is composed of a large number of two level subsystems using the cellular automata formalism. We introduce parameters which can be used as a measure of disorder spreading in such a complex system. These parameters are defined via the entropy and we show their usefulness for description of disorder in the system discussed.
MobSOS - A Testbed for Mobile Multimedia Community Services
Authors: Dominik Renzel, Ralf Klamma, Marc Spaniol
Venue: Proceedings of the 2008 Ninth International Workshop on Image Analysis for Multimedia Interactive Services (2008)

Due to recent developments in the domain of mobile broadband communication and a growing availability of standardized development tools for mobile devices a new generation of mobile services and applications is expected to emerge in the near future combining well-established multimedia and community concepts with mobile aspects. However, it is often challenging to predict the success of such new services. In this paper we present a short overview of the MobSOS testbed and its homonymous success model based on a combination of traditional information system success models with modern requirements for mobile multimedia communities. Finally we outline the application of the MobSOS testbed to NMV Mobile, a mobile multimedia capturing, annotation and retrieval tool.
Generating CAM aspect-oriented architectures using Model-Driven Development
Authors: Lidia Fuentes, Mónica Pinto, Pablo Sánchez
Venue: Information and Software Technology (2008)

Aspect-Oriented Software Development promotes the separation of those concerns that cut across several components and/or are tangled with the base functionality of a component, through all phases of the software lifecycle. The benefit of identifying these crosscutting concerns (aspects) at the architectural level in particular is to improve the architecture design and its subsequent evolution, before moving onto detailed design and implementation. However, software architects are not usually experts on using specific AO architecture notations. Therefore, the aim of this paper is to provide support to define and specify aspect-oriented (AO) architectures using non-AO ones as the source. We will use the Model-Driven Development approach to transform a component-based architecture model into an AO architecture model. The CAM (component and aspect model) model and the DAOP-ADL language are the proposals used for modelling and specifying AO architectures. We will show how we automated part of the process and the tool support.
Traffic Prediction for Agent Route Planning
Authors: Jan D. Gehrke, Janusz Wojtusiak
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

This paper describes a methodology and initial results of predicting traffic by autonomous agents within a vehicle route planning system. The traffic predictions are made using AQ21, a natural induction system that learns and applies attributional rules. The presented methodology is implemented and experimentally evaluated within a multiagent-based simulation system. Initial results obtained by simulation indicate advantage of agents using AQ21 predictions when compared to naïve agents that make no predictions and agents that use only weather-related information.
Note: FPTAS for half-products minimization with scheduling applications
Authors: Erdal Erel, Jay B. Ghosh
Venue: Discrete Applied Mathematics (2008)

A special class of quadratic pseudo-boolean functions called ''half-products'' (HP) has recently been introduced. It has been shown that HP minimization, while NP-hard, admits a fully polynomial time approximation scheme (FPTAS). In this note, we provide a more efficient FPTAS. We further show how an FPTAS can also be derived for the general case where the HP function is augmented by a problem-dependent constant and can justifiably be assumed to be nonnegative. This leads to an FPTAS for certain partitioning type problems, including many from the field of scheduling.
Tree-Sequent Methods for Subintuitionistic Predicate Logics
Authors: Ryo Ishigaki, Kentaro Kikuchi
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate logics of this kind by the method of tree-sequent calculus (a special form of Labelled Deductive System). After proving the completeness with respect to some classes of Kripke models, we introduce Hilbert-style axiom systems and prove their completeness through a translation from the tree-sequent calculi. This gives a solution to the problem posed by Restall.
A GRelC based Data Grid Management Environment
Authors: Sandro Fiore, Maria Mirto, Massimo Cafaro, Salvatore Vadacca, Alessandro Negro, Giovanni Aloisio
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Data grid management systems are becoming increasingly important in the context of the recently adopted service oriented science paradigm. The Grid Relational Catalog (GRelC) project is working towards ubiquitous, integrated, seamless and comprehensive data grid management solutions to fully address application specific requirements. This paper describes a GRelC based environment for bioinformatics and its underlying data grid services allowing scientific users (by means of a customized grid portal) to manage data, handle, share and publish metadata, perform search and discovery activities, etc.
Optimizing the CAD Process for Detecting Mammographic Lesions by a New Generation Algorithm Using Linear Classifiers and a Gradient Based Approach
Authors: Philippe Bamberger, Isaac Leichter, Nicolas Merlet, Eli Ratner, Glenn Fung, Richard Lederman
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

This study evaluates the performance of a new generation algorithm designed to both increase detection sensitivity of cancers and to markedly reduce the false mark rate. In the advanced algorithm, several improvements were implemented. The algorithm for the initial detection of potential mass candidates was upgraded to ignore dense areas that do not represent masses. For the initial detection of potential clusters candidates, the advanced algorithm considers interdependence between various stages of the parametric clusterization process and implements automatic performance optimization. Moreover, the advanced algorithm includes a one-step global classification model, which assigns a score to each candidate lesion, instead of sequential multi-step filtration at various steps of the algorithm. Both the advanced and the previous algorithm were run on 83 malignant cases, with proven pathology, and on 523 normal screening cases that were consecutively culled from 4 clinical sites. The overall sensitivity of the advanced algorithm was 86%, compared to a sensitivity of 84% for the previous one. The false mark (FM) rate per case, decreased from 3.20 for the previous algorithm, to 1.39 for the advanced one. The advanced algorithm reduced both mass FMs and cluster FMs. In conclusion, the new algorithm outperforms the old one with a slight increase in sensitivity and with a substantial reduction in false mark rate for both masses and clusters.