ppxscal/embedding_network huggingface dataset:
Process and Logic Approaches in the Intelligent Agents Behavior
Authors: Michal Radecký, Petr Gajdoš
Venue: Proceeding of the 2007 conference on Information Modelling and Knowledge Bases XVIII (2007)

The Multi-Agent System (MAS) technology is one of the possibilities of development of modern, powerful and advanced information systems. In the case of the multi-agent systems, some of standard approaches could be used, however they have to be adjusted or extended. This paper describes the ideas and methods for MAS modeling and developing, based on the internal agent behaviors and process modeling. This paper is concerned with the problems of behavior specification and reconfiguration. Our method is based on the process and logic approaches.
Quadratic optimal neural fuzzy control for synchronization of uncertain chaotic systems
Authors: Chaio-Shiung Chen
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presents a novel quadratic optimal neural fuzzy control for synchronization of uncertain chaotic systems via H^~ approach. In the proposed algorithm, a self-constructing neural fuzzy network (SCNFN) is developed with both structure and parameter learning phases, so that the number of fuzzy rules and network parameters can be adaptively determined. Based on the SCNFN, an uncertainty observer is first introduced to watch compound system uncertainties. Subsequently, an optimal NFN-based controller is designed to overcome the effects of unstructured uncertainty and approximation error by integrating the NFN identifier, linear optimal control and H^~ approach as a whole. The adaptive tuning laws of network parameters are derived in the sense of quadratic stability technique and Lyapunov synthesis approach to ensure the network convergence and H^~ synchronization performance. The merits of the proposed control scheme are not only that the conservative estimation of NFN approximation error bound is avoided but also that a suitable-sized neural structure is found to sufficiently approximate the system uncertainties. Simulation results are provided to verify the effectiveness and robustness of the proposed control method.
Experiment Line: Software Reuse in Scientific Workflows
Authors: Eduardo Ogasawara, Carlos Paulino, Leonardo Murta, Cláudia Werner, Marta Mattoso
Venue: Proceedings of the 21st International Conference on Scientific and Statistical Database Management (2009)

Over the last years, scientists have been using scientific workflows to build computer simulations to support the development of new theories. Due to the increasing use of scientific workflows in production environments, the composition of workflows and their executions can no longer be performed in an ad-hoc manner. Although current scientific workflow management systems support the execution of workflows, they present limitations regarding the composition of workflows when it comes to using different levels of abstractions. This paper introduces the concept of experiment line which is a systematic approach for the composition of scientific workflows that represents an in-silico experiment. An experiment line is inspired on the software engineering reuse discipline and allows the composition of scientific workflows at different levels of abstractions, which characterizes both the in-silico experiment and different workflow variations that are related to the experiment.
Description logic for coalitions
Authors: İnanç Seylan, Wojciech Jamroga
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

Coalition Logic (CL) is one of the most important formalisms for specification and verification of game-like multi-agent systems. Several extensions of the logic have been studied in the literature. These extensions are usually fusions (independent joins) of CL with other modal logics (e.g., temporal, epistemic, dynamic, etc.), and they are generally propositional. In this paper, we propose a game description logic called CLALC which is based on a product of Coalition Logic with the description logic ALC. The new logic allows one to reason about agents' ability to influence first-order structures. We show that the satisfiability problem for CLALC is decidable; we prove this by giving a goal-directed decision procedure for the problem.
Optimal Allocation of Time-Resources for Multihypothesis Activity-Level Detection
Authors: Gautam Thatte, Viktor Rozgic, Ming Li, Sabyasachi Ghosh, Urbashi Mitra, Shri Narayanan, Murali Annavaram, Donna Spruijt-Metz
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

The optimal allocation of samples for activity-level detection in a wireless body area network for health-monitoring applications is considered. A wireless body area network with heterogeneous sensors is deployed in a simple star topology with the fusion center receiving biometric samples from each of the sensors. The number of samples collected from each of the sensors is optimized to minimize the probability of misclassification between multiple hypotheses at the fusion center. Using experimental data from our pilot study, we find equally allocating samples amongst sensors is normally suboptimal. A lower probability of error can be achieved by allocating a greater fraction of the samples to sensors which can better discriminate between certain activity-levels. As the number of samples is an integer, prior work employed an exhaustive search to determine the optimal allocation of integer samples. However, such a search is computationally expensive. To this end, an alternate continuous-valued vector optimization is derived which yields approximately optimal allocations which can be found with significantly lower complexity.
A Novel Feature Selection Methodology for Automated Inspection Systems
Authors: Hugo C. Garcia, Jesus Rene Villalobos, Rong Pan, George C. Runger
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

This paper proposes a new feature selection methodology. The methodology is based on the stepwise variable selection procedure, but, instead of using the traditional discriminant metrics such as Wilks' Lambda, it uses an estimation of the misclassification error as the figure of merit to evaluate the introduction of new features. The expected misclassification error rate (MER) is obtained by using the densities of a constructed function of random variables, which is the stochastic representation of the conditional distribution of the quadratic discriminant function estimate. The application of the proposed methodology results in significant savings of computational time in the estimation of classification error over the traditional simulation and cross-validation methods. One of the main advantages of the proposed method is that it provides a direct estimation of the expected misclassification error at the time of feature selection, which provides an immediate assessment of the benefits of introducing an additional feature into an inspection/classification algorithm.
Micro-structures fabrication on glasses for micro-fluidics by imprinting technique
Authors: Qiuping Chen, Qiuling Chen, Daniel Milanese, Monica Ferraris
Venue: Microsystem Technologies (2009)

Micro-channels for microfluidics were fabricated in soda-lime glass through imprinting technique, and then joined to another soda-lime glass slab by thermal assisted direct bonding (TADB). The joined samples were characterized before and after TADB by optical and scanning electron microscopy (SEM) and surface profilometer and shear strength test. The integrity of channels is maintained also after the bonding. The bonded interface between the two glass slabs was found to be without impurities, bubbles and cracks; good bonding strength of 32&#x00a0;MPa between two glasses was obtained as well. These techniques are simple and low cost, suitable for mass production of glass based micro-fluidic devices.
Kernel Based Regularized Multiple Criteria Linear Programming Model
Authors: Yuehua Zhang, Peng Zhang, Yong Shi
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Although Regularized Multiple Criteria Linear Programming (RMCLP) model has shown its effectiveness in classification problems, its inherent drawback of linear formulation limits itself into only solving linear classification problems. To extend RMCLP into solving non-linear problems, in this paper, we propose a kernel based RMCLP model by using a form $ w = \sum\limits^{N}_{i=1}\beta_{i}\phi(x_{i})$ to replace the original weight w in RMCLP model. Empirical studies on synthetic and real-life datasets demonstrate that our new model is capable to classify non-linear datasets. Moreover, comparisons to SVM and MCQP also exhibit the fact that our new model is superior to other non-linear models in classification problems.
Using observations to recognize the behavior of interacting multi-agent systems
Authors: Tucker Balch
Venue:  (2008)

Behavioral research involves the study of the behaviors of one or more agents (often animals) in order to better understand the agents&rsquo; thoughts and actions. Identifying subject movements and behaviors based upon those movements is a critical, time-consuming step in behavioral research. To successfully perform behavior analysis, three goals must be met. First, the agents of interest are observed, and their movements recorded. Second, each individual must be uniquely identified. Finally, behaviors must be identified and recognized. I explore a system that can uniquely identify and track agents, then use these tracks to automatically build behavioral models and recognize similar behaviors in the future.I address the tracking and identification problems using a combination of laser range finders, active RFID sensors, and probabilistic models for real-time tracking. The laser range component adds environmental flexibility over vision based systems, while the RFID tags help disambiguate individual agents. The probabilistic models are important to target identification during the complex interactions with other agents of similar appearance. In addition to tracking, I present work on automatic methods for generating behavioral models based on supervised learning techniques using the agents&rsquo; tracked data. These models can be used to classify new tracked data and identify the behavior exhibited by the agent, which can then be used to help automate behavior analysis.
Plenary lecture III: nature inspired algorithms in intelligent systems modeling
Authors: Dana Simian
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

Metaheuristics inspired from nature have gained increasing attention in recent years. They represent a powerful approach to solve NP-difficult problems. There are many examples of adaptive behaviour in natural multi-agent systems. The most known examples are ant colony behaviour and wasp colony behaviour The bio-inspired Ant Colony Optimization model simulates real ant behaviour to find the minimum length path between the ant nest and the food source. The wasp inspires algorithms are based on the model for the selforganization that takes place within a colony of wasps In a colony of wasps, interactions between members of the colony and the local environment result in dynamic distribution of tasks such as foraging and brood care. In addition, a hierarchical social order among the wasps of the colony is formed. Self-organization, interactions between members of the colony and the local environment, direct and indirect interactions between individuals are very useful in artificial multiagent systems. Computational analogies of natural systems have served as inspiration for multi-agent optimization and control algorithms. Systems composed of several interacting autonomous agents have a big potential to be used in complex problems solving. The aim of this lecture is to make a survey of ant and wasp based algorithms and models for solving complex optimization problems. Examples of applications of nature inspired algorithms for modeling multiagent systems in various fields are presented and analysed.
The worst-case analysis of the Garey---Johnson algorithm
Authors: Claire Hanen, Yakov Zinder
Venue: Journal of Scheduling (2009)

The Garey---Johnson algorithm is a well known polynomial-time algorithm constructing an optimal schedule for the maximum lateness problem with unit execution time tasks, two parallel identical processors, precedence constraints and release times. The paper is concerned with the worst-case analysis of a generalization of the Garey---Johnson algorithm to the case of arbitrary number of processors. In contrast to other algorithms for the maximum lateness problem, the tight performance guarantee for the even number of processors differs from the tight performance guarantee for the odd number of processors.
Visualization of dynamic behaviour of a petrochemistry petroleum coke plant under vertical various seismic loadings
Authors: Mihai Talu, Marin Bica, Gheorghe Andrei Nanu, Emil Albota, Stefan Talu, Aurelian Sipos
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

The goal of this study was to characterize the 3D deformation and stresses under various seismic loadings of a petroleum coke plant using computer modelling techniques. Stresses, deformations and strains were computed using the finite element modelling for a range of different seismic loading. Numerical modelling based on the finite element analysis was used to represent the system dynamic behaviour. Extensive experimental results, including a detailed study on model performance leads us to conclude that the proposed method can be highly accurate and a useful tool in the system designing.
Ubiquitous Computing: Design, Implementation and Usability
Authors: Yin-Leng Theng, Henry Duh
Venue:  (2007)

Interactive systems in the mobile, ubiquitous, and virtual environments are at a stage of development where designers and developers are keen to find out more about design, use and usability of these systems. Ubiquitous Computing: Design, Implementation and Usability highlights the emergent usability theories, techniques, tools and best practices in these environments. This book shows that usable and useful systems are able to be achieved in ways that will improve usability to enhance user experiences. Research on the usability issues for young children, teenagers, adults, and the elderly is presented, with different techniques for the mobile, ubiquitous, and virtual environments.
Universal Worklist with SAP Netweaver Portal
Authors: Darren Hague
Venue:  (2007)

This comprehensive technical guide shows developers, technical consultants, and solution architects all the ins and outs of the Universal Worklist in SAP NetWeaver Portal (Release 2004s). This hands-on workshop takes you, step by step, from standard configuration to working with different user interfaces and covers workflow integration from any back-end systems. Readers get an exclusive look under the hood of the Universal Worklist functionality and gain insight on future application scenarios. By reading this guide you'll be able to reconfigure existing applications to conform with the UWL, write UWL-specific applications or transactions and adapt data sets in order to have the appropriate work item IDs created. Many screenshots and code samples illustrate the processes in detail, allowing you work with the UWL functionality appropriately - just as you will soon be doing in your daily work. Highlights: Standard UWL configuration: Connecting SAP systems, items in the UWL, changing the basic look Customizing UWL: Custom views, custom work item handlers Integrating other types of workflow: Ad-hoc workflow, publishing workflow, 3rd party workflow UWL behind the scenes: Performance tuning, working around limitations, SAP function modules Next-generation workflow: Workflow on a Blackberry or in Outlook with Duet, SAP NetWeaver Voice The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Intelligent Mechanisms for Energy Reduction in Design of Wireless Sensor Networks using Learning Methods
Authors: Mitun Bhattacharyya, Ashok Kumar, Magdy Bayoumi
Venue: Proceeding of the 2006 conference on Integrated Intelligent Systems for Engineering Design (2006)

In this chapter we propose two techniques in two different sub areas of Wireless Sensor Network (WSN) to reduce energy using learning methods. In the first technique we introduce a watchdog/blackboard mechanism to reduce query transmissions, in which an approach is used to learn the query pattern from cluster head. Once the pattern is learnt, data are automatically sent back even without any queries from the cluster head. In the second technique we propose a learning agent method of profiling the residual energies of sensors within a cluster. Here as the agent moves across the different sensor nodes, it profiles the sensors' residual energies. This profile information is provided to sensors to help them make intelligent routing decisions.
Fast training MLP networks with Lo-Shu data sampling
Authors: Hung Han Chen
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

Slow speed of training is always one of major concerns for MLP (Multi-Layer Perceptrons) networks. One of the remedies to this issue have been around by solving linear equations through the weights of hidden and output layers. By doing so, however, this solution may limit the usage of large networks and possibly the data with large number of input features. With new studies that show large MLP networks can train better and often generalize better, the need to develop a new method for fast training remains. As data sampling has been used in statistics to speed up the modeling process, this paper presents a novel sampling technique, by introducing an ancient numeric concept, Lo-Shu, to help training MLP networks potentially 3 times faster to generate acceptable models and still preserve the possibility of utilizing very large networks.
Analysing probabilistically constrained optimism
Authors: Michael Lees, Brian Logan, Georgios Theodoropoulos
Venue: Concurrency and Computation: Practice Experience (2009)

In previous work we presented the DTRD algorithm, an optimistic synchronization algorithm for parallel discrete event simulation of multi-agent systems, and showed that it outperforms Time Warp and time windows on a range of test cases. DTRD uses a decision-theoretic model of rollback to derive an optimal time to delay read event so as to maximize the rate of LVT progression. The algorithm assumes that the inter-arrival times (both virtual and real) of events are normally distributed. In this paper we present a more detailed evaluation of the DTRD algorithm, and specifically how the performance of the algorithm is affected when the inter-arrival times do not follow the assumed distributions. Our analysis suggests that the performance of the algorithm is relatively insensitive to events whose inter-arrival times are not normally distributed. However, as the variance of event inter-arrival times increases, its performance degrades to that of Time Warp. The evaluation approach we present is generally applicable, and we sketch how a similar analysis may be performed for two other decision-theoretic optimistic synchronization algorithms. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Global data computation in chordal rings
Authors: Xianbing Wang, Yong Meng Teo
Venue: Journal of Parallel and Distributed Computing (2009)

Existing Global Data Computation (GDC) protocols for asynchronous systems are round-based algorithms designed for fully connected networks. In this paper, we discuss GDC in asynchronous chordal rings, a non-fully connected network. The virtual links approach to solve the consensus problem may be applied to GDC for non-fully connected networks, but it incurs high message overhead. To reduce the overhead, we propose a new non-round-based GDC protocol for asynchronous chordal rings with perfect failure detectors. The main advantage of the protocol is that there is no notion of rounds. Every process creates two messages initially, with one message traversing in a clockwise direction and visiting each and every process in the chordal ring. The second message traverses in a counterclockwise direction. When there is direct connection between two processes, a message is sent directly. Otherwise, the message is sent via virtual links. When the two messages return, the process decides according to the information maintained by the two messages. The perfect failure detector of a process need only detect the crash of neighboring processes, and the crash information is disseminated to all other processes. Analysis and comparison with two virtual links approaches show that our protocol reduces message complexity significantly.
Notes on classification of toric surface codes of dimension 5
Authors: Stephen S.-T. Yau, Huaiqing Zuo
Venue: Applicable Algebra in Engineering, Communication and Computing (2009)

This is an addendum to the beautiful paper by Little and Schwarz (Appl Algebra Eng Commun Comput 18:349–367, 2007) in which one case of toric surface codes of dimension 5 was missing in their classification result of toric surface codes of dimension less than 6. Our main purpose is to fill the gap of this paper. We find that our new code enjoys more symmetry, and it has more codewords of minimum distance in general. However, over some special fields , and have the same number of the codewords of minimum distance.
OZONE: a zoomable interface for navigating ontology information
Authors: Bongwon Suh, Benjamin B. Bederson
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

We present OZONE (Zoomable Ontology Navigator), for searching and browsing ontological information. OZONE visualizes query conditions and provides interactive, guided browsing for DAML (DARPA Agent Markup Language) ontologies on the Web. To visually represent objects in DAML, we define a visual model for its classes, properties and relationships between them. Properties can be expanded into classes for query refinement. The visual query can be formulated incrementally as users explore class and property structures interactively. Zoomable interface techniques are employed for effective navigation and usability.
Fast communication: KFCE: A dictionary generation algorithm for sparse representation
Authors: Zongbo Xie, Jiuchao Feng
Venue: Signal Processing (2009)

Sparse representation (SR) for signals over an overcomplete dictionary fascinates a lot of researchers in the past decade. Using an overcomplete dictionary that contains prototype signal-atoms, signals are described by sparse linear combinations of these atoms. This paper addresses the problem of dictionary generation in SR. Recent studies show that this problem is equivalent to the problem of codebook estimation in vector quantization (VQ). A kernel fuzzy codebook estimation (KFCE) algorithm is proposed in this paper. The principle of the KFCE algorithm is to integrate the distance kernel trick with the fuzzy clustering algorithm to generate dictionary for SR. Experimental results on real image data show that the KFCE is fit for generating dictionary for SR.