ppxscal/embedding_network huggingface dataset:
Acquisition of Human-Robot Interaction Rules via Imitation and Response Observation
Authors: Takatsugu Kuriyama, Yasuo Kuniyoshi
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

We aim to realize human-robot social game interaction as a kind of communication. We proposed a hypothetical development of social game interaction between an infant and a care-giver from a mechanism-sided standpoint, based on developmental psychology. Social games have rules, specific relationship between action and response. Applying the hypothesis, we also propose a scheme to design a robot in which a partner can teach interaction rules through interaction. To investigate the proposed scheme, we built a dynamic model which realizes imitation and ruled interaction and switches them observing partner's response. In the experiment, the partner can teach and the robot can acquire a rule adaptively through interaction without explicit teaching and subsequently it is also achieved about another rule without reset.
On-line fuzzy modeling via clustering and support vector machines
Authors: Wen Yu, Xiaoou Li
Venue: Information Sciences: an International Journal (2008)

In this paper, we propose a novel approach to identify unknown nonlinear systems with fuzzy rules and support vector machines. Our approach consists of four steps which are on-line clustering, structure identification, parameter identification and local model combination. The collected data are firstly clustered into several groups through an on-line clustering technique, then structure identification is performed on each group using support vector machines such that the fuzzy rules are automatically generated with the support vectors. Time-varying learning rates are applied to update the membership functions of the fuzzy rules. The modeling errors are proven to be robustly stable with bounded uncertainties by a Lyapunov method and an input-to-state stability technique. Comparisons with other related works are made through a real application of crude oil blending process. The results demonstrate that our approach has good accuracy, and this method is suitable for on-line fuzzy modeling.
Trustworthy Services and the Biological Analogy
Authors: Michael K. Reiter
Venue: Proceedings of the 12th European symposium on Research In Computer Security (2007)

Biological systems survive through a combination of redundancy, diversity and modularity. It has been argued that these principles can also be applied to construct information services that survive a variety of hostile attacks, including even the compromise of computers that help implement the service. Despite nearly 30 years of research to advance these principles and to apply them to the construction of trustworthy services, each remains an active and fruitful topic of research. In this talk we will describe recent progress in achieving redundancy, diversity and modularity, and in using these to implement trustworthy services. This progress, we will argue, is paving the way to next-generation services that are significantly more resilient than today's. We will also discuss challenges that remain in achieving this goal.
A modified adaptive IIR filter design via wavelet networks based on Lyapunov stability theory
Authors: Nurettin Ac&#x0131;r
Venue: Neural Computing and Applications (2008)

In this paper, we present a wavelet network IIR filtering system satisfying asymptotic stability in the sense of Lyapunov unlike many other gradient descent algorithms based adaptive filtering systems. The proposed system also carries the advantages of the time-frequency specific properties of wavelet networks embedded into the proposed filter dynamics. Two experiments for system identification problems corresponding to the infinite impulse response filter design are proposed. The results verified that the proposed wavelet network infinite impulse response adaptive filtering system not only performs better than gradient descent based algorithms but also performs as good as other stability theory based optimization algorithms.
Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
Authors: Guoqiang Bai, Henning Fernau
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized algorithm for this problem. This has led to considerable simplifications of the published, quite sophisticated algorithm. Moreover, we can prove that the mentioned algorithm could be quite efficient in practial situations.
Chosen Message Attack Against Mukherjee-Ganguly-Chaudhuri's Message Authentication Scheme
Authors: Mun-Kyu Lee, Dowon Hong, Dong Kyue Kim
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Since Wolfram proposed to use cellular automata as pseudorandom sequence generators, many cryptographic applications using cellular automata have been introduced. One of the recent one is Mukherjee, Ganguly, and Chaudhuri's message authentication scheme using a special class of cellular automata called Single Attractor Cellular Automata (SACA). In this paper, we show that their scheme is vulnerable to a chosen-message attack, i.e., the secret key can be recovered by an attacker using only several chosen message-MAC pairs. The weakness of the scheme results from the regularity of SACA.
A Flow-Oriented Visual Language for Learning Designs
Authors: Iván Martínez-Ortiz, Pablo Moreno-Ger, José Luis Sierra-Rodríguez, Baltasar Fernández-Manjón
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

Educational Modeling Languages (EMLs) are notations that allow instructors to describe teaching and learning interactions and activities in a formal way. This description of a specific teaching process is called a Unit of Learning (UoL). The main advantage of UoLs described using EMLs is that they can be automatically orchestrated using an interpreter that coordinates all the activities defined in the UoL. The advantages of this approach in terms of scalability and interoperability are great but, in practice, its application is being hindered by different problems such as the technical skills required to use these languages and the difficulty of understanding preexisting UoLs. In order to allow the widespread adoption of EMLs, it is necessary to reduce steep learning curves that prevent instructors from using them. In this work we present the graphical notation used in the e-LD approach, a methodology which promotes the adoption of EMLs simplifying the authoring process of new and preexisting UoLs.
k-shredders in k-connected graphs
Authors: Yoshimi Egawa
Venue: Journal of Graph Theory (2008)

For a graph G, a subset S of V(G) is called a shredder if G&thinsp;-&thinsp;S consists of three or more components. We show that if k &ge; 4 and G is a k-connected graph, then the number of shredders of cardinality k of G is less than 2|V(G)|-3 (we show a better bound for k&thinsp;=&thinsp;4). &copy; 2008 Wiley Periodicals, Inc. J Graph Theory 59: 239&ndash;259, 2008
Mutual Information Analysis
Authors: Benedikt Gierlichs, Lejla Batina, Pim Tuyls, Bart Preneel
Venue: Proceeding sof the 10th international workshop on Cryptographic Hardware and Embedded Systems (2008)

We propose a generic information-theoretic distinguisher for differential side-channel analysis. Our model of side-channel leakage is a refinement of the one given by Standaert et al. An embedded device containing a secret key is modeled as a black box with a leakage function whose output is captured by an adversary through the noisy measurement of a physical observable. Although quite general, the model and the distinguisher are practical and allow us to develop a new differential side-channel attack. More precisely, we build a distinguisher that uses the value of the Mutual Information between the observed measurements and a hypothetical leakage to rank key guesses. The attack is effective without any knowledge about the particular dependencies between measurements and leakage as well as between leakage and processed data, which makes it a universal tool. Our approach is confirmed by results of power analysis experiments. We demonstrate that the model and the attack work effectively in an attack scenario against DPA-resistant logic.
An Assessment of Constraint-Based Tutors: A Response to Mitrovic and Ohlsson's Critique of "A Comparison of Model-Tracing and Constraint-Based Intelligent Tutoring Paradigms"
Authors: Viswanathan Kodaganallur, Rob R. Weitz, David Rosenthal
Venue: International Journal of Artificial Intelligence in Education (2006)

Model tracing and constraint-based modeling are two prominent paradigms on which intelligent tutoring systems (ITSs) have been based. We Kodaganallur, Weitz and Rosenthal (2005), have written a paper comparing the two paradigms, and offering guidance based on this comparison to prospective authors of ITSs. In a detailed critique of our paper, Mitrovic and Ohlsson (2006) have taken issue with many of our observations and conclusions. In this work we refute their critique and provide a more general, critical assessment of constraint-based modeling.
Rule Engine Based Lightweight Framework for Adaptive and Autonomic Computing
Authors: Jakub Adamczyk, Rafał Chojnacki, Marcin Jarząb, Krzysztof Zieliński
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

The paper describes a framework architecture called the Autonomic Management Toolkit (AMT). This toolkit was implemented to support dynamic deployment and management of adaptation loops. This requires automatic resource discovery, instrumentation and attachment to Autonomic Manager (AM), and furthermore a scalable and easily changed decisionmaking module, which is a major part of the AM. The architecture of a system satisfying these requirements is proposed and described. This system is compared to PMAC (Policy Management Autonomic Computing) --- a highly advanced software tool offered by IBM. The central element of AMT is a lightweight AM with Rule Engine as a decisionmaking module. This makes the proposed solution lightweight and flexible. The AM activity is very briefly specified and the process of constructing an execution loop is described. The proposed interfaces are specified. These interfaces are generally sufficient to support a wide range of policies, including standard regulators, well know from control theory. Subsequently, AMT usage is illustrated by a simple example. The paper ends with an overview of related work and conclusions.
User Modelling in Ambient Intelligence for Elderly and Disabled People
Authors: Roberto Casas, Rubén Blasco Marín, Alexia Robinet, Armando Roy Delgado, Armando Roy Yarza, John Mcginn, Richard Picking, Vic Grout
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Combining ongoing Ambient Intelligence (AmI) technological developments (e.g. pervasive computing, wearable devices, sensor networks etc.) with user-centred design methods greatly increases the acceptance of the intelligent system and makes it more capable of providing a better quality of life in a non-intrusive way. Elderly people could clearly benefit from this concept. Thanks to smart environments, they can experience considerable enhancements, giving them an opportunity to live more independently and for longer in their home rather than in a health-care centre. However, to implement such a system, it is essential to know for whom we are designing. In this paper, we present an intelligent system with a monitoring infrastructure that will help mainly elderly users with impairments to overcome their handicap. The purpose of such a system is to create a safe and intuitive environment that will facilitate the achievement of household tasks in order to preserve independence of elderly residents for a while longer. Pursuing this goal, we propose to use the persona concept to help us build a user model based on the personas' aptitudes. The practice of user modelling emphasizes the importance of user-centred techniques in any AmI system development and highlights the potential impacts of AmI for certain targeted groups - in this case, the elderly and people with disabilities.
High performance multivariate visual data exploration for extremely large data
Authors: Oliver Rübel, Prabhat, Kesheng Wu, Hank Childs, Jeremy Meredith, Cameron G. R. Geddes, Estelle Cormier-Michel, Sean Ahern, Gunther H. Weber, Peter Messmer, Hans Hagen, Bernd Hamann, E. Wes Bethel
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

One of the central challenges in modern science is the need to quickly derive knowledge and understanding from large, complex collections of data. We present a new approach that deals with this challenge by combining and extending techniques from high performance visual data analysis and scientific data management. This approach is demonstrated within the context of gaining insight from complex, time-varying datasets produced by a laser wakefield accelerator simulation. Our approach leverages histogram-based parallel coordinates for both visual information display as well as a vehicle for guiding a data mining operation. Data extraction and subsetting are implemented with state-of-the-art index/query technology. This approach, while applied here to accelerator science, is generally applicable to a broad set of science applications, and is implemented in a production-quality visual data analysis infrastructure. We conduct a detailed performance analysis and demonstrate good scalability on a distributed memory Cray XT4 system.
Team Playing Behavior in Robot Soccer: A Case-Based Reasoning Approach
Authors: Raquel Ros, Ramon López De Màntaras, Josep Lluís Arcos, Manuela Veloso
Venue: Proceedings of the 7th international conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2007)

This paper presents extensions and improvements of previous work, where we defined a CBR system for action selection in the robot soccer domain. We show empirical results obtained with real robots, comparing our team playing approach with an individualist approach.
Full Cryptanalysis of LPS and Morgenstern Hash Functions
Authors: Christophe Petit, Kristin Lauter, Jean-Jacques Quisquater
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

Collisions in the LPS cryptographic hash function of Charles, Goren and Lauter have been found by Zémor and Tillich [17], but it was not clear whether computing preimages was also easy for this hash function. We present a probabilistic polynomial time algorithm solving this problem. Subsequently, we study the Morgenstern hash, an interesting variant of LPS hash, and break this function as well. Our attacks build upon the ideas of Zémor and Tillich but are not straightforward extensions of it. Finally, we discuss fixes for the Morgenstern hash function and other applications of our results.
Citizen satisfaction with contacting government on the internet
Authors: Jeffrey E. Cohen
Venue: Information Polity (2006)

This study looks at the satisfaction with their contact experience of citizens using the internet to contact government. Due to the internet, the volume of citizen contacts with government has increased. Presumably the ease and convenience compared to traditional contact modes has stimulated government contacting via the internet. Analysis of the July 2003 Pew E-Government Survey finds that Americans who use the internet to contact government express higher satisfaction levels with their contact experience when controlling for demographics, level of government contacted, reason for the contact, and assessments of the contact process and outcome. However, many internet users also complain of problems in using the internet for contacting government. These problems may outweigh the ease and convenience of internet contacting and may imperil the internet as a way of connecting citizens and government. Suggestions for improving the internet as a medium through which citizens contact government are discussed.
A Moving Boundary Wave Run-Up Model
Authors: Asu İnan, Lale Balas
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

A numerical model has been developed for the simulation long wave propagation and run-up accounting for the bottom friction. Shallow water continuity and momentum equations are solved numerically by a two time step finite difference method. The upwind/downwind method is applied to the nonlinear advection terms and the continuity equation. Effects of damping and bottom friction on the computations are investigated. Since the equations lose their validity when waves break, wave breaking has been checked at every step of the computations. A point can be either wet or dry at different time levels. A moving boundary description and staggered grid are used to overcome the difficulty of determining wet and dry points. Equations are solved by the finite difference approximations of second and third order accuracy. Furthermore, space filters are applied to prevent parasitic short wave oscillations.
A Possible Approach to Cope with Uncertainties in Space Applications
Authors: Michèle Lavagna, Guido Sangiovanni
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

The paper shows methods that could be suitably applied to manage uncertainties in space systems design and modeling. Attention is focused on the Interval Analysis, as one of the most promising methods. In this research two issues typical faced in space-related researchs have been treated: optimization and ordinary differential equations (ODEs) solving taking into account possible uncertainties included in the models; the first is generally related to space system design phases while the second deals with systems dynamics analysis. Because of lack of space this paper presents results from the first area only: more specifically, the optimization of a control system design to accomplish robust reconfiguration manoeuvre is achieved taking into account uncertainties on the technological parameters of the propulsion unit to obtain a robust design from the beginning of the study. Results turned out that the Interval Analysis is effective and efficient to handle these classes of uncertainties.
Slender Siromoney matrix languages
Authors: Ralf Stiebe
Venue: Information and Computation (2008)

A Siromoney matrix grammar is a simple device for the generation of rectangular pictures. In this paper we discuss Siromoney matrix grammars whose picture language are slender, i.e., they contain only a bounded number of pictures for each size. In particular, it is shown that the slenderness decision problem is decidable for Siromoney matrix grammars with context-free rules. Moreover, some closure and decidability questions for slender Siromoney matrix languages are discussed.
Increasing the Scalability and the Speedup of a Fish School Simulator
Authors: Christianne Dalforno, Diego Mostaccio, Remo Suppi, Emilio Luque
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

In this work we present improvements in the speedup and scalability of a distributed fish school simulator. The results were achieved using a new communication strategy for logical processes (LPs) and changing the algorithm of neighbors' selection that is applied to every fish in each simulation step. In the proposed approach each sender process anticipates future neighbors LP's data needs. The new proposed strategy reduces communication time by limiting the amount of messages exchanged among LPs. The new neighbors' selection algorithm was developed with the aim of avoiding unnecessary work. Diminishing the instructions executed by each fish being simulated in each simulation step caused a great reduction in the simulation time.
A Formal Framework of Conversational Goals Based on Strategic Reasoning
Authors: Mohamed Mbarki, Jamal Bentahar, Bernard Moulin
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this paper, we propose a formal framework of strategic reasoning that agents use when interacting in a dialogue and trying to achieve their conversational goals. Such argumentation-based reasoning enables agents to generate a set of strategic goals depending on a set of constraints. Strategic goals are sub-goals, which are necessary to achieve a conversational goal. Some of these sub-goals are generated at the beginning of the interaction and they can be canceled or substituted by alternatives during the dialogue. An original characteristic of this framework is that it enables agents to persist in the achievement of their goals by considering alternatives and calculating the feasibility of each sub-goal. The set of constraints as well as sub-goals can be set at the beginning or during the dialogue.
Application of Fractal Theory for On-Line and Off-Line Farsi Digit Recognition
Authors: Saeed Mozaffari, Karim Faez, Volker Märgner
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

Fractal theory has been used for computer graphics, image compression and different fields of pattern recognition. In this paper, a fractal based method for recognition of both on-line and off-line Farsi/ Arabic handwritten digits is proposed. Our main goal is to verify whether fractal theory is able to capture discriminatory information from digits for pattern recognition task. Digit classification problem (on-line and off-line) deals with patterns which do not have complex structure. So, a general purpose fractal coder, introduced for image compression, is simplified to be utilized for this application. In order to do that, during the coding process, contrast and luminosity information of each point in the input pattern are ignored. Therefore, this approach can deal with on-line data and binary images of handwritten Farsi digits. In fact, our system represents the shape of the input pattern by searching for a set of geometrical relationship between parts of it. Some fractal-based features are directly extracted by the fractal coder. We show that the resulting features have invariant properties which can be used for object recognition.
Low Latency Cross Layer Handover Scheme in Proxy Mobile IPv6 Domain
Authors: Geunhyung Kim
Venue: Proceedings of the 8th international conference, NEW2AN and 1st Russian Conference on Smart Spaces, ruSMART on Next Generation Teletraffic and Wired/Wireless Advanced Networking (2008)

In IP-based wireless networks, minimizing handover latency with few packet loss is one of the most important issues. To achieve this goal, host-based and network-based fast or localized mobility management solutions have been proposed. Proxy Mobile IPv6(PMIPv6) avoids tunneling overhead over the air and supports mobility for hosts without host involvement. However, the basic performance of PMIPv6 for handover latency and packet loss is not different from that of Mobile IPv6.In this paper, we propose an enhancement for PMIPv6 to reduce the packet reception latency and to minimize packet loss for both intra-local mobility anchor(LMA) and inter-LMA handover by pre-establishing bidirectional tunnel between MAGs within an administrative domain. As a result, we found that the proposed scheme, though it requires additional signaling messages to establish the bidirectional tunnels, guarantees lower packet reception latency and fewer packet loss than other recent approaches without erroneous movement prediction.