ppxscal/embedding_network huggingface dataset:
Strategies for Ontology Negotiation: Finding the Right Level of Generality
Authors: Jurriaan Diggelen, Edwin D. Jong, Marco A. Wiering
Venue: Agent Communication II: International Workshops on Agent Communication, AC 2005 and AC 2006, Utrecht, Netherlands, July 25, 2005, and Hakodate, Japan, May 9, 2006, Selected and Revised Papers (2006)

In heterogeneous multi agent systems, communication is hampered by the lack of shared ontologies. Ontology negotiation is a technique that enables pairs of agents to overcome these difficulties by exchanging parts of their ontologies. As a result of these micro level solutions, a communication vocabulary emerges on a macro level. The goal of this paper is to ensure that this communication vocabulary contains words of the right level of generality, i.e. not overspecific and not overgeneralized. We will propose a number of communication strategies that enable the agents to achieve these goals. Using experimental results, we will compare their performance.
Evaluating the progress of e-government development: A critical analysis
Authors: Mateja Kunstelj, Mirko Vintar
Venue: Information Polity (2004)

The development of e-government in most countries is still primarily aimed at developing electronic services that customers can access via the internet. This has been matched by the methods for monitoring e-government development, which fall far short of providing a true overall assessment. Such a narrow focus on e-government has led to a significant slowdown of development in most countries. Countries have used "quick fix, quick win" solutions, while continued development require above all the development of an integrated government portal and reengineering of back-office processes. The more developed countries are therefore increasingly tailoring their e-government strategies in the direction of customer-orientation and instead of persisting with rigid organisational structures are working on integrating services and processes across individual administrative bodies and institutions and even include private businesses. The development of e-government therefore demands a holistic strategic approach that encompasses the entire public administration and is not limited to individual bodies and institutions, or individual sectors and levels of administration. The methods of monitoring, evaluating and benchmarking e-government development will have to follow the same principles. Based on critical analyses of existing approaches, this paper attempts to define the areas and aspects that must be included within the integrated approach in order to facilitate the progress of e-government towards its strategic objectives, that is the development of services based on user's needs and problems, i.e. integrated services or life-events.
Playing games for security: an efficient exact algorithm for solving Bayesian Stackelberg games
Authors: Praveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ordonez, Sarit Kraus
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the follower or adversary) before the adversary chooses its own strategy. We consider Bayesian Stackelberg games, in which the leader is uncertain about the types of adversary it may face. Such games are important in security domains, where, for example, a security agent (leader) must commit to a strategy of patrolling certain areas, and a robber (follower) has a chance to observe this strategy over time before choosing its own strategy of where to attack. This paper presents an efficient exact algorithm for finding the optimal strategy for the leader to commit to in these games. This algorithm, DOBSS, is based on a novel and compact mixed-integer linear programming formulation. Compared to the most efficient algorithm known previously for this problem, DOBSS is not only faster, but also leads to higher quality solutions, and does not suffer from problems of infeasibility that were faced by this previous algorithm. Note that DOBSS is at the heart of the ARMOR system that is currently being tested for security scheduling at the Los Angeles International Airport.
Constraint and Logic Programming: Ugo Montanari's Main Contributions and Introduction to the Volume Section
Authors: Francesca Rossi
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

This short note introduces the area of constraint and logic programming. I will first briefly describe the main contributions of Ugo Montanari to these disciplines. Then I will summarize the papers contained in this volume, and concerned with either constraint or logic programming, that have been written in honour of Ugo Montanari.
Parametric yield management for 3D ICs: Models and strategies for improvement
Authors: Cesare Ferri, Sherief Reda, R. Iris Bahar
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2008)

Three-Dimensional (3D) Integrated Circuits (ICs) that integrate die with Through-Silicon Vias (TSVs) promise to continue system and functionality scaling beyond the traditional geometric 2D device scaling. 3D integration also improves the performance of ICs by reducing the communication time between different chip components through the use of short TSV-based vertical wires. This reduction is particularly attractive in processors where it is desirable to reduce the access time between the main logic die and the L2 cache or the main memory die. Process variations in 2D ICs lead to a drop in parametric yield (as measured by speed, leakage and sales profits), which forces manufacturers to speed bin their chips and to sell slow chips at reduced prices. In this paper we develop a model to quantify the impact of process variations on the parametric yield of 3D ICs, and then we propose a number of integration strategies that use a graph-theoretic framework to maximize the performance, parametric yield and profits of 3D ICs. Comparing our proposed strategies to current yield-oblivious methods, it is demonstrated that it is possible to increase the number of 3D ICs in the fastest speed bins by almost 2&times;, while simultaneously reducing the number of slow ICs by 29.4&percnt;. This leads to an improvement in performance by up to 6.45&percnt; and an increase of about 12.48&percnt; in total sales revenue using up-to-date market price models.
Uniform Approximation Capabilities of Sum-of-Product and Sigma-Pi-Sigma Neural Networks
Authors: Jinling Long, Wei Wu, Dong Nan
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Investigated in this paper are the uniform approximation capabilities of sum-of-product (SOPNN) and sigma-pi-sigma (SPSNN) neural networks. It is proved that the set of functions that are generated by an SOPNN with its activation function in C(¿) is dense in $C(\mathbb{K})$ for any compact $\mathbb{K}\in \mathbb{R}^N$, if and only if the activation function is not a polynomial. It is also shown that if the activation function of an SPSNN is in C(¿), then the functions generated by the SPSNN are dense in $C(\mathbb{K})$ if and only if the activation function is not a constant.
Organizing and managing personal electronic files: A mechanical engineer's perspective
Authors: B. J. Hicks, A. Dong, R. Palmer, H. C. Mcalpine
Venue: ACM Transactions on Information Systems (TOIS) (2008)

This article deals with the organization and management of the computer files handled by mechanical engineers on their personal computers. In engineering organizations, a wide variety of electronic files (documents) are necessary to support both business processes and the activities of design and manufacture. Whilst a large number of files and hence information is formally archived, a significant amount of additional information and knowledge resides in electronic files on personal computers. The widespread use of these personal information stores means that all information is retained. However, its reuse is problematic for all but the individual as a result of the naming and organization of the files. To begin to address this issue, a study of the use and current practices for managing personal electronic files is described. The study considers the fundamental classes of files handled by engineers and analyses the organization of these files across the personal computers of 40 participants. The study involves a questionnaire and an electronic audit. The results of these qualitative and quantitative elements are used to elicit an understanding of the practices and requirements of engineers for managing personal electronic files. A potential scheme for naming and organizing personal electronic files is discussed as one possible way to satisfy these requirements. The aim of the scheme is to balance the personal nature of data storage with the need for personal records to be shared with others to support knowledge reuse in engineering organizations. Although this article is concerned with mechanical engineers, the issues dealt with are relevant to knowledge-based industries and, in particular, teams of knowledge workers.
Parallel integration of hydrodynamical approximations of the Boltzmann equation for rarefied gases on a cluster of computers
Authors: José Miguel Mantas Ruiz, Lorenzo Pareschi, José Antonio Carrillo, Julio Ortega Lopera
Venue: Journal of Computational Methods in Sciences and Engineering (2004)

The relaxed Burnett system, recently introduced in as a hydrodynamical approximation of the Boltzmann equation, is numerically solved. Due to the stiffness of this system and the severe CFL condition for large Mach numbers, a fully implicit Runge-Kutta method has been used. In order to reduce computing time, we apply a parallel stiff ODE solver based on 4-stage Radau IIA IRK. The ODE solver is combined with suitable first order upwind and second order MUSCL relaxation schemes for the spatial derivatives. Speedup results and comparisons to DSMC and Navier-Stokes approximations are reported for a 1D shock profile.
Towards Approximate BGI Systems
Authors: Barbara Dunin-Keplicz, Andrzej Szałas
Venue: Proceedings of the 5th international Central and Eastern European conference on Multi-Agent Systems and Applications V (2007)

This paper focuses on modelling perception and vague concepts in the context of multiagent Bgi (Beliefs, Goals and Intentions) systems. The starting point is the multimodal formalization of such systems. Then we make a shift from Kripke structures to similarity structures, allowing us to model perception and vagueness in an uniform way, "compatible" with the multimodal approach. As a result we introduce and discuss approximate B gi systems, which can also be viewed as a way to implement multimodal specifications of Bgi systems in the context of perception.
A Linear In-situ Algorithm for the Power of Cyclic Permutation
Authors: Jinyun Xue, Bo Yang, Zhengkang Zuo
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

We present and develop a linear in-situ algorithm for the power of a cyclic permutation Pr(-n< r < n). Several related algorithms become the special cases of this algorithm. At first, we used an abstract structure, named twin ring, to represent cyclic permutation and derive a simple algorithm to compute Pr on twin ring. Then, the algorithm and the abstract structure twin ring were implemented based on PAR platform that consists of a set of program generating tools. The correctness of the final algorithmic program is based on the data coupling invariant and the assumption of PAR Platform correct. The abstract structure twin ring and the program generating tools take a key role in deriving the simple algorithm for computing Pr. The techniques demonstrated in this paper can be used in developing intricate algorithms.
A Linear Algorithm for Edge-Face Coloring Series-Parallel Graphs
Authors: Jian-Liang Wu, Ping Wang
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Let G be a series-parallel graph. In this paper, we present a linear algorithm of constructing an oriented binary decomposition tree of G. We use it to find 33 unavoidable subgraphs of G. Based on these 33 avoidable subgraphs, we can determine the edge-face chromatic number, denoted by ¿ ef (G) , of G where G is 2-connected and Δ(G) = 5. This completes the literature of determining ¿ ef (G) for 2-connected series-parallel graphs.
Computation of algebraic system from self-assembly
Authors: Ming-Deh Huang
Venue:  (2007)

We are interested in finding real positive solutions to posynomial systems of the form: j=1masj pj=cs,s=1,&ldots;,n,where pj=pj s=1n xasjs 1 with asj &isin; R , and &pi;j, cs &isin; R>0 . These systems arise in the study of algorithmic self-assembly. A positive solution of p = (p1,&hellip;, pm) to such a system corresponds to an equilibrium of a reversible self-assembly system. It has been proven that the real positive solution to such a system is unique when the underlying polytope: j=1masj yj=cs,s=1,&ldots;,n, has a real positive point. Existing methods can solve some special cases of this system. The Iterative Proportional Scaling (IPS) method, for instance, can solve the system with constraints that all the elements in the last row of matrix A are 1 and that the elements in matrix A are nonnegative. Another method called Improved Iterative Scaling (IIS) solves the system (1) with all constraints relaxed except for the requirement that A be nonnegative. This thesis proposes a method to solve the system (1) in full generality without constraints. The work starts with exploring the geometric properties of these systems. Based on that, we then extend IPS to find positive solutions to system (1). Numerical analysis related to the computational problems, such as global convergence, convergence rate, and sensitivity analysis, are also discussed in this thesis.
An Application for Electroencephalogram Mining for Epileptic Seizure Prediction
Authors: Bruno Direito, António Dourado, Francisco Sales, Marco Vieira
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

A computational framework to support seizure predictions in epileptic patients is presented. It is based on mining and knowledge discovery in Electroencephalogram (EEG) signal. A set of features is extracted and classification techniques are then used to eventually derive an alarm signal predicting a coming seizure. The epileptic patient may then take steps in order to prevent accidents and social exposure.
Is team training in briefings for surgical teams feasible in simulation?
Authors: Maria Koutantji, Peter McCulloch, Shabnam Undre, Sanjay Gautama, Simon Cunniffe, Nick Sevdalis, Rachel Davis, Piers Thomas, Charles Vincent, Ara Darzi
Venue: Cognition, Technology and Work (2008)

We developed a module for surgical team training using briefings in simulated crisis scenarios and here we report preliminary findings. Nine surgical teams (34 trainees) participated in a pre-training simulation, followed by an interactive workshop on briefing and checklists, and then a post-training simulation. Both technical and non-technical skills were assessed via observation during simulations by expert trainers who provided feedback on performances at the end of simulation. Trainees also reported their attitudes to briefings and evaluated the training. Pre-training attitudes to briefing were positive, some of which improved post-training and trainees&#x2019; evaluation of the training was positive. Surgeons&#x2019; technical skill improved significantly post-training, but their decision-making skill was rated lower than other non-technical skills, compared to other trainees. The training did not appear to greatly improve non-technical skill performance. Training surgical teams in simulation is feasible but much more work is needed on measurement development and training strategy to confirm its efficacy and utility.
Mobile Agent-Based Approach for Resource Discovery in Peer-to-Peer Networks
Authors: Jaafar Gaber, Mohamed Bakhouya
Venue: Agents and Peer-to-Peer Computing: 5th International Workshop, AP2PC 2006, Hakodate, Japan, May 9, 2006, Revised and Invited Papers (2006)

Peer-to-peer networks are distributed computing infrastructures that can provide globally available network resources. Their size and complexity continue to increase and permit an almost ubiquitous availability of resources. Therefore, new discovery approaches are required and need to be highly flexible in order to cope with a dynamically changing environment. In this paper, a distributed agent-based approach for resource discovery in peer-to-peer network is proposed. This approach is based on the mobile agent paradigm and uses random walks to allow dynamic and adaptive resource discovery. We analyze this approach through three distributed resource discovery scenarios by NS2 simulator.
Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
Authors: Antonio Fernández Anta, Miguel A. Mosteiro, Christopher Thraves
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

Nodes in a Sensor Network can collaborate to process the sensed data but, due to unreliability, a monitoring strategy can not rely on individual sensors values. Instead, the network should use aggregated information from groups of sensor nodes [2,3,7]. The topic of this work is the efficient computation of aggregate functions in the highly constrained Sensor Network setting, where node restrictions are modeled as in [4], the random node-deployment is modeled as a geometric graph, and the resulting topology, node identifiers assignment and the assignment of input-values to be aggregated is adversarial.
A geometrical perspective on localization
Authors: Stefan O. Dulman, Aline Baggio, Paul J.M. Havinga, Koen G. Langendoen
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

A large number of localization algorithms for wireless sensor networks (WSNs) are evaluated against the Cramer-Rao Bound (CRB) as an indicator of how good the algorithm performs. The CRB defines the lower bound on the precision of an unbiased localization estimator. The CRB concept, borrowed from GPS localization, however, does not translate well to WSNs. In this paper, we show in which cases the CRB fails to capture troublesome anchor configurations leading to erroneous lower bounds. We continue with a study on the geometrical configurations of anchors favorable to localization algorithms. We conclude by proposing a metric to characterize the stability of the geometry of a certain anchor topology. Future work will address the combination of geometry and statistical metrics with the goal of obtaining a clear image on localization algorithms boundaries.
Attacking State-of-the-Art Software Countermeasures--A Case Study for AES
Authors: Stefan Tillich, Christoph Herbst
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

In order to protect software implementations of secret-key cryptographic primitives against side channel attacks, a software developer has only a limited choice of countermeasures. A combination of masking and randomization of operations in time promises good protection and can be realized without too much overhead. Recently, new advanced DPA methods have been proposed to attack software implementations with such kind of protection. In this work, we have applied these methods successfully to break a protected AES software implementation on a programmable smart card. Thus, we were able to verify the practicality of the new attacks and to estimate their effectiveness in comparison to traditional DPA attacks on unprotected implementations. In the course of our work, we have also refined and improved the original attacks, so that they can be mounted more efficiently. Our practical results indicate that the effort required for attacking the protected implementation with the examined methods is more than two orders of magnitude higher compared to an attack on an unprotected implementation.
Intelligent instrumentation and a robust dynamic model for an ultrasonic navigation system for improved neuro-surgery
Authors: Ajay Mahajan
Venue:  (2007)

An intelligent instrumentation and a Kalman filter based dynamic model has been developed to find the position of ultrasonic transmitters in an inertial frame of reference. The position estimation method collects Actual Time of Flights (ATOF) and Difference in Time of Arrival (DTOA) data from the transducers. To show proof of concept in 1D, two ultrasonic receivers are used to provide position estimations of two transmitters in 1D using ATOF and DTOA approaches. A micro-controller based intelligent hardware on both transmitter and receiver side has been designed and implemented on printed circuit boards. The electronic circuits use a combination of analog and digital components that feed into the microcontroller to give the transmitter position estimates. The position estimate of the transmitters is obtained from the ATOF and DTOA of the wave bursts received at multiple receivers fixed at known locations. This information is then given to a Kalman filter algorithm for post processing to further increase the accuracy and robustness of the output results. An innovative scheme to tag each transmitter has also been developed and implemented. A first prototype has been built for the 1D case and has been thoroughly tested under numerous extreme conditions. Results are provided for this system as well as a detailed plan on how to extend this system to the 2D and 3D cases. Even though the system has been designed for realtime image guided surgery, it has many applications such as robotics, virtual reality and motion capture studies for ergonomics.
Design of low cost universal artificial neuron controller for chopper fed embedded DC drives
Authors: N. Senthil Kumar, V. Sadasivam, H. M. Asan Sukriya, S. Balakrishnan
Venue: Applied Soft Computing (2008)

Artificial neural network (ANN) has become very popular in many control applications due to their high computation rate and ability to handle nonlinear functions. This paper proposes an artificial neuron controller for closed loop speed control of DC drive fed by DC chopper. Neuron control is used to reduce the steady state error, overshoot and settling time. The signal corresponding to the motor speed error and change in speed error are used as inputs to ANN Controller. The controller outputs the required change in duty cycle of pulse width modulated gating signal applied to DC chopper. Thus the voltage fed to the armature of the DC motor is adjusted for achieving the desired speed response. The training patterns for the neuron controller are obtained from the conventional PI controller and the effectiveness of the proposed neuron controller is studied using simulation studies. The designed controller was implemented in a low cost 8051-based embedded system and the results are documented. Two-loop control system was implemented with an inner ON/OFF current controller and an outer ANN speed controller. A conventional controller has heavy computation burden whereas a trained neural network requires less computation time. The artificial neural network has the ability to generalize and can interpolate in between the training data. This advantage of ANN makes the ANN controller universal. The ANN controller designed was tested on two different motors and found to work effectively on driving both of them.