ppxscal/embedding_network huggingface dataset:
Evaluating ACED: The Impact of Feedback and Adaptivity on Learning
Authors: Valerie J. Shute, Eric G. Hansen, Russell G. Almond
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

This paper reports on the evaluation of a program named ACED (Adaptive Content with Evidence-based Diagnosis)---an assessment for learning system using Algebra I content related to the topic of geometric sequences. We used an evidence-centered design (ECD) approach [1] to create the system which includes three main models: proficiency, evidence, and task. Our goals of this study were to determine the learning benefit of the key design elements of adaptivity and formative feedback. Results from an experiment testing 268 heterogeneous students generally show that the system: (a) significantly improves learning, and (b) is a reliable and valid assessment tool. More specifically, the system's formative feedback feature significantly enhanced student learning, but did not detract from the accuracy of the assessment.
Good learners for evil teachers
Authors: Ofer Dekel, Ohad Shamir
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We consider a supervised machine learning scenario where labels are provided by a heterogeneous set of teachers, some of which are mediocre, incompetent, or perhaps even malicious. We present an algorithm, built on the SVM framework, that explicitly attempts to cope with low-quality and malicious teachers by decreasing their influence on the learning process. Our algorithm does not receive any prior information on the teachers, nor does it resort to repeated labeling (where each example is labeled by multiple teachers). We provide a theoretical analysis of our algorithm and demonstrate its merits empirically. Finally, we present a second algorithm with promising empirical results but without a formal analysis.
Do 'Dominant Frequencies' explain the listener's response to formant and spectrum shape variations?
Authors: Björn Lindblom, Randy Diehl, Carl Creeger
Venue: Speech Communication (2009)

Psychoacoustic experimentation shows that formant frequency shifts can give rise to more significant changes in phonetic vowel timber than differences in overall level, bandwidth, spectral tilt, and formant amplitudes. Carlson and Granstrom's perceptual and computational findings suggest that, in addition to spectral representations, the human ear uses temporal information on formant periodicities ('Dominant Frequencies') in building vowel timber percepts. The availability of such temporal coding in the cat's auditory nerve fibers has been demonstrated in numerous physiological investigations undertaken during recent decades. In this paper we explore, and provide further support for, the Dominant Frequency hypothesis using KONVERT, a computational auditory model. KONVERT provides auditory excitation patterns for vowels by performing a critical-band analysis. It simulates phase locking in auditory neurons and outputs DF histograms. The modeling supports the assumption that listeners judge phonetic distance among vowels on the basis formant frequency differences as determined primarily by a time-based analysis. However, when instructed to judge psychophysical distance among vowels, they can also use spectral differences such as formant bandwidth, formant amplitudes and spectral tilt. Although there has been considerable debate among psychoacousticians about the functional role of phase locking in monaural hearing, the present research suggests that detailed temporal information may nonetheless play a significant role in speech perception.
Magic Lantern Guides: Nikon D90
Authors: Simon Stafford
Venue:  (2009)

- The first DSLR with high definition movie capability demands new skills and techniques, and this is the only guide that can help the advanced amateur master them- Written by best-selling author and Nikon technical expert Simon Stafford
Development of wireless body area network based on J2ME for m-health applications
Authors: M. J. Morón, J. R. Luque, A. A. Botella, E. J. Cuberos, E. Gallardo, E. Casilari, A. Díaz-Estrella, J. A. Gázquez
Venue: Proceedings of the 2nd conference on European computing conference (2008)

This paper presents a prototype of a medical Bluetooth Body Area Network (BAN). The central node in the BAN was developed using Smartphones (mobile phones offering advanced capabilities) and Java 2 Micro Edition (J2ME). The utilization of smartphones can take advantage of the user familiarity with cellular devices. The J2ME implementation for monitoring applications is also advantageous since its portability is greater than any application developed with another programming language (e.g.: C++) over Symbian. In the architecture, a Java midlet in the smartphone receives information about patient's location and health status. The midlet encrypts and transmits the data to a server through 802.11 or GPRS/UMTS. In case of detecting a medical alert, the midlet sends a MMS and a SMS. Additionally, the system enables the remote configuration of the BAN from a PC or even a smartphone. In order to study the scalability of this type of telemedicine networks a software for sensor emulation has been incorporated to the architecture. The emulator is prepared to retrieve and transmit realistic signals from a medical Internet data base.
Region-Based vs. Edge-Based Registration for 3D Motion Capture by Real Time Monoscopic Vision
Authors: David Antonio Jáuregui, Patrick Horain
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

3D human motion capture by real-time monocular vision without using markers can be achieved by registering a 3D articulated model on a video. Registration consists in iteratively optimizing the match between primitives extracted from the model and the images with respect to the model position and joint angles. We extend a previous color-based registration algorithm with a more precise edge-based registration step. We present an experimental analysis of the residual error vs. the computation time and we discuss the balance between both approaches.
The How? When? and What? for the Process of Re-planning for Product Releases
Authors: Anas Jadallah, Ahmed Al-Emran, Mahmoud Moussavi, Guenther Ruhe
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

Volatility of features and dynamic change in stakeholders' needs often requires re-planning of an existing release plan to accommodate changes. H2W is a re-planning method that answers the questions of how, when, and what to re-plan of an existing product release strategy. For HOW, a greedy heuristic based on prioritization of candidate features is applied. A value-based re-planning approach is proposed for the WHEN question. For WHAT, a trade-off analysis between the degree of change related to the originally announced release plan and the improvement achievable by replacing existing features with more attractive ones is suggested. At each of the re-planning iterations, H2W either provides a new improved plan or states that an improvement does not exist. As a proof-of-concept, a case study is conducted.
Doubly perturbed neutral stochastic functional equations
Authors: Lanying Hu, Yong Ren
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, we prove the existence and uniqueness of the solution to a class of doubly perturbed neutral stochastic functional equations (DPNSFEs in short) under some non-Lipschitz conditions. The solution is constructed by successive approximation. Furthermore, we give the continuous dependence of the solution on the initial value by means of the corollary of Bihari inequality.
Requirement Management in Practice
Authors: Michał Godowski, Dariusz Czyrnek
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

This paper is about software requirements, main problem that may come from incorrectly defined requirements, bad practices and common mistakes made while creating requirements. Briefly describes methodologies of managing software requirements. In the article Requirement Management System Theater (RMST) is presented, system used to work with software requirements, keeps its history and manage them. It concentrates on managing versioned software products. Rational RequisitePro and CaliberRM systems are described for comparison.
Cardiac Motion Extraction from Images by Filtering Estimation Based on a Biomechanical Model
Authors: Philippe Moireau, Dominique Chapelle, Mariette Yvinec
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

Starting from the presentation of a unified perspective of segmentation with deformable models and data assimilation with images, we propose a data assimilation procedure designed to dynamically estimate 3D positions and velocities of the myocardium along the heart cycle, using data consisting of contours extracted from image sequences. We assess this procedure with a test problem based on a realistic computational heart model, and with synthetic data produced from reference simulations by creating binary images of the myocardium. The automatic meshing library CGAL is then employed to create contour meshes for each snapshot, and these meshes are directly used in the model-measurement comparisons. This approach gives very satisfactory qualitative and quantitative results.
Characterizing false-name-proof allocation rules in combinatorial auctions
Authors: Taiki Todo, Atsushi Iwasaki, Makoto Yokoo, Yuko Sakurai
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner. There have been several studies on characterizing strategy-proof allocation rules. In particular, a condition called weak-monotonicity has been identified as a full characterization of strategy-proof allocation rules. More specifically, for an allocation rule, there exists an appropriate payment rule so that the mechanism becomes strategy-proof if and only if it satisfies weak-monotonicity. In this paper, we identify a condition called sub-additivity which characterizes false-name-proof allocation rules. False-name-proofness generalizes strategy-proofness, by assuming that a bidder can submit multiple bids under fictitious identifiers. As far as the authors are aware, this is the first attempt to characterize false-name-proof allocation rules. We can utilize this characterization for developing a new false-name-proof mechanism, since we can concentrate on designing an allocation rule. As long as the allocation rule satisfies weak-monotonicity and sub-additivity, there always exists an appropriate payment rule. Furthermore, by utilizing the sub-additivity condition, we can easily verify whether a mechanism is false-name-proof. To our surprise, we found that two mechanisms, which were believed to be false-name-proof, do not satisfy sub-additivity; they are not false-name-proof. As demonstrated in these examples, our characterization is quite useful for mechanism verification.
Kendall distributions and level sets in bivariate exchangeable survival models
Authors: Giovanna Nappo, Fabio Spizzichino
Venue: Information Sciences: an International Journal (2009)

For a given bivariate survival function F@?, we study the relations between the set of the level curves of F@? and the Kendall distribution. Then we characterize the survival models simultaneously admitting a specified Kendall distribution and a specified set of level curves. Attention will be restricted to exchangeable survival models.
BeLife: A Simulation Tool to Support Learning about Photosynthesis
Authors: Nuno Otero, Marcelo Milrad, André Vala, Ana Paiva
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper describes the design and implementation of a multi-agent based interactive learning environment called BeLife. BeLife intends to support learning scientific concepts related to photosynthesis, plant growth and greenhouse management. One of the main objectives of the development of BeLife is to create an interactive learning environment that combines modelling and simulation learning tasks in one tool. We present the initial findings from a case study conducted in a classroom setting with high school students. The study evaluated the usability of a high fidelity prototype of the system. We elaborate on these results and discuss the adequacy of BeLife envisioned functionalities and its applicability.
A Lightweight Delegated Privileges Revocation Scheme Based on Coding
Authors: M. Francisca Hinarejos, Jordi Forné
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

Public Key Infrastructure (PKI) and Privilege Management Infrastructure (PMI) can respectively be used to support authentication and authorization in distributed scenarios. Certificate path processing is a critical issue in both infrastructures, because it requires several costly processes, such as certificate path discovery, validation of the digital signature and checking the revocation status of each certificate. The problem becomes much more complex when using delegation of privileges in a PMI, because in this case the length of the delegation paths can be high. In this paper, we propose a revocation scheme devised to reduce the communication and computational overhead for certificate status checking in delegation paths. This goal is achieved by using suitable coding techniques.
A Sturmian sequence related to the uniqueness conjecture for Markoff numbers
Authors: Yann Bugeaud, Christophe Reutenauer, Samir Siksek
Venue: Theoretical Computer Science (2009)

Sturmian sequences appear in the work of Markoff on approximations of real numbers and minima of quadratic functions. In particular, Christoffel words, or equivalently pairs of relatively prime nonnegative integers, parametrize the Markoff numbers. It was asked by Frobenius if this parametrization is injective. We answer this conjecture for a particular subclass of these numbers, and show that a special Sturmian sequence of irrational slope determines the order of the Markoff numbers in this subclass.
Democracy in the classroom: an exercise for the first days of CS1
Authors: Don Blaheta
Venue: ACM SIGCSE Bulletin (2009)

Selecting a first-day activity for CS1 is an important way to set the scene for an introduction to computer science. This paper presents the task of counting votes as an accessible vehicle for lessons on algorithms, data management, parallel processing, and other key computational ideas.
Adding a reflective layer to a simulation-based learning environment
Authors: Douglas Chesher, Judy Kay, Nicholas JC King
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Computer-based simulations aim to provide an authentic, interactive learning environment. However, there is evidence of failure to acquire deep transferable knowledge. We describe a promising strategy to address this limitation in the form of a reflective layer added to the simulation. This paper describes the SIMPRAC reflection model as applied to supporting learning of the management of chronic illness.
Analogy as Integrating Framework for Human-Level Reasoning
Authors: Angela Schwering, Ulf Krumnack, Kai-Uwe Kühnberger, Helmar Gust
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

Human-level reasoning is manifold and comprises a wide variety of different reasoning mechanisms. So far, artificial intelligence has focused mainly on using the classical approaches deduction, induction, and abduction to enable machines with reasoning capabilities. However, the approaches are limited and do not reflect the mental, cognitive process of human reasoning very well. We contend that analogical reasoning is the driving force behind human thinking and therefore propose analogy as an integrating framework for the variety of human-level reasoning mechanisms.
Computational Drug Design: A Guide for Computational and Medicinal Chemists, 1st edition
Authors: D. C. Young
Venue:  (2009)

Helps you choose the right computational tools and techniques to meet your drug design goals Computational Drug Design covers all of the major computational drug design techniques in use today, focusing on the process that pharmaceutical chemists employ to design a new drug molecule. The discussions of which computational tools to use and when and how to use them are all based on typical pharmaceutical industry drug design processes. Following an introduction, the book is divided into three parts: Part One, The Drug Design Process, sets forth a variety of design processes suitable for a number of different drug development scenarios and drug targets. The author demonstrates how computational techniques are typically used during the design process, helping readers choose the best computational tools to meet their goals. Part Two, Computational Tools and Techniques, offers a series of chapters, each one dedicated to a single computational technique. Readers discover the strengths and weaknesses of each technique. Moreover, the book tabulates comparative accuracy studies, giving readers an unbiased comparison of all the available techniques. Part Three, Related Topics, addresses new, emerging, and complementary technologies, including bioinformatics, simulations at the cellular and organ level, synthesis route prediction, proteomics, and prodrug approaches. The book's accompanying CD-ROM, a special feature, offers graphics of the molecular structures and dynamic reactions discussed in the book as well as demos from computational drug design software companies. Computational Drug Design is ideal for both students and professionals in drug design, helping them choose and take full advantage of the best computational tools available.
Towards a General Model for Supporting Explanations to Enhance Learning
Authors: Amali Weerasinghe, Antonija Mitrovic, Brent Martin
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

We present a project with the goal of developing a general model for supporting explanations, which could be used in both well-and ill-defined instructional tasks. We have previously studied how human tutors provided additional support to students learning with an existing intelligent tutoring system. Analysis of the interactions by human tutors indicates that they have helped the students to improve their understanding of database design. This paper presents the explanation model developed based on these findings.
New directions for the design of virtual reality interfaces to e-commerce sites
Authors: Luca Chittaro, Roberto Ranon
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

Virtual Reality (VR) interfaces to e-commerce sites have recently begun to appear on the Internet, promising to make the e shopping experience more natural, attractive, and fun for customers. Unfortunately, switching to a desktop VR design for an e-commerce site is not trivial and does not guarantee at all that the interface will be effective. In this paper, we first briefly discuss the potential advantages of these interfaces, stressing the need for a better approach to their design. Then, we present the directions we are following to build more usable and effective VR stores, i.e.: (i) reformulating design guidelines from real-world stores in the VR context, (ii) exploiting VR to create user empowerments that meet both customer and merchant needs, and (iii) personalizing the VR store to better reflect customer's taste, preferences, and interests. For each of the three directions, we illustrate and discuss a detailed case study.
Compilation of data-driven macroprograms for a class of networked sensing applications
Authors: Viktor K. Prasanna
Venue:  (2008)

Wireless Sensor Networks (WSNs) are rapidly emerging as a new class of distributed pervasive systems, with applications in a diverse range of domains such as traffic management, building environment management, target tracking, etc. Most, if not all, WSN application design is currently performed at the node-level, with developers manually customizing various protocols to realize their applications. This makes it difficult for the typical domain-expert application developer (e.g., a building system designer) to develop applications for them, and is a hindrance to their wide acceptance. To address this problem, the field of macroprogramming has emerged, which aims to provide high-level programming abstractions to assist in application development for WSNs. Although several macroprogramming approaches have been studied, the area of compilation of these macroprograms to node-level code is still largely unexplored. This thesis addresses the issues involved in the compilation of sensor network macroprograms. The emphasis is on data-driven macroprogramming, where the application is represented as a set of tasks running on the system's nodes - producing, processing and acting on data items or streams to achieve the system's goals. In addition to a modular framework for the overall compilation process, formal models for the task-mapping problem which arises in this context are discussed. Results from optimal result-producing mixed-integer programming techniques and algorithmic heuristics for the above problem are presented. We also present the design and implementation of a graphical toolkit for sensor network macroprogramming.
Auctioning Substitutable Goods
Authors: Andrea Giovannucci, Juan A. Rodríguez-Aguilar, Jesús Cerquides
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

In this paper we extend the notion of multi-unit combinatorial reverse auction by adding a new dimension to the goods at auction. In such a new type of combinatorial auction a buyer can express substitutability relationships among goods: some goods can be substituted with others at a substitution cost. Substitutability relationships allow a buyer to introduce his uncertainty as to whether it is more convenient to buy some goods or others. We introduce such uncertainty in the winner determination problem (WDP) so that not only does the auction help allocate the optimal set of offers ---taking into account substitutability relationships---, but also assesses the substitutability relationships that apply. In this way, the buyer finds out what goods to buy, to whom, and what operations (substitutions) to apply to the acquired goods in order to obtain the initially required ones.