ppxscal/embedding_network huggingface dataset:
Feedforward neural networks training with optimal bounded ellipsoid algorithm
Authors: José De Jesús Rubio Avila, Andrés Ferreyra Ramírez, Carlos Avilécruz
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence, since it has a similar structure as Kalman filter. OBE has some advantages over Kalman filter training, the noise is not required to be Guassian. In this paper OBE algorithm is applied traing the weights of the feedforward neural network for nonlinear system identification. Both hidden layers and output layers can be updated. From a dynamic systems point of view, such training can be useful for all neural network applications requiring real-time updating of the weights. Two simulations give the effectiveness of the suggested algorithm.
High availability design patterns
Authors: Kanwardeep Singh Ahluwalia, Atul Jain
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

As information technology spreads its wings in to all spheres of human life, including areas which are mission-critical, like telecom services, medical sciences, air transport systems, space missions etc., High Availability (HA) has become utmost important aspect in the development of these systems. This paper presents a pattern language that can be used to make a system highly available.
Self-interested database managers playing the view maintenance game
Authors: Hala Mostafa, Victor Lesser, Gerome Miklau
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

A database view is a dynamic virtual table composed of the result set of a query, often executed over different underlying databases. The view maintenance problem concerns how a view is refreshed when the data sources are updated. We study the view maintenance problem when self-interested database managers from different institutions are involved, each concerned about the privacy of its database. We regard view maintenance as an incremental, sequential process where an action taken at a stage affects what happens at later stages. The contribution of this paper is twofold. First, we formulate the view maintenance problem as a sequential game of incomplete information where at every stage, each database manager decides what information to disclose, if any, without knowledge of the number or nature of updates at other managers. This allows us to adopt a satisficing approach where the final view need not reflect 100% of the databases updates. Second, we present an anytime algorithm for calculating &epsilon;-Bayes-Nash equilibria that allows us to solve the large games which our problem translates to. Our algorithm is not restricted to games originating from the view maintenance problem; it can be used to solve general games of incomplete information. In addition, experimental results demonstrate our algorithm's attractive anytime behavior, which allows it to find good-enough solutions to large games within reasonable amounts of time.
Key Distribution Using Dual Quantum Channels
Authors: Di Jin, Pramode Verma, Stamatios Kartalopoulos
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

Quantum key distribution has been a relatively recent addition to data security and integrity. It is based on advanced ideas that emanate from Quantum theory. Additionally, the optical network and the quantum photon provide a formidable basis for the application of quantum key distribution. We propose a new way of distributing encryption keys over quantum channels. The proposed method takes advantage of dual quantum channels between the communicating entities and complementary measuring bases in order to improve the efficiency with which the keys can be exchanged.
Component Reduction for Hierarchical Mixture Model Construction
Authors: Kumiko Maebashi, Nobuo Suematsu, Akira Hayashi
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

The mixture modeling framework is widely used in many applications. In this paper, we propose a component reduction technique, that collapses a mixture model into a mixture with fewer components. For fitting a mixture model to data, the EM (Expectation-Maximization) algorithm is usually used. Our algorithm is derived by extending mixture model learning using the EM-algorithm.In this extension, a difficulty arises from the fact that some crucial quantities cannot be evaluated analytically. We overcome this difficulty by introducing an effective approximation. The effectiveness of our algorithm is demonstrated by applying it to a simple synthetic component reduction task and a phoneme clustering problem.
An M/G/1 retrial queueing system with two phases of service subject to the server breakdown and repair
Authors: Gautam Choudhury, Kandarpa Deka
Venue: Performance Evaluation (2008)

This paper deals with the steady state behaviour of an M/G/1 retrial queue with an additional second phase of optional service subject to breakdowns occurring randomly at any instant while serving the customers. This model generalizes both the classical M/G/1 retrial queue subject to random breakdown as well as M/G/1 queue with second optional service and server breakdowns. We carry out an extensive analysis of this model.
A Reinforced Self-Escape Discrete Particle Swarm Optimization for TSP
Authors: Liaoliao Li, Zhongkui Zhu, Wenfeng Wang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

To deal with the problem of premature convergence and slow search speed of PSO, inspired by the classical 5-nearest neighbor method, a reinforced self-escape discrete particle swarm optimization algorithm (RSEDPSO) is proposed in this paper. The modified method of selecting candidate edges can enhance the performance of RSEDPSO to explore the global minimum thoroughly. The 5-relative nearest neighbor method introduced in this paper can produce candidate edges list more efficiently than the classical way, 5-nearest neighbor method. Experimental simulations indicate that RSEDPSO can not only significantly speed up the convergence, but also effectively solve the premature convergence problem.
The Mood and Memory of Believable Adaptable Socially Intelligent Characters
Authors: Mark Burkitt, Daniela M. Romano
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In this paper a computational model for believable adaptable characters is presented, which takes into account several psychological theories: five factors model of personality [1], the pleasure arousal dominance[2] and the social cognitive factors [3] to create a computation model able to process emotionally coded events in input, alter the character's mood, the memory associate with the set of entities connected with the event, and in the long run the personality; and produce an immediate emotional reaction in the character, which might or might not be displayed according to the social cognitive factors, the goal of the character and the environment in which the event is taking place.
Ontology Database: A New Method for Semantic Modeling and an Application to Brainwave Data
Authors: Paea Lependu, Dejing Dou, Gwen A. Frishkoff, Jiawei Rong
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

We propose an automatic method for modeling a relational database that uses SQL triggers and foreign-keys to efficiently answer positive semantic queries about ground instances for a Semantic Web ontology. In contrast with existing knowledge-based approaches, we expend additional space in the database to reduce reasoning at query time. This implementation significantly improves query response time by allowing the system to disregard integrity constraints and other kinds of inferences at run-time. The surprising result of our approach is that load-time appears unaffected, even for medium-sized ontologies. We applied our methodology to the study of brain electroencephalographic (EEG and ERP) data. This case study demonstrates how our methodology can be used to proactively drive the design, storage and exchange of knowledge based on EEG/ERP ontologies.
Maintaining Population Diversity in Evolution Strategy for Engineering Problems
Authors: Roman Dębski, Rafał Dreżewski, Marek Kisiel-Dorohinicki
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 the paper three new mechanisms for maintaining population diversity in (μ,¿)-evolution strategies are introduced: deterministic modification of standard deviations, crowding, and elitism. The proposed mechanisms are experimentally verified with the use of optimal shape designing of rotating variable-thickness annular elastic discs problem.
Security Policy Integration and Conflict Reconciliation for Collaborations among Organizations in Ubiquitous Computing Environments
Authors: Stephen S. Yau, Zhaoji Chen
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

The investigative capabilities and productivity of researchers and practitioners of various organizations can be greatly expanded with collaborations among these organizations in ubiquitous computing environments. However, in order to provide effective collaborations among organizations in ubiquitous computing environments, due to the heterogeneity and dynamic nature of the ubiquitous computing environments it is critical to generate an integrated security policy set to govern the interactions among collaborating organizations during the collaboration. Existing approaches in security policy integration and conflict analysis have focused on static policy analysis which cannot address the dynamic formation of collaborative groups in ubiquitous computing environments. In this paper, an approach is presented to security policy integration, including a similarity-based policy adaptation algorithm for changing collaborative groups and a negotiation-based policy generation protocol for the new resources generated by the collaboration as well as for conflict reconciliation. Our approach can be automated with user defined control variables, which can greatly improve the efficiency and make the system scalable with little human intervention.
Adaptive Generalized Vector Median Filter
Authors: Bogdan Smolka
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this paper, a new adaptive filter intended for the attenuation of impulse noise in color images is proposed. The new filtering design is based on the concept of a peer group of pixels sharing similar chromatic properties. The novel approach adaptively determines the size of the peer group which minimizes the aggregated distance to the peer group members, utilizing the Fisher linear discriminant. The analysis of the obtained noise reduction results leads to the conclusion that the new filter is capable of reducing even strong impulse noise, while preserving and even enhancing the edges of color images. This unique property of the proposed filtering design is shown on examples of color biomedical images.
Vectorization of Grid Maps by an Evolutionary Algorithm
Authors: Ivan Delchev, Andreas Birk
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

Mapping is a fundamental topic for robotics in general and in particular for rescue robotics where the provision of information about the location of victims is a core task. Occupancy grids are the standard way of generating and representing maps, i.e., in form of raster data. But vector representations are for many reasons, especially due to their compactness and the possibility to use very efficient computational geometry algorithms, highly desirable for many applications. Here a novel method for vectorization is presented that is intended to work particularly well with maps. It is based on an evolutionary algorithm that generates vector code for a so to say drawing program. The output of the evolving vector code is compared to the input grid map via a special similarity function as fitness. Experiments are presented that indicate that the approach is indeed a successful method to extract vector data out of grid maps.
A Cross-LMS Communication Environment with Web Services
Authors: Takashi Yukawa, Yoshimi Fukumura
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

The present paper proposes a cross-LMS communication system for distributed, autonomous, and collaborative learning environments. The authors have been conducting the eHELP project, which promotes the sharing of e-learning contents and the transfer of credits between academic institutions in Japan. A problem in achieving collaboration between students at different institutions is revealed, whereby different LMSs are used at the participating institutions. To solve this problem, a cross-LMS bulletin board system (cBBS) and a cross-LMS chat system (cChat) using web services are proposed. The present paper describes the requirements, designs, and implementations of these systems. Working examples of the cBBS are also presented.
Retrieving and Recreating Musical Form
Authors: Ole Kühl, Kristoffer Jensen
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

This paper discusses musical form from a cognitive and a computational viewpoint. While several time-windows exist in the brain, we here put emphasis on the superchunks of up to more than 30 seconds lengths. We compare a strategy for auditive analysis based on human cognition with a strategy for automatic analysis based on feature extraction. The feature extraction is based on the musical features rhythm, timbre and chroma. We then consider the possible consequences of this approach for the development of music generating software.
Service-Oriented Information Systems Engineering: A Situation-Driven Approach for Service Integration
Authors: Nicolas Arni-Bloch, Jolita Ralyté
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

In this work we propose a Metamodel of Information System Service (MISS) and introduce a situation-driven approach for ISS integration. This approach is based on situational method engineering principals and is defined as a collection of inter-related method chunks.
2-Synchronizing Words
Authors: Paweł Gawrychowski, Andrzej Kisielewicz
Venue: Language and Automata Theory and Applications: Second International Conference, LATA 2008, Tarragona, Spain, March 13-19, 2008. Revised Papers (2008)

A word w over an alphabet Σ is n-synchronizing if it resets every (n + 1)-state synchronizing automaton over this alphabet. For a fixed n and Σ, n-synchronizing words can be recognized in polynomial time, yet no practical algorithm is known. In this paper we show that one cannot expect to find such an algorithm. We prove that the problem of recognizing 2-synchronizing words, where the input consists of a word and an alphabet, is co-NP-complete. We also show that the length of a 2-synchronizing word is at least 2|Σ|2, which improves the lower bound known so far.
Aware Group Home Enhanced by RFID Technology
Authors: Motoki Miura, Sadanori Ito, Ryozo Takatsuka, Susumu Kunifuji
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In Japan, the number of group homes offering home-like care for elderly persons suffering from dementia has increased considerably. Even though the lesser number of people residing in a group home is suitable for family-like care, the shortage of caregivers increases the burden, especially during the night. To supplement this lack of attention, we developed floor mats embedded with RFID antennae and slippers with RFID tags. These can help caregivers be aware of the activities of persons suffering from dementia, by specifying whether an individual has passed over a sheet in a particular corridor. This not only helps the caregivers understand such persons by reviewing their activities, but also keeps them informed about the person's current activities.
Real-time emulation of networked robot systems
Authors: Razvan Beuran, Junya Nakata, Takashi Okada, Yasuo Tan, Yoichi Shinoda
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In this paper we present a methodology for the evaluation of networked systems communicating using WLAN technology. We show a case study of goal-oriented cooperating robots, for which our approach is particularly useful. Developing robots is expensive; hence emulation can be employed in the first part of the development cycle to study robot software implementations in realistic conditions at a reduced cost. Our methodology is based on the emulation of both the robots and the WLAN communication technology. The robots we consider cooperate in order to efficiently reach a destination while avoiding collisions with obstacles and other robots. The WLAN communication emulation engine QOMET is deployed in the emulated robots to recreate network conditions similar to those occurring in a real WLAN environment. The experiments are run on a large-scale network experiment environment, StarBED, using the support software RUNE. Currently, over one hundred emulated robots can be run simultaneously during an experiment on our testbed.
Gaussian processes for canonical correlation analysis
Authors: Colin Fyfe, Gayle Leen, Pei Ling Lai
Venue: Neurocomputing (2008)

We consider several stochastic process methods for performing canonical correlation analysis (CCA). The first uses a Gaussian process formulation of regression in which we use the current projection of one data set as the target for the other and then repeat with the second projection as the target for adapting the parameters of the first. The second uses a method which relies on probabilistically sphering the data, concatenating the two streams and then performing a probabilistic PCA. The third gets the canonical correlation projections directly without having to calculate the filters first. We also investigate the use of nonlinearity and a method for sparsification of these algorithms.
Context Cookies
Authors: Ramón Hervás, Gabriel Chavira, Salvador W. Nava, Vladimir Villarreal, José Bravo
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

In an ambient intelligence world, devices work in order to support people carrying out their everyday life activities in a natural way. Therefore, it is necessary to know the entities in the environment and to consider new interaction schemas with them. This paper proposes an autonomous and lively mechanism to refresh the context information while users interact with the environment using Near Field Communication technology. Context Cookies is the name of the mechanism that captures situation changes and provides awareness dynamically.
The Politeness Effect in an Intelligent Foreign Language Tutoring System
Authors: Ning Wang, W. Lewis Johnson
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

A previous study showed that pedagogical agents that offer feedback with appropriate politeness strategies can help students learn better [21]. This work studied the Politeness Effect in a foreign language intelligent tutoring system, and provided further evidence that tutorial feedback with socially intelligent strategies can influence motivation and learning outcomes.
DECIDE: Applying Multi-agent Design and Decision Logic to a Baggage Handling System
Authors: Kasper Hallenborg, Yves Demazeau
Venue: Engineering Environment-Mediated Multi-Agent Systems: International Workshop, EEMMAS 2007, Dresden, Germany, October 5, 2007. Selected Revised and Invited Papers (2008)

Behind the curtains at check-in desks in airports hide a very complex material handling systems, which manage to get your bag transported to the correct departure gate of your flight.The conventional control software uses a strategy primarily based on a shortest path algorithm, not taking into account dynamical changes or utilization of less packed areas of the BHS.We changed that perspective towards a decentralized multi-agent based solution by developing strongly collaborating agents. The agents replace the existing control software without modifying the layout of the BHS.In this paper we describe the BHS problem and the agent-based design. We pay special attention to the impact of the local environments of the agents, and finally give examples of implemented decision strategies.
Design for All in the Ambient Intelligence Environment
Authors: P. L. Emiliani, M. Billi, L. Burzagli, F. Gabbanini
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

An Information Society described by the Ambient Intelligence (AmI) paradigm is emerging, due to the ongoing technological developments. The paper aims to show that a designed for all AmI environment can have a positive impact on people with activity limitations in the long term and that the technology made available for the implementation of the AmI concepts can offer new integration possibilities for them in the short/medium term, reintroducing innovation in Assistive Technology.
Ways of controlling transport capacity variation of belt conveyors
Authors: Florin Dumitru Popescu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The permanent measurement of the mining material volume controlled by continuous transporting equipment machines implies knowing its transversal section profile at a given moment and the instantaneous velocity of the transporting belt conveyor. The approximation of the material profile section is done by measuring the level of the transporting material in different points and afterwards by approximating the corresponding curve through methods of numerical interpolation. In this paper two approximation (interpolation) methods are presented: Lagrange and the spline functions method.
Ranking the Uniformity of Interval Pairs
Authors: Jussi Kujala, Tapio Elomaa
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

We study the problem of finding the most uniform partition of the class label distribution on an interval. This problem occurs, e.g., in supervised discretization of continuous features, where evaluation heuristics need to find the location of the best place to split the current feature. The weighted average of empirical entropies of the interval label distributions is often used in this task. We observe that this rule is suboptimal, because it prefers short intervals too much. Therefore, we proceed to study alternative approaches. A solution that is based on compression turns out to be the best in our empirical experiments. We also study how these alternative methods affect the performance of classification algorithms.