ppxscal/embedding_network huggingface dataset:
Design Patterns for Combining Social and Individual Intelligences on Modular-Based Agents
Authors: Bianca Innocenti, Beatriz López, Joaquim Salvi
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

Design patterns have been recently concerned in the multi-agent community for the design of systems with decentralized coordination. In this paper we present a design pattern for dealing with the complexity of developing a decentralized coordination multi-agent system for controlling a single robot. In our pattern, we combine different intelligences: an individual intelligence that enables agents to achieve their own goals, and a social intelligence that makes agents understand and manage with other agents in the community. The design pattern facilitates the implementation of modular-based agents inside the multi-agent architecture and its use helps developers when incorporating new agents in the architecture. The multi-agent architecture is used to control a Pioneer 2DX mobile robot.
Performance Analysis of a Multiagent Architecture for Passenger Transportation
Authors: Claudio Cubillos, Franco Guidi-Polanco, Ricardo Soto
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

This work describes the development and results on an agent architecture devoted to the planning and scheduling of passenger trips by using the contract-net protocol as base coordination mechanism. The architecture named MADARP, has been implemented over Jade, and provides a set of base agents that perform the basic interface, planning and support services, which can be extended to tackle specific passenger transport conditions and scenarios. In particular, this paper will focus on the planning agents, their coordination mechanism and its performance in a distributed scenario. The agent use allows easily adapting the architecture to different assigning and scheduling models. This work presents the results of a performance test, analyzing two different rates for the requests' arrivals under a distributed scenario with diverse number of hosts.
Moving E-Commerce with PIVOTS: Private Information Viewing Offering Total Safety
Authors: Angelos Yannopoulos Yiannis Stavroulas Theodora A. Varvarigou
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

We present a technology which enables wide-scale deployment of a unique and powerful data access and search tool. This tool makes it possible for content owners on the Internet to offer end-users the ability to search, assess, or otherwise examine their nondisclosable private data. The end-users may use arbitrary, distrusted assessment algorithms and receive the results which are produced. These results take the form of a meaningful digest, e.g., a useful statistic, a relevance assessment, etc. There exists some controllable danger of information theft which, however, is quantitatively dependent on system parameters and can be tuned accordingly. We consider a broad class of practical applications where brute force attacks exist which are easier and cheaper to implement than an attack through appropriately configured PIVOTS, making our system, effectively, very trustworthy. The actual creation of the search algorithm may be performed by the end-users themselves in specialized applications, or by third-party search-engine operators who offer their services to end-users. Sophisticated data mining technologies which are very often not directly available to content owners can thus be exploited to mine even private data collections. Users discovering interesting items in private data sets may purchase this specific data, but other desirable exploitation possibilities are also analyzed. A novel business model is presented and its potential for great impact on e-commerce is explored. Three diverse and important real-world applications are presented in conclusion.
Digital computers for linear, real-time control systems
Authors: Ralph B. Conn
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

A digital computer operating in a real-time control system is an information-processing device. Heretofore, special-purpose, general-purpose computers have been designed for use in these systems. This paper begins by considering the basic equation for discrete, linear, real-time control systems. The operations that must be performed are enumerated and described. Several methods for accomplishing each operation are discussed, pointing out the ad-advantages and disadvantages of each method. In conclusion the weighting-function computer is compared with the special-purpose, general-purpose computer and the digital-differential analyzer.
Dynamical Regularization in Scalefree-Trees of Coupled 2D Chaotic Maps
Authors: Zoran Levnajić
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

The dynamics of coupled 2D chaotic maps with time-delay on a scalefree-tree is studied, with different types of the collective behaviors already been reported for various values of coupling strength [1]. In this work we focus on the dynamics' time-evolution at the coupling strength of the stability threshold and examine the properties of the regularization process. The time-scales involved in the appearance of the regular state and the periodic state are determined. We find unexpected regularity in the the system's final steady state: all the period values turn out to be integer multiples of one among given numbers. Moreover, the period value distribution follows a power-law with a slope of -2.24.
Improved Lower Limits for Pheromone Trails in Ant Colony Optimization
Authors: David C. Matthews
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Ant Colony Optimization algorithms were inspired by the foraging behavior of ants that accumulate pheromone trails on the shortest paths to food. Some ACO algorithms employ pheromone trail limits to improve exploration and avoid stagnation by ensuring a non-zero probability of selection for all trails. The MAX-MIN Ant System (MMAS) sets explicit pheromone trail limits while the Ant Colony System (ACS) has implicit pheromone trail limits. Stagnation still occurs in both algorithms with the recommended pheromone trail limits as the relative importance of the pheromone trails increases (¿> 1). Improved estimates of the lower pheromone trail limit (¿ min ) for both algorithms help avoid stagnation and improve performance for ¿> 1. The improved estimates suggest a general rule to avoid stagnation for stochastic algorithms with explicit or implicit limits on exponential values used in proportional selection.
Minimizing the Imbalance Problem in Chromatographic Profile Classification with One-Class Classifiers
Authors: António V. Sousa, Ana Maria Mendonça, Aurélio Campilho
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

This paper presents a new classification approach to deal with class imbalance in TLC patterns, which is due to the huge difference between the number of normal and pathological cases as a consequence of the rarity of LSD diseases. The proposed architecture is formed by two decision stages: the first is implemented by a one-class classifier aiming at recognizing most of the normal samples; the second stage is a hierarchical classifier which deals with the remaining outliers that are expected to contain the pathological cases and a small percentage of normal samples. We have also evaluated this architecture by a forest of classifiers, using the majority voting as a rule to generate the final classification. The results that were obtained proved that this approach is able to overcome some of the difficulties associated with class imbalance.
Towards automated design of MAC protocols for underwater wireless networks
Authors: Volkan Rodoplu, Amir Aminzadeh Gohari, Wei Tang
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

We present a framework for the automated design of MAC protocols for underwater acoustic wireless networks. We formulate a protocol optimization problem in which the exchange of control packets is explicitly modeled. A protocol optimization program generates the optimal response functions to the reception of control packets. In a single MAC neighborhood, each node is modeled as having a behavioral model of the rest of the nodes in the network, where the node behavior is to be optimized. In this framework, we solve the problem of minimizing the average energy consumption of a network subject to a per-node minimum throughput constraint. Our results display the optimal responses for the scheduling of control and data packets for all of the nodes. This work serves as a starting point for the design of automation tools for MAC protocols in the future.
Extending Knowledge Base Update into First-Order Knowledge Bases
Authors: Ewa Madalińska-Bugaj, Witold Łukaszewicz
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this paper, we introduce a new belief update operator. In contrast to all existing approaches to this problem, which are based on propositional or description logics, our proposal admits representing knowledge bases in full first-order logic. In consequence, our proposal is much more expressive than the existing ones.
Neuro-fuzzy Based Maneuver Detection for Collision Avoidance in Road Vehicles
Authors: M. A. Zamora-Izquierdo, R. Toledo-Moreo, M. Valdés-Vela, D. Gil-Galván
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

The issue of collision avoidance in road vehicles has been investigated from many different points of view. An interesting approach for Road Vehicle Collision Assistance Support Systems (RVCASS) is based on the creation of a scene of the vehicles involved in a potentially conflictive traffic situation. This paper proposes a neuro-fuzzy approach for dynamic classification of the vehicles roles in a scene. For that purpose, different maneuver state models for longitudinal movements of road vehicles have been defined, and a prototype has been equipped with INS (Inertial Navigation Systems) and GPS (Global Positioning System) sensors. Trials with real data show the suitability of the proposed neuro-fuzzy approach for solving support to the problem under consideration.
Fully Distributed Algorithms for Convex Optimization Problems
Authors: Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah
Venue: Proceedings of the 21st international symposium on Distributed Computing (2007)

We describe a distributed algorithm for convex constrained optimization in networks without any consistent naming infrastructure. The algorithm produces an approximately feasible and near-optimal solution in time polynomial in the network size, the inverse of the permitted error, and a measure of curvature variation in the dual optimization problem. It blends, in a novel way, gossip-based information spreading, iterative gradient ascent, and the barrier method from the design of interior-point algorithms.
Resolution requirements for aero-optical simulations
Authors: Ali Mani, Meng Wang, Parviz Moin
Venue: Journal of Computational Physics (2008)

Analytical criteria are developed to estimate the error of aero-optical computations due to inadequate spatial resolution of refractive index fields in high Reynolds number flow simulations. The unresolved turbulence structures are assumed to be locally isotropic and at low turbulent Mach number. Based on the Kolmogorov spectrum for the unresolved structures, the computational error of the optical path length is estimated and linked to the resulting error in the computed far-field optical irradiance. It is shown that in the high Reynolds number limit, for a given geometry and Mach number, the spatial resolution required to capture aero-optics within a pre-specified error margin does not scale with Reynolds number. In typical aero-optical applications this resolution requirement is much lower than the resolution required for direct numerical simulation, and therefore, a typical large-eddy simulation can capture the aero-optical effects. The analysis is extended to complex turbulent flow simulations in which non-uniform grid spacings are used to better resolve the local turbulence structures. As a demonstration, the analysis is used to estimate the error of aero-optical computation for an optical beam passing through turbulent wake of flow over a cylinder.
Urban Roughness Parameters Calculation in the City of Rome by Applying Analytical and Simplified Formulations: Comparison of Results
Authors: Maria Ioannilli, Enrico Rocchi
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

The mesoscale metereological models are the most used to study air quality and pollutant dispersion processes in urban areas. However they don't have the spatial resolution to directly simulate the fluid dynamics and thermodynamics in and around buildings and other urban structures that can modify the atmospheric characteristics. In order to improve the quality and consistency of mesoscale models the most extensively adopted approach is the "Urban Canopy Parametrization" (UCP) which allows to describe geometric and morphological characteristics of urban agglomerations by a range of parameters derived from analysis of high resolution databases. This work has the aim to analytically determine some of these parameters and an automatic procedure has been implemented by Arcgis 9, using as input data the vectorial numerical geodatabase of the city of Rome, coded in 1:2.000 scale and provided by CARTESIA S.p.A. This procedure has been applied to the IX district of the city of Rome, whose full extent is about 8.1 km2.
Exploratory Case Study Research on Web Accessibility
Authors: Marie-Luise Leitner, Christine Strauss
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Various technical studies have been conducted on web accessibility evaluation; research on its business and managerial benefits has been covered sparsely so far due to reservations regarding its business pay-off. This paper aims at resolving these reservations and suggests a research design for an exploratory, business-oriented analysis of web accessibility and presents a conceptual framework for the execution of case study research in four major industry sectors. The reapplication of this methodology to any real world case results in a case study collection that can be extended continuously and therefore represents an important basis for further quantitative and qualitative research.
Motor current signature analysis and its applications in induction motor fault diagnosis
Authors: Neelam Mehala, Ratna Dahiya
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The Motor Current Signature Analysis (MCSA) is considered the most popular fault detection method now a day because it can easily detect the common machine fault such as turn to turn short ckt, cracked /broken rotor bars, bearing deterioration etc. The present paper discusses the fundamentals of Motor Current Signature Analysis (MCSA) plus condition monitoring of the induction motor using MCSA. In addition, this paper presents four case studies of induction motor fault diagnosis. The results show that Motor current signature analysis (MCSA) can effectively detect abnormal operating conditions in induction motor applications.
Assessing Learner's Scientific Inquiry Skills Across Time: A Dynamic Bayesian Network Approach
Authors: Choo-Yee Ting, Mohammad Reza Zadeh
Venue: Proceedings of the 11th international conference on User Modeling (2007)

In this article, we develop and evaluate three Dynamic Bayesian Network (DBN) models for assessing temporally variable learner scientific inquiry skills (Hypothesis Generation and Variable Identification) in INQPRO learning environment. Empirical studies were carried out to examine the matching accuracies and identify the models' drawbacks. We demonstrate how the insights gained from a preceding model have eventually led to the improvement of subsequent models. In this study, the entire evaluation process involved 6 domain experts and 61 human learners. The matching accuracies of the models are measured by (1) comparing with the results gathered from the pretest, posttest, and learner's self-rating scores; and (2) comments given by domain experts based on learners' interaction logs and the graph patterns exhibited by the models.
An Efficient Strip-Mining Algorithm for Improving SRF Bandwidth Utilization on Imagine
Authors: Wenjing Yang, Jing Du, Fujiang Ao, Xuejun Yang
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Strip-mining is a crucial technique for memory hierarchy optimization. In this paper, we propose an efficient strip-mining algorithm for improving SRF bandwidth utilization on Imagine. Firstly, we present how to determine the optimal kernel set for strip-mining. The process is based on a novel structure proposed by us, namely kernel reuse graph. Secondly, we select the optimal strip size, so as to achieve the tradeoff between stream reuse and stream prefetching. Finally, we propose the efficient strip-mining algorithm, which is implemented in SCompiler. The experiment results show that our strip-mining algorithm is a practical and promising solution to improve SRF locality and hide the memory access overhead effectively on Imagine.
MARCoPlan: MultiAgent Remote Control for Robot Motion Planning
Authors: Sonia Kefi, Ines Barhoumi, Ilhem Kallel, Adel M. Alimi
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

A multiagent system to support a mobile robot motion planning has been presented. Baptized MARCoPlan (MutiAgent Remote Control motion Planning), this system deals with optimizing robot path. Considered as an agent, the robot has to optimize its motion from a start position to a final goal in a dynamic and unknown environment, on the one hand by the introduction of sub-goals, and on the other hand by the cooperation of multiagents. In fact, we propose to agentify the proximity environment (zones) of the robot; cooperation between theses zones agents will allow the selection of the best sub-goal to be reached. Therefore, the task of the planner agent to guide the robot to its destination in an optimized way will be easier. MARCoPlan is simulated and tested using randomly and dynamically generated problem instances with different distributions of obstacles. The tests verify some robustness of MARCoPlan with regard to environment changes. Moreover, the results highlight that the agentification and the cooperation improve the choice of the best path to the sub goals, then to the final goal.
Synchronizing Automata and the Černý Conjecture
Authors: Mikhail V. Volkov
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

We survey several results and open problems related to synchronizing automata. In particular, we discuss some recent advances towards a solution of the Černý conjecture.
Two hybrid stepper motor models
Authors: Dragos Deaconu, Aurel Chirila, Valentin Navrapescu, Mihaela Albu, Constantin Ghita, Claudia Popescu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The paper is focused on the modeling and simulation of a Hybrid Step Motor (HSM). Starting from a real life HSM and using information from technical literature two HSM models have been developed. The first of them is used to analyze HSM's response to different types of commands. The second model is used for the HSM's electromagnetic field analysis.
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
Authors: Andreas Wiese, Evangelos Kranakis
Venue: Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems (2008)

We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geographic coordinates in the plane (location aware nodes). Our algorithms are local in the sense that the status of each node v (whether or not v is in the computed set) depends only on the vertices which are a constant number of hops away from v. This constant is independent of the size of the network. We give upper bounds for the constant depending on the desired approximation ratio. We show that the processing time which is necessary in order to compute the status of a single vertex is bounded by a polynomial in the number of vertices which are at most a constant number of vertices away from it. Our algorithms give the best possible approximation ratios for this setting.The technique which we use to obtain the algorithm for vertex cover can also be employed for constructing the first global PTAS for this problem in unit disk graph which does not need the embedding of the graph as part of the input.
Agent-Based Modeling of Supply Chains in Critical Situations
Authors: Jarosław Koźlak, Grzegorz Dobrowolski, Edward Nawarecki
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Supply chains are discussed in this article. They are viewed as intelligent decentralized systems that meet the agent paradigm. Thus possibility of arising critical situations in the chains can be analyzed in the agent-based manner. The work is focused on applying an overall methodology dedicated to the discovery of crises and support of anti-crisis activities. The agent-based model is proposed that incorporates majority of features of supply chains so that the modeling of crises can be wide-ranging and easy. As an illustration some simulation results are presented.
Overview of the INEX 2007 Ad Hoc Track
Authors: Norbert Fuhr, Jaap Kamps, Mounia Lalmas, Saadia Malik, Andrew Trotman
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

This paper gives an overview of the INEX 2007 Ad Hoc Track. The main purpose of the Ad Hoc Track was to investigate the value of the internal document structure (as provided by the XML mark-up) for retrieving relevant information. For this reason, the retrieval results were liberalized to arbitrary passages and measures were chosen to fairly compare systems retrieving elements, ranges of elements, and arbitrary passages. The INEX 2007 Ad Hoc Track featured three tasks: For the Focused Task a ranked-list of non-overlapping results (elements or passages) was needed. For the Relevant in Context Task non-overlapping results (elements or passages) were returned grouped by the article from which they came. For the Best in Context Task a single starting point (element start tag or passage start) for each article was needed. We discuss the results for the three tasks, examine the relative effectiveness of element and passage retrieval. This is examined in the context of content only (CO, or Keyword) search as well as content and structure (CAS, or structured) search.