ppxscal/embedding_network huggingface dataset:
Creating a Corpus of Targeted Learning Resources with a Web-Based Open Authoring Tool
Authors: Turadg Aleahmad, Vincent Aleven, Robert Kraut
Venue: IEEE Transactions on Learning Technologies (2009)

Personalizing learning to students&#x2019; traits and interests requires diverse learning content. Previous studies have demonstrated the value of such materials in learning but a challenge remains in creating a corpus of content large enough to meet students&#x2019; varied interests and abilities. We present and evaluate a prototype web-based tool for open authoring of learning materials. We conducted a study (an open web experiment) to evaluate whether specific student profiles presented in the tool&#x2019;s interface increase the diversity of the contributions, and whether authors tailor their contributions to the features in the profiles. We report on the quality of materials produced, authors&#x2019; facility in rating them, effects of author traits, and impact of the tailoring feature. Participants were professional teachers (math and non-math) and amateurs. Participants were randomly assigned to the tailoring tool or a simplified version without the tailoring feature. We find that while there are differences by teaching status, all three groups make contributions of worth. The tailoring feature leads contributors to tailor materials with greater potential to engage students. The experiment suggests that an open access web-based tool is a feasible technology for developing a large corpus of materials for personalized learning.
Voice Processors Based on the Human Hearing System
Authors: Lloyd Watts, Dana Massie, Allen Sansano, Jim Huey
Venue: IEEE Micro (2009)

A voice processor is a dedicated audio signal-processing chip for mobile phones and personal computers that enables high-performance noise reduction and acoustic echo cancellation for highly noisy environments. The algorithms and hardware underlying these chips' performance are based on the sophisticated operation of the human hearing system.
Language engineering techniques for the development of e-learning applications
Authors: Iván Martínez-Ortiz, José-Luis Sierra, Baltasar Fernández-Manjón, Alfredo Fernández-Valmayor
Venue: Journal of Network and Computer Applications (2009)

In this paper we propose the use of language engineering techniques to improve and systematize the development of e-learning applications. E-learning specifications usually rely on domain-specific languages that describe different aspects of such final e-learning applications. This fact makes it natural to adopt well-established language engineering principles during the construction of these applications. These principles promote the specification of the structure and the runtime behavior of the domain-specific languages as the central part of the development process. This specification can be used to drive different activities: rapid prototyping, provision of authoring notations and tools, automatic model checking of properties, importation/exportation from/to standards, and deployment of running applications. This language engineering concept also promotes active collaboration between instructors (the users of the languages) and developers (the designers and implementers) throughout the development process. In this paper we describe this language-driven approach to the construction of e-learning applications and we illustrate all its aspects using a learning flow sequencing language as a case study.
Accurate Interprocedural Null-Dereference Analysis for Java
Authors: Mangala Gowri Nanda, Saurabh Sinha
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

Null dereference is a commonly occurring defect in Java programs, and many static-analysis tools identify such defects. However, most of the existing tools perform a limited interprocedural analysis. In this paper, we present an interprocedural path-sensitive and context-sensitive analysis for identifying null dereferences. Starting at a dereference statement, our approach performs a backward demand-driven analysis to identify precisely paths along which null values may flow to the dereference. The demand-driven analysis avoids an exhaustive program exploration, which lets it scale to large programs. We present the results of empirical studies conducted using large open-source and commercial products. Our results show that: (1) our approach detects fewer false positives, and significantly more interprocedural true positives, than other commonly used tools; (2) the analysis scales to large subjects; and (3) the identified defects are often deleted in subsequent releases, which indicates that the reported defects are important.
Automatic Conversion from Specifications in Japanese into Class Diagrams in UML
Authors: Ryuichi Saita, Chiaki Kubomura, Hiroyuki Kameda
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

This paper describes some automatic conversion methods and a system which converts Japanese specifications to UML class diagrams. The characteristics and limitation of the methods was also discussed in terms of two experiments with use of specifications in some UML textbooks. The results of evaluation experiments showed the fundamental validity of the methods and system.
Learning from Data Streams: Synopsis and Change Detection
Authors: Raquel Sebastião, João Gama, Teresa Mendonça
Venue: Proceeding of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium (2008)

The aim of this PhD program is the study of algorithms for learning histograms, with the capacity of representing continuous high-speed flows of data and dealing with the current problem of change detection on data streams. In many modern applications, information is no longer gathered as finite stored data sets, but assuming the form of infinite data streams. As a large volume of information is produced at a high-speed rate it is no longer possible to use memory algorithms which require the full historic data stored in the main memory, so new ones are needed to process data online at the rate it is available. Moreover, the process generating data is not strictly stationary and evolves over time; so algorithms should, while extracting some sort of knowledge from this incessantly growing data, be able to adapt themselves to changes, maintaining a representation consistent with the most recent status of nature. In this work, we presented a feasible approach, using incremental histograms and monitoring data distributions, to detect concept drift in data stream context.
Glottal Source biometrical signature for voice pathology detection
Authors: Pedro Gómez-Vilda, Roberto Fernández-Baillo, Victoria Rodellar-Biarge, Víctor Nieto Lluis, Agustín Álvarez-Marquina, Luis Miguel Mazaira-Fernández, Rafael Martínez-Olalla, Juan Ignacio Godino-Llorente
Venue: Speech Communication (2009)

The Glottal Source is an important component of voice as it can be considered as the excitation signal to the voice apparatus. The use of the Glottal Source for pathology detection or the biometric characterization of the speaker are important objectives in the acoustic study of the voice nowadays. Through the present work a biometric signature based on the speaker's power spectral density of the Glottal Source is presented. It may be shown that this spectral density is related to the vocal fold cover biomechanics, and from literature it is well-known that certain speaker's features as gender, age or pathologic condition leave changes in it. The paper describes the methodology to estimate the biometric signature from the power spectral density of the mucosal wave correlate, which after normalization can be used in pathology detection experiments. Linear Discriminant Analysis is used to confront the detection capability of the parameters defined on this glottal signature among themselves and compared to classical perturbation parameters. A database of 100 normal and 100 pathologic subjects equally balanced in gender and age is used to derive the best parameter cocktails for pathology detection and quantification purposes to validate this methodology in voice evaluation tests. In a study case presented to illustrate the detection capability of the methodology exposed a control subset of 24+24 subjects is used to determine a subject's voice condition in a pre- and post-surgical evaluation. Possible applications of the study can be found in pathology detection and grading and in rehabilitation assessment after treatment.
Process of applying data mining techniques to XML data
Authors: Richi Nayak
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

XML has gained popularity for information representation, exchange and retrieval. As the XML material becomes more abundant, the ability to gain knowledge from XML sources decreases due to their heterogeneity and structural irregularity. The use of data mining techniques becomes essential to improve XML document handling. This paper discusses the capabilities and the process of applying data mining techniques in XML sources.
Building a Conceptual Skeleton for Enterprise Architecture Specifications
Authors: Veikko Halttunen, Antti Lehtinen, Riku Nykänen
Venue: Proceeding of the 2006 conference on Information Modelling and Knowledge Bases XVII (2006)

This paper describes a way to build a conceptual model for diversified purposes of modelling Enterprise Architectures (EA). It is commonly known that, due to the complexity, Enterprise Architectures need to be considered from several viewpoints. This provokes an integration problem: how to ensure that parallel EA models are consistent. We believe that the best way to solve this problem is to build a generic conceptual model (or an ontology) that is based on the purpose and needs of EA modelling rather than on the metamodels or modelling techniques of the prevailing (viewpoint-specific) domains of EA modelling. In other words, instead of aggregating existing sub-domains of EA we should try to find the core concepts through analyzing the EA domain as a whole. We emphasize the importance of the process through which the conceptual model is produced. Therefore, besides the conceptual skeleton and its utilization we provide an in-depth description of the modelling process we have developed and applied.
Note: Characterizations of competition multigraphs
Authors: Yoshio Sano
Venue: Discrete Applied Mathematics (2009)

The notion of a competition multigraph was introduced by C. A. Anderson, K. F. Jones, J. R. Lundgren, and T. A. McKee [C. A. Anderson, K. F. Jones, J. R. Lundgren, and T. A. McKee: Competition multigraphs and the multicompetition number, Ars Combinatoria 29B (1990) 185-192] as a generalization of the competition graphs of digraphs. In this note, we give a characterization of competition multigraphs of arbitrary digraphs and a characterization of competition multigraphs of loopless digraphs. Moreover, we characterize multigraphs whose multicompetition numbers are at most m, where m is a given nonnegative integer and give characterizations of competition multihypergraphs.
Evaluating automation strategies in language documentation
Authors: Alexis Palmer, Taesun Moon, Jason Baldridge
Venue: Proceedings of the NAACL HLT 2009 Workshop on Active Learning for Natural Language Processing (2009)

This paper presents pilot work integrating machine labeling and active learning with human annotation of data for the language documentation task of creating interlinearized gloss text (IGT) for the Mayan language Uspanteko. The practical goal is to produce a totally annotated corpus that is as accurate as possible given limited time for manual annotation. We describe ongoing pilot studies which examine the influence of three main factors on reducing the time spent to annotate IGT: suggestions from a machine labeler, sample selection methods, and annotator expertise.
Foundation ActionScript 3.0 Image Effects, 1st edition
Authors: Todd Yard
Venue:  (2009)

Foundation ActionScript 3.0 Image Effects discusses the ins and outs of graphical manipulation through code of all the different elements available in a Flash project, from vectors to bitmaps to videos, from animated text effects to dynamic video filters. Flash 8 introduced a vast array of image features, such as blend modes and filters as well as ActionScript's powerful BitmapData object, and this book covers all those effects in their current CS4 form, as well as the new graphical options that are available, such as the Pixel Bender Toolkit. It also details the many possible effects that can be achieved and the associated practical applications, with a focus on strong OOP methodologies to make the code more modular and reusable across projects. Gives detailed information on all of the image manipulation abilities of Flash CS4 Covers complex technology, such as the Pixel Bender Toolkit There is no other book like it, covering the same topics in as much depth What you'll learn Practice image manipulation using modular, object-oriented techniques Includes a comprehensive library of image effects classes Explore the bitmap manipulation classes in depth Applicable to most if not all of the Flash "disciplines" Provides a multitude of practical examples, not just theory Learn the new Pixel Bender language Who is this book for? This book is a great resource for any reader with an intermediate to advanced knowledge of ActionScript developing Flash games, applications and interfaces, animations or Websites, as the effects detailed are applicable across multiple disciplines. If you understand the best practices OOP syntax and know how to manipulate a Flash movie beyond the basics, you will be able to pick up the book and apply its lessons in your own work, as it clearly points out how the effects discussed have practical applications for amateurs and professionals alike.
Soccer playing humanoid robots: Processing architecture, gait generation and vision system
Authors: Prahlad Vadakkepat, Ng Buck Sin, Dip Goswami, Rui Xiang Zhang, Li Yu Tan
Venue: Robotics and Autonomous Systems (2009)

Research on humanoid robotics in Mechatronics and Automation (MA) Laboratory, Electrical and Computer Engineering (ECE), National University of Singapore (NUS) was started at the beginning of this decade. Various research prototypes for humanoid robots have been designed and are going through evolution over these years. These humanoids have been successfully participating in various robotic soccer competitions. In this paper, three major research and development aspects of the above humanoid research are discussed. The paper focuses on various practical and theoretical considerations involved in processing architecture, gait generation and vision systems.
Minimum Variance Energy Allocation for a Solar-Powered Sensor System
Authors: Dong Kun Noh, Lili Wang, Yong Yang, Hieu Khac Le, Tarek Abdelzaher
Venue: Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems (2009)

Using solar power in wireless sensor networks (WSNs) requires adaptation to a highly varying energy supply. From an application's perspective, however, it is often preferred to operate at a constant quality level as opposed to changing application behavior frequently. Reconciling the varying supply with the fixed demand requires good tools for predicting supply such that its average is computed and demand is fixed accordingly. In this paper, we describe a probabilistic observation-based model for harvested solar energy, which accounts for both long-term tendencies and temporary environmental conditions. Based on this model, we develop a time-slot-based energy allocation scheme to use the periodically harvested solar energy optimally, while minimizing the variance in energy allocation. Our algorithm is tested on both outdoor and indoor testbeds, demonstrating the efficacy of the approach.
GIS-based method for the environmental vulnerability assessment to volcanic ashfall at Etna Volcano
Authors: Silvia Rapicetta, Vittorio Zanon
Venue: Geoinformatica (2009)

The response of environment to ashfall was evaluated aiming at defining the vulnerability in the areas surrounding Mt. Etna volcano, Sicily. The two utilized scenarios assume different thickness of ashfall, over distances comparable with those covered by deposits from realistic eruptions that occurred recently on the volcano. The fall episodes are considered instantaneous or with a duration of 90 days. These models are in agreement with the actual and recent activity of the volcano. The evaluation of vulnerability was performed by a GIS-based method, accordingly with the different themes that constitute the Corine Land Cover inventory of the study area and discovering the potentially damaged elements following the two hypothesized scenarios.
Image segmentation using a multilayer level-set approach
Authors: Ginmo Chung, Luminita A. Vese
Venue: Computing and Visualization in Science (2009)

We propose an efficient multilayer segmentation method based on implicit curve evolution and on variational approach. The proposed formulation uses the minimal partition problem as formulated by D. Mumford and J. Shah, and can be seen as a more efficient extension of the segmentation models previously proposed in Chan and Vese (Scale-Space Theories in Computer Vision, Lecture Notes in Computer Science, Vol. 1682, pp. 141&#x2013;151, 1999, IEEE Trans Image Process 10(2):266&#x2013;277, 2001), and Vese and Chan (Int J Comput Vis 50(3):271&#x2013;293, 2002). The set of unknown discontinuities is represented implicitly by several nested level lines of the same function, as inspired from prior work on island dynamics for epitaxial growth (Caflisch et al. in Appl Math Lett 12(4):13, 1999; Chen et al. in J Comput Phys 167:475, 2001). We present the Euler&#x2013;Lagrange equations of the proposed minimizations together with theoretical results of energy decrease, existence of minimizers and approximations. We also discuss the choice of the curve regularization and conclude with several experimental results and comparisons for piecewise-constant segmentation of gray-level and color images.
Intelligent actor mobility in wireless sensor and actor networks
Authors: Randal T. Abler
Venue:  (2008)

Wireless sensor and actor networks are are used in situations where interaction is required between a network and the environment in which the network is deployed. This research studies the functioning of a single mobile actor deployed in a sparsely connected network. When deployed in a sparsely connected network, an actor has to do more than acting. It has to perform the additional duties of an event collector&mdash;collecting events from the naturally occurring clusters&mdash;so that it can fulfill its primary obligation as an actor. The path taken by a mobile actor node is generated by a mobility model. The existing random mobility models are non-intelligent mobility models. While they may bring about a chance meeting between an actor and an event, there is no guarantee that these meetings will actually happen. This motivates the development of intelligent mobility models for the actor node, which will generate paths that are reflective of the network in which the actor is deployed. In this thesis, intelligent mobility models for the actor node were developed using the inherent clustering information of a sparsely connected network. These models were applied to an actor node in networks of varying sparseness and the following conclusions were reached: (i) Existing random mobility models are unsuitable for an actor in a sparsely connected network. (ii) High probability of events can be detected when a sparsely connected network is used. (iii) 100% event detection by the actor node is possible at higher speeds. (iv) When the single actor functioned as both an event collector and an actor, the number of events acted upon by the actor was very close to the number of events acted upon by an actor in a fully connected network. (v) The Correlation Theory developed in this research suggests using a combination of the intelligent mobility models to obtain the best performance results under all circumstances. (vi) Early detection of events can be supported where it is required. All of the above conclusions justify the deployment of a single actor and a sparsely connected network, either individually or as a combination.
Self-organizing map approaches for the haplotype assembly problem
Authors: Ling-Yun Wu, Zhenping Li, Rui-Sheng Wang, Xiang-Sun Zhang, Luonan Chen
Venue: Mathematics and Computers in Simulation (2009)

Haplotype assembly is to reconstruct a pair of haplotypes from SNP values observed in a set of individual DNA fragments. In this paper, we focus on studying minimum error correction (MEC) model for the haplotype assembly problem and explore self-organizing map (SOM) methods for this problem. Specifically, haplotype assembly by MEC is formulated into an integer linear programming model. Since the MEC problem is NP-hard and thus cannot be solved exactly within acceptable running time for large-scale instances, we investigate the ability of classical SOMs to solve the haplotype assembly problem with MEC model. Then, aiming to overcome the limits of classical SOMs, a novel SOM approach is proposed for the problem. Extensive computational experiments on both synthesized and real datasets show that the new SOM-based algorithm can efficiently reconstruct haplotype pairs in a very high accuracy under realistic parameter settings. Comparison with previous methods also confirms the superior performance of the new SOM approach.
Robust and efficient algorithms for rank join evaluation
Authors: Jonathan Finger, Neoklis Polyzotis
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

In the rank join problem we are given a relational join R1 x R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highest score. This problem lies at the core of processing top-k SQL queries, and recent studies have introduced specialized operators that solve the rank join problem by accessing only a subset of the input tuples. A desirable property for such operators is instance-optimality, i.e., their I/O cost should remain within a factor of the optimal for different inputs. However, a recent theoretical study has shown that existing rank join operators are not instance-optimal even though they have been shown to perform well empirically. The same study proposed the PBRJRRoverFR operator that was proved to be instance-optimal, but its performance was not tested empirically and in fact it was hinted that its complexity can be high. Thus, the following important question is raised: Is it possible to design a rank join operator that is both instance-optimal and computationally efficient? In this paper we provide an answer to this challenging question. We perform an empirical study of PBRJRRoverFR and show that its computational cost can offset the benefits of instance-optimality. Using the insights gained by the study, we develop the novel FRPA operator that addresses the efficiency bottlenecks of PBRJRRoverFR. We prove that FRPA is instance-optimal in general and more specifically that it never performs more I/O than PBRJRRoverFR. FRPA is the first operator that possesses these properties and is thus of interest in the theoretical study of rank join operators. We further identify cases where the overhead of FRPA becomes significant, and propose the FRPA operator that automatically adapts its overhead to the characteristics of the input. An extensive experimental study validates the effectiveness of the new operators and demonstrates that they offer significant performance improvements (up to an order of magnitude) over the state-of-the-art.