1,346 research outputs found

    Le Renouvellement d’un mot ou le Luxe selon Colette

    Get PDF
    Les nécessités du métier de journaliste ont conduit Colette à s'interroger sur les modes et en particulier sur tout ce qui touche aux industries de luxe. Ce faisant, en bon artiste-artisan, elle ne peut s'empêcher d'infléchir le sens ordinaire de luxe pour en faire une sorte de mot poétique autour duquel se regroupent en réseaux les grands motifs de son oeuvre, et l'art d'ajuster cette oeuvre aux beautés de «l'univers tangible et poétique» dont elle propose la représentation. S'il existe une industrie de luxe, il existe aussi pour Colette une écriture du luxe; elle nous invite ainsi à communier avec elle dans une célébration qui est la marque de son originalité.The practice of journalism led Colette to ponder the notion of fashionable trends and to pay particular attention to anything related to the induxtry of luxury . In the process, the clever artist-artisan that she was could not help but inflect the conventional meaning of the word luxury towards a poetic signification around which are grouped the dominant motifs of her writings as well as the art of harmonizing these writings to the beauty of "the tangible and poetic universe" she tried to depict. Acknowledging the existence of a luxury industry, Colette has fashioned a style of writing luxury by means of which she invites the reader to partake of a celebration emblematic of her originality

    Extraction de la localisation des termes pour le classement des documents

    Get PDF
    http://editions-rnti.fr/?inprocid=1000269International audienceTrouver et classer les documents pertinents par rapport à une requête est fondamental dans le domaine de la recherche d'information. Notre étude repose sur la localisation des termes dans les documents. Nous posons l'hypothèse que plus les occurrences des termes d'une requête se retrouvent proches dans un document alors plus ce dernier doit être positionné en tête de la liste de réponses. Nous présentons deux variantes de notre modèle à zone d'influence, la première est basée sur une notion de proximité floue et la seconde sur une notion de pertinence locale

    Fuzzy term proximity with boolean queries at 2006 TREC Terabyte task

    Get PDF
    http://trec.nist.gov/pubs/trec15/papers/ecole.tera.final.pdfInternational audienceWe report here the results of fuzzy term proximity method app lied to Terabyte Task. Fuzzy proxmity main feature is based on the idea that the clos er the query terms are in a document, the more relevant this document is. With this p rinciple, we have a high precision method so we complete by these obtained with Zettair search engine default method (dirichlet). Our model is able to deal with Boolean qu eries, but contrary to the traditional extensions of the basic Boolean IR model, it does not explicitly use a proximity operator because it can not be generalized to node s. The fuzzy term proximity is controlled with an influence function. Given a query term a nd a document, the influence function associates to each position in the text a value depe ndant of the distance of the nearest occurence of this query term. To model proximity, th is function is decreasing with distance. Different forms of function can be used: triangula r, gaussian etc. For practical reasons only functions with finite support were used. The sup port of the function is limited by a constant called k. The fuzzy term proximity func tions are associated to every leaves of the query tree. Then fuzzy proximities are co mputed for every nodes with a post-order tree traversal. Given the fuzzy proximities of the sons of a node, its fuzzy proximity is computed, like in the fuzzy IR models, with a mim imum (resp. maximum) combination for conjunctives (resp. disjunctives) nodes. Finally, a fuzzy query proximity value is obtained for each position in this document at the ro ot of the query tree. The score of this document is the integration of the function obt ained at the tree root. For the experiments, we modify Lucy (version 0.5.2) to implement ou r matching function. Two query sets are used for our runs. One set is manually built wit h the title words (and sometimes some description words). Each of these words is OR 'ed with its derivatives like plurals for instance. Then the OR nodes obtained are AND'ed a t the tree root. An other automatic query sets is built with an AND of automatically ex tracted terms from the title field. These two query sets are submitted to our system with tw o values of k: 50 and 200. The two corresponding query sets with flat queries are also su bmitted to zettair search engine

    Étude des distributions de tf et de idf sur une collection de 5 millions de pages HTML

    Get PDF
    http://www.emse.fr/~mbeig/PUBLIS/2003-inforsid-ri-beigbeder.pdfInternational audienceNous étudions l'évolution des distributions des valeurs de la fréquence des termes et de la fréquence documentaire dans les vecteurs traditionnellement utilisés dans le modèle vectoriel de recherche d'informations en fonction du nombre de documents indexés. Nous construisons des collections dont la taille augmente d'un facteur 10 à chaque fois. Les documents utilisés sont extraits des pages HTML récoltées sur des sites de domaines géographiques francophones en décembre 2000

    ENSM-SE at CLEF 2006: AdHoc Uses of fuzzy proximity matching function

    Get PDF
    http://clef.isti.cnr.it/2006/working_notes/workingnotes2006/mercierCLEF2006.pdfInternational audienceStarting from the idea that the closer the query terms in a doc ument are to each other the more relevant the document, we propose an information re trieval method that uses the degree of fuzzy proximity of key terms in a document to com pute the relevance of the document to the query. Our model handles Boolean queries but, contrary to the traditional extensions of the basic Boolean information re trieval model, does not use a proximity operator explicitly. A single parameter makes i t possible to control the proximity degree required. To improve our system we use a ste mming algorithm before indexing, we take a specific influence function and we merge fu zzy proximity result list built with different spread of influence function. We explain how we construct the queries and report the results of our experiments in the ad-h oc monolingual French task of the CLEF 2006 evaluation campaign

    Fuzzy Proximity Ranking with Boolean Queries

    Get PDF
    http://trec.nist.gov/pubs/trec14/papers/ecole-des-mines.pdfInternational audienceBased on the idea that the closer the query terms are in a document, the more relevant this document is, we experiment an IR method based on a fuzzy proximity degree of the query term occurences in a document to compute its relevance to the query. Our model is able to deal with Boolean queries, but contrary to the traditional extensions of the basic Boolean IR model, it does not explicitly use a proximity operator. The fuzzy term proximity is controlled with an in uence function. Given a query term and a document, the in uence function associates to each position in the text a value dependant on the distance of the nearest occurence of this query term. To model proximity, this function is decreasing with distance. Di erent forms of function can be used: triangular, gaussian etc. For practical reasons only functions with nite support were used. The support of the function is limited by a constant called k. The fuzzy term proximity functions are associated to every leaves of the query tree. Then fuzzy proximities are computed for every nodes with a post-order tree traversal. Given the fuzzy proximities of the sons of a node, its fuzzy proximity is computed, like in the fuzzy IR models, with a mimimum (resp. maximum) combination for conjunctives (resp. disjunctives) nodes. Finally, a fuzzy query proximity value is obtained for each position in this document at the root of the query tree. The score of this document is the integration of the function obtained at the tree root. For the experiments, we modi ed Lucy (version 0.5.2) to implement our IR model. Three query sets are used for our eight runs. One set is manually built with the title words and some description words. Each of these words is OR'ed with its derivatives like plurals for instance. Then the OR nodes obtained are AND'ed at the tree root. The two automatic query sets are built with an AND of automatically extracted terms from either the title eld or the description eld. These three query sets are submitted to our system with two values of k: 50 and 200. As our method is aimed at high precision, it sometimes give less than one thousand answers. In such cases, the documents retrieved by the BM-25 method implemented in Lucy was concatenated after our result list

    ENSM-SE at CLEF 2005: Uses of Fuzzy Proximity Matching Function

    Get PDF
    Extended version to be appear in LCNS http://clef.isti.cnr.it/2005/working_notes/workingnotes2005/mercier05.pdfBased on the idea that the closer the query terms in a document are, the more relevant this document is, we propose a information retrieval method based on a fuzzy proximity degree of term occurences to compute document relevance to a query. Our model is able to deal with Boolean queries, but contrary to the traditional extensions of the basic Boolean information retrieval model, it does not explicitly use a proximity operator. A single parameter allows to control the proximity degree required. We explain how we construct the queries and we report the results of the experiments of the CLEF 2005 campaign before the conclusion

    Modèles de proximité : conception et comparaison à une méthode de recherche de passages

    Get PDF
    http://www.asso-aria.org/coria/2005/6.pdfInternational audienceNotre étude se situe dans le domaine de la recherche d'informations. Certains modèles classiques comme le modèle vectoriel permettent de classer les documents par ordre de pertinence alors que d'autres, qui n'offrent pas cette possibilité de classement, possèdent des fonctionnalités particulières comme repérer les documents où les termes de la requête apparaissent proches les uns des autres. Cette dernière idée ayant conduit à des améliorations des résultats, nous formulons l'hypothèse que plus les occurrences des termes d'une requête se retrouvent proches dans un document, plus ce document doit être positionné en tête de la liste de réponses retournées par un système. Par ailleurs, les méthodes de recherche de passa g es per - mettent de sélectionner les passa g es répondant à la requête et définissent ainsi une proximité au niveau du passa g e . Après avoir r appelé les principaux modèles de recherche d'informations ainsi que les approches qui traitent de la proximité entre les termes nous présentons notre modèle de proximité qui utilise la logique floue. Nous avons expérimenté notre modèle et nous comparons les résultats obtenus par rapport à ceux d'une méthode de recherche de passa g es

    Importance and Sensitivity Analysis in Dynamic Reliability

    Get PDF
    International audienceIn dynamic reliability, the evolution of a system is governed by a piecewise deterministic Markov process, which is characterized by different input data. Assuming such data to depend on some parameter pp is an element of PP, our aim is to compute the first-order derivative with respect to each pp is an element of PP of some functionals of the process, which may help to rank input data according to their relative importance, in view of sensitivity analysis. The functionals of interest are expected values of some function of the process, cumulated on some finite time interval [0,t][0, t], and their asymptotic values per unit time. Typical quantities of interest hence are cumulated (production) availability, or mean number of failures on some finite time interval and similar asymptotic quantities. The computation of the first-order derivative with respect to pp is an element of PP is made through a probabilistic counterpart of the adjoint state method, from the numerical analysis field. Examples are provided, showing the good efficiency of this method, especially in case of a large PP

    Observation of the shock wave propagation induced by a high-power laser irradiation into an epoxy material

    Get PDF
    The propagation of laser-induced shock waves in a transparent epoxy sample is investigated by optical shadowgraphy. The shock waves are generated by a focused laser (3 ns pulse duration—1.2 to 3.4TWcm−2) producing pressure from 44 to 98.9 GPa. It is observed that the shock wave and the release wave created by the shock reverberation at the rear face are both followed by a dark zone in the pictures. This corresponds to the creation of a tensile zone resulting from the crossing on the loading axis of the release waves coming from the edge of the impact area (2D effects). After the laser shock experiment, the residual stresses in the targets are identified and quantified through a photoelasticimetry analysis of the recovered samples. This work results in a new set of original data which can be directly used to validate numerical models implemented to reproduce the behaviour of epoxy under extreme strain rate loading. The residual stresses observed prove that the high-pressure shocks can modify the pure epoxy properties, which could have an influence on the use made of these materials
    • …
    corecore