ppxscal/embedding_network huggingface dataset:
Automatically Generated Inspectable Learning Models for Students
Authors: Diana Perez-Marin, Ismael Pascual-Nieto, Enrique Alfonseca, Pilar Rodriguez
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

Willow is an automatic and adaptive free-text scoring system. Its main purpose is to provide formative assessment to the students so that they can get more practise and feedback before their exams. It also keeps track of the terms that students use in their answers to automatically generate each particular student conceptual model and the group conceptual model. In both cases, the conceptual model can be defined as a set of concepts and their relationships that each student keeps in his or her mind about an area of knowledge. The conceptual model can be represented by COMOV as a concept map so that instructors can track students' concepts acquisition. In this paper, we present the new possibility and its consequences of showing the concept maps (from their individual and group conceptual models) not only to instructors but also to students. Moreover, to allow students to see their evolution, as they study and get more training, through their concept maps. The preliminary results of an experiment carried out with a group of students show how they like to be able to inspect their generated learning models.
Training future language teachers to develop online tutors’ competence through reflective analysis
Authors: Nicolas Guichon
Venue: ReCALL (2009)

This article sets out to identify key competencies which language tutors need to develop in order to manage synchronous online teaching. In order to aptly monitor interactions with distant learners, it is proposed that three types of regulation pertaining to socio-affective, pedagogical and multimedia aspects are required. On the one hand, this research aims at specifying these competencies and, on the other hand, it seeks to identify the relevance of reflective analysis for professional development. The context of this study is a teacher training programme for Masters Degree students in teaching French as a foreign language that provides trainees with the opportunity of teaching online to intermediate-level students of French from a North American university via a desktop videoconferencing platform. This programme first endeavours to put trainees in a professional situation by getting them to prepare and administer sessions in order to confront them with the specific challenges of synchronous online tutoring. Second, it seeks to help them to gain insight into their own activity by developing critical thinking towards their own practice. The data elicited for this research derive from the tutor trainees’ interpretations of their own practice when confronted with the film of their own situated activity. The episodes chosen by the trainees to feed the self-confrontation process constitute significant units because by being told and commented upon, they elucidate how and to what extent competencies are built. Three discursive strategies have been identified and used to organise the content analysis of the data: description; expression of a difficulty; reflective review of the activity. The strategies used by trainees to verbalise their own activity can inform teacher educators about the constraints of the work situation and about the resources trainees need to deploy to face up to this unknown professional situation. Results indicate that trainees concentrate particularly on pedagogical aspects that distance and faulty technology have rendered complex. The encountered difficulties are equally distributed between a repertoire of competencies pertaining to language teaching and competencies more directly linked with online teaching. Finally, this study has enabled us to assess the potential of self-confrontation for teacher practice and leads us to propose directions for improving this training device.
ARM: Actor Relationship Matrix
Authors: Komon Ibe, Shinobu Saito, Shuichiro Yamamoto
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

The SD model which the i* framework includes is used to analyze and describe the requirements among the stakeholders in the business. However, the practical method which supports the stakeholders for checking whether or not the requirements in the SD model are comprehensive is not proposed. This paper introduces a method which we called the ARM (Actor Relationship Matrix). The ARM is two-dimensional matrix that defines the relationship among actors. We also discuss the effectiveness of the proposed method which contributes comprehensive review of requirements.
Multi-agent nonholonomic systems with spatio-temporal constraints
Authors: Ali Jadbabaie, George Pappas
Venue:  (2008)

The goal of this thesis is to study the problem of designing a path planner for a set of unmanned vehicles in the following scenario: The planner receives a request for a plan for a specified subset of vehicles under its control. The planner also receives an entry and exit state for each vehicle (3-D location, velocity vector and time of arrival). In addition, the planner receives additional information; such as obstacle or threat locations, no-fly zones and sensor availability. The task of the planner is to generate trajectories that maximize spatio-temporal coverage while satisfying such hard constraints as collision avoidance and specifications on initial and final positions. This is an example of a multi-vehicle path planning problem with spatio-temporal specifications. In this thesis we introduce a novel technique using elastic multi-particle dynamical systems for addressing general bounded curvature path planning problems with such spatio-temporal constraints. The trajectories of vehicles are approximated using sequence of waypoints, and each waypoint is treated as a moving particle in the space. We define nonsmooth interaction forces between the particles such that the resulting multi-particle system is stable; moreover, the trajectories generated by the waypoints in the equilibria of the multi-particle system satisfy all of the hard constraints such as bounded-curvature constraints and obstacle avoidance. Since we are using discontinuous dynamical system, we need nonsmooth analysis and stability of nonsmooth systems to analyze the dynamical system with discontinuous righthand sides. When considering a discontinuous vector field the classical notion of solution to the dynamical system is too restrictive and may not exist. In this thesis we use Filippov solutions concept for differential equations whose right-hand sides are only required to be Lebesgue measurable in the state and time variables. For stability analysis we use nonsmooth Lyapunov stability theory and LaSalle's invariance principle for a class of nonsmooth Lipschitz continuous Lyapunov functions. This approach could be used for variety of problems, including multi-vehicle path planning in a dynamically-changing environment, coverage problem and multi-vehicle rendezvous problem. The unique advantage of this technique is its ability to accommodate a new task without violating other constraints. For example, consider the example given above, we can easily add other tasks such as rendezvous or avoiding moving obstacles to the planner.
Kinematics, singularity and design of parallel robots
Authors: John F. O'Brien
Venue:  (2008)

Manipulators, usually resembling a human arm, are widely used in industry. The most popular manipulators are serial chain manipulators. But low transportable load and poor accuracy increasingly become problems of the usage with such kinds of robots. Consequently, closed loop chain mechanisms are introduced to resolve these problems. In comparison to serial robots, parallel robots have many advantages. But the complexity of singularity analysis and relatively small workspace are the major drawbacks for parallel robots. This thesis is focused on singularity analysis and kinematic design of parallel robots. The thesis makes three major contributions to the research of parallel robot kinematics. Firstly, the determination of unmanipulable singularities are presented. Through the decomposition of the composite manipulability Jacobian, they are identified as single-arm singularities or coincident with unstable singularities. Secondly, singularities are classified due to their relationship with the design purpose. A sequential design procedure is introduced for singularity free workspace design. For an n-arm parallel robot, n-1 arms are designed first to satisfy workspace requirements, then the last arm is designed to provide a singularity-free workspace. Planar and spatial parallel mechanism singularity-free workspace design examples are presented to verify the efficacy of this design method. Modeling of this design method is discussed, and optimization tools are suggested to solve the design problem. Thirdly, a novel 6-Degree Of Freedom composite parallel mechanism is introduced. It consists of two parallel mechanism&ndash;the planar 3-RP&barbelow;R and the spatial 3-UP&barbelow;S-1-PU. Inverse kinematics and singularity of this mechanism are analyzed. Different combinations are demonstrated for different applications.
Genetic algorithms with Nelder-Mead optimization in the variational methods of boundary value problems
Authors: Nikos E. Mastorakis
Venue: WSEAS Transactions on Mathematics (2009)

The p-Laplacian equation is a generalization of the PDE of Laplace Equation and in this paper, we present a way of its solution using Finite Elements. Our method of Finite Elements leads to an Optimization Problem that can be solved by an appropriate combination of Genetic Algorithms and Nelder-Mead. Our method is illustrated by a numerical example. Other methods for the solution of other equations that contain the p-Laplacian operator are also discussed.
Representing lattices using many-valued relations
Authors: Alain Gély, Raoul Medina, Lhouari Nourine
Venue: Information Sciences: an International Journal (2009)

This paper provides a representation theorem of lattices using many-valued relations. We show that any many-valued relation can be associated to a unique lattice which is a meet-sublattice of a product of chains. Conversely, to any lattice we can associate a many-valued relation such that its associated lattice is isomorphic to the initial one. Thereby, we obtain a representation theorem of lattices using many-valued relations. Moreover, since several many-valued relations might have the same associated lattice, we give a characterization of the minimal many-valued relation that can be associated to a lattice. We then sketch a polynomial time algorithm which computes such a minimal relation from either a lattice or an arbitrary relation. This representation presents several advantages: it is smaller than the usual binary representation; all known reconstruction algorithms working on binary relation can be used without loss of efficiency; it can be used by existing data mining processes.
Designing the reading experience for scanned multi-lingual picture books on mobile phones
Authors: Benjamin B. Bederson, Alex Quinn, Allison Druin
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This paper reports on an adaption of the existing PopoutText and ClearText display techniques to mobile phones. It explains the design rationale for a freely available iPhone application to read books from the International Children's Digital Library. Through a combination of applied image processing, a zoomable user interface, and a process of working with children to develop the detailed design, we present an interface that supports clear reading of scanned picture books in multiple languages on a mobile phone.
Continuous-time Markov decision processes with nth-bias optimality criteria
Authors: Junyu Zhang, Xi-Ren Cao
Venue: Automatica (Journal of IFAC) (2009)

In this paper, we study the nth-bias optimality problem for finite continuous-time Markov decision processes (MDPs) with a multichain structure. We first provide nth-bias difference formulas for two policies and present some interesting characterizations of an nth-bias optimal policy by using these difference formulas. Then, we prove the existence of an nth-bias optimal policy by using nth-bias optimal policy iteration algorithms, and show that such an nth-bias optimal policy can be obtained in a finite number of policy iterations.
on Lagrange interpolation
Authors: Dana Simian, Corina Simian
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

The aim of this paper is to present a survey of many approaches which can be used in order to introduced and solve the Lagrange interpolation problem in the space of polynomials with one and several variables. The paper also contains original results related to Lagrange interpolation problem.
Symmetric and quasi-symmetric functions associated to polymatroids
Authors: Harm Derksen
Venue: Journal of Algebraic Combinatorics: An International Journal (2009)

To every subspace arrangement X we will associate symmetric functions ¿[X] and ¿[X]. These symmetric functions encode the Hilbert series and the minimal projective resolution of the product ideal associated to the subspace arrangement. They can be defined for discrete polymatroids as well. The invariant ¿[X] specializes to the Tutte polynomial ${\mathcal{T}}[\mathbf{X}]$ . Billera, Jia and Reiner recently introduced a quasi-symmetric function ¿[X] (for matroids) which behaves valuatively with respect to matroid base polytope decompositions. We will define a quasi-symmetric function ${\mathcal{G}}[\mathbf{X}]$ for polymatroids which has this property as well. Moreover, ${\mathcal{G}}[\mathbf{X}]$ specializes to ¿[X], ¿[X], ${\mathcal{T}}[\mathbf{X}]$ and ¿[X].
Location determination of mobile devices for an indoor WLAN application using a neural network
Authors: Chih-Yung Tsai, Shuo-Yan Chou, Shih-Wei Lin, Wei-Hao Wang
Venue: Knowledge and Information Systems (2009)

Due to the popularity of location-based services, determining the location of a device at all times has become a subject of great interests. Although many GPS-based applications have been developed and successfully deployed in various fields, their applicabilities are hindered by the obstruction of the objects in the environment. Essentially, as satellite signals cannot penetrate the walls of buildings, the coverage of GPS systems is limited to outdoor environments. To fully exploit the benefit of location-based services, approaches that determine the location of a device in indoor environments need to be established. This study presents a novel location determination mechanism that uses an indoor WLAN and back-propagation neural network (BPN). A museum is taken as the context of the example indoor environment. Location determination is achieved using the combined strengths of 802.11b wireless access signals. With a significant number of access points (APs) installed in the museum, hand-held devices can sense the strengths of the signals from all APs to which the devices can connect. Using a back-propagation network, device locations can be estimated with sufficient accuracy. A novel adaptive algorithm is implemented for enhancing the accuracy of the estimation.
iPod & iTunes Pocket Guide, 3rd edition
Authors: Christopher Breen
Venue:  (2007)

Here is your essential companion to the iPod touch, classic, nano, and shuffle, and the iTunes application. The iPod & iTunes Pocket Guide, Third Edition, steers you through how to Import songs into iTunes and assemble playlists, listen to podcasts, and burn CDs. Find music, movies, TV shows, videos, and audiobooks on the iTunes.Store and see song and film recommendations, discover podcasts, and send gift certificates. Buy music from the iTunes Wi-Fi Music Store and sync songs with your computer. Use your iPod to keep contacts, view events, and store files (as a portable hard drive). Make your iPod even more useful (and awe your friends) with fascinating tips and tricks. Fix common problems and learn what to do if you cant fix them yourself. 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
Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties
Authors: Ondřej Kuželka, Filip železný
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We describe an algorithm for constructing a set of acyclic conjunctive relational features by combining smaller conjunctive blocks. Unlike traditional level-wise approaches which preserve the monotonicity of frequency, our block-wise approach preserves a form of monotonicity of the irreducibility and relevancy feature properties, which are important in propositionalization employed in the context of classification learning. With pruning based on these properties, our block-wise approach efficiently scales to features including tens of first-order literals, far beyond the reach of state-of-the art propositionalization or inductive logic programming systems.
Framework for the design of web-based learning for digital forensics labs
Authors: Kevin R. Lawrence, Hongmei Chi
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

Digital forensic education and training has been experiencing radical growth in the past ten years. The core of these training and academic programs is to develop a set of suitable hands-on digital forensic labs. To do this we first must familiarize ourselves with the tools of the trade. The main step to training students, who are preparing to be computer forensic professionals, lies in creating a comprehensive hands-on approach to computer forensics. The goal of this project work is to establish a series of hands-on computer forensic labs, which help students prepare to accede seamlessly into the law enforcement workforce and to make these labs available online by exploiting technologies of Web-based learning and future web developments, one of this includes the Semantic Web. The Semantic Web will enable intelligent services by several methods which all work towards making information machine-understandable [3]. With this we hope to develop an intelligent Web-based educational system which is capable of demonstrating some form of knowledge-based reasoning in lab sequencing, in analysis of the student's answers combining with students' background, and in providing interactive problem-solving support to the student, all adapted to the Web technology [3].
Mining Sequential Patterns in Data Stream
Authors: Qinhua Huang, Weimin Ouyang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

We present a new algorithm of mining sequential patterns in data stream. In recent years data stream emerges as a new data type in many applications. When processing data stream, the memory is fixed, new stream elements flow continuously. The stream data can not be paused or completely stored. We develop a LSP-tree data structure to store the discovered sequential patterns. The experiment result shows that our proposal is able to mine sequential patterns from stream data with rather low price.
Automated agent-based system for weather information
Authors: Jaume Segura, Vicente R. Tomás, Arturo Sáez, Juan J. Martínez
Venue: Proceedings of the 2009 Euro American Conference on Telematics and Information Systems: New Opportunities to increase Digital Citizenship (2009)

Road accidents are well correlated with bad weather conditions. In traffic management, several strategies have been considered in order to reduce this kind of accidents. Weather problems can cause difficult situations for the traffic management decision-makers. They need to analyze and absorb a large quantity of information in order to solve some problems due to bad weather. An automated agent-based system is a good solution to help decision-makers in the management of weather information to road users in relation to traffic conditions. In this paper, a distributed system based in autonomous agents and rules for road weather information has been proposed. Also the detection procedure is explained.
Support for M-Commerce Software Autonomy
Authors: Thar Baker, A. Taleb-Bendiab, Martin Randles
Venue: Proceeding of the 2008 conference on Techniques and Applications for Mobile Commerce: Proceedings of TAMoCo 2008 (2008)

Recently there has been a flurry of research inspired by social and biological models for achieving software autonomy. This has been prompted by the need to automate laborious administration tasks, recover from unanticipated systems failure, and provide self-protection from security vulnerabilities, whilst guaranteeing predictable autonomic software behaviour. However, runtime assured adaptation of software to new requirement in a mobile setting, where there is code mobility in the form of mobile agents as well as the presence of mobile devices, is still a major outstanding issue for research. This paper presents a language support for the programming of autonomic software in mobile environments and m-commerce environments in particular. The paper starts by a review of the state-of-the-art into runtime software adaptation and mobility. This is followed by a developed Neptune framework and language support applied to mobile ambients, which is here described via an illustrative example based on a commercial decision support system that automatically updates according to a newly developed run time code editor. The paper ends with a discussion and some concluding remarks leading to suggested further works.
Electrocardiographic Simulation on Coupled Meshfree-BEM Platform
Authors: Linwei Wang, Ken C. Wong, Heye Zhang, Pengcheng Shi
Venue: Proceedings of the 5th International Conference on Functional Imaging and Modeling of the Heart (2009)

The foremost premise for the success of noninvasive volumetric myocardial transmembrane (TMP) imaging from body surface potential (BSP) recordings is a realistic yet efficient electrocardiographic model which relates volumetric myocardial TMP distribution to BSP distribution. With a view towards this inverse problem, the heart-torso representation and the associated TMP-to-BSP model should balance the accuracy of the model with the feasibility of TMP reconstruction. We present a novel coupled meshfree-BEM platform to this TMP-to-BSP modeling and perform electrocardiographic simulations of various cardiac conditions on personalized heart-torso structures. Simulated QRS integral maps, BSPMs and ECG leads are consistent with existent experimental studies, verifying the plausibility of the presented platform.