ppxscal/embedding_network huggingface dataset:
Multi-agent System for Management and Monitoring of Routes Surveillance
Authors: Sara Rodríguez, Javier Bajo
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper presents a multi-agent system for security control on industrial environments. The system uses a set of wireless technologies and software agents which integrate reasoning and planning mechanisms. It has the ability to obtain automatic and real-time information about the context to schedule the security guards activities. The combination of technologies enables users to interact with the system in a simple, natural and intuitive way.
Online learning with hidden markov models
Authors: Gianluigi Mongillo, Sophie Deneve
Venue: Neural Computation (2008)

We present an online version of the expectation-maximization (EM) algorithm for hidden Markov models (HMMs). The sufficient statistics required for parameters estimation is computed recursively with time, that is, in an online way instead of using the batch forward-backward procedure. This computational scheme is generalized to the case where the model parameters can change with time by introducing a discount factor into the recurrence relations. The resulting algorithm is equivalent to the batch EM algorithm, for appropriate discount factor and scheduling of parameters update. On the other hand, the online algorithm is able to deal with dynamic environments, i.e., when the statistics of the observed data is changing with time. The implications of the online algorithm for probabilistic modeling in neuroscience are briefly discussed.
Children's Emotional Interpretation of Synthetic Character Interactions
Authors: Lynne Hall, Sarah Woods, Marc Hall, Dieter Wolke
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

Using synthetic characters to support children's personal, social and emotional education requires that the emotional response elicited from the children is that desired by educators and stakeholders. This paper discusses an approach to understanding children's emotional interpretation of character's behaviour in a complex social situation. We outline this approach based on Theory of Mind concepts, that we have developed to enable us to understand and analyse children's emotional interpretation of synthetic characters involved in bullying scenarios in a virtual school. We discuss an empirical study of 345 children, aged 8-11 years, and concluded that our approach enabled us to gain a greater understanding of children's emotional interpretations. Results from the study identified that overall children did make appropriate emotional interpretations of characters and story, highlighting the potential of synthetic characters for exploring personal, social and emotional issues.
A particle swarm-based genetic algorithm for scheduling in an agile environment
Authors: Lotfi K. Gaafar, Sherif A. Masoud, Ashraf O. Nassef
Venue: Computers and Industrial Engineering (2008)

In this paper, genetic algorithms are applied to the scheduling of a manufacturing system that is designed to support an assembly-driven differentiation strategy in the context of agile manufacturing. The system consists of a single flexible machine followed by multiple identical assembly stations. The objective of the scheduling problem is to minimize the makespan. A modified version of the genetic algorithm, inspired by the particle swarm optimization approach, is applied to the problem in addition to the general application of genetic algorithms. The objective is to investigate the potential that the particle swarm optimization concepts may have in improving the performance of genetic algorithms when applied to the chosen problem. The performance of these algorithms is compared to existing heuristics in the literature. A 2^3 factorial experiment, replicated twice, is used to compare the performance of the various approaches and identify the significant factors that affect the average percentage deviation from a lower bound. The results show that both versions of genetic algorithms applications outperform the existing heuristics in many instances and provide schedules that are shorter by as much as 15.5% in the cases considered. In addition, the modified application of genetic algorithms outperforms the regular application with shorter schedules by as much as 3.6% in many instances.
Bounding the Size of the Median Graph
Authors: Miquel Ferrer, Ernest Valveny, Francesc Serratosa
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

Median graphs have been presented as an useful tool for capturing the essential information of a set of graphs. The computation of the median graph is a complex task. Exact algorithms are, in the worst case, exponential both in the number of graphs and their size. The known bounds for the minimum and maximum number of nodes of the candidate median graphs are in general very coarse and they can be used to achieve only limited improvements in such algorithms. In this paper we present more accurate bounds based on the well-known concepts of maximum common subgraph and minimum common supergraph. These new bounds on the number of nodes can be used to improve the existing algorithms in the computation of the median graph.
Development of a WS-ECA Rule Management System for a Healthcare Robot
Authors: Jaeil Park, Haining Lee, Peom Park, Dongmin Shin
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

Providing healthcare services to patients and elderly people has been an emerging application domain in ubiquitous computing technologies. The current trend toward long-term healthcare is accessing healthcare services in the ubiquitous environment instead of in care centers, hospitals or convalescent homes. The Web Service Event-Condition-Action (WS-ECA) rule management system is designed to enable the heterogeneous communication devices in ubiquitous computing environments to achieve inter-operability via event-driven coordination. This paper presents developing a WS-ECA rule management system for a healthcare robot to provide ubiquitous healthcare services for elderly people.
A Practical Web Testing Model for Web Application Testing
Authors: Zhongsheng Qian, Huaikou Miao, Hongwei Zeng
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

As an important method to ensure the quality of Web applications, Web testing attracts more and more attentions in the academic community and industrial world. Testing Web applications raises new problems and faces very high challenges. This work proposes a Web testing model for Web application testing. It starts from constructing the PFD (Page Flow Diagram) of the Web application. An algorithm is then designed to derive a PTT (Page Test Tree) from the PFD. From the PTT, a test translator is employed to extract the path expression, in order to generate all the test paths and then translates them into a test specification in XML syntax, which is the input of test engine. The test engine generates test cases and then executes them, and finally produces test report. The model presented is an important supplement to the existing Web application testing.
The chilling descent: making the transition to a conventional curriculum
Authors: Prabhakar Ragde
Venue: Proceedings of the 2008 international workshop on Functional and declarative programming in education (2008)

The transitional course following an introduction to computer science using functional programming must prepare students to handle a traditional, imperative-based curriculum while ensuring that the lessons of the introductory course are not lost. This paper describes the design of a second course using both Scheme and C, and examines the rationales behind the major design decisions.
Electromagnetic Interference between Electrical Power Lines and Neighboring Pipelines
Authors: Ahmed A. Hossam-Eldin, Wael Mokhtar
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Electromagnetic Field interference caused by electric power lines sharing the same corridor with pipelines can produce the unsafe operation of the protection and measuring systems of the pipeline under both normal and faulty conditions. Voltages can be induced on the pipelines from power lines in the areas where they run in parallel together. These voltages vary with the electrical characteristics and geometry of both systems. These voltages can affect the operating personnel, pipeline associated equipment, cathodic protection and the pipeline itself. Mitigation is required to reduce the voltage levels to limit that adverse effect for personnel and pipeline.
CaVi -- Simulation and Model Checking for Wireless Sensor Networks
Authors: Athanassios Boulis, Ansgar Fehnker, Matthias Fruth, Annabelle McIver
Venue: Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems (2008)

CaVi provides a uniform interface to state-of-the-art simulation methods and formal verification methods for wireless sensor network. Simulation is suitable to examine the behavior of a wireless sensor network in great detail. Due to the probabilistic behavior of these systems, however, the simulation covers only a small fraction of all possible behaviors.Formal model checking techniques, based on Markov Decision Processes, use less detailed and more abstract models and compute exact probabilities and expected values for the entire behavior, where simulation can only give averages. CaVi allows for creating a single model for simulation, Monte-Carlo simulation, and model checking.
Scenario Planning of Mobile Peer-to-Peer Service Usage
Authors: Mikko V. J. Heikkinen, Heikki Hämmäinen
Venue: Proceedings of the 2008 7th International Conference on Mobile Business (2008)

Scenario planning is used in preliminary forecasting, especially in corporate and military strategy planning. Its purpose is to define the possible directions future may evolve regarding a specific phenomenon. We applied scenario planning to mobile peer-to-peer service usage in Finland during 2008-2012. Our objective was to understand the most relevant factors affecting mobile peer-to-peer service usage. Based on a literature study and a questionnaire study among subject experts, we determined stakeholders, trends and uncertainties relevant to mobile peer-to-peer, and developed scenarios summarizing mobile peer-to-peer service usage.
Analyzing Museum Visitors' Behavior Patterns
Authors: Massimo Zancanaro, Tsvi Kuflik, Zvi Boger, Dina Goren-Bar, Dan Goldwasser
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Many studies have investigated personalized information presentation in the context of mobile museum guides. In order to provide such a service, information about museum visitors has to be collected and visitors have to be monitored and modelled in a non-intrusive manner. This can be done by using known museum visiting styles to classify the visiting style of visitors as they start their visit. Past research applied ethnographic observations of the behaviour of visitors and qualitative analysis (mainly site studies and interviews with staff) in several museums to define visiting styles. The current work validates past ethnographic research by applying unsupervised learning approaches to visitors classification. By providing quantitative empirical evidence for a qualitative theory we claim that, from the point of view of assessing the suitability of a qualitative theory in a given scenario, this approach is as valid as a manual annotation of museum visiting styles.
Staying Clear of Boiling-Frog Syndrome
Authors: Phillip A. Laplante
Venue: IT Professional (2004)

For an improved work environment, it's important to first recognize signs of hot water and then turn down the heat. 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
Data Hiding in Non-Expansion Visual Cryptography Based on Edge Enhancement Multitoning
Authors: Hao Luo, Faxin Yu, Jeng-Shyang Pan
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

This paper proposes a scheme to hide some extra confidential data in transparencies during secret image encryption in visual cryptography. The secret image is multitoned into several levels first. An extended non-expansion visual secret sharing model is employed, i.e. size of transparencies is equal to that of the secret image. Thus less time and space are needed for transparencies transmission and storage.
Rigorous Analyses for the Combination of Ant Colony Optimization and Local Search
Authors: Frank Neumann, Dirk Sudholt, Carsten Witt
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications use a combination of ACO and local search procedures that improve the solutions constructed by the ants. In this paper, we study this combination from a theoretical point of view and point out situations where introducing local search into an ACO algorithm enhances the optimization process significantly. On the other hand, we illustrate the drawback that such a combination might have by showing that this may prevent an ACO algorithm from obtaining optimal solutions.
Enhancing the security of e-government portals using biometric voice along with a traditional password
Authors: Khalid T. Al-Sarayreh, Rafa E. Al-Qutaish
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

The security is a very important characteristic for any e-government portal. In this paper, we have introduced a methodology to use the voice as a support security characteristic along with the traditional password. In this way, the security could be increased since the user needs to use his voice beside his password. Therefore, no any unauthorized person can enter the e-government portal even if he gets a password.
Measuring the Applicability of Self-organization Maps in a Case-Based Reasoning System
Authors: A. Fornells, E. Golobardes, J. M. Martorell, J. M. Garrell, E. Bernadó, N. Maciá
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

Case-Based Reasoning (CBR) systems solve new problems using others which have been previously resolved. The knowledge is composed of a set of cases stored in a case memory, where each one describes a situation in terms of a set of features. Therefore, the size and organization of the case memory influences in the computational time needed to solve new situations. We organize the memory using Self-Organization Maps, which group cases with similar properties into patterns. Thus, CBR is able to do a selective retrieval using only the cases from the most suitable pattern. However, the data complexity may hinder the identification of patterns and it may degrade the accuracy rate. This work analyses the successful application of this approach by doing a previous data complexity characterization. Relationships between the performance and some measures of class separability and the discriminative power of attributes are also found.
Counterexample Guided Spotlight Abstraction Refinement
Authors: Tobe Toben
Venue: Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems (2008)

This paper addresses the formal verification of distributed systems comprising a dynamically changing and potentially unbounded number of processes. We employ the spotlight principle to obtain a concise finitary abstraction of the system and devise an abstraction refinement strategy guided by the analysis of abstract counterexamples.It turns out that the key problem for spotlight refinement is the identification of spurious counterexamples. We observe that the problem is in general undecidable, and provide a sound but incomplete method that is able to solve the problem for many practically relevant systems. Our method is driven by a three-valued satisfaction relation for temporal specifications that accounts for the fact that concrete counterexamples can be identified in the abstracted system if they occur within the spotlight.
Segmentation of overlapping cursive handwritten digits
Authors: Carlos A.B. Mello, Edward Roe, Everton B. Lacerda
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

In this paper, we describe an approach for the problem of segmenting overlapping characters. We are working with digit segmentation for bank check processing. Our method is based on the idea of a hypothetical ball traversing the number. The inertia of the movement segments the overlapping digits. Rules are defined for this movement. Our initial proposal achieved very good results with O(n2) complexity.
Audience directed models and software design: how developer mental models of users influence the design of enterprise system features
Authors: Terry Ryan
Venue:  (2008)

Information science research frequently seeks to discover the means by which practitioners can use information technologies (IT) to accomplish their goals. From an organizational perspective, the goal of IT is generally presumed to be an increase in individual and/or organizational performance. A successful implementation of an information technology can therefore be thought of simplistically as one in which the use of the new technology improved performance. Prior research has shown that one determinant of improved performance is how well the functionality of an organization's information technologies fits with the user's tasks. Theories relating to IT acceptance, adoption and success suggest a positive relationship between the task the user needs to accomplish and the task the software was designed to accomplish, but little has been done to explain how the IT artifact makes design intent apparent to the user. This research examines a possible relationship between design intent and fit: namely, how the designer's mental model of an enterprise system's intended use influences the design of the functionality and appearance of the application's component features. Using a positivistic case study methodology, mental models of intended use held by seven teams of enterprise system software developers were identified and classified. These models were then related to the developers' statements about their specific design decisions. The results confirm that developers' mental models influence the design of software UI in ways that are apparent to the end-user, and supports theories that suggest that software has a "spirit" that consists in part of an intended use. The research contributes to our understanding of the source of that spirit, and identifies specific ways in which software developers bias features towards a specific type of use.
Nowhere-zero 3-flows in triangularly connected graphs
Authors: Genghua Fan, Hongjian Lai, Rui Xu, Cun-Quan Zhang, Chuixiang Zhou
Venue: Journal of Combinatorial Theory Series B (2008)

Let H"1 and H"2 be two subgraphs of a graph G. We say that G is the 2-sum of H"1 and H"2, denoted by H"1@?"2H"2, if E(H"1)@?E(H"2)=E(G), |V(H"1)@?V(H"2)|=2, and |E(H"1)@?E(H"2)|=1. A triangle-path in a graph G is a sequence of distinct triangles T"1T"2...T"m in G such that for 1=i+1. A connected graph G is triangularly connected if for any two edges e and e^', which are not parallel, there is a triangle-path T"1T"2...T"m such that e@?E(T"1) and e^'@?E(T"m). Let G be a triangularly connected graph with at least three vertices. We prove that G has no nowhere-zero 3-flow if and only if there is an odd wheel W and a subgraph G"1 such that G=W@?"2G"1, where G"1 is a triangularly connected graph without nowhere-zero 3-flow. Repeatedly applying the result, we have a complete characterization of triangularly connected graphs which have no nowhere-zero 3-flow. As a consequence, G has a nowhere-zero 3-flow if it contains at most three 3-cuts. This verifies Tutte's 3-flow conjecture and an equivalent version by Kochol for triangularly connected graphs. By the characterization, we obtain extensions to earlier results on locally connected graphs, chordal graphs and squares of graphs. As a corollary, we obtain a result of Barat and Thomassen that every triangulation of a surface admits all generalized Tutte-orientations.
Interactive wifi connectivity for moving vehicles
Authors: Aruna Balasubramanian, Ratul Mahajan, Arun Venkataramani, Brian Neil Levine, John Zahorjan
Venue: Proceedings of the ACM SIGCOMM 2008 conference on Data communication (2008)

We ask if the ubiquity of WiFi can be leveraged to provide cheap connectivity from moving vehicles for common applications such as Web browsing and VoIP. Driven by this question, we conduct a study of connection quality available to vehicular WiFi clients based on measurements from testbeds in two different cities. We find that current WiFi handoff methods, in which clients communicate with one basestation at a time, lead to frequent disruptions in connectivity. We also find that clients can overcome many disruptions by communicating with multiple basestations simultaneously. These findings lead us to develop ViFi, a protocol that opportunistically exploits basestation diversity to minimize disruptions and support interactive applications for mobile clients. ViFi uses a decentralized and lightweight probabilistic algorithm for coordination between participating basestations. Our evaluation using a two-month long deployment and trace-driven simulations shows that its link-layer performance comes close to an ideal diversity-based protocol. Using two applications, VoIP and short TCP transfers, we show that the link layer performance improvement translates to better application performance. In our deployment, ViFi doubles the number of successful short TCP transfers and doubles the length of disruption-free VoIP sessions compared to an existing WiFi-style handoff protocol.
Migration Control of Bio-entities in the Bio-network Middleware
Authors: Xiangfeng Zhang, Yongsheng Ding, Lihong Ren
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Future Internet applications and services should be autonomous, self-evolutionary, and adaptable to the change of different users and network environments. Inspired by the resemble features between biological neuroendocrine-immune system and future Internet, we introduced some key principles and mechanisms to design a bio-network architecture and its middleware. In this paper, asynchronous migration mechanism is discussed based on the bio-network middleware. A credit-based migration control scheme is proposed. The simulation result shows that the scheme decreases the response time of service bio-entities and reduces the migration frequency. As such, it can ensure that the service bio-entities migrate effectively to provide services for users and minimize their cost. And the desirable requirements of future Internet are further satisfied.