ppxscal/embedding_network huggingface dataset:
NLP serving the cause of language learning
Authors: Frédérique Segond, Thibault Parmentier
Venue: Proceedings of the Workshop on eLearning for Computational Linguistics and Computational Linguistics for eLearning (2004)

E-learning paves the way to a new type of course, more student centred, granulized, on demand, and highly interactive. Natural Language Processing (NLP) technologies associated with other multimedia technologies can help to address the major issues raised by this new type of courses: interaction, personalization and reliable information access. This paper presents Exills, a true e-learning solution which integrates natural language processing tools and virtual reality. Exills is unique in that unlike most of the language learning systems, it focuses on improving learners' performance rather than learners' competence.
Extension of OWL with Dynamic Fuzzy Logic
Authors: Zhiming Cui, Wei Fang, Xuefeng Xian, Shukui Zhang, Pengpeng Zhao
Venue: Advances in Web and Network Technologies, and Information Management: APWeb/WAIM 2009 International Workshops: WCMT 2009, RTBI 2009, DBIR-ENQOIR 2009, PAIS 2009, Suzhou, China, April 2-4, 2009, Revised Selected Papers (2009)

In recent years, ontology has played a major role in knowledge representation. Ontology languages are based on description logics. Though they are expressive enough, they cannot express and reason with fuzzy and dynamic knowledge on the Semantic Web. To deal with uncertain and dynamic knowledge on the Semantic Web and its applications, a new fuzzy extension of description logics,OWL and Ontology based on Dynamic fuzzy logic called the dynamic Description logics(DFDL), dynamic fuzzy Ontology(DFO) and dynamic fuzzy OWL (DFOWL) are presented. The syntax and semantics of DFDL, DFO and DFOWL are formally defined, and the forms of axioms and assertions are specified. The research indicates the DFOWL provides more expressive power for the Semantic Web, and overcomes the insufficiency of OWL as the ontology language for the Semantic Web.
Ubi-Check: A Pervasive Integrity Checking System
Authors: Michel Banâtre, Fabien Allard, Paul Couderc
Venue: Proceedings of the 9th International Conference on Smart Spaces and Next Generation Wired/Wireless Networking and Second Conference on Smart Spaces (2009)

Integrity checking is an important concern in many activities, such as logistic, telecommunication or even day to day tasks such as checking for someone missing in a group. While the computing and telecommunication worlds commonly use digital integrity checking, many activities from the real world do not beneficiate from automatic mechanisms for ensuring integrity. RFID technology offer promising perspectives for this problem, but also raises strong privacy concerns as they are usually based on global identification and tracking. In this paper we present an alternative approach, Ubi-Check, based on the concept of coupled physical objects which enable integrity checking relying only on local interactions, without the support of a global information system.
User-centric image segmentation using an interactive parameter adaptation tool
Authors: Olivier Pauplin, Praminda Caleb-Solly, Jim Smith
Venue: Pattern Recognition (2010)

Creating successful machine vision systems often begins a process of developing customised reliable image segmentation algorithms for the detection, and possibly categorisation of regions of interest within images. This can require significant investment of time from both the image processing and the domain experts to set up. Frequently this process is mediated via interviews, or language-based systems which may not fully capture the visual decision-making process of the domain experts. The resulting algorithms can also often be ''brittle'' in the sense of being highly specialised to the task for which they are tuned, and are consequently sensitive to changes in operating conditions or image specifications. One approach is to use interactive evolution for developing rapidly reconfigurable systems in which the users' tacit knowledge and requirements can be elicited and used for finding the appropriate parameters to achieve the required segmentation without any need for specialised knowledge of the underlying machine vision systems. This paper presents an interactive tool that can be used to quickly and easily evolve optimal image segmentation parameters from scratch. Building on previous work, the new algorithm reported here incorporates user-guided local search and makes the fitness function more flexible to facilitate the underlying multi-objective decision-making process. One of the key requirements for any interactive system is a high level of usability, both in terms of effectiveness-being able to build accurate models that meet end-user requirements-and efficiency-being able to achieve the required results within a minimal amount of time and undue effort. The system described in this paper has been designed with these considerations in mind to ensure a high level of user-experience of the interaction process. We present results from a series of experiments with a range of users to analyse the effect of the improvements that have been made over the previous system. The efficiency of the tool is also tested with ''novice users'', and its usability by ''novice users'' is analysed.
The limit of the partial sums process of spatial least squares residuals
Authors: Wolfgang Bischoff, Wayan Somayasa
Venue: Journal of Multivariate Analysis (2009)

We establish a functional central limit theorem for a sequence of least squares residuals of spatial data from a linear regression model. Under mild assumptions on the model we explicitly determine the limit process in the case where the assumed linear model is true. Moreover, in the case where the assumed linear model is not true we explicitly establish the limit process for the localized true regression function under mild conditions. These results can be used to develop non-parametric model checks for linear regression. Our proofs generalize ideas of a univariate geometrical approach due to Bischoff [W. Bischoff, The structure of residual partial sums limit processes of linear regression models, Theory Stoch. Process. 8 (24) (2002) 23-28] which is different to that proposed by MacNeill and Jandhyala [I.B. MacNeill, V.K. Jandhyala, Change-point methods for spatial data, in: G.P. Patil, et al. (Eds.), Multivariate Environmental Statistics. Papers Presented at the 7th International Conference on Multivariate Analysis held at Pennsylvania State University, University Park, PA, USA, May 5-9 1992, in: Ser. Stat. Probab., vol. 6, North-Holland, Amsterdam, 1993, pp. 289-306 (in English)]. Moreover, Xie and MacNeill [L. Xie, I.B. MacNeill, Spatial residual processes and boundary detection, South African Statist. J. 40 (1) (2006) 33-53] established the limit process of set indexed partial sums of regression residuals. In our framework we get that result as an immediate consequence of a result of Alexander and Pyke [K.S. Alexander, R. Pyke, A uniform central limit theorem for set-indexed partial-sum processes with finite variance, Ann. Probab. 14 (1986) 582-597]. The reason for that is that by our geometrical approach we recognize the structure of the limit process: it is a projection of the Brownian sheet onto a certain subspace of the reproducing kernel Hilbert space of the Brownian sheet. Several examples are discussed.
Qualitative Determinacy and Decidability of Stochastic Games with Signals
Authors: Nathalie Bertrand, Blaise Genest, Hugo Gimbert
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning strategies, under reachability, safety, Buchi or co-Buchi winning objectives. We prove two qualitative determinacy results. First, in a reachability game either player $1$ can achieve almost-surely the reachability objective, or player 2 can ensure surely the complementary safety objective, or both players have positively winning strategies. Second, in a Buchi game if player 1 cannot achieve almost-surely the Buchi objective, then player 2 can ensure positively the complementary co-Buchi objective. We prove that players only need strategies with finite-memory, whose sizes range from no memory at all to doubly-exponential number of states, with matching lower bounds. Together with the qualitative determinacy results, we also provide fix-point algorithms for deciding which player has an almost-surely winning or a positively winning strategy and for computing the finite memory strategy. Complexity ranges from EXPTIME to 2-EXPTIME with matching lower bounds, and better complexity can be achieved for some special cases where one of the players is better informed than her opponent.
Runtime Protection via Dataflow Flattening
Authors: Bertrand Anckaert, Mariusz H. Jakubowski, Ramarathnam Venkatesan, Chit Wei (Nick) Saw
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Software running on an open architecture, such as the PC, is vulnerable to inspection and modification. Since software may process valuable or sensitive information, many defenses against data analysis and modification have been proposed.This paper complements existing work and focuses on hiding data location throughout program execution. To achieve this, we combine three techniques: (i) periodic reordering of the heap, (ii) migrating local variables from the stack to the heap and (iii) pointer scrambling. By essentially flattening the dataflow graph of the program, the techniques serve to complicate static dataflow analysis and dynamic data tracking. Our methodology can be viewed as a data-oriented analogue of control-flow flattening techniques.Dataflow flattening is useful in practical scenarios like DRM, information-flow protection, and exploit resistance. Our prototype implementation compiles C programs into a binary for which every access to the heap is redirected through a memory management unit. Stack-based variables may be migrated to the heap, while pointer accesses and arithmetic may be scrambled and redirected. We evaluate our approach experimentally on the SPEC CPU2006 benchmark suite.
Documenting software systems with views VI: lessons learned from 15 years of research & practice
Authors: Scott Tilley
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

A "view" is a form of graphical documentation representing some aspect of a software system. Views can be an important aid in helping to understand large-scale applications, and can be automatically produced through reverse engineering. This paper summarizes our findings and lessons learned related to documenting software systems with views from numerous projects spanning 15 years of research and practice (1992-2007). These findings have continued relevancy for modern software development and technical communication alike.
Proper name classification in an information extraction toolset
Authors: Peter Wallis, Edmund Yuen, Greg Chase
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

Applied discourse analysis is a hot topic in Information Retrieval (IR) and the related field of Information Extraction (IE). Although interesting observations about discourse can be made "by hand," applications require large quantities of data about language --- data which is rather uninteresting. This paper investigates using statistical analysis over a body of text to suggest new rules for recognizing named entities.
Human judgment as a parameter in evaluation campaigns
Authors: Jean-Baptiste Berthelin, Cyril Grouin, Martine Hurault-Plantet, Patrick Paroubek
Venue: Proceedings of the Workshop on Human Judgements in Computational Linguistics (2008)

The relevance of human judgment in an evaluation campaign is illustrated here through the DEFT text mining campaigns. In a first step, testing a topic for a campaign among a limited number of human evaluators informs us about the feasibility of a task. This information comes from the results obtained by the judges, as well as from their personal impressions after passing the test. In a second step, results from individual judges, as well as their pairwise matching, are used in order to adjust the task (choice of a marking scale for DEFT'07 and selection of topical categories for DEFT'08). Finally, the mutual comparison of competitors' results, at the end of the evaluation campaign, confirms the choices we made at its starting point, and provides means to redefine the task when we shall launch a future campaign based on the same topic.
An Adaptive Meta-cognitive Artificial Fish School Algorithm
Authors: Xu Hongrui, Li Ran, Guo Jianli, Wang Hongru
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Artificial Fish School Algorithm (AFSA) is a novel optimizing method. Based on the study of this algorithm, to deal with the problem of low optimizing precision and low speed of convergence in the later period of the optimization, this paper proposed a novel AFSA called adaptive meta-cognitive Artificial Fish School Algorithm(AMAFSA). The new algorithm constructed an improved Artificial Fish model based on meta-cognition, which could make self-study by using its knowledge of the surrounding environment. To speed up the convergence, the algorithm improved on the meta-cognitive ability of Artificial Fish; To advance the precision, it changed parameters self-adaptively. Experimental simulations showed that the proposed method can not only significantly speed up the convergence ,but also can find the global optimization accurately.
Rough Geometry and Its Applications in Character Recognition
Authors: Xiaodong Yue, Duoqian Miao
Venue: Transactions on Rough Sets X (2009)

The absolutely abstract and accurate geometric elements defined in Euclidean geometry always have lengths or sizes in reality. While the figures in the real world should be viewed as the approximate descriptions of traditional geometric elements at the rougher granular level. How can we generate and recognize the geometric features of the configurations in the novel space? Motivated by this question, rough geometry is proposed as the result of applying the rough set theory to the traditional geometry. In the new theory, the geometric configuration can be constructed by its upper approximation at different levels of granularity and the properties of the rough geometric elements should offer us a new perspective to observe the figures. In this paper, we focus on the foundation of the theory and try to observe the topologic features of the approximate configuration at multiple granular levels in rough space. Then we also attempt to apply the research results to the problems in different areas for novel solutions, such as the applications of rough geometry in the traditional geometric problem (the question whether there exists a convex shape with two distinct equichordal points) and the recognition work with principal curves. Finally, we will describe the questions induced from our exploratory research and discuss the future work.
The Complexity of Circumscriptive Inference in Post's Lattice
Authors: Michael Thomas
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which allows to conclude that the facts derivable from a given knowledge base are all facts that satisfy a given property. In this paper, we study the computational complexity of several formalizations of inference in propositional circumscription for the case that the knowledge base is described by a propositional theory using only a restricted set of Boolean functions. To systematically cover all possible sets of Boolean functions, we use Post's lattice. With its help, we determine the complexity of circumscriptive inference for all but two possible classes of Boolean functions. Each of these problems is shown to be either ${\Pi^{\rm p}_{2}}$-complete, coNP-complete, or contained in L.In particular, we show that in the general case, unless P = NP, only literal theories admit polynomial-time algorithms, while for some restricted variants the tractability border is the same as for classical propositional inference. 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
Nonce Generators and the Nonce Reset Problem
Authors: Erik Zenner
Venue: Proceedings of the 12th International Conference on Information Security (2009)

A nonce is a cryptographic input value which must never repeat within a given context. Nonces are important for the security of many cryptographic building blocks, such as stream ciphers, block cipher modes of operation, and message authentication codes. Nonetheless, the correct generation of nonces is rarely discussed in the cryptographic literature.In this paper, we collect a number of nonce generators and describe their cryptographic properties. In particular, we derive upper bounds on the nonce collision probabilities of nonces that involve a random component, and lower bounds on the resulting nonce lengths.We also discuss an important practical vulnerability of nonce-based systems, namely the nonce reset problem. While ensuring that nonces never repeat is trivial in theory, practical systems can suffer from accidental or even malicious resets which can wipe out the nonce generators current state. After describing this problem, we compare the resistance of the nonce generators described to nonce resets by again giving formal bounds on collision probabilities and nonce lengths.The main purpose of this paper is to provide a help for system designers who have to choose a suitable nonce generator for their application. Thus, we conclude by giving recommendations indicating the most suitable nonce generators for certain applications.
Using a maximum entropy model to build segmentation lattices for MT
Authors: Chris Dyer
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

Recent work has shown that translating segmentation lattices (lattices that encode alternative ways of breaking the input to an MT system into words), rather than text in any particular segmentation, improves translation quality of languages whose orthography does not mark morpheme boundaries. However, much of this work has relied on multiple segmenters that perform differently on the same input to generate sufficiently diverse source segmentation lattices. In this work, we describe a maximum entropy model of compound word splitting that relies on a few general features that can be used to generate segmentation lattices for most languages with productive compounding. Using a model optimized for German translation, we present results showing significant improvements in translation quality in German-English, Hungarian-English, and Turkish-English translation over state-of-the-art baselines.
Software Artifacts Management Based on Dataspace
Authors: Pan Ying, Tang Yong, Ye Xiaoping
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Establish and maintain software artifact traceability is widely recognized as one of the major challenges in software engineering research. Because of the lack of automatic or semi-automatic methodologies and technologies, traceability information is often out of date or completely missing as the software changes. We present a framework for software artifacts management based on dataspace. The characteristics of dataspace are extremely advantageous to manage the lifecycle of software artifacts, support all different artifact structure, and support automatic or semi-automatic traceability recovery and maintenance. Moreover, utilizing the existing software engineering ontologies, the system can “understand” software artifacts and traceability among them more easily.
A Priority-Based Multiservice Dynamic Bandwidth Allocation for Ethernet Passive Optical Networks
Authors: Minh Thanh Ngo, Annie Gravey
Venue: Traffic Management and Traffic Engineering for the Future Internet: First Euro-NF Workshop, FITraMEn 2008, Porto, Portugal, December 11-12, Revised Selected Papers (2009)

One of the most cost-effective solutions to meet the explosive increase in bandwidth demand is a Passive Optical Network (PON). This technology is intended to offer a simple, scalable solution which is capable of delivering multiservice access to end-customers. Standards for PONs have been approved, but QoS provisioning and bandwidth distribution within a PON have been left to the implementer. In particular, many proposals have focused on the central issue of upstream traffic management in PONs. Upstream traffic management relies on a Dynamic Bandwidth Allocation (DBA) mechanism that distributes transmission opportunities to the end users, based on their requirements. An ideal DBA should support both Committed Bandwidth (CB) and Best Effort (BE) services, with a good control of the usual QoS characteristics (delay, jitter, and loss) while utilizing the available bandwidth with a good efficiency. The present paper presents a simulation based analysis that shows how a simple priority based DBA meets these requirements, and outperforms several of the better known DBA proposals. abstract environment.
Proceedings of the Workshop on Embodied Language Processing
Venue: ACL Workshops (2007)

Welcome to the ACL 2007 workshop on Embodied Natural Language. There has been a growing interest within the ACL community in extending the traditional focus on text and speech beyond the confines of natural language towards the inclusion of paralinguistic and non-verbal modes of communication, and beyond the confines of task-oriented language towards the inclusion of social and psychological variables such as attitude and affect. Studies of embodied dialogue systems, emotional expressiveness in speech, and personality detection in text are just a few examples of such research. These new extensions to computational linguistics have found a home in a number of different applications, from analysis of military videos to the development of Ambient Intelligent applications, where natural modes of interaction between humans and machines are envisioned that exploit the full bandwidth of human communication. These studies in embodied language processing have close connections with other fields of inquiry such as Affective Computing and Embodied Conversational Agents. In all of these fields the many modalities through which we communicate besides language, such as facial expressions, gestures, and posture, play a prominent role. These and other related studies of nonverbal language processing offer complementary insights to traditional work in computational linguistics. After all, human-human communication is inherently multimodal, and unimodal spoken communication is really just an artifact of communications technology, specifically the telephone ... so surely the mechanisms of speech and language processing need to apply not just to word sequences but to natural (multimodal) human language distributed over multiple input streams (speech, hand gesture, gaze ...). It is increasingly clear that integrating the theories, models and algorithms developed in areas such as these with work in mainstream CL, will lead to a richer processing model of natural communication.