ppxscal/embedding_network huggingface dataset:
Service composition for mobile environments
Authors: Dipanjan Chakraborty, Anupam Joshi, Tim Finin, Yelena Yesha
Venue: Mobile Networks and Applications (2005)

Service Composition, that is, the development of customized services by discovering, integrating and executing existing services has received a lot of attention in the last couple of years with respect to wired-infrastructure or Internet web services. With the advancement in the wireless technology and rapid deployment of mobile devices, we envision that in the near future wirelessly connected mobile devices in a given vicinity will also provide services that can be leveraged in the composition process. This is particularly true of what have been described as "pervasive computing" environments. However, wired-infrastructure based service composition architectures are not designed to consider the various factors like mobility, device heterogeneity, resource variability and reliability in a mobile environment. In this paper, we describe the issues related to service composition in mobile environments and evaluate criteria for judging protocols that enable such composition. We present a distributed architecture and associated protocols for service composition in mobile environments that take into consideration mobility, dynamic changing service topology and device resources. The composition protocols are based on distributed brokerage mechanisms and utilize a distributed service discovery process over ad-hoc network connectivity. We present simulation results of our protocols, and compare them with a centralized service composition protocol traditionally used for wired-infrastructure environments. The results show that our approach clearly outperforms the existing centralized approaches, and that our protocols are able to adapt and better utilize the changing service topology and resources in a mobile environment.
Towards lightweight information dissemination in inter-vehicular networks
Authors: Paolo Costa, Davide Frey, Matteo Migliavacca, Luca Mottola
Venue: Proceedings of the 3rd international workshop on Vehicular ad hoc networks (2006)

Vehicular ad hoc networks have recently been proposed as an effective tool for improving both road safety and the comfort experienced while driving. Vehicles may propagate information about potentially dangerous events such as lane changes or sudden slowdowns to vehicles in their vicinity. Moreover they can inform vehicles approaching from farther areas about accidents and possible traffic jams. In both cases, data must be routed to specific areas, along paths determined by the underlying road traffic conditions.In this paper we propose a novel approach to address this routing problem. First, we define a message propagation function that encodes information about both target areas and preferred routes. Second, we show how this function can be exploited in several routing protocols; and finally, we evaluate the effectiveness of our approach by means of simulation. Results highlight the good performance of our routing approach in sparse as well as in dense networks.
Semi-automatic Derivation of Specific-Domain Ontologies for the Semantic Web
Authors: JRG Pulido, MA Arechiga, R Acosta, PD Reyes, S Legrand
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

This paper describes an approach for helping in the semi-automatic construction of specific-domain ontology components contained in a digital archive. This proposal for extracting knowledge from digital sources allows users to have a view of this knowledge and visualize specific-domain ontology components that with further processing can be shared with software agents by embedding it into digital archives themselves in the context of the Semantic Web. In particular, we deal with the issue of not constructing the ontology from scratch, our approach helps us to speed up the ontology creation process.
GridBeans: Support e-Science and Grid Applications
Authors: Ralf Ratering, Alexander Lukichev, Morris Riedel, Daniel Mallmann, A. Vanni, C. Cacciari, S. Lanzarini, K. Benedyczak, M. Borcz, R. Kluszcynski, Piotr Bala, Gert Ohme
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Large-scale scientific research often relies on the collaborative use of Grid and e-Science infrastructures that provide computational or storage related resources. One of the ideas of these modern infrastructures is to facilitate the routine interaction of scientists and their workflows with advanced problem solving tools and computational resources. While many production Grid projects and e-Science infrastructures have begun to offer services for the usage of resources to end-users during the past several years, the corresponding emerging standards defined by GGF and OASIS still appear to be in flux. In this paper, we present the GridBean technology that bridges the gap between the constantly changing basic Grid or e-Science infrastructures and the need of stable application development environments for the Grid users.
Probabilistic semantic network-based image retrieval using MMM and relevance feedback
Authors: Mei-Ling Shyu, Shu-Ching Chen, Min Chen, Chengcui Zhang, Chi-Min Shu
Venue: Multimedia Tools and Applications (2006)

The performance of content-based image retrieval (CBIR) systems is largely limited by the gap between the low-level features and high-level semantic concepts. In this paper, a probabilistic semantic network-based image retrieval framework using relevance feedback is proposed to bridge this gap, which not only takes into consideration the low-level image content features, but also learns high-level concepts from a set of training data, such as access frequencies and access patterns of the images. One of the distinct properties of our framework is that it exploits the structured description of visual contents as well as the relative affinity measurements among the images. Consequently, it provides the capability to bridge the gap between the low-level features and high-level concepts. Moreover, such high-level concepts can be learned off-line, and can be utilized and refined based on the user's specific interest during the on-line retrieval process. Our experimental results demonstrate that the proposed framework can effectively assist in retrieving more accurate results for user queries.
Boolean equation solving as graph traversal
Authors: Brian Herlihy, Peter Schachte, Harald Søndergaard
Venue: Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 (2006)

We present a new method for finding closed forms of recursive Boolean function definitions. Traditionally, these closed forms are found by iteratively approximating until a fixed point is reached. Conceptually, our new method replaces each k-ary function by 2k Boolean variables defined by mutual recursion. The introduction of an exponential number of variables is mitigated by the simplicity of their definitions and by the use of a novel variant of ROBDDs to avoid repeated computation. Experimental evaluation suggests that this approach is significantly faster than Kleene iteration for examples that would require many Kleene iteration steps.
Stereo Image Matching Using Wavelet Scale-Space Representation
Authors: Asim Bhatti, Saeid Nahavandi
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

A multi-resolution technique for matching a stereo pair of images based on translation invariant discrete multiwavelet transform is presented. The technique uses the well known coarse to fine strategy, involving the calculation of matching points at the coarsest level with consequent refinement up to the finest level. Vector coefficients of the wavelet transform modulus are used as matching features, where modulus maxima defines the shift invariant high-level features (multiscale edges) with phase pointing to the normal of the feature surface. The technique addresses the estimation of optimal corresponding points and the corresponding 2D disparity maps. Illuminative variation that can exist between the perspective views of the same scene is controlled using scale normalization at each decomposition level by dividing the details space coefficients with approximation space and then using normalized correlation. The problem of ambiguity, explicitly, and occlusion, implicitly, is addressed by using a geometric topological refinement procedure and symbolic tagging.
Performance analysis of some cumulant-based estimators: harmonics in noise
Authors: A. Swami
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

We consider the problem of estimating the parameters of harmonics (with non-random parameters) observed in zero mean (colored/white, Gaussian/non-Gaussian) stationary mixing noise. A new fourth-order moment based non-parametric estimator is introduced, and it is shown that this estimator is superior to the conventional second-order estimator at all SNR's. The variance of the frequency estimator is shown to converge as 1/T/sup 3/; for the harmonic with frequency /spl omega//sub 0/, and amplitude A/sub 0/, the peak amplitude of the normalized fourth-order spectrum is shown to be /spl alpha/(/spl omega//sub 0/)(|A/sub 0/|/sup 2//2/spl sigma//sub /spl upsi///sup 2/+1)/sup 2/ where /spl alpha/(/spl omega//sub 0/) is the local SNR, and /spl sigma//sub /spl upsi///sup 2/ is the noise variance. 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
Perspectives in analysing classroom interaction data on collaborative computer-based mathematical projects
Authors: Chronis Kynigos
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

In view of the potential of CSCL for educational innovation, this paper illuminates some aspects resisting the development of quality social interaction in pupil collaboration. A study is reported where pupils worked in small groups in computer-based classroom activity within the framework of a six year-old innovation program in a primary school. A combined ethnographic and discourse analytic model is used to describe group dynamics in four groups of pupils (aged 8-11) involved in tasks of exploratory learning. We analyzed the data taking three distinct perspectives, a personal or insider&iacute;s perspective, an interactionist perspective and a social norms perspective. The former revealed the pupil to be a person who seemed to perceive the society within which he/she was called upon to act, as a forum in which to claim and defend his/her social role. The interactionist perspective brought forward the issue of role negotiation and its overbearing presence in social exchange in the form of groupthink, role confusion and vagueness. Finally, the group and classroom social norms, which seemed to have emerged as functional within these societies, had a judgmental character.
Reversible Data Hiding for 3D Point Cloud Model
Authors: Hao Luo, Jeng-Shyang Pan, Zhe-Ming Lu, Hsiang-Cheh Huang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

This paper proposes a reversible data hiding scheme for 3D point cloud model. It exploits the high correlation among neighbor vertices to embed data. It starts with creating a set of 8-neighbor vertices clusters with randomly selected seed vertices. Then an 8-point integer DCT is performed on these clusters and an efficient highest frequency coefficient modification technique is employed to modulate the watermark bit. In data extraction, the modified clusters are retrieved first, and other operations are the inverse process of the data hiding. The original model can be perfectly recovered if it is intact. Our scheme is suitable for some specific applications where content accuracy of the original model must be guaranteed. Moreover, the method can be used for 3D point cloud model authentication, e.g., hiding a hash sequence.
Outlier detection by active learning
Authors: Naoki Abe, Bianca Zadrozny, John Langford
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Most existing approaches to outlier detection are based on density estimation methods. There are two notable issues with these methods: one is the lack of explanation for outlier flagging decisions, and the other is the relatively high computational requirement. In this paper, we present a novel approach to outlier detection based on classification, in an attempt to address both of these issues. Our approach isbased on two key ideas. First, we present a simple reduction of outlier detection to classification, via a procedure that involves applying classification to a labeled data set containing artificially generated examples that play the role of potential outliers. Once the task has been reduced to classification, we then invoke a selective sampling mechanism based on active learning to the reduced classification problem. We empirically evaluate the proposed approach using a number of data sets, and find that our method is superior to other methods based on the same reduction to classification, but using standard classification methods. We also show that it is competitive to the state-of-the-art outlier detection methods in the literature based on density estimation, while significantly improving the computational complexity and explanatory power.
An Improved Secret Key Estimation Method for Sequential Steganography
Authors: Ping Wang, Xiangyang Luo, Fenlin Liu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

This paper presents an improved algorithm to detect the beginning and end of the secret message during low frequency embedding in sequential steganography. Based on the fact that the statistics of stego signal have a higher jump after sequential embedding, the method effectively indicates the jump in low frequency embedding through adjusting the log likelihood estimator, namely, increasing the power of the standard deviations and introducing the modulating factors, and then develops a new cumulative sum detector. Experiments show that this method still can estimate the secret key in the low frequency embedding even though the message strength is as low as 0.3.
ANEMONE: an effective minimal ontology negotiation environment
Authors: Jurriaan van Diggelen, Robbert-Jan Beun, Frank Dignum, Rogier M. van Eijk, John-Jules Meyer
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Communication in open heterogeneous multi agent systems is hampered by lack of shared ontologies. To overcome these problems, we propose a layered communication protocol which incorporates techniques for ontology exchange. Using this protocol, the agents gradually build towards a semantically integrated system by establishing minimal and effective shared ontologies. We tested our approach, called ANEMONE, on a number of heterogeneous news agents. We show how these agents successfully exchange information on news articles, despite initial difficulties raised by heterogeneous ontologies.
Explaining Winning Poker--A Data Mining Approach
Authors: Ulf Johansson, Cecilia Sonstrod, Lars Niklasson
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

This paper presents an application where machine learning techniques are used to mine data gathered from online poker in order to explain what signifies successful play. The study focuses on short-handed small stakes Texas Hold'em, and the data set used contains 105 human players, each having played more than 500 hands. Techniques used are decision trees and G-REX, a rule extractor based on genetic programming. The overall result is that the rules induced are rather compact and have very high accuracy, thus providing good explanations of successful play. It is of course quite hard to assess the quality of the rules; i.e. if they provide something novel and non-trivial. The main picture is, however, that obtained rules are consistent with established poker theory. With this in mind, we believe that the suggested techniques will in future studies, where substantially more data is available, produce clear and accurate descriptions of what constitutes the difference between winning and losing in poker.
Using Morris' randomized OAT design as a factor screening method for developing simulation metamodels
Authors: Fasihul M. Alam, Ken R. McNaught, Trevor J. Ringrose
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Simulation metamodels have been used for optimization, prediction, sensitivity analysis and understanding of complex, real-world systems. Since most simulation models contain a large number of input parameters, it is of great interest to determine the most important ones to include in a metamodel given a particular modeling context, i.e. given a particular set of questions which are to be addressed by the metamodel. This paper employs Morris' randomized one-at-a-time (OAT) design as a factor screening method prior to developing a number of simulation metamodels. The approach is illustrated with reference to a stochastic combat simulation, called SIMBAT.
Defining Agile Software Quality Assurance
Authors: E. Mnkandla, B. Dwolatzky
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Agile software development methodologies have since their inception claimed to improve the quality of the software product. The agile practitioners have also claimed that use of the agile approach has greatly improved the quality of their products. However, software quality is a rather complex concept; in fact some have defined the entire discipline of software engineering as the production of quality software. Quality according to ISO 9000 is defined as "the totality of characteristics of an entity that bear on its ability to satisfy stated or implied needs." In the existing agile literature there as not been a comprehensive definition of which characteristics of software quality are improved by the use of agile processes in developing software. In this paper an innovative technique is introduced for evaluating agile methodologies in order to determine which factors of software quality they improve. The technique uses a set of adapted software quality factors as defined by Bertrand Meyer and McCall.
Model-Driven Instructional Engineering to Generate Adaptable Learning Materials
Authors: Juan Manuel Dodero, David Diez
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The application of software engineering approaches to generate learning material adapted to a specific instructional purpose presents some issues: the use of different models, different abstraction levels, different contexts and development concerns. These can be overcome by a model-driven development approach that provides different levels of automation for instructional engineering.
An Overview of the Use of Remote Embedded Sensors for Audio Acquisition and Processing
Authors: Lewis Girod, Marie A. Roch
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

In recent decades, the cost of acoustic technologies has declined dramatically. Advances in networks, storage devices, and power management have made it practical to consider the remote location of sensors. Nonetheless, many challenges remain for the fabrication, deployment, and use of remote sensors. This paper provides an overview of the issues involved in developing remote acoustic sensors. We discuss physical design and the integration of components, data storage and communication issues, signal acquisition and classification, and the relationship of these issues to power usage requirements.
Lifelike agents in e-commerce: a study of humanness in interface agents
Authors: Clifford I. Nass
Venue:  (2006)

As animated on-screen characters become increasingly lifelike, one question pertains to the effects of human-likeness in interface agents. Lifelike agents can differ from humans in several ways: First, ontologically (being an actual human vs. being computer-generated); second, looking human (looking exactly like a person vs. looking computer-generated); and third, displaying appropriate human-like behaviors (behaving socially human vs. behaving computerlike). This study focused on how these dimensions of humanness affect each other in highly lifelike agents. Two competing theories were utilized to predict the effects of combining human and non-human qualities in interface agents: Consistency theory states that consistency of traits leads to higher levels of positive affect, predicting that "purely" human-like or computer-like agents will elicit greater positive affect than agents displaying mixed traits. Alternatively, the independent maximization paradigm predicts a simple preference for higher quality agents, regardless of trait inconsistencies. A 2 (ontologically human vs. computer-generated) x 2 (human-looking vs. computer-looking) x 2 (human-like [nonverbally immediate] behavior vs. computer-like [nonverbally flat] behavior) experiment (N = 48) was conducted to determine the effects of different combinations of human-like and computer-like traits on users' perceptions of highly lifelike agents and buying behavior in an e-commerce context. Significant main effects for nonverbal immediacy underscored the importance of this trait regardless of ontology and physical appearance. Interaction effects indicated that for a computer-generated agent, both human- and computer-like traits are acceptable, while for a human agent, only human-like traits lead to favorable evaluations. Overall, consistency theory was supported. For an ontologically human agent, human-like behavior led to favorable attitudes about the agent, while in several instances, for the computer-generated agent, computer-like physical appearance led to more favorable evaluations, pointing to users' preferences for trait-consistent characters. In addition, when the agent was a computer-generated agent or looked like one, a lack of positive nonverbal cues was considered more acceptable, while a human or human-looking agent was only evaluated positively when displaying appropriate positive nonverbal cues. Directions for future research are suggested and implications for designing lifelike agents are discussed.