METRICC: Harnessing Comparable Corpora for Multilingual Lexicon Development

International audienceResearch on comparable corpora has grown in recent years bringing about the possibility of developing multilingual lexicons through the exploitation of comparable corpora to create corpus-driven multilingual dictionaries. To date, this issue has not been widely addressed. This paper focuses on the use of the mechanism of collocational networks proposed by Williams (1998) for exploiting comparable corpora. The paper first provides a description of the METRICC project, which is aimed at the automatically creation of comparable corpora and describes one of the crawlers developed for comparable corpora building, and then discusses the power of collocational networks for multilingual corpus-driven dictionary development

The Use of Gamification and Its Impact on Crowdfunding Participation:

This action research study examined how the use of two gamification tools (CreatiCUBE and Children Story Time) can increase the interest of venture capitalists to invest in the start-up company that designed both tools. Data were collected through interviews and field notes using convenience sampling. The eight participants in this study were people who had previous knowledge of and supported the two projects. The initial findings revealed that participants and potential investors were inclining to support Children Story Time rather than CreatiCUBE. The flexible nature of action research allowed a refocus of the study on the latter gamification tool. Four themes emerged from the analysis of data: 1) participants had no particular interest in funding; 2) funding was a byproduct of market demand; 3) Children Story Time was a market-disrupting tool; and 4) strategies emerged to secure venture capital investment. Three analytical theories shed light on the findings: Bourdieu’s cultural capital theory and Csikszentmikalyi’s flow and transactional leadership theories. Findings provide evidence that, to secure financial investment, startup entrepreneurs need to immerse in the cultural capital of their community and appeal to the support of close friends and family members to create a workable application, demonstrate the application has over 10,000 daily users, and hold a successful Kickstarter campaign

Hierarchical Sparse Coding for Wireless Link Prediction in an Airborne Scenario

We build a data-driven hierarchical inference model to predict wireless link quality between a mobile unmanned aerial vehicle (UAV) and ground nodes. Clustering, sparse feature extraction, and non-linear pooling are combined to improve Support Vector Machine (SVM) classification when a limited training set does not comprehensively characterize data variations. Our approach first learns two layers of dictionaries by clustering packet reception data. These dictionaries are used to perform sparse feature extraction, which expresses link state vectors first in terms of a few prominent local patterns, or features, and then in terms of co-occurring features along the flight path. In order to tolerate artifacts like small positional shifts in field-collected data, we pool large magnitude features among overlapping shifted patches within windows. Together, these techniques transform raw link measurements into stable feature vectors that capture environmental effects driven by radio range limitations, antenna pattern variations, line-of-sight occlusions, etc. Link outage prediction is implemented by an SVM that assigns a common label to feature vectors immediately preceding gaps of successive packet losses, predictions are then fed to an adaptive link layer protocol that adjusts forward error correction rates, or queues packets during outages to prevent TCP timeout. In our harsh target environment, links are unstable and temporary outages common, so baseline TCP connections achieve only minimal throughput. However, connections under our predictive protocol temporarily hold packets that would otherwise be lost on unavailable links, and react quickly when the UAV link is restored, increasing overall channel utilization.Engineering and Applied Science

Effective bootstrapping of Peer-to Peer networks over Mobile Ad-hoc networks

Mobile Ad-hoc Networks (MANETs) and Peer-to-Peer (P2P) networks are vigorous, revolutionary communication technologies in the 21st century. They lead the trend of decentralization. Decentralization will ultimately win clients over client/server model, because it gives ordinary network users more control, and stimulates their active participation. It is a determinant factor in shaping the future of networking. MANETs and P2P networks are very similar in nature. Both are dynamic, distributed. Both use multi-hop broadcast or multicast as major pattern of traffic. Both set up connection by self-organizing and maintain connection by self-healing. Embodying the slogan networking without networks, both abandoned traditional client/server model and disclaimed pre-existing infrastructure. However, their status quo levels of real world application are widely divergent. P2P networks are now accountable for about 50 ~ 70% internet traffic, while MANETs are still primarily in the laboratory. The interesting and confusing phenomenon has sparked considerable research effort to transplant successful approaches from P2P networks into MANETs. While most research in the synergy of P2P networks and MANETs focuses on routing, the network bootstrapping problem remains indispensable for any such transplantation to be realized. The most pivotal problems in bootstrapping are: (1) automatic configuration of nodes addresses and IDs, (2) topology discovery and transformation in different layers and name spaces. In this dissertation research, we have found novel solutions for these problems. The contributions of this dissertation are: (1) a non-IP, flat address automatic configuration scheme, which integrates lower layer addresses and P2P IDs in application layer and makes simple cryptographical assignment possible. A related paper entitled Pastry over Ad-Hoc Networks with Automatic Flat Address Configuration was submitted to Elsevier Journal of Ad Hoc Networks in May. (2) an effective ring topology construction algorithm which builds perfect ring in P2P ID space using only simplest multi-hop unicast or multicast. Upon this ring, popular structured P2P networks like Chord, Pastry could be built with great ease. A related paper entitled Chord Bootstrapping on MANETs - All Roads lead to Rome will be ready for submission after defense of the dissertation

Virtualisation pour Specialisation et Extension d'Environnements d'Execution

An application runtime is the set of software elements that represent an application during its execution. Application runtimes should be adaptable todifferent contexts. Advances in computing technology both in hardware and software indeed demand it. For example, on one hand we can think aboutextending a programming language to enhance the developers’ productivity.On the other hand we can also think about transparently reducing the memory footprint of applications to make them fit in constrained resourcescenarios e.g., low networks or limited memory availability. We propose Espell, a virtualization infrastructure for object-oriented high-level language runtimes. Espell provides a general purpose infrastructure to control and manipulate object-oriented runtimes in different situations. A first-class representation of an object-oriented runtime provides a high-level API for the manipulation of such runtime. A hypervisor uses this first-class object and manipulates it either directly or by executing arbitrary expressions into it. We show with our prototype that this infrastructure supports language bootstrapping and application runtime tailoring. Using bootstrapping we describe an object-oriented high-level language initialization in terms of itself. A bootstrapped language takes advantage of its own abstractions and is easier to extend. With application runtime tailoring we generate specialized applications by extracting the elements of a program that are used during execution. A tailored application encompasses only the classes and methods it needs and avoids the code bloat that appears from the usage of third-party libraries and frameworks.Un environnement d’exécution est l’ensemble des éléments logiciels qui représentent une application pendant son exécution. Les environnements d’exécution doivent être adaptables à différents contextes. Les progrès des technologies de l’information, tant au niveau logiciel qu’au niveau matériel, rendent ces adaptations nécessaires. Par exemple, nous pouvons envisager d’étendre un language de programmation pour améliorer la productivité des developpeurs. Aussi, nous pouvons envisager de réduire la consommation memoire des applications de manière transparente afin de les adapter à certaines contraintes d’exécution e.g., des réseaux lents ou de la mémoire limités.Nous proposons Espell, une infrastructure pour la virtualisation d’environnement d’execution de langages orienté-objets haut-niveau. Espell fournit une infrastructure généraliste pour le contrôle et la manipulation d’environnements d’exécution pour différentes situations. Une représentation de ’premier-ordre’ de l’environnement d’exécution orienté objet fournit une interface haut-niveau qui permet la manipulation de ces environnements. Un hyperviseur est client de cette représentation de ’premier-ordre’ et le manipule soit directement, soit en y exécutant des expressions arbitraires. Nous montrons au travers de notre prototype que cet infrastructure supporte le bootstrapping (i.e., l’amorçage ou initialisation circulaire) des languages et le tailoring (i.e., la construction sur-mesure ou ’taille’) d’environnement d’exécution. En utilisant l’amorçage nous initialisons un language orienté-objet haut-niveau qui est auto-décrit. Un langage amorcé profite des ses propres abstractions se montrant donc plus simple à étendre. La taille d’environnements d’exécution est une technique qui génère une application spécialisé en extrayant seulement le code utilisé pendant l’exécution d’un programme. Une application taillée inclut seulement les classes et méthodes qu’elle nécessite, et évite que des librairies et desframeworks externes surchargent inutilement la base de code

Three Essays on Trust Mining in Online Social Networks

This dissertation research consists of three essays on studying trust in online social networks. Trust plays a critical role in online social relationships, because of the high levels of risk and uncertainty involved. Guided by relevant social science and computational graph theories, I develop conceptual and predictive models to gain insights into trusting behaviors in online social relationships. In the first essay, I propose a conceptual model of trust formation in online social networks. This is the first study that integrates the existing graph-based view of trust formation in social networks with socio-psychological theories of trust to provide a richer understanding of trusting behaviors in online social networks. I introduce new behavioral antecedents of trusting behaviors and redefine and integrate existing graph-based concepts to develop the proposed conceptual model. The empirical findings indicate that both socio-psychological and graph-based trust-related factors should be considered in studying trust formation in online social networks. In the second essay, I propose a theory-based predictive model to predict trust and distrust links in online social networks. Previous trust prediction models used limited network structural data to predict future trust/distrust relationships, ignoring the underlying behavioral trust-inducing factors. I identify a comprehensive set of behavioral and structural predictors of trust/distrust links based on related theories, and then build multiple supervised classification models to predict trust/distrust links in online social networks. The empirical results confirm the superior fit and predictive performance of the proposed model over the baselines. In the third essay, I propose a lexicon-based text mining model to mine trust related user-generated content (UGC). This is the first theory-based text mining model to examine important factors in online trusting decisions from UGC. I build domain-specific trustworthiness lexicons for online social networks based on related behavioral foundations and text mining techniques. Next, I propose a lexicon-based text mining model that automatically extracts and classifies trustworthiness characteristics from trust reviews. The empirical evaluations show the superior performance of the proposed text mining system over the baselines

English job titles in Italian. The case of Manager and Engineer

Abstract - In a globalized job market, the use of English job titles to advertise vacancies and positions in non-English-speaking countries is becoming increasingly frequent. This trend seems to be primarily motivated by the desire to give jobs an international appeal. While some job titles fill lexical gaps and are successfully integrated, others enter in competition with national equivalents, generating ‘multiple terminology’ in the receiving languages. The aim of this paper is to identify the stylistic and pragmatic reasons which determine the success of an Anglicism in the receiving language, despite the existence of a domestic equivalent. To this end, we have conducted a linguistic analysis of two terms used in the Italian job market – manager and engineer – which have entered the Italian language in the same historical period (end of the 19th century). However, manager has developed into a very successful general purpose term in Italian, generating a wide range of compounds, vice versa engineer has given rise to several compounds but has not been integrated as a standalone lexical item. Our data indicates that the reasons for the success of manager are linked to its equivalents not being domain-specific, whereas for engineer the existence of the Italian cognate ingegnere, formally similar but semantically different, prevents the assimilation of this Anglicism. The data discussed are drawn from general and specialized dictionaries, official descriptions of occupations in Italian and in English, and from web corpora queried through the Sketch Engine system.Abstract - In un mercato del lavoro globalizzato è frequente che i nomi delle professioni utilizzati negli annunci di lavoro, anche in paesi non anglofoni, siano in inglese. Questa tendenza sembra essere principalmente motivata dal desiderio di attribuire al lavoro un carattere internazionale. Mentre alcuni titoli sopperiscono a vuoti lessicali e vengono integrati con successo nella lingua ricevente, altri entrano in competizione con equivalenti nativi, dando così origine a casi di terminologia multipla. Questo studio mira a identificare le ragioni stilistiche e pragmatiche che stanno alla base del successo di un anglicismo in una lingua ricevente, laddove esista già un equivalente. A questo scopo abbiamo analizzato due termini utilizzati nel mercato del lavoro italiano – manager e engineer – entrati nella lingua nel medesimo periodo storico (fine del XIX secolo). Manager ha avuto notevole successo, diventando un termine multiuso che ha generato una vasta gamma composti; al contrario engineer ha dato origine a qualche composto, ma non è stato integrato come prestito in italiano. I nostri dati indicano che le cause del successo di manager sono da ricondursi al fatto che gli equivalenti italiani non sono termini specialistici. L’esistenza del corradicale ingegnere, formalmente simile ma semanticamente diverso da engineer, ostacola l’assimilazione dell’anglicismo. I dati sono stati raccolti attraverso lo spoglio di dizionari generali e specialistici, di descrizioni ufficiali delle professioni in italiano e in inglese, e di corpora creati dal web e interrogati attraverso il software SketchEngine