ppxscal/embedding_network huggingface dataset:
How does students' motivation relate to peer-moderated online interactions?
Authors: Kui Xie, Fengfeng Ke
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Motivation has been recognized as a crucial factor that influences learning success. However, little research as addressed students' motivation in peer-moderated online interactions. This study conducted a content analysis of online discussions to discover how students' motivation relates with their interaction and knowledge construction in peer-moderated online discussions. The results indicate that intrinsic motivation was significantly correlated with students' elaboration processes and knowledge transfer. However, no significant correlation was observed between intrinsic motivation and students' moderation behaviors. The findings suggest that instructional designers and teachers in online classes should integrate strategies to promote students' motivation, and more importantly, they should scaffold student moderators to achieve meaningful learning in peer-moderated online discussions.
IRST-BP: web people search using name entities
Authors: Octavian Popescu, Bernardo Magnini
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

In this paper we describe a person clustering system for web pages and report the results we have obtained on the test set of the Semeval 2007 Web Person Search task. Deciding which particular person a name refers to within a text document depends mainly on the capacity to extract the relevant information out of texts when it is present. We consider "relevant" here to stand primarily for two properties: (1) uniqueness and (2) appropriateness. In order to address both (1) and (2) our method gives primary importance to Name Entities (NEs), defined according to the ACE specifications. The common nouns not referring to entities are considered further as coreference clues only if they are found within already coreferred documents.
How Well Do Random Walks Parallelize?
Authors: Klim Efremenko, Omer Reingold
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

A random walk on a graph is a process that explores the graph in a random way: at each step the walk is at a vertex of the graph, and at each step it moves to a uniformly selected neighbor of this vertex. Random walks are extremely useful in computer science and in other fields. A very natural problem that was recently raised by Alon, Avin, Koucky, Kozma, Lotker, and Tuttle (though it was implicit in several previous papers) is to analyze the behavior of k independent walks in comparison with the behavior of a single walk. In particular, Alon et al. showed that in various settings (e.g., for expander graphs), k random walks cover the graph (i.e., visit all its nodes), ¿(k)-times faster (in expectation) than a single walk. In other words, in such cases k random walks efficiently "parallelize" a single random walk. Alon et al. also demonstrated that, depending on the specific setting, this "speedup" can vary from logarithmic to exponential in k.In this paper we initiate a more systematic study of multiple random walks. We give lower and upper bounds both on the cover time and on the hitting time (the time it takes to hit one specific node) of multiple random walks. Our study revolves over three alternatives for the starting vertices of the random walks: the worst starting vertices (those who maximize the hitting/cover time), the best starting vertices, and starting vertices selected from the stationary distribution. Among our results, we show that the speedup when starting the walks at the worst vertices cannot be too large - the hitting time cannot improve by more than an O(k) factor and the cover time cannot improve by more than min {k logn,k 2} (where n is the number of vertices). These results should be contrasted with the fact that there was no previously known upper-bound on the speedup and that the speedup can even be exponential in k for random starting vertices. Some of these results were independently obtained by Elsässer and Sauerwald (ICALP 2009). We further show that for k that is not too large (as a function of various parameters of the graph), the speedup in cover time is O(k) even for walks that start from the best vertices (those that minimize the cover time). As a rather surprising corollary of our theorems, we obtain a new bound which relates the cover time C and the mixing time mix of a graph. Specifically, we show that (where m is the number of edges).
A Relational Encoding of a Conceptual Model with Multiple Temporal Dimensions
Authors: Donatella Gubiani, Angelo Montanari
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

The theoretical interest and the practical relevance of a systematic treatment of multiple temporal dimensions is widely recognized in the database and information system communities. Nevertheless, most relational databases have no temporal support at all. A few of them provide a limited support, in terms of temporal data types and predicates, constructors, and functions for the management of time values (borrowed from the SQL standard). One (resp., two) temporal dimensions are supported by historical and transaction-time (resp., bitemporal) databases only. In this paper, we provide a relational encoding of a conceptual model featuring four temporal dimensions, namely, the classical valid and transaction times, plus the event and availability times. We focus our attention on the distinctive technical features of the proposed temporal extension of the relation model. In the last part of the paper, we briefly show how to implement it in a standard DBMS.
Situated models of meaning for sports video retrieval
Authors: Michael Fleischman, Deb Roy
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

Situated models of meaning ground words in the non-linguistic context, or situation, to which they refer. Applying such models to sports video retrieval requires learning appropriate representations for complex events. We propose a method that uses data mining to discover temporal patterns in video, and pair these patterns with associated closed captioning text. This paired corpus is used to train a situated model of meaning that significantly improves video retrieval performance.
Accessing Audiotactile Images with HFVE Silooet
Authors: David Dewhurst
Venue: Proceedings of the 4th International Conference on Haptic and Audio Interaction Design (2009)

In this paper, recent developments of the HFVE vision-substitution system are described; and the initial results of a trial of the "Silooet" software are reported. The system uses audiotactile methods to present features of visual images to blind people. Included are details of presenting objects found in prepared media and live images; object-related layouts and moving effects (including symbolic paths); and minor enhancements that make the system more practical to use. Initial results are reported from a pilot study that tests the system with untrained users.
On Map Labeling with Leaders
Authors: Michael Kaufmann
Venue: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009)

We present an overview over recent work on map labeling with emphasis on labeling with leaders. The labels are assumed to be placed on the boundary of the map while they are connected to the corresponding graphical features by polygonal lines, the so-called leaders. On various models and methods we demonstrate an impressive example for an application where a whole range of algorithmic techniques have successfully been applied.
Learning with new technologies: Help seeking and information searching revisited
Authors: Minna Puustinen, Jean-François Rouet
Venue: Computers Education (2009)

Education researchers have amply documented the beneficial effects of help seeking on learning and understanding. Requesting help from teachers (or other human sources) when faced with a difficult task is now considered a self-regulated learning strategy. In a related domain, information search refers to learner-initiated efforts to obtain further task-related information from books or other non-human sources when undertaking an assignment. The integration of human and information-based resources in information and communication technology (ICT) tends to blur the distinction between help seeking and information searching, thus offering new perspectives on the study of the processes and skills involved in these activities. The aim of this paper is to redefine the boundaries between help seeking and information searching, by replacing the dichotomous definition (i.e., human versus non-human sources) by a more integrative theoretical framework. Beyond the obvious theoretical importance of the issue, clarifying the boundaries between seeking help and searching for information may contribute to the development of more effective forms of human and non-human support for technology-enhanced learning environments.
Progressional awareness: designing a co-authoring tool to support the planning process
Authors: Ilaria Liccardi, Hugh C. Davis, Su White
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

Effective planning is essential to any collaborative activity. However, in practice, the co-authoring process can become derailed from an initial plan of action due to unforeseen circumstances. To be effective, the process must be capable of adapting in ways that are efficient and avoid conflict. We analyze the experiences of users involved in fifteen separate group writing projects, specifically examining the role of planning within the collaborative process, the techniques used and the problems that may arise. From this, we propose the concept of progressional awareness related to the planning process, and propose novel user interface designs that may help to avoid common problems.
Multimodal Media Center Interface Based on Speech, Gestures and Haptic Feedback
Authors: Markku Turunen, Jaakko Hakulinen, Juho Hella, Juha-Pekka Rajaniemi, Aleksi Melto, Erno Mäkinen, Jussi Rantala, Tomi Heimonen, Tuuli Laivo, Hannu Soronen, Mervi Hansen, Pellervo Valkama, Toni Miettinen, Roope Raisamo
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

We present a multimodal media center interface based on speech input, gestures, and haptic feedback (hapticons). In addition, the application includes a zoomable context + focus GUI in tight combination with speech output. The resulting interface is designed for and evaluated with different user groups, including visually and physically impaired users. Finally, we present the key results from its user evaluation and public pilot studies.
Quantitative Analysis of the Relative Local Speech Rate
Authors: Jan Janda
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

This paper deals with the immediate relative speech rate analysis. It represents a design of the algorithm of its determination based on the dynamic time warping (DTW) method. It also shows a practical application of the relative speech rate determination in the case of some pathological discourses. From the point of view of the speech rate there are examined the discourses of the Parkinson's disease's patients, persons suffering from stammering and patients after cochlear implantation. 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
The Soil Temperature Restoration Characteristic of Hybrid Ground Source Heat Pump in the Intermittent Performance Condition
Authors: Jinggang Wang, Meixia Du, Jin Zhao, Yuxia Chi
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

The soil temperature restoration characteristic has an important effect on ground source heat pump. The cooling tower would be used to reduce the soil temperature at night when the heat pump unit was shut down of a hybrid ground source heat pump. The ground soil temperature restoration information had been measured for 10 days, and the results were analyzed.
Using Diversity as an Additional-objective in Dynamic Multi-objective Optimization Algorithms
Authors: Hao Chen, Ming Li, Xi Chen
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

This paper investigates the use of additional-objective for solving multi-objective optimization problems in dynamic environment. A number of authors proposed the use of additional-objective for maintaining diversity in static single-objective optimization task; in this paper the work is extended to dealing with the dynamic multi-objective optimization problems. Individual diversity is used as an additional-objective, and a new efficient multi-objective optimization algorithm is proposed. Experimental results clearly indicate that the performance of the proposed algorithm is gratifying.
Predicting Query Performance by Query-Drift Estimation
Authors: Anna Shtok, Oren Kurland, David Carmel
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

Predicting query performance, that is, the effectiveness of a search performed in response to a query, is a highly important and challenging problem. Our novel approach to addressing this challenge is based on estimating the potential amount of query drift in the result list, i.e., the presence (and dominance) of aspects or topics not related to the query in top-retrieved documents. We argue that query-drift can potentially be estimated by measuring the diversity (e.g., standard deviation) of the retrieval scores of these documents. Empirical evaluation demonstrates the prediction effectiveness of our approach for several retrieval models. Specifically, the prediction success is better, over most tested TREC corpora, than that of state-of-the-art prediction methods.
Convergence of Numerical Solutions to Stochastic Age-Structured Population System
Authors: Huai-zhu Wang, Yuan-shi Zheng, Qi-min Zhang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

In this paper,we study the stochastic age-structured population system, which the fertility and mortality rate are influenced by population. In genaral, most of stochastic age-structured population system do not have explicit solutions, thus numerical approximation schemes are invaluable tools for exploring their properties. The main purpose of this paper is to develop a numerical scheme and show the convergence of numerical approximation solution to the ture solution.
Static Analysis of Malware to Detect Exception Return
Authors: Zhang Yichi, Pang Jianmin, Bai Lili, Fu Wen
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Malware is rapidly becoming a major security issue. In order to avoid being analyzed statically, malwares resort to various obfuscation techniques to hide their malicious behaviors. The technique based on the exception return of subroutine is one of the techniques. Currently disassemblers couldn't deal with malware which uses this technique. This paper presents a static disassembly algorithm base on virtual stack for handling malware with exception return. The result of the test proves that the algorithm is effective.
Study on Dynamical Characteristics of Spindle System of CNC Machine Based on Experimental Mode Analysis
Authors: Licheng Yang, Jingxiang Hu, Caijie Wei, Liwei Ning
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

For CNC machine of certain type, its vibration modes are quite denseness because the machine tool belongs to a large and complex structure. In order to obtain dynamical characteristics of the spindle system in typical cutting condition, the testing scheme of pseudo random relative excitation and measure system are used in the paper. The theoretical model of precise CNC machine is discussed about relative excitation experiment. The paper gives the fixing position of the exciter and the responses of 70 dots precisely. The experiment provides all grade modes and charts that reflect the dynamical characteristics of the spindle system of the CNC machine. According to the analysis of the results, the corresponding modification suggests for the structure is provided, which supplies an approach for later experiments and is useful for practical design and the optimization of parameters of the spindle system. Furthermore, the results of the experiment are of greatly instructional significance for the improvement of mechanical characteristics.
Fleet: An Effective System for Publish/Subscribe Service over P2P Networks
Authors: Chyouhwa Chen, Chia-Liang Tsai, Kun-Cheng Tsai
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

We propose a new Publish/Subscribe system, called Fleet, that seamlessly combines a novel subscription mapping scheme and a structured overlay network address space partitioning technique to build an effective content-based publish/subscribe (pub/sub) system over a distributed hash table (DHT) overlay. Fleet employs an explicit mechanism to deal with skewed popularity distributions in subscriptions and events, which spreads the load generated by hot attributes across a multitude of peers. The address space partitioning event delivery mechanism expedites event delivery. Fleet strikes an ideal balance between subscription storage cost and event delivery cost, and is more scalable in the number of events, subscriptions, schema attributes, and number of system nodes.
Algorithms on Subtree Filament Graphs
Authors: Fanica Gavril
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

We describe polynomial time algorithms to find in subtree filament graphs a minimum dominating hole, a clique intersecting all its maximum independent sets and a maximum induced split subgraph.
A Back-Propagation Training Method for Multilayer Pulsed Neural Networks Using Principle of Duality
Authors: Kaname Iwasa, Mauricio Kugler, Susumu Kuroyanagi, Akira Iwata
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Pulsed Neuron (PN) model was proposed as one of the simplest models working by pulse trains. PN model has a membrane potential to deal with the temporal information, and the calculation process is inexpensive. However, as the output function of PN model is an Unit Step function, PN model cannot directly use the back-propagation (BP) method. It would be possible to solve general pattern recognition problems if the PN model could be trained by the BP method. In this paper, we propose a BP method for multilayer pulsed neural networks. The proposed method uses the duality of PN model, in which the desired output of hidden layer neuron is calculated from output layer neurons' weights and output. Experimental results show that the multilayer pulsed neural networks can learn and recognize non-linear problems using the proposed method.
Application of the Cross-Entropy Method to Dual Lagrange Support Vector Machine
Authors: Budi Santosa
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

In this paper, cross entropy method is used for solving dual Lagrange support vector machine (SVM). Cross entropy (CE) method is a new practical approach which is widely used in some applications such as combinatorial optimization, learning algorithm and simulation. Our approach refers to Kernel Adatron which is solving dual Lagrange SVM using gradient ascent method. Hereby, the cross entropy method is applied to solve dual Lagrange SVM optimization problem to find the optimal or at least near optimal Lagrange multipliers as a solution. As known, the standard SVM with quadratic programming solver suffers from high computational time. Some real world datasets are used to test the algorithms and compare to the existing approach in terms of computation time and accuracy. Our approach is fast and produce good results in terms of generalization error.
Taxonomy for characterizing ensemble methods in classification tasks: A review and annotated bibliography
Authors: Lior Rokach
Venue: Computational Statistics Data Analysis (2009)

Ensemble methodology, which builds a classification model by integrating multiple classifiers, can be used for improving prediction performance. Researchers from various disciplines such as statistics, pattern recognition, and machine learning have seriously explored the use of ensemble methodology. This paper presents an updated survey of ensemble methods in classification tasks, while introducing a new taxonomy for characterizing them. The new taxonomy, presented from the algorithm designer's point of view, is based on five dimensions: inducer, combiner, diversity, size, and members' dependency. We also propose several selection criteria, presented from the practitioner's point of view, for choosing the most suitable ensemble method.
Broadband health care network in Brazil and Peru
Authors: Despoina Rizou, Ilias Sachpazidis, Peter Selby
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

This paper will present a medical network in Latin America. This network will provide in rural and isolated areas an appropriate health care from distance. The medical applications will vary from gynaecology, paediatrics, cardiology to typical infectious diseases for the region such as malaria and tuberculosis. The examinations will involve ultrasound examinations, electrocardiogram and blood imaging when applicable. Our medical tele-consulting tool will be used for that purpose. The medical network aims to connect isolated areas in Amazon over European satellite technology providing broadband communication and quality of services (QoS) for real-time data transmission and video/audio conference.
Synchronization of Discrete-Time Chaotic Systems Based on Takagi-Sugeno Fuzzy Model
Authors: Yong-ai Zheng, Yi-bei Nian, Fei Sun
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

This paper proposes a new fuzzy control scheme for synchronization of discrete-time chaotic systems based on Takagi-Sugeno (T-S) fuzzy model and parallel distributed compensation (PDC). Some simple but generic criteria for synchronization of discrete-time chaotic systems are derived. The proposed scheme offers systematic design method for synchronization of discrete-time chaotic/hyperbolic systems, which implies much complicated high-order chaotic systems can be used to improve the security in chaos communications. The technique has been successfully applied to 3D generalized Hénon map. Numerical simulations verify the effectiveness and feasibility of the proposed method.