ppxscal/embedding_network huggingface dataset:
Towards embedding assessment in CSCL scripts through selection and assembly of learning and assessment patterns
Authors: E. D. Villasclaras-Fernández, D. Hernández-Leo, J. I. Asensio-Pérez, Y. Dimitriadis, A. Martínez-Monés
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Assessment is one of the key elements of learning scenarios, both in individual and collaborative learning. Thus, embedding assessment in Computer Supported Collaborative Learning (CSCL) scripts can potentially enhance the enactment of collaborative learning sessions, by explicitly indicating how assessment is to be carried out. However, assessment design has also been recognized as a demanding task for non-expert instructional designers or practitioners. To tackle this problem, the use of learning and assessment patterns has already been reported as a way of supporting script design for non-experts. In this context, the combination of patterns of different nature (learning-oriented and assessment-oriented) can be regarded as an essential task of CSCL script design. This paper discusses how to support this task, focusing on the joint application of patterns, and describes an evaluation of the proposed approach.
Mapping the E-Government Research with Social Network Analysis
Authors: Nuša Erman, Ljupčo Todorovski
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

About fifteen years of e-government research (EGR) lead to a research field that is looking forward to define an identity as a proper and autonomous scientific discipline. This paper proposes the use of social network analysis as a methodology for building a map of EGR and consequently contributing to the process of establishing EGR identity. The paper analyzes the network of citation between authors induced by papers published in the four proceedings of this conference (International Conference on e-Government) in the period from 2005 to 2008. The analysis helps us identify the authors that had most influence on the EGR field development and relate them to the thematic topics that prevailed the conference papers in the last four years.
Computing Stable Models via Reductions to Difference Logic
Authors: Tomi Janhunen, Ilkka Niemelä, Mark Sevalnev
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

Propositional satisfiability (SAT) solvers provide a promising computational platform for logic programs under the stable model semantics. However, computing stable models of a logic program using a SAT solver presumes translating the program into a set of clauses which is the input form accepted by most SAT solvers. This leads to fairly complex super-linear translations. There are, however, interesting extensions to plain clausal propositional representations such as difference logic. A number of solvers have been developed for difference logic, in particular in the context of the satisfiability modulo theories (SMT) framework, and the goal of the paper is to study whether such engines could be harnessed to the computation of stable models for logic programs in an effective way. To this end, we provide succinct translations from logic programs to theories of difference logic and evaluate the potential of SMT solvers in the computation of stable models using these translations and a selection of benchmarks.
BunBunMovie: Scenario Visualizing System Based on 3-D Character
Authors: Tomoya Matsuo, Takashi Yoshino
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

There are many text-based contents, such as novels and script. Those contents have only scenario, and lack visual information. The purpose of this research is to provide visualizing environment that can visualize text-based contents easily. Moreover, such environment can also provide the opportunity to get pleasure out of scenario. It is necessary for visualizing scenario to make various motions of characters and to depict various situations. Therefore we propose motion assortment function to make various motions of characters. The function uses a Japanese dictionary and a thesaurus search. We also propose associated image display function that uses an image search to depict various situations. From the experiments about the motion assortment function, we show that the proposal method can assort some motions. From the experiments of subjective assessment, we found that some subjects inclined to use such easy visualizing environment.
Controversy Corner: A high stego-image quality steganographic scheme with reversibility and high payload using multiple embedding strategy
Authors: The Duc Kieu, Chin-Chen Chang
Venue: Journal of Systems and Software (2009)

Tian's method is a breakthrough reversible data embedding scheme with high embedding capacity measured by bits per pixel (bpp) and good visual quality measured by peak signal-to-noise ratio (PSNR). However, the embedding capacity and visual quality of this method can be significantly improved. Thus, we propose a simple reversible steganographic scheme in spatial domain for digital images by using the multiple embedding strategy. The proposed method horizontally and vertically embeds one secret bit into one cover pixel pair. The experimental results show that the proposed reversible steganographic method achieves good visual quality and high embedding capacity. Specifically, with the one-layer embedding, the proposed method can obtain the embedding capacity of more than 0.5 bpp and the PSNR value greater than 54dB for all test images. Especially, with the five-layer embedding, the proposed method has the embedding capacity of more than 2bpp and the PSNR value higher than 52dB for all test images. Therefore, the proposed method surpasses many existing reversible data embedding methods in terms of visual quality and embedding capacity.
Unscented message passing for arbitrary continuous variables in Bayesian networks
Authors: Wei Sun, Kuo-Chu Chang
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Since Bayesian network (BN) was introduced in the field of artificial intelligence in 1980s, a number of inference algorithms have been developed for probabilistic reasoning. However, when continuous variables are present in Bayesian networks, their dependence relationships could be nonlinear and their probability distributions could be arbitrary. So far no efficient inference algorithm could deal with this case except Monte Carlo simulation methods such as Likelihood Weighting. But with unlikely evidence, simulation methods could be very slow to converge. In this paper, we propose an efficient approximate inference algorithm called Unscented Message Passing (UMP-BN) for Bayesian networks with arbitrary continuous variables. UMP-BN combines unscented transformation - a deterministic sampling method, and Pearl's message passing algorithm to provide the estimates of the first two moments of the posterior distributions. We test this algorithm with several networks including the ones with nonlinear and/or non-Gaussian variables. The numerical experiments show that UMP-BN converges very fast and produces promising results.
Coordinating hundreds of cooperative, autonomous vehicles in warehouses
Authors: Peter R. Wurman, Raffaello D'Andrea, Mick Mountz
Venue: Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2 (2007)

The Kiva warehouse management system creates a new paradigm for pick-pack-and-ship warehouses that significantly improves worker productivity. The Kiva system uses movable storage shelves that can be lifted by small, autonomous robots. By bringing the product to the worker, productivity is increased by a factor of two or more, while simultaneously improving accountability and flexibility. A Kiva installation for a large distribution center may require 500 or more vehicles. As such, the Kiva system represents the first commercially available, large-scale autonomous robot system. The first permanent installation of a Kiva system was deployed in the summer of 2006.
On the Tradeoff between MAC-Layer and Network-Layer Topology-Controlled Malware Spreading Schemes in Ad Hoc and Sensor Networks
Authors: Vasileios Karyotis, Anastasios Kakalis, Symeon Papavassiliou
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Significant interest has been raised recently in wireless networks in modeling and dealing effectively with different types of attacks. In this paper, emphasis is placed on the attacker's perspective and based on a probabilistic framework we study intelligent strategies for spreading malicious software, in order to realize the potentials of such attacks. The considered attack schemes are based on the topology control capabilities of wireless nodes and may be realized either at the Network layer by using node degree related information or the MAC layer by setting attackers to sleep for energy conservation purposes. To the best of our knowledge this is the first attempt to adopt the use of sleeping schedules in order to eventually increase attack efficiency. We compare the performance of the two families of strategies using both time-independent and time-dependent attack metrics. Our evaluation analysis reveals an inherent tradeoff between the two families that depends, among others, on the idle energy consumption and the network density.
Vision-based Human-Computer Interaction Utilized in the Robot Control
Authors: Liu Zheng, Liu Yuliang, Bing Zhigang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Human-Computer Interface (HCI) is very important to improve the efficiency of robot control to support the complex tasks. It is valuable to develop recognition techniques by which compute can be capable of handling human’s continuous gesture effectively. The present work seeks to model human motions in a manner for leaning and recognition. Toward this end,a novel HCI approach based on hidden Markov model(HMM) is proposed to model semantically meaningful human movements by a sequence of camera images. As a maximum likelihood recognizer, HMM is employed to learn each motion class. Finally, experimental results show the performance of the proposed approach with 1000 pictures.
Collaborative Intensity in Social Networks
Authors: Klaus Stein, Steffen Blaschke
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

Research on collaboration in social networks is largely restricted by a lack of longitudinal data. Approximations of collaborative intensity necessarily rely on the width of collaboration such as the number of papers coauthered by two scientists. In contrast, we discuss precise measures of collaborative intensity with respect to not only the width but also the depth of collaboration. Based on empirical data of four social networks, we compare a widely-used approximation with our own measures of collaborative intensity.We find that the quality of the approximation varies with the type of social networks.
Interactive Trouble Condition Sign Discovery for Hydroelectric Power Plants
Authors: Takashi Onoda, Norihiko Ito, Hironobu Yamasaki
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Kyushu Electric Power Co.,Inc. collects different sensor data and weather information (hereafter, operation data) to maintain the safety of hydroelectric power plants while the plants are running. It is very rare to occur trouble condition in the plants. And it is hard to construct an experimental power generation plant for collecting the trouble condition data. Because its cost is too high. In this situation, we have to find trouble condition sign. In this paper, we consider that the rise inclination of special unusual condition data gives trouble condition sign. And we propose a trouble condition sign discovery method for hydroelectric power plants by using a one class support vector machine and a normal support vector machine. This paper shows the proposed method is useful method as a method of risk management for hydroelectric power plants.
INFOrmation Dissemination (INFOD) middleware
Authors: Raghul Gunasekaran, Mallikarjun Shankar, Dieter Gawlick, Steve Fisher, Aravind Yalamanchi, Ronny Fehling, Hairong Qi
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

The increasing volume, diversity, and complexity of resources and data continues to raise challenges in the sharing and dissemination of information. Although publish-subscribe systems have improved the ability of users to exchange information, we argue that these systems have been either restrictive or simplistic - relying significantly on narrowly defined channels for data exchange. The Information Dissemination (INFOD) approach we present here introduces a flexible and dynamic framework for brokering information in publish-subscribe systems. INFOD enables communities of interest to themselves constitute and use vocabularies for describing their interests as well as their capabilities (available information). Publishers, consumers and subscribers are real-world entities characterized in terms of vocabularies and their interests as constraints within an INFOD registry. Subscribers define subscriptions primarily as XQuery constraints expressing events of interest at candidate publishers. Subscriptions also specify constraints on the run-time data that must be disseminated to specific consumers. Entity descriptions, property constraints, and subscriptions comprise the metadata information that INFOD uses to associate and link entities within a community. We refer to the process of associating entities in INFOD as mutual filtering, which we realize with a three-way join across publishers, consumers, and subscriber entities. We demonstrate and evaluate the INFOD approach in an emergency response use case scenario that employs INFOD to support changing event dynamics and varying publisher-consumer-subscriber requirements. We use industry standard technologies and present system performance results for the mutual filtering steps for a variety of subscription constraints and broad classes of publisher, subscriber, consumer property descriptions.
Proceedings of the Workshop on eLearning for Computational Linguistics and Computational Linguistics for eLearning
Authors: Lothar Lemnitzer, Detmar Meurers, Erhard Hinrichs
Venue: ACL Workshops (2004)

The idea of this workshop arose on the occasion of an international workshop on eLearning and Computational Linguistics, organized by the MiLCA project and held in Blaubeuren in November 2003 (in the MiLCA project - Medienintensive Lehrmodule in der Computerlinguistik-Ausbildung, cf. http://milca.sfs.unituebingen. de -, five German partners are developing core modules for a CL curriculum as web based trainings or virtual courses.). It, therefore, seemed fitting and timely to identify this topic as one of the leading themes of the workshop. The COLING 2004 conference appeared to the participants as a good opportunity for such an event. We are very grateful to the COLING organizers to have given us the opportunity to conduct a workshop with the title eLearning for Computational Linguistics and Computational Linguistics for eLearning. This title reflects the two main topics that the participants of the MiLCA workshop had identified as the two leading themes to be addressed.
Proceedings of the 12th European Workshop on Natural Language Generation
Venue: ACL Workshops (2009)

We are pleased to present the Proceedings of the 12th European Workshop on Natural Language Generation (ENLG 2009). ENLG 2009 was held in Athens, Greece, as a workshop at the 12th Conference of the European Chapter of the Association for Computational Linguistics (EACL 2009). It was endorsed by the ACL Special Interest Group on Generation (SIGGEN). The ENLG 2009 workshop continued a biennial series of workshops on natural language generation that has been running since 1987. Previous European workshops have been held at Royaumont, Edinburgh, Judenstein, Pisa, Leiden, Duisburg, Toulouse, Budapest, Aberdeen and Dagstuhl. The series provides a regular forum for presentation of research in this area, both for NLG specialists and for researchers from other areas, and together with INLG (the International Conference on Natural Language Generation) with which it alternates, ENLG is the main forum for NLG research.
Statistical estimation in varying coefficient models with surrogate data and validation sampling
Authors: Qihua Wang, Riquan Zhang
Venue: Journal of Multivariate Analysis (2009)

Varying coefficient error-in-covariables models are considered with surrogate data and validation sampling. Without specifying any error structure equation, two estimators for the coefficient function vector are suggested by using the local linear kernel smoothing technique. The proposed estimators are proved to be asymptotically normal. A bootstrap procedure is suggested to estimate the asymptotic variances. The data-driven bandwidth selection method is discussed. A simulation study is conducted to evaluate the proposed estimating methods.
Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence
Authors: Stéphane Roux
Venue: Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics (2009)

In a game from game theory, a Nash equilibrium (NE) is a combination of one strategy per agent such that no agent can increase its payoff by unilaterally changing its strategy. Kuhn proved that all (tree-like) sequential games have NE. Osborne and Rubinstein abstracted over these games and Kuhn's result: they proved a sufficient condition on agents' preferences for all games to have NE. This paper proves a necessary and sufficient condition, thus accounting for the game-theoretic frameworks that were left aside. The proof is formalised using Coq, and contrary to usual game theory it adopts an inductive approach to trees for definitions and proofs. By rephrasing a few game-theoretic concepts, by ignoring useless ones, and by characterising the proof-theoretic strength of Kuhn's/Osborne and Rubinstein's development, this paper also clarifies sequential game theory. The introduction sketches these clarifications, while the rest of the paper details the formalisation.
Perspectives for Web Service Intermediaries: How Influence on Quality Makes the Difference
Authors: Ulrich Scholten, Robin Fischer, Christian Zirpins
Venue: Proceedings of the 10th International Conference on E-Commerce and Web Technologies (2009)

In the service-oriented computing paradigm and the Web service architecture, the broker role is a key facilitator to leverage technical capabilities of loose coupling to achieve organizational capabilities of dynamic customer-provider-relationships. In practice, this role has quickly evolved into a variety of intermediary concepts that refine and extend the basic functionality of service brokerage with respect to various forms of added value like platform or market mechanisms. While this has initially led to a rich variety of Web service intermediaries, many of these are now going through a phase of stagnation or even decline in customer acceptance. In this paper we present a comparative study on insufficient service quality that is arguably one of the key reasons for this phenomenon. In search of a differentiation with respect to quality monitoring and management patterns, we categorize intermediaries into Infomediaries, e-Hubs, e-Markets and Integrators. A mapping of quality factors and control mechanisms to these categories depicts their respective strengths and weaknesses. The results show that Integrators have the highest overall performance, followed by e-Markets, e-Hubs and lastly Infomediaries. A comparative market survey confirms the conceptual findings.
Long-Term Animal Observation by Wireless Sensor Networks with Sound Recognition
Authors: Ning-Han Liu, Chen-An Wu, Shu-Ju Hsieh
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Due to wireless sensor networks can transmit data wirelessly and can be disposed easily, they are used in the wild to monitor the change of environment. However, the lifetime of sensor is limited by the battery, especially when the monitored data type is audio, the lifetime is very short due to a huge amount of data transmission. By intuition, sensor mote analyzes the sensed data and decides not to deliver them to server that can reduce the expense of energy. Nevertheless, the ability of sensor mote is not powerful enough to work on complicated methods. Therefore, it is an urgent issue to design a method to keep analyzing speed and accuracy under the restricted memory and processor. This research proposed an embedded audio processing module in the sensor mote to extract and analyze audio features in advance. Then, through the estimation of likelihood of observed animal sound by the frequencies distribution, only the interesting audio data are sent back to server. The prototype of WSN system is built and examined in the wild to observe frogs. According to the results of experiments, the energy consumed by sensors through our method can be reduced effectively to prolong the observing time of animal detecting sensors.
Component-Trees and Multi-value Images: A Comparative Study
Authors: Benoît Naegel, Nicolas Passat
Venue: Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing (2009)

In this article, we discuss the way to derive connected operators based on the component-tree concept and devoted to multi-value images. In order to do so, we first extend the grey-level definition of the component-tree to the multi-value case. Then, we compare some possible strategies for colour image processing based on component-trees in two application fields: colour image filtering and colour document binarisation.
Detection Probability Analysis of Cooperative Spectrum Sensing in Rayleigh Fading Channels
Authors: Jia Zhu, Baoyu Zheng
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

In this paper, two novel cooperative spectrum sensing schemes based on the AF (Amplify and Forward) and the DF (Decode and Forward) protocols are proposed to achieve the spatial diversity gains for cognitive radio networks, which are referred to as the AF-CSS (AF-based Cooperative Spectrum Sensing) and the DF-CSS (DF-based Cooperative Spectrum Sensing), respectively. Closed-form expressions of overall detection probability for the non-cooperative spectrum sensing, the AF-CSS and the DF-CSS schemes are derived over Rayleigh fading channels to show the effect of user cooperation on the detection performance. Besides, numerical experiments are conducted to verify the effectiveness of the proposed cooperative schemes, which shows the increase of detection probability by user cooperation for cognitive radio networks, further confirming the advantage of the AF-CSS and the DF- CSS schemes over the traditional non-cooperative spectrum sensing.
Orthogonal Matrices and Paraunitary Multifilter Banks
Authors: Hongying Xiao
Venue: Proceedings of the 2009 Second International Conference on Intelligent Computation Technology and Automation - Volume 04 (2009)

This paper focuses on the properties of real orthogonal matrices and the applications to the construction of paraunitary multifilter banks. Firstly, formulas of multiple multiplications of real orthogonal matrices as well as some interesting applications are given. Secondly, the above results are applied to give an easy approach to compute a class of paraunitary multifilter banks. In the end, some numerical examples are developed to illustrate the proposed technique.