ppxscal/embedding_network huggingface dataset:
Testing Metamodels
Authors: Daniel A. Sadilek, Stephan Weißleder
Venue: Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications (2008)

In this paper, we deal with errors in metamodels. Metamodels define the abstract syntax of modeling languages. They play a central role in the Model-Driven Architecture. Other artifacts like models or tools are based on them and have to be changed if the metamodel is changed. Consequently, correcting errors in a metamodel can be quite expensive as dependent artifacts have to be adapted to the corrected metamodel. We argue that metamodels should be tested systematically with automated tests. We present a corresponding approach that allows automated metamodel testing based on a test specification. From a test specification, multiple test models can be derived. Each test model defines a potential instance of the metamodel under test. A positive test model defines a potential instance that should be an actual instance of the metamodel; a negative test model defines one that should not. We exemplify our approach with a metamodel for defining a company's structure. Finally, we present MMUnit, an implementation of our approach that builds on the Eclipse platform and integrates the JUnit framework. MMUnit allows to test EMF-based metamodels, which can contain additional constraints, e.g. constraints expressed in OCL.
Tag Mechanisms Evaluated for Coordination in Open Multi-Agent Systems
Authors: Isaac Chao, Oscar Ardaiz, Ramon Sanguesa
Venue: Engineering Societies in the Agents World VIII: 8th International Workshop, ESAW 2007, Athens, Greece, October 22-24, 2007, Revised Selected Papers (2008)

Tags are arbitrary social labels carried by agents. When agents interact preferentially with those sharing the same Tag, groups are formed around similar Tags. This property can be used to achieve desired group coordination by evolving agent's Tags through a group selection process. In this paper Tags performance is for the first time compared by simulation with alternative mechanisms for coordinated learning in multi-agent systems populations. We target open systems, hence we do not make costly assumptions on agent capabilities (rational or computational). It is a requirement that coordination strategies prove simple to implement and scalable. We build a simulator incorporating competition and cooperation scenarios modeled as one-shot repeated games between agents. Tags prove to be a very good coordination mechanism in both, cooperation building in competitive scenarios and agent behavior coordination in fully cooperative scenarios.
Layered Duplicate Detection in External-Memory Model Checking
Authors: Peter Lamborn, Eric A. Hansen
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

This paper presents a disk-based explicit-state model checking algorithm that uses an approach called layered duplicate detection. In this approach, states encountered during a breadth-first traversal of the graph of the transition system are stored in memory according to the layer of the graph in which they are first encountered. With this layered organization of memory, transition locality is exploited by checking only the most recent layers for duplicates. In RAM, exploiting transition locality in this way saves time. In external memory, it saves space. In addition, a layered structure allows an easy method of counterexample reconstruction in disk-based model checking. We prove a worst-case linear bound on the redundant work performed by our approach. Experimental results indicate that average case redundant work is much better than the worst-case. The implemented model checker has been used to verify a transition system that required more than 275 GBs of disk storage.
Multiple Approximate Dynamic Programming Controllers for Congestion Control
Authors: Yanping Xiang, Jianqiang Yi, Dongbin Zhao
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

A communication network is a highly complex nonlinear dynamical system. To avoid congestion collapse and keep network utilization high, many congestion control methods have been proposed. In this paper, a new framework, using Adaptive Critic Designs (ACD) based on Approximate Dynamic Programming (ADP) theory, is presented for network congestion control. At the present time, almost all ACD controllers are designed for centralized control system. In the new frame, the whole network is considered as a multiple non-cooperative ACDs control system, wherein, each source controller is governed by an ACD. This frame provides a new approach to solve the congestion control problem of the networks.
Cross-Cultural Evaluations of Avatar Facial Expressions Designed by Western Designers
Authors: Tomoko Koda, Matthias Rehm, Elisabeth André
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

The goal of the study is to investigate cultural differences in avatar expression evaluation and apply findings from psychological study in human facial expression recognition. Our previous study using Japanese designed avatars showed there are cultural differences in interpreting avatar facial expressions, and the psychological theory that suggests physical proximity affects facial expression recognition accuracy is also applicable to avatar facial expressions. This paper summarizes the early results of the successive experiment that uses western designed avatars. We observed tendencies of cultural differences in avatar facial expression interpretation in western designed avatars.
High Performance Approach for Multi-QoS Constrained Web Services Selection
Authors: Lei Li, Jun Wei, Tao Huang
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

In general, multi-QoS constrained Web Services composition, with or without optimization, is a NP-complete problem on computational complexity that cannot be exactly solved in polynomial time. A lot of heuristics and approximation algorithms with polynomial- and pseudo-polynomial-time complexities have been designed to deal with this problem. However, they suffer from excessive computational complexities that cannot be used for service composition in runtime. In this paper, we propose a high performance approach for multi-QoS constrained Web Services selection. Firstly, a correlation model of candidate services are established in order to reduce the search space efficiently. Based on the correlation model, a heuristic algorithm is then proposed to find a feasible solution for multi-QoS constrained Web Services selection with high performance and high precision. The experimental results show that the proposed approach can achieve the expecting goal.
Preventing Illegal Information Flow Based on Role-Based Access Control Model
Authors: Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 2nd international conference on Network-Based Information Systems (2008)

In the role-based access control (RBAC) model, authorized access requests are specified in roles. However, illegal information flow might occur as the well known confinement problem. We first define legal, independent, illegal, and possibly illegal types of information flow relations, R 1 $\Rightarrow$ R 2, R 1 || R 2, R 1 $\hookrightarrow$ R 2, and R 1 ¿ R 2 among role families R 1 and R 2, respectively. Suppose a transaction T 1 with a role family R 1 precedes T 2 with R 2 in a schedule, i.e. for every pair of conflicting methods op 1 and op 2 from T 1 and T 2, respectively, op 1 is performed prior to op 2. Here, if R 1 $\Rightarrow$ R 2 or R 1 || R 2 hold, no illegal information flow occur. Otherwise, illegal information flow might occur. Hence, T 2 cannot be performed. In this paper, we discuss the locking protocol for synchronizing conflicting transactions so that no illegal information flow occur based on the information flow relations. In addition, we discuss when the role-based locks are released.
Securing vehicles against cyber attacks
Authors: Ulf E. Larson, Dennis K. Nilsson
Venue: Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead (2008)

The automobile industry has grown to become an integral part of our everyday life. As vehicles evolve, the primarily mechanical solutions for vehicle control are gradually replaced by electronics and software solutions forming in-vehicle computer networks. An emerging trend is to introduce wireless technology in the vehicle domain by attaching a wireless gateway to the in-vehicle network. By allowing wireless communication, real-time information exchange between vehicles and between infrastructure and vehicles become reality. This communication allows for road condition reporting, decision making, and remote diagnostics and firmware updates over-the-air. However, allowing external parties wireless access to the in-vehicle network creates a potential entry-point for cyber attacks. In this paper, we investigate the security issues of allowing external wireless communication. We use a defense-in-depth perspective and discuss security challenges for each of the prevention, detection, deflection, countermeasures, and recovery layers.
Knowledge Mining for the Business Analyst
Authors: Themis Palpanas, Jakka Sairamesh
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

There is an extensive literature on data mining techniques, including several applications of these techniques in the e-commerce setting. However, all previous approaches require that expert users interpret the data mining results, making them cumbersome to use by business analysts. In this work, we describe a framework that shows how data mining technology can be effectively applied in an e-commerce environment, delivering significant benefits to the business analyst. Using a real-world case study, we demonstrate the added benefit of the proposed method. We also validate the claim that the produced results represent actionable knowledge that can help the business analyst improve the business performance, by significantly reducing the time needed for data analysis, which results in substantial financial savings.
Image Emotional Classification Based on Color Semantic Description
Authors: Kaiping Wei, Bin He, Tao Zhang, Wenya He
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Describing images in semantic terms is an important and challenging problem in content-based image retrieval. According to the strong relationship between colors and human emotions, an emotional image classification model based on color semantic terms is proposed in this paper. First, combined with PSO, fuzzy c-means clustering is implemented for color segmentation, and eight color clusters can be obtained to describe the main color of an image. Secondly, based on Wundt's theory, a 3D emotional model is constructed and a novel approach for describing image color semantic is proposed. Finally, we present a trial classification system which allows users to query images using emotional semantic words. Experimental results demonstrate that this model is effective for sentimental image classification.
Exact Sojourn Time Distribution in an Online IPTV Recording System
Authors: Tobias Hoßfeld, Kenji Leibnitz, Marie-Ange Remiche
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

In this paper we analytically derive the sojourn time of a user accessing an online IPTV recording service. Basically, the system consists of a server (or server farm) and the bandwidth at which a user can download recorded files depends on the number of other concurrently downloading users. In particular, we consider both cases, one in which the user's download speed is limited by his own access bandwidth, whereas in the other case the server is the bottleneck and all downloading users share the server's upload capacity. Our model includes user impatience which depends on the actual download speed. A user may abort his download attempt if a threshold duration is exceeded. The file size distribution is obtained by measurements of offered files at an existing server.
Varadhan estimates in semi-group theory: upper bound
Authors: Remi Leandre
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

We translate in semi-group theory our proof of Varadhan estimates for subelliptic Laplacians which was using the theory of large deviations of Wentzel-Freidlin and the Malliavin Calculus of Bismut type.
Mini Project Programming Exams
Authors: Kurt Nørmark, Lone Leth Thomsen, Kristian Torp
Venue: Reflections on the Teaching of Programming: Methods and Implementations (2008)

A number of different types of final programming exams used or considered at the Department of Computer Science, Aalborg University, are identified and analyzed. Based on this analysis, a new type of programming exam is introduced called a Mini Project Programming (MIP) exam. MIP is a group-based programming assignment that is intended as a medium-scale programming effort followed by a final oral exam. MIP is characterized and compared to existing types of final programming exams by use of a number of independent criteria. The chapter motivates the MIP approach and reports on our experience over four years. The MIP exam is a compromise between (1) a long problem-based project exam and (2) a short oral or written programming exam. It is concluded that the strengths of MIP are the high degree of realism in the exam assignment and comprehensiveness relative to the course syllabus. The main challenge of MIP is how to detect fraud.
Training on the Job -- Collecting Experience with Hierarchical Hybrid Automata
Authors: Alexandra Kirsch, Michael Beetz
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

We propose a novel approach to experience collection for autonomous service robots performing complex activities. This approach enables robots to collect data for multiple learning problems at a time, abstract it and transform it into information specific to the learning tasks and thereby speeding up the learning process. The approach is based on the concept of hierarchical hybrid automata, which are used as expressive representational mechanisms that allow for the specification of these experience-related capabilities independent of the program itself.
An Image Protection Scheme Using the Wavelet Coefficients Based on Fingerprinting Technique
Authors: Jin-Wook Shin, Ju Cheng Yang, Sook Yoon, Dong-Sun Park
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Various technologies have been used to protect the copyrights of digital contents from illegal or unintentional attacks. Watermarking methods protect digital contents by embedding a watermark message into them. However, since conventional watermarking algorithms change original digital contents to embed digital watermarks using various embedding methods, they result in the degradation of digital contents and decrease the fidelity of digital contents. A fingerprinting technique can be also used for protecting digital contents. However this method may have high computational complexity to generate unique features for digital contents. In order to provide the excellent fidelity, the proposed technique distributes original digital contents without any change like fingerprinting technique and just generates the content-associated information, which is combined wavelet coefficients with copyright message and used to extract copyright message afterward. Experimental results show that the proposed method outperforms an existing method for various signal processing attacks.
Virtual base station election for wireless sensor networks
Authors: Cherif Diallo, Ashish Gupta, Michel Marot, Monique Becker
Venue: Proceedings of the 8th international conference on New technologies in distributed systems (2008)

In a classical wireless sensor network, a base station is often present to ensure efficient data collection. Endowed with typical hardware feature, especially with high energy level and good stockpiling capabilities, the base station completes the architecture as a required component for a wide range of applications. However, there are some projects where base station deployment should be avoided without reducing network efficiency. Thus, in a cold chain supervision project, it&Scaron;s not necessary to add base station to a wireless sensors network deployed inside a food or a medical truck. In this manner, it is a low-budget sensors network deployment. Moreover, such applications have to replicate data across all nodes and to maintain same information as well. In this paper, we propose databases updating model for homogeneous wireless sensors network deployed in a food truck without any base station. In this model, Virtual Base Station (VBS) is the node which is elected to act as classical base station during a specific period of time. Virtual Base Station (VBS) election&Scaron;s algorithm is based on the remaining energy for each node and latest Virtual Bases Station (VBS) to reduce overall energy spent by network. Simulation results (using MATLAB) show that VBS model introduces very low overhead with respect to the classical network with permanent Base Station (BS).
Integration of a parallel algorithm with a cluster grid for an industrial framework
Authors: Massimo Orazio Spata, Salvatore Rinaudo, Angelo Marotta, Francesco Moschella
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

Computer simulations are becoming a fundamental instrument in order to determine the suffer effects of a specific model by varying its input parameters. However, to obtain simulation results, the needed computational power required, by increasing the model parameters, in a reasonable time, is not so indifferent. So the aim of this research is to optimize computational throughput. At ST Microelectronics, a new integrated computational solution to resolve this problem in an efficient way has been implemented and tested. This solution consist of two blocks: a parallel implementation approach, named Exemplar, and a workload balancing system into a Cluster Grid. The first block was designed on a heterogeneous hardware platform which could have different computational performances. It is based on different optimization methods: CRS (Controlled Random Search) method, and Monte Carlo method. The second block consists of a cluster of CPU servers integrated through a workload balance system and a data resource management system (DRMS).
Syllable Based Language Model for Large Vocabulary Continuous Speech Recognition of Polish
Authors: Piotr Majewski
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

Most of state-of-the-art large vocabulary continuous speech recognition systems use word-based n-gram language models. Such models are not optimal solution for inflectional or agglutinative languages. The Polish language is highly inflectional one and requires a very large corpora to create a sufficient language model with the small out-of-vocabulary ratio. We propose a syllable-based language model, which is better suited to highly inflectional language like Polish. In case of lack of resources (i.e. small corpora) syllable-based model outperforms word-based models in terms of number of out-of-vocabulary units (syllables in our model). Such model is an approximation of the morpheme-based model for Polish. In our paper, we show results of evaluation of syllable based model and its usefulness in speech recognition tasks.
Algorithms for Exploring the Space of Gene Tree/Species Tree Reconciliations
Authors: Jean-Philippe Doyon, Cedric Chauve, Sylvie Hamel
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, and combinatorial operators and algorithms to explore the space of all possible reconciliations between a gene tree and a species tree in optimal time. We apply these algorithms to simulated data.
wisePad services for vision-, hearing-, and speech-impaired users
Authors: Dawn N. Jutla, Dimitri Kanevsky
Venue: Communications of the ACM (2009)

They promise mobile information access and assistive Web services for tens of millions worldwide.
A Genetic Algorithm-Based Artificial Neural Network Approach for Parameter Selection in the Production of Tailor-Welded Blanks
Authors: Yun Liu, De Xu, Xiuqing Wang, Min Tan, Yongqian Zhang
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

Laser cutting and welding is an efficient way to produce Tailor-Welded Blanks (TWBs). A genetic algorithm (GA)-based artificial neural network (ANN) approach is designed for parameter selection of laser cutting and welding to produce TWBs. These parameters include laser power for cutting and welding, speed for cutting and welding, and pressure of assistant gas. Experimental results demonstrate that the proposed parameter selection approach combines the merits of GA and ANN, and solves the problem of local optimum in ANN and low convergence speed in GA. As a result, it tackles the difficulty in parameter selection of laser cutting and welding and paves the way for TWBs' production.
How a Generative Encoding Fares as Problem-Regularity Decreases
Authors: Jeff Clune, Charles Ofria, Robert T. Pennock
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

It has been shown that generative representations, which allow the reuse of code, perform well on problems with high regularity (i.e. where a phenotypic motif must be repeated many times). To date, however, generative representations have not been tested on irregular problems. It is unknown how they will fare on problems with intermediate and low amounts of regularity. This paper compares a generative representation to a direct representation on problems that range from having multiple types of regularity to one that is completely irregular. As the regularity of the problem decreases, the performance of the generative representation degrades to, and then underperforms, the direct encoding. The degradation is not linear, however, yet tends to be consistent for different types of problem regularity. Furthermore, if the regularity of each type is sufficiently high, the generative encoding can simultaneously exploit different types of regularities.
Pairing Devices with Good Quality Output Interfaces
Authors: Nitesh Saxena, Jonathan Voris
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

The operation of achieving authenticated key agreement between two human-operated devices over a short range wireless communication channel, such as Bluetooth or Wi-Fi, is known as "pairing". The devices being paired are ad hoc in nature, i.e., they can not be assumed to have a prior context (such as pre-shared secrets) or a common trusted on- or off-line authority. However, the devices can generally be connected using auxiliary physical channel(s) (such as audio or visual) that can be authenticated by the user(s) of the devices. These authenticatable channels can be used to form a basis for pairing.In this paper, we present the results of a user study of a technique used to pair two devices (such as two cell phones) which have good quality output interfaces in the form of a display, speaker, and/or vibration.