215 research outputs found
Graphs whose indecomposability graph is 2-covered
Given a graph , a subset of is an interval of provided
that for any and , if and only
if . For example, , and are
intervals of , called trivial intervals. A graph whose intervals are trivial
is indecomposable; otherwise, it is decomposable. According to Ille, the
indecomposability graph of an undirected indecomposable graph is the graph
whose vertices are those of and edges are the unordered
pairs of distinct vertices such that the induced subgraph is indecomposable. We characterize the indecomposable
graphs whose admits a vertex cover of size 2.Comment: 31 pages, 5 figure
Recognition and translation Arabic-French of Named Entities: case of the Sport places
The recognition of Arabic Named Entities (NE) is a problem in different
domains of Natural Language Processing (NLP) like automatic translation.
Indeed, NE translation allows the access to multilingual in-formation. This
translation doesn't always lead to expected result especially when NE contains
a person name. For this reason and in order to ameliorate translation, we can
transliterate some part of NE. In this context, we propose a method that
integrates translation and transliteration together. We used the linguis-tic
NooJ platform that is based on local grammars and transducers. In this paper,
we focus on sport domain. We will firstly suggest a refinement of the
typological model presented at the MUC Conferences we will describe the
integration of an Arabic transliteration module into translation system.
Finally, we will detail our method and give the results of the evaluation
Querying heterogeneous data in NoSQL document stores
La problĂ©matique de cette thĂšse porte sur l'interrogation de donnĂ©es hĂ©tĂ©rogĂšnes dans les systĂšmes de stockage "not-only SQL" (noSQL) orientĂ©s documents. Ces derniers ont connu un important dĂ©veloppement ces derniĂšres annĂ©es en raison de leur capacitĂ© Ă gĂ©rer de maniĂšre flexible et efficace d'importantes masses de documents. Ils reposent sur le principe "schema-less" consistant Ă ne plus considĂ©rer un schĂ©ma unique pour un ensemble de donnĂ©es, appelĂ© collection de documents. Cette flexibilitĂ© dans la structuration des donnĂ©es complexifie l'interrogation pour les utilisateurs qui doivent connaĂźtre l'ensemble des diffĂ©rents schĂ©mas des donnĂ©es manipulĂ©es lors de l'Ă©criture de requĂȘtes. Les travaux dĂ©veloppĂ©s dans cette thĂšse sont menĂ©s dans le cadre du projet neoCampus. Ils se focalisent sur l'interrogation de documents structurellement hĂ©tĂ©rogĂšnes, en particulier sur le problĂšme de schĂ©mas variables. Nous proposons la construction d'un dictionnaire de donnĂ©es qui permet de retrouver tous les schĂ©mas des documents. Chaque clef, entrĂ©e du dictionnaire, correspond Ă un chemin absolu ou partiel existant dans au moins un document de la collection. Cette clef est associĂ©e aux diffĂ©rents chemins absolus correspondants dans l'ensemble de la collection de documents. Le dictionnaire est alors exploitĂ© pour rĂ©Ă©crire de maniĂšre automatique et transparente les requĂȘtes des utilisateurs. Les requĂȘtes utilisateurs sont Ă©tablies sur la base des clĂ©s du dictionnaire (chemins partiels ou absolus) et sont automatiquement rĂ©Ă©crites en exploitant le dictionnaire afin de prendre en compte l'ensemble des chemins absolus existants dans les documents de la collection. Dans cette thĂšse, nous menons une Ă©tude de l'Ă©tat de l'art des travaux s'attachant Ă rĂ©soudre l'interrogation de documents structurellement hĂ©tĂ©rogĂšnes, et nous en proposons une classification. Ensuite, nous comparons ces travaux en fonction de critĂšres qui permettent de positionner et diffĂ©rencier notre contribution. Nous dĂ©finissions formellement les concepts classiques liĂ©s aux systĂšmes orientĂ©s documents (document, collection, etc), puis nous Ă©tendons cette formalisation par des concepts supplĂ©mentaires : chemins absolus et partiels, schĂ©mas de document, dictionnaire. Pour la manipulation et l'interrogation des documents, nous dĂ©finissons un noyau algĂ©brique minimal fermĂ© composĂ© de cinq opĂ©rateurs : sĂ©lection, projection, des-imbrication (unnest), agrĂ©gation et jointure (left-join). Nous dĂ©finissons chaque opĂ©rateur et expliquons son Ă©valuation par un moteur de requĂȘte classique. Ensuite, nous Ă©tablissons la rĂ©Ă©criture de chacun des opĂ©rateurs Ă partir du dictionnaire. Nous dĂ©finissons le processus de rĂ©Ă©criture des requĂȘtes utilisateurs qui produit une requĂȘte Ă©valuable par un moteur de requĂȘte classique en conservant la logique des opĂ©rateurs classiques (chemins inexistants, valeurs nulles). Nous montrons comment la rĂ©Ă©criture d'une requĂȘte initialement construite avec des chemins partiels et/ou absolus permet de rĂ©soudre le problĂšme d'hĂ©tĂ©rogĂ©nĂ©itĂ© structurelle des documents.
Enfin, nous menons des expĂ©rimentations afin de valider les concepts formels que nous introduisons tout au long de cette thĂšse. Nous Ă©valuons la construction et la maintenance du dictionnaire en changeant la configuration en termes de nombre de structures par collection Ă©tudiĂ©e et de taille de collection. Puis, nous Ă©valuons le moteur de rĂ©Ă©criture de requĂȘtes en le comparant Ă une Ă©valuation de requĂȘte dans un contexte sans hĂ©tĂ©rogĂ©nĂ©itĂ© structurelle puis dans un contexte de multi-requĂȘtes. Toutes nos expĂ©rimentations ont Ă©tĂ© menĂ©es sur des collection synthĂ©tiques avec plusieurs niveaux d'imbrications, diffĂ©rents nombres de structure par collection, et diffĂ©rentes tailles de collections. RĂ©cemment, nous avons intĂ©grĂ© notre contribution dans le projet neOCampus afin de gĂ©rer l'hĂ©tĂ©rogĂ©nĂ©itĂ© lors de l'interrogation des donnĂ©es de capteurs implantĂ©s dans le campus de l'universitĂ© Toulouse III-Paul Sabatier.This thesis discusses the problems related to querying heterogeneous data in document-oriented systems. Document-oriented "not-only SQL" (noSQL) storage systems have undergone significant development in recent years due to their ability to manage large amounts of documents in a flexible and efficient manner. These systems rely on the "schema-less" concept where no there is no requirement to consider a single schema for a set of data, called a collection of documents. This flexibility in data structures makes the query formulation more complex and users need to know all the different schemas of the data manipulated during the query formulation. The work developed in this thesis subscribes into the frame of neOCampus project. It focuses on issues in the manipulation and the querying of structurally heterogeneous document collections, mainly the problem of variable schemas. We propose the construction of a dictionary of data that makes it possible to find all the schemas of the documents. Each key, a dictionary entry, corresponds to an absolute or partial path existing in at least one document of the collection. This key is associated to all the corresponding absolute paths throughout the collection of heterogeneous documents. The dictionary is then exploited to automatically and transparently reformulate queries from users. The user queries are formulated using the dictionary keys (partial or absolute paths) and are automatically reformulated using the dictionary to consider all the existing paths in all documents in the collection. In this thesis, we conduct a state-of-the-art survey of the work related to solving the problem of querying data of heterogeneous structures, and we propose a classification. Then, we compare these works according to criteria that make it possible to position our contribution. We formally define the classical concepts related to document-oriented systems (document, collection, etc). Then, we extend this formalisation with additional concepts: absolute and partial paths, document schemas, dictionary. For manipulating and querying heterogeneous documents, we define a closed minimal algebraic kernel composed of five operators: selection, projection, unnest, aggregation and join (left join). We define each operator and explain its classical evaluation by the native document querying engine. Then we establish the reformulation rules of each of these operators based on the use of the dictionary. We define the process of reformulating user queries that produces a query that can be evaluated by most document querying engines while keeping the logic of the classical operators (misleading paths, null values). We show how the reformulation of a query initially constructed with partial and/or absolute paths makes it possible to solve the problem of structural heterogeneity of documents. Finally, we conduct experiments to validate the formal concepts that we introduce throughout this thesis. We evaluate the construction and maintenance of the dictionary by changing the configuration in terms of number of structures per collection studied and collection size. Then, we evaluate the query reformulation engine by comparing it to a query evaluation in a context without structural heterogeneity and then in a context of executing multiple queries. All our experiments were conducted on synthetic collections with several levels of nesting, different numbers of structures per collection, and on varying collection sizes. Recently, we deployed our contributions in the neOCampus project to query heterogeneous sensors data installed at different classrooms and the library at the campus of the university of Toulouse III-Paul Sabatier
A restorative environment for the elderly
A growing number of people are getting very old. Experience says that after the age of 80 humans meet a growing need for assistance with daily care and activities and this may be the beginning of a negative spiral of passivity and social isolation.
The purpose of this work is to investigate if it is possible to create a restorative garden on a rooftop in a large city and to investigate if it by mean of a welcoming atmosphere, appropriate design and meaningful activities can contribute to a better quality of life for the elderly users.
On the basis of theories of environmental psychology and horticultural therapy, an inquiry and an asking guide for interviews with inhabitants and staff at the assisted dwelling center of RĂ„gsved, Stockholm was developed. The purpose was to investigate to which degree the design of The Restorative Garden of RĂ„gsved could satisfy the needs of the different groups of users regarding restorative environment, home-feeling, social and physical activities and accessibility.
The result is that it is possible to create a restorative environment at a low cost. However, to use the full potential of the environment, it is necessary to put the focus on education and motivation of staff and volunteers
Plegadognathus bonariensis (Acari: Halacaridae): First halacarid mite report from Qatar
In this study, the genus Plegadognathus Morselli, 1981 with the species P. bonariensis. Viets, 1936) is recorded from Qatar for the first time. Diagnoses for the genus Plegadognathus and the short description of female of P. bonariensis are given with original illustrationsThis work has been conducted under the framework of the project NPRP7-1129-1-201, funded by the
Qatar National Research Fund (a member of The Qatar Foundation)
Multilingual Extraction of functional relations between Arabic Named Entities using NooJ platform
10 pagesInternational audienceThe extraction of relation between Named Entities (NE) has become the last few years an interesting research domain. It is very useful for many applications such as Web mining, Information extraction and retrieval, Business intelligence, Automatic databases filing with Entities & types, Questions answering task and document Summarization. Several works has been performed for relation discovery in texts written in Latin languages and as far as we know, very few works has been done for Arabic language. In this paper, we focus on functional relations between ENAMEX and ORG Arabic Named Entities. The extraction approach is rule based and the implementation is performed using NooJ Platform
- âŠ