ppxscal/embedding_network huggingface dataset:
The effects of type of task and type of feedback on l2 development in call
Authors: Ronald P. Leow
Venue:  (2007)

A task feature identified by Loschky and Bley-Vroman (1993), 'task-essentialness', is said to promote attention to the target structure given that the target form itself is "the 'essence' of what is to be attended" (p. 139). Although some studies (e.g., Leow, 1997b, 1998a, 1998b6; Rosa Leow, 2004a; Rosa O'Neill, 1999; Sanz Morgan-Short, 2004) have included this feature in their design, none has empirically investigated its advantages. The differential effects between types of feedback (explicit vs. implicit), on the other hand, have been examined in SLA and computer-assisted language learning (CALL) before, albeit with contradictory findings. White some studies found advantages for explicit feedback (Bowles, forthcoming; Carroll Swain, 1993; Nagata, 1993; Nagata Swisher, 1995; Rosa, 1999; Rosa Leow, 2004a), there is also evidence that explicit feedback is as effective as implicit feedback (Camblor-Portilla, 2006; Hsieh, 2007; Sanz Morgan-Short, 2004). This study aimed to extend our understanding of how 'task-essentialness' and different types of feedback impact the learning of a Spanish syntactic structure in the context of CALL. Fifty-seven participants were randomly assigned to one of four groups that combined [Mask-essentialness] and [&plusmn; explicit feedback]. Recognition and production tests were administered in a pretest-posttest-delayed posttest design. Think-aloud protocols were employed to monitor participants' attention during the treatment and to elicit informative data of their thinking processes during the assessment tests. The results did not show any significant differences between type of task; a significant main effect was found for type of feedback on the oral delayed posttest, the implicit feedback outperforming the explicit feedback group. Moreover, the explicit feedback group displayed a significant loss between the posttest and the delayed posttest, while those in the implicit feedback group did not. These results seem to point to degree of difficulty of the target structure and learners' proficiency level as predictors for effects of different types of feedback. Explicit feedback seems to be more efficient when low proficiency level participants are learning simple linguistic items.
Performance evaluation of blind source separation schemes in anechoic and echoic environments
Authors: Sungmin Woo, Jeong Hong
Venue: Proceedings of the 7th WSEAS International Conference on Signal Processing, Robotics and Automation (2008)

In this paper we compare two different blind source separation algorithms, Degenerate Unmixing Estimation Technique (DUET) and Frequency-Domain Independent Component Analysis (FDICA). Even though both algorithms are known to be powerful in separating signals, each has superior to another in a specific condition. We investigate advantages and disadvantages of each algorithm, and evaluate their performances in anechoic and echoic conditions.
Adapte, a Tool for the Teacher to Personalize Activities
Authors: Marie Lefevre, Nathalie Guin, Stéphanie Jean-Daubias
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

In this paper, we want to present our tool for personalization of learning activities: the Adapte module. Our approach consists in helping teachers to provide activities suited to the abilities highlighted in learners' profiles. We will present the context of the utilization of Adapte, then we will explain its principles and its mechanism. We will finish with the research prospects of this module and the PERLEA project in witch it is integrated.
A Novel Classifier Based on Enhanced Lipschitz Embedding for Speech Emotion Recognition
Authors: Mingyu You, Guo-Zheng Li, Luonan Chen, Jianhua Tao
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

The paper proposes a novel classifier named ELEC (Enhanced Lipschitz Embedding based Classifier) in the speech emotion recognition system. ELEC adopts geodesic distance to preserve the intrinsic geometry of speech corpus and embeds the high dimensional feature vector into a lower space. Through analyzing the class labels of the neighbor training vectors in the compressed space, ELEC classifies the test data into six archetypal emotional states, i.e. neutral, anger, fear, happiness, sadness and surprise. Experimental results on a benchmark data set demonstrate that compared with the traditional methods, the proposed classifier of ELEC achieves 17% improvement in average for speaker-independent emotion recognition and 13% for speaker-dependent.
Training and Application of a Visual Forward Model for a Robot Camera Head
Authors: Wolfram Schenck, Ralf Möller
Venue: Anticipatory Behavior in Adaptive Learning Systems: From Brains to Individual and Social Behavior (2007)

Visual forward models predict future visual data from the previous visual sensory state and a motor command. The adaptive acquisition of visual forward models in robotic applications is plagued by the high dimensionality of visual data which is not handled well by most machine learning and neural network algorithms. Moreover, the forward model has to learn which parts of the visual output are really predictable and which are not because they lack any corresponding part in the visual input. In the present study, a learning algorithm is proposed which solves both problems. It relies on predicting the mapping between pixel positions in the visual input and output instead of directly forecasting visual data. The mapping is learned by matching corresponding regions in the visual input and output while exploring different visual surroundings. Unpredictable regions are detected by the lack of any clear correspondence. The proposed algorithm is applied successfully to a robot camera head under additional distortion of the camera images by a retinal mapping. Two future applications of the final visual forward model are proposed, saccade learning and a task from the domain of eye-hand coordination.
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
Authors: Olaf Beyersdorff, Sebastian Müller
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

Cook and Krají¿ek [9] have obtained the following Karp-Lipton result in bounded arithmetic: if the theory proves , then collapses to , and this collapse is provable in . Here we show the converse implication, thus answering an open question from [9]. We obtain this result by formalizing in a hard/easy argument of Buhrman, Chang, and Fortnow [3].In addition, we continue the investigation of propositional proof systems using advice, initiated by Cook and Krají¿ek [9]. In particular, we obtain several optimal and even p-optimal proof systems using advice. We further show that these p-optimal systems are equivalent to natural extensions of Frege systems.
Computer applications in air traffic control
Authors: Vernon I. Weihe
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

We Americans are a capricious people. We warm up and develop tremendous enthusiasm for an idea, an activity, or a particular way of doing things. We expect a great deal from the objects of our enthusiasm, and when our great expectations fail to materialize on schedule, we cool as rapidly as we once warmed. 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
Design of a Haptic Direction Indicator for Visually Impaired People in Emergency Situations
Authors: Tomohiro Amemiya, Hisashi Sugiyama
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Some emergency situations, such as fires or earthquakes, require that evacuation to a safe area, often through an emergency exit. This is especially difficult for people with visual disability. Here, we propose a new device, a haptic direction indicator, which will help blind pedestrians intuitively and safely escape from dangerous area by means of haptic navigation.
Upcoming Events
Venue: IEEE MultiMedia (2007)

Here we list some upcoming conferences and calls for papers.
Computational aspects of the refinement of 3D tetrahedral meshes
Authors: J. P. Suárez, P. Abad, A. Plaza, M. A. Padrón
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

The refinement of tetrahedral meshes is a significant task in many numerical and discretizations methods. The computational aspects for implementing refinement of meshes with complex geometry need to be carefully considered in order to have real-time and optimal results. In this paper we study some computational aspects of a class of tetrahedral refinement algorithms. For local adaptive refinement we give numerical results of the computational propagation cost of a general class of longest edge based refinement and show the implications of the geometry in the global process. Moreover we study the conformity process based on the longest edge bisection and give an algorithm and data structure to efficiently handle tetrahedral refinement.
An Overview of the 9900 Microprocessor Family
Authors: Richard Orlando, Thomas Anderson
Venue: IEEE Micro (1981)

An established microprocessor family-especially its newest member-offers speed, compatibility with a large body of existing software, and multiprocessing capability.
Pillar: A Parallel Implementation Language
Authors: Todd Anderson, Neal Glew, Peng Guo, Brian T. Lewis, Wei Liu, Zhanglin Liu, Leaf Petersen, Mohan Rajagopalan, James M. Stichnoth, Gansha Wu, Dan Zhang
Venue: Languages and Compilers for Parallel Computing: 20th International Workshop, LCPC 2007, Urbana, IL, USA, October 11-13, 2007, Revised Selected Papers (2007)

As parallelism in microprocessors becomes mainstream, new prog- ramming languages and environments are emerging to meet the challenges of parallel programming. To support research on these languages, we are developing a low-level language infrastructure called Pillar (derived from Parallel Implementation Language). Although Pillar programs are intended to be automatically generated from source programs in each parallel language, Pillar programs can also be written by expert programmers. The language is defined as a small set of extensions to C. As a result, Pillar is familiar to C programmers, but more importantly, it is practical to reuse an existing optimizing compiler like gcc [1] or Open64 [2] to implement a Pillar compiler.Pillar's concurrency features include constructs for threading, synchronization, and explicit data-parallel operations. The threading constructs focus on creating new threads only when hardware resources are idle, and otherwise executing parallel work within existing threads, thus minimizing thread creation overhead. In addition to the usual synchronization constructs, Pillar includes transactional memory. Its sequential features include stack walking, second-class continuations, support for precise garbage collection, tail calls, and seamless integration of Pillar and legacy code. This paper describes the design and implementation of the Pillar software stack, including the language, compiler, runtime, and high-level converters (that translate high-level language programs into Pillar programs). It also reports on early experience with three high-level languages that target Pillar.
Mapping the Security Landscape: A Role for Language Techniques
Authors: Fred B. Schneider
Venue: Proceedings of the 18th international conference on Concurrency Theory (2007)

Over the last decade, programming language techniques have been applied in non-obvious ways to building secure systems. This talk will not only survey that work in language based security but show that the theoretical underpinnings of programming languages are a good place to start for developing a much needed foundation for software system security.
Designing Rough Sets Attributes Reduction Based Video Deinterlacing System
Authors: Gwanggil Jeon, Marco Anisetti, Valerio Bellandi, Jechang Jeong
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

The use of rough set's theoretic concepts has permitted in this work to make the mathematical model on mode decision in deinterlacing system. In this paper, a rough set approach based decision making problem is proposed. In the literature, some conventional deinterlacing methods provide high performance with higher computational burden. On the other hand, some other methods give low performance with lower computational burden. Those all methods have been reported that interpolate missing pixels indiscriminately in the same way. Our algorithm chooses the most suitable method adaptively based on rough set theory using four parameters. This deinterlacing approach employs a size reduction of the database system, keeping only the essential information for the process, especially in the representation of and reasoning with vague and/or imprecise knowledge. Decision making and interpolation results are presented. The results of computer simulations show that the proposed method outperforms a number of methods presented in the literature.
Investigation on Construction of Network Course and Its Optimization Model
Authors: Zhiming Qu, Lijun Jiao, Libo Liu
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

As a newly developed course, the network course (NC) plays very important role in modern teaching and education. Using the theory of grey linear programming, the optimization model of minimizing the cost and optimizing the NC resource is setup. Adapting the grey interval, the variables have a wide range of interval regions to take effect on the cost and the useful resource. The example shows that, if the link in the process of the NC arrangement and course resource allocation is reasonable, the cost in developing the NC will be lowered and the resource will be valuably allocated.
I-extended databases
Authors: Zakaria Suliman Zubi
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

One of the most challenging problems in data manipulation in the future is to be able to efficiently handle very large databases but also multiple induced properties or generalizations in that data. Popular examples of useful properties are association rules, and inclusion functional dependencies. Our view of a possible approach for this task is to specify and query i-extended databases, which are databases that in addition to data also contain exceedingly defined generalizations about the data. I-extended database is a database that has similar properties then an inductive database [6] in certain scene and it could be also an alternative to inductive database. I formalize this concept and show how it can be use throughout the whole process of DM due to the closure property of the framework. Suppose that a simple query language can be defined using normal database terminology. I also demonstrate the use of this framework to model typical DM processes. It is then possible to perform various tasks on these descriptions like, e.g., optimizing the selection of interesting properties or comparing two processes. The main aim of implementing i-extended database is to be interacted by a spatial Data Mining query called Knowledge Discovery Query Language (KDQL) described in [21]. The KDQL was demonstrated and introduced as a query in the ODBC_KDD (2) model in [22].
Characteristics and Solutions of Digital Divide for People with Physical Impairments in Taiwan
Authors: Yao-Ming Yeh, Ting-Fang Wu, Ling-Fu Meng, Ming-Chung Chen, Hwa-Pey Wang, Jung-Gen Wu, Chi-Nung Chu, Yun Lung Lin, Chih-Ching Yeh
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The purpose of this study is to narrow down the digital gap between people with and those without physical impairments in Taiwan. To better understand the need of the digital learning for people with physical impairments, the authors have created the digital characteristic assessment scale, digital need assessment scale, and developed the mouse training system and on-screen keyboard assessment system. In order to comprehend the performance and practicability of the scales and systems, this integrated project have also applied these tools to evaluate and train the clients with muscular dystrophy and cerebral palsy.To fulfill the need of training the clients and providing appropriate assistant facilities, the alternative input device and the adapted web platform have been developed. The result validates the feasibility of both software and hardware developed by our implementation.
Design and Implementation of an Internet-Based Platform for C Language Learning
Authors: Jianxin Wang, Ling Chen, Weiwei Zhou
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

A designing model and implementing method of an Internet-based system for C Language Learning is proposed in the paper, which based on .NET platform. The communication between the system and the compiler of C Language is implemented by using redirect technology. More powerful compile and logic error-check function are provided in the system, which adopts C# Multi-thread technology and synchronous control theory. Object-Oriented design methods and C# Reflection technology are used to solve the problem of dynamic test-case scheduling, which makes the system be extensible and robust. In the platform, users can learn C language knowledge and do C program. Especially, they can find out the logic errors which are bugs and can not be discovered by the compiler in programs. Once the users can gain access to the Internet, they can get hints and extra help easily through the interactive system at anytime and in anyplace.
Temporal Deontic Defeasible Logic: An Analytical Approach
Authors: Régis Riveret, Antonino Rotolo
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

In [1,2,3] basic Defeasible Logic was extended to capture some temporal aspects in legal reasoning. All these extensions can be criticized in two respects: first, a synthetical approach with which all temporal and substantial elements of the norm are represented within the same sentence was adopted instead of an analytical approach in which one sentence represents the substantive content of the norm, and other sentences specify its temporal features. Second, no semantics was provided. This paper aims to provide a Temporal Deontic Defeasible Logic adopting an analytical approach and an argumentation semantics.
Combining Answers of Sub-classifiers in the Bagging-Feature Ensembles
Authors: Jerzy Stefanowski
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Improving classification performance of learning systems can be achieved by constructing multiple classifiers which include sets of sub-classifiers, whose individual predictions are combined to classify new objects. The diversification of sub-classifiers is one of necessary conditions for improving the classification accuracy. To obtain more diverse sub-classifiers we extend the bagging approach by integrating sampling different distributions of learning examples with selecting multiple subsets of features. We summarize results of our experiments on studying the usefulness of different feature selection techniques in this extension. The main aim of the paper is to examine the use of three methods for aggregating predictions of sub-classifiers in the extended bagging classifier. Our experimental results show that the extended classifier, with a dynamic choice of answers instead of a simple voting aggregation rule, is more accurate than standard bagging.
Liquid State Machine Built of Hodgkin-Huxley Neurons
Authors: Wieslaw A. Kaminski, Grzegorz M. Wojcik
Venue: Informatica (2004)

Neural networks built of Hodgkin-Huxley neurons were examined. These structures behaved like Liquid State Machines (LSM). They could effectively process different input signals (i.e., Morse alphabet) into precisely defined output. It is also shown that there is a possibility of logical gates creation with use of Hodgkin-Huxley neurons and simple LSMs.
Faster Concept Analysis
Authors: Adam D. Troy, Guo-Qiang Zhang, Ye Tian
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

We introduce a simple but efficient, multistage algorithm for constructing concept lattices (MCA). A concept lattice can be obtained as the closure system generated from attribute concepts (dually, object concepts). There are two strategies to use this as the basis of an algorithm: (a) forming intersections by joining one attribute concept at a time, and (b) repeatedly forming pairwise intersections starting from the attribute concepts. A straightforward translation of (b) to an algorithm suggests that pairwise intersection be performed among all cumulated concepts. MCA is parsimonious in forming the pairwise intersections: it only performs such operations among the newly formed concepts from the previous stage, instead of cumulatively. We show that this parsimonious multistage strategy is complete: it generates all concepts. To make this strategy really work, one must overcome the need to eliminate duplicates (and potentially save time even further), since concepts generated at a later stage may have already appeared in one of the earlier stages. As considered in several other algorithms in the literature [5], we achieve this by an auxiliary search tree which keeps all existing concepts as paths from the root to a flagged node or a leaf. The depth of the search tree is bounded by the total number of attributes, and hence the time complexity for concept lookup is bounded by the logarithm of the total number of concepts. For constructing lattice diagrams, we adapt a sub-quadratic algorithm of Pritchard [9] for computing subset partial orders to constructing the Hasse diagrams. Instead of the standard expected quadratic complexity, the Pritchard approach achieves a worst-case time O(N 2 / log N). Our experimental results showed significant improvements in speed for a variety of input profiles against three leading algorithms considered in the comprehensive comparative study [5]: Bordat, Chein, and Norris.
AAMPL: accelerometer augmented mobile phone localization
Authors: Andrew Ofstad, Emmett Nicholas, Rick Szcodronski, Romit Roy Choudhury
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

A variety of mobile phone applications are on the rise, many of which utilize physical location to express the "context" of information. This paper argues that physical location alone, unless remarkably precise, may not be sufficient to express this context. Even slight localization errors may cause a mobile phone to be placed in a grocery store, as opposed to its actual location in an adjacent coffee shop. Applications such as location specific advertisements, can get affected. This paper proposes accelerometer augmented mobile phone localization (AAMPL), a system that uses accelerometer signatures to place mobile phones in the right context. Early evaluation on Nokia N95 phones shows that AAMPL can correct locations derived from Google Maps. We believe that AAMPL can be extended to additional sensors (like light and sound) to further aid GPS-free localization.