ppxscal/embedding_network huggingface dataset:
A Learner Model in a French Reading Tutor
Authors: Didier Fragne, Rabiha Faqir, Nabila Sayouri
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)

A learner model in a reading tutor is a crucial component to individualize the teaching. Our intelligent agent-based system named AMICAL aims to teach the reading to a single seven year old French child in his mother tongue. In our system, we defined three different sections of the learner model: domain knowledge, cognitive and meta-cognitive aspect and the behaviour of the child. From the reports recorded during the interactions between the child and our system, we build step by step the learner model of that child. It is represented with complex frames. It has three goals: first for our system, second for the teacher and third for the child. The learner model is build from different analysis at different levels of the reports. We have three levels of analysis: a local analysis for each activity in the work session, a synthetic analysis that involves the entire work session and a historical analysis that takes in consideration the current session and the sessions before. An intelligent agent of our system builds and manages the learner model. In this paper, we discuss the importance of a learner model in a reading tutor, its content, its representation and the construction such a model..
A Complete Characterisation of the Linear Clique-Width of Path Powers
Authors: Pinar Heggernes, Daniel Meister, Charis Papadopoulos
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

A k-path power is the k-power graph of a simple path of arbitrary length. Path powers form a non-trivial subclass of proper interval graphs. Their clique-width is not bounded by a constant, and no polynomial-time algorithm is known for computing their clique-width or linear clique-width. We show that k-path powers above a certain size have linear clique-width exactly k + 2, providing the first complete characterisation of the linear clique-width of a graph class of unbounded clique-width. Our characterisation results in a simple linear-time algorithm for computing the linear clique-width of all path powers.
Learning AAM fitting through simulation
Authors: Jason Saragih, Roland Göcke
Venue: Pattern Recognition (2009)

The active appearance model (AAM) is a powerful method for modeling and segmenting deformable visual objects. The utility of the AAM stems from two fronts: its compact representation as a linear object class and its rapid fitting procedure, which utilizes fixed linear updates. Although the original fitting procedure works well for objects with restricted variability when initialization is close to the optimum, its efficacy deteriorates in more general settings, with regards to both accuracy and capture range. In this paper, we propose a novel fitting procedure where training is coupled with, and directly addresses, AAM fitting in its deployment. This is achieved by simulating the conditions of real fitting problems and learning the best set of fixed linear mappings, such that performance over these simulations is optimized. The power of the approach does not stem from an update model with larger capacity, but from addressing the whole fitting procedure simultaneously. To motivate the approach, it is compared with a number of existing AAM fitting procedures on two publicly available face databases. It is shown that this method exhibits convergence rates, capture range and convergence accuracy that are significantly better than other linear methods and comparable to a nonlinear method, whilst affording superior computational efficiency.
Mathematical Linguistics in Cognitive Medical Image Interpretation Systems
Authors: Lidia Ogiela, Marek R. Ogiela, Ryszard Tadeusiewicz
Venue: Journal of Mathematical Imaging and Vision (2009)

The task of carrying out semantic searches for useful information was solved to some degree for textual data. Unfortunately, medical image analysis has demonstrated that the issue of searching for useful semantic information, on the basis of content, is an insolvable task, in practice. We have acquired a certain expertise in using automatic techniques for retrieving features that define the semantic content of visual data. Everything seems to suggest that the techniques of syntactic pattern analysis which are useful in computer-aided medical diagnosis can also be very helpful in tasks involving automatic understanding procedures used in medical image interpretation systems.Therefore, the topic of this paper will be the presentation of application possibilities for graph EDT grammars as well as context-free grammars as cognitive techniques supporting medical pattern semantic interpretation. Those mathematical linguistic mechanisms will be used for the automatic generation of syntactic descriptions of the contents of the analyzed types of medical images originating from pancreas ERCP examinations, spinal cord visualization and wrist radiograms. The semantics of those patterns define the type of incorrectness of the organ shown on it. Attention will be focused on the methods of cognitive analysis with respect to medical data. So, the languages of shape description and proposed grammars mainly allow for the creation of syntactic descriptions of selected anatomic organs together with a definition of the semantic meaning of the changes in their shapes. Such descriptions will allow us to create a semantically-oriented representation of visual data describing pattern features which are useful in medical decisions and computer-aided diagnostic systems.
Application of non-linear optical second harmonic generation and X-ray absorption and spectroscopies to defect related properties of Hf silicate and Hf Si oxynitride gate dielectrics
Authors: K. Gundogdu, G. Lucovsky, K. -B. Chung, J. -W. Kim, D. Nordlund
Venue: Microelectronic Engineering (2009)

Three different Hf oxide based dielectrics have emerged as viable candidates for applications in advanced ULSI devices. This article focuses on two of these: (i) phase separated Hf silicates with (i) 70-85% nano-crystalline HfO"2 with a nano-grain size
Promoting Creative Activity with Computers in Out Of School Hours Care Programs for Primary Aged Children
Authors: Jennifer Masters
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

Technology is a powerful tool for children to engage for creative purposes, however, it is more likely that when children have recreational access to a computer they will use it as a consumer, eg. for games or information, rather than as a creative tool. This presentation will report on a project that investigates the availability and use of computers and associated digital technologies in out of school hours care (OSHC) programs in the Greater Bendigo region in Victoria, Australia. It will map the use of computers and identify instances of creative activity. The goal of the project is to document effective strategies for OSHC environments to support children to use available resources for creative purposes.
Colour Image Quality Assessment Using Structural Similarity Index and Singular Value Decomposition
Authors: Krzysztof Okarma
Venue: Proceedings of the International Conference on Computer Vision and Graphics: Revised Papers (2008)

In the paper the analysis of the influence of the colour space on the results obtained during image quality assessment using the Structural Similarity index and the Singular Value Decomposition approach has been investigated. Obtained results have been compared to the ones achieved by widely used Normalised Colour Difference (NCD) metric. All the calculations have been performed using the LIVE Image Quality Assessment Database in order to compare the correlation of achieved results with the Differential Mean Opinion Score (DMOS) values obtained from the LIVE database. As a good solution for the further research, also with the use of some other image quality metrics, the application of the HSV colour space is proposed instead of commonly used YUV/YIQ luminance channel or the average of the RGB channels.
Towards a computational treatment of superlatives
Authors: Silke Scheible
Venue: Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop (2007)

I propose a computational treatment of superlatives, starting with superlative constructions and the main challenges in automatically recognising and extracting their components. Initial experimental evidence is provided for the value of the proposed work for Question Answering. I also briefly discuss its potential value for Sentiment Detection and Opinion Extraction.
Block-switched networks: a new paradigm for wireless transport
Authors: Ming Li, Devesh Agrawal, Deepak Ganesan, Arun Venkataramani
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

TCP has well-known problems over multi-hop wireless networks as it conflates congestion and loss, performs poorly over time-varying and lossy links, and is fragile in the presence of route changes and disconnections. Our contribution is a clean-slate design and implementation of a wireless transport protocol, Hop, that uses reliable per-hop block transfer as a building block. Hop is 1) fast, because it eliminates many sources of overhead as well as noisy end-to-end rate control, 2) robust to partitions and route changes because of hop-by-hop control as well as in-network caching, and 3) simple, because it obviates complex end-to-end rate control as well as complex interactions between the transport and link layers. Our experiments over a 20-node multi-hop mesh network show that Hop is dramatically more efficient, achieving better fairness, throughput, delay, and robustness to partitions over several alternate protocols, including gains of more than an order of magnitude in median throughput.
Tag vision: social knowledge for collaborative search
Authors: Lara Marcellin, Roberto Politi
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

In this paper we describe a model of social and collaborative search based on the use of tags. First we will introduce the issues that drove us to the definition of this model, analyzing different elements characterizing the web 2.0 paradigm and their effect on traditional search and classification systems. Afterwards we will present TAG Vision, a prototype implementation of the model, developed in order to investigate new approaches for information retrieval.
The comparison of online social networks in terms of structure and evolution
Authors: Charles K. Nicholas
Venue:  (2008)

Social network systems on the Internet, such MySpace and LinkedIn, are growing in popularity around the world. The level of such activity is now comparable to that associated with email and blogs. Our research addresses the question of whether people in different demographic groups use these systems in the same way. We also examined the relationship between membership in on-line social networks and face-to-face networks, especially with respect to different age cohorts. Older Americans tend to use email the same way as Americans in general. The usage of blogs, however, is different, with significant differences in the temporal and structural patterns of post and response in blogs being evident in different demographics. Our research has implications for the design of social network software for older Americans, as well as the algorithms used in search engines for such systems.
Recognizing nested named entities in GENIA corpus
Authors: Baohua Gu
Venue: Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis (2006)

Nested Named Entities (nested NEs), one containing another, are commonly seen in biomedical text, e.g., accounting for 16.7% of all named entities in GENIA corpus. While many works have been done in recognizing non-nested NEs, nested NEs have been largely neglected. In this work, we treat the task as a binary classification problem and solve it using Support Vector Machines. For each token in nested NEs, we use two schemes to set its class label: labeling as the outmost entity or the inner entity. Our preliminary results show that while the outmost labeling tends to work better in recognizing the outmost entities, the inner labeling recognizes the inner NEs better. This result should be useful for recognition of nested NEs.
Searching for adaptive resource allocation strategies in Arabidopsis lyrata using genetic algorithms
Authors: Robert P. Gove
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

The perennial plant Arabidopsis lyrata, whose genome has recently been sequenced, shows considerable adaptation to local climates, thus making it an ideal plant for analyzing the genetics of resource allocation. My research focuses on determining how resource allocation traits for reproduction and growth and maintenance may be controlled genetically in different populations. A simulation is developed to analyze the effectiveness of a particular resource allocation strategy, and a genetic algorithm is implemented to search through the strategy space and identify the most adaptive strategies for particular environments.
On the convergence of the LMS algorithm with a rank-deficient input autocorrelation matrix
Authors: D. C. McLernon, M. M. Lara, A. G. Orozco-Lugo
Venue: Signal Processing (2009)

In all books and papers on adaptive filtering, the input autocorrelation matrix R"x"x is always considered positive definite and hence the theoretical Wiener-Hopf normal equations (R"x"xh=r"x"d) have a unique solution h=h"o"p"t (''there is only a single global optimum'', [B. Widrow, S. Stearns, Adaptive Signal Processing, Prentice-Hall, 1985, p. 21]) due to the invertibility of R"x"x (i.e., it is full-rank). But what if R"x"x is positive semi-definite and not full-rank? In this case the Wiener-Hopf normal equations are still consistent but with an infinite number of possible solutions. Now it is well known that the filter coefficients of the least mean square (LMS), stochastic gradient algorithm, converge (in the mean) to the unique Wiener-Hopf solution (h"o"p"t) when R"x"x is full-rank. In this paper, we will show that even when R"x"x is not full-rank it is still possible to predict the (convergence) behaviour of the LMS algorithm based upon knowledge of R"x"x, r"x"d and the initial conditions of the filter coefficients.
Minimizing CPU energy in real-time systems with discrete speed management
Authors: Enrico Bini, Giorgio Buttazzo, Giuseppe Lipari
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2009)

This article presents a general framework to analyze and design embedded systems minimizing the energy consumption without violating timing requirements. A set of realistic assumptions is considered in the model in order to apply the results in practical real-time applications. The processor is assumed to have as a set of discrete operating modes, each characterized by speed and power consumption. The energy overhead and the transition delay incurred during mode switches are considered. Task computation times are modeled with a part that scales with the speed and a part having a fixed duration, to take I/O operations into account. The proposed method allows to compute the optimal sequence of voltage/speed changes that approximates the minimum continuous speed, which guarantees the feasibility of a given set of real-time tasks, without violating the deadline constraints. The analysis is performed both under fixed and dynamic priority assignments.
Weblog as a personal thinking space
Authors: Lilia Efimova
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

While weblogs have been conceptualised as personal thinking spaces since their early days, those uses have not been studied in detail. The purpose of this paper is to explore how a weblog can contribute to the process of developing ideas in a long-term complex project. To do so I use autoethnography to reconstruct my personal blogging practices in relation to developing PhD ideas from two perspectives. I first discuss my practices of using a weblog as a personal information management tool and then analyse its uses at different stages in the process of working on a PhD dissertation: dealing with fuzzy insights, sense-making and turning ideas into a dissertation text. The findings illustrate that next to supporting thinking in a way private notebooks do, a weblog might serve similar roles as papers on one's office desk: dealing with emerging insights and difficult to categorise ideas, while at the same time creating opportunities for accidental feedback and impressing those who drop by.
O-level Made Simple
Authors: Satish Jain
Venue:  (2007)

This book covers the entire syllabus for Module 4.1 R3 paper namely, programming and problem solving through "C" langusge, in clear and simple style. 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
What Do You Mean by “AI”?
Authors: Pei Wang
Venue: Proceeding of the 2008 conference on Artificial General Intelligence 2008: Proceedings of the First AGI Conference (2008)

Many problems in AI study can be traced back to the confusion of different research goals. In this paper, five typical ways to define AI are clarified, analyzed, and compared. It is argued that though they are all legitimate research goals, they lead the research to very different directions, and most of them have trouble to give AI a proper identity. Finally, a working definition of AI is proposed, which has important advantages over the alternatives.
Wikipedia workload analysis for decentralized hosting
Authors: Guido Urdaneta, Guillaume Pierre, Maarten van Steen
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

We study an access trace containing a sample of Wikipedia's traffic over a 107-day period aiming to identify appropriate replication and distribution strategies in a fully decentralized hosting environment. We perform a global analysis of the whole trace, and a detailed analysis of the requests directed to the English edition of Wikipedia. In our study, we classify client requests and examine aspects such as the number of read and save operations, significant load variations and requests for nonexisting pages. We also review proposed decentralized wiki architectures and discuss how they would handle Wikipedia's workload. We conclude that decentralized architectures must focus on applying techniques to efficiently handle read operations while maintaining consistency and dealing with typical issues on decentralized systems such as churn, unbalanced loads and malicious participating nodes.
Network-based prediction of metabolic enzymes' subcellular localization
Authors: Shira Mintz-Oron, Asaph Aharoni, Eytan Ruppin, Tomer Shlomi
Venue: Bioinformatics (2009)

Motivation: Revealing the subcellular localization of proteins within membrane-bound compartments is of a major importance for inferring protein function. Though current high-throughput localization experiments provide valuable data, they are costly and time-consuming, and due to technical difficulties not readily applicable for many Eukaryotes. Physical characteristics of proteins, such as sequence targeting signals and amino acid composition are commonly used to predict subcellular localizations using computational approaches. Recently it was shown that protein–protein interaction (PPI) networks can be used to significantly improve the prediction accuracy of protein subcellular localization. However, as high-throughput PPI data depend on costly high-throughput experiments and are currently available for only a few organisms, the scope of such methods is yet limited. Results: This study presents a novel constraint-based method for predicting subcellular localization of enzymes based on their embedding metabolic network, relying on a parsimony principle of a minimal number of cross-membrane metabolite transporters. In a cross-validation test of predicting known subcellular localization of yeast enzymes, the method is shown to be markedly robust, providing accurate localization predictions even when only 20% of the known enzyme localizations are given as input. It is shown to outperform pathway enrichment-based methods both in terms of prediction accuracy and in its ability to predict the subcellular localization of entire metabolic pathways when no a-priori pathway-specific localization data is available (and hence enrichment methods are bound to fail). With the number of available metabolic networks already reaching more than 600 and growing fast, the new method may significantly contribute to the identification of enzyme localizations in many different organisms. Contact:shira.mintz@weizmann.ac.il; tomersh@cs.technion.ac.il
Fostering Learning Communities among Teachers and Students: Potentials and Issues
Authors: Ching Sing Chai, Seng Chee Tan
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 explores some potentials and issues of fostering learning communities through Computer-Supported Collaborative Learning (CSCL) technology in Singapore classrooms. The subjects were eight teachers who attended a professional development course conducted at the National Institute of Education. The course focused on preparing teachers in integrating information technology into teaching and learning. CSCL, in particular, Knowledge Forum®, was adopted as a platform for online discussion and knowledge building on these technology integration issues. Interviews with these teachers and analysis of their online discussion suggest that they appreciate the knowledge building approach as a means for the students and themselves to learn beyond classroom and in promoting in-depth learning. However, the teachers felt that the approach was time consuming and was more suitable for high-ability students.
Location Diversity: Enhanced Privacy Protection in Location Based Services
Authors: Mingqiang Xue, Panos Kalnis, Hung Keng Pung
Venue: Proceedings of the 4th International Symposium on Location and Context Awareness (2009)

Location-based Services are emerging as popular applications in pervasive computing. Spatial k-anonymity is used in Location-based Services to protect privacy, by hiding the association of a specific query with a specific user. Unfortunately, this approach fails in many practical cases such as: (i) personalized services, where the user identity is required, or (ii) applications involving groups of users (e.g., employees of the same company); in this case, associating a query to any member of the group, violates privacy.In this paper, we introduce the concept of Location Diversity, which solves the above-mentioned problems. Location Diversity improves Spatial k-anonymity by ensuring that each query can be associated with at least ¿ different semantic locations (e.g., school, shop, hospital, etc). We present an attack model that maps each observed query to a linear equation involving semantic locations, and we show that a necessary condition to preserve privacy is the existence of infinite solutions in the resulting system of linear equations. Based on this observation, we develop algorithms that generate groups of semantic locations, which preserve privacy and minimize the expected query processing and communication cost. The experimental evaluation demonstrates that our approach reduces significantly the privacy threats, while incurring minimal overhead.