ppxscal/embedding_network huggingface dataset:
Decontamination of hypercubes by mobile agents
Authors: Paola Flocchini, Miao Jun Huang, Flaminia L. Luccio
Venue: Networks (2008)

In this article we consider the decontamination problem in a hypercube network of size n. The nodes of the network are assumed to be contaminated and they have to be decontaminated by a sufficient number of agents. An agent is a mobile entity that asynchronously moves along the network links and decontaminates all the nodes it touches. A decontaminated node that is not occupied by an agent is re-contaminated if it has a contaminated neighbor. We consider some variations of the model based on the capabilities of mobile agents: locality, where the agents can only access local information; visibility, where they can &ldquo;see&rdquo; the state of their neighbors; and cloning, where they can create copies of themselves. We also consider synchronicity as an alternative system requirement. For each model, we design a decontamination strategy and we make several observations. For agents with locality, our strategy is based on the use of a coordinator that leads the other agents. Our strategy results in an optimal number of agents, $\Theta ({n \over \sqrt{\log n}})$, and requires O(n log n) moves and O(n log n) time steps. For agents with visibility, we assume that the agents can move autonomously. In this setting, our decontamination strategy achieves an optimal time complexity (log n time steps), but the number of agents increases to $ {n \over 2}$. Finally, we show that when the agents have the capability to clone combined with either visibility or synchronicity, we can reduce the move complexity&mdash;which becomes optimal&mdash;at the expense of an increase in the number of agents. &copy; 2008 Wiley Periodicals, Inc. NETWORKS, 2008 A preliminary version of this paper appeared in IPDPS 2005.
Dependency Pairs for Rewriting with Non-free Constructors
Authors: Stephan Falke, Deepak Kapur
Venue: Proceedings of the 21st international conference on Automated Deduction: Automated Deduction (2007)

A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional program is specified as an equational rewrite system, where the rewrite system specifies the program and the equations express the relations on the constructors that generate the data structures. Unlike previous approaches, relations on constructors can be collapsing, including idempotency and identity relations. Relations among constructors may be partitioned into two parts: (i) equations that cannot be oriented into terminating rewrite rules, and (ii) equations that can be oriented into terminating rewrite rules, in which case an equivalent convergent system for them is generated. The dependency pair method is extended to normalized rewriting, where constructor-terms in the redex are normalized first. The method has been applied to several examples, including the Calculus of Communicating Systems and the Propositional Sequent Calculus. Various refinements, such as dependency graphs, narrowing, etc., which increase the power of the dependency pair method, are presented for normalized rewriting.
Production of NANO powder of aluminum nitride by pulsed power method
Authors: M. M. Daemi Attaran, A. Erfanian, P. Ghassemi Kian
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

After revision of applications, physical and chemical properties and various methods for production of nano powder of AlN, Pulsed Electrical Exploded Wire Discharge (EEW) method for production of various kinds of these nano powders has been studied in detail. In this research, the theory of Electrical Pulsed Wire Discharge and also optimum parameters of wire explosion has been investigated. The pulsed power system that used in this method included a 6µF-50kV capacitor bank, 20kV Spark gap switch with current peak of 150kA and driver circuit, control and related charger and voltage and current diagnostic instruments. Capacitor will be charge up to 9kV and will be discharge by spark gap switch into the wire. Current pulse has been measured by a high frequency Rogowski coil. After every discharge, the wire will be exploded, melted, Sublimated and condense in collision with ambient nitrogen gas particles. Collection of nano particle produced by this method will be done by a 50nm membrane disc filter, by circulation of nitrogen gas with a dry pump. SEM observation representative of high percent of AlN nano powder in achieved powder with average less than 50nm dimension. AlN nano powder uses for cooling applications in electronic industries and for RF windows coating in microwave industries.
Engineering Contextual Information for Pervasive Multiagent Systems
Authors: Gabriella Castelli, Marco Mamei, Franco Zambonelli
Venue: Engineering Environment-Mediated Multi-Agent Systems: International Workshop, EEMMAS 2007, Dresden, Germany, October 5, 2007. Selected Revised and Invited Papers (2008)

Multiagent systems for mobile and pervasive computing should extensively exploit contextual information both to adapt to user needs and to enable autonomic behavior. This raises the problem of how to represent, organize, aggregate, and make available such data so as to have it become meaningful and usable knowledge, facilitating the design and development of agents, and enabling them to acquire high-degrees of context awareness at limited efforts. In this paper, we identify the key software engineering challenges introduced by the need of accessing and exploiting huge amount of heterogeneous contextual information. Following, we survey the relevant proposals in the area of context-aware pervasive computing, data mining and granular computing discussing their potentials and limitations. On these bases, we propose the W4 model for contextual data and show how it can represent an effective model to enable flexible general-purpose management of contextual knowledge, to facilitate agents in achieving high degrees of context-awareness and, overall, to facilitate the design and development of complex multiagent systems.
A Characterization of Simple Recurrent Neural Networks with Two Hidden Units as a Language Recognizer
Authors: Azusa Iwata, Yoshihisa Shinozawa, Akito Sakurai
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

We give a necessary condition that a simple recurrent neural network with two sigmoidal hidden units to implement a recognizer of the formal language {a n b n | n > 0 } which is generated by a set of generating rules {S¿aSb, S¿ab } and show that by setting parameters so as to conform to the condition we get a recognizer of the language. The condition implies instability of learning process reported in previous studies. The condition also implies, contrary to its success in implementing the recognizer, difficulty of getting a recognizer of more complicated languages.
The User Centred Knowledge Model - t-UCK
Authors: Anne Håkansson
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

In knowledge engineering, modelling knowledge is the process of structuring knowledge before implementation. A crucial part of system development depends on the acquiring and structuring, since the quality of system's contents is of decisive importance for making good decisions. Models are needed to assure that all the required knowledge is present. However, the current models tend to be large and this makes it hard to get a grip on the knowledge presented by the model. Also, many models are difficult to use and the users have to be experts on the models before using them. To avoid these problems, we introduce the User-Centred Knowledge Model (t-UCK) for modelling knowledge. The model supports different users, i.e., domain experts, knowledge engineers and end-users, to model, implement, test, consult, and educate through the use of graphic representation and visualisation.
A Design of Information System Improving Dietary Habit Based on Individual Clinical Data and Life Style
Authors: Tsutomu Matsumoto, Yasuyuki Shimada, Thimoty Teo, Shigeyasu Kawaji
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Currently, metabolic syndrome is one of the most all-too-common terms in Japan and it has been pointed out that the number of patients afflicted with lifestyle diseases such as hypertension, diabetes and hyperlipemia is rapidly growing. It takes many days to heal from lifestyle diseases completely, and prevention is the best way to keep us healthy. Furthermore it is well-known that dietary cure is one of effective methods to prevent from lifestyle diseases. This paper describes a designing and implementation of alimentary therapy assist system. The system records user's meal history and provide the user with healthy menu based on medical information, body condition, user's meal history individual taste and market price of cooking materials.
Naming practice on an open platform for people with aphasia
Authors: Chris Benjamin, Jesse Harris, Alex Moncrief, Gail Ramsberger, Clayton Lewis
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Banga is a software system that uses the Android open source software platform for mobile phones to support word finding practice, a form of therapy for people with aphasia. By connecting to a Web site, Banga provides for remote monitoring and management of the therapy, making it easier for patients to participate in treatment, and for clinicians to deliver it.
Bijective Digital Error-Control Coding, Part II: Quantum Viterbi Circuit Synthesis
Authors: Anas N. Al-Rabadi
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

The complete design of quantum circuits for the quantum realization of the new quantum Viterbi cell in the quantum domain (Q-domain) is introduced. Quantum error-control coding can be important for the following main reasons: (1) low-power fault-correction circuit design in future technologies such as in quantum computing (QC), and (2) super-speedy encoding/decoding operations because of the superposition and entanglement properties that emerge in the quantum computing systems and therefore very high performance is obtained.
The Characteristic Analysis of Web User Clusters Based on Frequent Browsing Patterns
Authors: Zhiwang Zhang, Yong Shi
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Web usage mining (WUM) is an important and fast developing area of web mining. Recently, some enterprises have been aware of its potentials, especially for applications in Business Intelligence (BI) and Customer Relationship Management (CRM). Therefore, it is crucial to analyze the behaviors and characteristics of web user so as to use this knowledge for advertising, targeted marketing, increasing competition ability, etc. This paper provides an analytic method, algorithm and procedure based on suggestions from literature and the authors' experiences from some practical web mining projects. Its application shows combined use of frequent sequence patterns (FSP) discovery and the characteristic analysis of user clusters can contribute to improve and optimize marketing and CRM.
Intelligent Behavior Generation of Benevolent Agents with a Stochastic Model of Emotion
Authors: Sajal Chandra Banik, Keigo Watanabe, Kiyotaka Izumi
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

This paper deals with the implementation of emotions in a benevolent multi-agents system performing a specified task in a group to develop intelligent behavior and easier form of communication. The task is assigned by the user of the system and the user also evaluates the overall performance of the system according to his demand criteria. The overall group performance depends on the individual performance, group communication and synchronization of cooperation. With the emotional capability, each agent can distinguish the changed environment, can understand colleague's state, enables adaptation and reacts with changed world. The behavior of an agent is derived from the dominating emotion in an intelligent manner. A stochastic model based on Markov theory is developed to model the emotional state of agent.
A computational algorithm for system modelling based on bi-dimensional finite element techniques
Authors: A. Pérez-Carrió, Y. Villacampa, J. Llorens, F. Garcıa-Alonso
Venue: Advances in Engineering Software (2009)

This paper develops a modelling methodology for studying relations defined a priori in two dimensions, z=u(x,y), for which experimental data are known. An innovation is that the methodology is based on bi-dimensional finite element techniques, in which the model's value consists of a finite number of points, making it possible to obtain its value at any point. Its application permits obtaining representational models of the relation. A computational algorithm is presented; its program has been called Finit Trap 2D, which generates families of models. It has defined criteria for model selection based on information parameters. This scientific research technique complements those existing in scientific literature for generating mathematical models based on experimental data [Cortes M, Villacampa Y, Mateu J, Uso, JL. A new methodology for modelling highly structured systems. Environmental modelling and software 2000;15(5):461-70, S-PLUS 2000. Guide to statistics, vosl. 1-2. Mathsoft Inc.; 1999, SPSS 12.0. Guide to statistics, Mathsoft Inc.; 2003, Verdu F. Un algoritmo para la construccion multiple de modelos matematicos no lineales y el estudio de su estabilidad, Thesis Doctoral, Universidad de Alicante; 2001, Verdu F, Villacampa Y. A computational algorithm for the multiple generation of nonlinear mathematical models and stability study. Advances in Engineering Software 2008;39(5):430-7, Villacampa Y, Cortes M, Vives F, Uso JL, Castro MA. A new computational algorithm to construct mathematical models. In: Ecosystems and sustainable development II. Advances in ecological sciences, vol. 2, WIT Press: Southampton, Boston; 1999], and will be useful in the effort to simplify the model. It should be emphasised that representational models have been generated from bi-dimensional finite element models. This will naturally lead to their future application in processes described by partial differential equation whose coefficients are functions, A(x,y) for which only experimental data are known.
Rotation Invariant Texture Classification Using Circular Gabor Filter Banks
Authors: Qingbo Yin, Jong Nam Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

This paper presents a new method for rotation invariant texture classification based on the circular Gabor wavelets. A circular Gabor filter bank is proposed to decompose an image into multiple scales and be rotation invariant. By the mean and variance of the circular Gabor filtered image, a discriminant can be found to classify rotated images. In the primary experiments, comparatively high correct classification rates were obtained using a large test sample set.
Supporting Named Entity Recognition and Syntactic Analysis with Full-Text Queries
Authors: Luísa Coheur, Ana Guimarães, Nuno Mamede
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

JaTeDigo is a natural language interface (in Portuguese) to a cinema database that has to deal with a vocabulary of more than 2500000 movies, actors and staff names. As our tools were not able to deal with such a huge amount of information, we decided to profit from full-text queries to the database to support named entity recognition (NER) and syntactic analysis of questions. This paper describes this methodology and evaluates it within JaTeDigo.
Lower bounds on online deadline scheduling with preemption penalties
Authors: Stanley P. Y. Fung
Venue: Information Processing Letters (2008)

We generalize and improve previous results of online preemptive deadline scheduling with preemption penalties. We consider both the preemption-restart and the preemption-resume models, and give new or improved lower bounds on the competitive ratio of deterministic online algorithms. In many cases the bounds are optimal when the job deadlines are tight. Our results show that the competitiveness varies linearly with the penalty factor.
On the Complementarity of Face Parts for Gender Recognition
Authors: Yasmina Andreu, Ramón A. Mollineda
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

This paper evaluates the expected complementarity between the most prominent parts of the face for the gender recognition task. Given the image of a face, five important parts (right and left eyes, nose, mouth and chin) are extracted and represented as appearance-based data vectors. In addition, the full face and its internal rectangular region (excluding hair, ears and contour) are also coded. Several mixtures of classifiers based on (subsets of) these five single parts were designed using simple voting, weighted voting and other learner as combiners. Experiments using the FERET database prove that ensembles perform significantly better than plain classifiers based on single parts (as expected).
A fast 3D particle method for the simulation of buoyant flow
Authors: Fabrice Schlegel, Daehyun Wee, Ahmed F. Ghoniem
Venue: Journal of Computational Physics (2008)

This paper describes progress in several areas related to three-dimensional vortex methods and their application to multiphysics problems. The first is the solution of a generic scalar transport equation by advecting and diffusing the scalar gradient along a particle trajectory and onto a mesh, respectively, and recovering the scalar values using a Biot-Savart-like summation. The second is the accurate, high-resolution calculation of the velocity gradient using a fast treecode, which avoids using kinematic relations between the evolution of the gradients and the distortion of the flow map. The same tree structure is used to compute all the variables of interest and those required during the integration of the governing equations. Next, we apply our modified interpolation kernel algorithm for treating diffusion and remeshing to maintain long time accuracy. The coupling between vorticity transport and that of a dynamic scalar, in this case the temperature or density in a gravitational field, is manifested by the generation of vorticity. We demonstrate the performance of the multiphysics algorithm by solving a number of buoyant flow problems.
Global Dynamics of Finite Cellular Automata
Authors: Martin Schüle, Thomas Ott, Ruedi Stoop
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

A novel algebraic and dynamic systems approach to finite elementary cellular automata is presented. In particular, simple algebraic expressions for the local rules of elementary cellular automata are deduced and the cellular automata configurations are represented via Fourier analysis. This allows for a further analysis of the global dynamics of cellular automata by the use of tools derived from functional analysis and dynamical system theory.
A hybrid GA & back propagation approach for gene selection and classification of microarray data
Authors: Omid Khayat, Hamid Reza Shahdoosti, Ahmad Jaberi Motlagh
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

We propose a Genetic Algorithm (GA) approach combined with Neural Network (MultiLayer Perceptron) with Back Propagation algorithm (BP) for the classification of high dimensional Microarray data. This approach is associated to a fuzzy logic based pre-filtering technique. The GA is used to evolve gene subsets whose fitness is evaluated by a NN classifier. Using archive records of "good" gene subsets, a frequency based technique is introduced to identify the most informative genes. Our approach is assessed on two well-known cancer datasets and shows competitive results with six existing methods.
Emotional Faces in Peripheral Crowding
Authors: Tian Ran, Wenfeng Chen, Xiaolan Fu
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Crowding effect refers to the deficit in identifying viewed targets, such as letters, numerals, line segments, or grating patches, when other shapes are nearby. This effect is reduced when distractors have a different color, contrast, or binocular disparity than that of the target. With feature singleton targets, the crowding effect decreases dramatically with an increasing number of distractors for both simple orientation and more complex letter identification tasks [4]. With a target that is not a salient feature singleton, however, the increasing number of distractors worsens rather than improves the perception of the target [2].
Securing Overlay Activities of Peers in Unstructured P2P Networks
Authors: Jun-Cheol Park, Geonu Yu
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

This paper discusses how to secure overlay activities of peers on overlay level messages exchanged in unstructured P2P networks. We identify some attacks that can be effectively handled by appropriate cryptographic means. We then give a detection method against those attacks including message modification, replay attack, and message generation with wrong information. The method presumes the existence of a set of CAs, which are consulted when peers are newly joining the network and otherwise uninvolved in the peer activities. We also address the attack of a peer's illegal dropping of relaying messages, which is hard to be traced to its doer even with the assist of cryptographic means. We propose an audit and topology adaptation technique to confine and weaken the ill effect of such an attack on other peers in the network. We demonstrate the effectiveness of the technique using a modified GnutellaSim [14] simulator with respect to various metrics. Being based upon a generic overlay model, the proposed techniques can be applied to any unstructured P2P network either separately or all together.
Relative Network Positioning via CDN Redirections
Authors: Ao-Jan Su, David Choffnes, Fabian E. Bustamante, Aleksandar Kuzmanovic
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Many large-scale distributed systems can benefit from a service that allows them to select among alternative nodes based on their relative network positions. A variety of approaches propose new measurement infrastructures that attempt to scale this service to large numbers of nodes by reducing the amount of direct measurements to end hosts. In this paper, we introduce a new approach to relative network positioning that eliminates direct probing by leveraging pre-existing infrastructure. Specifically, we exploit the dynamic association of nodes with replica servers from large content distribution networks (CDNs) to determine relative position information – we call this approach CDN-based Relative network Positioning (CRP). We demonstrate how CRP can support two common examples of location information used by distributed applications: server selection and dynamic node clustering. After describing CRP in detail, we present results from an extensive wide-area evaluation that demonstrates its effectiveness.