%% hal-00339916, version 1 %% http://hal.archives-ouvertes.fr/hal-00339916/en/ @article{ASEERVATHAM:2008:HAL-00339916:1, title={{A} {C}oncept {V}ector {S}pace {M}odel for {S}emantic {K}ernels}, author={{A}seervatham, {S}ujeevan}, abstract={{K}ernels are widely used in {N}atural {L}anguage {P}rocessing as similarity measures within inner-product based learning methods like the {S}upport {V}ector {M}achine. {T}he {V}ector {S}pace {M}odel ({VSM}) is extensively used for the spatial representation of the documents. {H}owever, it is purely a statistical representation. {I}n this paper, we present a {C}oncept {V}ector {S}pace {M}odel ({CVSM}) representation which uses linguistic prior knowledge to capture the meanings of the documents. {W}e also propose a linear kernel and a latent kernel for this space. {T}he linear kernel takes advantage of the linguistic concepts whereas the latent kernel combines statistical and linguistic concepts. {I}ndeed, the latter kernel uses latent concepts extracted by the {L}atent {S}emantic {A}nalysis ({LSA}) in the {CVSM}. {T}he kernels were evaluated on a text categorization task in the biomedical domain. {T}he {O}hsumed corpus, well known for being difficult to categorize, was used. {T}he results have shown that the {CVSM} improves performance compared to the {VSM}.}, keywords={{K}ernel; {S}upport {V}ector {M}achine; {S}emantic {S}imilarity; {T}ext categorization}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={{T}o appear }, journal={{I}nternational {J}ournal on {A}rtificial {I}ntelligence {T}ools }, volume={18 }, number={2 }, audience={internationale }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00339916/en/}, } %% hal-00339913, version 1 %% http://hal.archives-ouvertes.fr/hal-00339913/en/ @article{ASEERVATHAM:2008:HAL-00339913:1, title={{S}emi-{S}tructured {D}ocument {C}ategorization with a {S}emantic {K}ernel}, author={{A}seervatham, {S}ujeevan and {B}ennani, {Y}oun{\`e}s}, abstract={{S}ince a decade, text categorization has become an active field of research in the machine learning community. {M}ost of the approaches are based on the term occurrence frequency. {T}he performance of such surface-based methods can decrease when the texts are too complex, i.e., ambiguous. {O}ne alternative is to use the semantic-based approaches to process textual documents according to their meaning. {F}urthermore, research in text categorization has mainly focused on ``flat texts'' whereas many documents are now semi-structured and especially under the {XML} format. {I}n this paper, we propose a {S}emantic {K}ernel for semi-structured biomedical documents. {T}he semantic meanings of words are extracted using the {UMLS} framework. {T}he kernel, with a {SVM} classifier, has been applied to a text categorization task on a medical corpus of free text documents. {T}he results have shown that the {S}emantic {K}ernel outperforms the {L}inear {K}ernel and the {N}aive {B}ayes classifier. {M}oreover, this kernel was ranked in the top ten of the best algorithms among 44 classification methods at the 2007 {CMC} {M}edical {NLP} {I}nternational {C}hallenge.}, keywords={{M}ercer {K}ernel; {S}upport {V}ector {M}achine; {T}ext {C}ategorization; {S}emantic {S}imilarity; {S}emi-{S}tructured {D}ata}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={{T}o appear }, journal={{P}attern {R}ecognition }, audience={internationale }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00339913/en/}, } %% hal-00339866, version 1 %% http://hal.archives-ouvertes.fr/hal-00339866/en/ @article{ASEERVATHAM:2008:HAL-00339866:1, title={{M}{\'e}thodes {\`a} noyaux appliqu{\'e}es aux textes structur{\'e}s}, author={{A}seervatham, {S}ujeevan and {V}iennet, {E}mmanuel}, abstract={{D}e nombreuses techniques d'apprentissage num{\'e}rique appliqu{\'e}es au traitement de donn{\'e}es textuelles utilisent une repr{\'e}sentation du texte en "sac de mot". {C}e codage, qui a l'avantage de la simplicit{\'e}, n'utilise que les fr{\'e}quences d'apparition des mots dans les documents et perd toute information li{\'e}e {\`a} l'ordre des {\'e}l{\'e}ments (ordre des mots, structure en paragraphes ou sections, etc). {D}epuis une petite dizaine d'ann{\'e}es, une nouvelle famille d'algorithme d'apprentissage, bas{\'e}e sur la notion de noyaux, fait l'objet d'intenses recherches. {C}es noyaux permettent de d{\'e}finir des mesures de similarit{\'e} utilisables dans de nombreux algorithmes d'apprentissage statistique (de l'analyse discriminante de {F}isher aux machines {\`a} vecteur de support). {R}{\'e}cemment, l'utilisation de noyaux sp{\'e}cifiques pour le traitement de donn{\'e}es textuelles structur{\'e}es a commenc{\'e} {\`a} faire l'objet de recherches. {D}ans le cadre de la sous-t{\^a}che 3.12 du projet {I}nfo{M}@gic, le {LIPN} a d{\'e}cid{\'e} de travailler sur l'application de ces m{\'e}thodes {\`a} noyau au traitement de donn{\'e}es textuelles structur{\'e}es. {C}e rapport interm{\'e}diaire pr{\'e}sente un bref {\'e}tat de l'art dans ce domaine. {N}ous passons en revue les principaux types de noyaux propos{\'e}s ces derni{\`e}res ann{\'e}es pour le traitement des s{\'e}quences et plus g{\'e}n{\'e}ralement des donn{\'e}es structur{\'e}es (arbres, graphes).}, keywords={{K}ernel; {S}upport {V}ector {M}achine; {N}atural {L}anguage {P}rocessing}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={185-205 }, journal={{R}evue des {N}ouvelles {T}echnologies de l'{I}nformation - {RNTI} - {A}-2 }, audience={nationale }, day={29}, month={01}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00339866/en/}, } %% hal-00345968, version 1 %% http://hal.archives-ouvertes.fr/hal-00345968/en/ @article{BARDIN:2008:HAL-00345968:1, title={{FAST}: acceleration from theory to practice}, author={{B}ardin, {S}ebastien and {F}inkel, {A}lain and {L}eroux, {J}{\'e}r{\^o}me and {P}etrucci, {L}aure}, abstract={{F}ast acceleration of symbolic transition systems ({F}ast) is a tool for the analysis of systems manipulating unbounded integer variables. {W}e check safety properties by computing the reachability set of the system under study. {E}ven if this reachability set is not necessarily recursive, we use innovative techniques, namely symbolic representation, acceleration and circuit selection, to increase convergence. {F}ast has proved to perform very well on case studies. {T}his paper describes the tool, from the underlying theory to the architecture choices. {F}inally, {F}ast capabilities are compared with those of other tools. {A} range of case studies from the literature is investigated.}, keywords={{A}cceleration, {C}ounter systems, {I}nfinite reachability set, {S}ymbolic representation}, language={{A}nglais}, affiliation={{L}aboratoire {S}{\^u}ret{\'e} des {L}ogiciels - {LSL} - {CEA} : {DRT}/{LIST} - {L}aboratoire {S}p{\'e}cification et {V}{\'e}rification - {LSV} - {CNRS} : {UMR}8643 - {INRIA} - {E}cole {N}ormale {S}up{\'e}rieure de {C}achan - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={401-424 }, journal={{I}nternational {J}ournal on {S}oftware {T}ools for {T}echnology {T}ransfer }, volume={10 }, number={5 }, audience={internationale }, doi={10.1007/s10009-008-0064-3 }, year={2008}, URL={dx.doi.org/10.1007/s10009-008-0064-3 http://hal.archives-ouvertes.fr/hal-00345968/en/}, } %% hal-00345174, version 1 %% http://hal.archives-ouvertes.fr/hal-00345174/en/ @article{DESOUSA:2008:HAL-00345174:1, title={{I}n vivo {MRI} assessment of a novel {G}d{III}-based contrast agent designed for high magnetic field applications.}, author={de {S}ousa, {P}aulo {L}oureiro and {L}ivramento, {J}o{\~a}o {B}runo and {H}elm, {L}othar and {M}erbach, {A}ndr{\'e} {E} and {M}{\^e}me, {W}illiam and {D}oan, {B}ich-{T}huy and {B}eloeil, {J}ean-{C}laude and {P}rata, {M}aria {I} {M} and {S}antos, {A}na {C} and {G}eraldes, {C}arlos {F} {G} {C} and {T}{\'o}th, {E}va}, abstract={{G}d(3){L} is a trinuclear {G}d(3+) complex of intermediate size, designed for contrast agent applications in high field magnetic resonance imaging ({H}(12){L} is based on a trimethylbenzene core bearing three methylene-diethylenetriamine- {N},{N},{N}'',{N}''-tetraacetate moieties). {T}hanks to its appropriate size, the presence of two inner sphere water molecules and a fast water exchange, {G}d(3){L} has remarkable proton relaxivities at high magnetic field (r(1) = 10.2 vs 3.0 m{M}(-1) s(-1) for {G}d{DOTA} at 9.4 {T}, 37 degrees {C}, in {H}(2){O}). {H}ere we report an in vivo {MRI} feasibility study, complemented with dynamic gamma scintigraphic imaging and biodistribution experiments using the (153){S}m-enriched analog. {MRI} experiments were performed at 9.4 {T} in mice with {G}d(3){L} and the commercial contrast agent gadolinium({III})-1,4,7,10-tetraazacyclododecane-1,4,7,10-tetraacetate ({G}d{DOTA}). {G}d(3){L} was well tolerated by the animals at the dose of 8 micromol {G}d kg(-1) body weight. {D}ynamic contrast enhanced ({DCE}) images showed considerably higher signal enhancement in the kidney medulla and cortex after {G}d(3){L} injection than after {G}d{DOTA} injection at an identical dose. {T}he relaxation rates, {D}elta{R}(1), were calculated from the {IR} {T}rue{FISP} data. {D}uring the excretory phase, the {D}elta{R}(1) for various tissues was similar for {G}d(3){L} and {G}d{DOTA}, when the latter was injected at a three-fold higher dose (24 vs 8 micromol {G}d kg(-1) body weight). {T}hese results point to an approximately three times higher in vivo relaxivity (per {G}d) for {G}d(3){L} relative to {G}d{DOTA}, thus the ratio of the relaxivities of the two compounds determined in vitro is retained under in vivo conditions. {T}hey also indicate that the two inner sphere water molecules per {G}d in {G}d(3){L} are not substantially replaced by endogenous anions or other donor groups under physiological conditions. {G}d(3){L} has a pharmacokinetics typical of small, hydrophilic complexes, involving fast renal clearance and no retention in the blood pool. {T}he dynamic gamma scintigraphic studies and the biodistribution experiments performed in {W}istar rats with (153){S}m-enriched (*){S}m(3){L} are also indicative of a fast elimination via the kidneys.}, language={{A}nglais}, affiliation={{L}aboratoire de {C}himie {I}norganique et {B}ioinorganique - {LCIB} - {\'E}cole {P}olytechnique {F}{\'e}d{\'e}rale de {L}ausanne - {L}aboratoire de {C}himie {I}norganique et {B}ioinorganique - {\'E}cole {P}olytechnique {F}{\'e}d{\'e}rale de {L}ausanne - {L}aboratoire de {N}eurobiologie - {U}niversit{\'e} d'{O}rl{\'e}ans : {EA}2633 - laboratoire de neurobiologie - {U}niversit{\'e} d'{O}rl{\'e}ans - {R}{\'e}sonance magnetique nucl{\'e}aire biologique - {ICSN} - {CNRS} : {UPR}2301 - {SUPELEC}-{C}ampus {G}if - {SUPELEC} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nstitut de {C}himie des {S}ubstances {N}aturelles - {ICSN} - {CNRS} : {UPR}2301 - {C}entre de biophysique mol{\'e}culaire - {CBM} - {CNRS} : {UPR}4301 - {C}entro de {F}isica {C}omputacional, {U}niversity of {C}oimbra - {U}niversit{\'e} de {C}oimbra - {I}nstituto de {I}nvestiga{\c{c}}ao das {P}escas e do {M}ar - {I}nstituto de {I}nvestiga{\c{c}}ao das {P}escas e do {M}ar - {I}nstitito {N}ational de {P}esquisas {A}maz{\^o}nicas - {I}nstitito {N}ational de {P}esquisas {A}maz{\^o}nicas - {DISTART} - {U}niversit{\`a} di {B}ologna }, pages={78-85 }, journal={{C}ontrast {M}edia \& {M}olecular {I}maging }, volume={3 }, number={2 }, note={2008105 }, audience={internationale }, doi={10.1002/cmmi.233 }, month={03}, year={2008}, URL={dx.doi.org/10.1002/cmmi.233 http://hal.archives-ouvertes.fr/hal-00345174/en/}, } %% hal-00174423, version 1 %% http://hal.archives-ouvertes.fr/hal-00174423/en/ @article{DESPRES:2008:HAL-00174423:1, title={{M}{\'e}tadonn{\'e}es, ontologies et documents num{\'e}riques}, author={{D}espr{\'e}s, {S}ylvie and {R}ichy, {H}{\'e}l{\`e}ne}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {IMADOC} - {IRISA} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ennes - {CNRS} : {UMR}6074 - {U}niversit{\'e} de {R}ennes 1 }, pages={{\`a} para{\^i}tre }, journal={{R}evue des {T}echniques de l’{I}ng{\'e}nieur }, audience={nationale }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00174423/en/}, } %% hal-00350036, version 1 %% http://hal.archives-ouvertes.fr/hal-00350036/en/ @article{DURAND:2008:HAL-00350036:1, title={{A} tool for reasoning about qualitative temporal information: the theory of {S}-languages with a {L}isp implementation}, author={{D}urand, {I}r{\`e}ne and {S}chwer, {S}ylviane}, abstract={{R}easoning about incomplete qualitative temporal information is an essential topic in many artificial intelligence and natural language processing applications. {I}n the domain of natural language processing for instance, the temporal analysis of a text %provides yields a set of temporal relations between events in a given linguistic theory. {T}he problem is first to express events and any possible temporal relations between them, then to express the qualitative temporal constraints (as subsets of the set of all possible temporal relations) and compute (or count) all possible temporal relations that can be deduced. {F}or this purpose, we propose to use the formalism of {S}-languages, based on the mathematical notion of {S}-arrangements with repetitions [schwer:{CRM}02]. {I}n this paper, we present this formalism in detail and our implementation of it. {W}e explain why {L}isp is adequate to implement this theory. {N}ext we describe a {C}ommon {L}isp system \{SLS}\ (for {S}-{L}anguage{S}) which implements part of this formalism. {A} graphical interface written using {M}c{CLIM}, the free implementation of the {CLIM} specification, frees the potential user of any {L}isp knowledge. {F}ully developed examples illustrate both the theory and the implementation.}, keywords={{T}emporal reasoning; relation algebras; {S}-languages; {L}isp}, language={{A}nglais}, affiliation={{L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={3282-3306 }, journal={{J}.{UCS} {J}ournal of {U}niversal {C}omputer {S}cience }, volume={14 }, number={20 }, note={http://www.jucs.org/jucs_14_20/a_tool_for_reasoning }, audience={internationale }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00350036/en/}, } %% hal-00143929, version 1 %% http://hal.archives-ouvertes.fr/hal-00143929/en/ @article{FOUQUERE:2008:HAL-00143929:1, title={{R}ewritings for {P}olarized {M}ultiplicative and {E}xponential {P}roof {S}tructures}, author={{F}ouquer{\'e}, {C}hristophe and {M}ogbil, {V}irgile}, abstract={{W}e study conditions for a concurrent construction of proof-nets in the framework of linear logic following {A}ndreoli's works. {W}e define specific correctness criteria for that purpose. {W}e first study the multiplicative case and show how the correctness criterion given by {D}anos and decidable in linear time, may be extended to closed modules (i.e. validity of polarized proof structures). {W}e then study the exponential case. {T}his has natural applications in (concurrent) logic programming as validity of partial proof structures may be interpreted in terms of validity of a concurrent execution of clauses in an environment.}, keywords={linear logic; proof-nets; logic programming; focalization; concurrent execution}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={{P}ages 109-121 }, journal={{E}lectronic {N}otes in {T}heoretical {C}omputer {S}cience }, volume={203 }, number={1 }, note={13 pages rapport interne {LIPN} {ACI} {NIM} {GEOCAL} }, audience={internationale }, doi={10.1016/j.entcs.2008.03.037 }, year={2008}, URL={dx.doi.org/10.1016/j.entcs.2008.03.037 http://hal.archives-ouvertes.fr/hal-00143929/en/}, } %% hal-00281515, version 1 %% http://hal.archives-ouvertes.fr/hal-00281515/en/ @article{JAFF:2008:HAL-00281515:1, title={{S}hift operators and complex systems}, author={{J}aff, {L}ua{\"i} and {D}uchamp, {G}{\'e}rard {H}.{E}. and {B}ertelle, {C}yrille}, abstract={{I}n this paper, we deal with some multiagent systems modelling, based on population of automata.{W}e focus our attention with automatic computation of emerging systems. {A} multiscale representation is proposed here and consists in representing the internal states of an agent behaviour by a automaton with multiplicities, on the one hand and an adaptive global system behaviour by a genetic algorithm over a population of automata, on the other hand. {T}his genetic process can lead to generate many new automata which behaviour can be eventually similar. {T}he role played by shift operators is to identify these similar behaviours. {T}wo applications are presented. {T}he first one concerns adaptive strategies in game theory. {T}he second one concerns an automatic emerging computation of self-organised multiagent systems based on the efficience of operation expressivity of automata with multiplicities.}, keywords={shift operators; complex systems; complex systems modelling; self-organization; emergence; automata with multiplicities; probabilistic automata; genetic automata; multi-agent systems; prisoner dilemma.}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique, de {T}raitement de l'{I}nformation et des {S}yst{\`e}mes - {LITIS} - {U}niversit{\'e} du {H}avre - {U}niversit{\'e} de {R}ouen - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ouen - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={50-57 }, journal={{I}nternational {J}ournal of {M}odelling {I}dentification and {C}ontrol }, volume={3 }, number={1 }, audience={internationale }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00281515/en/}, } %% hal-00353410, version 1 %% http://hal.archives-ouvertes.fr/hal-00353410/en/ @article{NOURY:2008:HAL-00353410:1, title={{MRI} methodological development of intervertebral disc degeneration: a rabbit in vivo study at 9.4 {T}.}, author={{N}oury, {F}anny and {M}ispelter, {J}o{\"e}l and {S}zeremeta, {F}r{\'e}d{\'e}ric and {M}{\^e}me, {S}andra and {D}oan, {B}ich-{T}huy and {B}eloeil, {J}ean-{C}laude}, abstract={{I}ntervertebral disc ({IVD}) degeneration is a complex process characterized by biochemical and structural changes in both the nucleus pulposus and the anulus fibrosus. {I}n this study, we were able to obtain in vivo magnetic resonance ({MR}) images of the rabbit spine, with several {MR} imaging ({MRI}) contrasts (rho, {T}(1) and {T}(2)). {W}e quantified several parameters ({T}(2), apparent diffusion coefficient, disc height and area) to differentiate between healthy and degenerative {IVD}s and to characterize the degeneration process. {T}o our knowledge, there has not been any previous in vivo study of rabbit {IVD}s at high-field {MRI} (9.4 {T}). {A} custom radio frequency ({RF}) coil for 9.4 {T} was designed to match rabbit {IVD} morphology, to study the degeneration in vivo on a model of human lumbar disease. {O}ur new probe, a custom half-birdcage-type coil, obtains the necessary exploration depth while meeting the requirements for signal homogeneity and sensitivity of the study. {T}his design addresses some of the difficulties with constructing {RF} coils at high field strengths.}, language={{A}nglais}, affiliation={{I}ng{\'e}nierie de la vectorisation particulaire - {INSERM} : {U}646 - {U}niversit{\'e} d'{A}ngers - {C}entre {I}nterdisciplinaire de {R}echerche {I}ons {L}asers - {CIRIL} ({GANIL}) - {CNRS} : {UMR}6637 - {U}niversit{\'e} de {C}aen - {E}cole {N}ationale {S}up{\'e}rieure d'{I}ng{\'e}nieurs de {C}aen - {CEA} : {DSM}/{IRAMIS} - {C}entre de recherche sur les {I}ons, les {MA}t{\'e}riaux et la {P}hotonique - {CIMAP} - {E}cole {N}ationale {S}up{\'e}rieure d'{I}ng{\'e}nieurs de {C}aen - {U}niversit{\'e} de {C}aen - {CNRS} : {UMR}6252 - {CEA} : {DSM}/{IRAMIS} - {I}magerie int{\'e}grative de la mol{\'e}cule {\`a} l'organisme - {INSERM} : {U}759 - {I}nstitut {C}urie - {INSERM} {U}219 - {I}nstitut {C}urie - {B}iophysique mol{\'e}culaire - {INSERM} : {U}350 - {I}nstitut {C}urie - {C}entre de biophysique mol{\'e}culaire - {CBM} - {CNRS} : {UPR}4301 - {R}{\'e}sonance magnetique nucl{\'e}aire biologique - {ICSN} - {CNRS} : {UPR}2301 - {SUPELEC}-{C}ampus {G}if - {SUPELEC} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nstitut de {C}himie des {S}ubstances {N}aturelles - {ICSN} - {CNRS} : {UPR}2301 }, pages={1421-32 }, journal={{M}agnetic {R}esonance {I}maging }, volume={26 }, number={10 }, note={2008114 }, audience={internationale }, doi={10.1016/j.mri.2008.04.012 }, month={12}, year={2008}, URL={dx.doi.org/10.1016/j.mri.2008.04.012 http://hal.archives-ouvertes.fr/hal-00353410/en/}, } %% hal-00347009, version 1 %% http://hal.archives-ouvertes.fr/hal-00347009/en/ @article{POIBEAU:2008:HAL-00347009:1, title={{L}inguistique et acc{\`e}s automatis{\'e} {\`a} l’information : un bilan}, author={{P}oibeau, {T}hierry and {C}ondamines, {A}nne}, abstract={{C}e num{\'e}ro de la {R}evue {F}ran{\c{c}}aise de {L}inguistique {A}ppliqu{\'e}e concerne les rapports entre linguistique et recherche d'information. {A}u-del{\`a} de la recherche d'information au sens strict (recherche de documents pertinents par rapport {\`a} des mots-cl{\'e}s), nous souhaitons {\'e}largir la probl{\'e}matique {\`a} des domaines de recherche connexes : - {L}'extraction d'information, - {L}es syst{\`e}mes de question/r{\'e}ponse, - {L}e r{\'e}sum{\'e} automatique, - {L}a cat{\'e}gorisation de textes. {L}a dimension langagi{\`e}re est pr{\'e}sente dans toutes ces applications : la plupart exigent une analyse du contenu (on parle aujourd'hui de moteur de recherche « s{\'e}mantique ») et ne peuvent se contenter de voir le document comme un simple « sac de mots ». {L}a linguistique devrait donc jouer un r{\^o}le important dans ces disciplines. {O}r, ce n'est pas toujours le cas. {C}et introduction pr{\'e}sente les raisons de cet {\'e}tat de fait.}, keywords={{L}inguistique; {I}nformatique; {E}xtraction d’information; {S}yst{\`e}mes de question/r{\'e}ponse; {R}{\'e}sum{\'e} automatique; {C}at{\'e}gorisation de textes.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {E}quipe de {R}echerche en {S}yntaxe et {S}{\'e}mantique - {ERSS} - {CNRS} : {UMR}5263 }, pages={5-8 }, journal={{R}evue fran{\c{c}}aise de linguistique appliqu{\'e}e }, volume={13 }, number={1 }, audience={internationale }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00347009/en/}, } %% hal-00153194, version 1 %% http://hal.archives-ouvertes.fr/hal-00153194/en/ @article{ALFANDARI:2007:HAL-00153194:1, title={{I}mproved approximation of the {S}oft-{C}apacitated {F}acility {L}ocation {P}roblem}, author={{A}lfandari, {L}aurent}, abstract={{A}pproximation du probl{\`e}me de localisation d'entreprise {\`a} capacit{\'e}s variables. {A}m{\'e}lioration du rapport d'approximation {\`a} 2{H}(n) par une heuristique gloutonne de type {S}et {C}overing reposant sur la r{\'e}solution approch{\'e}e d'un sous-probl{\`e}me {NP}-dur par programmation dynamique.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={83-93 }, journal={{RAIRO} {O}perations {R}esearch }, volume={41 }, audience={internationale }, doi={10.1051/ro:2007011 }, year={2007}, URL={dx.doi.org/10.1051/ro:2007011 http://hal.archives-ouvertes.fr/hal-00153194/en/}, } %% hal-00153186, version 1 %% http://hal.archives-ouvertes.fr/hal-00153186/en/ @article{ALFANDARI:2007:HAL-00153186:1, title={{I}mproved approximation of the {S}oft-{C}apacitated {F}acility {L}ocation {P}roblem}, author={{A}lfandari, {L}aurent}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={83-93 }, journal={{RAIRO} {O}perations {R}esearch }, volume={41 }, audience={internationale }, doi={10.1051 }, year={2007}, URL={dx.doi.org/10.1051 http://hal.archives-ouvertes.fr/hal-00153186/en/}, } %% hal-00160245, version 1 %% http://hal.archives-ouvertes.fr/hal-00160245/en/ @article{AUBIN:2007:HAL-00160245:1, title={{U}ne infrastructure pour l'annotation linguistique de documents issus du web : le projet {ALVIS}}, author={{A}ubin, {S}ophie and {D}erivi{\`e}re, {J}ulien and {H}amon, {T}hierry and {N}azarenko, {A}deline and {P}oibeau, {T}hierry and {W}eissenbacher, {D}avy}, abstract={{C}et article pr{\'e}sente une architecture logicielle permettant l'annotation automatique de documents issus du web. {C}ette architecture est fond{\'e}e sur l'int{\'e}gration de composants d'analyse linguistique. {C}ette plateforme pr{\'e}sente une double originalit{\'e} : elle peut {\^e}tre adapt{\'e}e en fonction du domaine vis{\'e} et elle permet d'analyser de mani{\`e}re robuste des collections de documents qui sont h{\'e}t{\'e}rog{\`e}nes, ce qui est caract{\'e}ristiques des collections construites {\`a} partir du web. {C}et article prend comme exemple le cas de bases de donn{\'e}es textuelles dans le domaine de la biologie. {N}ous montrons comment la plateforme {O}gmios peut {\^e}tre adapt{\'e}e {\`a} ce domaine et nous d{\'e}taillons les performances obtenues dans l'analyse de larges collections de documents destin{\'e}es {\`a} des moteurs sp{\'e}cialis{\'e}s sur internet.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={?? }, journal={{REVUE} {DES} {NOUVELLES} {TECHNOLOGIES} {DE} {L}'{INFORMATION} }, audience={nationale }, collaboration={{ALVIS} }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00160245/en/}, } %% lirmm-00138129, version 1 %% http://hal-lirmm.ccsd.cnrs.fr/lirmm-00138129/en/ @article{AZE:2007:LIRMM-00138129:1, title={{B}ilan du premier d{\'e}fi francophone de {F}ouille de {T}extes}, author={{A}z{\'e}, {J}{\'e}r{\^o}me and {R}oche, {M}athieu and {A}lphonse, {E}rick and {A}mrani, {A}hmed and {H}eitz, {T}homas and {M}ezaour, {A}mar-{D}jalil}, abstract={{L}e {D}{\'E} {F}ouille de {T}extes ({DEFT}) a consist{\'e} {\`a} supprimer les phrases non pertinentes dans un corpus de discours politiques en fran{\c{c}}ais. {I}l a eu lieu en 2005 et r{\'e}uni onze {\'e}quipes, totalisant une trentaine de participants. {C}et article d{\'e}crit les pr{\'e}traitements eectu{\'e}s sur les corpus de {F}. {M}itterrand et de {J}. {C}hirac dans le cadre de ce d{\'e}. {N}otamment, la conversion au format texte, le d{\'e}coupage en phrases, le classement des discours, l'introduction de phrases de {F}. {M}itterrand dans les discours de {J}. {C}hirac et l'identication des dates et noms de personnes. {L}es r{\'e}sultats obtenus par les onze {\'e}quipes participantes sont aussi pr{\'e}sent{\'e}s.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} - {L}aboratoire d'{I}nformatique de {R}obotique et de {M}icro{\'e}lectronique de {M}ontpellier - {LIRMM} - {CNRS} : {UMR}5506 - {U}niversit{\'e} {M}ontpellier {II} - {S}ciences et {T}echniques du {L}anguedoc - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {E}xalead - {E}xalead }, pages={15-38 }, journal={{RNTI}, {D}{\'e}fi {F}ouille de {T}extes : reconnaissance automatique des auteurs de discours }, volume={{E}-10 }, number={{N}um{\'e}ro sp{\'e}cial }, note={{C}ampagne {DEFT}'05 ({TALN}'05) }, audience={nationale }, year={2007}, URL={http://hal-lirmm.ccsd.cnrs.fr/lirmm-00138129/en/}, } %% hal-00197673, version 1 %% http://hal.archives-ouvertes.fr/hal-00197673/en/ @article{BENABDESLEM:2007:HAL-00197673:1, title={{A}pproche connexionniste pour l’analyse des donn{\'e}es issues d’usages d’{I}nternet: {C}lassification et {V}isualisation}, author={{B}enabdeslem, {K}halid and {B}ennani, {Y}oun{\`e}s}, abstract={{D}ans ce papier, nous pr{\'e}sentons une cha{\^i}ne compl{\`e}te de fouille de donn{\'e}es comportementales issues des navigations des clients de sites web commerciaux. {N}ous pr{\'e}sentons plus particuli{\`e}rement, le d{\'e}veloppement d’une approche d’apprentissage non supervis{\'e} pour ce type de donn{\'e}es stock{\'e}es sous forme de traces de navigation dans des fichiers {L}og. {L}a premi{\`e}re partie de cette {\'e}tude concerne le probl{\`e}me du codage des donn{\'e}es qui seront ensuite utilis{\'e}es pour l’analyse. {E}n effet, actuellement, les sites web sont dynamiques et les pages ne peuvent pas {\^e}tre caract{\'e}ris{\'e}es par des variables fixes comme : la hi{\'e}rarchie des adresses {URL}, le contenu, etc. {E}lles sont repr{\'e}sent{\'e}es par des identificateurs num{\'e}riques n’ayant aucun « sens » et qui servent comme adresses de r{\'e}cup{\'e}ration des informations dans des bases de donn{\'e}es pour remplir les contenus des pages. {P}our cette raison, nous proposons une nouvelle m{\'e}thode de codage de sessions {\`a} partir du fichier {L}og. {C}ette technique consiste {\`a} caract{\'e}riser une page donn{\'e}e par un vecteur de poids d’importance de passage, i.e. par ses poids de pr{\'e}c{\'e}dence et de successions relatives {\`a} toutes les autres pages qui apparaissent dans le fichier {L}og. {D}ans la deuxi{\`e}me partie de ce travail, nous analysons les propri{\'e}t{\'e}s des cartes topologiques de {K}ohonen et nous proposons une version adapt{\'e}e aux donn{\'e}es comportementales. {C}ette {\'e}tape nous permet (1) de construire une cartographie du site web tel qu’il est aper{\c{c}}u par les clients (2) de regrouper les pages pour un objectif de codage de sessions (3) et de projeter les interactions des clients du fichier {L}og sur la cartographie sous forme de trajectoires symbolisant leurs comportements.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'{I}nformatique pour l'{E}ntreprise et les {S}yst{\`e}mes de {P}roduction - {LIESP} - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {U}niversit{\'e} {L}umi{\`e}re - {L}yon {II} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {L}yon - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={23-36 }, journal={{RNTI} }, audience={nationale }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00197673/en/}, } %% hal-00089148, version 1 %% http://hal.archives-ouvertes.fr/hal-00089148/en/ @article{DESPRES:2007:HAL-00089148:1, title={{M}erging of {L}egal {M}icro-{O}ntologies from {E}uropean {D}irectives}, author={{D}espr{\'e}s, {S}ylvie and {S}zulman, {S}ylvie}, abstract={{T}his paper describes the contruction method of a legal application ontology. {T}his method is based on the merging of micro-ontologies built from {E}uropean community directives. {T}he \textsc{terminae} construction method from texts enhanced by an alignment process with a core legal ontology is used for building micro-ontologies. {A} merging process allows constructing the legal ontology.}, keywords={{L}egal ontology; {O}ntology merging}, language={{A}nglais}, affiliation={{CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={10.1007/s10506-007-9028-2 }, journal={{J}ournal of {A}rtificial {I}ntelligence and {L}aw }, audience={non sp{\'e}cifi{\'e}e }, day={10}, month={02}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00089148/en/}, } %% hal-00195709, version 1 %% http://hal.archives-ouvertes.fr/hal-00195709/en/ @article{GOLLUB:2007:HAL-00195709:1, title={{A}utomated classification of textual documents based on a controlled vocabulary in engineering}, author={{G}ollub, {K}oraljka and {H}amon, {T}hierry and {A}rd{\"o}, {A}nders}, abstract={{A}utomated subject classification has been a challenging research issue for many years now, receiving particular attention in the past decade due to rapid increase of digital documents. {T}he most frequent approach to automated classification is machine learning. {I}t, however, requires training documents and performs well on new documents only if these are similar enough to the former. {W}e explore a string-matching algorithm based on a controlled vocabulary, which does not require training documents – instead it reuses the intellectual work put into creating the controlled vocabulary. {T}erms from the {E}ngineering {I}nformation thesaurus and classification scheme were matched against title and abstract of engineering papers from the {C}ompendex database. {S}imple string-matching was enhanced by several methods such as term weighting schemes and cut-offs, exclusion of certain terms, and enrichment of the controlled vocabulary with automatically extracted terms. {T}he best results are 76% recall when the controlled vocabulary is enriched with new terms, and 79% precision when certain terms are excluded. {P}recision of individual classes is up to 98%. {T}hese results are comparable to state-of-the-art machine-learning algorithms.}, keywords={{C}lassification ; {N}atural {L}anguage {P}rocessing ; {I}nformation {R}etrieval}, language={{A}nglais}, affiliation={{K}now{L}ib {R}esearch {G}roup - {K}now{L}ib - {L}und {U}niversity - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={247-263 }, journal={{K}nowledge {O}rganization }, volume={34 }, number={4 }, note={{ALVIS} {STREP} {P}roject }, audience={internationale }, collaboration={{ALVIS} }, day={15}, month={11}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00195709/en/}, } %% hal-00153295, version 1 %% http://hal.archives-ouvertes.fr/hal-00153295/en/ @article{KHEMMOUDJ:2007:HAL-00153295:1, title={{C}lique {I}nference {P}rocess for {S}olving {M}ax-{CSP}}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {B}ennaceur, {H}achemi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={to apear }, journal={{E}uropean {J}ournal of {O}perational {R}esearch }, audience={non sp{\'e}cifi{\'e}e }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153295/en/}, } %% hal-00084600, version 1 %% http://hal.archives-ouvertes.fr/hal-00084600/en/ @article{LAVAULT:2007:HAL-00084600:1, title={{A} distributed approximation algorithm for the minimum degree minimum weight spanning trees}, author={{L}avault, {C}hristian and {V}alencia-{P}abon, {M}ario}, abstract={{F}ischer has shown how to compute a minimum weight spanning tree of degree at most $b \{D}elta^* + \lceil \log_b n\rceil$ in time ${O}(n^{4 + 1/\!\ln b})$ for any constant $b > 1$, where $\{D}elta^*$ is the value of an optimal solution and $n$ is the number of nodes in the network. {I}n this paper, we propose a distributed version of {F}ischer's algorithm that requires messages and time complexity ${O}(n^{2 + 1/\!\ln b})$, and ${O}(n)$ space per node.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={{\`a} para{\^i}tre }, journal={{J}ournal of {P}arallel and {D}istributed {C}omputing }, audience={internationale }, ARXIVID={cs.DC/0607031 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00084600/en/}, } %% hal-00084603, version 1 %% http://hal.archives-ouvertes.fr/hal-00084603/en/ @article{LAVAULT:2007:HAL-00084603:1, title={{Q}uasi-{O}ptimal {E}nergy-{E}fficient {L}eader {E}lection {A}lgorithms in {R}adio {N}etworks}, author={{L}avault, {C}hristian and {M}arckert, {J}ean-{F}ran{\c{c}}ois and {R}avelomanana, {V}lady}, abstract={{R}adio networks ({RN}) are distributed systems (\textit{ad hoc networks}) consisting in $n \ge 2$ radio stations. {A}ssuming the number $n$ unknown, two distinct models of {RN} without collision detection (\textit{no-{CD}}) are addressed: the model with \textit{weak no-{CD}} {RN} and the one with \textit{strong no-{CD}} {RN}. {W}e design and analyze two distributed leader election protocols, each one running in each of the above two (no-{CD} {RN}) models, respectively. {B}oth randomized protocols are shown to elect a leader within $\{BO}(\log{(n)})$ expected time, with no station being awake for more than $\{BO}(\log{\log{(n)}})$ time slots (such algorithms are said to be \textit{energy-efficient}). {T}herefore, a new class of efficient algorithms is set up that matchthe $\{O}mega(\log{(n)})$ time lower-bound established by {K}ushilevitz and {M}ansour.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux }, pages={pages 679-693 }, journal={{J}ournal of {I}nformation and {C}omputation }, volume={205 }, number={5 }, audience={internationale }, ARXIVID={cs.DC/0607028 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00084603/en/}, } %% hal-00152295, version 1 %% http://hal.archives-ouvertes.fr/hal-00152295/en/ @article{MONNOT:2007:HAL-00152295:1, title={{T}he path partition problem and related problems in bipartite graphs}, author={{M}onnot, {J}{\'e}r{\^o}me and {T}oulouse, {S}ophie}, abstract={{W}e prove that it is {NP}-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. {F}inally, we propose some approximation and inapproximation results for several related problems.}, keywords={{P}k-{P}artition; {P}ath packing; {P}ath partition; {B}ipartite graphs; {APX}-{H}ardness; {A}pproximation algorithms}, language={{A}nglais}, affiliation={{L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={to appear }, journal={{O}perations {R}esearch {L}etters }, audience={internationale }, doi={10.1016/j.orl.2006.12.004 }, day={11}, month={01}, year={2007}, URL={dx.doi.org/10.1016/j.orl.2006.12.004 http://hal.archives-ouvertes.fr/hal-00152295/en/}, } %% hal-00152281, version 1 %% http://hal.archives-ouvertes.fr/hal-00152281/en/ @article{MONNOT:2007:HAL-00152281:1, title={{A}pproximation results for the weighted ${P}_{4}$ partition problem}, author={{M}onnot, {J}{\'e}r{\^o}me and {T}oulouse, {S}ophie}, abstract={{W}e present several new standard and differential approximation results for the {P}$_4$-partition problem using the {H}assin and {R}ubinstein algorithm ({I}nformation {P}rocessing {L}etters, 63: 63-67, 1997). {T}hose results concern both minimization and maximization versions of the problem. {H}owever, the main point of this paper lies in the establishment of the robustness of this algorithm, in the sense that it provides good quality solutions for a variety of versions of the problem, under both standard and differential approximation ratio.}, keywords={graph partitioning; ${P}_4$-packing; approximation algorithms; performance ratio; standard approximation; differential approximation}, language={{A}nglais}, affiliation={{L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={to appear }, journal={{J}ournal of {D}iscrete {A}lgorithms }, audience={non sp{\'e}cifi{\'e}e }, doi={10.1016/j.jda.2007.01.006 }, day={31}, month={05}, year={2007}, URL={dx.doi.org/10.1016/j.jda.2007.01.006 http://hal.archives-ouvertes.fr/hal-00152281/en/}, } %% hal-00153308, version 1 %% http://hal.archives-ouvertes.fr/hal-00153308/en/ @article{POIBEAU:2007:HAL-00153308:1, title={{S}emantic annotation: {M}apping text to ontologies}, author={{P}oibeau, {T}hierry}, abstract={{T}his position paper discusses various issues concerning the semantic web. {W}e claim that reflection on formats has attracted the most important part of the research effort so far, whereas the web (including the future semantic web) is mainly made of texts. {F}rom our point of view, research should attach a major role to natural language properties and deal with complexity, ambiguity and polysemy. {W}e examine a set of resources and search engines, which are good candidates to provide enhanced indexing capacities to existing tools. {W}e give some examples of applications intended to provide a semantic annotation of different kinds of texts. {E}ven if some of these technologies are already available, we show that they suppose to make more complex the initial model from {T}. {B}erners-{L}ee if we want them to be able to take into account language diversity.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={- }, journal={{I}nternational {J}ournal of {M}etadata {S}emantics and {O}ntologies }, volume={2 }, number={2 }, audience={internationale }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153308/en/}, } %% hal-00152898, version 1 %% http://hal.archives-ouvertes.fr/hal-00152898/en/ @article{TENENHAUS:2007:HAL-00152898:1, title={{K}ernel logistic {PLS}: a tool for supervised nonlinear dimensionality reduction and binary classification}, author={{T}enenhaus, {A}rthur and {G}iron, {A}lain and {V}iennet, {E}mmanuel and {B}{\'e}ra, {M}ichel and {S}aporta, {G}ilbert and {F}ertil, {B}ernard}, language={{A}nglais}, affiliation={{L}aboratoire d'imagerie fonctionnelle - {INSERM} : {U}678 - {IFR}14 - {IFR}49 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers }, pages={4083-4100 }, journal={{C}omputational {S}tatistics \& {D}ata {A}nalysis }, volume={51 }, number={9 }, audience={internationale }, day={01}, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00152898/en/}, } %% hal-00282452, version 1 %% http://hal.archives-ouvertes.fr/hal-00282452/en/ @article{THOMAS:2007:HAL-00282452:1, title={{SAPHIR} - a multi-scale, multi-resolution modeling environment targeting blood pressure regulation and fluid homeostasis.}, author={{T}homas, {S}. {R}andall and {A}bdulhay, {E}nas and {B}aconnier, {P}ierre and {F}ontecave, {J}ulie and {F}rancoise, {J}ean-{P}ierre and {G}uillaud, {F}rancois and {H}annaert, {P}atrick and {H}ernandez, {A}lfredo and {L}e {R}olle, {V}irginie and {M}aziere, {P}ierre and {T}ahi, {F}ariza and {Z}ehraoui, {F}arida}, abstract={{W}e present progress on a comprehensive, modular, interactive modeling environment centered on overall regulation of blood pressure and body fluid homeostasis. {W}e call the project {SAPHIR}, for "a {S}ystems {A}pproach for {PH}ysiological {I}ntegration of {R}enal, cardiac, and respiratory functions". {T}he project uses state-of-the-art multi-scale simulation methods. {T}he basic core model will give succinct input-output (reduced-dimension) descriptions of all relevant organ systems and regulatory processes, and it will be modular, multi-resolution, and extensible, in the sense that detailed submodules of any process(es) can be "plugged-in" to the basic model in order to explore, eg. system-level implications of local perturbations. {T}he goal is to keep the basic core model compact enough to insure fast execution time (in view of eventual use in the clinic) and yet to allow elaborate detailed modules of target tissues or organs in order to focus on the problem area while maintaining the system-level regulatory compensations.}, keywords={{A}nimals; {B}lood {P}ressure; {B}ody {F}luids; {C}ardiovascular {P}hysiology; {H}omeostasis; {H}umans; {K}idney; {M}odels, {B}iological; {R}espiratory {P}hysiology}, language={{A}nglais}, affiliation={{I}nformatique, {B}iologie {I}nt{\'e}grative et {S}yst{\`e}mes {C}omplexes - {IBISC} - {CNRS} : {FRE}2873 - {U}niversit{\'e} d'{E}vry-{V}al d'{E}ssonne - {T}echniques de l’{I}ng{\'e}nierie {M}{\'e}dicale et de la {C}omplexit{\'e} - {TIMC} - {CNRS} : {UMR}5525 - {U}niversit{\'e} {J}oseph {F}ourier - {G}renoble {I} - {L}aboratoire {J}acques-{L}ouis {L}ions - {LJLL} - {CNRS} : {UMR}7598 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {I}schemie- {R}eperfusion en {T}ransplantation {R}enale. - {INSERM} : {ERM}324 - {U}niversit{\'e} de {P}oitiers - {L}aboratoire {T}raitement du {S}ignal et de l'{I}mage - {LTSI} - {INSERM} : {U}642 - {U}niversit{\'e} {R}ennes {I} - {C}entre de pharmacologie et biotechnologies pour la sant{\'e} - {CPBS} - {CNRS} : {UMR}5160 - {BIO}-{RAD} - {U}niversit{\'e} {M}ontpellier {I} - {U}niversit{\'e} {M}ontpellier {II} - {S}ciences et {T}echniques du {L}anguedoc - {U}niversit{\'e} d'{E}vry-{V}al d'{E}ssonne - {U}niversit{\'e} d'{E}vry-{V}al d'{E}ssonne - {G}enexpress - {CNRS} : {FRE}2376 - {INRIA} {R}ocquencourt - {INRIA} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={6649-52 }, journal={{C}onference proceedings : {A}nnual {I}nternational {C}onference of the {IEEE} {E}ngineering in {M}edicine and {B}iology {S}ociety. }, volume={2007 }, audience={internationale }, collaboration={{SAPHIR} {ANR} {T}ec{S}an 2006 }, doi={10.1109/{IEMBS}.2007.4353884 }, ARXIVID={0806.2005 }, year={2007}, URL={dx.doi.org/10.1109/{IEMBS}.2007.4353884 http://hal.archives-ouvertes.fr/hal-00282452/en/}, } %% hal-00153226, version 1 %% http://hal.archives-ouvertes.fr/hal-00153226/en/ @article{VAUZEILLES:2007:HAL-00153226:1, title={{S}trong {P}lanning under {U}ncertainty in {D}omains with {N}umerous but {I}dentical {E}lements (a generic approach)}, author={{V}auzeilles, {J}acqueline and {K}anovich, {M}ax}, abstract={{T}he typical {AI} problem of making a plan of the actions to be performed by a robot so that it could get into a set of final situations, if it started with a certain initial situation, is generally very complex. {E}ven within the case of ‘well-balanced' actions, strong planning under uncertainty about the effects of actions, or games ‘{R}obot against {N}ature', is {EXPTIME}-complete. {A}s a result, the {AI} planners are very sensitive to the number of the variables involved, the inherent symmetry of the problem, and the nature of the logic formalisms being used. {T}he paper shows that linear logic provides a convenient and adequate tool for representing strong and weak planning problems in nondeterministic domains. {A} particular interest of our paper is focused on planning problems with an unbounded number of functionally identical objects. {W}e show that for such problems linear logic is especially effective and leads to dramatic contraction of the search space (polynomial instead of exponential). {T}he paper addresses the key issue: “{H}ow to automatically recognize functions similarity among objects and break the extreme combinatorial explosion caused by the large number of objects that happen to be identical” by means of replacing the unbounded number of specific names of objects with one generic name and contracting thereby the exponential search space over ‘real' objects to a small polynomial search space but over the ‘generic' one, with providing a more abstract formulation whose solutions are proved to be directly translatable into (optimal) polytime solutions to the original planning problem.}, keywords={{L}inear {L}ogic; {A}rtificial {I}ntelligence; {P}lanning problem; {C}omplexity}, language={{A}nglais}, affiliation={{C}omputer {S}cience {D}ept, {Q}ueen {M}ary, {U}niversity of {L}ondon - {QUEEN} {MARY} {COLLEGE} - {U}niversity of {L}ondon - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={84-119 }, journal={{T}heoretical {C}omputer {S}cience }, volume={379 }, number={1-2 }, audience={non sp{\'e}cifi{\'e}e }, doi={10.1016/j.tcs.2007.01.022 }, day={12}, month={06}, year={2007}, URL={dx.doi.org/10.1016/j.tcs.2007.01.022 http://hal.archives-ouvertes.fr/hal-00153226/en/}, } %% hal-00162106, version 1 %% http://hal.archives-ouvertes.fr/hal-00162106/en/ @article{WEISSENBACHER:2007:HAL-00162106:1, title={{L}es r{\'e}seaux bay{\'e}siens: un formalisme adapt{\'e} au traitement automatique des langues ?}, author={{W}eissenbacher, {D}avy}, abstract={{M}any problems in natural language processing ({NLP}) can be formulated as classification problems. {T}he complexity of the natural language make it difficult to select the discriminating attributes for a given task, the reliability of attribute values is often dubious and vary with the domain of the corpus. {T}his article argues that the bayesian network formalism is well adapted for the classification of this type of data. {W}e have estimated the benefit brought by the bayesian classifior on a real {NLP} application: the distinction between the impersonal and anaphoric occurrences of the english pronoun 'it'. {A}fter having implemented various state of the art systems able to perform this distinction, we have integrated them within a single classifior. {E}ach system has been tested on two different domain corpora. {T}he results obtained by our classifior are significantly better than those of the state of the art systems.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={371-389 }, journal={{R}evue d\'{I}ntelligence {A}rtificielle }, volume={21 }, number={3 }, audience={nationale }, day={01}, month={06}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00162106/en/}, } %% hal-00019515, version 1 %% http://hal.archives-ouvertes.fr/hal-00019515/en/ @article{BAILLOT:2006:HAL-00019515:1, title={{O}n {L}ight {L}ogics, {U}niform {E}ncodings and {P}olynomial {T}ime.}, author={{B}aillot, {P}atrick and {D}al {L}ago, {U}go}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={{\`a} para{\^i}tre }, journal={{M}athematical {S}tructures in {C}omputer {S}cience }, volume={{\`a} para{\^i}tre }, note={21 pp. partiellement support{\'e} par projets {GEOCAL} ({ACI}), {NO}-{C}o{ST} ({ANR}), {I}nteraction et complexit{\'e} ({CNRS}-{CNR}) }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00019515/en/}, } %% hal-00152872, version 1 %% http://hal.archives-ouvertes.fr/hal-00152872/en/ @article{BANDERIER:2006:HAL-00152872:1, title={{A}nalytic combinatorics of lattice paths: enumeration and asymptotics for the average area}, author={{B}anderier, {C}yril and {G}ittenberger, {B}ernhard}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nstitut f{\"u}r {D}iskrete {M}athematik und {G}eometrie - {T}echnische {U}niversit{\"a}t {W}ien }, pages={345-355 }, journal={{D}iscrete {M}athematics \& {T}heoretical {C}omputer {S}cience }, volume={{AG} }, audience={non sp{\'e}cifi{\'e}e }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00152872/en/}, } %% halshs-00161906, version 1 %% http://halshs.archives-ouvertes.fr/halshs-00161906/en/ @article{BATTISTELLI:2006:HALSHS-00161906:1, title={{R}epr{\'e}sentation des expressions calendaires dans les textes : vers une application {\`a} la lecture assist{\'e}e de biographies}, author={{B}attistelli, {D}elphine and {M}inel, {J}ean-{L}uc and {R}. {S}chwer, {S}ylviane}, abstract={{C}et article aborde le probl{\`e}me de la repr{\'e}sentation formelle des expressionscalendaires et en pr{\'e}sente une analyse fonctionnelle, fond{\'e}e sur la repr{\'e}sentation cat{\'e}goriquedes ordinaux. {I}l expose ensuite un projet d'aide {\`a} la lecture d'un texte biographique longselon une navigation temporelle.}, keywords={annotation, temps, discours, calendriers, navigation textuelle.}, language={{F}ran{\c{c}}ais}, affiliation={{L}angues, logiques, informatiques, cognition et communication - {L}a{LIC} - {CNRS} : {UMR}8139 - {U}niversit{\'e} {P}aris-{S}orbonne - {P}aris {IV} - {M}od{\`e}les, {D}ynamiques, {C}orpus - {M}o{D}y{C}o - {CNRS} : {UMR}7114 - {U}niversit{\'e} de {P}aris {X} - {N}anterre - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={11-37 }, journal={{T}raitement {A}utomatique des {L}angues }, volume={47 }, number={3 }, audience={internationale }, year={2006}, URL={http://halshs.archives-ouvertes.fr/halshs-00161906/en/}, } %% hal-00082732, version 1 %% http://hal.archives-ouvertes.fr/hal-00082732/en/ @article{CASTRODEANDRADE:2006:HAL-00082732:1, title={{P}artitionning strategies for two-stages stochastic integer problems}, author={{C}astro {D}e {A}ndrade, {R}afael and {L}isser, {A}bdel and {M}aculan, {N}elson and {P}lateau, {G}{\'e}rard}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} }, pages={10 pages }, journal={{M}anagement {S}cience }, volume={{\`a} para{\^i}tre }, note={{OCAD} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00082732/en/}, } %% hal-00096735, version 1 %% http://hal.archives-ouvertes.fr/hal-00096735/en/ @article{CERIN:2006:HAL-00096735:1, title={{A} multithreaded {SQL} service}, author={{C}{\'e}rin, {C}hristophe and {G}audiot {M}ichel {K}oskas, {J}ean-{L}uc}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={245-259 }, journal={{P}arallel {P}rocessing {L}etters }, volume={{V}ol. 16, {N}o. 2 }, doi={10.1142/{S}0129626406002605 }, year={2006}, URL={dx.doi.org/10.1142/{S}0129626406002605 http://hal.archives-ouvertes.fr/hal-00096735/en/}, } %% hal-00153735, version 1 %% http://hal.archives-ouvertes.fr/hal-00153735/en/ @article{CHOPPY:2006:HAL-00153735:1, title={{A} {F}ormally {G}rounded {S}oftware {S}pecification {M}ethod}, author={{C}hoppy, {C}hristine and {R}eggio, {G}ianna}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={52-86 }, journal={{J}ournal of {L}ogic and {A}lgebraic {P}rogramming }, volume={67 }, number={1-2 }, note={{E}lsevier }, audience={non sp{\'e}cifi{\'e}e }, collaboration={avec {G}ianna {REGGIO} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153735/en/}, } %% hal-00153257, version 1 %% http://hal.archives-ouvertes.fr/hal-00153257/en/ @article{DALLAGO:2006:HAL-00153257:1, title={{O}n {L}ight {L}ogics, {U}niform {E}ncodings and {P}olynomial {T}ime.}, author={{D}al {L}ago, {U}go and {B}aillot, {P}atrick}, keywords={linear logic, implicit computational complexity, polynomial time complexity}, language={{A}nglais}, affiliation={{U}niversit{\`a} di {B}ologna - {UNIBO} - {U}niversit{\`a} degli studi di {B}ologna - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={713-733 }, journal={{M}athematical {S}tructures in {C}omputer {S}cience }, volume={16 }, number={4 }, note={{P}rojets {GEOCAL} ({ACI} {NIM}), {NO}-{C}ost ({ANR}, {JC}05_43380), {I}nteraction et {C}omplexit{\'e} (projet de coop{\'e}ration {CNR}-{CNRS}, no 16251) }, audience={internationale }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153257/en/}, } %% hal-00082670, version 1 %% http://hal.archives-ouvertes.fr/hal-00082670/en/ @article{HAKEM:2006:HAL-00082670:1, title={{C}ritical {P}ath {S}cheduling {P}arallel {P}rograms on an {U}nbounded {N}umber of {P}rocessors}, author={{H}akem, {M}ourad and {B}utelle, {F}ranck}, abstract={{I}n this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called {T}he {D}ynamic {C}ritical {P}ath {S}cheduling {DCPS}. {T}he {DCPS} is superior to several other algorithms from the literature in terms of computational complexity, processors consumption and solution quality. {DCPS} has a time complexity of {O} (e + v\log v), as opposed to {DSC} algorithm {O}((e + v)\log v) which is the best known algorithm. {E}xperimental results demonstrate the superiority of {DCPS} over the {DSC} algorithm.}, keywords={{S}cheduling; clustering; distributed computing; precedence task graphs; directed acyclic graphs {DAG}s; parallel scheduling}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={287--301 }, journal={{I}nternational {J}ournal of {F}oundations of {C}omputer {S}cience }, volume={17 }, audience={internationale }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00082670/en/}, } %% hal-00084195, version 1 %% http://hal.archives-ouvertes.fr/hal-00084195/en/ @article{KANAWATI:2006:HAL-00084195:1, title={{A}n intelligent peer-to-peer multi-agent systemfor collaborative management of bibliographic databases}, author={{K}anawati, {R}ushed and {K}aroui, {H}ager and {P}etrucci, {L}aure}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={22-31 }, journal={{SGAI}'s {E}xpert {U}pdate {M}agazine }, volume={8(3) }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084195/en/}, } %% hal-00084199, version 1 %% http://hal.archives-ouvertes.fr/hal-00084199/en/ @article{KORDON:2006:HAL-00084199:1, title={{T}oward formal methods oecumenism?}, author={{K}ordon, {F}abrice and {P}etrucci, {L}aure}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={number 7 }, journal={{D}istributed {S}ystems {O}nline }, volume={7 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084199/en/}, } %% hal-00084191, version 1 %% http://hal.archives-ouvertes.fr/hal-00084191/en/ @article{LAKOS:2006:HAL-00084191:1, title={{M}odular {S}tate {S}pace {E}xploration for {T}imed {P}etri {N}ets}, author={{L}akos, {C}harles and {P}etrucci, {L}aure}, keywords={{T}imed {P}etri nets ; {M}odular analysis}, language={{A}nglais}, affiliation={{U}niversity of {A}delaide, {D}epartment of {C}omputer {S}cience - {U}niversity of {A}delaide - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={_ }, journal={{S}oftware {T}ools for {T}echnology {T}ransfer ({STTT}) }, volume={8 }, note={{\`a} para{\^i}tre }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084191/en/}, } %% hal-00084608, version 1 %% http://hal.archives-ouvertes.fr/hal-00084608/en/ @article{LAVAULT:2006:HAL-00084608:1, title={{A}symptotic {A}nalysis of a {L}eader {E}lection {A}lgorithm}, author={{L}avault, {C}hristian and {L}ouchard, {G}uy}, abstract={{I}tai and {R}odeh showed that, on the average, the communication of a leader election algorithm takes no more than ${LN}$ bits, where ${L} \simeq 2.441716$ and ${N}$ denotes the size of the ring. {W}e give a precise asymptotic analysis of the average number of rounds ${M}(n)$ required by the algorithm, proving for example that $\dis {M}(\infty) := \lim_{n\to \infty} {M}(n) = 2.441715879\ldots$, where $n$ is the number of starting candidates in the election. {A}ccurate asymptotic expressions of the second moment ${M}^{(2)}(n)$ of the discrete random variable at hand, its probability distribution, and the generalization to all moments are given. {C}orresponding asymptotic expansions $(n\to \infty)$ are provided for sufficiently large $j$, where $j$ counts the number of rounds. {O}ur numerical results show that all computations perfectly fit the observed values. {F}inally, we investigate the generalization to probability $t/n$, where $t$ is a non negative real parameter. {T}he real function $\dis {M}(\infty,t) := \lim_{n\to \infty} {M}(n,t)$ is shown to admit \textit{one unique minimum} ${M}(\infty,t^{*})$ on the real segment $(0,2)$. {F}urthermore, the variations of ${M}(\infty,t)$ on thewhole real line are also studied in detail.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {D}{\'e}partement d'{I}nformatique - {ULB} - {U}niversit{\'e} {L}ibre de {B}ruxelles }, pages={239-254 }, journal={{T}heoretical {C}omputer {S}cience }, volume={359 }, number={1-3 }, audience={internationale }, ARXIVID={cs.DC/0607032 }, day={14}, month={08}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084608/en/}, } %% hal-00085254, version 1 %% http://hal.archives-ouvertes.fr/hal-00085254/en/ @article{RAVELOMANANA:2006:HAL-00085254:1, title={{O}ptimal {I}nitialization and {G}ossiping {A}lgorithms for {R}andom {R}adio {N}etworks}, author={{R}avelomanana, {V}lady}, abstract={{T}he initialization problem, also known as naming, consists to give a unique identifier ranging from $1$ to $n$ to a set of $n$ indistinguishable nodes in a given network. {W}e consider a network where $n$ nodes (processors) are randomly deployed in a square (resp. cube) ${X}$. {W}e assume that the time is slotted and the network is synchronous, two nodes are able to communicate if they are within distance at most of $r$ of each other ($r$ is the transmitting/receiving range). {M}oreover, if two or more neighbors of a processor $u$ transmit concurrently at the same time slot, then $u$ would not receive either messages. {W}e suppose also that the anonymous nodes know neither the topology of the network nor the number of nodes in the network. {U}nder this extremal scenario, we first show how the transmitting range of the deployed processors affects the typical characteristics of the network. {T}hen, by allowing the nodes to transmit at various ranges we design sub-linear randomized initialization protocols~: {I}n the two, resp. three, dimensional case, our randomized initialization algorithms run in ${O}(n^{1/2} \log{n}^{1/2})$, resp. ${O}(n^{1/3} \log{n}^{2/3})$, time slots. {T}hese latter protocols are based upon an optimal gossiping algorithm which is of independent interest.}, keywords={{M}ultihop networks; self-configuration in ad hoc networks; randomized distributed protocols; initialization; naming; gossiping; broadcasting; information dissemination; fundamental limits of random radio networks.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={{XXX}--{YYY} }, journal={{IEEE} {T}ransactions on {P}arallel and {D}istributed {S}ystems }, volume={{\`a} para{\^i}tre }, note={{C}.2.2, {C}.2.4 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085254/en/}, } %% hal-00085226, version 1 %% http://hal.archives-ouvertes.fr/hal-00085226/en/ @article{RAVELOMANANA:2006:HAL-00085226:1, title={{T}he {A}verage {S}ize of {G}iant {C}omponents {B}etween the {D}ouble-{J}ump}, author={{R}avelomanana, {V}lady}, abstract={{W}e study the sizes of connected components according to their excesses during a random graph process built with $n$ vertices. {T}he considered model is the continuous one defined in {J}anson 2000. {A}n ${\ell}$-component is a connected component with ${\ell}$ edges more than vertices. $\ell$ is also called the \textit{excess} of such component. {A}s our main result, we show that when $\ell$ and ${n \over \ell}$ are both large, the expected number of vertices that ever belong to an $\ell$-component is about ${12}^{1/3} {\ell}^{1/3} n^{2/3}$. {W}e also obtain limit theorems for the number of creations of $\ell$-components.}, keywords={{R}andom graphs; giant components; double-jump; probabilistic/analytic combinatorics}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={{A} para{\^i}tre }, journal={{A}lgorithmica }, volume={{I}ssue sp{\'e}ciale "{A}nalysis of {A}lgorithms" }, note={{A} para{\^i}tre dans {A}lgorithmica {G}.2.1; {G}.2.2; {G}.3 }, collaboration={{P}rojet {PAI} {A}madeus }, ARXIVID={cs.DS/0607057 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085226/en/}, } %% hal-00084672, version 1 %% http://hal.archives-ouvertes.fr/hal-00084672/en/ @article{SCHWER:2006:HAL-00084672:1, title={{HENRI} {AUGUSTE} {DELANNOY}, {UNE} {BIOGRAPHIE}}, author={{S}chwer, {S}ylviane and {A}utebert, {J}ean-{M}ichel}, abstract={{L}es travaux du math{\'e}maticien {D}elannoy (1833-1915), qui {\'e}taient tomb{\'e}s dans l'oubli, ont suscit{\'e} r{\'e}cemment un vif int{\'e}r{\^e}t, en raison des nombreux objets qui sont d{\'e}nombr{\'e}s par les suites associ{\'e}es {\`a} son nom. {E}n effet, ces suites ont {\'e}merg{\'e} dans des travaux aussi divers que la repr{\'e}sentation et le raisonnement spatio-temporel en informatique et en linguistique, en biologie ou en physique th{\'e}orique. {N}ous nous proposons ici de remettre {\`a} l'honneur ce math{\'e}maticien m{\'e}connu. {S}on parcours, bien que modeste, nous {\'e}claire sur la soci{\'e}t{\'e} math{\'e}matique de la fin du dix-neuvi{\`e}me si{\`e}cle. {D}ans ce premier article nous pr{\'e}sentons les {\'e}l{\'e}ments connus de sa vie, en particulier de son activit{\'e} de math{\'e}maticien. {N}ous fournissons notamment une revue compl{\`e}te de ses publications. {E}n annexe, le lecteur trouvera la description de la biblioth{\`e}que math{\'e}matique donn{\'e}e en h{\'e}ritage par {D}elannoy {\`a} la biblioth{\`e}que municipale de {G}u{\'e}ret et ce qu'il en est advenu. {D}ans un second article, nous traiterons de fa{\c{c}}on approfondie de son apport majeur : l'usage des {\'e}chiquiers arithm{\'e}tiques dans la r{\'e}solution de probl{\`e}mes combinatoires et probabilistes et les applications actuelles.}, keywords={biographie, delannoy, {H}istoire de la combinatoire}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {UFR} d'informatique - {U}niversit{\'e} {D}enis {D}iderot - {P}aris {VII} }, pages={25-67 }, journal={{M}ath{\'e}matiques et {S}ciences {H}umaines }, volume={174 }, note={{C}ette biographie traite en annexe du legs de la biblioth{\`e}que math{\'e}matique de {D}elannoy {\`a} la ville de {G}u{\'e}ret. 01{A}70 01{A}55 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084672/en/}, } %% hal-00083113, version 1 %% http://hal.archives-ouvertes.fr/hal-00083113/en/ @article{THIONGANE:2006:HAL-00083113:1, title={{L}agangean heuristics combined with reoptimization for the 0-1 biknapsack problem}, author={{T}hiongane, {B}abacar and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={pages 2200-2211 }, journal={{D}iscrete {A}pplied {M}athematics }, volume={154 }, note={{OCAD} }, audience={non sp{\'e}cifi{\'e}e }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00083113/en/}, } %% hal-00092307, version 1 %% http://hal.archives-ouvertes.fr/hal-00092307/en/ @article{ZARGAYOUNA:2006:HAL-00092307:1, title={{I}nd{D}oc: {A}n aid for the back-of-the-book indexer}, author={{Z}argayouna, {H}aifa and {A}it {E}l {M}ekki, {T}ouria and {A}udibert, {L}aurent and {N}azarenko, {A}deline}, abstract={{LIPN} ({L}aboratoire d'{I}nformatique de {P}aris {N}ord) has been developing a programme ({I}nd{D}oc) which uses {N}atural {L}anguage {P}rocessing techniques to ease the task of the back-of-the-book indexer. {T}his article describes the main features of the system and invites feedback from readers.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{E}tude et de {R}echerche en {I}nformatique d'{A}ngers - {LERIA} - {U}niversit{\'e} d'{A}ngers }, pages={122-125 }, journal={{T}he {I}ndexer }, volume={25(2) }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00092307/en/}, } %% hal-00085611, version 1 %% http://hal.archives-ouvertes.fr/hal-00085611/en/ @article{AFRATI:2005:HAL-00085611:1, title={{S}cheduling trees with large communication delays on two identical processors}, author={{A}frati, {F}oto and {B}ampis, {E}uripidis and {F}inta, {L}ucian and {M}ilis, {I}oannis}, abstract={{W}e consider the problem of scheduling trees on two identical processors in order to minimize the makespan. {W}e assume that tasks have unit execution times, and arcs are associated with large identical integer communication delays. {W}e prove that the problem is {NP}-hard in the strong sense even when restricted to the class of binary trees, and we provide a polynomial-time algorithm for complete binary trees.}, keywords={scheduling; makespan; communication delays; trees; two processors}, language={{A}nglais}, affiliation={{N}ational {T}echnical {U}niversity {A}thens - {NTUA} - {U}niversite d athenes - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={179-190 }, journal={{J}ournal of {S}cheduling }, volume={8(2) }, note={{T}his work has been partially supported by the {F}rench-{G}reek bilateral exchange program {PLATON} and the {GDR}-{PRS} "{O}rdonnancement pour le parall{\'e}lisme" program of the {F}rench government. }, doi={10.1007/s10951-005-6366-3 }, year={2005}, URL={dx.doi.org/10.1007/s10951-005-6366-3 http://hal.archives-ouvertes.fr/hal-00085611/en/}, } %% hal-00003233, version 1 %% http://hal.archives-ouvertes.fr/hal-00003233/en/ @article{BANDERIER:2005:HAL-00003233:1, title={{W}hy {D}elannoy numbers?}, author={{B}anderier, {C}yril and {S}chwer, {S}ylviane}, abstract={{T}his article is not a research paper, but a little note on the history of combinatorics: {W}e present here a tentative short biography of {H}enri {D}elannoy, and a survey of his most notable works. {T}his answers to the question raised in the title, as these works are related to lattice paths enumeration, to the so-called {D}elannoy numbers, and were the first general way to solve {B}allot-like problems. {T}hese numbers appear in probabilistic game theory, alignments of {DNA} sequences, tiling problems, temporal representation models, analysis of algorithms and combinatorial structures.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={40-54 }, journal={{J}ournal of {S}tatistical {P}lanning and {I}nference }, volume={135 }, number={1 }, note={{A} preliminary version of this article constituted a part of {C}ryil {B}anderier's talk at the conference "{L}attice {P}aths {C}ombinatorics and {D}iscrete {D}istributions" ({A}thens, {J}une 5-7, 2002). {T}he final version appeared in the {J}ournal of {S}tatistical {P}lanning and {I}nferences. }, audience={internationale }, ARXIVID={math.CO/0411128 }, month={11}, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00003233/en/}, } %% hal-00082726, version 1 %% http://hal.archives-ouvertes.fr/hal-00082726/en/ @article{CASTRODEANDRADE:2005:HAL-00082726:1, title={{B} \& {B} frameworks for the capacity expansion of high speed telecommunication network under uncertainty}, author={{C}astro {D}e {A}ndrade, {R}afael and {L}isser, {A}bdel and {M}aculan, {N}elson and {P}lateau, {G}{\'e}rard}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} }, pages={n1 pages 49-65 }, journal={{A}nnals of {O}perations {R}esearch }, volume={140 }, note={{OCAD} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00082726/en/}, } %% hal-00096725, version 1 %% http://hal.archives-ouvertes.fr/hal-00096725/en/ @article{CERIN:2005:HAL-00096725:1, title={{P}arallel {O}ut-of-core {S}orting and {F}ast {A}ccesses to {D}isks}, author={{C}{\'e}rin, {C}hristophe and {C}ozette, {O}livier and {U}tard, {G}il and {F}kaier, {H}azem and {J}emni, {M}ohamed}, abstract={{T}he paper addresses two problems. {W}e investigate the problem of parallel external sorting in the context of a form of heterogeneous clusters then we investigate the impact of efficient disk remote accesses on the performance of external sorting. {W}e explore three techniques to show how they can be deployed for clusters with proportional processor performances. {W}e also validate the {READ}2 library, an efficient implementation of remote {SCSI} disk accesses. {W}e derive a new parallel sorting algorithm that is adapted to the {READ}2 interface. {T}he expected gain of using {READ}2 is compared to the measured gain for one external sorting implementation.}, keywords={out-of-core sorting; parallel sorting; performance evaluation; {READ}2; sorting algorithms; data distribution; load balancing; {I}/{O} bandwidth; disk bandwidth; remote {I}/{O}; system area network.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {REMAP} - {INRIA} {R}h{\^o}ne-{A}lpes / {LIP} {L}aboratoire de l'{I}nformatique du {P}arall{\'e}lisme - {INRIA} - {E}cole {N}ormale {S}up{\'e}rieure de {L}yon - {ENS} {L}yon - {CNRS} : {UMR}5668 - {LIP} - {U}nit{\'e} {T}echnologie de l'{I}nformation et de la {C}ommunication - {UTIC} - {\'E}cole {S}up{\'e}rieure des {S}ciences et {T}echnologies de {T}unis }, pages={188-202 }, journal={{I}nternational {J}ournal on {H}igh {P}erformance {C}omputing and {N}etworking }, volume={3 }, note={http://www.inderscience.com/browse/index.php?journal{ID}=61\&year=2005\&vol=3\&issue=2/3 }, audience={non sp{\'e}cifi{\'e}e }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00096725/en/}, } %% hal-00153744, version 1 %% http://hal.archives-ouvertes.fr/hal-00153744/en/ @article{CHOPPY:2005:HAL-00153744:1, title={{A}rchitectural {P}atterns for {P}roblem {F}rames}, author={{C}hoppy, {C}hristine and {H}eisel, {M}aritta and {H}atebur, {D}enis}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={198-208 }, journal={{IEE} {P}roceedings - {S}oftware, {S}pecial {I}ssue on {R}elating {S}oftware {R}equirements and {A}rchitectures }, volume={152 }, number={4 }, audience={internationale }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00153744/en/}, } %% hal-00153739, version 1 %% http://hal.archives-ouvertes.fr/hal-00153739/en/ @article{CHOPPY:2005:HAL-00153739:1, title={{A} {UML}-{B}ased {A}pproach for {P}roblem {F}rame {O}riented {S}oftware {D}evelopment}, author={{C}hoppy, {C}hristine and {R}eggio, {G}ianna}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={929-954 }, journal={{J}ournal of {I}nformation and {S}oftware {T}echnology }, volume={47 }, note={{E}lsevier }, audience={internationale }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00153739/en/}, } %% hal-00003243, version 2 %% http://hal.archives-ouvertes.fr/hal-00003243/en/ @article{COSTA:2005:HAL-00003243:2, title={{M}ulticut and integral multiflow : a survey.}, author={{C}osta, {M}arie-{C}hristine and {L}{\'e}tocart, {L}ucas and {R}oupin, {F}r{\'e}d{\'e}ric}, abstract={{W}e present a survey about the maximum integral multiflow and minimum multicut problems and their subproblems, such as the multiterminal cut and the unsplittable flow problems. {W}e consider neither continuous multiflow nor minimum cost multiflow. {M}ost of the results are very recent and some are new. {W}e recall the dual relationship between both problems, give complexity results and algorithms, firstly in unrestricted graphs and secondly in several special graphs: trees, bipartite or planar graphs. {A} table summarizes the most important results.}, keywords={integer multicommodity flows, minimum multicut, multiway cut, complexity, approximation}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers }, pages={55-69 }, journal={{E}uropean {J}ournal of {O}perational {R}esearch }, volume={162-1 }, audience={non sp{\'e}cifi{\'e}e }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00003243/en/}, } %% hal-00088069, version 1 %% http://hal.archives-ouvertes.fr/hal-00088069/en/ @article{CZACHORSKI:2005:HAL-00088069:1, title={{A} novel diffusion process with jumps to study an electronic-optical edge router}, author={{C}zachorski, {T}adeusz and {P}ekergin, {F}erhan}, abstract={{T}he article presents a diffusion approximation model applied to investigate the process of filling a large optical packet by smaller and coming irregularly electronic packets. {T}he use of diffusion approximation enables us to include the general distributions of interarrival times, also the self-similarity of the input process, as well as to investigate transient states. {W}e propose a novel diffusion process with jumps representing the end of the filling the buffer due to arrival of too large packet and we give the transient solution to this process. {T}he model allows us to study the distribution of interdeparture times and the distribution of the space occupied in the optical packet.}, keywords={{D}iffusion approximation;{A}ll-optical networks;self-similarity}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nstytut {I}nformatyki {T}eoretycznej i {S}tosowanej {P}olskiej {A}kademii {N}auk - {IITIS} {PAN} - {P}olska {A}kademia {N}auk }, pages={76-88, {N}o:2 }, journal={{A}rchiwum {I}nformatyki {T}eoretycznej i {S}tosowanej }, volume={17 }, note={{I}.6.5 }, collaboration={{P}rojet de coop{\'e}ration {CNRS} - {PAN} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00088069/en/}, } %% hal-00016690, version 1 %% http://hal.archives-ouvertes.fr/hal-00016690/en/ @article{DESPRES:2005:HAL-00016690:1, title={{C}onstruction d'une ontologie formelle {\`a} partir d'un texte de droit communautaire}, author={{D}espr{\'e}s, {S}ylvie and {S}zulman, {S}ylvie}, keywords={ontologie regionale; ontologie g{\'e}n{\'e}rique du droit; construction d'ontologie {\`a} partir de textes; analyse linguistique}, language={{F}ran{\c{c}}ais}, affiliation={{CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={261-281 }, journal={{I}nternational journal of theoretical and applied issues in specialized communication }, volume={11 -number 2 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00016690/en/}, } %% hal-00077411, version 1 %% http://hal.archives-ouvertes.fr/hal-00077411/en/ @article{GUERRAHERNANDEZ:2005:HAL-00077411:1, title={{O}n learning intentionally}, author={{G}uerra {H}ernandez, {A}lejandro and {E}l {F}allah-{S}eghrouchni, {A}mal and {S}oldano, {H}enry}, keywords={{I}ntelligence artificielle; {A}pprentissage; {S}yst{\`e}mes {M}ulti-{A}gents}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={9-18 }, journal={{I}nteligencia {A}rtificial, {R}evista {I}beroamericana de {I}nteligencia {A}rtificial. }, volume={25 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00077411/en/}, } %% hal-00084990, version 1 %% http://hal.archives-ouvertes.fr/hal-00084990/en/ @article{HAMDOUN:2005:HAL-00084990:1, title={{I}ntegration techniques to build a data warehouse using heterogeneous data sources}, author={{H}amdoun, {S}ana and {B}oufares, {F}aouzi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={x }, journal={{J}ournal of {C}omputer and {S}ystem {S}ciences ({JCSS}) }, volume={x }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084990/en/}, } %% hal-00091643, version 1 %% http://hal.archives-ouvertes.fr/hal-00091643/en/ @article{KAYSER:2005:HAL-00091643:1, title={{A}bout {N}orms and {C}auses}, author={{K}ayser, {D}aniel and {N}ouioua, {F}arid}, abstract={{K}nowing the norms of a domain is crucial, but there exists no repository of norms. {W}e propose a method to extract them from texts: narrative texts generally do not describe a norm, but rather the discrepancies between what actually happened, and the corresponding normal sequence of events. {A}nswers about the causes of an event often reveal the implicit norms. {W}e apply this idea to the domain of driving, and validate it by designing algorithms that identify, in a text, the “basic” norms to which it refers implicitly.}, keywords={{C}ausal reasoning; {N}on-monotonic {L}ogic; {N}orms; {N}atural {L}anguage {U}nderstanding; {N}atural {L}anguage {S}emantics}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={7-23 }, journal={{I}nternational {J}ournal on {A}rtificial {I}ntelligence {T}ools }, volume={14 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00091643/en/}, } %% hal-00085144, version 1 %% http://hal.archives-ouvertes.fr/hal-00085144/en/ @article{KAYSER:2005:HAL-00085144:1, title={{A}bout {N}orms and {C}auses}, author={{K}ayser, {D}aniel and {N}ouioua, {F}arid}, abstract={{K}nowing the norms of a domain is crucial, but there exists no repository of norms. {W}e propose a method to extract them from texts: narrative texts generally do not describe a norm, but rather the discrepancies between what actually happened, and the corresponding normal sequence of events. {A}nswers about the causes of an event often reveal the implicit norms. {W}e apply this idea to the domain of driving, and validate it by designing algorithms that identify, in a text, the “basic” norms to which it refers implicitly.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={7-23 }, journal={{I}nternational {J}ournal on {A}rtificial {I}ntelligence {T}ools }, volume={14(1-2) }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00085144/en/}, } %% hal-00098030, version 1 %% http://hal.archives-ouvertes.fr/hal-00098030/en/ @article{NAZARENKO:2005:HAL-00098030:1, title={{B}uilding back-of-the-book indexes}, author={{N}azarenko, {A}deline and {A}{\"i}t {E}l {M}ekki, {T}ouria}, abstract={{T}his paper presents an original natural language processing ({NLP}) approach for building of back-of-the-book indexes. {O}ur indexing system, {I}nd{D}oc, exploits some terminological tools and automatically builds an index draft out of the analysis of the document text. {T}he indexer then has to validate that index draft through a dedicated interface. {T}his approach has been tested on several documents, with promising results. {R}elying on our experience in developing and testing the {I}nd{D}oc indexing system, we aim at assessing the contribution of terminological analysis as well as the level of maturity that computational terminology has reached, in the indexing perspective.}, keywords={{T}erminology ; indexing ; natural language processing ;back-of-the book index}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={193-218 }, journal={{T}erminology }, volume={11(1) }, note={24 pages {H}.3.1 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00098030/en/}, } %% hal-00084188, version 1 %% http://hal.archives-ouvertes.fr/hal-00084188/en/ @article{PETRUCCI:2005:HAL-00084188:1, title={{FAST} verification of the class of {S}top-and-{W}ait {P}rotocols {M}odelled by {C}oloured {P}etri {N}ets}, author={{P}etrucci, {L}aure and {B}illington, {J}onathan and {G}allasch, {G}uy}, keywords={{C}oloured {P}etri {N}ets ; counter systems ; parametric verification}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omputer {S}ystems {E}ngineering {C}entre - {CSEC} - {U}niversity of {S}outh {A}ustralia }, pages={275-307 }, journal={{N}ordic {J}ournal of {C}omputing }, volume={12 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084188/en/}, } %% hal-00084187, version 1 %% http://hal.archives-ouvertes.fr/hal-00084187/en/ @article{PETRUCCI:2005:HAL-00084187:1, title={{B}uilding an {API} for {ISO}/{IEC} 15909, based on model-engineering techniques}, author={{P}etrucci, {L}aure and {H}illah, {L}om and {K}ordon, {F}abrice and {T}r{\`e}ves, {N}icolas}, keywords={{P}etri nets ; standardisation}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers }, pages={_ }, journal={{P}etri {N}et {N}ewsletter }, volume={69 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084187/en/}, } %% hal-00012227, version 1 %% http://hal.archives-ouvertes.fr/hal-00012227/en/ @article{PETRUCCI:2005:HAL-00012227:1, title={{C}over {P}icture {S}tory: {E}xperiments with {M}odular {S}tate {S}paces}, author={{P}etrucci, {L}aure}, abstract={{T}he main analysis techniques for critical systems use state space exploration. {H}owever, one is often quickly limited by the so-called state space explosion problem, even if the systems models are relatively small. {S}everal methods have been proposed to tackle this problem in order to get a manageable state space. {O}ne of these takes advantage of the modular structure of the model in order to build a modular state space, which is basically a set of local state spaces plus a synchronisation graph indicating the global behaviour. {I}n this paper, we present a few case studies and compare the state space sizes with those of the full state space. {T}he results are discussed, pointing out the criteria the model should satisfy for the technique to be efficient.}, keywords={{P}etri nets, modularity, state spaces}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={cover and 5-10 }, journal={{P}etri {N}et {N}ewsletter }, volume={68 }, note={{ACM}: {D}2.2 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00012227/en/}, } %% hal-00085004, version 1 %% http://hal.archives-ouvertes.fr/hal-00085004/en/ @article{RECANATI:2005:HAL-00085004:1, title={{R}aisonner avec des diagrammes : perspectives cognitives et computationnelles}, author={{R}ecanati, {C}atherine}, abstract={{D}iagrammatic, analogical or iconic representations are often contrasted with linguistic or logical representations, in which the shape of the symbols is arbitrary. {T}he aim of this paper is to make a case for the usefulness of diagrams in inferential knowledge representation systems. {A}lthough commonly used, diagrams have for a long time suffered from the reputation of being only a heuristic tool or a mere support for intuition. {T}he first part of this paper is an historical background paying tribute to the logicians, psychologists and computer scientists who put an end to this formal prejudice against diagrams. {T}he second part is a discussion of their characteristics as opposed to those of linguistic forms. {T}he last part is aimed at reviving the interest for heterogeneous representation systems including both linguistic and diagrammatic representations.}, keywords={diagrammes; raisonnement diagrammatique; repr{\'e}sentations iconiques; repr{\'e}sentations analogiques; syst{\`e}me de repr{\'e}sentation h{\'e}t{\'e}rog{\`e}ne; syst{\`e}me inf{\'e}rentiel; mod{\'e}lisation cognitive;}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={9-42 }, journal={{I}ntellectica }, volume={40 }, note={31 pages }, audience={internationale }, ARXIVID={cs.CL/0607051 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00085004/en/}, } %% hal-00087013, version 1 %% http://hal.archives-ouvertes.fr/hal-00087013/en/ @article{SOLDANO:2005:HAL-00087013:1, title={{T}reillis de {G}alois {A}lpha}, author={{S}oldano, {H}enry and {V}entos, {V}{\'e}ronique}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} }, pages={799-227 }, journal={{R}evue d'{I}ntelligence {A}rtificielle }, volume={19, 4-5 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00087013/en/}, } %% hal-00083108, version 1 %% http://hal.archives-ouvertes.fr/hal-00083108/en/ @article{THIONGANE:2005:HAL-00083108:1, title={{A}dapted step size in a 0-1 biknapsack lagrangean dual solving algorithm}, author={{T}hiongane, {B}abacar and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={pp. 353-373 }, journal={{A}nnals of {O}perations {R}esearch }, volume={139 }, note={{OCAD} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00083108/en/}, } %% hal-00341957, version 1 %% http://hal.archives-ouvertes.fr/hal-00341957/en/ @article{ZEHRAOUI:2005:HAL-00341957:1, title={{N}ew self-organising maps for multivariate sequences processing}, author={{Z}ehraoui, {F}arida and {B}ennani, {Y}oun{\`e}s}, abstract={{S}patio-temporal connectionist networks comprise an important class of neural models that can deal with patterns distributed in both time and space. {I}n this article, we present new models of self-organizing maps for sequence clustering and classification. {W}e have introduced the temporal dynamics in these maps and we have proposed several new models based on covariance matrices computation. {I}n the first models, the inputs are modeled using its associated covariance matrix. {T}hese models, used in speaker recognition, do not take into account the order of the vectors in the sequence. {T}o overcome this drawback, we have proposed new models, which introduce the temporal dynamics in the covariance matrix associated to the input sequences. {I}n order to obtain a network that can learn new knowledge without forgetting the previous learned ones, we have introduced the plasticity and stability properties into one proposed temporal model using the adaptive resonance theory paradigm.}, language={{A}nglais}, affiliation={{I}nformatique, {B}iologie {I}nt{\'e}grative et {S}yst{\`e}mes {C}omplexes - {IBISC} - {CNRS} : {FRE}3190 - {U}niversit{\'e} d'{E}vry-{V}al d'{E}ssonne - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={439--456 }, journal={{I}nternational {J}ournal of {C}omputational {I}ntelligence and {A}pplications }, volume={5 }, audience={internationale }, doi={10.1142/{S}1469026805001684 }, year={2005}, URL={dx.doi.org/10.1142/{S}1469026805001684 http://hal.archives-ouvertes.fr/hal-00341957/en/}, } %% hal-00084642, version 1 %% http://hal.archives-ouvertes.fr/hal-00084642/en/ @article{ZEHRAOUI:2005:HAL-00084642:1, title={{N}ew self-organising maps for multivariate sequences processing}, author={{Z}ehraoui, {F}arida and {B}ennani, {Y}oun{\`e}s}, abstract={{S}patio-temporal connectionist networks comprise an important class of neural models that can deal with patterns distributed in both time and space. {I}n this article, we present new models of self-organizing maps for sequence clustering and classification. {F}irst, we have introduced the temporal dynamics in these maps and we have proposed several new models based on covariance matrices computation. {I}n the first models, the inputs are modelled using its associated covariance matrix. {T}hese models, used in speaker recognition, do not take into account the order of the vectors in the sequence. {T}o overcome this drawback, we have proposed new models, which introduce the temporal dynamics in the covariance matrix associated to the input sequences. {I}n order to obtain a network that can learn new knowledge without forgetting the previous learned ones, we have introduced the plasticity and stability properties into one proposed temporal model using the adaptive resonance theory paradigm.}, keywords={{S}elf-organizing map, {S}equence clustering and classification, {P}lasticity and stability properties.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={439-456 }, journal={{I}nternational {J}ournal of {C}omputational {I}ntelligence and {A}pplications }, volume={{V}ol. 5, {N}° 4 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084642/en/}, } %% hal-00098041, version 1 %% http://hal.archives-ouvertes.fr/hal-00098041/en/ @article{AITELMEKKI:2004:HAL-00098041:1, title={{L}'index de fin de livre, une forme de r{\'e}sum{\'e} indicatif ?}, author={{A}{\"i}t {E}l {M}ekki, {T}ouria and {N}azarenko, {A}deline}, abstract={{B}ack-of-the-book indexes are traditional devices that help readers to get access to document content. {S}uch indexes present the book topics in a different form and order than in the document itself. {I}n this paper, we show that back-of-the-book indexes, which give a synthetic view over the document content, are quite similar to indicative summaries. {T}he new methods that are developed for the fine-grained indexing of documents can be compared with summarization technics. {B}esides their similarities, both types of tools belong to different traditions and the underlying methods are quite different. {T}he confrontation helps to understand the specificity of each approach.}, keywords={{I}ndexation ; automatic summarizing ; term extraction ; terminology structuration ; relevance measure}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={121-150 }, journal={{T}raitement {A}utomatique des {L}angues }, volume={45(1) }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00098041/en/}, } %% hal-00084611, version 1 %% http://hal.archives-ouvertes.fr/hal-00084611/en/ @article{BAILLOT:2004:HAL-00084611:1, title={{T}ype inference for light affine logic via constraints on words.}, author={{B}aillot, {P}atrick}, keywords={{L}inear logic; lambda-calculus; type inference; {L}ight linear logic; implicit computational complexity; polynomial time complexity}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={289-323 }, journal={{T}heoretical {C}omputer {S}cience }, volume={328(3) }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084611/en/}, } %% hal-00084609, version 1 %% http://hal.archives-ouvertes.fr/hal-00084609/en/ @article{BAILLOT:2004:HAL-00084609:1, title={{S}tratified coherence spaces: a denotational semantics for light linear logic.}, author={{B}aillot, {P}atrick}, keywords={{L}inear logic; polynomial time complexity; denotational semantics; proof-nets; implicit computational complexity.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={29-55 }, journal={{T}heoretical {C}omputer {S}cience }, volume={318(1-2): 29-55 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084609/en/}, } %% hal-00084900, version 1 %% http://hal.archives-ouvertes.fr/hal-00084900/en/ @article{BENNACEUR:2004:HAL-00084900:1, title={{A} {C}omparison between {SAT} and {CSP} techniques}, author={{B}ennaceur, {H}achemi}, keywords={{C}onstraint satisfaction; {S}atisfiability}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={123-138 }, journal={{C}onstraints }, volume={9 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084900/en/}, } %% hal-00082534, version 1 %% http://hal.archives-ouvertes.fr/hal-00082534/en/ @article{BLIN:2004:HAL-00082534:1, title={{T}he first {A}pproximated {D}istributed {A}lgorithm for the {M}inimum {D}egree {S}panning {T}ree {P}roblem on {G}eneral {G}raphs}, author={{B}lin, {L}{\'e}lia and {B}utelle, {F}ranck}, abstract={{I}n this paper we present the first distributed algorithm on general graphs for the {M}inimum {D}egree {S}panning {T}ree problem. {T}he problem is {NP}-hard in sequential. {O}ur algorithm give a {S}panning {T}ree of a degree at most 1 from the optimal. {T}he resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves {O}(|{V}|) time complexity and {O}(|{V}| |{E}|) message complexity.}, keywords={{S}yst{\`e}mes distribu{\'e}s et parall{\`e}les; {I}nformatique th{\'e}orique, algorithmique}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={507--516 }, journal={{I}nternational {J}ournal of {F}oundation {C}omputer {S}cience }, volume={15 }, audience={internationale }, doi={10.1142/{S}0129054104002571 }, year={2004}, URL={dx.doi.org/10.1142/{S}0129054104002571 http://hal.archives-ouvertes.fr/hal-00082534/en/}, } %% hal-00083795, version 1 %% http://hal.archives-ouvertes.fr/hal-00083795/en/ @article{BOUFARES:2004:HAL-00083795:1, title={{C}onsistency problems in {ER}-schemas for database systems}, author={{B}oufares, {F}aouzi and {B}ennaceur, {H}achemi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={263-274 }, journal={{I}nformation {S}ciences }, volume={163 }, note={{C}onceptual modeling; {I}nformation system; {E}ntity-relationship model; {C}onstraints }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00083795/en/}, } %% hal-00082535, version 1 %% http://hal.archives-ouvertes.fr/hal-00082535/en/ @article{BUI:2004:HAL-00082535:1, title={{A} {D}istributed {A}lgorithm for the {M}inimum {D}iameter {S}panning {T}ree {P}roblem}, author={{B}ui, {M}arc and {B}utelle, {F}ranck and {L}avault, {C}hristian}, abstract={{W}e present a new algorithm, which solves the problem of distributively finding a minimum diameter spanning tree of any (non-negatively) real-weighted graph {G}=({V},{E},\omega). {A}s an intermediate step, we use a new, fast, linear-time all-pairs shortest paths distributed algorithm to find an absolute center of {G}. {T}he resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves {O}(|{V}|) time complexity and {O}(|{V}| |{E}|) message complexity.}, keywords={{S}yst{\`e}mes distribu{\'e}s et parall{\`e}les - {I}nformatique th{\'e}orique (algorithmique)}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={571--577 }, journal={{J}ournal of {P}arallel and {D}istributed {C}omputing }, volume={64 }, audience={internationale }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00082535/en/}, } %% hal-00082373, version 1 %% http://hal.archives-ouvertes.fr/hal-00082373/en/ @article{CASTRODEANDRADE:2004:HAL-00082373:1, title={{T}elecommunication network capacity design for uncertain demand}, author={{C}astro {D}e {A}ndrade, {R}afel and {L}isser, {A}bdel and {M}aculan, {N}elson and {P}lateau, {G}{\'e}rard}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} }, pages={{N}2 pages 127-146 }, journal={{C}omputational {O}ptimization and {A}pplications }, volume={29 }, note={{OCAD} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00082373/en/}, } %% hal-00353890, version 1 %% http://hal.archives-ouvertes.fr/hal-00353890/en/ @article{CORDIER:2004:HAL-00353890:1, title={{C}onflicts versus {A}nalytical {R}edundancy {R}elations: {A} comparative analysis of the model based diagnosis approach from the {A}rtificial {I}ntelligence and {A}utomatic {C}ontrol perspectives}, author={{C}ordier, {M}arie-{O}dile and {D}ague, {P}hilippe and {L}{\'e}vy, {F}ran{\c{c}}ois and {M}ontmain, {J}acky and {S}taroswiecki, {M}arcel and {T}rav{\'e}-{M}assuy{\`e}s, {L}ouise}, abstract={{T}wo distinct and parallel research communities have been working along the lines of the model-based diagnosis approach: the fault detection and isolation ({FDI}) community and the diagnostic ({DX}) community that have evolved in the fields of automatic control and artificial intelligence, respectively. {T}his paper clarifies and links the concepts and assumptions that underlie the {FDI} analytical redundancy approach and the {DX} consistency- based logical approach. {A} formal framework is proposed in order to compare the two approaches and the theoretical proof of their equivalence together with the necessary and sufficient conditions is provided.}, keywords={{A}nalytical redundancy relation support; fault detection and isolation; model-based diagnosis; parity space approach versus consistency-based logical approach; potential conflict}, language={{A}nglais}, affiliation={{DREAM} - {INRIA} - {IRISA} - {CNRS} : {UMR}6074 - {INRIA} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ennes - {U}niversit{\'e} de {R}ennes 1 - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {G}{\'e}nie {I}nformatique et {I}ng{\'e}nierie de {P}roduction - {LGI}2{P} - {E}cole des {M}ines d'{A}l{\`e}s - {S}yst{\`e}mes et {A}pplications des {T}echnologies de l'{I}nformation et de l'{E}nergie - {SATIE} - {CNRS} : {UMR}8029 - {E}cole {N}ormale {S}up{\'e}rieure de {C}achan - {L}aboratoire d'analyse et d'architecture des syst{\`e}mes - {LAAS} - {CNRS} : {UPR}8001 - {U}niversit{\'e} {P}aul {S}abatier - {T}oulouse {III} - {I}nstitut {N}ational {P}olytechnique de {T}oulouse - {INPT} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {T}oulouse }, pages={xx }, journal={{IEEE} {T}ransactions on {S}ystems, {M}an, and {C}ybernetics—{P}art {B}: {C}ybernetics }, volume={34 }, number={5 }, audience={internationale }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00353890/en/}, } %% hal-00088706, version 1 %% http://hal.archives-ouvertes.fr/hal-00088706/en/ @article{CORDIER:2004:HAL-00088706:1, title={{C}onflicts versus {A}nalytical {R}edundancy {R}elations: a {C}omparative {A}nalysis of the {M}odel {B}ased {D}iagnosis {A}pproach from the {A}rtificial {I}ntelligence and {A}utomatic {C}ontrol {P}erspective}, author={{C}ordier, {M}arie-{O}dile and {D}ague, {P}hilippe and {L}{\'e}vy, {F}ran{\c{c}}ois and {M}ontmain, {J}acky and {S}taroswiecki, {M}arcel and {T}rav{\'e}-{M}assuy{\`e}s, {L}ouise}, abstract={{T}he notions of diagnosis from {A}.{I}. (modeling component's behavior) and from {A}utomatics (modeling {A}nalytic {R}edundancy {R}elations) are compared and merged in a common framework, bridging both domains.}, keywords={{A}.{I}. and {A}utomatics ; {D}iagnostic}, language={{A}nglais}, affiliation={{DREAM} - {INRIA} - {IRISA} - {CNRS} : {UMR}6074 - {INRIA} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ennes - {U}niversit{\'e} de {R}ennes 1 - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {G}{\'e}nie {I}nformatique et {I}ng{\'e}nierie de {P}roduction - {LGI}2{P} - {E}cole des {M}ines d'{A}l{\`e}s - {L}aboratoire d'{I}nformatique et d'{A}utomatique de {L}ille - {LAIL} - {U}niversit{\'e} des {S}ciences et {T}echnologies de {L}ille - {L}ille {I} - {L}aboratoire d'analyse et d'architecture des syst{\`e}mes - {LAAS} - {CNRS} : {UPR}8001 - {U}niversit{\'e} {P}aul {S}abatier - {T}oulouse {III} - {I}nstitut {N}ational {P}olytechnique de {T}oulouse - {INPT} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {T}oulouse }, pages={2163-2177 }, journal={{IEEE} transactions on systems, man and cybernetics }, volume={34 }, audience={non sp{\'e}cifi{\'e}e }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00088706/en/}, } %% hal-00003545, version 1 %% http://hal.archives-ouvertes.fr/hal-00003545/en/ @article{DUCHAMP:2004:HAL-00003545:1, title={{A}lgebraic {E}limination of epsilon-transitions}, author={{D}uchamp, {G}erard and {K}acem, {H}atem {H}adj and {L}augerotte, {E}ric}, abstract={{W}e present here algebraic formulas associating a k-automaton to a k-epsilon-automaton. {T}he existence depends on the definition of the star of matrices and of elements in the semiring k. {F}or this reason, we present the theorem which allows the transformation of k-epsilon-automata into k-automata. {T}he two automata have the same behaviour.}, keywords={{S}tar of matrices; k-epsilon-automata}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={51-70 }, journal={{D}iscrete {M}athematics and {T}heoretical {C}omputer {S}cience }, volume={7 nom{\'e}ro 1 }, note={15 septembre 2003 }, ARXIVID={cs.SC/0401012 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00003545/en/}, } %% hal-00087016, version 1 %% http://hal.archives-ouvertes.fr/hal-00087016/en/ @article{ELZANT:2004:HAL-00087016:1, title={{F}inding {R}epeated {F}lexible {R}elational {W}ords in {S}equences}, author={{E}l-{Z}ant, {N}ahla and {S}oldano, {H}enry}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={// }, journal={{J}ournal of {S}ystemics, {C}ybernetics and {I}nformatics }, volume={2, 4 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00087016/en/}, } %% hal-00098047, version 1 %% http://hal.archives-ouvertes.fr/hal-00098047/en/ @article{GROSS:2004:HAL-00098047:1, title={{Q}uand la langue cause : param{\`e}tres d'une {\'e}tude linguistique de la causalit{\'e}}, author={{G}ross, {G}aston and {N}azarenko, {A}deline}, abstract={{S}tarting from the fact causality and linguistics are strongly related, this paper tries to understand if the language can help to better understand the notion of cause. {W}ithout any a priori definition of causality, we examine the linguistics markers that express causality and we analyse their conditions of use. {T}he linguistic observations actually reveals some properties of the notion of cause but we show that the diversity of causal meaning subtleties cannot get reduced to a traditional typology of causes and that causality is above all a matter of human interpretation.}, keywords={{C}ons{\'e}quence, relation temporelle, concession, interpretation causale, typologie des cause, {\'e}nonciation}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire de linguistique informatique - {LLI} - {CNRS} : {UMR}7546 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}niversit{\'e} {D}enis {D}iderot - {P}aris {VII} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={15-41 }, journal={{I}ntellectica }, volume={38(1) }, note={{H}.3.1 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00098047/en/}, } %% hal-00091636, version 1 %% http://hal.archives-ouvertes.fr/hal-00091636/en/ @article{KAYSER:2004:HAL-00091636:1, title={{M}od{\'e}lisations symboliques du raisonnement causal}, author={{K}ayser, {D}aniel and {L}{\'e}vy, {F}ran{\c{c}}ois}, abstract={{P}our l'{I}ntelligence {A}rtificielle, le raisonnement causal se compare {\`a} et se diff{\'e}rencie du raisonnement d{\'e}ductif, et il est int{\'e}ressant de le rapprocher du raisonnement sur l'action. {L}e probl{\`e}me de la mod{\'e}lisation est : un ensemble de relations cause/effet g{\'e}n{\'e}riques {\'e}tant connu, comment peut-on calculer effectivement l'{\'e}volution du monde quand plusieurs {\'e}v{\'e}nements y adviennent. {N}ous d{\'e}crivons deux grandes cat{\'e}gories de mod{\'e}lisations de la cause. {L}a premi{\`e}re d{\'e}veloppe des outils de type logique parmi lesquels nous nous attachons au calcul des situations, {\`a} la logique modale et aux chroniques. {L}a seconde s'appuie sur une analyse des rapports entre description probabiliste et action, pour aboutir {\`a} une alliance entre graphes et probabilit{\'e}s. {U}ne derni{\`e}re partie {\'e}tudie le probl{\`e}me de l'apprentissage, i.e. l'{\'e}volution du monde {\'e}tant connue, comment retrouver les relations causales}, keywords={raisonnement causal; action; modalit{\'e}s; chronique; r{\'e}seaux bay{\'e}siens; influence causale}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={291-323 }, journal={{I}ntellectica }, volume={38 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00091636/en/}, } %% hal-00088705, version 1 %% http://hal.archives-ouvertes.fr/hal-00088705/en/ @article{LEVY:2004:HAL-00088705:1, title={{S}tatistiques et contrefactuels, quelques explications}, author={{L}{\'e}vy, {F}ran{\c{c}}ois}, keywords={causalit{\'e};contrefactuels}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={187-191 }, journal={{I}ntellectica }, volume={38 }, note={{I}ntroduction {\`a} "{E}xp{\'e}rimentation, inf{\'e}rence statistique et analyse causale" de {B}. {L}ecoutre dans le m{\^e}me num{\'e}ro. }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00088705/en/}, } %% hal-00088704, version 1 %% http://hal.archives-ouvertes.fr/hal-00088704/en/ @article{LEVY:2004:HAL-00088704:1, title={{M}od{\'e}lisations symboliques du raisonnement causal}, author={{L}{\'e}vy, {F}ran{\c{c}}ois and {K}ayser, {D}aniel}, abstract={{D}iff{\'e}rents formalismes de l'{I}.{A}. pour rendre compte de la notion de cause sont d{\'e}crits. {L}es mod{\'e}lisations sont probabilistes aussi bien que discr{\`e}tes. {S}everal formal approaches of the notion of {C}ause in {AI} are described. {B}oth probabilistic and discrete formalisms are considered.}, keywords={{I}.{A}., {R}{\'e}seaux bayesiens , {A}ction, {C}ausalit{\'e}}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={291-323 }, journal={{I}ntellectica }, volume={38 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00088704/en/}, } %% hal-00098043, version 1 %% http://hal.archives-ouvertes.fr/hal-00098043/en/ @article{NAZARENKO:2004:HAL-00098043:1, title={{P}rimitives logiques et r{\'e}seaux s{\'e}mantiques : quel bilan pour la terminologie ?}, author={{N}azarenko, {A}deline}, abstract={. {T}his paper aims at evaluating the contribution of semantic networks to the computational terminology. {I}t focuses on the conceptual graph formalism and, at a lower degree, on the description logics. {T}hese formalisms undoubtedly help to clarify and formalize the terminological knowledge but they are semantically neutral and they cannot be considered as semantic models as such. {W}e nevertheless argue that such formalisms can play a role in the modeling process, for building an intermediate model between the natural language semantics and the operational model to be used in an automatic process.}, keywords={graphes conceptuels, logiques de description, logiques terminologiques, r{\'e}seaux s{\'e}mantiques ; primitives s{\'e}mantiques ; r{\^o}les ; s{\'e}mantique des langues naturelles}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={41-56 }, journal={{R}evue d'{I}ntelligence {A}rtificielle }, volume={18(1) }, note={{H}.3.1 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00098043/en/}, } %% hal-00085174, version 1 %% http://hal.archives-ouvertes.fr/hal-00085174/en/ @article{POIBEAU:2004:HAL-00085174:1, title={{A}nnotation d'informations textuelles : le cas du web s{\'e}mantique}, author={{P}oibeau, {T}hierry}, keywords={annotation; extraction d'information ; s{\'e}mantique; web s{\'e}mantique; traitement des langues}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={139-157 }, journal={{R}evue d'{I}ntelligence {A}rtificielle }, volume={18 (1) }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085174/en/}, } %% hal-00003297, version 1 %% http://hal.archives-ouvertes.fr/hal-00003297/en/ @article{RAVELOMANANA:2004:HAL-00003297:1, title={{F}orbidden {S}ubgraphs in {C}onnected {G}raphs}, author={{R}avelomanana, {V}lady and {L}o{\"y}s, {T}himonier}, abstract={{G}iven a set $\xi=\{{H}_1,{H}_2,\cdots\}$ of connected non acyclic graphs, a $\xi$-free graph is one which does not contain any member of $% \xi$ as copy. {D}efine the excess of a graph as the difference between its number of edges and its number of vertices. {L}et ${\gr{{W}}}_{k,\xi}$ be theexponential generating function ({EGF} for brief) of connected $\xi$-free graphs of excess equal to $k$ ($k \geq 1$). {F}or each fixed $\xi$, a fundamental differential recurrence satisfied by the {EGF}s ${\gr{{W}}}_{k,\xi}$ is derived. {W}e give methods on how to solve this nonlinear recurrence for the first few values of $k$ by means of graph surgery. {W}e also show that for any finite collection $\xi$ of non-acyclic graphs, the {EGF}s ${\gr{{W}}}_{k,\xi}$ are always rational functions of the generating function, ${T}$, of {C}ayley's rooted (non-planar) labelled trees. {F}rom this, we prove that almost all connected graphs with $n$ nodes and $n+k$ edges are $\xi$-free, whenever $k=o(n^{1/3})$ and $|\xi| < \infty$ by means of {W}right's inequalities and saddle point method. {L}imiting distributions are derived for sparse connected $\xi$-free components that are present when a random graph on $n$ nodes has approximately $\frac{n}{2}$ edges. {I}n particular, the probability distribution that it consists of trees, unicyclic components, $\cdots$, $(q+1)$-cyclic components all $\xi$-free is derived. {S}imilar results are also obtained for multigraphs, which are graphs where self-loops and multiple-edges are allowed.}, keywords={{C}ombinatorial problems; enumerative combinatorics; analytic combinatorics; labelled graphs; multivariate generating functions; asymptotic enumeration; random graphs; triangle-free graphs.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique d'{A}miens - {L}a{RIA} - {CNRS} : {FRE}2733 - {U}niversit{\'e} de {P}icardie {J}ules {V}erne }, pages={121-171 }, journal={{T}heoretical {C}omputer {S}cience }, volume={314 }, note={{ACM} {C}lassification: {G}.2.1 {C}ombinatorics {G}.2.2 {G}raph {T}heory {G}eneral {T}erms: {A}lgorithms, {T}heory }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003297/en/}, } %% hal-00003248, version 1 %% http://hal.archives-ouvertes.fr/hal-00003248/en/ @article{RAVELOMANANA:2004:HAL-00003248:1, title={{E}xtremal {P}roperties of {T}hree {D}imensional {S}ensor {N}etworks with {A}pplications}, author={{R}avelomanana, {V}lady}, abstract={{I}n this paper, we analyze various critical transmitting/sensing ranges for connectivity and coverage in three-dimensional sensor networks. {A}s in other large-scale complex systems, many global parameters of sensor networks undergo phase transitions: {F}or a given property of the network, there is a critical threshold, corresponding to the minimum amount of the communication effort or power expenditure by individual nodes, above (resp. below) which the property exists with high (resp. a low) probability. {F}or sensor networks, properties of interest include simple and multiple degrees of connectivity/coverage. {F}irst, we investigate the network topology according to the region of deployment, the number of deployed sensors and their transmitting/sensing ranges. {M}ore specifically, we consider the following problems: {A}ssume that $n$ nodes, each capable of sensing events within a radius of $r$, are randomly and uniformly distributed in a $3$-dimensional region $\mathcal{{R}}$ of volume ${V}$, how large must the sensing range $r_{\tiny\mbox{\textsc{{S}ense}}}$ be to ensure a given degree of coverage of the region to monitor? {F}or a given transmission range $r_{\tiny\mbox{\textsc{{T}rans}}}$, what is the minimum (resp. maximum) degree of the network? {W}hat is then the typical hop-diameter of the underlying network? {N}ext, we show how these results affect algorithmic aspects of the network by designing specific distributed protocols for sensor networks.}, keywords={{S}ensor networks, ad hoc networks; coverage, connectivity; hop-diameter; minimum/maximum degrees; transmitting/sensing ranges; analytical methods; energy consumption; topology control.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={246-257 }, journal={{IEEE} {T}ransactions on {M}obile {C}omputing }, volume={{V}ol 3 }, note={{ACM} classification: {C}.2.1 {N}etwork architecture and design; {F}.2.2 {N}onnumerical algorithms and problems; {G}.3 {P}robability and statistics }, ARXIVID={cs.DS/0411027 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003248/en/}, } %% hal-00084713, version 1 %% http://hal.archives-ouvertes.fr/hal-00084713/en/ @article{AUTEBERT:2003:HAL-00084713:1, title={{O}n {G}eneralized {D}elannoy {P}aths}, author={{A}utebert, {J}ean-{M}ichel and {S}chwer, {S}ylviane}, abstract={{A} {D}elannoy path is a minimal path with diagonal steps in ${\mathbb {Z}}^2$ between two arbitrary points. {W}e extend this notion to the $n$ dimensions space ${\mathbb {Z}}^n$ and identify such paths with words on a special kind of alphabet: an {S}-alphabet. {W}e show that the set of all the words corresponding to {D}elannoy paths going from one point to another is exactly one class in the congruence generated by a {T}hue system that we exhibit. {T}his {T}hue system induces a partial order on this set that is isomorphic to the set of ordered partitions of a fixed multiset where the blocks are sets with a natural order relation. {O}ur main result is that this poset is a lattice.}, keywords={{D}elannoy path ; {T}hue {S}ystem ; lattice.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}niversit{\'e} paris 7 - {U}niversit{\'e} {D}enis {D}iderot - {P}aris {VII} }, pages={208-223 }, journal={{SIAM} {J}ournal on {D}iscrete {M}athematics }, volume={16 }, note={{AMS} : 06{B}05, 68{Q}42 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084713/en/}, } %% hal-00153895, version 1 %% http://hal.archives-ouvertes.fr/hal-00153895/en/ @article{BAERT:2003:HAL-00153895:1, title={{O}n the growth of components with non fixed excesses}, author={{B}aert, {A}nne-{E}lisabeth and {R}avelomanana, {V}lady and {T}himonier, {L}o{\"y}s}, abstract={{D}enote by an $l$-component a connected graph with $l$ edges more than vertices. {W}e prove that the expected number of creations of $(l+1)$-component, by means of adding a new edge to an $l$-component in a randomly growing graph with $n$ vertices, tends to $1$ as $l,n$ tends to $\infty$ but with $l = o(n^{1/4})$. {W}e also show, under the same conditions on $l$ and $n$, that the expected number of vertices that ever belong to an $l$-component is $\sim (12l)^{1/3} n^{2/3}$.}, keywords={{R}andom graphs; {A}nalytic combinatorics; {G}iant components}, language={{A}nglais}, affiliation={{L}aboratoire de {R}echerche en {I}nformatique d'{A}miens - {L}a{RIA} - {CNRS} : {FRE}2733 - {U}niversit{\'e} de {P}icardie {J}ules {V}erne - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={487--493 }, journal={{D}iscrete {A}pplied {M}athematics }, volume={130 }, number={3 }, note={{A} small note on the evolution of giant components {G}.2.2, {G}.3 }, audience={internationale }, doi={10.1016/{S}0166-218{X}(03)00326-3 }, ARXIVID={0706.1642 }, day={17}, month={07}, year={2003}, URL={dx.doi.org/10.1016/{S}0166-218{X}(03)00326-3 http://hal.archives-ouvertes.fr/hal-00153895/en/}, } %% hal-00082480, version 1 %% http://hal.archives-ouvertes.fr/hal-00082480/en/ @article{BANDERIER:2003:HAL-00082480:1, title={{A}lgebraic succession rules and {L}attice paths with an infinite set of jumps}, author={{B}anderier, {C}yril and {F}{\'e}dou, {J}ean-{M}arc and {G}arcia, {C}hristine and {M}erlini, {D}onatella}, keywords={{G}raphes, combinatoire; {L}ogique, math{\'e}matiques de l'informatique; {C}alcul symbolique et formel; {I}nformatique th{\'e}orique (algorithmique, logique, cryptographie)}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={1 }, journal={{D}iscrete {M}athematics }, volume={100 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082480/en/}, } %% hal-00003244, version 1 %% http://hal.archives-ouvertes.fr/hal-00003244/en/ @article{COSTA:2003:HAL-00003244:1, title={{A} greedy algorithm for multicut and integral multiflow in rooted trees}, author={{C}osta, {M}arie-{C}hristine and {L}{\'e}tocart, {L}ucas and {R}oupin, {F}r{\'e}d{\'e}ric}, abstract={{W}e present an {O}(min({K}n,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where {K} is the number of commodities and n is the number of vertices. {T}hese problems are {NP}-hard in undirected trees but polynomial in directed trees. {I}n the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.}, keywords={maximum integral multiflow, minimum multicut, duality, rooted tree}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers }, pages={21-27 }, journal={{O}perations {R}esearch {L}etters }, volume={31 }, audience={non sp{\'e}cifi{\'e}e }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00003244/en/}, } %% hal-00084471, version 1 %% http://hal.archives-ouvertes.fr/hal-00084471/en/ @article{FOUQUERE:2003:HAL-00084471:1, title={{C}orpus issus du web : constitution et analyse informationnelle}, author={{F}ouquer{\'e}, {C}hristophe and {I}ssac, {F}abrice}, keywords={{I}ntelligence artificielle et robotique, communication homme machine; {I}ng{\'e}nierie des langues}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={n1, pp 111-134 }, journal={{R}evue {Q}u{\'e}b{\'e}coise de {L}inguistique }, volume={32 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084471/en/}, } %% hal-00091608, version 1 %% http://hal.archives-ouvertes.fr/hal-00091608/en/ @article{KAYSER:2003:HAL-00091608:1, title={{A}bstraction and {N}atural {L}anguage {S}emantics}, author={{K}ayser, {D}aniel}, abstract={{A}ccording to the traditional view, a word prototypically denotes a class of objects sharing similar features, i.e. it results from an abstraction based on the detection of common properties in perceived entities. {I} explore here another idea: words result from abstraction of common premises in the rules governing our actions. {I} first argue that taking ‘inference', instead of ‘reference', as the basic issue in semantics does matter. {I} then discuss two phenomena that are, in my opinion, particularly difficult to analyse within the scope of traditional semantic theories: systematic polysemy and plurals. {I} conclude by a discussion of my approach, and by a summary of its main features.}, keywords={natural language; semantics; inference; polysemy; plurals}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={1261-68 }, journal={{P}hilosophical {T}ransactions of the {R}oyal {S}ociety of {L}ondon }, volume={358 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00091608/en/}, } %% hal-00082354, version 1 %% http://hal.archives-ouvertes.fr/hal-00082354/en/ @article{MACULAN:2003:HAL-00082354:1, title={{I}nteger linear models with a polynomial number of variables and constraints for some classical combinatorial problems}, author={{M}aculan, {N}elson and {P}lateau, {G}{\'e}rard and {L}isser, {A}bdel}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} }, pages={n 1 pages 161-168 }, journal={{P}esquisa {O}peracional }, volume={23 }, note={{OCAD} }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082354/en/}, } %% hal-00082531, version 1 %% http://hal.archives-ouvertes.fr/hal-00082531/en/ @article{MORLEY:2003:HAL-00082531:1, title={{L}es outils du commerce {\'e}lectronique}, author={{M}orley, {C}hantal and {D}efude, {B}runo and {B}utelle, {F}ranck and {L}ang, {D}aniel}, keywords={{M}ultim{\'e}dia, t{\'e}l{\'e}communications; {P}rincipes d'organisation et de traitement de l'information; {R}{\'e}seaux}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={8--58 }, journal={{A}nnales des t{\'e}l{\'e}communications }, volume={58 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082531/en/}, } %% hal-00084353, version 1 %% http://hal.archives-ouvertes.fr/hal-00084353/en/ @article{THIONGANE:2003:HAL-00084353:1, title={{A}nalyse de sensibilit{\'e} pour les probl{\`e}mes lin{\'e}aires en variables 0-1}, author={{T}hiongane, {B}abacar and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={pp. 291-309 }, journal={{RAIRO} {O}perations {R}esearch }, volume={37 n4 }, note={{OCAD} }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084353/en/}, } %% hal-00003258, version 1 %% http://hal.archives-ouvertes.fr/hal-00003258/en/ @article{BANDERIER:2002:HAL-00003258:1, title={{G}enerating functions for generating trees}, author={{B}anderier, {C}yril and {F}lajolet, {P}hilippe and {G}ardy, {D}ani{\`e}le and {B}ousquet-{M}{\'e}lou, {M}ireille and {D}enise, {A}lain and {G}ouyou-{B}eauchamps, {D}ominique}, abstract={{C}ertain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the object. {G}enerating trees lead to a fast computation of enumeration sequences (sometimes, to explicit formulae as well) and provide efficient random generation algorithms. {W}e investigate the links between the structural properties of the rewriting rules defining such trees and the rationality, algebraicity, or transcendence of the corresponding generating function.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {ALGO} - {INRIA} {R}ocquencourt - {INRIA} - {SMIS} - {INRIA} {R}ocquencourt - {INRIA} - {CNRS} : {UMR}8144 - {U}niversit{\'e} de {V}ersailles-{S}aint {Q}uentin en {Y}velines - {L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux }, pages={29-55 }, journal={{D}iscrete {M}athematics }, volume={246 (1-3) }, note={{T}his article corresponds, up to minor typo corrections, to the article submitted to {D}iscrete {M}athematics ({E}lsevier) in {N}ov. 1999, and published in its vol. 246(1-3), {M}arch 2002, pp. 29-55. }, audience={non sp{\'e}cifi{\'e}e }, ARXIVID={math.CO/0411250 }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00003258/en/}, } %% hal-00085643, version 1 %% http://hal.archives-ouvertes.fr/hal-00085643/en/ @article{DELLAMICO:2002:HAL-00085643:1, title={{A} linear time algorithm for scheduling outforests with communication delays on three processors}, author={{D}ell'{A}mico, {M}auro and {F}inta, {L}ucian}, abstract={{W}e consider the problem of scheduling n unit-length tasks on identical m parallel processors, when outforest precedence relations and unit interprocessor communication delays exist. {T}wo algorithms have been proposed in the literature for the exact solution of this problem: a linear time algorithm for the special case m=2, and a dynamic programming algorithm which runs in {O}(n^(2m\&\#8722;2)). {I}n this paper we give a new linear time algorithm for instances with m=3.}, keywords={scheduling, unit execution time, unit communication delay}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={287-307 }, journal={{J}ournal of {A}lgorithms }, volume={44(2) }, doi={10.1016/{S}0196-6774(02)00201-8 }, year={2002}, URL={dx.doi.org/10.1016/{S}0196-6774(02)00201-8 http://hal.archives-ouvertes.fr/hal-00085643/en/}, } %% hal-00003362, version 1 %% http://hal.archives-ouvertes.fr/hal-00003362/en/ @article{LAVAULT:2002:HAL-00003362:1, title={{E}mbeddings into the {P}ancake {I}nterconnection {N}etwork}, author={{L}avault, {C}hristian}, abstract={{O}wing to its nice properties, the pancake is one of the {C}ayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. {I}n this paper, we present embeddings of rings, grids and hypercubes into the pancake with constant dilation and congestion. {W}e also extend the results to similar efficient embeddings into the star graph.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={297-310 }, journal={{P}arallel {P}rocessing {L}etters }, volume={12 }, number={3-4 }, note={{A}rticle paru en 2002 dans {P}arallel {P}rocessing {L}etters }, audience={internationale }, ARXIVID={cs/0411095 }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00003362/en/}, } %% hal-00086323, version 1 %% http://hal.archives-ouvertes.fr/hal-00086323/en/ @article{LUQUE:2002:HAL-00086323:1, title={{T}ransitive factorizations of free partially commutative monoids and {L}ie algebras}, author={{L}uque, {J}ean-{G}abriel and {D}uchamp, {G}{\'e}rard}, abstract={{L}et $\{M}({A},\theta)$ be a free partially commutative monoid. {W}e give here a necessary and sufficient condition on a subalphabet ${B}\subset {A}$ such that the right factor of a bisection $\{M}({A},\theta)=\{M}({B},\theta_{B}).{T}$ be also partially commutative free. {T}his extends strictly the (classical) elimination theory on partial commutations and allows to construct new factorizations of $\{M}({A},\theta)$ and associated bases of ${L}_{K}({A},\theta)$.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={83 - 97 }, journal={{D}iscrete {M}athematics }, volume={246 , {I}ssue 1-3 }, ARXIVID={math.CO/0607420 }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00086323/en/}, } %% hal-00003997, version 1 %% http://hal.archives-ouvertes.fr/hal-00003997/en/ @article{MONNOT:2002:HAL-00003997:1, title={{A}pproximation algorithms for the traveling salesman problem}, author={{M}onnot, {J}{\'e}r{\^o}me and {P}aschos, {V}angelis and {T}oulouse, {S}ophie}, abstract={{W}e first prove that the minimum and maximum traveling salesman problems, their metric versions as well as some versions defined on parameterized triangle inequalities (called sharpened and relaxed metric traveling salesman) are all equi-approximable under an approximation measure, called differential-approximation ratio, that measures how the value of an approximate solution is placed in the interval between the worst- and the best-value solutions of an instance. {W}e next show that the 2-{OPT}, one of the most-known traveling salesman algorithms, approximately solves all these problems within differential-approximation ratio bounded above by 1/2. {W}e analyze the approximation behavior of 2-{OPT} when used to approximately solve traveling salesman problem in bipartite graphs and prove that it achieves differential-approximation ratio bounded above by 1/2 also in this case. {W}e also prove that, it is {NP}-hard to differentially approximate metric traveling salesman within better than 649/650 and traveling salesman with distances 1 and 2 within better than 741/742. {F}inally, we study the standard approximation of the maximum sharpened and relaxed metric traveling salesman problems. {T}hese are versions of maximum metric traveling salesman defined on parameterized triangle inequalities and, to our knowledge, they have not been studied until now.}, keywords={{A}pproximation algorithm; differential ratio; {NP}-complete; traveling salesman problem}, language={{A}nglais}, affiliation={{L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={387-405 }, journal={{M}athematical {M}odels of {O}perations {R}esearch }, volume={56 }, note={{F}.1.3, {G} }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00003997/en/}, } %% hal-00085183, version 1 %% http://hal.archives-ouvertes.fr/hal-00085183/en/ @article{SCHWER:2002:HAL-00085183:1, title={{F}ormalizing {C}alendars with the {C}ategory of {O}rdinals}, author={{S}chwer, {S}ylviane}, abstract={{S}tarting from the basic notion of chronology, we provide a natural representation of calendars and appropriate tools for manipulating them, inside the framework of finite ordinals category. {W}e show that calendars are closed under infimum and supremum operations but not under direct limits.}, keywords={time ; chronology ; calendar ; temporal granularity ; finite ordinals tcategory}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={275-295 }, journal={{A}pplied {I}ntelligence }, volume={17 (3) }, note={{ACM} : {G}20 }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00085183/en/}, } %% hal-00085191, version 1 %% http://hal.archives-ouvertes.fr/hal-00085191/en/ @article{SCHWER:2002:HAL-00085191:1, title={{R}easoning with {I}ntervals on {G}ranules}, author={{S}chwer, {S}ylviane}, abstract={{T}he formalizations of periods of time inside a linear model of {T}ime are usually based on the notion of intervals, that may contain or may not their endpoints. {T}his is not enought when the periods are written in terms of coarse granularities with respect to the event taken into account. {F}or instance, how to express the inter-war period in terms of a {\em years} interval? {T}his paper presents a new type of intervals, neither open ,nor closed or open-closed and the extension of operations on intervals of this new type, in order to reduce the gap between the discourse related to temporal relationship and its translation into a discretized model of {T}ime.}, keywords={time ; granularity ; intervals}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={793-808 }, journal={{J}ournal of {U}niversal {C}omputer {S}cience }, volume={8 (8) }, note={{G}.2.0 }, ARXIVID={cs.AI/0607056 }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00085191/en/}, } %% hal-00085179, version 1 %% http://hal.archives-ouvertes.fr/hal-00085179/en/ @article{SCHWER:2002:HAL-00085179:1, title={{L}e treillis des chemins de {D}elannoy}, author={{S}chwer, {S}ylviane and {A}utebert, {J}ean-{M}ichel and {L}atapy, {M}athieu}, abstract={{U}n chemin de {D}elannoy est un chemin minimal avec pas diagaunaux du plan {Z}2 entre deux points quelconques. {N}ous {\'e}tudions les chemins de delannoy comme une classe particuli{\`e}re d'une congruence engendr{\'e}e par un syst{\`e}me de {T}hue. {C}e syst{\`e}me induit un ordre partiel sur les chemins de {D}elannoy dont nous montrons la structure de treillis distributif. {C}e syst{\`e}me admet {\'e}galement une interpr{\'e}tation temporelle que nous indiquons bri{\`e}vement.}, keywords={syst{\`e}mes de {T}hue ; chemins de {D}elannoy ; treillis}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'informatique {A}lgorithmique : {F}ondements et {A}pplications - {LIAFA} - {CNRS} : {UMR}7089 - {U}niversit{\'e} {D}enis {D}iderot - {P}aris {VII} - {U}niversit{\'e} paris 7 - {U}niversit{\'e} {D}enis {D}iderot - {P}aris {VII} }, pages={208-223 }, journal={{D}iscrete {M}athematics }, volume={258 (1-3) }, note={{MSC} : 06{D}99 03{D}03 }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00085179/en/}, } %% hal-00085316, version 2 %% http://hal.archives-ouvertes.fr/hal-00085316/en/ @article{DUCHAMP:2001:HAL-00085316:2, title={{D}irect and dual laws for automata with multiplicities}, author={{D}uchamp, {G}{\'e}rard and {F}louret, {M}arianne and {L}augerotte, {E}ric and {L}uque, {J}ean-{G}abriel}, abstract={{W}e present here theoretical results coming from the implementation of the package called {AMULT} (automata with multiplicities in several noncommutative variables). {W}e show that classical formulas are ``almost every time'' optimal, characterize the dual laws preserving rationality and also relators that are compatible with these laws.}, keywords={{A}utomata with multiplicities; rational laws; dual laws; congruences; shuffle compatibility}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'informatique fondamentale et appliqu{\'e}e de {R}ouen - {LIFAR} {EA}2655 - {U}niversit{\'e} de {R}ouen - {L}aboratoire d'informatique du {H}avre - {LIH} {EA}3219 - {U}niversit{\'e} du {H}avre }, pages={105-120 }, journal={{T}heoretical {C}omputer {S}cience }, volume={267 }, ARXIVID={math.CO/0607412 }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00085316/en/}, } %% hal-00003493, version 1 %% http://hal.archives-ouvertes.fr/hal-00003493/en/ @article{VAUZEILLES:2001:HAL-00003493:1, title={{T}he {C}lassical {AI} {P}lanning {P}roblems in the {M}irror of {H}orn {L}inear {L}ogic : {S}emantics, {E}xpressibility, {C}omplexity}, author={{V}auzeilles, {J}acqueline and {K}anovich, {M}ax}, abstract={{W}e introduce {H}orn linear logic as a comprehensive logical system capable of handling the typical {AI} problem of making a plan of the actions to be performed by a robot so that he could get into a set of final situations, if he started with a certain initial situation. {C}ontrary to undecidability of propositional {H}orn linear logic, the planning problem is proved to be decidable for a reasonably wide class of natural robot systems. {T}he planning problem is proved to be {EXPTIME}-complete for the robot systems that allow actions with non-deterministic effects. {F}ixing a finite signature, that is a finite set of predicates and their finite domains, we get a polynomial time procedure of making plans for the robot system over this signature. {T}he planning complexity is reduced to {PSPACE} for the robot systems with only pure deterministic actions.}, keywords={artificial intelligence; linear logic; computational complexity; descriptive complexity}, language={{A}nglais}, affiliation={{R}ussian {S}tate {U}niversity for the {H}umanities - {R}ussian {S}tate {U}niversity for the {H}umanities - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={1-28 }, journal={{M}athematical {S}tructures in {C}omputer {S}cience }, volume={11 }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00003493/en/}, } %% hal-00016366, version 1 %% http://hal.archives-ouvertes.fr/hal-00016366/en/ @article{NAGIH:2000:HAL-00016366:1, title={{D}ualit{\'e} lagrangienne en programmation fractionnaire concave-convexe en variables 0-1}, author={{N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={pp. 491-496 }, journal={{C}omptes {R}endus de l'{A}cademie des {S}ciences. {S}erie 1, {M}athematique }, volume={331 }, year={2000}, URL={http://hal.archives-ouvertes.fr/hal-00016366/en/}, } %% hal-00016365, version 1 %% http://hal.archives-ouvertes.fr/hal-00016365/en/ @article{NAGIH:1999:HAL-00016365:1, title={{P}robl{\`e}mes fractionnaires : une synth{\`e}se d'applications et de m{\'e}thodes de r{\'e}solution}, author={{N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={pp. 383-419 }, journal={{RAIRO}. {T}echnique et {S}cience {I}nformatiques }, volume={33 (4) }, year={1999}, URL={http://hal.archives-ouvertes.fr/hal-00016365/en/}, } %% hal-00085094, version 1 %% http://hal.archives-ouvertes.fr/hal-00085094/en/ @article{RECANATI:1999:HAL-00085094:1, title={{L}a classification de {V}endler revue et corrig{\'e}e}, author={{R}ecanati, {C}atherine and {R}ecanati, {F}ran{\c{c}}ois}, abstract={{D}ans cet article, nous commentons la classification des verbes de {V}endler, l'amendons quelque peu, et tentons d'{\'e}tablir sa l{\'e}gitimit{\'e} en isolant les principes qui la fondent.}, keywords={cat{\'e}gorisation verbale; {\'e}tats; processus; activit{\'e}s; {\'e}v{\'e}nements; ach{\`e}vements;}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nstitut {J}ean-{N}icod - {IJN} - {CNRS} : {UMR}8129 - {E}cole {N}ormale {S}up{\'e}rieure de {P}aris - {E}cole des {H}autes {E}tudes en {S}ciences {S}ociales }, pages={pp. 167-184, }, journal={{C}ahiers {C}hronos }, volume={4 }, note={17 pages, initialement paru comme rapport n°9718 du {CREA}, {P}olytechnique, {P}aris, en {O}ct 97 }, audience={internationale }, year={1999}, URL={http://hal.archives-ouvertes.fr/hal-00085094/en/}, } %% hal-00003554, version 1 %% http://hal.archives-ouvertes.fr/hal-00003554/en/ @article{VAUZEILLES:1999:HAL-00003554:1, title={{T}ree {A}djoining {G}rammars in a fragment of the {L}ambek calculus}, author={{V}auzeilles, {J}acqueline and {A}brusci, {M}ichele and {F}ouquer{\'e}, {C}hristophe}, language={{A}nglais}, affiliation={{U}niversit{\`a} degli studi {R}oma {III} - {U}niversit{\`a} degli studi {R}oma {III} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={.209-236 }, journal={{C}omputational {L}inguistics }, volume={{V}ol 99, n°9 }, year={1999}, URL={http://hal.archives-ouvertes.fr/hal-00003554/en/}, } %% hal-00003551, version 1 %% http://hal.archives-ouvertes.fr/hal-00003551/en/ @article{VAUZEILLES:1996:HAL-00003551:1, title={{O}rdinals {I}: basic notions}, author={{V}auzeilles, {J}acqueline and {F}erbus, {M}arie}, abstract={{T}he generalization of the concept of natural integers by means of sum, subtraction, product and quotient successively yielded to the definition of relative integers and subsequently to rational numbers. {T}hen reals and complexes were introduced. {A}ll these constructions result from a study of natural integers which is essentially algebraic. {A}t the end of the last century, {C}antor generalized the notion of natural integer by considering the order structure of integers instead of algebraic means. {A}ccording to the idea of "counting more and more", he introduced transfinite numbers over natural numbers. {T}hus an ordinal may be simply defined as a natural number or a transfinite number. {H}ow can we go beyond the infinite of natural numbers: we can represent the natural numbers as points of a semi-line, and juxtapose another semi-line and so on... {H}owever this construction can be done for any well-ordered set. {T}herefore, we will first define well-orderings and show that two well-orderings are always comparable: either these well-orderings are isomorphic or there is an embedding from one to the other. {M}oreover we will define typical well-ordered sets: ordinals. {T}he isomorphic relation between well-orderings is an equivalence relation and we show that each ordinal is a representant of an equivalence class. {S}ince the collection of all ordinals is itself well-ordered, we can define transfinite induction on this collection. {A}ctually, finite ordinals are natural numbers and ordinal arithmetic extends usual one. {T}he ordinals up to epsilon_0 can be described in an intuitive way (with 0, 1, omega and the sum, product and exponentiation operations). {I}n contrast, it cannot be done for ordinals beyond epsilon_0. {I}n order to describe greater ordinals, {V}eblen, we introduced a normal functions hierarchy (i.e. strictly increasing and continuous) from ordinals into ordinals. {T}his hierarchy is built by taking at each step fixed points of the function defined at the previous step and, at the limit steps, the function which enumerates the common points of the images of the preceding functions. {T}his construction allows us to describe ordinals until {G}amma_0, {W}e show how each ordinal smaller than {G}amma_0 can be described using ordinals preceding {G}amma_0. {T}herefore {G}amma_0 and epsilon_0 have a similar role if {V}eblen functions are used for {G}amma_0 in addition to the previous operations.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique {T}h{\'e}orique de {P}aris - {LITP} - {U}niversit{\'e} {D}enis {D}iderot - {P}aris {VII} }, pages={1-26 }, journal={{A}nnals of {A}pplied {M}athematics and {A}rtificial {I}ntelligence }, volume={16/1-4 }, year={1996}, URL={http://hal.archives-ouvertes.fr/hal-00003551/en/}, } %% hal-00003492, version 1 %% http://hal.archives-ouvertes.fr/hal-00003492/en/ @article{VAUZEILLES:1996:HAL-00003492:1, title={{O}rdinals {II} : some applications and a functorial approach}, author={{V}auzeilles, {J}acqueline}, abstract={{I}n the first part of this work we present some complements on ordinals or some usual applications of ordinals: in the section 2, we define a system of ordinal notations for ordinals lesser than {G}amma_0; the section 3 is devoted to a simple and direct connection between {K}ruskal's theorem and {G}amma_0; in the section 4, we show how use ordinals for consistency proofs in proof theory (for instance the consistency of {P}eano arithmetic by means of transfinite induction up to epsilon_0)}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={27-58 }, journal={{A}nnals of {A}pplied {M}athematics and {A}rtificial {I}ntelligence }, volume={16/1-4 }, year={1996}, URL={http://hal.archives-ouvertes.fr/hal-00003492/en/}, } %% hal-00003553, version 1 %% http://hal.archives-ouvertes.fr/hal-00003553/en/ @article{VAUZEILLES:1994:HAL-00003553:1, title={{L}inear logic and exceptions}, author={{V}auzeilles, {J}acqueline and {F}ouquer{\'e}, {C}hristophe}, abstract={{A} semantic network is a structure for representing knowledge as a pattern of interconnected nodes and edges. {T}his paper focuses on the means linear logic offers to represent these networks. {I}n order to compare our inferences, we have chosen one nonmonotonic logic: default logic serves as a reference. {T}he main result proves the equivalence between linear logic and default logic in taxonomic default theories. {W}e hope this will help better to understand the relations between nonmonotonicity and defeasible knowledge representation.}, keywords={{L}inear {L}ogic; {N}onmonotonic {L}ogics; {T}axonomic {T}heories; {N}ets}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={859-875 }, journal={{J}ournal of {L}ogic and {C}omputation }, volume={{V}ol. 4, n° 6 }, year={1994}, URL={http://hal.archives-ouvertes.fr/hal-00003553/en/}, } %% hal-00003530, version 1 %% http://hal.archives-ouvertes.fr/hal-00003530/en/ @article{VAUZEILLES:1993:HAL-00003530:1, title={{G}enerating {P}lans in {L}inear {L}ogic : {I}. {A}ctions as proofs}, author={{V}auzeilles, {J}acqueline and {M}asseron, {M}arcel and {T}ollu, {C}hristophe}, abstract={{T}here is an increasing interest in the relation between logic and the changes involved in reasoning and, specifically, in plan generation. {U}p to now, several attemptsin this direction have been made, either by embedding actions in a classical framework or by using nonstandard formalisms. {W}e think that these attempts, though promising, miss their objectives, for a lack of a suitable logic, and that the effort must be pursued. {I}n this paper, we show how to obtain a strong and clean correspondence between proof and sequences of actions by using only {G}irard's linear logic, eliminating from the classical logic the structural rules which are not adapted to our purpose. {A} theorem is presented which expresses the new adequacy between proofs and actions.}, keywords={{L}inear logic ; planification}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={349-370 }, journal={{T}heoretical {C}omputer {S}cience }, volume={{B}, vol. 113 }, year={1993}, URL={http://hal.archives-ouvertes.fr/hal-00003530/en/}, } %% hal-00003491, version 1 %% http://hal.archives-ouvertes.fr/hal-00003491/en/ @article{VAUZEILLES:1993:HAL-00003491:1, title={{C}ut {E}limination for the {U}nified {L}ogic}, author={{V}auzeilles, {J}acqueline}, abstract={{I}n the paper entitled "{O}n the {U}nity of {L}ogic", {J}.-{Y}. {G}irard presented a calculus, called {LU}, which is common to classical logic, intuitionistic logic and linear logic. {T}he main result of {G}irard's paper is that each of the latter logics turns out to be a fragment of {LU} ; the proof relies on a cut-elimination theorem for {LU}, which is claimed to be more or less obvious. {I}n fact, the proof of the cut-eliminaton theorem is somewhat intricate because of the mutual behaviour of the three different cut rules (one "linear" cut and two "classical" ones) of {LU} : eliminating a classical cut produces linear cuts while the elimination of a linear cut produces classical ones. {I}n the present paper, we prove that {LU} enjoys cut-elimination under minimal hypotheses : a notion of degree for a formula is introduced, which depends only on the number of exponentials of the formula.}, keywords={linear logic}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={1-16 }, journal={{A}nnals of {P}ure and {A}pplied {L}ogic }, volume={62 }, year={1993}, URL={http://hal.archives-ouvertes.fr/hal-00003491/en/}, } %% hal-00084817, version 1 %% http://hal.archives-ouvertes.fr/hal-00084817/en/ @article{GRABAR:2004:HAL-00084817:1, title={{L}es relations dans les terminologies structur{\'e}es : de la th{\'e}orie {\`a} la pratique}, author={{G}rabar, {N}atalia and {H}amon, {T}hierry}, abstract={{D}ans cet article, nous nous int{\'e}ressons {\`a} la structuration des termes d'un domaine, c'est-{\`a}-dire {\`a} l'acquisition de relations entre termes. {E}n effet, les terminologies ne peuvent plus se contenter de recenser les termes et les organiser bri{\`e}vement sous forme d'une hi{\'e}rarchie. {E}lles doivent {\'e}galement proposer toute une gamme de relations qui refl{\`e}tent au mieux les connaissances du domaine et r{\'e}pondent de mani{\`e}re adapt{\'e}e aux besoins des applications. {N}ous confrontons la place accord{\'e}e traditionnellement par la th{\'e}orie terminologique aux relations avec les besoins r{\'e}els qui apparaissent lors de la constitution, l'utilisation et la r{\'e}utilisation de ressources terminologiques. {N}ous pr{\'e}sentons {\'e}galement un panorama des approches propos{\'e}es pour l'acquisition de relations entre termes {\`a} partir de corpus sp{\'e}cialis{\'e}s.}, keywords={terminologie,;structuration de terminologie; acquisition de relations entre termes; relations taxinomiques; synonymie; relations transversales}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}ngenierie des connaissances en sant{\'e} - {INSERM} : {U}729 - {IFR}58 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, pages={57-85 }, journal={{R}evue d'{I}ntelligence {A}rtificielle }, volume={18/1 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084817/en/}, } %% hal-00091627, version 1 %% http://hal.archives-ouvertes.fr/hal-00091627/en/ @article{KAYSER:2003:HAL-00091627:1, title={{Q}uelle place pour l'{I}ntelligence {A}rtificielle ?}, author={{K}ayser, {D}aniel}, keywords={{S}ciences {C}ognitives}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, pages={11-12 }, journal={lettre du d{\'e}partement {SHS} du {CNRS} }, volume={n°67 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00091627/en/}, } %% hal-00153142, version 1 %% http://hal.archives-ouvertes.fr/hal-00153142/en/ @inproceedings{BAILLOT:2007:HAL-00153142:1, title={{F}rom {P}roof-{N}ets to {L}inear {L}ogic {T}ype {S}ystems for {P}olynomial {T}ime {C}omputing.}, author={{B}aillot, {P}atrick}, keywords={lambda calculus, linear logic, implicit computational complexity, type systems}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {T}yped {L}ambda {C}alculi and {A}pplications ({TLCA}'07) }, pages={{\`a} para{\^i}tre }, address={{P}aris {F}rance }, editor={{S}imona {R}onchi {D}ella {R}occa }, series={{L}ecture {N}otes in {C}omputer {S}cience, {S}pringer }, note={6 pages {P}rojet {NO}-{C}o{ST} ({ANR}, {JC}05_43380) }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153142/en/}, } %% hal-00153272, version 1 %% http://hal.archives-ouvertes.fr/hal-00153272/en/ @inproceedings{VAUZEILLES:2007:HAL-00153272:1, title={{P}lanning under {U}ncertainty in {D}omains with {N}umerous but {I}dentical {E}lements (a generic approach)}, author={{V}auzeilles, {J}acqueline and {K}anovich, {M}ax}, abstract={{T}he typical {AI} problem is that of making a plan of the actions to be performed by a robot so that the robot could get into a set of final situations, if it started with a certain initial situation. {T}he planning problem is known to be generally very complex. {E}ven within the case of `well-balanced' actions, strong planning under uncertainty about the effects of actions, or games such as `{R}obot against {N}ature', is {EXPTIME}-complete. {A}s a result, {AI} planners are very sensitive to the number of the variables involved in making a plan, the inherent symmetry of the problem, and the nature of the logical formalisms being used. {T}he aim of this paper is to give a global view on linear logic applications to {AI} planning problems, to introduce linear logic as a comprehensive logical system that automatically exploits peculiarities of the {AI} systems under consideration, and to show that such a logical system can achieve a significant speedup over the traditional ones. {A} particular focus of our paper is on planning problems with an unbounded number of functionally identical objects. {W}e show that for such problems linear logic is especially effective and leads to dramatic contraction of the search space from exponential to polynomial in size. {W}e employ the ability of linear logic to reason about multisets, which in this instance are created by identifying several distinct objects as being functionally equivalent for the problem at hand (think of a number of balls, each of which must be moved to some new location --- the balls are distinct, but are functionally equivalent for the problem). {M}oreover, this correspondence also guarantees to produce a real solution that works in polynomial time.}, keywords={{L}inear {L}ogic - {A}rtificial {I}ntelligence - {P}lanning - {C}omplexity}, language={{A}nglais}, affiliation={{C}omputer {S}cience {D}ept, {Q}ueen {M}ary, {U}niversity of {L}ondon - {QUEEN} {MARY} {COLLEGE} - {U}niversity of {L}ondon - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{F}irst {I}nternational {S}ymmetry {C}onference }, address={{E}dinburgh {R}oyaume-{U}ni }, month={01}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153272/en/}, } %% hal-00020024, version 2 %% http://hal.archives-ouvertes.fr/hal-00020024/en/ @inproceedings{JACOBEDENAUROIS:2006:HAL-00020024:2, title={{A} {M}easure of {S}pace for {C}omputing over the {R}eals}, author={{J}acob{\'e} {D}e {N}aurois, {P}aulin}, abstract={{W}e propose a new complexity measure of space for the {BSS} model of computation. {W}e define {LOGSPACE}_{W} and {PSPACE}_{W} complexity classes over the reals. {W}e prove that {LOGSPACE}_{W} is included in {NC}^2_{R} and in {P}_{W}, i.e. is small enough for being relevant. {W}e prove that the {R}eal {C}ircuit {D}ecision {P}roblem is {P}_{R}-complete under {LOGSPACE}_{W} reductions, i.e. that {LOGSPACE}_{W} is large enough for containing natural algorithms. {W}e also prove that {PSPACE}_{W} is included in {PAR}_{R}.}, keywords={{BSS} model of computation, weak model, algebraic complexity, space}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{L}ogical {A}pproaches to {C}omputational {B}arriers {S}econd {C}onference on {C}omputability in {E}urope, {C}i{E} 2006 }, publisher={{S}pringer }, pages={231-240 }, address={{S}wansea {R}oyaume-{U}ni }, editor={{B}eckmann, {A}.; {B}erger, {U}.; {L}{\"o}we, {B}.; {T}ucker, {J}.{V}. }, series={{L}ecture {N}otes in {C}omputer {S}cience }, ARXIVID={cs.CC/0603017 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00020024/en/}, } %% hal-00153108, version 1 %% http://hal.archives-ouvertes.fr/hal-00153108/en/ @inproceedings{LAVAULT:2006:HAL-00153108:1, title={{R}andom {G}eometric {G}raphs and the {I}nitialization {P}roblem for {W}ireless {N}etworks}, author={{L}avault, {C}hristian and {O}lariu, {S}tephan and {R}avelomanana, {V}lady}, abstract={{T}he initialization problem, also known as naming, assigns one unique identifier (ranging from $1$ to $n$) to a set of $n$ indistinguishable nodes (stations or processors) in a given wireless network $\mathcal{{N}}$. $\mathcal{{N}}$ is composed of $n$ nodes randomly deployed within a square (resp. a cube) ${X}$. {W}e assume the time to be slotted and $\mathcal{{N}}$ to be synchronous; two nodes are able to communicate if they are within a distance at most $r$ of each other ($r$ is the transmitting/receiving range). {M}oreover, if two or more neighbors of a processor $u$ transmit concurrently at the same round, $u$ does not receive either messages. {A}fter the analysis of various critical transmitting/sensing ranges for connectivity and coverage of randomly deployed sensor networks, we design sub-linear randomized initialization and gossiping algorithms with running time $\{BO}\l(n^{1/2} \log{(n)}^{1/2}\r)$ and $\{BO}\l(n^{1/3} \log{(n)}^{2/3}\r)$) in the two-dimensional and the three-dimensional cases, respectively. {N}ext, we propose energy-efficient initialization and gossiping algorithms running in time $\{BO}\l(n^{3/4} \log{(n)}^{1/4}\r)$, with no station being awake for more than $\{BO}\l(n^{1/4}\log{(n)}^{3/4}\r)$ rounds.}, keywords={{S}ensor networks, initialization, random geometric graphs}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omp. {S}cience {D}epart. {O}ld {D}ominion {U}niversity - {ODU} - {O}ld {D}ominion {U}niversity }, booktitle={{NATO} {A}dvanced {R}esearch {W}orkshop on {I}nformation {S}ecurity in {W}ireless {N}etworks }, address={{S}uceava {R}oumanie }, editor={{I}opress }, series={{T}o appear }, note={{F}.2 }, day={04}, month={09}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153108/en/}, } %% hal-00091645, version 1 %% http://hal.archives-ouvertes.fr/hal-00091645/en/ @inproceedings{KAYSER:2005:HAL-00091645:1, title={{W}hat {L}ogic can and cannot do in {N}atural {L}anguage {S}emantics}, author={{K}ayser, {D}aniel}, abstract={{T}he traditional approach to {N}atural {L}anguage {S}emantics consists in equating the semantic content of a sentence with its truth conditions, i.e. with what the universe of discourse must look like for the sentence to be true. {T}his approach gave rise to such elegant and such sophisticated logical theories that its blatant inadequacies, when faced to real language, have not been seriously taken into consideration. {T}he excuse consists in handing over the unsolved problems to {P}ragmatics. {I} will show that the origin of the flaws are to be found in an inadequate idealization: the notion of truth is not central to language, and anyway it has not the characteristics of the mathematical truth; the universe of discourse does not fit with the logical notion of domain of interpretation; the meaning cannot be represented as a unique formula; the compositionality hypothesis does not hold in general. {B}ut {I} will also show that there is still an important place for some kind of {L}ogic in {N}atural {L}anguage {S}emantics, once it is acknowledged that the prototypical use of language is not to communicate descriptions, but to make the hearer / reader draw conclusions from what is said / written.}, keywords={{L}ogic; {N}atural {L}anguage {S}emantics; {T}ruth; {C}ompositionality; {I}nference}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{F}irst {I}ndian {C}onference on {L}ogic and its relationship with other disciplines }, address={{B}ombay {I}nde }, series={{A}ctes en cours d'{\'e}dition }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00091645/en/}, } %% hal-00012214, version 1 %% http://hal.archives-ouvertes.fr/hal-00012214/en/ @inproceedings{PETRUCCI:2005:HAL-00012214:1, title={{M}odularity and {P}etri {N}ets}, author={{P}etrucci, {L}aure}, abstract={{T}he systems to model are nowadays very large. {T}heir specification is often decomposed into several steps. {T}his leads to modularly or incrementally designed models. {P}etri nets analysis is generally achieved via state space analysis, which is often impossible to perform due to the so-called state space explosion problem. {S}everal methods allow to reduce the occurrence graph size, e.g. using partial orders, symmetries, ... {H}ere, we focus on techniques which take advantage of the modular design of the system, and hence build the state space in a modular or incremental way.}, keywords={{P}etri nets, modularity, refinement, state spaces}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={7th {I}nternational {S}ymposium on {P}rogramming and {S}ystems ({ISPS}'2005) }, pages={7-8 }, address={{A}lger {A}lg{\'e}rie }, note={{ACM}: {D}2.2 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00012214/en/}, } %% hal-00088073, version 1 %% http://hal.archives-ouvertes.fr/hal-00088073/en/ @inproceedings{CZACHORSKI:2004:HAL-00088073:1, title={{D}iffusion approximation as a modelling tool in congestion control and performance evaluation}, author={{C}zachorski, {T}adeusz and {P}ekergin, {F}erhan}, keywords={{M}odelisation ; {D}iffusion approximation ; performance evaluation}, language={{A}nglais}, affiliation={{I}nstytut {I}nformatyki {T}eoretycznej i {S}tosowanej {P}olskiej {A}kademii {N}auk - {IITIS} {PAN} - {P}olska {A}kademia {N}auk - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {HET}-{NET}s '04 {P}erformance {M}odelling and {E}valuation of {H}eterogenous {N}etworks }, address={{I}lkley {R}oyaume-{U}ni }, editor={{D}emetres {K}ouvatsos }, note={{T}utorial {I}.6.5 }, collaboration={{P}rojet de {C}oop{\'e}ration {CNRS} - {PAN} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00088073/en/}, } %% hal-00105679, version 1 %% http://hal.archives-ouvertes.fr/hal-00105679/en/ @inproceedings{POIBEAU:2004:HAL-00105679:1, title={{C}ontent annotation for the semantic web}, author={{P}oibeau, {T}hierry}, keywords={{T}ext mining; extraction d'information; web s{\'e}mantique}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{T}he {NEMIS} 2004 {F}inal {C}onference }, publisher={{U}niversita di {R}oma1 "{L}a {S}apienza" }, pages={1-15 }, address={{R}ome {I}talie }, editor={{S}ergio {B}olasco }, note={{C}onf{\'e}rence invit{\'e}e lors de la conf{\'e}rence de cl{\^o}ture {N}emis. {R}eprise ensuite en volume chez {S}pringer. }, audience={non sp{\'e}cifi{\'e}e }, collaboration={{N}emis }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00105679/en/}, } %% hal-00082479, version 1 %% http://hal.archives-ouvertes.fr/hal-00082479/en/ @inproceedings{BANDERIER:2003:HAL-00082479:1, title={{L}a combinatoire analytique ou "{C}omment j'ai aim{\'e} les probas" ...}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{R}encontres math{\'e}matiques de {R}ouen en l'honneur de {C}laude {D}ellacherie }, address={{F}rance }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082479/en/}, } %% hal-00082474, version 1 %% http://hal.archives-ouvertes.fr/hal-00082474/en/ @inproceedings{BANDERIER:2003:HAL-00082474:1, title={{C}ombinatoire (analytique), informatique (th{\'e}orique) et physique (statistique)}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{J}ourn{\'e}es du {LIPN}: {I}nformatique et physique }, address={{F}rance }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082474/en/}, } %% hal-00091616, version 1 %% http://hal.archives-ouvertes.fr/hal-00091616/en/ @inproceedings{KAYSER:2003:HAL-00091616:1, title={{U}ne approche inf{\'e}rentielle de la s{\'e}mantique du langage naturel}, author={{K}ayser, {D}aniel}, abstract={{L}a s{\'e}mantique consiste, dit-on g{\'e}n{\'e}ralement, en l'{\'e}tude des liens entre le langage et le monde. {L}'id{\'e}e la plus simple est que ces liens ont la forme d'une correspondance biunivoque : un objet un nom propre, une classe d'objets un nom commun. {O}n rappellera les {\'e}cueils bien connus de cette approche, et les rem{\`e}des qui ont {\'e}t{\'e} propos{\'e}s pour les {\'e}viter ({\'e}v{\'e}nements, mondes possibles, prototypes, ...). {M}ais plus profond{\'e}ment, on se demandera si ces rem{\`e}des ne sont pas des palliatifs pour sauver un cadre th{\'e}orique franchement inad{\'e}quat.}, keywords={s{\'e}mantique; langage naturel;}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{VI}th {I}nternational {S}ymposium on {P}rogramming and {S}ystems }, pages={9 }, address={{A}lger {A}lg{\'e}rie }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00091616/en/}, } %% hal-00003550, version 1 %% http://hal.archives-ouvertes.fr/hal-00003550/en/ @inproceedings{VAUZEILLES:1995:HAL-00003550:1, title={{I}nheritance with exceptions: an attempt at formalization with linear connectives in {U}nified {L}ogic}, author={{V}auzeilles, {J}acqueline and {F}ouquer{\'e}, {C}hristophe}, abstract={{T}he problems of inheritance reasoning in taxonomical networks are crucial in object-oriented languages and in artificial intelligence. {A} taxonomical network is a graph that enables knowledge to be represented. {T}his paper focuses on the means linear logic offers to represent these networks and is a follow-up to the note on exceptions by {J}ean-{Y}ves {G}irard. {I}t is first proved that all compatible nodes of a taxonomical network can be deduced in the taxonomical linear theory associated to the network. {M}oreover, this theory can be integrated in the {U}nified {L}ogic {LU} and so taxonomical and classical reasoning can be combined.}, keywords={{L}inear {L}ogic; {U}nified {L}ogic ({LU}); exceptions}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}dvances in {L}inear {L}ogic }, publisher={{C}ambridge {U}niversity {P}ress }, pages={167-196 }, address={{F}rance }, editor={{J}.-{Y}. {G}irard, {Y}. {L}afont and {L}. {R}egnier }, note={date de r{\'e}daction: 1993 }, year={1995}, URL={http://hal.archives-ouvertes.fr/hal-00003550/en/}, } %% hal-00003556, version 1 %% http://hal.archives-ouvertes.fr/hal-00003556/en/ @inproceedings{VAUZEILLES:1990:HAL-00003556:1, title={{P}lan {G}eneration and {L}inear {L}ogic}, author={{V}auzeilles, {J}acqueline and {M}asseron, {M}arcel and {T}ollu, {C}hristophe}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{FST}-{TCS} }, publisher={{L}ecture {N}otes in {C}omputer {S}cience }, pages={63-75 }, address={{B}angalore {I}nde }, year={1990}, URL={http://hal.archives-ouvertes.fr/hal-00003556/en/}, } %% inria-00359162, version 1 %% http://hal.inria.fr/inria-00359162/en/ @inproceedings{BASSINO:2009:INRIA-00359162:1, title={{O}n the {A}verage {C}omplexity of {M}oore’s {S}tate {M}inimization {A}lgorithm}, author={{B}assino, {F}r{\'e}d{\'e}rique and {D}avid, {J}ulien and {N}icaud, {C}yril}, abstract={{W}e prove that, for any arbitrary \&\#64257;nite alphabet and for the uniform distribution over deterministic and accessible automata with n states, the average complexity of {M}oore's state minimization algorithm is in {O}(n log n). {M}oreover this bound is tight in the case of unary utomata.}, keywords={finite automata ; state minimization ; {M}oore’s algorithm ; average complexity}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nstitut {G}aspard-{M}onge - {IGM} - {U}niversit{\'e} {P}aris-{E}st }, booktitle={26th {I}nternational {S}ymposium on {T}heoretical {A}spects of {C}omputer {S}cience {STACS} 2009 }, publisher={{IBFI} {S}chloss {D}agstuhl }, pages={123-134 }, address={{F}reiburg {A}llemagne }, editor={{S}usanne {A}lbers and {J}ean-{Y}ves {M}arion }, audience={internationale }, ARXIVID={0902.1048 }, year={2009}, URL={http://hal.inria.fr/inria-00359162/en/}, } %% hal-00378594, version 1 %% http://hal.archives-ouvertes.fr/hal-00378594/en/ @inproceedings{MA:2009:HAL-00378594:1, title={{O}ntologies {\'e}tendues pour l'annotation s{\'e}́mantique}, author={{M}a, {Y}ue and {A}udibert, {L}aurent and {N}azarenko, {A}deline}, abstract={{T}his article tries to formalize the process of semantically annotating a text with respect to an ontology. {T}he semantic annotation puts fragments of a text in correspondence with the elements of an ontology, but all the difficulties consist in identifying fragments to be annotated and labels to be associated with them. {W}e propose in this paper to extend ontologies by semantic annotation rules instead of by additional meta-lexical properties. {T}his solution allows reusing best {NLP} tools which produce linguistic annotations at each of their levels. {I}t also has the merit to distinguish clearly the process of linguistic analysis and the ontological interpretation.}, keywords={{O}ntology, {S}emantic {A}nnotation, {L}exicon, {T}erminology, {A}nnotation {P}lateforme, {L}inguistic pattern}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={20es {J}ourn{\'e}es {F}rancophones d'{I}ng{\'e}nierie des {C}onnaissances 20es {J}ourn{\'e}es {F}rancophones d'{I}ng{\'e}nierie des {C}onnaissances }, pages={not specified }, address={{H}ammamet, {T}unisie {T}unisie }, note={{Q}uaero, financ{\'e} par {OSEO}, agence nationale de valorisation de la recherche. }, audience={nationale }, collaboration={{Q}uaero }, day={29}, month={05}, year={2009}, URL={http://hal.archives-ouvertes.fr/hal-00378594/en/}, } %% hal-00357119, version 1 %% http://hal.archives-ouvertes.fr/hal-00357119/en/ @inproceedings{MONDARY:2009:HAL-00357119:1, title={{A}nalyse de concepts formels pour la construction d'ontologies {\`a} partir de textes : la question du corpus}, author={{M}ondary, {T}hibault and {D}espr{\'e}s, {S}ylvie}, abstract={{N}ous nous int{\'e}ressons {\`a} l'{\'e}valuation d'une m{\'e}thode permettant l'acquisition de hi{\'e}rarchies {\`a} partir de textes. {L}'analyse de concepts formels semble donner de bons r{\'e}sultats dans les travaux de {C}imiano et al. (2005) et plus r{\'e}cemment {B}endaoud et al. (2007). {N}ous montrons que sur certains corpus les r{\'e}sultats semblent moins utilisables. {E}st-ce d{\^u} au style du texte ? {A}u domaine {\`a} mod{\'e}liser ? {A}pr{\`e}s une pr{\'e}sentation de la m{\'e}thode utilis{\'e}e pour construire nos contextes formels, nous analysons les r{\'e}sultats obtenus sur diff{\'e}rents corpus. {P}lusieurs variantes de construction des contextes formels sont propos{\'e}es, ax{\'e}es sur la s{\'e}lection des objets, avec pour objectif d'am{\'e}liorer l'utilisabilit{\'e} du treillis dans un contexte de conceptualisation semi-automatique.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{EGC}09 - {A}ctes des ateliers {Q}ualit{\'e} des {D}onn{\'e}es et des {C}onnaissances, atelier associ{\'e} {\`a} {EGC}09 }, pages={{A}6-5 }, address={{S}trasbourg {F}rance }, editor={{N}icolas {L}aliche, {A}gn{\`e}s {B}raud, {P}ierre {G}an{\c{c}}arski, {J}ean-{G}abriel {G}anascia }, audience={non sp{\'e}cifi{\'e}e }, day={27}, month={01}, year={2009}, URL={http://hal.archives-ouvertes.fr/hal-00357119/en/}, } %% hal-00276323, version 1 %% http://hal.archives-ouvertes.fr/hal-00276323/en/ @inproceedings{ABBES:2008:HAL-00276323:1, title={{\'E}tude de performance des syst{\`e}mes de d{\'e}couverte de ressources}, author={{A}bbes, {H}eithem and {C}{\'e}rin, {C}hristophe and {D}ubacq, {J}ean-{C}hristophe and {J}emni, {M}ohamed}, abstract={{T}he {D}esktop {G}rid offers solutions to overcome several challenges and to answer increasingly needs of scientific computing. {T}his technology consists mainly in exploiting {PC} resources, geographically dispersed, to treat time consuming applications and/or important storage capacity requiring applications. {H}owever, as resources number increases, the need for scalability, self-organisation, dynamic reconfiguration, decentralization and performance becomes more and more essential. {I}n this context, this paper evaluates the scalability and performance of {P}2{P} tools for registering and discovering services ({P}ublish/{S}ubscribe systems). {T}hree protocols are used in this purpose: {B}onjour, {A}vahi and {P}astry. {W}e have studied the behaviour of these protocols related to two criteria: the elapsed time for registrations services and the needed time to discover new services.}, keywords={desktop grid; performance evaluation;services discovery;{Z}ero{C}onf;{P}astry}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {T}echnologie de l'{I}nformation et de la {C}ommunication - {UTIC} - {\'E}cole {S}up{\'e}rieure des {S}ciences et {T}echnologies de {T}unis }, booktitle={{A}ctes de {F}ribourg'2008 : {R}enpar'18 / {S}ymp{A}'2008 / {CFSE}'6 {R}enpar'18 }, pages={papers/r11 }, address={{F}ribourg {S}uisse }, volume={1 }, number={1 }, note={{P}ublication on {CDROM} only }, audience={nationale }, ARXIVID={0804.4590 }, day={11}, month={02}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00276323/en/}, } %% hal-00339874, version 1 %% http://hal.archives-ouvertes.fr/hal-00339874/en/ @inproceedings{ASEERVATHAM:2008:HAL-00339874:1, title={{U}n mod{\`e}le d'espace vectoriel de concepts pour noyaux s{\'e}mantiques}, author={{A}seervatham, {S}ujeevan}, abstract={{L}es noyaux ont {\'e}t{\'e} largement utilis{\'e}s pour le traitement de donn{\'e}es textuelles comme mesure de similarit{\'e} pour des algorithmes tels que les {S}{\'e}parateurs {\`a} {V}aste {M}arge ({SVM}). {L}e mod{\`e}le de l'espace vectoriel ({VSM}) a {\'e}t{\'e} amplement utilis{\'e} pour la repr{\'e}sentation spatiale des documents. {C}ependant, le {VSM} est une repr{\'e}sentation purement statistique. {D}ans ce papier, nous pr{\'e}sentons un mod{\`e}le d'espace vectoriel de concepts ({CVSM}) qui se base sur des connaissances linguistiques a priori pour capturer le sens des documents. {N}ous proposons aussi un noyau lin{\'e}aire et un noyau latent pour cet espace. {L}e noyau lin{\'e}aire exploite les concepts linguistiques pour l'extraction du sens alors que le noyau latent combine les concepts statistiques et linguistiques. {E}n effet, le noyau latent utilise des concepts latents extraits par l'{A}nalyse {S}{\'e}mantique {L}atente ({LSA}) dans le {CVSM}. {L}es noyaux sont {\'e}valu{\'e}s sur une t{\^a}che de cat{\'e}gorisation de texte dans le domaine biom{\'e}dical. {L}e corpus {O}hsumed, bien connu pour sa difficult{\'e} de cat{\'e}gorisation, a {\'e}t{\'e} utilis{\'e}. {L}es r{\'e}sultats ont montr{\'e} que les performances de cat{\'e}gorisation sont am{\'e}lior{\'e}es dans le {CSVM}.}, keywords={{N}oyau; {M}achine {\`a} {V}ecteur de {S}upport; {TAL}}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{E}xtraction et gestion des connaissances ({EGC}'2008) {E}xtraction et gestion des connaissances ({EGC}'2008) }, pages={601-612 }, address={{S}ophia-{A}ntipolis {F}rance }, volume={2 }, series={{R}evue des {N}ouvelles {T}echnologies de l'{I}nformation {RNTI}-{E}-11 }, audience={nationale }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00339874/en/}, } %% hal-00339857, version 1 %% http://hal.archives-ouvertes.fr/hal-00339857/en/ @inproceedings{ASEERVATHAM:2008:HAL-00339857:1, title={{A} {L}ocal {L}atent {S}emantic {A}nalysis-based {K}ernel for {D}ocument {S}imilarities}, author={{A}seervatham, {S}ujeevan}, abstract={{T}he document similarity measure is a key point in textual data processing. {I}t is the main responsible of the performance of a processing system. {S}ince a decade, kernels are used as similarity functions within inner-product based algorithms such as the {SVM} for {NLP} problems and especially for text categorization. {I}n this paper, we present a semantic space constructed from latent concepts. {T}he concepts are extracted using the {L}atent {S}emantic {A}nalysis ({LSA}). {T}o take into account of the specificity of each document category, we use the local {LSA} to define the global semantic space. {F}urthermore, we propose a weighted semantic kernel for the global space. {T}he experimental results of the kernel, on text categorization tasks, show that this kernel performs better than global {LSA} kernels and especially for small {LSA} dimensions.}, keywords={{S}upport {V}ector {M}achine; {L}atent {S}emantic {A}nalysis; {N}atural {L}anguage {P}rocessing; {K}ernel}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{N}eural {N}etworks, 2008. {IJCNN} 2008. ({IEEE} {W}orld {C}ongress on {C}omputational {I}ntelligence). {IEEE} {I}nternational {J}oint {C}onference on {N}eural {N}etworks {IEEE} {I}nternational {J}oint {C}onference on {N}eural {N}etworks }, pages={214-219 }, address={{H}ong-{K}ong {C}hine }, audience={internationale }, doi={10.1109/{IJCNN}.2008.4633792 }, day={01}, month={06}, year={2008}, URL={dx.doi.org/10.1109/{IJCNN}.2008.4633792 http://hal.archives-ouvertes.fr/hal-00339857/en/}, } %% inria-00337666, version 1 %% http://hal.inria.fr/inria-00337666/en/ @inproceedings{BADRA:2008:INRIA-00337666:1, title={{TAAABLE}: {T}ext {M}ining, {O}ntology {E}ngineering, and {H}ierarchical {C}lassification for {T}extual {C}ase-{B}ased {C}ooking}, author={{B}adra, {F}adi and {B}endaoud, {R}okia and {B}entebibel, {R}im and {C}hampin, {P}ierre-{A}ntoine and {C}ojan, {J}ulien and {C}ordier, {A}m{\'e}lie and {D}espr{\'e}s, {S}ylvie and {J}ean-{D}aubias, {S}t{\'e}phanie and {L}ieber, {J}ean and {M}eilender, {T}homas and {M}ille, {A}lain and {N}auer, {E}mmanuel and {N}apoli, {A}medeo and {T}oussaint, {Y}annick}, abstract={{TAAABLE}: {T}ext {M}ining, {O}ntology {E}ngineering, and {H}ierarchical {C}lassification for {T}extual {C}ase-{B}ased {C}ooking}, keywords={textual case-based reasoning; case-based cooking; text mining; ontology engineering; hierarchical classification}, language={{A}nglais}, affiliation={{ORPAILLEUR} - {INRIA} {L}orraine - {LORIA} - {INRIA} - {CNRS} : {UMR}7503 - {U}niversit{\'e} {H}enri {P}oincar{\'e} - {N}ancy {I} - {U}niversit{\'e} {N}ancy {II} - {I}nstitut {N}ational {P}olytechnique de {L}orraine - {C}entre de {R}echerche en {I}nformatique de {P}aris 5 - {CRIP}5 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'{I}nfo{R}matique en {I}mages et {S}yst{\`e}mes d'{I}nformation - {LIRIS} - {CNRS} : {UMR}5205 - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {U}niversit{\'e} {L}umi{\`e}re - {L}yon {II} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {L}yon - {E}cole {C}entrale de {L}yon - {CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={9th {E}uropean {C}onference on {C}ase-{B}ased {R}easoning - {ECCBR} 2008 }, pages={219--228 }, address={{T}rier {A}llemagne }, editor={{M}artin {S}chaaf }, audience={internationale }, year={2008}, URL={http://hal.inria.fr/inria-00337666/en/}, } %% halshs-00321379, version 1 %% http://halshs.archives-ouvertes.fr/halshs-00321379/en/ @inproceedings{BATTISTELLI:2008:HALSHS-00321379:1, title={{R}epresenting and {V}isualizing {C}alendar {E}xpressions in {T}exts}, author={{B}attistelli, {D}elphine and {C}outo, {J}avier and {R}. {S}chwer, {S}ylviane and {M}inel, {J}ean-{L}uc}, abstract={{T}emporal expressions that refer to a part of a calendar area in terms of common calendar divisions are studied. {O}ur claim is that such a "calendar expression" ({CE}) can be described by a succession of operators operating on a calendar base ({CB}). {T}hese operators are categorized: a pointing operator that transforms a {CB} into a {CE}; focalizing/shifting operators that reduce or shift the {CE} into another {CE}, and finally zoning operators that provide the wanted {CE} from this last {CE}. {R}elying on these operators, a set of annotations is presented which are used to automatically annotate biographic texts. {A} software application, plugged in the platform {N}avitexte, is described that builds a calendar view of a biographic text.}, keywords={{T}emporal {E}xpressions, {C}alendar {E}xpressions {R}epresentation}, language={{A}nglais}, affiliation={{L}angues, logiques, informatiques, cognition et communication - {L}a{LIC} - {CNRS} : {UMR}8139 - {U}niversit{\'e} {P}aris-{S}orbonne - {P}aris {IV} - {M}od{\`e}les, {D}ynamiques, {C}orpus - {M}o{D}y{C}o - {CNRS} : {UMR}7114 - {U}niversit{\'e} de {P}aris {X} - {N}anterre - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{SYMPOSIUM} {ON} {SEMANTICS} {IN} {SYSTEMS} {FOR} {TEXT} {PROCESSING} {SYMPOSIUM} {ON} {SEMANTICS} {IN} {SYSTEMS} {FOR} {TEXT} {PROCESSING} }, pages={1-7 }, address={{V}enice {I}talie }, audience={internationale }, year={2008}, URL={http://halshs.archives-ouvertes.fr/halshs-00321379/en/}, } %% halshs-00275138, version 1 %% http://halshs.archives-ouvertes.fr/halshs-00275138/en/ @inproceedings{BATTISTELLI:2008:HALSHS-00275138:1, title={{R}epr{\'e}sentation alg{\'e}brique des expressions calendaires et vue calendaire d’un texte}, author={{B}attistelli, {D}elphine and {C}outo, {J}avier and {M}inel, {J}ean-{L}uc and {R}. {S}chwer, {S}ylviane}, abstract={{C}et article aborde l’{\'e}tude des expressions temporelles qui font r{\'e}f{\'e}rence directement {\`a} des unit{\'e}s de temps relatives aux divisions courantes des calendriers, que nous qualifions d’expressions calendaires ({EC}). {N}ous proposons une mod{\'e}lisation de ces expressions en d{\'e}finissant une alg{\`e}bre d’op{\'e}rateurs qui sont li{\'e}s aux classes de marqueurs linguistiques qui apparaissent dans les {EC}. {A} partir de notre mod{\'e}lisation, une vue calendaire est construite dans la plate-forme de visualisation et navigation textuelle {N}avi{T}exte, visant lesupport {\`a} la lecture de textes. {E}nfin, nous concluons sur les perspectives offertes par le d{\'e}veloppement d’une premi{\`e}re application de navigation temporelle.}, keywords={expressions temporelles calendaires, alg{\`e}bre, visualisation}, language={{F}ran{\c{c}}ais}, affiliation={{L}angues, logiques, informatiques, cognition et communication - {L}a{LIC} - {CNRS} : {UMR}8139 - {U}niversit{\'e} {P}aris-{S}orbonne - {P}aris {IV} - {M}od{\`e}les, {D}ynamiques, {C}orpus - {M}o{D}y{C}o - {CNRS} : {UMR}7114 - {U}niversit{\'e} de {P}aris {X} - {N}anterre - {L}aboratoire d'{I}nformatique de {P}aris-{N}ord - {LIPN} - {CNRS} : {UMR}7030 }, booktitle={{A}ctes de {TALN}/{JEP} 08 {TALN} 08 }, pages={1-10 }, address={{A}vignon {F}rance }, audience={internationale }, year={2008}, URL={http://halshs.archives-ouvertes.fr/halshs-00275138/en/}, } %% hal-00347010, version 1 %% http://hal.archives-ouvertes.fr/hal-00347010/en/ @inproceedings{BOUFFIER:2008:HAL-00347010:1, title={{A}nalyse et structuration automatique des guides de bonnes pratiques cliniques : essai d'{\'e}valuation}, author={{B}ouffier, {A}manda and {P}oibeau, {T}hierry and {D}uclos, {C}atherine}, abstract={{H}ealth {P}ractice {G}uideliens are supposed to unify practices and propose recommendations to physicians. {T}his paper describes {G}em{F}rame, a system capable of semi-automatically filling an {XML} template from free texts in the clinical domain. {T}he {XML} template includes semantic information not explicitly encoded in the text (pairs of conditions and ac-tions/recommendations). {T}herefore, there is a need to compute the exact scope of condi-tions over text sequences expressing the re-quired actions. {W}e present a system developped for this task. {W}e show that it yields good performance when applied to the analysis of {F}rench practice guidelines. {W}e conclude with a precise evaluation of the tool.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique {M}{\'e}dicale et de {B}iologie - {LIM}\&{B}io - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} : {EA}3969 }, booktitle={{A}ctes de la conf{\'e}rence "{I}ng{\'e}nierie des {C}onnaissances" {I}ng{\'e}nierie des {C}onnaissances ({IC}2008) }, pages={- }, address={{N}ancy {F}rance }, audience={nationale }, ARXIVID={0812.2991 }, month={06}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00347010/en/}, } %% hal-00174425, version 1 %% http://hal.archives-ouvertes.fr/hal-00174425/en/ @inproceedings{DESPRES:2008:HAL-00174425:1, title={{C}onstruction d’ontologies {\`a} partir de textes dans le domaine juridique}, author={{D}espr{\'e}s, {S}ylvie}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes du colloque annuel de la {S}oci{\'e}t{\'e} {F}ran{\c{c}}aise de {T}erminologie ({SFT}) {C}olloque annuel de la {S}oci{\'e}t{\'e} {F}ran{\c{c}}aise de {T}erminologie ({SFT}) }, pages={{\`a} para{\^i}tre }, address={{F}rance }, audience={nationale }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00174425/en/}, } %% hal-00274004, version 1 %% http://hal.archives-ouvertes.fr/hal-00274004/en/ @inproceedings{DUBACQ:2008:HAL-00274004:1, title={{S}tudy of the {NP}-completeness of the compact table problem}, author={{D}ubacq, {J}ean-{C}hristophe and {M}oyen, {J}ean-{Y}ves}, abstract={{T}he problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). {T}his problem is shown to be {NP}-complete in the general case, and some specific restrictions are studied.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {F}irst {S}ymposium on {C}ellular {A}utomata "{J}ourn{\'e}es {A}utomates {C}ellulaires" {JAC} 2008 }, publisher={\&\#1048;\&\#1079;\&\#1076;\&\#1072;\&\#1090;\&\#1077;\&\#1083;\&\#1100;\&\#1089;\&\#1090;\&\#1074;\&\#1086; \&\#1052;\&\#1062;\&\#1053;\&\#1052;\&\#1054; }, pages={228-237 }, address={{U}z{\`e}s {F}rance }, editor={{B}runo {D}urand }, series={{E}xploratory paper track }, note={{ISBN} 978-5-94057-377-7 }, audience={internationale }, day={10}, month={04}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00274004/en/}, } %% hal-00306276, version 1 %% http://hal.archives-ouvertes.fr/hal-00306276/en/ @inproceedings{DURAND:2008:HAL-00306276:1, title={{R}easoning about qualitative temporal information with {S}-words and {S}-languages}, author={{D}urand, {I}r{\`e}ne and {S}chwer, {S}ylviane}, keywords={{T}emporal reasoning; relation algebras; {S}-languages, {L}isp}, language={{A}nglais}, affiliation={{L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the 1st {E}uropean {L}isp {S}ymposium {E}uropean {L}isp {S}ymposium }, pages={1-15 }, address={{F}rance }, audience={internationale }, month={05}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00306276/en/}, } %% hal-00346996, version 1 %% http://hal.archives-ouvertes.fr/hal-00346996/en/ @inproceedings{GENEREUX:2008:HAL-00346996:1, title={{S}entiment analysis using automatically labelled financial news}, author={{G}{\'e}n{\'e}reux, {M}ichel and {P}oibeau, {T}hierry and {K}oppel, {M}oshe}, abstract={{G}iven a corpus of financial news labelled according to the market reaction following their publication, we investigate cotemporeneous and forward-looking price stock movements. {O}ur approach is to provide a pool of relevant textual features to a machine learning algorithm to detect substantial stock price variations. {O}ur two working hypotheses are that the market reaction to a news is a good indicator for labelling financial news, and that a machine learning algorithm can be trained on those news to build models detecting price movement effectively.}, keywords={opinion mining; sentiment analysis; financial news}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {B}ar-{I}lan {U}niversity - {B}ar-{I}lan {U}niversity }, booktitle={{LREC} 2008 {W}orkshop on {S}entiment {A}nalysis: {E}motion, {M}etaphor, {O}ntology and {T}erminology {LREC} 2008 {W}orkshop on {S}entiment {A}nalysis: {E}motion, {M}etaphor, {O}ntology and {T}erminology }, pages={- }, address={{M}arakech {M}aroc }, audience={internationale }, month={06}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00346996/en/}, } %% hal-00339845, version 1 %% http://hal.archives-ouvertes.fr/hal-00339845/en/ @inproceedings{GRABAR:2008:HAL-00339845:1, title={{T}erm variation and semantics for document classification and detection of obesity and its co-morbidities cases}, author={{G}rabar, {N}atalia and {H}amon, {T}hierry and {D}art, {T}hierry}, abstract={{W}ithin the translational medicine area, researchers aim at connecting more closely medical knowledge and individual patient data, in order to improve patient care quality. {T}he 2008 {I}2{B}2 {O}besity {NLP} challenge is to promote such research and to evaluate such systems within the same framework. {W}e participated at this challenge. {O}ur approach bets on use of semantics and term variants. {T}he results obtained by our system are superior to the mean challenge results and seem to be promising, although there is room for improvements which we present and discuss in this paper.}, language={{A}nglais}, affiliation={{I}ngenierie des connaissances en sant{\'e} - {INSERM} : {U}729 - {IFR}58 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {H}{\^o}pital europ{\'e}en {G}eorges {P}ompidou - {AP}-{HP} - {H}{\^o}pital europ{\'e}en {G}eorges {P}ompidou - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}econd i2b2 {S}hared-{T}ask and {W}orkshop {C}hallenges in {N}atural {L}anguage {P}rocessing for {C}linical {D}ata - {AMIA} {W}orkshop {W}orkshop {C}hallenges in {N}atural {L}anguage {P}rocessing for {C}linical {D}ata - {AMIA} }, pages={?? }, address={{\'E}tats-{U}nis d'{A}m{\'e}rique }, audience={internationale }, day={07}, month={11}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00339845/en/}, } %% hal-00339839, version 1 %% http://hal.archives-ouvertes.fr/hal-00339839/en/ @inproceedings{GRABAR:2008:HAL-00339839:1, title={{C}ombination of endogenous clues for profiling inferred semantic relations: experiments with {G}ene {O}ntology}, author={{G}rabar, {N}atalia and {J}aulent, {M}arie-{C}hristine and {H}amon, {T}hierry}, abstract={{A}cquisition and enrichment of lexical resources is acknowledged as an important research in the area of computational linguistics. {W}hile such resources are often missing, specialized domains, ie biomedicine, propose several structured terminologies. {I}n this paper, we propose a high-quality method for inferring elementary synonym lexicon through a structured terminology. {T}he method is based on the analysis of syntactic structure of complex terms. {T}he inferred synonym pairs are then profiled according to different clues endogenously computed within the same terminology. {W}e apply and evaluate the approach on the {G}ene {O}ntology biomedical terminology.}, language={{A}nglais}, affiliation={{I}ngenierie des connaissances en sant{\'e} - {INSERM} : {U}729 - {IFR}58 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {AMIA} 2008 {A}nnual {S}ymposium {AMIA} {A}nnual {S}ymposium }, pages={252-6 , {PMID} 18999042 }, address={{\'E}tats-{U}nis d'{A}m{\'e}rique }, audience={internationale }, day={12}, month={11}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00339839/en/}, } %% hal-00288819, version 1 %% http://hal.archives-ouvertes.fr/hal-00288819/en/ @inproceedings{GRABAR:2008:HAL-00288819:1, title={{A}utomatic acquisition of synonyms from {F}rench {UMLS} for enhanced search of {EHR}s}, author={{G}rabar, {N}atalia and {V}aroutas, {P}aul-{C}hristophe and {R}izand, {P}hilippe and {L}ivartowski, {A}lain and {H}amon, {T}hierry}, abstract={{C}urrently, the use of {N}atural {L}anguage {P}rocessing ({NLP}) approaches in order to improve search and exploration of electronic health records ({EHR}s) within healthcare information systems is not a common practice. {O}ne reason for this is the lack of suitable lexical resources: various types of such resources need to be collected or acquired. {I}n this work, we propose a novel method for the acquisition of synonymous resources. {T}his method is language-independent and relies on existence of structured terminologies. {I}t enables to decipher hidden synonymous relations between simple words and terms on the basis of their syntactic analysis and exploitation of their compositionality. {A}pplied to series of synonym terms from the {F}rench subset of the {UMLS}, the method shows 99% precision. {T}he overlap between thus inferred terms and the existing sparse resources of synonyms is very low.}, language={{A}nglais}, affiliation={{C}entre de recherche des {C}ordeliers - {INSERM} : {U}872 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {D}{\'e}partement d'{I}nformation {M}{\'e}dicale - {I}nstitut {C}urie - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={e{H}ealth {B}eyond the {H}orizon - {G}et {IT} {T}here {P}roceedings of {MIE}2008 {M}edical {I}nformatics in {E}urope }, publisher={{IOS} {P}ress }, pages={809-14, {PMID} 18487831 }, address={{G}{\"o}teborg {S}u{\`e}de }, volume={136 }, series={{S}tudies in health technology and informatics }, audience={non sp{\'e}cifi{\'e}e }, day={28}, month={05}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00288819/en/}, } %% hal-00352374, version 1 %% http://hal.archives-ouvertes.fr/hal-00352374/en/ @inproceedings{GUERIF:2008:HAL-00352374:1, title={{U}nsupervised feature selection: when random rankings sound as irrelevancy}, author={{G}u{\'e}rif, {S}{\'e}bastien}, abstract={{W}hereas the variable selection has been extensively studied in the context of supervised learning, the unsupervised variable selection has attracted attention of researchers more recently as the available amount of unlabeled data has exploded. {M}any unsupervised variable ranking criteria were proposed and their relevance is usually demonstrated using either external cluster validity indexes or the accuracy of a classifier which are both supervised criteria. {A}ctually, the major issue of the variable subset selection according to a ranking measure has been adressed only by few authors in the unsupervised learning context. {I}n this paper, we propose to combine multiple ranking to go ahead toward a stable consensus variable subset in a totally unsupervised fashion.}, keywords={feature selection; unsupervised learning; feature ranking; randomness}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{N}ew challenges for feature selection in data mining and knowledge discovery {W}orkshop on {N}ew {C}hallenges for feature selection in datamining ({FSDM} 08), {ECML} {PKDD} 2008 }, pages={163-177 }, address={{A}ntwerp {B}elgique }, volume={4 }, editor={{Y}van {S}aeys, {H}uan {L}iu, {I}{\~n}aki {I}nza, {L}ouis {W}ehenkel and {Y}ves {V}an de {P}eer }, series={{JMLR} {W}orkshop and {C}onference {P}roceedings }, note={guerif:2008:jmlr }, audience={internationale }, day={15}, month={09}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00352374/en/}, } %% hal-00323241, version 1 %% http://hal.archives-ouvertes.fr/hal-00323241/en/ @inproceedings{HAMON:2008:HAL-00323241:1, title={{H}ow {C}an the {T}erm {C}ompositionality {B}e {U}seful for {A}cquiring {E}lementary {S}emantic {R}elations?}, author={{H}amon, {T}hierry and {G}rabar, {N}atalia}, abstract={{A}cquiring and enriching lexical resources is crucial for various areas of the computational linguistics applications, especially in specialized domains. {I}n this paper, we propose a high-quality method exploiting the compositionality of complex terms issued from a structured terminology in order to infer three kinds of semantic relations (synonymy, hierarchical and meronymy) between words or terms. {T}he approach has been applied and evaluated on the {G}ene {O}ntology biomedical terminology: 1,273 is-a, 178 part-of and 921 synonymy relations have been inferred and show a precision over 90%. {W}e analyze these results and the possibility of their cross-validation through a graph representation.}, keywords={terminologie ; compositionalit{\'e} ; {G}ene {O}ntology ; hyperonymie ; synonymie}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}ngenierie des connaissances en sant{\'e} - {INSERM} : {U}729 - {IFR}58 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{A}dvances in {N}atural {L}anguage {P}rocessing (6th {I}nternational {C}onference on {NLP}, {G}o{TAL} 2008) 6th {I}nternational {C}onference on {NLP}, {G}o{TAL} 2008 }, publisher={{S}pringer-{V}erlag {B}erlin {H}eidelberg }, pages={809-814 }, address={{G}othenburg {S}u{\`e}de }, editor={{B}engt {N}ordstr{\"o}m and {A}arne {R}anta }, number={5221 }, series={{LNAI} }, audience={internationale }, day={25}, month={08}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00323241/en/}, } %% hal-00195711, version 1 %% http://hal.archives-ouvertes.fr/hal-00195711/en/ @inproceedings{HAMON:2008:HAL-00195711:1, title={{A}cquisition of elementary synonym relations from biological structured terminology}, author={{H}amon, {T}hierry and {G}rabar, {N}atalia}, abstract={{A}cquisition and enrichment of lexical resources have long been acknowledged as an important research in the area of computational linguistics. {N}evertheless, we notice that such resources, particularly in specialised domains, are missing. {H}owever, specialised domains, i.e. biomedicine, propose several structured terminologies. {I}n this paper, we propose a high-quality method for exploiting a structured terminology and inferring a specialised elementary synonym lexicon. {T}he method is based on the analysis of syntactic structure of complex terms. {W}e evaluate the approach on the biomedical domain by using the terminological resource {G}ene {O}ntology. {I}t provides results with over 93% precision. {C}omparison with an existing synonym resource (the general-language resource {W}ord{N}et) shows that there is a very small overlap between the induced lexicon of synonyms and the {W}ord{N}et synsets.}, keywords={{N}atural {L}anguage {P}rocessing ; {S}ynonymy ; {C}ompositionality}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}ngenierie des connaissances en sant{\'e} - {INSERM} : {U}729 - {IFR}58 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{P}roceedings of {CICL}ing2008 9th {I}nternational {C}onference on {I}ntelligent {T}ext {P}rocessing and {C}omputational {L}inguistics }, publisher={{S}pringer-{V}erlag {B}erlin {H}eidelberg }, pages={40-51 }, address={{H}aifa {I}sra{\"e}l }, editor={{A}. {G}elbukh }, number={4919 }, series={{LNCS} }, audience={internationale }, day={17}, month={02}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00195711/en/}, } %% hal-00272395, version 1 %% http://hal.archives-ouvertes.fr/hal-00272395/en/ @inproceedings{JACOBEDENAUROIS:2008:HAL-00272395:1, title={{C}orrectness of {M}ultiplicative {A}dditive {P}roof {S}tructures is {NL}-{C}omplete}, author={{J}acob{\'e} {D}e {N}aurois, {P}aulin and {M}ogbil, {V}irgile}, abstract={{W}e revisit the correctness criterion for the multiplicative additive fragment of linear logic. {W}e prove that deciding the correctness of corresponding proof structures is {NL}-complete.}, keywords={{C}omplexity {C}lasses ; {C}orrectness {C}riterion ; {M}ultiplicative {A}dditive {L}inear {L}ogic ; {N}ondeterministic {L}ogspace}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {T}wenty-{T}hird {A}nnual {IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience ({LICS} 2008) {IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience ({LICS} 2008) }, pages={476 - 485 }, address={{P}ittsburgh, {P}ennsylvania {\'E}tats-{U}nis d'{A}m{\'e}rique }, note={16 pages rapport interne {LIPN} }, audience={internationale }, doi={10.1109/{LICS}.2008.20 }, day={01}, month={06}, year={2008}, URL={dx.doi.org/10.1109/{LICS}.2008.20 http://hal.archives-ouvertes.fr/hal-00272395/en/}, } %% hal-00321437, version 1 %% http://hal.archives-ouvertes.fr/hal-00321437/en/ @inproceedings{MESSIANT:2008:HAL-00321437:1, title={{L}ex{S}chem: {A} {L}arge {S}ubcategorization {L}exicon for {F}rench {V}erbs}, author={{M}essiant, {C}{\'e}dric and {P}oibeau, {T}hierry}, abstract={{T}his paper presents {L}ex{S}chem – the first large, fully automatically acquired subcategorization lexicon for {F}rench verbs. {T}he lexicon includes subcategorization frame and frequency information for 3297 {F}rench verbs. {W}hen evaluated on a set of 20 test verbs against a gold standard dictionary, it shows 0.79 precision, 0.55 recall and 0.65 {F}-measure. {W}e have made this resource freely available to the research community on the web.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {L}anguage {R}esource and {E}valuation {C}onference {L}anguage {R}esource and {E}valuation conference }, pages={sans pagination }, address={{M}aroc }, audience={internationale }, collaboration={{P}rojet {A}lliance {TAACL} }, month={05}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00321437/en/}, } %% hal-00289613, version 1 %% http://hal.archives-ouvertes.fr/hal-00289613/en/ @inproceedings{MONDARY:2008:HAL-00289613:1, title={{C}onstruction d'ontologies {\`a} partir de textes : la phase de conceptualisation}, author={{M}ondary, {T}hibault and {D}espr{\'e}s, {S}ylvie and {N}azarenko, {A}deline and {S}zulman, {S}ylvie}, abstract={{D}ans cet article nous nous interrogeons sur la mani{\`e}re d'outiller la phase de conceptualisation lors de la construction d'une ontologie {\`a} partir de textes. {L}a mise en perspective des r{\'e}sultats obtenus {\`a} partir de techniques issues de la terminologie et de la fouille de textes est r{\'e}alis{\'e}e selon trois plans (discours, linguistique et conceptuel). {C}ette {\'e}tude permet de mieux appr{\'e}hender les moyens envisageables pour outiller efficacement et de fa{\c{c}}on coh{\'e}rente le processus de conceptualisation.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{IC} 2008. 19{\`e}mes {J}ourn{\'e}es {F}rancophones d'{I}ng{\'e}nierie des {C}onnaissances {IC} 2008. 19{\`e}mes {J}ourn{\'e}es {F}rancophones d'{I}ng{\'e}nierie des {C}onnaissances }, pages={87-98 }, address={{N}ancy {F}rance }, audience={non sp{\'e}cifi{\'e}e }, day={18}, month={06}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00289613/en/}, } %% hal-00347004, version 1 %% http://hal.archives-ouvertes.fr/hal-00347004/en/ @inproceedings{POIBEAU:2008:HAL-00347004:1, title={{C}ontroversies and {M}isunderstandings about {M}eaning: {O}n the reception of {O}dgen and {R}ichards’ book, "{T}he {M}eaning of {M}eaning"}, author={{P}oibeau, {T}hierry}, abstract={{T}he {M}eaning of {M}eaning is an influential book published by {C}harles {K}ay {O}gden (1889–1957) and {I}vor {A}rmstrong {R}ichards (1893-1979) (from now on {O}\&{R}) in {J}anuary 1923. {I}t describes a theory of meaning, more specifically trying to determine the nature of meaning and why misunderstandings frequently occur between people. {E}ven if the book is now considered as “dated” , it has been intensively read, especially in the {E}nglish speaking world where it has been widely used as a textbook in semantics; the book is still much cited and raises problems which are wide open, like the notion of meaning itself, the relationships between words and objects, and communication problems. {T}herefore, it seems worth exploring why this book is still influential nowadays, as can be seen in various fields from computational linguistics to communication studies, via the {S}emantic {W}eb.}, keywords={{H}istory of {L}inguistics}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {I}nternational {C}onference on the {H}istory of the {L}anguage {S}ciences ({IC}o{HLS}'2008) {I}nternational {C}onference on the {H}istory of the {L}anguage {S}ciences ({IC}o{HLS}'2008) }, pages={- }, address={{P}otsdam {A}llemagne }, audience={internationale }, month={09}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00347004/en/}, } %% hal-00346999, version 1 %% http://hal.archives-ouvertes.fr/hal-00346999/en/ @inproceedings{POIBEAU:2008:HAL-00346999:1, title={{Q}uelques remarques sur le « champ linguistique » en {F}rance dans l’apr{\`e}s guerre (1950-1970)}, author={{P}oibeau, {T}hierry}, abstract={{L}'{\'e}tude de l'histoire et de l'{\'e}volution des id{\'e}es en linguistique s'est consid{\'e}rablement d{\'e}velopp{\'e}e ces derni{\`e}res ann{\'e}es. {L}a recherche porte le plus souvent sur des p{\'e}riodes pr{\'e}cises du pass{\'e} sur lesquelles on a un certain recul, afin d'en faire ressortir les orientations et les lignes de force. {I}l est beaucoup plus risqu{\'e} d'analyser la p{\'e}riode contemporaine. {P}ourtant, on ne peut qu'{\^e}tre frapp{\'e} par les hauts et les bas d'un domaine, la linguistique, quelque peu d{\'e}laiss{\'e}e apr{\`e}s la guerre, si forte dans les ann{\'e}es 1960, et {\`a} nouveau en plein questionnement aujourd'hui, pour autant que l'on puisse en juger. {C}e sont ces mouvements de flux et de reflux que l'article essaie de cerner et d'{\'e}valuer.}, keywords={{H}istoire de la linguistique}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes du {C}olloque {M}ondial de linguistique fran{\c{c}}aise ({CMLF} 2008) {C}olloque {M}ondial de linguistique fran{\c{c}}aise ({CMLF} 2008) }, pages={- }, address={{P}aris {F}rance }, audience={internationale }, month={07}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00346999/en/}, } %% hal-00321436, version 1 %% http://hal.archives-ouvertes.fr/hal-00321436/en/ @inproceedings{POIBEAU:2008:HAL-00321436:1, title={{D}o we still {N}eed {G}old {S}tandards for {E}valuation?}, author={{P}oibeau, {T}hierry and {M}essiant, {C}{\'e}dric}, abstract={{T}he availability of a huge mass of textual data in electronic format has increased the need for fast and accurate techniques for textual data processing. {M}achine learning and statistical approaches have been increasingly used in {NLP} since the 1990s, mainly because they are quick, versatile and efficient. {H}owever, despite this evolution of the field, evaluation still rely (most of the time) on a comparison between the output of a probabilistic or statistical system on the one hand, and a non-statistic, most of the time hand-crafted, gold standard on the other hand. {I}n order to be able to compare these two sets of data, which are inherently of a different nature, it is first necessary to modify the statistical data so that they fit with the hand-crafted reference. {F}or example, a statistical parser, instead of producing a score of grammaticality, will have to produce a binary value for each sentence (grammatical vs ungrammatical) or a tree similar to the one stored in the treebank used as a reference. {I}n this paper, we take the example of the acquisition of subcategorization frames from corpora as a practical example. {O}ur study is motivated by the fact that, even if a gold standard is an invaluable resource for evaluation, a gold standard is always partial and does not really show how accurate and useful results are. {W}e describe the task ({SCF} acquisition) and show how it is a typical {NLP} task. {W}e then very briefly describe our {SCF} acquisition system before discussing different issues related to the evaluation using a gold standard. {L}astly, we adopt the classical distinction between intrinsic and extrinsic evaluation and show why this framework is relevant for {SCF} acquisition. {W}e show that, even if intrinsic evaluation correlates with extrinsic evaluation, these two evaluation frameworks give a complementary insight on the results. {I}n the conclusion, we quickly discuss the case of other {NLP} tasks.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {L}anguage {R}esource and {E}valuation {C}onference {L}anguage {R}esource and {E}valuation {C}onference }, pages={- }, address={{M}aroc }, audience={internationale }, collaboration={{PHC} {A}lliance {TAACL} }, month={05}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00321436/en/}, } %% hal-00262083, version 1 %% http://hal.archives-ouvertes.fr/hal-00262083/en/ @inproceedings{RECANATI:2008:HAL-00262083:1, title={{H}ybrid {R}easoning and the {F}uture of {I}conic {R}epresentations}, author={{R}ecanati, {C}atherine}, abstract={{W}e give a brief overview of the main characteristics of diagrammatic reasoning, analyze a case of human reasoning in a mastermind game, and explain why hybrid representation systems ({HRS}) are particularly attractive and promising for {A}rtificial {G}eneral {I}ntelligence and {C}omputer {S}cience in general.}, keywords={{A}rtificial {I}ntelligence; {R}easoning; {D}iagrammatic representation; {I}conic representation; {A}nalogical representation; {H}ybrid representation systems; {C}ognitive modeling;}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}rtificial {G}eneral {I}ntelligence 2008 {T}he {F}irst {AGI} {C}onference }, publisher={{IOS} {P}ress }, pages={508 pages, {ISBN} 978-1-58603-833-5, {ISSN} 0922-6389 }, address={{M}emphis, {T}ennessee {\'E}tats-{U}nis d'{A}m{\'e}rique }, volume={171 }, editor={{P}. {W}ang, {B}. {G}oertzel, {S}. {F}ranklin }, series={{F}rontiers in {A}rtificial {I}ntelligence and {A}pplications }, note={pp. 299-310 }, audience={internationale }, ARXIVID={0803.1457 }, month={02}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00262083/en/}, } %% hal-00247410, version 1 %% http://hal.archives-ouvertes.fr/hal-00247410/en/ @inproceedings{SZULMAN:2008:HAL-00247410:1, title={{S}{\'e}mantique et r{\'e}utilisation d'ontologie g{\'e}n{\'e}rique}, author={{S}zulman, {S}ylvie and {D}espr{\'e}s, {S}ylvie}, abstract={{D}ans ce papier, nous enrichissons la m{\'e}thode {T}erminae de construction d'ontologie {\`a} partir de textes en proposant une semi-automatisation de la construction du mod{\`e}le conceptuel. {N}ous pr{\'e}sentons un algorithme permettant la conceptualisation d'un terme en s'appuyant sur les informations linguistiques contenues dans l'ontologie g{\'e}n{\'e}rique de r{\'e}f{\'e}rence}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={8{\`e}mes journ{\'e}es francophones "{E}xtraction et {G}estion des {C}onnaissances" 8{\`e}mes journ{\'e}es francophones "{E}xtraction et {G}estion des {C}onnaissances" }, pages={121-126 }, address={{S}ophia-{A}ntipolis {F}rance }, audience={nationale }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00247410/en/}, } %% hal-00192149, version 1 %% http://hal.archives-ouvertes.fr/hal-00192149/en/ @inproceedings{ASEERVATHAM:2007:HAL-00192149:1, title={{A} {S}emantic {K}ernel for {S}emi-{S}tructured {D}ocuments}, author={{A}seervatham, {S}ujeevan and {V}iennet, {E}mmanuel and {B}ennani, {Y}oun{\`e}s}, abstract={{N}atural {L}anguage {P}rocessing has emerged as an active field of research in the machine learning community. {S}everal methods based on statistical information have been proposed. {H}owever, with the linguistic complexity of the texts, semantic-based approaches have been investigated. {I}n this paper, we propose a {S}emantic {K}ernel for semi-structured biomedical documents. {T}he semantic meanings of words are extracted using the {UMLS} framework. {T}he kernel, with a {SVM} classifier, has been applied to a text categorization task on a medical corpus of free text documents. {T}he results have shown that the {S}emantic {K}ernel outperforms the {L}inear {K}ernel and the {N}aive {B}ayes classifier. {M}oreover, this kernel was ranked in the top ten of the best algorithms among 44 classification methods at the 2007 {CMC} {M}edical {NLP} {I}nternational {C}hallenge.}, keywords={{K}ernel; {S}upport {V}ector {M}achines; {T}ext categorization; {S}emantic {S}imilarities}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {S}eventh {IEEE} {I}nternational {C}onference on {D}ata {M}ining ({ICDM}'07), {O}maha ({N}ebraska), {USA} {IEEE} {I}nternational {C}onference on {D}ata {M}ining }, pages={- }, address={{O}maha {\'E}tats-{U}nis d'{A}m{\'e}rique }, audience={internationale }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00192149/en/}, } %% hal-00160331, version 1 %% http://hal.archives-ouvertes.fr/hal-00160331/en/ @inproceedings{AUDIBERT:2007:HAL-00160331:1, title={{D}{\'e}sambigu{\"i}sation lexicale automatique : s{\'e}lection automatique d'indices}, author={{A}udibert, {L}aurent}, abstract={{N}ous exposons dans cet article une exp{\'e}rience de s{\'e}lection automatique des indices du contexte pour la d{\'e}sambigu{\"i}sation lexicale automatique. {N}otre point de vue est qu'il est plus judicieux de privil{\'e}gier la pertinence des indices du contexte plut{\^o}t que la sophistication des algorithmes de d{\'e}sambigu{\"i}sation utilis{\'e}s. {L}a s{\'e}lection automatique des indices par le biais d'un algorithme g{\'e}n{\'e}tique am{\'e}liore significativement les r{\'e}sultats obtenus dans nos exp{\'e}riences pr{\'e}c{\'e}dentes tout en confortant des observations que nous avions faites sur la nature et la r{\'e}partition des indices les plus pertinents.}, keywords={{D}{\'e}sambigu{\"i}sation lexicale automatique, corpus s{\'e}mantiquement {\'e}tiquet{\'e}, cooccurrences, s{\'e}lection d'indices, algorithmes g{\'e}n{\'e}tiques}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={14{\`e}me conf{\'e}rence sur le {T}raitement {A}utomatique des {L}angues {N}aturelles ({TALN}-2007) {T}raitement {A}utomatique des {L}angues {N}aturelles ({TALN}-2007) }, publisher={{IRIT} {P}ress }, pages={13-22 }, address={{T}oulouse {F}rance }, editor={{N}abil {H}athout et {P}hilippe {M}uller }, audience={internationale }, month={06}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00160331/en/}, } %% hal-00153136, version 1 %% http://hal.archives-ouvertes.fr/hal-00153136/en/ @inproceedings{BAILLOT:2007:HAL-00153136:1, title={{L}ight {L}ogics and {O}ptimal {R}eduction: {C}ompleteness and {C}omplexity.}, author={{B}aillot, {P}atrick and {C}oppola, {P}aolo and {D}al {L}ago, {U}go}, abstract={{T}yping of lambda-terms in {E}lementary and {L}ight {A}ffine {L}ogic ({EAL}, {LAL}, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using {LAL} ({EAL}, resp.) proof-nets admits a guaranteed polynomial (elementary, resp.) bound; on the other hand these terms can also be evaluated by optimal reduction using the abstract version of {L}amping's algorithm. {T}he first reduction is global while the second one is local and asynchronous. {W}e prove that for {LAL} ({EAL}, resp.) typed terms, {L}amping's abstract algorithm also admits a polynomial (elementary, resp.) bound. {W}e also show its soundness and completeness (for {EAL} and {LAL} with type fixpoints), by using a simple geometry of interaction model (context semantics).}, keywords={lambda calculus, linear logic, implicit computational complexity, optimal reduction, proof-nets}, language={{A}nglais}, affiliation={{D}ipartimento di {M}atematica e {I}nformatica, {U}niversit{\`a} di {U}dine - {U}niversit{\`a} di {U}dine - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {P}reuves, {P}rogrammes et {S}yst{\`e}mes - {PPS} - {CNRS} : {UMR}7126 - {U}niversit{\'e} {D}enis {D}iderot - {P}aris {VII} - {U}niversit{\`a} di {B}ologna - {UNIBO} - {U}niversit{\`a} degli studi di {B}ologna }, booktitle={{P}roceedings of {S}ymposium on {L}ogic in {C}omputer {S}cience ({LICS} '07) {S}ymposium on {L}ogic in {C}omputer {S}cience ({LICS} '07) }, publisher={{IEEE} {C}omputer {S}ociety {P}ress }, pages={{\`a} para{\^i}tre }, address={{W}roclaw {P}ologne }, editor={{L}uke {O}ng }, note={10 pages {P}rojets {NO}-{C}o{ST} ({ANR}, {JC}05_43380), {CRISS} ({ACI} {SI}) }, audience={non sp{\'e}cifi{\'e}e }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153136/en/}, } %% halshs-00159874, version 1 %% http://halshs.archives-ouvertes.fr/halshs-00159874/en/ @inproceedings{BATTISTELLI:2007:HALSHS-00159874:1, title={{C}alendar {E}xpressions {O}rdering in text {C}orpora}, author={{B}attistelli, {D}elphine and {S}chwer, {S}ylviane and {M}inel, {J}ean-{L}uc}, abstract={{W}e propose an annotation scheme of calendar expressions that encodes the semantics of the expression, taking into account modifiers present inside the expresssion. {T}he annotation scheme is the one provided by {N}avitexte, a software devoted to text visualization and navigation.}, keywords={{C}alendar {E}xpressions; {A}nnotations; {T}ext {V}isualization}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}niversit{\'e} {P}aris-{S}orbonne - {U}niversit{\'e} {P}aris-{S}orbonne - {P}aris {IV} - {M}od{\`e}les, {D}ynamiques, {C}orpus - {M}o{D}y{C}o - {CNRS} : {UMR}7114 - {U}niversit{\'e} de {P}aris {X} - {N}anterre }, booktitle={{NLDB}'07, {P}oster {S}ession's proceedings 12th {I}nternational {C}onference on {A}pplications of {N}atural {L}anguage to {I}nformation {S}ystems }, publisher={{CNAM} }, pages={3-4 }, address={{P}aris {F}rance }, audience={nationale }, month={06}, year={2007}, URL={http://halshs.archives-ouvertes.fr/halshs-00159874/en/}, } %% hal-00153311, version 1 %% http://hal.archives-ouvertes.fr/hal-00153311/en/ @inproceedings{BOSSARD:2007:HAL-00153311:1, title={{A}daptation d'une ressource pr{\'e}dicative pour l'extraction d'information}, author={{B}ossard, {A}ur{\'e}lien and {P}oibeau, {T}hierry}, abstract={{C}et article pr{\'e}sente une m{\'e}thode pour construire, {\`a} partir d'une ressource lexicale pr{\'e}dicative existante, une ressource enrichie pouvant servir {\`a} une t{\^a}che d'extraction. {N}ous montrons les points forts et les lacunes de deux ressources existantes pour le {F}ran{\c{c}}ais : les {T}ables du {LADL} et {V}olem. {A}pr{\`e}s avoir montr{\'e} pourquoi nous avons s{\'e}lectionn{\'e} {V}olem, nous listons les donn{\'e}es n{\'e}cessaires {\`a} la t{\^a}che d'extraction. {N}ous pr{\'e}sentons le processus d'enrichissement de la ressource initiale et une {\'e}valuation, {\`a} travers une t{\^a}che d'extraction d'information concernant des textes de rachats d'entreprise.}, keywords={sch{\'e}mas pr{\'e}dicatifs; extraction d'information}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes du {C}olloque {L}exique et {G}rammaire 2007 {C}olloque {L}exique et {G}rammaire 2007 }, publisher={{LADL} }, pages={- }, address={{B}onifacio {F}rance }, audience={internationale }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153311/en/}, } %% hal-00159077, version 1 %% http://hal.archives-ouvertes.fr/hal-00159077/en/ @inproceedings{BOSSARD:2007:HAL-00159077:1, title={{V}ers une ressource pr{\'e}dicative pour l'extraction d'information}, author={{B}ossard, {A}ur{\'e}lien}, abstract={{C}et article pr{\'e}sente une m{\'e}thode pour construire, {\`a} partir d'une ressource lexicale pr{\'e}dicative existante, une ressource enrichie pouvant servir {\`a} une t{\^a}che d'extraction. {N}ous montrons les points forts et les lacunes de deux ressources existantes pour le {F}ran{\c{c}}ais: les {T}ables du {LADL} et {V}olem. {A}pr{\`e}s avoir montr{\'e} pourquoi nous avons s{\'e}lectionn{\'e} {V}olem, nous listons les donn{\'e}es n{\'e}cessaires {\`a} la t{\^a}che d'extraction d'information. {N}ous pr{\'e}sentons le processus d'enrichissement de la ressource initiale et une {\'e}valuation, {\`a} travers une t{\^a}che d'extraction d'information concernant des textes de rachats d'entreprise.}, keywords={ressource pr{\'e}dicative;extraction d'information;patrons lexico-syntaxiques}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes {TALN}/{R}ecital 2007 - communications {\'e}crites {R}ecital 2007 }, publisher={n }, pages={154 }, address={{T}oulouse {F}rance }, note={10 }, audience={non sp{\'e}cifi{\'e}e }, day={05}, month={06}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00159077/en/}, } %% hal-00174891, version 1 %% http://hal.archives-ouvertes.fr/hal-00174891/en/ @inproceedings{BOUFFIER:2007:HAL-00174891:1, title={{R}estructuring documents: {A} discourse based approach}, author={{B}ouffier, {A}manda and {P}oibeau, {T}hierry}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{R}ecent {A}dvances {I}n {N}atural {L}anguage {P}rocessing {P}roceedings {R}ecent {A}dvances {I}n {N}atural {L}anguage {P}rocessing }, pages={{NC} }, address={{B}ulgarie }, audience={internationale }, month={10}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174891/en/}, } %% hal-00174858, version 1 %% http://hal.archives-ouvertes.fr/hal-00174858/en/ @inproceedings{BOUFFIER:2007:HAL-00174858:1, title={{F}rom {T}exts to {S}tructured {D}ocuments: {T}he {C}ase of {H}ealth {P}ractice {G}uidelines}, author={{B}ouffier, {A}manda}, abstract={{T}his paper describes a system capable of semi-automatically filling an {XML} template from free texts in the clinical domain (practice guidelines). {T}he {XML} template includes semantic information not explicitly encoded in the text (pairs of conditions and actions/recommendations). {T}herefore, there is a need to compute the exact scope of conditions over text sequences expressing the required actions. {W}e present in this paper the rules developed for this task. {W}e show that the system yields good performance when applied to the analysis of {F}rench practice guidelines.}, keywords={{H}ealth practice guidelines, {N}atural {L}anguage processing , {GEM} ({G}uideline {E}lements {M}odel)}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{I}nternational {S}emantic {W}eb {C}onference {P}roceedings {I}nternational {S}emantic {W}eb {C}onference-{D}octoral {C}onsortium }, pages={{NC} }, address={{B}usan {C}or{\'e}e, {R}{\'e}publique de }, editor={{S}pringer }, audience={non sp{\'e}cifi{\'e}e }, ARXIVID={0709.4015 }, month={11}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174858/en/}, } %% hal-00153292, version 1 %% http://hal.archives-ouvertes.fr/hal-00153292/en/ @inproceedings{BOUFFIER:2007:HAL-00153292:1, title={{A}utomatically {R}estructuring {P}ractice {G}uidelines using the {GEM} {DTD}}, author={{B}ouffier, {A}manda and {P}oibeau, {T}hierry}, abstract={{T}his paper describes a system capable of semi-automatically filling an {XML} template from free texts in the clinical domain (practice guidelines). {T}he {XML} template includes semantic information not explicitly encoded in the text (pairs of conditions and actions/recommendations). {T}herefore, there is a need to compute the exact scope of conditions over text sequences expressing the required actions. {W}e present a system developed for this task. {W}e show that it yields good performance when applied to the analysis of {F}rench practice guidelines.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {B}iomedical {N}atural {L}anguage {P}rocessing ({B}io{NLP}) {B}iomedical {N}atural {L}anguage {P}rocessing ({B}io{NLP}) }, publisher={{ACL} }, pages={- }, address={{P}rague {T}ch{\`e}que, {R}{\'e}publique }, editor={{K}evin {B}retonnel {C}ohen, {D}ina {D}emner-{F}ushman, {C}arol {F}riedman, {L}ynette {H}irschman, {J}ohn {P}estian }, audience={internationale }, ARXIVID={0706.1137 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153292/en/}, } %% hal-00154119, version 1 %% http://hal.archives-ouvertes.fr/hal-00154119/en/ @inproceedings{BOURGNE:2007:HAL-00154119:1, title={{SMILE} : {S}ound {M}ulti-agent {I}ncremental {LE}arning ;-)}, author={{B}ourgne, {G}auvain and {S}oldano, {H}enry and {E}l {F}allah {S}eghrouchni, {A}mal}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={{I}nternational {C}onference on {A}utonomous {A}gents and {M}ultiagent {S}ystems {AAMAS} }, publisher={{ACM} }, pages={164--171 }, address={{HONOLULU} {\'E}tats-{U}nis d'{A}m{\'e}rique }, audience={internationale }, day={14}, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00154119/en/}, } %% hal-00082870, version 1 %% http://hal.archives-ouvertes.fr/hal-00082870/en/ @inproceedings{BUTELLE:2007:HAL-00082870:1, title={{R}eal-{T}ime {D}istributed {S}cheduling of {P}recedence {G}raphs on {A}rbitrary {W}ide {N}etworks}, author={{B}utelle, {F}ranck and {F}inta, {L}ucian and {H}akem, {M}ourad}, abstract={{P}revious work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. {T}his paper presents a new distributed dynamic scheduling scheme for sporadic real-time jobs with arbitrary precedence relations on arbitrary wide networks. {A} job is modeled by a {D}irected {A}cyclic {G}raph ({DAG}). {J}obs arrive on any site at any time and compete for the computational resources of the network. {T}he scheduling algorithm developed in this paper is based upon a new concept of {C}omputing {S}pheres in order to determine a good neighborhood of sites that may cooperate for the execution of a job if it cannot be guaranteed locally. {T}he salient feature of this new concept is that it allows the algorithm to be performed on arbitrary wide networks since it uses a limited number of sites and communication links.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the 21st {IEEE} {I}nternational {P}arallel and {D}istributed {P}rocessing {S}ymposium {I}nternational {P}arallel and {D}istributed {P}rocessing {S}ymposium }, publisher={{IEEE} {C}omputer {S}ociety }, pages={220 }, address={{L}ong {B}each {\'E}tats-{U}nis d'{A}m{\'e}rique }, audience={internationale }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00082870/en/}, } %% hal-00159142, version 1 %% http://hal.archives-ouvertes.fr/hal-00159142/en/ @inproceedings{CAILLIAU:2007:HAL-00159142:1, title={{A}ides {\`a} la navigation dans un corpus de transcriptions d'oral}, author={{C}ailliau, {F}rederik and {D}e {L}oupy, {C}laude}, abstract={{D}ans cet article, nous {\'e}valuons les performances de fonctionnalit{\'e}s d'aide {\`a} la navigation dans un contexte de recherche dans un corpus audio. {N}ous montrons que les particularit{\'e}s de la transcription et, en particulier les erreurs, conduisent {\`a} une d{\'e}gradation parfois importante des performances des outils d'analyse. {S}i la navigation par concepts reste dans des niveaux d'erreur acceptables, la reconnaissance des entit{\'e}s nomm{\'e}es, utilis{\'e}e pour l'aide {\`a} la lecture, voit ses performances fortement baisser. {N}otre remise en doute de la portabilit{\'e} de ces fonctions {\`a} un corpus oral est n{\'e}anmoins att{\'e}nu{\'e}e par la nature m{\^e}me du corpus qui incite {\`a} consid{\'e}rer que toute m{\'e}thode permettant de r{\'e}duire le temps d'acc{\`e}s {\`a} l'information est pertinente, m{\^e}me si les outils utilis{\'e}s sont imparfaits.}, keywords={{\'e}valuation; moteur de recherche; corpus oral; recherche d'information}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {S}inequa {L}abs - {S}inequa - {S}yllabs - {S}yllabs }, booktitle={{A}ctes de la 14e conf{\'e}rence sur le {T}raitement {A}utomatique des {L}angues {N}aturelles. {TALN} 07 }, publisher={{IRIT} {P}ress }, pages={143-152 }, address={{T}oulouse {F}rance }, audience={non sp{\'e}cifi{\'e}e }, day={05}, month={06}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00159142/en/}, } %% hal-00174421, version 1 %% http://hal.archives-ouvertes.fr/hal-00174421/en/ @inproceedings{CEAUSU:2007:HAL-00174421:1, title={{L}earning {T}erm to {C}oncept {M}apping {T}hrough {V}erbs: {A} {C}ase {S}tudy.}, author={{C}eausu, {V}alentina and {D}espr{\'e}s, {S}ylvie}, language={{A}nglais}, affiliation={{CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {S}emantic {A}uthoring, {A}nnotation and {K}nowledge {M}arkup {W}orkshop of {C}onference on {K}nowledge {C}apture ({KC}ap07) {S}emantic {A}uthoring, {A}nnotation and {K}nowledge {M}arkup {W}orkshop of {C}onference on {K}nowledge {C}apture ({KC}ap07) }, pages={{\`a} para{\^i}tre }, address={{C}anada }, audience={internationale }, month={10}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174421/en/}, } %% hal-00154104, version 1 %% http://hal.archives-ouvertes.fr/hal-00154104/en/ @inproceedings{CZACHORSKI:2007:HAL-00154104:1, title={{S}tability and {D}ynamics of {TCP}-{NCD} ({DCR}) {P}rotocol in {P}resence of {UDP} {F}lows}, author={{C}zachorski, {T}adeusz and {G}rochla, {K}rzysztof and {P}ekergin, {F}erhan}, abstract={{T}he fluid-flow approximation models investigate with much success the dynamics and stability of {TCP}/{RED} connections. {T}heir main assumption is that the fluctuations of variables characterizing the behaviour of the connections are relatively small, that enables the linearization of model and the use of traditional control analysis tools to obtain such measures as {B}ode gain, phase margins, tracking error or delay margin. {I}n this article, preserving linear fluid-flow model, we propose its extension to the case when a network is composed of wired and wireless part. {W}e consider a variant of {TCP} algorithm ({TCP}-{DCR} or its new version {TCP}-{NCR}) and fluid-flow differential equations representing the size of congestion window, mean queue at the bottleneck router and loss probability at a {RED} queue are supplemented with terms representing constant loss probability due to transmission in wireless part and probability that a fraction of these errors is recovered by a link level mechanism. {T}he decrease of congestion window due to {TCP} mechanism is delayed to allow the link protocol to deal with the errors. {T}he model considers the presence of uncontrollable {UDP} flows.}, keywords={active queue management - {RED} ; dynamics of {TCP} flows ; unresponsible flows}, language={{A}nglais}, affiliation={{I}nstytut {I}nformatyki {T}eoretycznej i {S}tosowanej {P}olskiej {A}kademii {N}auk - {IITIS} {PAN} - {P}olska {A}kademia {N}auk - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{W}ireless {S}ystems and {M}obility in {N}ext {G}eneration {I}nternet {W}ireless {S}ystems and {M}obility in {N}ext {G}eneration {I}nternet, {T}hird {I}nternational {W}orkshop of the {EURO}-{NGI} {N}etwork of {E}xcellence }, publisher={{S}pringer }, pages={241-254 }, address={{S}itges {E}spagne }, editor={{J}orge {G}arc{\'i}a-{V}idal, {L}loren{\c{c}} {C}erd{\`a} }, series={{S}pringer {V}erlag - {L}ecture {N}otes in {C}omputer {S}cience 4396 }, note={{C}.2 {C}.4 }, audience={internationale }, collaboration={{C}oop{\'e}ration {CNRS} ({LIPN}) - {PAN} ({IIT}i{S}) - {POL} 19512 }, doi={10.1007/978-3-540-70969-5_18 }, year={2007}, URL={dx.doi.org/10.1007/978-3-540-70969-5_18 http://hal.archives-ouvertes.fr/hal-00154104/en/}, } %% hal-00174418, version 1 %% http://hal.archives-ouvertes.fr/hal-00174418/en/ @inproceedings{DESPRES:2007:HAL-00174418:1, title={{S}emantic case-based reasoning framework for text categorization}, author={{D}espr{\'e}s, {S}ylvie and {C}eausu, {V}alentina}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{P}roceedings of the 6th {I}nternational {S}emantic {W}eb {C}onference and the 2nd {A}sian {S}emantic {W}eb {C}onference 2007 ({ISWC} 2007 + {ASWC} 2007) {T}he 6th {I}nternational {S}emantic {W}eb {C}onference and the 2nd {A}sian {S}emantic {W}eb {C}onference 2007 ({ISWC} 2007 + {ASWC} 2007) }, pages={{\`a} para{\^i}tre }, address={{C}or{\'e}e, {R}{\'e}publique de }, audience={internationale }, month={11}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174418/en/}, } %% hal-00174413, version 1 %% http://hal.archives-ouvertes.fr/hal-00174413/en/ @inproceedings{DESPRES:2007:HAL-00174413:1, title={{U}nification d’ontologies h{\'e}t{\'e}rog{\`e}nes pour l’indexation s{\'e}mantique de compte rendu standardis{\'e} d’examens du patient}, author={{D}espr{\'e}s, {S}ylvie and {M}hiri, {S}onia and {Z}agrouba, {E}zzaddine}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{A}ctes de l’atelier {O}ntologies et gestion de l'h{\'e}t{\'e}rog{\'e}n{\'e}it{\'e} s{\'e}mantique ({OGHS}) {A}telier {O}ntologies et gestion de lh{\'e}t{\'e}rog{\'e}n{\'e}it{\'e} s{\'e}mantique ({OGHS}). {P}lateforme {AFIA} 2007 }, pages={60-62 }, address={{G}renoble {F}rance }, audience={nationale }, month={07}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174413/en/}, } %% hal-00174404, version 1 %% http://hal.archives-ouvertes.fr/hal-00174404/en/ @inproceedings{DESPRES:2007:HAL-00174404:1, title={{O}ntology {V}isualization {T}ool for {I}ndexing {DICOM} {S}tructured {R}eporting ({SR}) {D}ocuments.}, author={{D}espr{\'e}s, {S}ylvie and {M}hiri, {S}onia}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{P}roceedings of the 10th {I}nternational {P}rot{\'e}g{\'e} {C}onference 10th {I}nternational {P}rot{\'e}g{\'e} {C}onference }, pages={150-153 }, address={{H}ongrie }, audience={internationale }, month={07}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174404/en/}, } %% hal-00174397, version 1 %% http://hal.archives-ouvertes.fr/hal-00174397/en/ @inproceedings{DESPRES:2007:HAL-00174397:1, title={{U}sability via a {V}isualization {T}ool for the {S}emantic {I}ndexing of {M}edical {R}eports ({DICOM} {SR})}, author={{D}espr{\'e}s, {S}ylvie and {M}hiri, {S}onia}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{P}roceedings of {USAB} 07 ({U}sability \& {HCI} for {M}edicine and {H}ealth {C}are3) {USAB} 07 ({U}sability \& {HCI} for {M}edicine and {H}ealth {C}are3) }, pages={{\`a} para{\^i}tre }, address={{A}utriche }, audience={internationale }, month={11}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174397/en/}, } %% hal-00160584, version 1 %% http://hal.archives-ouvertes.fr/hal-00160584/en/ @inproceedings{DESPRES:2007:HAL-00160584:1, title={{C}onstruction d'une ontologie du domaine {HSE}}, author={{D}espres, {S}ylvie and {F}{\"u}rst, {F}r{\'e}d{\'e}ric and {S}zulman, {S}ylvie}, abstract={{D}ans cet article, nous pr{\'e}sentons un travail de construction d'une ontologie du domaine de la r{\'e}glementation {H}ygi{\`e}ne-{S}{\'e}curit{\'e}-{E}nvironnement ({HSE}) concernant les installations industrielles. {C}e travail a {\'e}t{\'e} men{\'e} selon deux approches : l'utilisation des nomenclatures et d'interviews d'experts du domaine pour aider {\`a} la compr{\'e}hension des notions du domaine et {\`a} leur conceptualisation et l'utilisation d'outils d'analyse de textes {\`a} travers la m{\'e}thode {T}erminae, permettant de rep{\'e}rer les concepts dans les textes. {L}a compl{\'e}mentarit{\'e} des deux approches permet de construire une conceptualisation s{\'e}mantiquement correcte et couvrant le corpus utilis{\'e}.}, keywords={{C}onstruction d'ontologie {\`a} partir de textes {U}tilisation de nomenclature}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique d'{A}miens - {L}a{RIA} - {CNRS} : {FRE}2733 - {U}niversit{\'e} de {P}icardie {J}ules {V}erne }, booktitle={{I}ng{\'e}nierie des {C}onnaissances - 18{\`e}mes journ{\'e}es francophones }, publisher={{C}{\'e}padu{\`e}s }, pages={133-144 }, address={{G}renoble {F}rance }, audience={nationale }, collaboration={{C}ollaboration {LARIA} - {LIPN} - {S}oci{\'e}t{\'e} {TENNAXIA} }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00160584/en/}, } %% hal-00352375, version 1 %% http://hal.archives-ouvertes.fr/hal-00352375/en/ @inproceedings{GUERIF:2007:HAL-00352375:1, title={{D}imensionality {R}eduction {T}hrough {U}nsupervised {F}eatures {S}election}, author={{G}u{\'e}rif, {S}{\'e}bastien and {B}ennani, {Y}oun{\`e}s}, abstract={{A}s the storage technologies evolve, the amount of available data explodes in both dimensions: samples number and input space dimension. {T}herefore, one needs dimension reduction techniques to explore and to analyse his huge data sets. {M}any features selection approaches have been proposed for the supervised learning context, but only few techniques are available to address this issue in the unsupervised learning context. {A}ctually, the problem of unsupervised feature selection becomes more difficult as the samples points' labels disappear. {T}hus, most of the methods proposed rely on feature correlations and only pairs of variables are considered. {I}n this paper, we extend the wkmeans algorithm proposed by {H}uang to the self-organizing maps ({SOM}) framework and we propose a feature selection approach which relies on the weighting coefficients learned during the optimization process. {T}his {SOM}-based approach addresses the difficult issue of unsupervised feature selection and is ready to handle high dimensional data sets.}, keywords={feature selection; unsupervised learning; weighting; self organizing map; clustering}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}art of the proceedings of the 10th {I}nternational {C}onference on {E}ngineering {A}pplications of {N}eural {N}etworks {I}nternational {C}onference on {E}ngineering {A}pplications of {N}eural {N}etworks ({EANN} 2007) }, pages={? }, address={{T}hessaloniki, {H}ellas {G}r{\`e}ce }, volume={284 }, editor={{L}azaros {I}liadis and {K}onstantinos {M}argaritis }, audience={internationale }, day={29}, month={08}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00352375/en/}, } %% hal-00153098, version 1 %% http://hal.archives-ouvertes.fr/hal-00153098/en/ @inproceedings{HAKEM:2007:HAL-00153098:1, title={{R}eliability and {S}cheduling on {S}ystems {S}ubject to {F}ailures}, author={{H}akem, {M}ourad and {B}utelle, {F}ranck}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roc. of the 36th {IEEE} {I}ntenational {C}onference on parallel {P}rocessing ({ICPP}'07) }, publisher={{IEEE} {C}omputer {S}ociety {P}ress }, pages={a paraitre }, address={{C}hine }, audience={internationale }, month={07}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153098/en/}, } %% hal-00158637, version 1 %% http://hal.archives-ouvertes.fr/hal-00158637/en/ @inproceedings{HAMON:2007:HAL-00158637:1, title={{O}gmios: a scalable {NLP} platform for annotating large web document collections}, author={{H}amon, {T}hierry and {D}erivi{\`e}re, {J}ulien and {N}azarenko, {A}deline}, abstract={{W}hile {NLP} tools are now widely available, their use can be problematic considering the lack of homogeneity of their input/output format, the variation of the granularity of their information, but also the difficulties to process large amounts of heterogeneous documents in a reasonable time, and their tunability to a specific domain. {T}o address these problems, we propose a configurable platform to enrich very large collections of {F}rench and {E}nglish specialised documents. {T}he platform is a modularized framework. {E}ach module carries out an annotation step by using existing {NLP} tools and can be tuned to a domain by adding specific resources: named entity recognition, sentence and word segmentation, lemmatisation, {POS} tagging, term tagging and parsing. {L}inguistic annotations are recorded in a stand-off {XML} format. {W}e focus on the robustness of the annotation process to help the creation of annotated corpora from the web. {W}e have tested the scalability of the platform on two collections of 55,329 biomedical web documents (107 millions of words) and 47,393 {S}earch {E}ngine {N}ews (13 millions of words). {T}he collections have been annotated until the term tagging, respectively in 35 hours and 3 hours.}, keywords={{N}atural {L}anguage {P}rocessing ; {I}nformation {R}etrieval ; robust text analysis}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {C}orpus {L}inguistics {C}orpus {L}inguistics 2007 }, publisher={{E}lectronic publication }, pages={to appear }, address={{B}irmingham {R}oyaume-{U}ni }, note={{ALVIS} {STREP} {P}roject }, audience={non sp{\'e}cifi{\'e}e }, collaboration={{ALVIS} }, day={28}, month={07}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00158637/en/}, } %% hal-00158627, version 1 %% http://hal.archives-ouvertes.fr/hal-00158627/en/ @inproceedings{HAMON:2007:HAL-00158627:1, title={{O}gmios : une plate-forme d'annotation linguistique}, author={{H}amon, {T}hierry and {D}erivi{\`e}re, {J}ulien and {N}azarenko, {A}deline}, abstract={{L}'un des objectifs du projet {ALVIS} est d'int{\'e}grer des informations linguistiques dans des moteurs de recherche sp{\'e}cialis{\'e}s. {D}ans ce contexte, nous avons con{\c{c}}u une plate-forme d'enrichissement linguistique de documents issus du {W}eb, {O}gmios, exploitant des outils de {TAL} existants. {L}es documents peuvent {\^e}tre en fran{\c{c}}ais ou en anglais. {C}ette architecture est distribu{\'e}e, afin de r{\'e}pondre aux contraintes li{\'e}es aux traitements de gros volumes de textes, et adaptable, afin de sp{\'e}cialiser l'analyse linguistique de ces textes. {L}a plate-forme est d{\'e}velopp{\'e}e en {P}erl et disponible sous forme de modules {CPAN}. {E}lle peut {\^e}tre vue comme un cadre de travail modulaire dans lequel il est possible d'int{\'e}grer des ressources adapt{\'e}es au domaine trait{\'e} mais aussi de nouveaux outils de {TAL}. {N}ous avons {\'e}valu{\'e} les performances de la plateforme sur plusieurs collections de documents. {E}n distribuant les traitements sur vingt machines, une collection de 55~329 documents du domaine de la biologie (106 millions de mots) a {\'e}t{\'e} annot{\'e}e en 35 heures tandis qu'une collection de 48 422 d{\'e}p{\^e}ches relatives aux moteurs de recherche (14 millions de mots) a {\'e}t{\'e} annot{\'e}e en 3 heures et 15 minutes.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de {TALN} 2007 {T}raitement {A}utomatique des {L}angues {N}aturelles }, publisher={{IRIT} {P}ress }, pages={103-112 }, address={{T}oulouse {F}rance }, note={{ALVIS} {STREP} {P}roject }, audience={nationale }, collaboration={{ALVIS} }, day={05}, month={06}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00158627/en/}, } %% hal-00158614, version 1 %% http://hal.archives-ouvertes.fr/hal-00158614/en/ @inproceedings{HAMON:2007:HAL-00158614:1, title={{A} {R}obust {L}inguistic {P}latform for {E}fficient and {D}omain specific {W}eb {C}ontent {A}nalysis}, author={{H}amon, {T}hierry and {N}azarenko, {A}deline and {P}oibeau, {T}hierry and {A}ubin, {S}ophie and {D}erivi{\`e}re, {J}ulien}, abstract={{W}eb semantic access in specific domains calls for specialized search engines with enhanced semantic querying and indexing capacities, which pertain both to information retrieval ({IR}) and to information extraction ({IE}). {A} rich linguistic analysis is required either to identify the relevant semantic units to index and weight them according to linguistic specific statistical distribution, or as the basis of an information extraction process. {R}ecent developments make {N}atural {L}anguage {P}rocessing ({NLP}) techniques reliable enough to process large collections of documents and to enrich them with semantic annotations. {T}his paper focuses on the design and the development of a text processing platform, {O}gmios, which has been developed in the {ALVIS} project. {T}he {O}gmios platform exploits existing {NLP} modules and resources, which may be tuned to specific domains and produces linguistically annotated documents. {W}e show how the three constraints of genericity, domain semantic awareness and performance can be handled all together.}, keywords={{N}atural {L}anguage {P}rocessing ; {I}nformation {R}etrieval ; robust text analysis}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {RIAO} 2007 {RIAO} 2007 - {L}arge-{S}cale {S}emantic {A}ccess to {C}ontent ({T}ext, {I}mage, {V}ideo and {S}ound) }, publisher={{E}dition sur {CDROM} }, pages={?? }, address={{P}ittsbirgh {\'E}tats-{U}nis d'{A}m{\'e}rique }, note={{ALVIS} {STREP} {P}roject }, audience={internationale }, collaboration={{ALVIS} }, ARXIVID={0706.4375 }, day={30}, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00158614/en/}, } %% hal-00143926, version 1 %% http://hal.archives-ouvertes.fr/hal-00143926/en/ @inproceedings{JACOBEDENAUROIS:2007:HAL-00143926:1, title={{C}orrectness of {M}ultiplicative (and {E}xponential) {P}roof {S}tructures is {NL}-{C}omplete}, author={{J}acob{\'e} {D}e {N}aurois, {P}aulin and {M}ogbil, {V}irgile}, abstract={{W}e provide a new correctness criterion for unit-free {MLL} proof structures and {MELL} proof structures with units. {W}e prove that deciding the correctness of a {MLL} and of a {MELL} proof structure is {NL}-complete. {W}e also prove that deciding the correctness of an intuitionistic multiplicative essential net is {NL}-complete.}, keywords={{C}omplexity {C}lasses; {C}orrectness {C}riterion; {M}ultiplicative ({E}xponential) {L}inear {L}ogic; {N}ondeterministic {L}ogspace}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{L}ecture {N}otes in {C}omputer {S}cience {LNCS} 4646, {C}omputer {S}cience {L}ogic {CSL} 2007 {CSL}'07, 16th {EACSL} {A}nnual {C}onference on {C}omputer {S}cience and {L}ogic }, publisher={{S}pringer {B}erlin / {H}eidelberg }, pages={pages 435-450 }, address={{L}ausanne {S}uisse }, volume={4646 }, editor={{D}uparc, {J}acques and {H}enziger, {T}homas {A}. }, note={15 pages rapport interne {LIPN} {ANR} {NO}-{C}o{ST} }, audience={internationale }, doi={10.1007/978-3-540-74915-8_33 }, day={24}, month={08}, year={2007}, URL={dx.doi.org/10.1007/978-3-540-74915-8_33 http://hal.archives-ouvertes.fr/hal-00143926/en/}, } %% inria-00151234, version 1 %% http://hal.inria.fr/inria-00151234/en/ @inproceedings{KHEMMOUDJ:2007:INRIA-00151234:1, title={{B}ornes inf{\'e}rieures {\`a} base d'in{\'e}galit{\'e}s valides pour les {WCSP}}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {B}ennaceur, {H}achemi}, abstract={{L}a plus part des algorithmes de r{\'e}solution efficace de {WCSP} se basent sur la notion de consistance d'arc utilis{\'e}e pour transformer un {WCSP} en un {WCSP} {\'e}quivalent et plus facile {\`a} r{\'e}soudre. {D}ans ce but, plusieurs formes de consistance d'arc ont {\'e}t{\'e} propos{\'e}es : {AC}* \cite{{S}chiex.00}, {DAC}* \cite{{L}arrosa.03}, {FDAC}* \cite{{L}arrosa.03},{EDAC}* \cite{de{G}ivry.05}. {R}{\'e}cemment, une consistance d'arc optimale ({OSAC} pour {O}ptimal {S}oft {A}rc {C}onsistency) \cite{{C}ooper.07} a {\'e}t{\'e} propos{\'e}e. {E}lle se base sur la r{\'e}solution d'un {P}rogramme {L}in{\'e}aire. {S}on inconv{\'e}nient r{\'e}side dans le fait qu'elle n{\'e}cessite beaucoup de temps de calcul. {C}et inconv{\'e}nient est d{\^u} {\`a} la taille du programme lin{\'e}aire r{\'e}solu. {N}ous proposons une nouvelle technique de transformation d'un {WCSP} en un {WCSP} {\'e}quivalent. {C}ette technique se base sur la mod{\'e}lisation du {WCSP} sous forme d'un programme lin{\'e}aire plus facile {\`a} r{\'e}soudre que le calcul de {OSAC}.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{T}roisi{\`e}mes {J}ourn{\'e}es {F}rancophones de {P}rogrammationpar {C}ontraintes ({JFPC}07) }, address={{R}ocquencourt / {F}rance }, audience={non sp{\'e}cifi{\'e}e }, day={05}, month={06}, year={2007}, URL={http://hal.inria.fr/inria-00151234/en/}, } %% hal-00174394, version 1 %% http://hal.archives-ouvertes.fr/hal-00174394/en/ @inproceedings{LAMONTAGNE:2007:HAL-00174394:1, title={{F}inding {L}exical {R}elations for the {R}euse of {I}nvestigation {R}eports, {B}eyond {R}etrieval}, author={{L}amontagne, {L}uc and {B}entibebel, {R}im and {M}iry, {E}rwan and {D}espr{\'e}s, {S}ylvie}, language={{A}nglais}, affiliation={{C}entre de {R}echerche en {I}nformatique de {P}aris 5 - {CRIP}5 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {F}ourth {W}orkshop on {T}extual {CBR}, {ICCBR}’07 {F}ourth {W}orkshop on {T}extual {CBR}, {ICCBR}’07 }, pages={252-256 }, address={{I}rlande }, audience={internationale }, month={08}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174394/en/}, } %% hal-00122980, version 2 %% http://hal.archives-ouvertes.fr/hal-00122980/en/ @inproceedings{MOGBIL:2007:HAL-00122980:2, title={{U}niform circuits, \& {B}oolean proof nets}, author={{M}ogbil, {V}irgile and {R}ahli, {V}incent}, abstract={{T}he relationship between {B}oolean proof nets of multiplicative linear logic ({APN}) and {B}oolean circuits has been studied [{T}er04] in a non-uniform setting. {W}e refine this results by taking care of uniformity: the relationship can be expressed in term of the ({T}uring) polynomial hierarchy. {W}e give a proofs-as-programs correspondence between proof nets and deterministic as well as non-deterministic {B}oolean circuits with a uniform depth-preserving simulation of each other. {T}he {B}oolean proof nets class m\&{BN}(poly) is built on multiplicative and additive linear logic with a polynomial amount of additive connectives as the non-deterministic circuit class {NNC}(poly) is with non-deterministic variables. {W}e obtain uniform-{APN} = {NC} and m\&{BN}(poly) = {NNC}(poly) = {NP}}, keywords={linear logic ; implicit complexity ; {B}oolean proof net ; parallel cut-elimination ; {B}oolean circuits ; uniformity ; non-determinism}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {ULTRA} ({U}seful {L}ogics, {T}ypes, {R}ewriting and their {A}utomation) group - {H}eriot-{W}att {U}niversity }, booktitle={{L}ecture {N}otes in {C}omputer {S}cience {LNCS} 4514, {L}ogical {F}oundations of {C}omputer {S}cience 2007 {I}nternational {S}ymposium of {L}ogical {F}oundations of {C}omputer {S}cience, {LFCS} 2007 }, publisher={{S}pringer }, pages={401--421 }, address={{N}ew {Y}ork {\'E}tats-{U}nis d'{A}m{\'e}rique }, editor={{S}ergei {N}. {A}rtemov, {A}nil {N}erode }, series={{LNCS} 4514 }, note={21 pages rapport interne {LIPN} {ANR} {NO}-{C}o{ST} }, audience={internationale }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00122980/en/}, } %% hal-00179256, version 1 %% http://hal.archives-ouvertes.fr/hal-00179256/en/ @inproceedings{MONDARY:2007:HAL-00179256:1, title={{C}onstruction d'{O}ntologies {\`a} partir de {T}extes. {A}pplication au {D}roit {I}nternational du {T}ravail.}, author={{M}ondary, {T}hibault}, abstract={{C}e poster pr{\'e}sente mon sujet de th{\`e}se, qui se situe {\`a} la fronti{\`e}re entre le {TAL} et l'{IC}. {L}e but applicatif de cette th{\`e}se est la construction d'une ontologie du domaine du droit international du travail. {C}ette ontologie est con{\c{c}}ue pour aider les juristes dans le traitement des cas de violation des conventions internationales du travail. {L}es principaux enjeux de recherche sont la semi-automatisation de l'int{\'e}gration des ressources externes dans la m{\'e}thode {T}erminae et l'{\'e}tude de l'articulation entre les niveaux conceptuels et linguistiques, en vue de l'indexation des documents.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}ession de {D}{\'e}monstrations et de {P}osters associ{\'e}e {\`a} la 7{\`e}me conf{\'e}rence {T}erminologie et {I}ntelligence {A}rtificielle 7{\`e}me conf{\'e}rence {T}erminologie et {I}ntelligence {A}rtificielle - {TIA}'07 }, pages={7-9 }, address={{S}ophia-{A}ntipolis {F}rance }, audience={non sp{\'e}cifi{\'e}e }, day={08}, month={10}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00179256/en/}, } %% hal-00153435, version 1 %% http://hal.archives-ouvertes.fr/hal-00153435/en/ @inproceedings{MONDARY:2007:HAL-00153435:1, title={{B}etween browsing and search, a new model for navigating through large documents}, author={{M}ondary, {T}hibault and {B}ouffier, {A}manda and {N}azarenko, {A}deline}, abstract={{T}his paper proposes a new model for document access, which combines the search and browsing approaches. {W}e define a good navigation as a navigation which is as quick and direct as possible and which offers good precision and recall rates in finding the text segments that are relevant for the user's information need. {O}ur navigation model relies on recent advances in natural language processing and it is based on two traditional cognitive principles that are inherited from works on the visualization of information. {T}his model is implemented in a navigation prototype which is designed for physicians who want to consult official recommendations to take medical decisions. {E}ven if this model has not been really evaluated yet, we show the dynamicity and the efficiency of our approach on few detailled examples.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={proceedings of {E}uro{C}og{S}ci07, the european cognitive science conference {E}uro{C}og{S}ci07, {T}he {E}uropean {C}ognitive {S}cience {C}onference 2007 }, publisher={{L}awrence {E}rlbaum {A}ssociates }, pages={634-639 }, address={{D}elphi {G}r{\`e}ce }, editor={{S}tella {V}osniadou, {D}aniel {K}ayser and {A}thanassios {P}rotopapas }, audience={internationale }, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153435/en/}, } %% hal-00152314, version 1 %% http://hal.archives-ouvertes.fr/hal-00152314/en/ @inproceedings{MONNOT:2007:HAL-00152314:1, title={{T}he complexity of the {P}k partition problem and related problems in bipartite graphs}, author={{M}onnot, {J}{\'e}r{\^o}me and {T}oulouse, {S}ophie}, abstract={{I}n this paper, we continue the investigation made in [{MT}05] about the approximability of {P}k partition problems, but focusing here on their complexity. {P}recisely, we aim at designing the frontier between polynomial and {NP}-complete versions of the {P}k partition problem in bipartite graphs, according to both the constant k and the maximum degree of the input graph. {W}e actually extend the obtained results to more general classes of problems, namely, the minimum k-path partition problem and the maximum {P}k packing problem. {M}oreover, we propose some simple approximation algorithms for those problems.}, keywords={{P}k-partition; maximum (weighted) {P}k-packing; minimum k-path partition; bipartite graphs; {NP}-completeness; approximation algorithms}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} }, booktitle={{P}roc. of {SOFSEM} 2007 {T}heory and {P}ractice of {C}omputer {S}cience }, publisher={{LNCS} 4362 }, pages={422-433 }, audience={internationale }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00152314/en/}, } %% hal-00153304, version 1 %% http://hal.archives-ouvertes.fr/hal-00153304/en/ @inproceedings{POIBEAU:2007:HAL-00153304:1, title={{UP}13: {K}nowledge poor methods (sometimes) perform poorly}, author={{P}oibeau, {T}hierry}, abstract={{T}his short paper presents the system developed at the {U}niversit{\'e} {P}aris 13 for the {M}etonymy resolution task, during {S}emeval 2007 (location name track). {W}e developed a basic strategy only based on plain word forms to see how far one can go using only surface cues. {W}e then discuss the relevance of this approach and compare it with more complex ones.}, keywords={{M}{\'e}tonymie, enti{\'e} nomm{\'e}e}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {ACL} {S}em{E}val workshop {ACL} {S}em{E}val ({S}emantic {E}valuation) workshop }, publisher={{A}ssociation for {C}omputational {L}inguistics }, pages={- }, address={{P}rague {T}ch{\`e}que, {R}{\'e}publique }, audience={internationale }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153304/en/}, } %% hal-00160804, version 1 %% http://hal.archives-ouvertes.fr/hal-00160804/en/ @inproceedings{RECANATI:2007:HAL-00160804:1, title={{T}he structure of verbal sequences analyzed with unsupervised learning techniques}, author={{R}ecanati, {C}atherine and {R}ogovschi, {N}icoleta and {B}ennani, {Y}oun{\`e}s}, abstract={{D}ata mining allows the exploration of sequences of phenomena, whereas one usually tends to focus on isolated phenomena or on the relation between two phenomena. {I}t offers invaluable tools for theoretical analyses and exploration of the structure of sentences, texts, dialogues, and speech. {W}e report here the results of an attempt at using it for inspecting sequences of verbs from {F}rench accounts of road accidents. {T}his analysis comes from an original approach of unsupervised training allowing the discovery of the structure of sequential data. {T}he entries of the analyzer were only made of the verbs appearing in the sentences. {I}t provided a classification of the links between two successive verbs into four distinct clusters, allowing thus text segmentation. {W}e give here an interpretation of these clusters by applying a statistical analysis to independent semantic annotations.}, keywords={{T}ime and aspect; discourse semantics; {N}atural language processing; text typology; data mining; unsupervised learning}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the 3rd {L}anguage \& {T}echnology {C}onference: {H}uman {L}anguage {T}echnologies as a {C}hallenge for {C}omputer {S}cience and {L}inguistics {T}he 3rd {L}anguage \& {T}echnology {C}onference: {H}uman {L}anguage {T}echnologies as a {C}hallenge for {C}omputer {S}cience and {L}inguistics }, publisher={{W}ydawnictwo {P}oznanskie {S}p. z o.o. with co-operation of {F}undacja {U}niwersytetu im. {A}. {M}ickiewicza }, pages={pp. 325-329 }, address={{P}oznan {P}ologne }, editor={{Z}ygmunt {V}etulani (ed) }, audience={internationale }, ARXIVID={0710.2446 }, month={10}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00160804/en/}, } %% hal-00157801, version 1 %% http://hal.archives-ouvertes.fr/hal-00157801/en/ @inproceedings{RECANATI:2007:HAL-00157801:1, title={{S}equencing of verbs - a study on tense and aspect using unsupervised learning}, author={{R}ecanati, {C}atherine and {R}ogovschi, {N}icoleta and {B}ennani, {Y}oun{\`e}s}, abstract={{W}e report here the results of an attempt at using data mining tools for inspecting sequences of verbs from {F}rench accounts of road accidents. {T}his analysis comes from an original approach of unsupervised learning allowing the discovery of the structure of sequential data. {T}he entries of the analyzer were only made for the verbs appearing in the sentences. {I}t provided a classification of the linking between two successive verbs into four distinct clusters, allowing thus text segmentation. {W}e give here an interpretation of these clusters by applying a statistical analysis to independent semantic annotations.}, keywords={{N}atural {L}anguage {P}rocessing; {D}ata {M}ining; {T}ime and {A}spect;}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {I}nternational {C}onference on {R}ecent {A}dvances in {N}atural {L}anguage {P}rocessing ({RANLP} 07) {I}nternational {C}onference on {R}ecent {A}dvances in {N}atural {L}anguage {P}rocessing ({RANLP} 07) }, publisher={{I}nstitute for {P}arallel {P}rocessing, {B}ulgarian {A}cademy of {S}ciences }, pages={pp. 499-503, {ISBN} 978-954-91743-7-3 }, address={{B}orovets {B}ulgarie }, editor={{G}alia {A}ngelova, {K}alina {B}ontcheva, {R}uslan {M}itkov, {N}icolas {N}icolov, {N}ikolai {N}ikolov }, audience={internationale }, month={09}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00157801/en/}, } %% hal-00153327, version 2 %% http://hal.archives-ouvertes.fr/hal-00153327/en/ @inproceedings{RECANATI:2007:HAL-00153327:2, title={{E}ncha{\^i}nements verbaux - {\'e}tude sur le temps et l'aspect utilisant des techniques d'apprentissage non supervis{\'e}}, author={{R}ecanati, {C}atherine and {R}ogovschi, {N}icoleta}, abstract={{U}nsupervised learning allows the discovery of initially unknown categories. {C}urrent techniques make it possible to explore sequences of phenomena whereas one tends to focus on the analysis of isolated phenomena or on the relation between two phenomena. {T}hey offer thus invaluable tools for the analysis of sequential data, and in particular, for the discovery of textual structures. {W}e report here the results of a first attempt at using them for inspecting sequences of verbs coming from sentences of {F}rench accounts of road accidents. {V}erbs were encoded as pairs (cat, tense) – where cat is the aspectual category of a verb, and tense its grammatical tense. {T}he analysis, based on an original approach, provided a classification of the links between two successive verbs into four distinct groups (clusters) allowing texts segmentation. {W}e give here an interpretation of these clusters by using statistics on semantic annotations independent of the training process.}, keywords={discours; temps et aspect; cat{\'e}gorie verbale aspectuelle; s{\'e}mantique; fouille de donn{\'e}es}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de la 14{\`e}me conf{\'e}rence sur le {T}raitement {A}utomatique des {L}angues {N}aturelles {TALN} }, publisher={{IRIT} {P}ress }, pages={pp. 379-388 }, address={{T}oulouse {F}rance }, note={10 pages }, audience={nationale }, month={06}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153327/en/}, } %% hal-00153328, version 1 %% http://hal.archives-ouvertes.fr/hal-00153328/en/ @inproceedings{RECANATI:2007:HAL-00153328:1, title={{C}haracteristics of diagrammatic reasoning}, author={{R}ecanati, {C}atherine}, abstract={{D}iagrammatic, analogical or iconic representations are often contrasted with linguistic or logical representations, in which the shape of the symbols is arbitrary. {A}lthough commonly used, diagrams have long suffered from their reputation as mere tools, as mere support for intuition. {W}e list here the main characteristics of diagrammatic inferential systems, and defend the idea that heterogeneous representation systems, including both linguistic and diagrammatic representations, offer real computational perspectives in knowledge modeling and reasoning.}, keywords={human reasoning; diagrammatic reasoning; inferential systems; iconic representations; heterogeneous representational systems}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {E}uro{C}og{S}ci07, the european cognitive science conference {E}uro{C}og{S}ci07, the european cognitive science conference }, publisher={{L}awrence {E}rlbaum {A}ssociates }, pages={pp 510-515 }, address={{D}elphi {G}r{\`e}ce }, editor={edited by {S}tella {V}osniadou, {D}aniel {K}ayser and {A}thanassios {P}rotopapas }, series={the second european cognitive science conference }, audience={internationale }, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153328/en/}, } %% hal-00155373, version 1 %% http://hal.archives-ouvertes.fr/hal-00155373/en/ @inproceedings{ROGOVSCHI:2007:HAL-00155373:1, title={{A}pprentissage neuro-markovien pour la classification non supervis{\'e}e de donn{\'e}es structur{\'e}es en s{\'e}quences}, author={{R}ogovschi, {N}icoleta and {B}ennani, {Y}oun{\`e}s and {R}ecanati, {C}atherine}, keywords={fouille de donn{\'e}es; algorithmes bio-mim{\'e}tiques;}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de {EGC}'2007 - publication des {A}ctes des {A}teliers - {EGC}'2007 ({E}xtraction et {G}estion des {C}onnaissances) }, publisher={{C}{\'e}padu{\`e}s {E}ditions }, pages={pp. 49-60 }, address={{N}amur {B}elgique }, series={{A}ctes de l'atelier « {F}ouille de donn{\'e}es et algorithmes bio-mim{\'e}tiques » }, audience={internationale }, month={01}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00155373/en/}, } %% hal-00174032, version 1 %% http://hal.archives-ouvertes.fr/hal-00174032/en/ @inproceedings{SZULMAN:2007:HAL-00174032:1, title={{E}xploitation linguistique d'une ontologie g{\'e}n{\'e}rique}, author={{S}zulman, {S}ylvie and {D}espres, {S}ylvie}, abstract={{L}'article pr{\'e}sente l'exploitation linguistique d'une ontologie g{\'e}n{\'e}rique lors de sa r{\'e}utilisation. {L}e processus auquel nous nous r{\'e}f{\'e}rons est celui de la construction semi-automatique d'une nouvelle ontologie de domaine {\`a} partir de textes en s'alignant au fil de l'{\'e}laboration sur une ontologie g{\'e}n{\'e}rique de r{\'e}f{\'e}rence. {L}es {\'e}l{\'e}ments linguistiques de l'ontologie g{\'e}n{\'e}rique sont extraits et analys{\'e}s pour aider {\`a} la mise en correspondance des termes en corpus avec les concepts et les r{\^o}les qui la composent et r{\'e}aliser le processus d'alignement.}, keywords={construction d'ontologie {\`a} partir de textes, alignement d'ontologies, ontologie g{\'e}n{\'e}rique}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{TIA} 2007 {T}erminologie et {I}ntelligence artificielle }, pages={{\`a} paraitre }, address={{S}ophia-{A}ntipolis {F}rance }, audience={non sp{\'e}cifi{\'e}e }, day={08}, month={10}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174032/en/}, } %% hal-00162114, version 1 %% http://hal.archives-ouvertes.fr/hal-00162114/en/ @inproceedings{WEISSENBACHER:2007:HAL-00162114:1, title={{A} {B}ayesian approach combining surface clues and linguistic knowledge: {A}pplication to the anaphora resolution problem}, author={{W}eissenbacher, {D}avy and {N}azarenko, {A}deline}, abstract={{I}n {NLP}, {A} traditional distinction opposes the linguistically-based systems and the knowledge-poor ones which mainly rely on surface clues. {E}ach approach has its drawbacks and its advantages. {I}n this paper, we propose a new method which is based on {B}ayes {N}etworks and allows to combine both types of information. {A}s a case study, we focus on the specific task of pronominal anaphora resolution which is known as a difficult {NLP} problem. {W}e show that our bayesian system performs better than state-of-the art anaphora resolution ones.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{R}ecent {A}dvances in {N}atural {L}anguage {P}rocessing }, publisher={{R}ecent {A}dvances in {N}atural {L}anguage {P}rocessing }, pages={? }, audience={internationale }, day={29}, month={09}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00162114/en/}, } %% hal-00162093, version 1 %% http://hal.archives-ouvertes.fr/hal-00162093/en/ @inproceedings{WEISSENBACHER:2007:HAL-00162093:1, title={{I}dentifier les pronoms anaphoriques et trouver leurs ant{\'e}c{\'e}dents : l'int{\'e}r{\^e}t de la classification bay{\'e}sienne}, author={{W}eissenbacher, {D}avy and {N}azarenko, {A}deline}, abstract={{I}n {NLP}, a traditional distinction opposes linguistically-based systems and knowledge-poor ones, which mainly rely on surface clues. {E}ach approach has its drawbacks and its advantages. {I}n this paper, we propose a new approach based on {B}ayes {N}etworks that allows to combine both types of information. {A}s a case study, we focus on the anaphora resolution which is known as a difficult {NLP} problem. {W}e show that our bayesain system performs better than a state-of-the-art one for this task.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {T}raitement {A}utomatique des {L}angues {N}aturelles }, publisher={{ATALA} }, pages={145-155 }, address={{F}rance }, audience={nationale }, day={08}, month={06}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00162093/en/}, } %% hal-00162003, version 1 %% http://hal.archives-ouvertes.fr/hal-00162003/en/ @inproceedings{WEISSENBACHER:2007:HAL-00162003:1, title={{A} bayesian classifier for the recognition of the impersonal occurrences of the 'it' pronoun}, author={{W}eissenbacher, {D}avy and {N}azarenko, {A}deline}, abstract={{T}his paper presents a new system that makes the distinction between the impersonal and anaphoric occurrences of the 'it' pronoun. {C}ompared with the state of the art methods, our system relies on the same types of linguistic knowledge but performs better. {W}e argue that this is due to the bayesian model on which it is based: it enables to combine various pieces of knowledge and to exploit even unreliable ones in the process of pronoun occurrence classification.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the 6th {D}iscourse {A}naphora and {A}naphor {R}esolution colloquium ({DAARC}'07) {D}iscourse {A}naphora and {A}naphor {R}esolution {C}olloquium }, publisher={{D}iscourse {A}naphora and {A}naphor {R}esolution {C}olloquium }, pages={pp.145-150 }, address={{P}ortugal }, audience={internationale }, day={29}, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00162003/en/}, } %% hal-00170458, version 1 %% http://hal.archives-ouvertes.fr/hal-00170458/en/ @inproceedings{ZARGAYOUNA:2007:HAL-00170458:1, title={{E}valuation des outils terminologiques : {\'e}tat des lieux et propositions}, author={{Z}argayouna, {H}aifa and {H}amon, {O}livier and {N}azarenko, {A}deline}, abstract={{C}as un peu particulier parmi les t{\^a}ches de traitement automatique des langues, l'acquisition terminologique n'a gu{\`e}re fait l'objet d'{\'e}valuation syst{\'e}matique jusqu'{\`a} pr{\'e}sent. {L}es campagnes qui ont eu lieu sont r{\'e}centes et limit{\'e}es. {I}l est cependant n{\'e}cessaire de conduire des {\'e}valuations pour faire le bilan des recherches pass{\'e}es, mesurer les progr{\`e}s accomplis et les angles morts. {E}n prenant exemple {\`a} la fois du savoir-faire accumul{\'e} dans d'autres domaines du {TAL} et des premi{\`e}res exp{\'e}riences d'{\'e}valuation en acquisition terminologiques, cet article identifie des pistes de r{\'e}flexion pour prendre en compte {\`a} la fois la qualit{\'e} globale des r{\'e}sultats que produisent les outils terminologiques, la plus-value apport{\'e}e aux applications qui les exploitent et la qualit{\'e} individuelle de chacun de leurs composants. {T}out en proposant de poursuivre l'effort d'organisation de campagnes d'{\'e}valuation qui permettent de comparer diff{\'e}rents outils ou approches sur des t{\^a}ches communes, nous montrons que d'autres pistes d'{\'e}valuation sont possibles et qu'elles aident {\`a} appr{\'e}cier l'utilit{\'e} d'un outil d'acquisition particulier dans l'ensemble du processus d'analyse terminologique auquel il contribue.}, keywords={{T}erminologie, application, extraction, variation, {\'e}valuation}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de la 7{\`e}me {C}onf{\'e}rence : {T}erminologie et {I}ntelligence {A}rtificielle ({TIA}) 7{\`e}me {C}onf{\'e}rence : {T}erminologie et {I}ntelligence {A}rtificielle ({TIA}) }, pages={{\`a} paraitre }, address={{S}ophia {A}ntipolis {F}rance }, audience={nationale }, day={08}, month={10}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00170458/en/}, } %% hal-00157495, version 1 %% http://hal.archives-ouvertes.fr/hal-00157495/en/ @inproceedings{ZARGAYOUNA:2007:HAL-00157495:1, title={{S}hallow parsing of {INEX} {Q}ueries}, author={{Z}argayouna, {H}aifa and {R}osas, {V}ictor and {S}alotti, {S}ylvie}, abstract={{T}his article presents the contribution of the {LIPN} : {L}aboratoire d'{I}nformatique de {P}aris {N}ord ({F}rance) to the {NLQ}2{NEXI} ({N}atural {L}anguage {Q}ueries to {NEXI}) task (part of the {N}atural {L}anguage {P}rocessing ({NLP}) track) of the {I}nitiative for {E}valuation of {XML} {R}etrieval ({INEX} 2006). {I}t discusses the use of shallow parsing methods to analyse natural language queries.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{C}omparative {E}valuation of {XML} {I}nformation {R}etrieval {S}ystems 5th {I}nternational {W}orkshop of the {I}nitiative for the {E}valuation of {XML} {R}etrieval, {INEX} 2006 }, publisher={{LNCS}, {V}olume {N}umber 4518 }, pages={284-293 }, address={{D}agstuhl {A}llemagne }, audience={internationale }, day={20}, month={02}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00157495/en/}, } %% hal-00153983, version 1 %% http://hal.archives-ouvertes.fr/hal-00153983/en/ @inproceedings{ASEERVATHAM:2006:HAL-00153983:1, title={{M}{\'e}thodes {\`a} noyaux appliqu{\'e}es aux textes structur{\'e}s: {R}apport d'avancement 1}, author={{A}seervatham, {S}ujeevan and {V}iennet, {E}mmanuel}, abstract={{D}e nombreuses techniques d'apprentissage num{\'e}rique appliqu{\'e}es au traitement de donn{\'e}es textuelles utilisent une repr{\'e}sentation du texte en "sac de mot". {C}e codage, qui a l'avantage de la simplicit{\'e}, n'utilise que les fr{\'e}quences d'apparition des mots dans les documents et perd toute information li{\'e}e {\`a} l'ordre des {\'e}l{\'e}ments (ordre des mots, structure en paragraphes ou sections, etc). {D}epuis une petite dizaine d'ann{\'e}es, une nouvelle famille d'algorithme d'apprentissage, bas{\'e}e sur la notion de noyaux, fait l'objet d'intenses recherches. {C}es noyaux permettent de d{\'e}finir des mesures de similarit{\'e} utilisables dans de nombreux algorithmes d'apprentissage statistique (de l'analyse discriminante de {F}isher aux machines {\`a} vecteur de support). {R}{\'e}cemment, l'utilisation de noyaux sp{\'e}cifiques pour le traitement de donn{\'e}es textuelles structur{\'e}es a commenc{\'e} {\`a} faire l'objet de recherches. {D}ans le cadre de la sous-t{\^a}che 3.12 du projet {I}nfo{M}@gic, le {LIPN} a d{\'e}cid{\'e} de travailler sur l'application de ces m{\'e}thodes {\`a} noyau au traitement de donn{\'e}es textuelles structur{\'e}es. {C}e rapport interm{\'e}diaire pr{\'e}sente un bref {\'e}tat de l'art dans ce domaine. {N}ous passons en revue les principaux types de noyaux propos{\'e}s ces derni{\`e}res ann{\'e}es pour le traitement des s{\'e}quences et plus g{\'e}n{\'e}ralement des donn{\'e}es structur{\'e}es (arbres, graphes).}, keywords={{M}{\'e}thodes {\`a} noyaux; donn{\'e}es structur{\'e}es; texte, tal}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{R}apport d'avancement {ST}3.12 {I}nfo{M}agic ({C}ap {D}igital) {R}apport technique pour {I}nfo{M}agic ({C}ap {D}igital) }, publisher={{C}ap {D}igital ({R}apport technique) }, pages={17 }, address={{F}rance }, note={{I}nfo{M}agic ({C}ap {D}igital) }, audience={non sp{\'e}cifi{\'e}e }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153983/en/}, } %% hal-00153979, version 1 %% http://hal.archives-ouvertes.fr/hal-00153979/en/ @inproceedings{ASEERVATHAM:2006:HAL-00153979:1, title={bit{SPADE}: {A} {L}attice-{B}ased {S}equential {P}attern {M}ining {A}lgorithm {U}sing {B}itmap {R}epresentation}, author={{A}seervatham, {S}ujeevan and {O}smani, {A}omar and {V}iennet, {E}mmanuel}, abstract={{S}equential pattern mining allows to discover temporal relationship between items within a database. {T}he patterns can then be used to generate association rules. {W}hen the databases are very large, the execution speed and the memory usage of the mining algorithm become critical parameters. {P}revious research has focused on either one of the two parameters. {I}n this paper, we present bit{SPADE}, a novel algorithm that combines the best features of {SPAM}, one of the fastest algorithm, and {SPADE}, one of the most memory efficient algorithm. {M}oreover, we introduce a new pruning strategy that enables bit{SPADE} to reach high performances. {E}xperimental evaluations showed that bit{SPADE} ensures an efficient tradeoff between speed and memory usage by outperforming {SPADE} by both speed and memory usage factors more than 3.4 and {SPAM} by a memory consumption factor up to more than an order of magnitude.}, keywords={{S}equence {M}ining; {D}ata {M}ining; {F}requent {S}equential {P}atterns}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {S}ixth {I}nternational {C}onference on {D}ata {M}ining ({ICDM}'06) {I}nternational {C}onference on {D}ata {M}ining ({ICDM}'06) }, publisher={{ACM}/{IEEE} }, pages={6 }, address={{H}ong-{K}ong }, audience={non sp{\'e}cifi{\'e}e }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153979/en/}, } %% hal-00091444, version 1 %% http://hal.archives-ouvertes.fr/hal-00091444/en/ @inproceedings{AUBIN:2006:HAL-00091444:1, title={{I}mproving {T}erm {E}xtraction with {T}erminological {R}esources}, author={{A}ubin, {S}ophie and {H}amon, {T}hierry}, abstract={{S}tudies of different term extractors on a corpus of the biomedical domain revealed decreasing performances when applied to highly technical texts. {T}he difficulty or impossibility of customising them to new domains is an additional limitation. {I}n this paper, we propose to use external terminologies to influence generic linguistic data in order to augment the quality of the extraction. {T}he tool we implemented exploits testified terms at different steps of the process: chunking, parsing and extraction of term candidates. {E}xperiments reported here show that, using this method, more term candidates can be acquired with a higher level of reliability. {W}e further describe the extraction process involving endogenous disambiguation implemented in the term extractor {Y}a{T}e{A}.}, keywords={{TAL}; {NLP}; {A}cquisition terminologique; terminological knowledge acquisition; exploitation de ressources; extracteur de termes; term extractor; resources exploitation}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}dvances in {N}atural {L}anguage {P}rocessing 5th {I}nternational {C}onference on {NLP}, {F}in{TAL} 2006 }, publisher={{S}pringer }, pages={380 }, editor={{T}apio {S}alakoski, {F}ilip {G}inter, {S}ampo {P}yysalo, {T}apio {P}ahikkala }, series={{LNAI} 4139 }, note={projet {ALVIS}: {IST}-1-002068-{STP}, projet europ{\'e}en {STREP} }, ARXIVID={cs.CL/0609019 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00091444/en/}, } %% halshs-00132034, version 1 %% http://halshs.archives-ouvertes.fr/halshs-00132034/en/ @inproceedings{BATTISTELLI:2006:HALSHS-00132034:1, title={{Q}uelques exemples d'utilisation des {S}_langages pour le traitement de la temporalit{\'e} en linguistique}, author={{B}attistelli, {D}elphine and {M}inel, {J}.{L}. and {R}. {S}chwer, {S}ylviane}, abstract={{C}et article illustre sur plusieurs exemples l'int{\'e}r{\^e}t des {S}-langages dans le traitement de la temporalit{\'e}}, keywords={{S}_{L}angages; traitement de la temporalit{\'e} linguistique}, language={{F}ran{\c{c}}ais}, affiliation={{I}nstitut des {S}ciences {H}umaines {A}ppliqu{\'e}es - {ISHA} - {U}niversit{\'e} {P}aris-{S}orbonne - {P}aris {IV} - {M}od{\`e}les, {D}ynamiques, {C}orpus - {M}o{D}y{C}o - {CNRS} : {UMR}7114 - {U}niversit{\'e} de {P}aris {X} - {N}anterre - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{SDC} {S}emaine de la {C}onnaissance }, publisher={{SDC} 06 }, pages={5 }, editor={{R}{\'e}mi {L}ehn, {M}ounira {H}arzallah, {N}athalie {A}ussenac-{G}illes, {J}ean {C}harlet }, audience={nationale }, day={26}, month={06}, year={2006}, URL={http://halshs.archives-ouvertes.fr/halshs-00132034/en/}, } %% hal-00097757, version 1 %% http://hal.archives-ouvertes.fr/hal-00097757/en/ @inproceedings{BOURGOIS:2006:HAL-00097757:1, title={{F}inding {A}lternatives {W}eb {S}ervices to {P}arry {B}reakdowns}, author={{B}ourgois, {L}aure}, abstract={{T}he increasing number of {W}eb services and thus of possible combinations is particularly hard to accord with the dynamic and versatile feature of the {W}eb. {I}ndeed, in general, complex{W}eb services may frequently happen not to fit the situation encountered. {T}o avoid composing a new {W}eb service "from scratch", we search a practical way of repairing failed ones. {T}his paper presents a {W}eb service repairing heuristic based on a semantic modeling approach. {M}odeling{W}eb services is triggered with an {OWL}-{S} fragment. {R}epairing is based on our previous work which allows organizing a collection of {W}eb services into hierarchies. {A} {NEXPTIME} complexity upper bound is shown for a reparation which doesn't change the internal structure of the complex {W}eb service.}, keywords={{W}eb services; software components; breakdown; dynamic logic; subsumption; reconfiguration}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {T}hird {S}tarting {AI} {R}esearchers' {S}ymposium }, publisher={{IOS} {P}ress }, pages={232 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00097757/en/}, } %% hal-00097754, version 1 %% http://hal.archives-ouvertes.fr/hal-00097754/en/ @inproceedings{BOURGOIS:2006:HAL-00097754:1, title={{W}eb {S}ervices {S}ubsumption with a {S}pecific {PDL}}, author={{B}ourgois, {L}aure and {D}elteil, {A}lexandre and {L}{\'e}vy, {F}ran{\c{c}}ois}, abstract={{I}n this paper, we elaborate a notion of semantic{W}eb subsumption for processes, i.e. composed {W}eb services. {I}t can be used for the task of cleaning {OWL}-{S} processes libraries and to organize collections of plans into hierarchies. {T}o that end, different types of {W}eb services are compared. {T}hen, we give a representation formalism and a subsumption notion for the composition of some {W}eb services, seen as atomic actions, with preconditions and effects. {A} particular propositional dynamic logic is selected to formalize actions preconditions and effects. {A} reasoning method, for deciding processes subsumption is presented. {A}t last, we give a customizable implementation of the reasoning method.}, keywords={web services, dynamic logic, plan subsumption}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}dvanced {I}nternational {C}onference on {T}elecommunications and {I}nternational {C}onference on {I}nternet and {W}eb {A}pplications and {S}ervices ({AICT}/{ICIW}) }, publisher={{IEEE} {C}omputer {S}ociety }, pages={158 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00097754/en/}, } %% hal-00159039, version 1 %% http://hal.archives-ouvertes.fr/hal-00159039/en/ @inproceedings{CAILLIAU:2006:HAL-00159039:1, title={{U}n mod{\`e}le pour unifier la gestion de ressources linguistiques en contexte multilingue}, author={{C}ailliau, {F}rederik}, abstract={{L}e bon fonctionnement d'{I}ntuition, plate-forme de recherche d'information, repose sur le d{\'e}veloppement et l'int{\'e}gration d'un grand nombre de ressources linguistiques. {D}ans un souci de coh{\'e}rence et de meilleure gestion, l'unification de ressources contenant des connaissances h{\'e}t{\'e}rog{\`e}nes s'impose. {C}omme {I}ntuition est disponible dans la plupart des langues europ{\'e}ennes, cette unification se heurte au facteur multilingue. {P}our surmonter les probl{\`e}mes caus{\'e}s par les diff{\'e}rences structurelles entre les langues, une nouvelle architecture linguistique a {\'e}t{\'e} con{\c{c}}ue et exprim{\'e}e en {UML}. {C}e m{\'e}ta-mod{\`e}le est le point de d{\'e}part pour la nouvelle base de donn{\'e}es qui sera le noyau d'un nouvel environnement de travail centr{\'e} sur son utilisateur, l'expert linguistique. {C}et environnement centralisera la gestion de toutes les ressources linguistiques d'{I}ntuition.}, keywords={gestion de lexiques; base de donn{\'e}es linguistique; ressources linguistiques; multilinguisme; architecture linguistique}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {S}inequa {L}abs - {S}inequa }, booktitle={{A}ctes de la 13e {C}onf{\'e}rence sur le {T}raitement {A}utomatique des {L}angues {N}aturelles {TALN} 06 }, publisher={{P}resses {U}niversitaires de {L}ouvain }, pages={455-461 }, address={{L}euven {B}elgique }, audience={non sp{\'e}cifi{\'e}e }, day={10}, month={04}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00159039/en/}, } %% hal-00098149, version 1 %% http://hal.archives-ouvertes.fr/hal-00098149/en/ @inproceedings{CAILLIAU:2006:HAL-00098149:1, title={{U}n mod{\`e}le pour unifier la gestion de ressources linguistiques en contexte multilingue}, author={{C}ailliau, {F}rederik}, abstract={{T}he proper functioning of {I}ntuition, {S}inequa's platform for information retrieval, depends on the development and integration of a large number of linguistic resources. {T}o improve their coherence and management, these resources containing very diverse knowledge have to be unified. {A}s {I}ntuition is available in most of the {E}uropean languages, the multilingual factor makes this unification more complex. {T}o overcome the problems caused by the structural differences among languages, a new linguistic architecture has been designed and modelled using {UML}. {T}his meta-model is the starting point for the new database that will be the core component of a new workbench, centred on its user, the linguistic expert. {T}his workbench will provide a centralised management of all the linguistic resources of {I}ntuition.}, keywords={{L}exicon {M}anagement, {L}inguistic {D}atabase, {L}inguistic {R}esources, {M}ultilinguism, {L}inguistic {A}rchitecture}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de la 13{\`e}me {\'e}dition de la conf{\'e}rence sur le {T}raitement {A}utomatique des {L}angues {N}aturelles ({TALN} 2006) }, publisher={{P}resses universitaires de {L}ouvain }, pages={??? }, note={{H}.3.1 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00098149/en/}, } %% hal-00084822, version 1 %% http://hal.archives-ouvertes.fr/hal-00084822/en/ @inproceedings{CERIN:2006:HAL-00084822:1, title={{M}ethods for {P}artitioning {D}ata to {I}mprove {P}arallel {E}xecution {T}ime for {S}orting on {H}eterogeneous {C}lusters}, author={{C}{\'e}rin, {C}hristophe and {D}ubacq, {J}ean-{C}hristophe and {R}och, {J}ean-{L}ouis}, abstract={{T}he aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds. {S}uch an application requires a partitioning step. {F}or uniformly related processors (processors speeds are related by a constant factor), we develop a constant time technique for mastering processor load and execution time in an heterogeneous environment and also a technique to deal with unknown cost functions. {F}or non uniformly related processors, we use a technique based on dynamic programming. {M}ost of the time, the solutions are in {O}(p) (p is the number of processors), independent of the problem size n. {C}onsequently, there is a small overhead regarding the problem we deal with but it is inherently limited by the knowing of time complexity of the portion of code following the partitioning.}, keywords={parallel in-core sorting;heterogeneous computing;complexity of parallel algorithms;data distribution}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {MOAIS} - {INRIA} {R}h{\^o}ne-{A}lpes / {ID}-{IMAG} - {INRIA} - {U}niversit{\'e} {J}oseph {F}ourier - {G}renoble {I} - {I}nstitut {N}ational {P}olytechnique de {G}renoble - {INPG} }, booktitle={{A}dvances in {G}rid and {P}ervasive {C}omputing {GPC} 2006 }, publisher={{S}pringer }, pages={175-186 }, address={{F}rance }, editor={{Y}.-{C}. {C}hung \& {J}.{E}. {M}oreira }, series={{LNCS} 3947 }, note={{F}.2.2 {A}gence {N}ationale de la {R}echerche {ANR}-05-{SSIA}-0005-01, {A}gence {N}ationale de la {R}echerche {ANR}-05- {SSIA}-0005-05, programme {ARA} s{\'e}curit{\'e} }, audience={internationale }, collaboration={{S}afe{S}cale }, ARXIVID={cs.DC/0607041 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084822/en/}, } %% hal-00340483, version 1 %% http://hal.archives-ouvertes.fr/hal-00340483/en/ @inproceedings{CHOPPY:2006:HAL-00340483:1, title={{F}ormal methods for distributed and cooperative systems, a tutorial}, author={{C}hoppy, {C}hristine and {P}etrucci, {L}aure and {K}laudel, {H}anna and {H}addad, {S}erge and {K}ordon, {F}abrice and {T}hierry {M}ieg, {Y}ann}, abstract={{T}his tutorial is proposed by representatives of the {M}e{F}o{S}y{L}o{M}a1 group. {M}e{F}o{S}y{L}o{M}a is an informal group gathering several teams from various universities in the {P}aris area: {U}niversit\'e {P}aris-{D}auphine ({LAMSADE} laboratory), {U}niversit\'e {P}. \& {M}. {C}urie ({LIP}6 laboratory), {U}niversit\'e {P}aris 13 ({LIPN} laboratory), {ENST} ({LTCI} laboratory), {C}onservatoire {N}ational des {A}rts et {M}\'etiers ({CEDRIC} laboratory). {T}hese teams have extensive knowledge and experience in the design, analysis and implementation of distributed systems. {T}he cooperation within the group aims at joining forces, sharing experiences and building joint projects to solve issues in the design of reliable distributed systems.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nformatique, {B}iologie {I}nt{\'e}grative et {S}yst{\`e}mes {C}omplexes - {IBISC} - {CNRS} : {FRE}3190 - {U}niversit{\'e} d'{E}vry-{V}al d'{E}ssonne - {L}aboratoire {S}p{\'e}cification et {V}{\'e}rification - {LSV} - {CNRS} : {UMR}8643 - {INRIA} - {E}cole {N}ormale {S}up{\'e}rieure de {C}achan - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={3rd {I}nternational {C}olloquium on {T}heoretical {A}spects of {C}omputing ({ITAC} 2006) 3rd {I}nternational {C}olloquium on {T}heoretical {A}spects of {C}omputing ({ITAC} 2006) }, pages={362--365 }, address={{T}unisie }, volume={4281 }, series={{L}ecture {N}otes in {C}omputer {S}cience }, audience={internationale }, doi={10.1007/11921240_25 }, year={2006}, URL={dx.doi.org/10.1007/11921240_25 http://hal.archives-ouvertes.fr/hal-00340483/en/}, } %% hal-00153757, version 1 %% http://hal.archives-ouvertes.fr/hal-00153757/en/ @inproceedings{CHOPPY:2006:HAL-00153757:1, title={{R}equirements {C}apture and {S}pecification for {E}nterprise {A}pplications: a {UML} {B}ased {A}ttempt}, author={{C}hoppy, {C}hristine and {R}eggio, {G}ianna}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roc of the {A}ustralian {S}oftware {E}ngineering {C}onference ({ASWEC}-2006) {A}ustralian {S}oftware {E}ngineering {C}onference ({ASWEC}-2006) }, publisher={{IEEE} }, pages={19-28 }, address={{S}ydney {A}ustralie }, audience={internationale }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153757/en/}, } %% hal-00153752, version 1 %% http://hal.archives-ouvertes.fr/hal-00153752/en/ @inproceedings{CHOPPY:2006:HAL-00153752:1, title={{C}omponent composition through architectural patterns for problem frames}, author={{C}hoppy, {C}hristine and {H}atebur, {D}enis and {H}eisel, {M}aritta}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roc. of the {XIII} {A}sia {P}acific {S}oftware {E}ngineering {C}onference ({APSEC}-2006) {XIII} {A}sia {P}acific {S}oftware {E}ngineering {C}onference }, publisher={{IEEE} }, pages={27-34 }, address={{I}nde }, audience={internationale }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153752/en/}, } %% hal-00090079, version 1 %% http://hal.archives-ouvertes.fr/hal-00090079/en/ @inproceedings{DERIVIERE:2006:HAL-00090079:1, title={{A} {S}calable and {D}istributed {NLP} {A}rchitecture for {W}eb {D}ocument {A}nnotation}, author={{D}erivi{\`e}re, {J}ulien and {H}amon, {T}hierry and {N}azarenko, {A}deline}, keywords={{N}atural {L}anguage {P}rocessing; {A}nnotation; {W}eb documents; {NLP} architecture}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}dvances in {N}atural {L}anguage {P}rocessing (5th {I}nternational {C}onference on {NLP}, {F}in{TAL} 2006) }, publisher={{S}pringer }, pages={56-67 }, editor={{T}apio {S}alakoski, {F}ilip {G}inter, {S}ampo {P}yysalo, {T}apio {P}ahikkala }, series={{LNAI} 4139 }, note={{P}rojet {E}urop{\'e}en {STREP} {IST}-1-002068-{STP} - {ALVIS} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00090079/en/}, } %% hal-00089091, version 1 %% http://hal.archives-ouvertes.fr/hal-00089091/en/ @inproceedings{DESPRES:2006:HAL-00089091:1, title={{T}erminae {M}ethod and {I}ntegration {P}rocess for {L}egal {O}ntology {B}uilding}, author={{D}espr{\'e}s, {S}ylvie and {S}zulman, {S}ylvie}, abstract={{T}his paper describes the contruction method of a legal application ontology. {T}his method is based on the merging of micro-ontologies built from {E}uropean community directives. {T}he terminae construction method from texts enhanced by an alignment process with a core legal ontology is used for building micro-ontologies. {A} merging process allows constructing the legal ontology.}, language={{A}nglais}, affiliation={{CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}dvances in {A}pplied {A}rtificial {I}ntelligence: 19th {I}nternational {C}onference on {I}ndustrial, {E}ngineering and {O}ther {A}pplications of {A}pplied {I}ntelligent {S}ystems, {IEA}/{AIE} 2006, {A}nnecy, {F}rance, {J}une 27-30, 2006. {P}roceedings }, publisher={{S}pringer {B}erlin/{H}eidelberg }, pages={1014-1023 }, doi={10.1007/11779568_108 }, year={2006}, URL={dx.doi.org/10.1007/11779568_108 http://hal.archives-ouvertes.fr/hal-00089091/en/}, } %% inria-00085789, version 1 %% http://hal.inria.fr/inria-00085789/en/ @inproceedings{DJEROUROU:2006:INRIA-00085789:1, title={{I}nf{\'e}rence d'{I}nconsistances pour la {R}{\'e}solution de {MAX}-{N} {CSP}}, author={{D}jerourou, {F}ay{\c{c}}al and {B}ennaceur, {H}achemi}, abstract={{L}e pr{\'e}sent article porte sur la r{\'e}solution exacte du probl{\`e}me de satisfaction maximale de contraintes ({M}ax- {CSP}). {L}a r{\'e}solution du {M}ax-{CSP} est g{\'e}n{\'e}ralement effectu{\'e}e {\`a} l'aide d'algorithmes de type branch and bound. {L}'efficacit{\'e} de ces algorithmes d{\'e}pend {\'e}troitement de la borne inf{\'e}rieure de la valeur du {M}ax-{CSP} qu'ils utilisent au cours de la recherche. {L}es bornes inf{\'e}rieures pour le {M}ax-{CSP} se basent, en g{\'e}n{\'e}ral, sur le concept d'arc consistance ({AC}). {N}ous pr{\'e}sentons ici un m{\'e}canisme d'inf{\'e}rences d'inconsistance entre valeurs dans le but d'augmenter les valeurs des bornes inf{\'e}rieures bas{\'e}es sur l'{AC}. {C}eci est eectu{\'e} en d{\'e}tectant les inconsis- tances ignor{\'e}es par les compteurs d'arc-inconsistance dirig{\'e}e dac. {L}'inf{\'e}rence d'inconsistances pour une valeur a d'une variable non instanci{\'e}e i, consiste {\`a} rajouter {\`a} la contribution de a le nombre de variables futures dont les valeurs participant au calcul de la borne inf{\'e}rieure sont incoh{\'e}rentes avec a. {U}ne impl{\'e}mentation de cette technique est pr{\'e}sent{\'e}e et test{\'e}e sur des {M}ax-{CSP} al{\'e}a- toires.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{D}euxi{\`e}mes {J}ourn{\'e}es {F}rancophones de {P}rogrammation par {C}ontraintes ({JFPC}06) }, address={{N}{\^i}mes - {E}cole des {M}ines d'{A}l{\`e}s / {F}rance }, audience={non sp{\'e}cifi{\'e}e }, year={2006}, URL={http://hal.inria.fr/inria-00085789/en/}, } %% hal-00090082, version 1 %% http://hal.archives-ouvertes.fr/hal-00090082/en/ @inproceedings{GRABAR:2006:HAL-00090082:1, title={{T}erminology {S}tructuring {T}hrough the {D}erivational {M}orphology}, author={{G}rabar, {N}atalia and {H}amon, {T}hierry}, keywords={{T}erminology; {M}orphology; {S}emantic relations}, language={{A}nglais}, affiliation={{I}ngenierie des connaissances en sant{\'e} - {INSERM} : {U}729 - {IFR}58 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}dvances in {N}atural {L}anguage {P}rocessing (5th {I}nternational {C}onference on {NLP}, {F}in{TAL} 2006) }, publisher={{S}pringer }, pages={652-663 }, editor={{T}apio {S}alakoski, {F}ilip {G}inter, {S}ampo {P}yysalo, {T}apio {P}ahikkala }, series={{LNAI} 4139 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00090082/en/}, } %% hal-00082488, version 1 %% http://hal.archives-ouvertes.fr/hal-00082488/en/ @inproceedings{GUERIF:2006:HAL-00082488:1, title={{S}election of {C}lusters {N}umber and {F}eatures {S}ubset during a {T}wo-{L}evels {C}lustering {T}ask}, author={{G}u{\'e}rif, {S}{\'e}bastien and {B}ennani, {Y}oun{\`e}s}, abstract={{S}imultaneous selection of the number of clusters and of a relevant subset of features is part of data mining challenges. {A} new approach is proposed to address this difficult issue. {I}t takes benefits of both two-levels clustering approaches and wrapper features selection algorithms. {O}n the one hands, the former enhances the robustness to outliers and to reduce the running time of the algorithm. {O}n the other hands, wrapper features selection ({FS}) approaches are known to given better results than filter {FS} methods because the algorithm that uses the data is taken into account. {F}irst, a {S}elf-{O}rganizing {M}aps ({SOM}), trained using the original data sets, is clustered using k-means and the {D}avies-{B}ouldin index to determinate the best number of a clusters. {T}hen, an individual pertinence measure guides the backward elimination procedure and the feature mutual pertinence is measure using a collective pertinence based on the quality of the clustering.}, keywords={clustering; feature selection; self-organizing maps; model selection}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the 10th {I}nternational {C}onference on {A}rtificial {I}ntelligence and {S}oft {C}omputing ({ASC} 2006) 10th {I}nternational {C}onference on {A}rtificial {I}ntelligence and {S}oft {C}omputing }, publisher={{ACTA} {P}ress }, pages={28-33 }, address={{F}rance }, note={guerif:2006:asc }, audience={internationale }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00082488/en/}, } %% hal-00082064, version 1 %% http://hal.archives-ouvertes.fr/hal-00082064/en/ @inproceedings{GUERIF:2006:HAL-00082064:1, title={{C}onnectionist and {E}thological {A}pproaches for {D}iscovering {S}alient {F}acial {M}ovement {F}eatures in {H}uman {G}ender {R}ecognition}, author={{G}u{\'e}rif, {S}{\'e}bastien and {B}ennani, {Y}oun{\`e}s and {B}audoin, {C}laude}, abstract={{I}ndividual {F}acial movements signal various social information to other persons, like the gender of the sender. {W}e used an ethological and a connectionist approaches in order to detect these movements and their characteristics in men and in women. {B}ehavioural results indicate both qualitative and quantitative differences between men and women. {T}he connectionist approach involves similar and complementary conclusions. {T}he ethological study has been focused on the main movement differences as well as did the connectionist one but this last approach showed important differences between men and women in motionless events. {T}hese pilot results leads to a re-examination of behavioural events and a checking of lateralization of movements correlated with the gender.}, keywords={{F}acial movements; gender recognition; unsupervised learning, clustering; self-organizing maps}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{\'e}thologie exp{\'e}rimentale et compar{\'e}e - {LEEC} - {CNRS} : {UMR}7153 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceeding of the 28th {I}nternational {C}onference {I}nformation {T}echnology {I}nterfaces ({ITI} 2006) }, publisher={{IEEE} }, pages={189--194 }, note={guerif:2006:iti }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00082064/en/}, } %% hal-00148583, version 1 %% http://hal.archives-ouvertes.fr/hal-00148583/en/ @inproceedings{HAKEM:2006:HAL-00148583:1, title={{A} {B}i-objective {A}lgorithm for {S}cheduling {P}arallel {A}pplications on {H}eterogeneous {S}ystems {S}ubject to {F}ailures}, author={{H}akem, {M}ourad and {B}utelle, {F}ranck}, keywords={fiabilit{\'e}, tol{\'e}rance aux pannes, ordonnancement parall{\`e}le \& distribu{\'e}}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{R}en{P}ar2006 {R}en{P}ar2006 }, publisher={{R}en{P}ar2006 }, pages={25-35 }, address={{P}erpignan {F}rance }, audience={nationale }, day={03}, month={10}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00148583/en/}, } %% hal-00085232, version 1 %% http://hal.archives-ouvertes.fr/hal-00085232/en/ @inproceedings{KAROUI:2006:HAL-00085232:1, title={{COBRAS}: {C}ooperative {CBR} {S}ystem for {B}ibliographical {R}eference {R}ecommendation}, author={{K}aroui, {H}ager}, keywords={{CBR}, {R}ecommender system, {A}gent cooperation}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={8th {E}uropean {C}onference on {C}ase-{B}ased {R}easonning ({ECCBR}'06) }, publisher={{LNCS} }, pages={12 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085232/en/}, } %% hal-00091650, version 1 %% http://hal.archives-ouvertes.fr/hal-00091650/en/ @inproceedings{KAYSER:2006:HAL-00091650:1, title={{U}ne exp{\'e}rience de s{\'e}mantique inf{\'e}rentielle}, author={{K}ayser, {D}aniel and {N}ouioua, {F}arid}, abstract={{N}ous d{\'e}veloppons un syst{\`e}me qui doit {\^e}tre capable d'effectuer les m{\^e}mes inf{\'e}rences que le lecteur humain d'un constat d'accident de la route, et plus particuli{\`e}rement de d{\'e}terminer les causes apparentes de l'accident. {N}ous d{\'e}crivons les niveaux linguistiques et s{\'e}mantiques de l'analyse, et les r{\`e}gles d'inf{\'e}rence utilis{\'e}es par ce syst{\`e}me.}, keywords={s{\'e}mantique inf{\'e}rentielle; raisonnement non monotone; causalit{\'e}}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de la {C}onf{\'e}rence "{T}raitement {A}utomatique des {L}angues {N}aturelles" }, publisher={{P}resses {U}niversitaires de {L}ouvain }, pages={246-255 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00091650/en/}, } %% inria-00085808, version 1 %% http://hal.inria.fr/inria-00085808/en/ @inproceedings{KHEMMOUDJ:2006:INRIA-00085808:1, title={{I}nf{\'e}rence de cliques pour la r{\'e}solution de {M}ax-{CSP}}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {B}ennaceur, {H}achemi}, abstract={{P}eu de travaux sur les probl{\`e}mes {CSP}, {M}ax-{CSP} et {CSP} valu{\'e}s ont {\'e}t{\'e} r{\'e}alis{\'e}s dans le domaine de l'{O}ptimisation {C}ombinatoire alors que ce domaine ren- ferme de nombreux outils algorithmiques qui peuvent servir {\`a} la r{\'e}solution de ces probl{\`e}mes. {D}ans ce papier, nous d{\'e}crivons une technique d'inf{\'e}rence d'ensembles de cliques {\`a} partir du {M}ax-{CSP} que nous exploitons pour d{\'e}nir une nouvelle mod{\'e}lisation en {P}rogramma- tion {L}in{\'e}aire ({PL}) du {M}ax-{CSP}. {N}ous montrons que les estimations classiques du nombre minimum de con- traintes viol{\'e}es (bornes inf{\'e}rieures) bas{\'e}es sur la consis- tance d'arc telles que {DAC}[13], {RDAC}[8] et {WAC}[1] peu- vent {\^e}tre traduites par des relaxations duales {L}agrangien- nes du {PL}. {N}ous tirons aussi prot de cette mod{\'e}lisation pour d{\'e}velopper de nouvelles bornes inf{\'e}rieures. {D}ans un premier temps, an d'avoir une id{\'e}e sur la qualit{\'e} des bornes inf{\'e}rieures obtenues {\`a} partir du {PL}, nous avons {\'e}valu{\'e} la valeur de la relaxation continue du {PL} {\`a} l'aide du solveur {CPLEX}, puis nous avons d{\'e}velopp{\'e} une m{\'e}th- ode du type {B}ranch and {B}ound int{\'e}grant une relaxation {L}agrangienne du {PL}. {L}es r{\'e}sultats obtenus sont tr{\`e}s en- courageants et ouvrent de nouvelles perspectives {\`a} ex- ploiter au mieux les outils de la programmation lin{\'e}aire pour contribuer {\`a} la r{\'e}solution de ces probl{\`e}mes.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{D}euxi{\`e}mes {J}ourn{\'e}es {F}rancophones de {P}rogrammation par {C}ontraintes ({JFPC}06) }, address={{N}{\^i}mes - {E}cole des {M}ines d'{A}l{\`e}s / {F}rance }, audience={non sp{\'e}cifi{\'e}e }, year={2006}, URL={http://hal.inria.fr/inria-00085808/en/}, } %% hal-00084903, version 1 %% http://hal.archives-ouvertes.fr/hal-00084903/en/ @inproceedings{KHEMMOUDJ:2006:HAL-00084903:1, title={{C}lique {I}nference {P}rocess for {S}olving {M}ax-{CSP}}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {B}ennaceur, {H}achemi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{T}welfth international {C}onference on {P}rinciples and {P}ractice of {C}onstraint {P}rogramming }, publisher={{LNCS} }, pages={746-750 }, audience={non sp{\'e}cifi{\'e}e }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084903/en/}, } %% hal-00084902, version 1 %% http://hal.archives-ouvertes.fr/hal-00084902/en/ @inproceedings{KHEMMOUDJ:2006:HAL-00084902:1, title={{W}hen {C}onstraint {P}rogramming and {L}ocal {S}earch {S}olve {S}cheduling {P}roblem of {E}lecticit{\'e} de {F}rance {N}uclear {P}ower {P}lant {O}utages}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {P}orcheron, {M}arc and {B}ennaceur, {H}achemi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{T}welfh {I}nternational {C}onference on {P}rinciples and {P}ractices of {C}onstraint {P}rogramming {CP}'06 }, publisher={{LNCS} }, pages={271-283 }, audience={non sp{\'e}cifi{\'e}e }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084902/en/}, } %% hal-00080472, version 1 %% http://hal.archives-ouvertes.fr/hal-00080472/en/ @inproceedings{NAZARENKO:2006:HAL-00080472:1, title={{T}he {ALVIS} {F}ormat for {L}inguistically {A}nnotated {D}ocuments}, author={{N}azarenko, {A}deline and {A}lphonse, {E}rick and {D}erivi{\`e}re, {J}ulien and {H}amon, {T}hierry and {V}auvert, {G}uillaume and {W}eissenbacher, {D}avy}, abstract={{T}he paper describes the {ALVIS} annotation format designed for the indexing of large collections of documents in topic-specific search engines. {T}his paper is exemplified on the biological domain and on {M}ed{L}ine abstracts, as developing a specialized search engine for biologists is one of the {ALVIS} case studies. {T}he {ALVIS} principle for linguistic annotations is based on existing works and standard propositions. {W}e made the choice of stand-off annotations rather than inserted mark-up. {A}nnotations are encoded as {XML} elements which form the linguistic subsection of the document record.}, keywords={{N}atural language processing ; semantic annotation ; document annotation ;{XML} format}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the fifth international conference on {L}anguage {R}esources and {E}valuation, {LREC} 2006 }, publisher={{ELDA} }, pages={1782-1786 }, note={{H}.3.1 {STREP} project {ALVIS} (http://www.alvis.info) }, collaboration={{P}rojet {STREP} {ALVIS} }, ARXIVID={cs.AI/0609136 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00080472/en/}, } %% hal-00085151, version 1 %% http://hal.archives-ouvertes.fr/hal-00085151/en/ @inproceedings{NOUIOUA:2006:HAL-00085151:1, title={{U}ne exp{\'e}rience de s{\'e}mantique inf{\'e}rentielle}, author={{N}ouioua, {F}arid and {K}ayser, {D}aniel}, abstract={{W}e develop a system which must be able to perform the same inferences that a human reader of an accident report can do and more particularly to determine the apparent causes of the accident. {W}e describe the general framework in which we are situated, linguistic and semantic levels of the analysis and the inference rules used by the system.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de {TALN}'06 }, publisher={{UCL} {P}resses {U}niversitaires de {L}ouvain }, pages={246-255 }, ARXIVID={cs.AI/0610023 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085151/en/}, } %% hal-00082872, version 1 %% http://hal.archives-ouvertes.fr/hal-00082872/en/ @inproceedings{NZEUTCHAP:2006:HAL-00082872:1, title={{K}ostka numbers and littlewood -- richardson coefficients: {D}istributed computation}, author={{N}zeutchap, {J}anvier and {T}oumazet, {F}r{\'e}d{\'e}ric and {B}utelle, {F}ranck}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nstitut {G}aspard-{M}onge - {IGM} - {U}niversit{\'e} {P}aris-{E}st }, booktitle={{S}ymmetry, {S}pectroscopy and {S}chur ({P}roc. of {P}rof. {B}rian {G}. {W}ybourne {C}ommemorative {M}eeting) }, publisher={{N}icolaus {C}opernicus {U}niversity {P}ress }, pages={211-221 }, address={{P}ologne }, editor={{R}. {C}. {K}ing, {M}. {B}ylicki \& {J}. {K}arwowski }, audience={internationale }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00082872/en/}, } %% hal-00084192, version 1 %% http://hal.archives-ouvertes.fr/hal-00084192/en/ @inproceedings{PETRUCCI:2006:HAL-00084192:1, title={6th international conference on {A}pplication of {C}oncurrency to {S}ystems {D}esign}, author={{P}etrucci, {L}aure and {G}oossens, {K}ees}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {P}hilips {R}esearch - {P}hilips {R}esearch }, booktitle={{P}roceedings of {ACSD}'06 }, publisher={{IEEE} {C}omputer {S}ociety {P}ress }, pages={_ }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084192/en/}, } %% hal-00085166, version 1 %% http://hal.archives-ouvertes.fr/hal-00085166/en/ @inproceedings{POIBEAU:2006:HAL-00085166:1, title={{D}ealing with {M}etonymic {R}eadings of {N}amed {E}ntities}, author={{P}oibeau, {T}hierry}, abstract={{T}he aim of this paper is to propose a method for tagging named entities ({NE}), using natural language processing techniques. {B}eyond their literal meaning, named entities are frequently subject to metonymy. {W}e show the limits of current {NE} type hierarchies and detail a new proposal aiming at dynamically capturing the semantics of entities in context. {T}his model can analyze complex linguistic phenomena like metonymy, which are known to be difficult for natural language processing but crucial for most applications. {W}e present an implementation and some test using the {F}rench {ESTER} corpus and give significant results.}, keywords={{M}etonymy; {N}amed {E}ntities; {C}ategorization; {S}emantics; {N}atural {L}anguage {P}rocessing}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de {T}he 28th {A}nnual {C}onference of the {C}ognitive {S}cience {S}ociety ({C}og{S}ci 2006) {T}he 28th {A}nnual {C}onference of the {C}ognitive {S}cience {S}ociety ({C}og{S}ci 2006) }, publisher={{C}ognitive {S}cience {S}ociety }, pages={1962-1968 }, address={{V}ancouver {C}anada }, editor={{R}on {S}un }, note={http://www.cogsci.rpi.edu/{CSJ}archive/{P}roceedings/2006/docs/p1962.pdf }, audience={internationale }, ARXIVID={cs.AI/0607052 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085166/en/}, } %% hal-00082533, version 1 %% http://hal.archives-ouvertes.fr/hal-00082533/en/ @inproceedings{PYYSALO:2006:HAL-00082533:1, title={{L}exical {A}daptation of {L}ink {G}rammar to the {B}iomedical {S}ublanguage: a {C}omparative {E}valuation of {T}hree {A}pproaches}, author={{P}yysalo, {S}ampo and {S}alakoski, {T}apio and {A}ubin, {S}ophie and {N}azarenko, {A}deline}, abstract={{W}e study the adaptation of {L}ink {G}rammar {P}arser to the biomedical sublanguage with a focus on domain terms not found in a general parser lexicon. {U}sing two biomedical corpora, we implement and evaluate three approaches to addressing unknown words: automatic lexicon expansion, the use of morphological clues, and disambiguation using a part-of-speech tagger. {W}e evaluate each approach separately for its effect on parsing performance and consider combinations of these approaches. {I}n addition to a 45% increase in parsing efficiency, we find that the best approach, incorporating information from a domain part-of-speech tagger, offers a statistically signicant 10% relative decrease in error. {T}he adapted parser is available under an open-source license at http://www.it.utu.fi/biolg.}, keywords={{A}nalyse syntaxique; sous-language; adaptation}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {B}ioinformatics {L}aboratory - {T}urku {C}enter for {C}omputer {S}cience - {U}niversity of {T}urku }, booktitle={{P}roceedings of the {S}econd {I}nternational {S}ymposium on {S}emantic {M}ining in {B}iomedicine ({SMBM} 2006) }, publisher={{S}ophia {A}naniadou, {J}uliane {F}luck }, pages={60-67 }, ARXIVID={cs.CL/0606119 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00082533/en/}, } %% hal-00085237, version 1 %% http://hal.archives-ouvertes.fr/hal-00085237/en/ @inproceedings{RAVELOMANANA:2006:HAL-00085237:1, title={{C}reation and {G}rowth of {C}omponents in a {R}andom {H}ypergraph {P}rocess}, author={{R}avelomanana, {V}lady and {R}ijamame, {A}lphonse {L}aza}, abstract={{D}enote by an $\ell$-component a connected $b$-uniform hypergraph with $k$ edges and $k(b-1) - \ell$ vertices. {W}e prove that the expected number of creations of $\ell$-component during a random hypergraph process tends to $1$ as $\ell$ and $b$ tend to $\infty$ with the total number of vertices $n$ such that $\ell = o\left( \sqrt[3]{\frac{n}{b}} \right)$. {U}nder the same conditions, we also show that the expected number of vertices that ever belong to an $\ell$-component is approximately $12^{1/3} (b-1)^{1/3} \ell^{1/3} n^{2/3}$. {A}s an immediate consequence, it follows that with high probability the largest $\ell$-component during the process is of size ${O}( (b-1)^{1/3} \ell^{1/3} n^{2/3} )$. {O}ur results give insight about the size of giant components inside the phase transition of random hypergraphs.}, keywords={{R}andom hypergraphs; probabilistic/analytic combinatorics; asymptotic enumeration; extremal hypergraphs.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {D}{\'e}partement des math{\'e}matiques et informatique - {D}.{M}.{I} - {U}niversit{\'e} d'{A}ntananarivo }, booktitle={{P}roceedings of {T}he {T}welfth {A}nnual {I}nternational {C}omputing and {C}ombinatorics {C}onference ({COCOON}'06) -- {L}ecture {N}otes in {C}omputer {S}cience }, publisher={{S}pringer }, pages={{\`a} para{\^i}tre }, editor={{S}pringer }, note={{R}{\'e}sum{\'e} {\'e}tendu {G}.2.1, {G}.2.2, {G}.3 }, collaboration={{P}rojet de collaboration {P}aris {XIII} -- {U}niversit{\'e} d'{A}ntananarivo }, ARXIVID={cs.DS/0607059 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085237/en/}, } %% hal-00084612, version 1 %% http://hal.archives-ouvertes.fr/hal-00084612/en/ @inproceedings{TDOAN:2006:HAL-00084612:1, title={{A}n {E}nergy-{E}fficient {I}nitialization {A}lgorithm for {R}andom {R}adio {N}etworks}, author={{T}. {D}oan, {B}inh and {L}avault, {C}hristian and {O}lariu, {S}tephan and {R}avalomanana, {V}lady}, abstract={{A} radio network is a distributed system consisting of a large number of tiny sensors with low-power transceivers and no central controller. {O}ne of the most important problems in such networks is to minimize the energy consumption, and maximize the network lifetime. {I}n the initialization problem (also known as naming) each of the $n$ indistinguishable (anonymous) nodes in a given network is assigned a unique identifier, ranging from $1$ to $n$. {W}e consider a network where $n$ nodes (processors) are randomly deployed in a square (resp. a cube) ${X}$. {T}he network is assumed to be synchronous and the time to be slotted. {T}wo nodes can communicate only if they are at a distance of at most $r$ from each other ($r$ is the transmitting/receiving range). {M}oreover, if two or more neighbors of a processor $u$ are transmitting concurrently at the same time slot, $u$ cannot receive either of their messages (collision). {W}e suppose also $n$ and $|{X}|$ represent the only topological knowledge in each node. {T}o solve the initialization problem, we propose an energy-efficient randomized algorithm running in at most $\mathcal{{O}}\l(n^{3/4}\,\log{(n)}^{1/4}\r)$ time slots, with no station being awake for more than $\mathcal{{O}}\l(n^{1/4}\,\log{(n)}^{3/4}\r)$ time slots.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={4th {I}nternational {C}onference {R}esearch, {I}nnovation, and {V}ision for the {F}uture }, publisher={{RIVF}06 }, pages={121-139 }, audience={internationale }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084612/en/}, } %% hal-00085108, version 1 %% http://hal.archives-ouvertes.fr/hal-00085108/en/ @inproceedings{VIENNET:2006:HAL-00085108:1, title={{E}valuation de {T}echniques de {T}raitement des {R}efus{\'e}s pour l'{O}ctroi de {C}r{\'e}dit}, author={{V}iennet, {E}mmanuel and {F}ogelman {S}ouli{\'e}, {F}ran{\c{c}}oise and {R}ognier, {B}enoit}, abstract={{W}e present the problem of "{R}eject {I}nference" for credit acceptance. {B}ecause of the current legal framework ({B}asel {II}), credit institutions need to industrialize their processes for credit acceptance, including {R}eject {I}nference. {W}e present here a methodology to compare various techniques of {R}eject {I}nference and show that it is necessary, in the absence of real theoretical results, to be able to produce and compare models adapted to available data (selection of "best" model conditionnaly on data). {W}e describe some simulations run on a small data set to illustrate the approach and some strategies for choosing the control group, which is the only valid approach to {R}eject {I}nference.}, keywords={{D}ata mining, choix de mod{\`e}les, risque cr{\'e}dit.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {KXEN} - {KXEN} - {KXEN} }, booktitle={38i{\`e}mes {J}ourn{\'e}es de {S}tatistiques }, publisher={{S}oci{\'e}t{\'e} {F}ran{\c{c}}aise de {S}tatistiques }, pages={105 }, editor={{M}ichel {B}roniatowski }, ARXIVID={cs/0607048 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085108/en/}, } %% hal-00095189, version 1 %% http://hal.archives-ouvertes.fr/hal-00095189/en/ @inproceedings{WEISSENBACHER:2006:HAL-00095189:1, title={{B}ayesian {N}etwork, a model for {NLP}?}, author={{W}eissenbacher, {D}avy}, abstract={{T}he {NLP} systems often have low perfor- mances because they rely on unreliable and heterogeneous knowledge. {W}e show on the task of non-anaphoric it identi\&\#105;\&\#64257;- cation how to overcome these handicaps with the {B}ayesian {N}etwork ({BN}) formal- ism. {T}he \&\#32;\&\#64257;rst results are very encourag- ing compared with the state-of-the-art sys- tems.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {EACL}'06 }, publisher={{EACL} }, pages={195-198 }, collaboration={{ALVIS} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00095189/en/}, } %% hal-00094475, version 1 %% http://hal.archives-ouvertes.fr/hal-00094475/en/ @inproceedings{ZARGAYOUNA:2006:HAL-00094475:1, title={{L}ite{M}ap: {A}n {O}ntology {M}apping {A}pproach for {M}obile {A}gents' {C}ontext-{A}wareness}, author={{Z}argayouna, {H}aifa and {A}mara, {N}ejla}, abstract={{M}obile agents' applications have to operate within environments having continuously changing execution conditions that are not easily predictable. {T}hey have to dynamically adapt to changes in their context resulting from other's activities and resources variation. {T}o be aware of their execution context, mobile agents require a formal and structured model of the context and a reasoning process for detecting suspect situations. {I}n this work, we use formal ontologies to model the agents' execution context as well as its composing elements. {A}fter each agent migration, a reasoning process is carried out upon these ontologies to detect meaningful environmental changes. {T}his reasoning is based on semantic web techniques for mapping ontologies. {T}he output of the mapping process is a set of semantic relations among the ontologies concepts that will be used by the agent to trigger a reconfiguration of its structure according to some adaptation policies.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{OTM} {W}orkshops 2006 {I}nternational {W}orkshop on {C}ontext-{A}ware {M}obile {S}ystems }, publisher={{LNCS} 4278 }, pages={1934-1943 }, address={{M}ontpellier {F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00094475/en/}, } %% hal-00098036, version 1 %% http://hal.archives-ouvertes.fr/hal-00098036/en/ @inproceedings{AITELMEKKI:2005:HAL-00098036:1, title={{U}sing {NLP} to build the hypertextuel network of a back-of-the-book index}, author={{A}{\"i}t {E}l {M}ekki, {T}ouria and {N}azarenko, {A}deline}, abstract={{R}elying on the idea that back-of-the-book indexes are traditional devices for navigation through large documents, we have developed a method to build a hypertextual network that helps the navigation in a document. {B}uilding such an hypertextual network requires selecting a list of descriptors, identifying the relevant text segments to associate with each descriptor and finally ranking the descriptors and reference segments by relevance order. {W}e propose a specific document segmentation method and a relevance measure for information ranking. {T}he algorithms are tested on 4 corpora (of different types and domains) without human intervention or any semantic knowledge.}, keywords={{N}atural {L}anguage {P}rocessing ; indexing}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{E}tude et de {R}echerche en {I}nformatique d'{A}ngers - {LERIA} - {U}niversit{\'e} d'{A}ngers }, booktitle={{P}roceedings of the {I}nternational {C}onference on {R}ecent {A}dvances in {N}atural {L}anguage {P}rocessing ({RANLP}) }, publisher={{I}nstitute for {P}arallel {P}rocessing, {B}ulgarian {A}cademy of {S}ciences }, pages={316-320 }, note={{H}.3.1 }, ARXIVID={cs.AI/0609134 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00098036/en/}, } %% hal-00153970, version 1 %% http://hal.archives-ouvertes.fr/hal-00153970/en/ @inproceedings{ASEERVATHAM:2005:HAL-00153970:1, title={{M}ining short sequential patterns for hepatitis type detection}, author={{A}seervatham, {S}ujeevan and {O}smani, {A}omar}, abstract={{T}his paper presents the framework we have developed to classify patients according to the type of hepatitis. {T}o detect the type of virus, once the data have been prepared and encoded in a suitable way, we have extracted the sequential patterns for each virus. {T}empo- ral dierences between hepatitis {B} and {C} can then be seen as patterns that are frequent in one data series and infrequent in the other. {T}he {B} virus and {C} virus patterns, extracted under specic constraints, were used to classify patients according to the hepatitis virus. {I}n this work, we especially studied the use of very short patterns for virus type detec- tion. {H}owever, the framework allows the mining and the use of longer patterns.{T}he results have shown that in more than half of cases, short patterns can reveal the type of virus with a low level of errors.}, keywords={{S}equence {M}ining}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {ECML}/{PKDD} 2005 {D}iscovery {C}hallenge {ECML}/{PKDD} 2005 - {D}iscovery {C}hallenge {W}orkshop }, publisher={{S}pringer }, pages={6 }, address={{P}ortugal }, editor={{P}. {B}erka and {B}. {C}r{\'e}milleux }, audience={internationale }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00153970/en/}, } %% hal-00082542, version 1 %% http://hal.archives-ouvertes.fr/hal-00082542/en/ @inproceedings{AUBIN:2005:HAL-00082542:1, title={{A}dapting a general parser to a sublanguage}, author={{A}ubin, {S}ophie and {N}azarenko, {A}deline and {N}{\'e}dellec, {C}laire}, abstract={{I}n this paper, we propose a method to adapt a general parser ({L}ink {P}arser) to sublanguages, focusing on the parsing of texts in biology. {O}ur main proposal is the use of terminology (identication and analysis of terms) in order to reduce the complexity of the text to be parsed. {S}everal other strategies are explored and finally combined among which text normalization, lexicon and morpho-guessing module extensions and grammar rules adaptation. {W}e compare the parsing results before and after these adaptations.}, keywords={{A}nalyse syntaxique, adaptation, sous-language}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} }, booktitle={{P}roceedings of the {I}nternational {C}onference on {R}ecent {A}dvances in {N}atural {L}anguage {P}rocessing ({RANLP}'05) }, publisher={{INCOMA} {L}td. }, pages={89-93 }, editor={{G}. {A}ngelova, {K}. {B}ontcheva, {R}. {M}itkov, {N}. {N}icolov, {N}. {N}ikolov }, note={{H}.4 }, ARXIVID={cs.CL/0606118 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00082542/en/}, } %% hal-00084629, version 1 %% http://hal.archives-ouvertes.fr/hal-00084629/en/ @inproceedings{BAILLOT:2005:HAL-00084629:1, title={{A} feasible algorithm for typing in {E}lementary {A}ffine {L}ogic.}, author={{B}aillot, {P}atrick and {T}erui, {K}azushige}, abstract={{W}e give a new type inference algorithm for typing lambda-terms in {E}lementary {A}ffine {L}ogic ({EAL}), which is motivated by applications to complexity and optimal reduction. {F}ollowing previous references on this topic, the variant of {EAL} type system we consider (denoted {EAL}*) is a variant where sharing is restricted to variables and without polymorphism. {O}ur algorithm improves over the ones already known in that it offers a better complexity bound: if a simple type derivation for the term t is given our algorithm performs {EAL}* type inference in polynomial time in the size of the derivation.}, keywords={lambda-calculus; linear logic; elementary linear logic; type inference; elementary complexity}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {N}ational {I}nstitute of {I}nformatics - {NII} - {N}ational {I}nstitute of {I}nformatics }, booktitle={7th {I}nternational {C}onference on {T}yped {L}ambda {C}alculi and {A}pplications ({TLCA} 2005) }, publisher={{S}pringer }, pages={55-70 }, editor={{P}awel {U}rzyczyn }, series={volume 3461 of {LNCS} }, note={{ACI} ({NIM}) {GEOCAL}, {ACI} ({SI}) {CRISS}. }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084629/en/}, } %% hal-00088074, version 1 %% http://hal.archives-ouvertes.fr/hal-00088074/en/ @inproceedings{CZACHORSKI:2005:HAL-00088074:1, title={{A} diffusion approximation model of an electronic-optical node}, author={{C}zachorski, {T}adeusz and {P}ekergin, {F}erhan}, abstract={{D}esigning of smart edge routers and shaping the self-similar traffic in optical switched networks arise recently a lot of interest. {H}ere, we propose an analytical approach which we consider useful in modelling and dimensioning of buffers in the edge routers between electronic and optical networks. {W}e study a single buffer where packets of various sizes, classified by the class of service and the destination, are stored to build an optical packet of a fixed size. {W}e already studied this problem with the use of simulation model, remarking that self-similar traffic at the entrance of such a buffer remains self-similar when leaving it. {N}ow we are building analytical model based on diffusion approximation. and our previous contributions to this approach, i.e. a method to solve transient diffusion models. {T}he model is used to analyse the process of buffer filling and a a numerical example proves that this approach may give reasonable results in relatively short (compared to simulation, especially simulation of transient states) time.}, keywords={{A}ll-optical networks; diffusion approximation}, language={{A}nglais}, affiliation={{I}nstytut {I}nformatyki {T}eoretycznej i {S}tosowanej {P}olskiej {A}kademii {N}auk - {IITIS} {PAN} - {P}olska {A}kademia {N}auk - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {F}ormal {T}echniques for {C}omputer {S}ystems and {B}usiness {P}rocesses: {E}uropean {P}erformance {E}ngineering {W}orkshop, {EPEW} 2005 and {I}nternational {W}orkshop on {W}eb {S}ervices and {F}ormal {M}ethods", {WS}-{FM} 2005, {L}ecture {N}otes in {C}omputer {S}cience 3670/2005 }, publisher={{S}pringer {V}erlag }, pages={187-199 }, editor={{M}. {B}ravetti, {L}. {K}loul, {G}. {Z}avattaro }, note={{I}.6.5 }, collaboration={{P}rojet de coop{\'e}ration {CNRS} - {PAN} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00088074/en/}, } %% hal-00089086, version 1 %% http://hal.archives-ouvertes.fr/hal-00089086/en/ @inproceedings{DESPRES:2005:HAL-00089086:1, title={{M}erging of {L}egal {M}icro-{O}ntologies from {E}uropean {D}irectives}, author={{D}espr{\'e}s, {S}ylvie and {S}zulman, {S}ylvie}, abstract={{T}his paper describes the contruction method of an application legal ontology. {T}his method is based on the merging of micro-ontologies built from {E}uropean community directives. {TERMINAE} construction method from texts enhanced by an alignment process with core legal ontology is used for building the micro-ontologies. {A} merging process permits the legal ontology construction.}, keywords={micro-ontology; legal ontology; building ontology from texts}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{LOAIT} - {L}egal {O}ntologies and {A}rtificial {I}ntelligences {T}echniques }, publisher={{IAAIL} {W}orkshop series }, pages={149-155 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00089086/en/}, } %% hal-00089084, version 1 %% http://hal.archives-ouvertes.fr/hal-00089084/en/ @inproceedings{DESPRES:2005:HAL-00089084:1, title={{C}onstruction d'une ontologie du droit documentaire}, author={{D}espr{\'e}s, {S}ylvie and {S}zulman, {S}ylvie}, abstract={{C}e papier d{\'e}crit une m{\'e}thode de construction d'une ontologie du droit communautaire. {L}a m{\'e}thode repose sur la construction de micro-ontologies {\`a} partir de directives du droit communautaire en utilisant la m{\'e}thode {T}erminae augment{\'e}e d'un processus d'alignement sur une ontologie g{\'e}n{\'e}rique du droit. {L}'ontologie est ensuite {\'e}labor{\'e}e {\`a} l'aide d'un processus de fusion de micro-ontologies.}, keywords={construction d'ontologie {\`a} partir de textes; alignement et fusion d'ontologie; droit communautaire}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{IC}'2005 }, publisher={{P}resses {U}niversitaires de {G}renoble }, pages={85-96 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00089084/en/}, } %% inria-00000831, version 1 %% http://hal.inria.fr/inria-00000831/en/ @inproceedings{DORRA:2005:INRIA-00000831:1, title={{I}nt{\'e}gration d'un agent mobile dans un {S}yst{\`e}me multi-agent hi{\'e}rarchique}, author={{D}orra, {M}aghri and {N}ejla, {A}mara}, abstract={{D}ans cet article, nous pr{\'e}sentons une d{\'e}marche pour l'int{\'e}gration d'un agent mobile {\`a} base de composants dans un {S}yst{\`e}me {M}ulti-{A}gents ({SMA}) {\`a} structure hi{\'e}rarchique. {L}a solution propos{\'e}e permet une int{\'e}gration « ouverte » qui l{\`e}ve la contrainte de structure commune entre l'agent et les agents du {SMA} qui va l'accueillir. {P}our ce faire, nous proposons,en premier lieu, la mise en place d'un nouveau composant qui refl{\`e}te d'un c{\^o}t{\'e} l'agent et la structure particuli{\`e}re du {SMA} et en second lieu, des primitives que l'agent devra ex{\'e}cuter apr{\`e}s la migration.}, keywords={agent mobile, syst{\`e}me multi-agents hi{\'e}rarchique, int{\'e}gration.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}niversit{\'e} {P}aris-{D}auphine - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} }, booktitle={{M}ajec{STIC} 2005 : {M}anifestation des {J}eunes {C}hercheurs francophones dans les domaines des {STIC} }, pages={426-429 }, address={{R}ennes }, editor={{A}lexandre {V}autier, {S}ylvie {S}aget }, audience={non sp{\'e}cifi{\'e}e }, day={16}, month={11}, year={2005}, URL={http://hal.inria.fr/inria-00000831/en/}, } %% hal-00012927, version 1 %% http://hal.archives-ouvertes.fr/hal-00012927/en/ @inproceedings{GHNEMAT:2005:HAL-00012927:1, title={{A}utomata-based adaptive behavior for economic modeling using game theory}, author={{G}hnemat, {R}awan and {K}hatatneh, {K}halaf and {O}qeili, {S}aleh and {B}ertelle, {C}yrille and {D}uchamp, {G}{\'e}rard}, abstract={{I}n this paper, we deal with some specific domains of applications to game theory. {T}his is one of the major class of models in the new approaches of modelling in the economic domain. {F}or that, we use genetic automata which allow to buid adaptive strategies for the players. {W}e explain how the automata-based formalism proposed - matrix representation of automata with multiplicities - allows to define a semi-distance between the strategy behaviors. {W}ith that tools, we are able to generate an automatic processus to compute emergent systems of entities whose behaviors are represented by these genetic automata.}, keywords={efficient algebraic structures; efficient data structures; semirings; automata; multiagent systems; complex systems; game theory}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique du {H}avre - {LIH} - {U}niversit{\'e} du {H}avre - {I}nformation {T}echnology - {IT} - {A}l-{B}alqa'{A}pplied {U}niversity - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{EPNADS}'05 within {ECCS}'05 {E}mergent {P}roperties in {N}atural and {A}rtificial {D}ynamical {S}ystems }, pages={99-105 }, address={{P}aris {F}rance }, editor={{U}niversit{\'e} du {H}avre }, audience={internationale }, ARXIVID={cs.MA/0510089 }, day={17}, month={11}, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00012927/en/}, } %% hal-00082875, version 1 %% http://hal.archives-ouvertes.fr/hal-00082875/en/ @inproceedings{HAKEM:2005:HAL-00082875:1, title={{D}ynamic {C}ritical {P}ath {S}cheduling {P}arallel {P}rograms onto {M}ultiprocessors}, author={{H}akem, {M}ourad and {B}utelle, {F}ranck}, abstract={{I}n this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is called {T}he {D}ynamic {C}ritical {P}ath {S}cheduling {DCPS}. {T}he {DCPS} is superior to several other algorithms from the literature in terms of computational complexity, processors consumption and solution quality. {DCPS} has a time complexity of {O}(e + vlog v), as opposed to {DSC} algorithm {O}((e + v)log v) which is the best known algorithm.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roc. of the 19th {ACM}/{IEEE} {I}nternational {P}arallel \& {D}istributed {P}rocessing {S}ymposium ({IPDPS}'05 -- {APDCM}'05) }, publisher={{IEEE} {C}omputer {S}ociety {P}ress }, pages={203b }, note={10 pages }, audience={internationale }, doi={10.1109/{IPDPS}.2005.175 }, year={2005}, URL={dx.doi.org/10.1109/{IPDPS}.2005.175 http://hal.archives-ouvertes.fr/hal-00082875/en/}, } %% hal-00082769, version 1 %% http://hal.archives-ouvertes.fr/hal-00082769/en/ @inproceedings{HAKEM:2005:HAL-00082769:1, title={{E}fficient {C}ritical {T}ask {S}cheduling {P}arallel {P}rograms on a {B}ounded {N}umber of {P}rocessors}, author={{H}akem, {M}ourad and {B}utelle, {F}ranck}, abstract={{I}n this paper, we present an eff\&\#102;\&\#64257;cient algorithm for compile time scheduling of parallel programs on a bounded num ber of processors system with distributed memory. {O}ur algorithm ({CTS} {C}ritical {T}ask {S}cheduling) is a greedy list scheduling heuristics based on attribute priority called {T}ask {C}riticalness wich provides a good measure of the task im portance. {CTS} has a time complexity of {O}(ep + v log v) which is better than all the others scheduling algorithms to our knowledge. {E}xperimental results also demonstrate the superiority of {CTS} over the other algorithms in terms of speed and solution quality.}, keywords={scheduling, clustering, distributed computing, precedence task graphs, directed acyclic graphs {DAG}s, parallel scheduling.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roc. of the 17th {I}nternational {C}onference on {P}arallel and {D}istributed {C}omputing and {S}ystems }, publisher={{A}cta{P}ress }, pages={139-144 }, series={{A}cta{P}ress }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00082769/en/}, } %% hal-00084987, version 1 %% http://hal.archives-ouvertes.fr/hal-00084987/en/ @inproceedings{HAMDOUN:2005:HAL-00084987:1, title={{B}uilding a data warehouse using heterogeneous data sources}, author={{H}amdoun, {S}ana and {B}oufares, {F}aouzi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={proceedings of the international conference: {S}ciences of {E}lectronic, {T}echnologies of {I}nformation and {T}elecommunications ({SETIT}'05) }, publisher={x }, pages={x }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084987/en/}, } %% hal-00084984, version 1 %% http://hal.archives-ouvertes.fr/hal-00084984/en/ @inproceedings{HAMDOUN:2005:HAL-00084984:1, title={{R}elationships between attributes to integrate heterogeneous data sources: an {SQL} {M}ethodology}, author={{H}amdoun, {S}ana and {B}oufares, {F}aouzi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={proceedings of the {I}nternational {C}onference on {S}oftware {E}ngineering ({IASTED}'05) on {D}atabases and applications ({DBA}2005) }, publisher={x }, pages={x }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084984/en/}, } %% hal-00084844, version 1 %% http://hal.archives-ouvertes.fr/hal-00084844/en/ @inproceedings{HAMON:2005:HAL-00084844:1, title={{I}ndexer les documents sp{\'e}cialis{\'e}s : les ressources terminologiques contr{\^o}l{\'e}es sont-elles suffisantes ?}, author={{H}amon, {T}hierry}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de {T}erminologie et {I}ntelligence {A}rtificielle 2005 }, publisher={{PUR} }, pages={71-82 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084844/en/}, } %% hal-00153302, version 1 %% http://hal.archives-ouvertes.fr/hal-00153302/en/ @inproceedings{KHEMMOUDJ:2005:HAL-00153302:1, title={{U}sing {C}onstraint {P}rogramming for {S}cheduling of {E}lecticit{\'e} de {F}rance {N}uclear {P}ower {P}lant {O}utages}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {P}orcheron, {M}arc}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{I}nternational workshop on {O}ptimization {F}rameworks for {I}ndustrial {A}pplications {I}nternational workshop on {O}ptimization {F}rameworks for {I}ndustrial {A}pplications }, publisher={- }, pages={- }, audience={non sp{\'e}cifi{\'e}e }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00153302/en/}, } %% hal-00153301, version 1 %% http://hal.archives-ouvertes.fr/hal-00153301/en/ @inproceedings{KHEMMOUDJ:2005:HAL-00153301:1, title={{U}sing {C}onstraint {P}rogramming and {L}ocal {S}earch for {S}cheduling of {E}lecticit{\'e} de {F}rance {N}uclear {P}ower {P}lant {O}utages}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {P}orcheron, {M}arc and {B}ennaceur, {H}achemi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{I}nternational workshop on combination of metaheuristic and local search with constraint programming techniques {I}nternational workshop on combination of metaheuristic and local search with constraint programming techniques }, publisher={- }, pages={- }, audience={non sp{\'e}cifi{\'e}e }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00153301/en/}, } %% hal-00153291, version 1 %% http://hal.archives-ouvertes.fr/hal-00153291/en/ @inproceedings{KHEMMOUDJ:2005:HAL-00153291:1, title={{A}pplication de la {P}rogrammation {L}ogique {P}ar {C}ontraintes au probl{\`e}me de placement des arr{\^e}ts des r{\'e}acteurs nucl{\'e}aires d'{EDF}}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {P}orcheron, {M}arc and {B}ennaceur, {H}achemi}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={7th {I}nternational {S}ymposium on programming and {S}ystems {I}nternational {S}ymposium on programming and {S}ystems }, publisher={- }, pages={-- }, audience={non sp{\'e}cifi{\'e}e }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00153291/en/}, } %% hal-00153285, version 1 %% http://hal.archives-ouvertes.fr/hal-00153285/en/ @inproceedings{KHEMMOUDJ:2005:HAL-00153285:1, title={{C}ombining {A}rc-{C}onsistency and {D}ual {L}agrangean {R}elaxation for {F}iltering {CSP}s}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {B}ennaceur, {H}achemi and {N}agih, {A}nass}, abstract={{T}his paper presents a {CSP}s filtering method combining arc-consistency and dual {L}agrangean relaxation techniques. {F}irst, we model the constraint satisfaction problem as a 0/1 linear integer program ({IP}); then, the consistency of a value is defined as an optimization problem on which a dual {L}agrangean relaxation is defined. {W}hile solving the dual {L}agrangean relaxation, values inconsistencies may be detected (dual {L}agrangean inconsistent values); the constraint propagation of this inconsistency can be performed by arc-consistency. {A}fter having made the {CSP} arc-consistent, the process iteratively selects values of variables which may be dual {L}agrangean inconsistent. {C}omputational experiments performed over randomly generated problems show the advantages of the hybrid filtering technique combining arc-consistency and dual {L}agrangean relaxation.}, keywords={{A}rc-{C}onsistency, {L}agrangean {R}elaxation, {S}ubgradient {A}lgorithm.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{I}ntegration of {AI} and {OR} {T}echniques in {C}onstraint {P}rogramming for {C}ombinatorial {O}ptimization {P}roblems {I}ntegration of {AI} and {OR} {T}echniques in {C}onstraint {P}rogramming for {C}ombinatorial {O}ptimization {P}roblems }, publisher={{LNCS} }, pages={258-272 }, audience={non sp{\'e}cifi{\'e}e }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00153285/en/}, } %% inria-00000068, version 1 %% http://hal.inria.fr/inria-00000068/en/ @inproceedings{KHEMMOUDJ:2005:INRIA-00000068:1, title={{R}{\'e}solution de {M}ax-{CSP} par {R}echerche {L}ocale guid{\'e}e par la {R}elaxation {L}agrangienne}, author={{K}hemmoudj, {M}ohand {O}u {I}dir and {D}jerourou, {F}ay{\c{c}}al and {B}annaceur, {H}achemi}, abstract={{N}ous proposons dans cet article une nouvelle m{\'e}thode de recherche locale pour la r{\'e}solution de {M}ax-{CSP}. {E}lle combine l'heuristique inconflict et la relaxation {L}agrangienne. {L}a relaxation {L}agrangienne guide la recherche vers les r{\'e}gions prometteuses de l'espace tandis que l'heuristique inconflict explore les voisinages de ces derni{\`e}res. {L}es exp{\'e}rimentations pr{\'e}liminaires de notre technique ont donn{\'e} de bons r{\'e}sultats sur des instances al{\'e}atoires de {M}ax-{CSP}.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}remi{\`e}res {J}ourn{\'e}es {F}rancophones de {P}rogrammation par {C}ontraintes }, publisher={{U}niversit{\'e} d'{A}rtois }, pages={305-314 }, address={{L}ens }, editor={{C}hristine {S}olnon }, note={http://www710.univ-lyon1.fr/~csolnon }, audience={non sp{\'e}cifi{\'e}e }, day={08}, month={06}, year={2005}, URL={http://hal.inria.fr/inria-00000068/en/}, } %% hal-00154174, version 1 %% http://hal.archives-ouvertes.fr/hal-00154174/en/ @inproceedings{MARCOS:2005:HAL-00154174:1, title={{U}ne approche de mod{\'e}lisation g{\'e}n{\'e}rique pour la gestion des locomotives fr{\^e}t {\`a} la {SNCF}}, author={{M}arcos, {N}icolas and {D}e {A}lmeida, {D}avid and {G}auyacq, {D}aniel and {A}lfandari, {L}aurent and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={- {ROADEF} 2005 }, publisher={- }, pages={- }, address={{T}ours {F}rance }, audience={nationale }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00154174/en/}, } %% hal-00084350, version 1 %% http://hal.archives-ouvertes.fr/hal-00084350/en/ @inproceedings{MARCOS:2005:HAL-00084350:1, title={{U}n outil g{\'e}n{\'e}rique d'aide {\`a} la d{\'e}cision pour la gestion des locomotives fret {\`a} la {SNCF}}, author={{M}arcos, {N}icolas and {D}e {A}lmeida, {D}avid and {G}auyacq, {D}aniel and {Q}uivet, {A}lexandre and {N}agih, {A}nass and {A}lfandari, {L}aurent and {P}lateau, {G}{\'e}rard}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {D}irection de la {R}echerche et de la {T}echnologie-{SNCF} - {SNCF} }, booktitle={{ROADEF}'05 6{\`e}me congr{\`e}s de la {S}oci{\'e}t{\'e} {F}ran{\c{c}}aise de recherche {O}p{\'e}rationnelle et d'{A}ide {\`a} la {D}{\'e}cision }, publisher={{P}resses {U}niversitaires {F}ran{\c{c}}ois {R}abelais }, pages={{PP}. 295-312 }, editor={{J}ean-{C}harles {B}illaut et {C}arl {E}sswein }, series={{C}ollection {S}ciences, {T}echnologies "informatique" no 1 }, note={{OCAD} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084350/en/}, } %% hal-00017259, version 1 %% http://hal.archives-ouvertes.fr/hal-00017259/en/ @inproceedings{MONNOT:2005:HAL-00017259:1, title={{A}pproximation results for the weighted {P}4 partition problem}, author={{M}onnot, {J}{\'e}r{\^o}me and {T}oulouse, {S}ophie}, abstract={{W}e present several new standard and differential approximation results for the {P}4-partition problem using the {H}assin and {R}ubinstein' algorithm ({I}nformation {P}rocessing {L}etters, 63: 63-67, 1997). {T}hose results concern both minimization and maximization versions of the problem. {H}owever, the main point of this paper lies on the establishment it does of the robustness of this algorithm, in the sense that this latter provides good quality solutions, whatever version of the problem is addressed, whatever approximation framework is considered in order to evaluate the approximate solutions.}, keywords={graph partitioning; {P}4-packing; approximation algorithms; performance ratio; standard approximation; differential approximation}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} }, booktitle={{F}oundamentals of {C}omputation {T}heory {FCT}' 2005 {T}he symposia on {F}undamentals of {C}omputation {T}heory }, publisher={{S}pringer {V}erlag }, pages={388-396 }, address={{A}llemagne }, editor={{LNCS} 3623 }, audience={internationale }, doi={10.1007/11537311_34 }, year={2005}, URL={dx.doi.org/10.1007/11537311_34 http://hal.archives-ouvertes.fr/hal-00017259/en/}, } %% hal-00017258, version 1 %% http://hal.archives-ouvertes.fr/hal-00017258/en/ @inproceedings{MONNOT:2005:HAL-00017258:1, title={{T}he complexity of the {P}k partition problem and related problems in bipartite graphs}, author={{M}onnot, {J}{\'e}r{\^o}me and {T}oulouse, {S}ophie}, abstract={{I}n this paper, we continue the investigation made in [{MT}05] about the approximability of {P}k partition problems, but focusing here on their complexity. {P}recisely, we aim at designing the frontier between polynomial and {NP}-complete versions of the {P}k partition problem in bipartite graphs, according to both the constant k and the maximum degree of the input graph. {W}e actually extend the obtained results to more general classes of problems, namely, the minimum k-path partition problem and the maximum {P}k packing problem. {M}oreover, we propose some simple approximation algorithms for those problems.}, keywords={{P}k-partition; maximum (weighted) {P}k-packing; minimum k-path partition; bipartite graphs; {NP}-completeness; approximation algorithms}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} }, booktitle={{P}roc. of {AACC} 2005 }, publisher={{I}mperial {C}ollege {P}ress }, pages={-- }, audience={non sp{\'e}cifi{\'e}e }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00017258/en/}, } %% hal-00084841, version 1 %% http://hal.archives-ouvertes.fr/hal-00084841/en/ @inproceedings{NINOVA:2005:HAL-00084841:1, title={{C}omment mesurer la couverture d'une ressource terminologique pour un corpus ?}, author={{N}inova, {G}oritsa and {N}azarenko, {A}deline and {H}amon, {T}hierry and {S}zulman, {S}ylvie}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de {TALN} 2005 }, publisher={{ATALA} }, pages={293-302 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084841/en/}, } %% hal-00085163, version 1 %% http://hal.archives-ouvertes.fr/hal-00085163/en/ @inproceedings{NOUIOUA:2005:HAL-00085163:1, title={{R}aisonnement stratifi{\'e} {\`a} base de normes pour inf{\'e}rer les causes dans un corpus textuel}, author={{N}ouioua, {F}arid}, abstract={{T}o understand texts written in natural language ({LN}), we use our knowledge about the norms of the domain. {N}orms allow to infer more implicit information from the text. {T}his kind of information can, in general, be defeasible, but it remains useful and acceptable while the text do not contradict it explicitly. {I}n this paper we describe a non-monotonic reasoning system based on the norms of the car crash domain. {T}he system infers the cause of an accident from its textual description. {T}he cause of an accident is seen as the most specific norm which has been violated. {T}he predicates and the rules of the system are stratified: organized on layers in order to obtain an efficient reasoning.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{T}he {S}eventh {I}nternational {S}ymposium {O}n {P}rogramming and {S}ystems }, publisher={{USTHB} d'{A}lger }, pages={81-92 }, ARXIVID={cs.AI/0610018 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00085163/en/}, } %% hal-00085160, version 1 %% http://hal.archives-ouvertes.fr/hal-00085160/en/ @inproceedings{NOUIOUA:2005:HAL-00085160:1, title={{W}hy did the accident happen? {A} norm-based reasoning approach}, author={{N}ouioua, {F}arid}, abstract={{I}n this paper we describe an architecture of a system that answer the question : {W}hy did the accident happen? from the textual description of an accident. {W}e present briefly the different parts of the architecture and then we describe with more detail the semantic part of the system i.e. the part in which the norm-based reasoning is performed on the explicit knowlege extracted from the text.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{L}ogical {A}spects of {C}omputational {L}inguistics, student session }, publisher={{U}niversit{\'e} de bordeaux }, pages={31-34 }, ARXIVID={cs.AI/0610015 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00085160/en/}, } %% hal-00084616, version 1 %% http://hal.archives-ouvertes.fr/hal-00084616/en/ @inproceedings{PAILLARD:2005:HAL-00084616:1, title={{A} distributed prime sieving algorithm based on {SMER}}, author={{P}aillard, {G}abriel and {L}avault, {C}hristian and {F}ranca, {F}elipe}, abstract={{I}n this article, we propose a fully distributed algorithm for finding all primes in an given interval $[2..n]$ (or $({L},{R})$, more generally), based on the {SMER} (\textit{{S}cheduling by {M}ultiple {E}dge {R}eversal}) multigraph dynamics. {G}iven a multigraph $\mathcal{{M}}$ of arbitrary topology, having ${N}$ nodes, the {SMER}-driven system is defined by the number of directed edges (arcs) between any two nodes of $\mathcal{{M}}$, and by the global period length of all ``arc reversals'' in $\mathcal{{M}}$. {I}n the domain of prime numbers generation, such a graph method shows quite elegant, and it also yields a totally new kind of distributed prime sieving algorithms of an entirely original design. {T}he maximum number of steps required by the algorithm is at most $n + \sqrt{n}$. {A}lthough far beyond the ${O}(n/\log\log n)$ steps required by the improved sequential ``wheel sieve'' algorithms, our {SMER}-based algorithm is fully distributed and of linear (step) complexity. {T}he message complexity of the algorithm is at most $n\{D}elta_{N} + \sqrt{n} \{D}elta_{N}$, where $\{D}elta_{N}$ denotes the maximum ``multidegree'' of the arbitrary multigraph $\mathcal{{M}}$, and the space required per process is linear.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {P}rograma de {E}ngenharia de {S}istemas e {C}omputa{\c{c}}{\~a}o - {PESC} - {U}niversidade {F}ederal de {R}io de {J}aneiro }, booktitle={4th {I}nternational {S}ymposium on {P}arallel and {D}istributed {C}omputing ({ISPDC}'2005) }, publisher={{ISPDC} }, pages={139-146 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084616/en/}, } %% hal-00077380, version 1 %% http://hal.archives-ouvertes.fr/hal-00077380/en/ @inproceedings{PISANTI:2005:HAL-00077380:1, title={{I}ncremental {I}nference of {R}elational {M}otifs with a {D}egenerate {A}lphabet}, author={{P}isanti, {N}adia and {S}oldano, {H}enry and {C}arpentier, {M}athilde}, keywords={{I}nformatique th{\'e}orique (algorithmique)}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{C}ombinatorial {P}attern {M}atching ({CPM}) }, publisher={{S}pringer-{V}erlag {LNCS} 3537 }, pages={229 - 240 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00077380/en/}, } %% hal-00005508, version 1 %% http://hal.archives-ouvertes.fr/hal-00005508/en/ @inproceedings{POIBEAU:2005:HAL-00005508:1, title={{P}arcours interpr{\'e}tatifs et terminologie}, author={{P}oibeau, {T}hierry}, abstract={{C}et article esquisse quelques r{\'e}flexions li{\'e}es au renouveau de l'analyse terminologique de ces derni{\`e}res ann{\'e}es. {A}lors que l'analyse reposait auparavant essentiellement sur les connaissances d'experts du domaine, la linguistique textuelle a propos{\'e} un nouveau cadre pour l'acquisition de terminologie. {C}ette {\'e}volution renouvelle la r{\'e}flexion sur le statut des connaissances obtenues et mod{\'e}lis{\'e}es : en quoi la langue rend-elle compte de la notion de domaine ? {Q}uelle est la relation entre terminologie et monde physique ? {L}e terme a-t-il une dimension r{\'e}f{\'e}rentielle ? {N}ous proposons quelques pistes de r{\'e}flexion, en nous inspirant largement des travaux th{\'e}oriques r{\'e}cents dans le domaine.}, keywords={{L}angues de sp{\'e}cialit{\'e}s ; langue g{\'e}n{\'e}rale; domaine; r{\'e}f{\'e}rence}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes du colloque {T}erminologie et {I}ntelligence {A}rtificielle }, publisher={{U}niversit{\'e} de {R}ouen }, pages={12 }, editor={{Y}annick {T}oussaint }, note={http://www.loria.fr/~yannick/{TIA}2005/doc/poibeau.pdf }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00005508/en/}, } %% hal-00077387, version 1 %% http://hal.archives-ouvertes.fr/hal-00077387/en/ @inproceedings{VENTOS:2005:HAL-00077387:1, title={{A}lpha {G}alois lattices : an overview}, author={{V}entos, {V}{\'e}ronique and {S}oldano, {H}enry}, keywords={{I}ntelligence artificielle et robotique, communication homme machine; {A}pprentissage}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{I}.{C}.{F}.{C}.{A} }, publisher={{S}pringer, {L}ecture notes in computer science 3403 }, pages={298–313, }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00077387/en/}, } %% hal-00084839, version 1 %% http://hal.archives-ouvertes.fr/hal-00084839/en/ @inproceedings{AUBIN:2004:HAL-00084839:1, title={{E}vent-based {I}nformation {E}xtraction for the biomedical domain: the {C}aderige project}, author={{A}ubin, {S}ophie and {B}essi{\`e}res, {P}hilippe and {H}amon, {T}hierry and {L}agarrigue, {S}andrine and {N}{\'e}dellec, {C}laire and {O}uld {A}bdel {V}etah, {M}ohamed and {P}oibeau, {T}hierry and {W}eissenbacher, {D}avy}, keywords={{I}ntelligence artificielle et robotique, communication homme machine; {A}pprentissage; {I}ng{\'e}nierie des langues; {L}inguistique; {I}ng{\'e}nierie des langues}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} - {UMR} {ENSAR}-{INRA} 598 - {ENSAR} - {INRA} }, booktitle={{P}roceedings of {I}nternational {J}oint workshop on {N}atural {L}anguage {P}rocessing in {B}iomedicine and its {A}pplications ({NLPBA}/{B}io{NLP}) }, publisher={{COLING} }, pages={43-49 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084839/en/}, } %% hal-00085129, version 1 %% http://hal.archives-ouvertes.fr/hal-00085129/en/ @inproceedings{BAILLOT:2004:HAL-00085129:1, title={{S}oft lambda-calculus: a language for polynomial time computation.}, author={{B}aillot, {P}atrick and {M}ogbil, {V}irgile}, abstract={{S}oft linear logic ([{L}afont02]) is a subsystem of linear logic characterizing the class {PTIME}. {W}e introduce {S}oft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. {W}e prove that the (untyped) terms of this calculus are reducible in polynomial time. {W}e then extend the type system of {S}oft logic with recursive types. {T}his allows us to consider non-standard types for representing lists. {U}sing these datatypes we examine the concrete expressiveness of {S}oft lambda-calculus with the example of the insertion sort algorithm.}, keywords={{L}inear logic; lambda-calculus; polynomial time complexity; {S}oft linear logic; implicit computational complexity; recursive types}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {FOSSACS} 2004 }, publisher={{S}pringer }, pages={27-41 }, series={volume 2987 de {LNCS} }, note={{V}ersion pr{\'e}liminaire (longue) disponible comme ccsd-00012751 (2003) {AS} {CNRS} "{M}{\'e}thodes formelles pour la mobilit{\'e}" et {ACI} {CRISS} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085129/en/}, } %% hal-00003468, version 1 %% http://hal.archives-ouvertes.fr/hal-00003468/en/ @inproceedings{BAILLOT:2004:HAL-00003468:1, title={{L}ight types for polynomial time computation in lambda-calculus}, author={{B}aillot, {P}atrick and {T}erui, {K}azushige}, abstract={{W}e propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: {D}ual light affine logic ({DLAL}). {DLAL} has a simple type language with a linear and an intuitionistic type arrow, and one modality. {I}t corresponds to a fragment of {L}ight affine logic ({LAL}). {W}e show that contrarily to {LAL}, {DLAL} ensures good properties on lambda-terms: subject reduction is satisfied and a well-typed term admits a polynomial bound on the reduction by any strategy. {F}inally we establish that as {LAL}, {DLAL} allows to represent all polytime functions.}, keywords={lambda-calculus, polynomial time complexity, light affine logic, linear logic}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {N}ational {I}nstitute of {I}nformatics - {NII} - {N}ational {I}nstitute of {I}nformatics }, booktitle={{P}roceedings of annual {IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience }, publisher={{IEEE} {C}omputer {S}ociety {P}ress }, pages={266-275 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003468/en/}, } %% hal-00003234, version 1 %% http://hal.archives-ouvertes.fr/hal-00003234/en/ @inproceedings{BANDERIER:2004:HAL-00003234:1, title={{G}enerating {F}unctions {F}or {K}ernels of {D}igraphs ({E}numeration \& {A}symptotics for {N}im {G}ames)}, author={{B}anderier, {C}yril and {L}e {B}ars, {J}ean-{M}arie and {R}avelomanana, {V}lady}, abstract={{I}n this article, we study directed graphs (digraphs) with a coloring constraint due to {V}on {N}eumann and related to {N}im-type games. {T}his is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as game theory, complexity theory, artificial intelligence (default logic, argumentation in multi-agent systems), 0-1 laws in monadic second order logic, combinatorics (perfect graphs)... {K}ernels of digraphs lead to numerous difficult questions (in the sense of {NP}-completeness, \\#{P}-completeness). {H}owever, we show here that it is possible to use a generating function approach to get new informations: we use technique of symbolic and analytic combinatorics (generating functions and their singularities) in order to get exact and asymptotic results, e.g. for the existence of a kernel in a circuit or in a unicircuit digraph. {T}his is a first step toward a generatingfunctionology treatment of kernels, while using, e.g., an approach "{\`a} la {W}right". {O}ur method could be applied to more general "local coloring constraints" in decomposable combinatorial structures.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {G}roupe de {R}echerche en {I}nformatique, {I}mage, {A}utomatique et {I}nstrumentation de {C}aen - {GREYC} - {CNRS} : {UMR}6072 - {U}niversit{\'e} de {C}aen - {E}cole {N}ationale {S}up{\'e}rieure d'{I}ng{\'e}nieurs de {C}aen }, booktitle={{P}roceedings of {FPSAC}'04 {F}ormal {P}ower {S}eries and {A}lgebraic {C}ombinatorics ({FPSAC}'04) }, publisher={{U}niversity of {B}ritish {C}olumbia }, pages={91-105 }, address={{V}ancouver {C}anada }, note={{P}resented (as a poster) to the conference {F}ormal {P}ower {S}eries and {A}lgebraic {C}ombinatorics ({V}ancouver, 2004), electronic proceedings. }, audience={internationale }, ARXIVID={math.CO/0411138 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003234/en/}, } %% hal-00279713, version 1 %% http://hal.archives-ouvertes.fr/hal-00279713/en/ @inproceedings{BENABDESLEM:2004:HAL-00279713:1, title={{A}n incremental unsupervised neural network for clustering}, author={{B}enabdeslem, {K}halid and {B}ennani, {Y}oun{\`e}s}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique pour l'{E}ntreprise et les {S}yst{\`e}mes de {P}roduction - {LIESP} - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {U}niversit{\'e} {L}umi{\`e}re - {L}yon {II} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {L}yon - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{IMACS}/{IEEE} {ITI}: {I}nternational {C}onference on {I}nformation {T}echnology {I}nterfaces }, pages={209-213 }, address={{C}roatie }, audience={internationale }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00279713/en/}, } %% hal-00098052, version 1 %% http://hal.archives-ouvertes.fr/hal-00098052/en/ @inproceedings{CHARLET:2004:HAL-00098052:1, title={{CEDERILIC} : constitution d'un livre et d'un index num{\'e}riques »}, author={{C}harlet, {J}ean and {A}{\"i}t {E}l {M}ekki, {T}ouria and {B}ourigault, {D}idier and {N}azarenko, {A}deline and {T}eulier, {R}{\'e}gine and {T}oledano, {B}aruk}, abstract={{W}e describe a real experiment in order to build a thematic index of a scientific book. {T}his book is a compilation of 21 articles from the {F}rench {K}nowledge {E}ngineering conferences (1999-2001). {T}he corpus has been analysed by {SYNTEX} then by {INDDOC}, software dedicated to index formation. {T}his work has been realized in a full digital context, with digital {HTML} articles and {HTML} index. {T}he user uses a browser for exploring the articles through the index. {W}e describe the work, the main problems and the chosen solutions}, keywords={livre num{\'e}rique, indexation, ing{\'e}nierie des connaissances, acquisition de connaissances {\`a} partir de textes ; structuration de terminologie ; condensation de l'information ; {XML} ; {DTD} {D}oc{B}ook}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {M}ission de recherche {STIM}, {DPA}/{DSI}/{AP}-{HP} - {INSERM} : {ERM}202 - {E}quipe de {R}echerche en {S}yntaxe et {S}{\'e}mantique - {ERSS} - {CNRS} : {UMR}5610 - {U}niversit{\'e} {M}ichel de {M}ontaigne - {B}ordeaux {III} - {U}niversit{\'e} {T}oulouse le {M}irail - {T}oulouse {II} - {C}entre de recherche en gestion - {CRG} - {CNRS} : {UMR}7655 - {P}olytechnique - {X} }, booktitle={{A}ctes de 7{\`e}me conf{\'e}rence {I}nternationale sur le {D}ocument num{\'e}rique ({CIDE}'04) }, publisher={{S}emaine du document num{\'e}rique }, pages={187-204 }, note={{H}.3.1 }, collaboration={{CEDERILIC} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00098052/en/}, } %% hal-00153760, version 1 %% http://hal.archives-ouvertes.fr/hal-00153760/en/ @inproceedings{CHOPPY:2004:HAL-00153760:1, title={{I}mproving {U}se {C}ase {B}ased {R}equirements {U}sing {F}ormally {G}rounded {S}pecifications}, author={{C}hoppy, {C}hristine and {R}eggio, {G}ianna}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roc. {F}undamental {A}pproaches to {S}oftware {E}ngineering ({FASE} 2004), {L}ecture {N}otes in {C}omputer {S}cience 2984 {F}undamental {A}pproaches to {S}oftware {E}ngineering ({FASE} 2004) }, publisher={{S}pringer {V}erlag }, pages={244-260 }, audience={non sp{\'e}cifi{\'e}e }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00153760/en/}, } %% hal-00089075, version 1 %% http://hal.archives-ouvertes.fr/hal-00089075/en/ @inproceedings{DESPRES:2004:HAL-00089075:1, title={{C}onstruction of a {L}egal {O}ntology from a {E}uropean {C}ommunity {L}egislative {T}ext}, author={{D}espr{\'e}s, {S}ylvie and {S}zulman, {S}ylvie}, abstract={{T}his paper describes the construction of an application ontology around the concept of {EMPLOYEE} in a {E}uropean community legislation text. {F}irstly, the {TERMINAE} method is presented. {T}hen it is shown how the text contributes to the building of this ontology. {A}fterward the use of a top level ontology as {DOLCE} and of a legal ontology as {LRI}-{C}ore are detailed. {T}he essential points of this study are: the application of the {TERMINAE} method to the legal domain and its alignment to core ontologies.}, keywords={ontology; legal ontology; building ontology from texts}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{J}urix 2004- {B}erlin }, publisher={{IOS} {P}ress }, pages={79-88 }, editor={{T}homas {G}ordon }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00089075/en/}, } %% hal-00084477, version 1 %% http://hal.archives-ouvertes.fr/hal-00084477/en/ @inproceedings{EMIRKANIAN:2004:HAL-00084477:1, title={{C}orpus issus du {W}eb : analyse des pertinences th{\'e}matique et informationnelle}, author={{E}mirkanian, {L}ouisette and {F}ouquer{\'e}, {C}hristophe and {I}ssac, {F}abrice}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{JADT} 2004 }, publisher={{P}resses {U}niversitaires de {L}ouvain }, pages={390-398 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084477/en/}, } %% hal-00084834, version 1 %% http://hal.archives-ouvertes.fr/hal-00084834/en/ @inproceedings{GRABAR:2004:HAL-00084834:1, title={{R}ep{\'e}rage de relations s{\'e}mantiques entre termes : sur la piste de la morphologie d{\'e}rivationnelle}, author={{G}rabar, {N}atalia and {H}amon, {T}hierry}, abstract={{N}otre travail est consacr{\'e} au rep{\'e}rage de relations s{\'e}mantiques entre termes. {D}ans ce contexte de constitution de terminologies structur{\'e}es, nous nous int{\'e}ressons en particulier {\`a} l'aide que peut apporter une approche bas{\'e}e sur la morphologie au regard d'autres techniques d'acquisition de relations s{\'e}mantiques en corpus. {P}armi les op{\'e}rations dont dispose la morphologie, nous exploitons l'affixation et la composition. {N}ous portons {\'e}galement notre attention sur la suppl{\'e}tion des bases. {N}ous montrons quelques sch{\'e}mas interpr{\'e}tatifs qui se d{\'e}gagent et indiquons les relations s{\'e}mantiques qui sont aptes, alors, d'{\'e}merger.}, keywords={{I}ng{\'e}nierie des langues, structuration de terminologie, morphologie, relations taxinomiques, synonymie, relations transversales}, language={{F}ran{\c{c}}ais}, affiliation={{I}ngenierie des connaissances en sant{\'e} - {INSERM} : {U}729 - {IFR}58 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de {J}ourn{\'e}es francophones d'{I}ng{\'e}nierie des {C}onnaissances ({IC}'2004) {I}ng{\'e}nierie des {C}onnaissances ({IC}'2004) }, publisher={{P}resses {U}niversitaires de {G}renoble }, pages={237-248 }, address={{F}rance }, audience={internationale }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084834/en/}, } %% hal-00087014, version 1 %% http://hal.archives-ouvertes.fr/hal-00087014/en/ @inproceedings{GUERRAHERNANDEZ:2004:HAL-00087014:1, title={{D}istributed {L}earning in {I}ntentional {BDI} {M}ulti-{A}gent {S}ystems.}, author={{G}uerra-{H}ern{\'a}ndez, {A}lejandro and {E}l {F}allah-{S}eghrouchni, {A}mal and {S}oldano, {H}enry}, keywords={machine learning; multi-agent systems}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={5th {M}exican {I}nternational {C}onference on {C}omputer {S}cience ({ENC} 2004) }, publisher={{IEEE} {C}omputer {S}ociety }, pages={225-232 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00087014/en/}, } %% hal-00077404, version 1 %% http://hal.archives-ouvertes.fr/hal-00077404/en/ @inproceedings{GUERRAHERNANDEZ:2004:HAL-00077404:1, title={{L}earning on {BDI} {M}ulti-agent {S}ystems}, author={{G}uerra-{H}ernandez, {A}lejandro and {E}lfallah-{S}eghrouchni, {A}mal and {S}oldano, {H}enry}, keywords={{I}ntelligence artificielle ; {A}pprentissage ; {S}yst{\`e}mes {M}ulti-{A}gents}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{F}ourth {I}nternational {W}orkshop on {C}omputational {L}ogic in {M}ulti-{A}gent {S}ystems ({CLIMA} {IV}). {F}ort {L}auderdale, {FL}, {USA} }, publisher={{S}pringer, {LNCS}, 3259 }, pages={218-233 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00077404/en/}, } %% hal-00082539, version 1 %% http://hal.archives-ouvertes.fr/hal-00082539/en/ @inproceedings{HAKEM:2004:HAL-00082539:1, title={{A} {N}ew {O}n-{L}ine {S}cheduling {A}lgorithm for {D}istributed {R}eal-{T}ime {S}ystem}, author={{H}akem, {M}ourad and {B}utelle, {F}ranck}, keywords={{R}{\'e}seaux; {S}yst{\`e}mes distribu{\'e}s et parall{\`e}les; {I}nformatique th{\'e}orique (algorithmique);}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roc. of the 3rd {I}nt. {S}ymp. and {S}chool on {A}dvanced {D}istributed {S}ystems ({ISSADS}) }, publisher={{S}pringer {V}erlag }, pages={241--251 }, editor={{LNCS} }, audience={internationale }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00082539/en/}, } %% hal-00084980, version 1 %% http://hal.archives-ouvertes.fr/hal-00084980/en/ @inproceedings{HAMDOUN:2004:HAL-00084980:1, title={{R}elationships between attributes to integrate heterogeneous data sources}, author={{H}amdoun, {S}ana and {B}oufares, {F}aouzi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={proceedings of the international {A}rab {C}onference on {I}nformation {T}echnology ({ACIT}'04) }, publisher={x }, pages={x }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084980/en/}, } %% hal-00091633, version 1 %% http://hal.archives-ouvertes.fr/hal-00091633/en/ @inproceedings{KAYSER:2004:HAL-00091633:1, title={{R}epresenting {K}nowledge about {N}orms to {R}eason on {T}exts}, author={{K}ayser, {D}aniel and {N}ouioua, {F}arid}, abstract={{N}orms are essential to extend inference: inferences based on norms are far richer than those based on logical implica-tions. {I}n the recent decades, much effort has been devoted to rea-son on a domain, once its norms are represented. {H}ow to extract and express those norms has received far less attention. {E}xtraction is difficult: as the readers are supposed to know them, the norms of a domain are seldom made explicit. {F}or one thing, extracting norms requires a language to represent them, and this is the topic of this paper. {W}e apply this language to represent norms in the do-main of driving, and show that it is adequate to reason on the causes of accidents, as described by car-crash reports.}, keywords={{C}ausal reasoning; {N}atural {L}anguage {U}nderstanding; {N}orms; {N}on-monotonic {L}ogic}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roc. 16th {E}uropean {C}onference on {A}rtificial {I}ntelligence }, publisher={{IOS} {P}ress }, pages={363-367 }, series={{V}alencia ({E}sp) }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00091633/en/}, } %% hal-00091630, version 1 %% http://hal.archives-ouvertes.fr/hal-00091630/en/ @inproceedings{KAYSER:2004:HAL-00091630:1, title={{A}bout {N}orms and {C}auses}, author={{K}ayser, {D}aniel and {N}ouioua, {F}arid}, abstract={{K}nowing the norms of a domain is crucial, but there exist no repository of norms. {W}e propose a method to extract them from texts: texts generally do not describe a norm, but rather how a state-of-affairs differs from it. {A}nswers about the cause of the state-of-affairs described often reveal the implicit norm. {W}e apply this idea to the domain of driving, and validate it by designing algorithms that identify, in a text, the “basic” norms to which it refers implicitly.}, keywords={{N}orms; {C}ausal reasoning; {N}atural {L}anguage {U}nderstanding; {N}atural {L}anguage {S}emantics}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roc. 17th {I}nternational {F}lorida {A}rtificial {I}ntelligence {R}esearch {S}ociety {C}onference ({FLAIRS}) }, publisher={{A}merican {A}ssociation for {A}rtificial {I}ntelligence }, pages={502-507 }, series={{M}iami {B}each ({FL}) }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00091630/en/}, } %% hal-00085148, version 1 %% http://hal.archives-ouvertes.fr/hal-00085148/en/ @inproceedings{KAYSER:2004:HAL-00085148:1, title={{A}bout {N}orms and {C}auses}, author={{K}ayser, {D}aniel and {N}ouioua, {F}arid}, abstract={{K}nowing the norms of a domain is crucial, but there exist no repository of norms. {W}e propose a method to extract them from texts: texts generally do not describe a norm, but rather how a state-of-affairs differs from it. {A}nswers concerning the cause of the state-of-affairs described often reveal the implicit norm. {W}e apply this idea to the domain of driving, and validate it by designing algorithms that identify, in a text, the “basic” norms to which it refers implicitly.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{T}he 17th {FLAIRS}'04 {C}onference }, publisher={{AAAI} {P}ress }, pages={502-507 }, editor={{V}alerrie {B}arr, {Z}adravko {M}arkov }, ARXIVID={cs/0607084 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085148/en/}, } %% hal-00085147, version 1 %% http://hal.archives-ouvertes.fr/hal-00085147/en/ @inproceedings{KAYSER:2004:HAL-00085147:1, title={{R}epresenting {K}nowledge about {N}orms}, author={{K}ayser, {D}aniel and {N}ouioua, {F}arid}, abstract={{N}orms are essential to extend inference: inferences based on norms are far richer than those based on logical implications. {I}n the recent decades, much effort has been devoted to reason on a domain, once its norms are represented. {H}ow to extract and express those norms has received far less attention. {E}xtraction is difficult: as the readers are supposed to know them, the norms of a domain are seldom made explicit. {F}or one thing, extracting norms requires a language to represent them, and this is the topic of this paper. {W}e apply this language to represent norms in the domain of driving, and show that it is adequate to reason on the causes of accidents, as described by car-crash reports.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{T}he 16th {E}uropean {C}onference on {A}rtificial {I}ntelligence ({ECAI}'04) }, publisher={{IOS} press }, pages={363-367 }, editor={{R}amon {L}{\'o}pez de {M}{\'a}ntaras, {L}orenza {S}aitta }, ARXIVID={cs/0607086 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085147/en/}, } %% hal-00351791, version 1 %% http://hal.archives-ouvertes.fr/hal-00351791/en/ @inproceedings{KRIEF:2004:HAL-00351791:1, title={{A} learning and {I}ntentional {L}ocal {P}olicy {D}ecision {P}oint for {D}ynamic {Q}o{S} {P}rovisioning}, author={{K}rief, {F}rancine and {B}outhinon, {D}ominique}, language={{A}nglais}, affiliation={{L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={proceedings of {N}et{C}on 2004 {IFIP} {I}nternational {C}onference on {N}etwork {C}ontrol and {E}ngineering for {Q}o{S}, {S}ecurity and {M}obility }, pages={277-288 }, address={{P}alma de {M}allorca {E}spagne }, editor={{S}pringer{V}erlag, {ISBN}: 0-387-23197-8 }, audience={internationale }, month={11}, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00351791/en/}, } %% hal-00098057, version 1 %% http://hal.archives-ouvertes.fr/hal-00098057/en/ @inproceedings{NAZARENKO:2004:HAL-00098057:1, title={{U}ne mesure de pertinence pour le tri de l'information dans un index de fin de livre}, author={{N}azarenko, {A}deline and {A}{\"i}t {E}l {M}ekki, {T}ouria}, abstract={{T}his paper presents the {I}nd{D}oc system that assists back-of-the-book indexing. {O}ne of the indexing challenge deals with information selection: which are the most relevant headings and references. {T}his papers shows how this selection is handled in {I}nd{D}oc. {I}t presents a metric for the ranking of headings and , for each heading, for its references.}, keywords={{E}xtraction de termes ; segmentation th{\'e}matique de texte ; extraction d'information}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de la onzi{\`e}me conf{\'e}rence annuelle sur le {T}raitement {A}utomatique du {L}angage {N}aturel ({TALN}'04) }, publisher={{ATALA} }, pages={1-10 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00098057/en/}, } %% hal-00084838, version 1 %% http://hal.archives-ouvertes.fr/hal-00084838/en/ @inproceedings{OULDABDELVETAH:2004:HAL-00084838:1, title={{E}xtraction d'information appliqu{\'e}e au domaine biom{\'e}dical - apprentissage et {TALN}}, author={{O}uld {A}bdel {V}etah, {M}ohamed and {A}ubin, {S}ophie and {B}essi{\`e}res, {P}hilippe and {B}isson, {G}illes and {H}amon, {T}hierry and {L}agarrigue, {S}andrine and {N}azarenko, {A}deline and {N}{\'e}dellec, {C}laire and {P}oibeau, {T}hierry and {W}eissenbacher, {D}avy}, keywords={{I}ntelligence artificielle et robotique, communication homme machine; {A}pprentissage; {I}ng{\'e}nierie des langues; {L}inguistique; {I}ng{\'e}nierie des langues}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} - {UMR} {ENSAR}-{INRA} 598 - {ENSAR} - {INRA} }, booktitle={{A}ctes de la {C}onf{\'e}rence {I}nternational de {F}ouille de texte, {CIFT}-04 }, publisher={{CIFT} }, pages={7-20 }, editor={{M}arie {H}{\'e}l{\`e}ne {A}ntoni et {F}ran{\c{c}}ois {Y}von }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084838/en/}, } %% hal-00003833, version 1 %% http://hal.archives-ouvertes.fr/hal-00003833/en/ @inproceedings{PAILLARD:2004:HAL-00003833:1, title={{A}ssigning codes in a random wireless network}, author={{P}aillard, {G}abriel and {D}jerourou, {C}. {L}avault, {V}. {R}avelomanana, {F}.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={11th {I}nternational {C}onference on {T}elecomunications }, pages={348-353 }, editor={{S}pringer }, series={{LNCS} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003833/en/}, } %% hal-00085177, version 1 %% http://hal.archives-ouvertes.fr/hal-00085177/en/ @inproceedings{POIBEAU:2004:HAL-00085177:1, title={{G}{\'e}n{\'e}ration semi-automatique de grammaires de commande}, author={{P}oibeau, {T}hierry and {G}oujon, {B}{\'e}n{\'e}dicte}, abstract={{C}et article pr{\'e}sente une m{\'e}thode permettant de g{\'e}n{\'e}rer de mani{\`e}re semi-automatique des grammaires pour la commande vocale.}, keywords={interfaces vocales; grammaire de commande; sous-langage}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes des {J}ourn{\'e}es d'etude de la {P}arole ({JEP}'2004) {J}ourn{\'e}es d'etude de la {P}arole ({JEP}'2004) }, publisher={{A}ssociation {F}rancophone de la {C}ommunication {P}arl{\'e}e }, pages={405-409 }, address={{F}{\`e}s {M}aroc }, editor={{B}. {B}el et {I}. {M}arlien }, note={{C}ollaboration avec {T}hales {R}echerche et {T}echnologie. http://aune.lpl.univ-aix.fr/jep-taln04/proceed/actes/jep2004/{P}oibeau-{G}oujon.pdf }, audience={nationale }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085177/en/}, } %% hal-00009168, version 1 %% http://hal.archives-ouvertes.fr/hal-00009168/en/ @inproceedings{POIBEAU:2004:HAL-00009168:1, title={{A}utomatic extraction of paraphrastic phrases from medium size corpora}, author={{P}oibeau, {T}hierry}, abstract={{T}his paper presents a versatile system intended to acquire paraphrastic phrases from a representative corpus. {I}n order to decrease the time spent on the elaboration of resources for {NLP} system (for example {I}nformation {E}xtraction, {IE} hereafter), we suggest to use a machine learning system that helps defining new templates and associated resources. {T}his knowledge is automatically derived from the text collection, in interaction with a large semantic network.}, keywords={paraphrase; semantic network; natural language processing; semantics}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de la conf{\'e}rence {C}omputational {L}inguistics ({COLING} 2004) }, publisher={{A}ssociation for {C}omputational {L}inguistics }, pages={638-644 }, address={{G}en{\`e}ve }, editor={{S}ergei {N}irenburg }, ARXIVID={cs.CL/0509092 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00009168/en/}, } %% hal-00003459, version 1 %% http://hal.archives-ouvertes.fr/hal-00003459/en/ @inproceedings{SEDJELMACI:2004:HAL-00003459:1, title={{T}he {A}ccelerated {E}uclidean {A}lgorithm}, author={{S}edjelmaci, {S}idi {M}ohamed}, abstract={{W}e present a new {GCD} algorithm of two integers or polynomials. {T}he algorithm is iterative and its time complexity is still ${O}(n \\log^2 n ~\\log \\log n)$ for $n$-bit inputs.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {EACA}, }, publisher={{U}niversity of {C}antabria, {S}antander, {S}pain }, pages={283-287 }, editor={{L}aureano {G}onzales-{V}ega and {T}homas {R}ecio {E}ds }, ARXIVID={cs.DS/0412006 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003459/en/}, } %% hal-00084634, version 1 %% http://hal.archives-ouvertes.fr/hal-00084634/en/ @inproceedings{SUNA:2004:HAL-00084634:1, title={{M}obile {M}ulti-{A}gent {S}ystems: {A} {P}rogramming {L}anguage and {I}ts {S}emantics.}, author={{S}una, {A}lexandru and {E}l {F}allah-{S}eghrouchni, {A}mal and {F}ouquer{\'e}, {C}hristophe and {B}aillot, {P}atrick}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={3rd {I}nternational {J}oint {C}onference on {A}utonomous {A}gents and {M}ultiagent {S}ystems ({AAMAS} 2004) }, publisher={{IEEE} {C}omputer {S}ociety {P}ress }, pages={1386-1387 }, note={{P}oster (2 pages) }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084634/en/}, } %% hal-00380569, version 1 %% http://hal.archives-ouvertes.fr/hal-00380569/en/ @inproceedings{SZULMAN:2004:HAL-00380569:1, title={{OWL} et {T}erminae}, author={{S}zulman, {S}ylvie and {B}i{\'e}bow, {B}rigitte}, abstract={{C}et article pr{\'e}sente une r{\'e}flexion sur l'importation et l'exportation d'une ontologie entre {OWL} et {T}erminae. {A}pr{\`e}s une rapide pr{\'e}sentation des deux langages, nous d{\'e}taillons la traduction des diff{\'e}rents {\'e}l{\'e}ments de {OWL} {DL} en {T}erminae. {N}ous proposons une solution pour int{\'e}grer dans {OWL} le lien avec les textes {\`a} partir desquels une ontologie a {\'e}t{\'e} cr{\'e}{\'e}e en {T}erminae, ce qui est propre {\`a} {T}erminae.}, keywords={{O}ntologies, {OWL}, {W}eb s{\'e}mantique, mod{\'e}lisation {\`a} partir de textes}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{I}ng{\'e}nierie des {C}onnaissances {I}ng{\'e}nierie des {C}onnaissances }, publisher={{P}resses universitaires de {G}renoble }, pages={41-52 }, address={{L}yon {F}rance }, editor={{N}ada {M}atta }, series={{I}ng{\'e}nierie des {C}onnaissances }, audience={non sp{\'e}cifi{\'e}e }, month={05}, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00380569/en/}, } %% hal-00087557, version 1 %% http://hal.archives-ouvertes.fr/hal-00087557/en/ @inproceedings{SZULMAN:2004:HAL-00087557:1, title={{OWL} et {T}erminae}, author={{S}zulman, {S}ylvie and {B}i{\'e}bow, {B}rigitte}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{IC}'2004 - 15 i{\`e}me journ{\'e}es francophones d'{I}ng{\'e}nierie des {C}onnaissances }, publisher={{P}resses {U}niversitaires de {G}renoble }, pages={41-52 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00087557/en/}, } %% hal-00077391, version 1 %% http://hal.archives-ouvertes.fr/hal-00077391/en/ @inproceedings{VENTOS:2004:HAL-00077391:1, title={{A}lpha {G}alois lattices}, author={{V}entos, {V}{\'e}ronique and {S}oldano, {H}enry and {L}amadon, {T}hibault}, keywords={{I}ntelligence artificielle, {A}pprentissage}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{I}nternational {C}onference on {D}ata {M}ining ({ICDM}) }, publisher={{IEEE} {P}ress }, pages={555-558 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00077391/en/}, } %% hal-00003707, version 1 %% http://hal.archives-ouvertes.fr/hal-00003707/en/ @inproceedings{VENTOS:2004:HAL-00003707:1, title={{T}reillis de {G}alois {A}lpha}, author={{V}entos, {V}{\'e}ronique and {S}oldano, {H}enry and {L}amadon, {T}hibaut}, abstract={{D}ans beaucoup d'applications il est utile de repr{\'e}senter une grande quantit{\'e} de donn{\'e}es en les regroupant en une hi{\'e}rarchie de classes d{\'e}crites {\`a} un niveau d'abstraction ad{\'e}quat. {L}a repr{\'e}sentation g{\'e}n{\'e}rique que nous utilisons ici est un treillis de {G}alois, i.e. un treillis correspondant au partitionnement des termes d'un langage de repr{\'e}sentation en classes d'{\'e}quivalence relativement {\`a} leur extension (l'extension d'un terme est la partie d'un ensemble d'instances qui satisfait ce terme). {L}e principal d{\'e}savantage de cette structure est sa taille qui peut {\^e}tre tr{\`e}s grande dans le cas d'applications r{\'e}elles. {N}ous proposons ici de r{\'e}duire la taille du treillis, simplifiant ainsi la repr{\'e}sentation des donn{\'e}es, tout en conservant sa structure formelle de treillis de {G}alois et son exhaustivit{\'e}. {P}our cela nous utilisons une partition pr{\'e}liminaire des donn{\'e}es correspondant {\`a} l'association d'un type {\`a} chaque instance. {E}n red{\'e}finissant la notion d'extension d'un terme de mani{\`e}re {\`a} tenir compte, {\`a} un certain degr{\'e} alpha, de cette partition, nous aboutissons {\`a} des treillis de {G}alois particuliers appel{\'e}s treillis de {G}alois {A}lpha.-------{I}n many applications there is a need to represent a large number of data by clustering them in a hierarchy of classes described at an appropriate level of abstraction. {O}ur basic representation is a {G}alois lattice, i.e. a lattice in which the terms of a representation language are partitioned into equivalence classes w.r.t. their extent (the extent of a term is the part of the instance set that satisfies the term). {T}he advantage of such a structure is that it exhaustively represents the whole set of concepts that are distinguishable given the instance set and the representation language. {H}owever the size of the lattice can be very large when dealing with real-world problems. {W}hat we propose here is to reduce the size of the lattice, and thus to simplify our view of the data, still conserving its formal structure and exhaustivity. {F}or that purpose we use a preliminary partition of the instance set, representing the association of a "type" to each instance. {B}y redefining the notion of extent of a term in order to cope, to a certain degree (denoted as alpha), with this partition, we define a particular family of {G}alois lattices denoted as {A}lpha {G}alois lattices.}, keywords={{R}egroupement conceptuel, {T}reillis de {G}alois}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} }, booktitle={{C}onf{\'e}rence d'{A}pprentissage ({CAP}'04) }, pages={175-190 }, editor={{P}resses {U}niversitaires de {G}renoble. }, note={{ACM} : {A}rtificial {I}ntelligence , {L}earning }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003707/en/}, } %% hal-00095212, version 1 %% http://hal.archives-ouvertes.fr/hal-00095212/en/ @inproceedings{WEISSENBACHER:2004:HAL-00095212:1, title={{L}a relation de synonymie en g{\'e}nomique}, author={{W}eissenbacher, {D}avy}, abstract={{L}'acc{\`e}s au contenu des textes de g{\'e}nomique est aujourd'hui un enjeu important. {C}ela suppose au d{\'e}part d'identifier les noms d'entit{\'e}s biologiques comme les g{\`e}nes ou les prot{\'e}ines. {S}e pose alors la question de la variation de ces noms. {C}ette question rev{\^e}t une importance particuli{\`e}re en g{\'e}nomique o{\`u} les noms de g{\`e}nes sont soumis {\`a} de nombreuses variations, notamment la synonymie. {A} partir d'une {\'e}tude de corpus montrant que la synonymie est une relation stable et linguistiquement marqu{\'e}e, cet article propose une mod{\'e}lisation de la synonymie et une m{\'e}thode d'extraction sp{\'e}cifiquement adapt{\'e}e {\`a} cette relation. {A}u vu de nos premi{\`e}res exp{\'e}riences, cette m{\'e}thode semble plus prometteuse que les approches g{\'e}n{\'e}riques utilis{\'e}es pour l'extraction de cette relation.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes {RECITAL} }, publisher={{ATALA} }, pages={298-303 }, collaboration={{CADERIGE} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00095212/en/}, } %% hal-00380573, version 1 %% http://hal.archives-ouvertes.fr/hal-00380573/en/ @inproceedings{ZARGAYOUNA:2004:HAL-00380573:1, title={{M}esure de similarit{\'e} dans une ontologie pour l'indexation s{\'e}mantique de documents {XML}}, author={{Z}argayouna, {H}a{\"i}fa and {S}alotti, {S}ylvie}, abstract={{L}es documents {XML} posent de nouveaux d{\'e}fis et imposent de nouvelles m{\'e}thodes de traitement d'information. {N}ous pr{\'e}sentons dans cet article une mesure de similarit{\'e} entre les concepts d'une ontologie que nous utilisons dans un syst{\`e}me d'indexation de documents {XML}. {L}es documents sont structur{\'e}s par un ensemble de balises s{\'e}mantiquement pertinentes reli{\'e}es {\`a} l'ontologie. {U}ne partie des termes du corpus est {\'e}galement reli{\'e}e {\`a} l'ontologie. {N}ous avons {\'e}tendu le mod{\`e}le vectoriel de {S}alton pour prendre en compte la structure des documents et le voisinage s{\'e}mantique des termes.}, keywords={{S}imilarit{\'e}, ontologie, indexation s{\'e}mantique}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'{I}nformatique pour la {M}{\'e}canique et les {S}ciences de l'{I}ng{\'e}nieur - {LIMSI} - {CNRS} : {UPR}3251 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{I}ng{\'e}nierie des {C}onnaissances {I}ng{\'e}nierie des {C}onnaissances }, publisher={{P}resses universitaires de {G}renoble }, pages={249-260 }, address={{L}yon {F}rance }, editor={{N}ada {M}atta }, series={{I}ng{\'e}nierie des {C}onnaissances }, audience={non sp{\'e}cifi{\'e}e }, month={05}, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00380573/en/}, } %% hal-00094635, version 1 %% http://hal.archives-ouvertes.fr/hal-00094635/en/ @inproceedings{ZARGAYOUNA:2004:HAL-00094635:1, title={{M}esure de similarit{\'e} s{\'e}mantique pour l'indexation de documents semi-structur{\'e}s}, author={{Z}argayouna, {H}aifa and {S}alotti, {S}ylvie}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'{I}nformatique pour la {M}{\'e}canique et les {S}ciences de l'{I}ng{\'e}nieur - {LIMSI} - {CNRS} : {UPR}3251 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={12{\`e}me {A}telier de {R}aisonnement {\`a} {P}artir de {C}as 12{\`e}me {A}telier de {R}aisonnement {\`a} {P}artir de {C}as }, publisher={{LIPN} }, pages={?? }, address={{V}illetaneuse {F}rance }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00094635/en/}, } %% hal-00094619, version 1 %% http://hal.archives-ouvertes.fr/hal-00094619/en/ @inproceedings{ZARGAYOUNA:2004:HAL-00094619:1, title={{M}esure de similarit{\'e} dans une ontologie pour l'indexation s{\'e}mantique de documents {XML}.}, author={{Z}argayouna, {H}aifa and {S}alotti, {S}ylvie}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'{I}nformatique pour la {M}{\'e}canique et les {S}ciences de l'{I}ng{\'e}nieur - {LIMSI} - {CNRS} : {UPR}3251 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{IC}'2004 - 15 i{\`e}me journ{\'e}es francophones d'{I}ng{\'e}nierie des {C}onnaissances (2004) }, publisher={{LIRIS} }, pages={249-260 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00094619/en/}, } %% hal-00101108, version 1 %% http://hal.archives-ouvertes.fr/hal-00101108/en/ @inproceedings{ZEHRAOUI:2004:HAL-00101108:1, title={{CASEP}2 : {H}ybrid {C}ase-{B}ased {R}easoning {S}ystem for {S}equence {P}rocessing}, author={{Z}ehraoui, {F}arida and {K}anawati, {R}ushed and {S}alotti, {S}ylvie}, keywords={{C}ase-{B}ased {R}easoning, {H}ybrid system, {A}rtificial {N}eural {N}etwork}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}dvances in {C}ase-{B}ased {R}easoning, 7th {E}uropean {C}onference, {ECCBR} 2004, {M}adrid, {S}pain, {A}ugust/{S}eptember 2004, {P}roceedings }, publisher={{S}pringer-{V}erlag }, pages={449-463 }, editor={{P}. {F}unk and {P}.{A}. {G}onzales {C}alero ({E}ds) }, series={{LNAI} 3155 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00101108/en/}, } %% hal-00084636, version 1 %% http://hal.archives-ouvertes.fr/hal-00084636/en/ @inproceedings{ZEHRAOUI:2004:HAL-00084636:1, title={{SOM}-{ART} : {I}ncorporation des propri{\'e}t{\'e}s de plasticit{\'e} et de stabilit{\'e} dans une carte auto-organisatrice}, author={{Z}ehraoui, {F}arida and {B}ennani, {Y}oun{\`e}s}, keywords={{A}pprentissage non supervis{\'e}, classification, s{\'e}quences, fouille du web.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{F}ouille de {D}onn{\'e}es {C}omplexes dans un processus d'extraction de connaissances ({EGC} 2004), 169-180, , {J}anvier 2004. }, publisher={{C}{\'e}padu{\`e}s-{\'E}ditions }, pages={169-180 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084636/en/}, } %% hal-00089149, version 1 %% http://hal.archives-ouvertes.fr/hal-00089149/en/ @inproceedings{AUSSENACGILLES:2003:HAL-00089149:1, title={{D}'une m{\'e}thode {\`a} un guide pratique de mod{\'e}lisation de connaissances {\`a} partir de textes}, author={{A}ussenac-{G}illes, {N}athalie and {B}i{\'e}bow, {B}rigitte and {S}zulman, {S}ylvie}, abstract={{N}ous proposons dans cet article un guide pratique de mod{\'e}lisation pour construire des ressources ontologiques {\`a} partir de textes. {C}e guide a {\'e}t{\'e} {\'e}labor{\'e} pour un industriel et mis en oeuvre sur une application. {I}l d{\'e}taille l'utilisation de logiciels de traitement automatique des langues et de mod{\'e}lisation, afin d'aider un analyste lors du d{\'e}pouillement et de la fouille dans les donn{\'e}es textuelles. {I}l pr{\'e}cise pas {\`a} pas les diff{\'e}rentes {\'e}tapes en mettant en {\'e}vidence la navigation entre les nombreux {\'e}l{\'e}ments de mod{\'e}lisation.}, keywords={ontologie; mod{\'e}lisation {\`a} partir de textes; ressources terminologiques}, language={{F}ran{\c{c}}ais}, affiliation={{I}nstitut de recherche en informatique de {T}oulouse - {IRIT} - {CNRS} : {UMR}5505 - {U}niversit{\'e} des {S}ciences {S}ociales - {T}oulouse {I} - {U}niversit{\'e} {P}aul {S}abatier - {T}oulouse {III} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{TIA}-2003 - {A}ctes des cinqui{\`e}mes rencontres {T}erminologie et {I}ntelligence {A}rtificielle }, publisher={{LIIA} - {ENSAIS} }, pages={41-53 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00089149/en/}, } %% hal-00082467, version 1 %% http://hal.archives-ouvertes.fr/hal-00082467/en/ @inproceedings{BANDERIER:2003:HAL-00082467:1, title={{S}moothed analysis of three combinatorial algorithms}, author={{B}anderier, {C}yril and {M}ehlhorn, {K}urt and {B}aier, {R}ene}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {M}ax-{P}lanck-institut f{\"u}r {I}nformatik - {MPII} - {M}ax-{P}lanck-{I}nstitut }, booktitle={{M}athematical {F}undations of {C}omputer {S}cience 2003 }, publisher={{S}pringer }, pages={http://www.mfcs.sk/mfcs2003/ }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082467/en/}, } %% hal-00082562, version 1 %% http://hal.archives-ouvertes.fr/hal-00082562/en/ @inproceedings{BLIN:2003:HAL-00082562:1, title={{T}he first {A}pproximated {D}istributed {A}lgorithm for the {M}inimum {D}egree {S}panning {T}ree {P}roblem on {G}eneral {G}raph}, author={{B}lin, {L}{\'e}lia and {B}utelle, {F}ranck}, keywords={{S}yst{\`e}mes distribu{\'e}s et parall{\`e}les; {G}raphes, combinatoire; {O}ptimisation; {I}nformatique th{\'e}orique (algorithmique, logique, cryptographie)}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={proc. {IEEE} {IPDPS}-{APDCM}'03 }, publisher={{IEEE} {C}omputer {S}ociety {P}ress }, pages={161 }, series={{CDROM} }, note={10 pages }, audience={internationale }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082562/en/}, } %% hal-00084976, version 1 %% http://hal.archives-ouvertes.fr/hal-00084976/en/ @inproceedings{HAMDOUN:2003:HAL-00084976:1, title={{A}n {XML} {A}pproach of {C}onstruction and {S}elf-maintenance of a {W}eb {W}arehouse}, author={{H}amdoun, {S}ana and {B}oufares, {F}aouzi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={proceedings of the international {A}rab {C}onference on {I}nformation {T}echnology ({ACIT}'03) }, publisher={x }, pages={x }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084976/en/}, } %% hal-00084747, version 1 %% http://hal.archives-ouvertes.fr/hal-00084747/en/ @inproceedings{KANOVICH:2003:HAL-00084747:1, title={{C}oping {P}olynomially with {N}umerous but {I}dentical {E}lements within {P}lanning {P}roblems}, author={{K}anovich, {M}ax and {V}auzeilles, {J}acqueline}, keywords={{L}inear {L}ogic - {A}rtificial {I}ntelligence - {P}lanning}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omputer {S}cience {D}epartment, {Q}ueen {M}ary - {L}ondon {U}niversity }, booktitle={{CSL}'03 \& {KGC} ({C}omputer {S}cience {L}ogic and {K}urt {G}{\"o}del {C}olloquium) }, publisher={{LNCS} }, pages={285-298 }, editor={{S}pringer }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084747/en/}, } %% hal-00084617, version 1 %% http://hal.archives-ouvertes.fr/hal-00084617/en/ @inproceedings{LAVAULT:2003:HAL-00084617:1, title={{Q}uasi-{O}ptimal {L}eader {E}lection {A}lgorithms in {R}adio {N}etworks with {L}oglogarithmic {A}wake {T}ime {S}lots}, author={{L}avault, {C}hristian and {M}arckert, {J}ean-{F}ran{\c{c}}ois and {R}avelomanana, {V}lady}, abstract={{A} radio network ({RN}) is a distributed system consisting of $n$ radio stations. {W}e design and analyze two distributed leader election protocols in {RN} where the number $n$ of radio stations is unknown. {T}he first algorithm runs under the assumption of {\it limited collision detection}, while the second assumes that {\it no collision detection} is available. {B}y ``limited collision detection'', we mean that if exactly one station sends (broadcasts) a message, then all stations (including the transmitter) that are listening at this moment receive the sent message. {B}y contrast, the second no-collision-detection algorithm assumes that a station cannot simultaneously send and listen signals. {M}oreover, both protocols allow the stations to keep asleep as long as possible, thus minimizing their awake time slots (such algorithms are called {\it energy-efficient}). {B}oth randomized protocols in {RN} areshown to elect a leader in ${O}(\log{(n)})$ expected time, with no station being awake for more than ${O}(\log{\log{(n)}})$ time slots. {T}herefore, a new class of efficient algorithms is set up that match the $\{O}mega(\log{(n)})$ time lower-bound established by {K}ushilevitz and {M}ansour.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux }, booktitle={10th {IEEE} {I}nternational {C}onference on {T}elecommunications }, publisher={{IEEE} }, pages={1113-1119 }, audience={non sp{\'e}cifi{\'e}e }, ARXIVID={cs.DC/0607034 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084617/en/}, } %% hal-00085180, version 1 %% http://hal.archives-ouvertes.fr/hal-00085180/en/ @inproceedings{POIBEAU:2003:HAL-00085180:1, title={{T}he {M}ultilingual {N}amed {E}ntity {R}ecognition {F}ramework}, author={{P}oibeau, {T}hierry}, abstract={{T}his paper presents a multilingual system designed to recognize named entities in a wide variety of languages (currently more than 12 languages are concerned). {T}he system includes original strategies to deal with a wide variety of encoding character sets, analysis strategies and algorithms to process these languages.}, keywords={{N}amed entity recognition; multilingualism}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes de {E}uropean {C}onference of the {A}ssociation for {C}omputational {L}inguistics ({EACL} 2003) {E}uropean {C}onference of the {A}ssociation for {C}omputational {L}inguistics ({EACL} 2003) }, publisher={{A}ssociation for {C}omputational {L}inguistics }, pages={155-158 }, address={{B}udapest {H}ongrie }, editor={{A}nn {C}opestake, {J}an {H}ajic }, audience={internationale }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00085180/en/}, } %% hal-00003494, version 1 %% http://hal.archives-ouvertes.fr/hal-00003494/en/ @inproceedings{VAUZEILLES:2003:HAL-00003494:1, title={{C}oping polynomially with numerous but identical elements within planning problems}, author={{V}auzeilles, {J}acqueline and {K}anovich, {M}ax}, abstract={{S}ince the typical {AI} problem of making a plan of the actions to be performed by a robot so that it could get into a set of final situations, if it started with a certain initial situation, is generally exponential (it is even {EXPTIME}-complete in the case of games `{R}obot against {N}ature'), the planners are very sensitive to the number of variables, the inherent symmetry of the problem, and the nature of the logic formalisms being used. {T}he paper shows that linear logic provides a convenient tool for representing planning problems. {I}n particular, the paper focuses on planning problems with an unbounded number of functionally identical objects. {W}e show that for such problems linear logic is especially effective and leads to dramatic contraction of the search space (polynomial instead of exponential). {T}he paper addresses the key issue: ``{H}ow to automatically recognize functions similarity among objects and break the extreme combinatorial explosion caused by this symmetry,'' by means of replacing the unbounded number of specific names of objects with one generic name and contracting thereby the exponential search space over `real' objects to a small polynomial search space but over the `generic' one, with providing a more abstract formulation whose solutions are proved to be directly translatable into (optimal) polytime solutions to the original planning problem.}, keywords={{L}inear {L}ogic}, language={{A}nglais}, affiliation={{R}ussian {S}tate {U}niversity for the {H}umanities - {R}ussian {S}tate {U}niversity for the {H}umanities - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {C}omputer {S}cience {L}ogic and {K}urt {G}{\"o}del {C}olloquium }, publisher={{L}ecture {N}otes in {C}omputer {S}cience }, pages={285-298 }, series={volume 2803 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00003494/en/}, } %% hal-00096880, version 1 %% http://hal.archives-ouvertes.fr/hal-00096880/en/ @inproceedings{ZARGAYOUNA:2003:HAL-00096880:1, title={{I}ndexation s{\'e}mantique de documents {XML}}, author={{Z}argayouna, {H}aifa and {S}alotti, {S}ylvie}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'{I}nformatique pour la {M}{\'e}canique et les {S}ciences de l'{I}ng{\'e}nieur - {LIMSI} - {CNRS} : {UPR}3251 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}telier : {F}ouille de donn{\'e}es et recherche d'informations dans des bases de donn{\'e}es multim{\'e}dia semi-structur{\'e}es, {EGC}'2003 }, publisher={{LIRIS} }, pages={?? }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00096880/en/}, } %% hal-00279716, version 1 %% http://hal.archives-ouvertes.fr/hal-00279716/en/ @inproceedings{ZEBOULON:2003:HAL-00279716:1, title={{H}ybrid {C}onnectionist {A}pproach for {K}nowledge {D}iscovery from {W}eb {N}avigation {P}atterns}, author={{Z}eboulon, {A}rnaud and {B}ennani, {Y}oun{\`e}s and {B}enabdeslem, {K}halid}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique pour l'{E}ntreprise et les {S}yst{\`e}mes de {P}roduction - {LIESP} - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {U}niversit{\'e} {L}umi{\`e}re - {L}yon {II} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {L}yon }, booktitle={{ACS}/{IEEE} {AICCSA}: {ACS}/{IEEE} {I}nternational {C}onference on {C}omputer {S}ystems and {A}pplications }, pages={118-122 }, address={{T}unisie }, audience={internationale }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00279716/en/}, } %% hal-00084626, version 1 %% http://hal.archives-ouvertes.fr/hal-00084626/en/ @inproceedings{BAILLOT:2002:HAL-00084626:1, title={{C}hecking polynomial time complexity with types.}, author={{B}aillot, {P}atrick}, keywords={linear logic; lambda-calculus; type inference; polynomial time complexity.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {IFIP} {I}nternational conference on {T}heoretical {C}omputer {S}cience ({IFIP} {TCS}'02). {F}oundations of {I}nformation {T}echnology in the {E}ra of {N}etworking and {M}obile {C}omputing. }, publisher={{K}luwer }, pages={370-382 }, editor={{R}icardo {A}. {B}aeza-{Y}ates and {U}go {M}ontanari and {N}icola {S}antoro }, series={{IFIP} {C}onference {P}roceedings }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00084626/en/}, } %% hal-00279734, version 1 %% http://hal.archives-ouvertes.fr/hal-00279734/en/ @inproceedings{BENABDESLEM:2002:HAL-00279734:1, title={{V}isualization and analysis of web navigation data. {I}nternational}, author={{B}enabdeslem, {K}halid and {B}ennani, {Y}oun{\`e}s and {J}anvier, {E}ric}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique pour l'{E}ntreprise et les {S}yst{\`e}mes de {P}roduction - {LIESP} - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {U}niversit{\'e} {L}umi{\`e}re - {L}yon {II} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {L}yon - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {N}umsight - {M}inist{\`e}re de l'{E}nseignement {S}up{\'e}rieur et de la {R}echerche {S}cinetifique }, booktitle={{S}pringer {ICANN}: {I}nternational {C}onference on {A}rtificial {N}eural {N}etworks }, pages={486-491 }, address={{E}spagne }, audience={internationale }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00279734/en/}, } %% hal-00004061, version 1 %% http://hal.archives-ouvertes.fr/hal-00004061/en/ @inproceedings{DUTOIT:2002:HAL-00004061:1, title={{I}nferring knowledge from a large semantic network}, author={{D}utoit, {D}ominique and {P}oibeau, {T}hierry}, abstract={{I}n this paper, we present a rich semantic network based on a differential analysis. {W}e then detail implemented measures that take into account common and differential features between words. {I}n a last section, we describe some industrial applications.}, keywords={semantic network, knowledge acquisition}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {M}emodata et {CRISCO} - {CRISCO} }, booktitle={{A}ctes de la conf{\'e}rence {C}omputational {L}inguistics ({COLING} 2002) }, publisher={{A}ssociation for {C}omputational {L}inguistics }, pages={232-238 }, address={{T}aipei }, editor={{W}ilfred {L}enders }, ARXIVID={cs/0501072 }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00004061/en/}, } %% hal-00279762, version 1 %% http://hal.archives-ouvertes.fr/hal-00279762/en/ @inproceedings{BENABDESLEM:2001:HAL-00279762:1, title={{A}nalyse comportementale des internautes.}, author={{B}enabdeslem, {K}halid and {B}ennani, {Y}oun{\`e}s and {J}anvier, {E}ric}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'{I}nformatique pour l'{E}ntreprise et les {S}yst{\`e}mes de {P}roduction - {LIESP} - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {U}niversit{\'e} {L}umi{\`e}re - {L}yon {II} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {L}yon - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {N}umsight - {M}inist{\`e}re de l'{E}nseignement {S}up{\'e}rieur et de la {R}echerche {S}cinetifique }, booktitle={{A}ctes de {JT}-{EDI} 1{\`e}re journ{\'e}e th{\'e}matique sur l’exploration des donn{\'e}es sur {I}nternet }, pages={28-38 }, address={{F}rance }, audience={nationale }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00279762/en/}, } %% hal-00279748, version 1 %% http://hal.archives-ouvertes.fr/hal-00279748/en/ @inproceedings{BENABDESLEM:2001:HAL-00279748:1, title={{C}onnectionist approach for {W}ebsite visitors behaviors mining}, author={{B}enabdeslem, {K}halid and {B}ennani, {Y}oun{\`e}s and {J}anvier, {E}ric}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique pour l'{E}ntreprise et les {S}yst{\`e}mes de {P}roduction - {LIESP} - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {U}niversit{\'e} {L}umi{\`e}re - {L}yon {II} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {L}yon - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {N}umsight - {M}inist{\`e}re de l'{E}nseignement {S}up{\'e}rieur et de la {R}echerche {S}cinetifique }, booktitle={{ACS}/{IEEE} {ACS}/{IEEE} {I}nternational {C}onference on {C}omputer {S}ystems and {A}pplications }, pages={511-515 }, address={{L}iban }, audience={internationale }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00279748/en/}, } %% hal-00134604, version 1 %% http://hal.archives-ouvertes.fr/hal-00134604/en/ @inproceedings{BLIN:2001:HAL-00134604:1, title={{A} {V}ery {F}ast ({L}inear {T}ime) {D}istributed {A}lgorithm, on {G}eneral {G}raphs, for the {M}inimum-{W}eight {S}panning {T}ree}, author={{B}lin, {L}{\'e}lia and {B}utelle, {F}ranck}, abstract={{T}his paper develops linear time distributed algorithm, on general graphs, for the minimum spanning tree, in asynchronous communication network. {W}e concentrated our efforts on the improvement of the execution time this is why our algorithm is faster than all previous linear algorithms. {O}ur algorithm propose a solution for computing the {MST} in time $n/2$ with ${O}(n^2)$ messages (where $n=|{V}|$ for a graph ${G}=({V},{E})$). {T}he total number of messages in the worst case is slightly higher than the others algorithms, but in practice is often better.}, keywords={{S}yst{\`e}mes distribu{\'e}s et parall{\`e}les; {G}raphes, combinatoire; {O}ptimisation; {I}nformatique th{\'e}orique}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}tudia {I}nformatica {U}niversalis, {H}ors {S}{\'e}rie ({OPODIS}'2001), {N}°{ISBN}:2-912590-14-0 }, publisher={{SUGER} }, pages={113-124 }, series={{V}ol.2 {H}ors-{S}{\'e}rie 2. }, audience={internationale }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00134604/en/}, } %% hal-00086292, version 1 %% http://hal.archives-ouvertes.fr/hal-00086292/en/ @inproceedings{DUCHAMP:2000:HAL-00086292:1, title={{C}ongruences {C}ompatible with the {S}huffle {P}roduct}, author={{D}uchamp, {G}{\'e}rard and {L}uque, {J}ean-{G}abriel}, abstract={{T}his article is devoted to the study of monoids which can be endowed with a shuffle product with coefficients in a semiring. {W}e show that, when the multiplicities do not belong to a ring with prime characteristic, such a monoid is a monoid of traces. {W}hen the characteristic is prime, we give a decomposition of the congruences $\equiv$ (or relators ${R}$) such that ${A}^*/_\equiv=\langle {A}; {R}\rangle$ admits a shuffle product. {T}his decomposition involves only addition of primitive elements to the successive quotients. {T}o end with, we study the compatibility with {M}agnus transformation and examine the case of congruences which are homogeneous for some weight function. {T}he existence of such a weight function is also showed for congruences of depth one.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique }, booktitle={{F}ormal {P}ower {S}eries and {A}lgebraic {C}ombinatorics }, publisher={{S}pringer }, pages={422-431 }, editor={{D}. {K}rob, {A}.{A}. {M}ikhalev, {A}.{V}. {M}ikhalev {E}ds }, series={12th {I}nternational {C}onference, {FPSAC}'00, {M}oscow, {R}ussia, {J}une 2000 }, ARXIVID={math.CO/0607419 }, year={2000}, URL={http://hal.archives-ouvertes.fr/hal-00086292/en/}, } %% hal-00077423, version 1 %% http://hal.archives-ouvertes.fr/hal-00077423/en/ @inproceedings{BOUTHINON:1999:HAL-00077423:1, title={{A}spects th{\'e}oriques et pratiques de l'apprentissage en cas d'incompl{\'e}tude des donn{\'e}es : {\'e}tendre l'apprentissage par satisfiabilit{\'e}}, author={{B}outhinon, {D}ominique and {S}oldano, {H}enry and {V}entos, {V}{\'e}ronique}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{C}onf{\'e}rence d'apprentissage {CAP}99-{AFIA} }, publisher={{E}cole {P}olytechnique, {P}alaiseau }, pages={45-152 }, year={1999}, URL={http://hal.archives-ouvertes.fr/hal-00077423/en/}, } %% hal-00177508, version 1 %% http://hal.archives-ouvertes.fr/hal-00177508/en/ @inproceedings{BUTELLE:1999:HAL-00177508:1, title={{D}istributed {A}lgorithms for {A}ll-{P}airs {S}hortest {P}aths and {M}inimum {D}iameter {S}panning {T}ree {P}roblems}, author={{B}utelle, {F}ranck and {L}avault, {C}hristian}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{D}istributed {C}omputing, 2nd {I}nternational {C}onference {O}n {P}rinciples {O}f {D}istributed {S}ystems. {OPODIS} 98 }, publisher={{H}ermes }, pages={77--88 }, address={{A}miens {F}rance }, editor={{A}lain {B}ui and {V}incent {V}illain }, audience={internationale }, year={1999}, URL={http://hal.archives-ouvertes.fr/hal-00177508/en/}, } %% inria-00074344, version 1 %% http://hal.inria.fr/inria-00074344/en/ @inproceedings{GRUMBACH:1999:INRIA-00074344:1, title={{O}n the {E}xpressive {P}ower of {C}ounting}, author={{G}rumbach, {S}t{\'e}phane and {T}ollu, {C}hristophe}, abstract={{W}e investigate the expressive power of various extensions of first-order, inductive, and infinitary logic with counting quantifiers. {W}e consider in particular a {LOGSPACE} extension of first-order logic, and a {PTIME} extension of fixpoint logic with counters. {C}ounting is a fundamental tool of algorithms. {I}t is essential in the case of unordered structures. {O}ur aim is to understand the expressive power gained with a limited counting ability. {W}e consider two problems: (i) unnested counters, and (ii) counters with no free variables. {W}e prove a hierarchy result based on the arity of the counters under the first restriction. {T}he proof is based on a game technique that is introduced in the paper. {W}e also establish results on the asymptotic probabilities of sentences with counters under the second restriction. {I}n particular, we show that first-order logic with equality of the cardinalities of relations has a 0/1 law.}, keywords={{QUERY} {LANGUAGES} / {FIRST}-{ORDER} {LOGIC} / {INDUCTIVE} {LOGIC} / {INFINITARY} {LOGIC} / {COUNTING} / {GENERALIZED} {QUANTIFIERS} / {FINITE} {MODELTHEORY} / {DESCRIPTIVE} {COMPLEXITY}}, language={{A}nglais}, affiliation={{INRIA} {R}ocquencourt - {INRIA} - {VERSO} - {INRIA} {R}ocquencourt - {INRIA} - {CNRS} : {UMR}8629 - {CNRS} : {UMR}7161 - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{F}ourth {I}nternational {C}onference on {D}atabase {T}heory ({ICDT} '92) }, publisher={{E}lsevier / {S}pringer {LNCS} }, pages={67-99 }, address={{B}erlin / {G}ermany }, volume={49/1 }, note={http://www.springerlink.com/content/f713305702708547/?p=e5505b568c714aaab33444b548f67070\&pi=7 {RR}-2330 }, audience={non sp{\'e}cifi{\'e}e }, doi={10.1016/0304-3975(95)00026-{S} }, day={14}, month={10}, year={1992}, URL={dx.doi.org/10.1016/0304-3975(95)00026-{S} http://hal.inria.fr/inria-00074344/en/}, } %% hal-00094942, version 1 %% http://hal.archives-ouvertes.fr/hal-00094942/en/ @inproceedings{HAMON:1999:HAL-00094942:1, title={{D}{\'e}tection de liens de synonymie : compl{\'e}mentarit{\'e} des ressources g{\'e}n{\'e}rales et sp{\'e}cialis{\'e}es}, author={{H}amon, {T}hierry and {G}arcia, {D}aniela and {N}azarenko, {A}deline}, abstract={{D}ans le cadre d'une aide {\`a} la structuration de terminologies, l'utilisation de donn{\'e}es s{\'e}mantiques g{\'e}n{\'e}rales nous a conduits {\`a} proposer des r{\`e}gles d'inf{\'e}rence de liens de synonymie entre des candidats termes complexes. {A}u regard de l'{\'e}valuation faite par un expert du domaine en contexte applicatif, il s'av{\`e}re que nous obtenons des r{\'e}sultats int{\'e}ressants. {C}es premiers r{\'e}sultats montrent que, contrairement {\`a} une opinion assez largement admise, l'utilisation de ressources g{\'e}n{\'e}rales comme un dictionnaire de langue pour le traitement de documents techniques se justifie. {N}ous cherchons ici {\`a} caract{\'e}riser plus pr{\'e}cis{\'e}ment l'apport de ces ressources. {N}ous avons confront{\'e} les r{\'e}sultats obtenus aux liens inf{\'e}r{\'e}s {\`a} partir de ressources lexicales plus sp{\'e}cialis{\'e}es. {I}l s'av{\`e}re que peu de liens inf{\'e}r{\'e}s sont communs d'une ressource {\`a} l'autre. {C}eci souligne la compl{\'e}mentarit{\'e} des diff{\'e}rentes sources et l'int{\'e}r{\^e}t sp{\'e}cifique des informations de la langue g{\'e}n{\'e}rale pour la structuration de terminologies.}, keywords={structuration de terminologie ; variation s{\'e}mantique ; synonymie ; ressources lexicales ; langue sp{\'e}cialis{\'e}e vs. langue g{\'e}n{\'e}rale}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {EDF}-{DER}-{IMA}-{TIEM}-{SOAD} - {SOAD} - {EDF} }, booktitle={{A}ctes de {T}erminologie et {I}ntelligence {A}rtificielle 99 }, publisher={{TIA} }, pages={45-58 }, year={1999}, URL={http://hal.archives-ouvertes.fr/hal-00094942/en/}, } %% hal-00090074, version 1 %% http://hal.archives-ouvertes.fr/hal-00090074/en/ @inproceedings{HAMON:1998:HAL-00090074:1, title={{U}sing general semantic information to help the terminology structuration}, author={{H}amon, {T}hierry and {N}azarenko, {A}deline}, keywords={{T}erminologie; {S}ynonymie; dictionnaire; langue g{\'e}n{\'e}rale}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {F}irst {I}nternational {C}onference on {L}anguage {R}esources and {E}valuation }, publisher={{ELDA} }, pages={675-680 }, year={1998}, URL={http://hal.archives-ouvertes.fr/hal-00090074/en/}, } %% hal-00009174, version 1 %% http://hal.archives-ouvertes.fr/hal-00009174/en/ @inproceedings{HAMON:1998:HAL-00009174:1, title={{A} step towards the detection of semantic variants of terms in technical documents}, author={{H}amon, {T}hierry and {N}azarenko, {A}deline and {G}ros, {C}{\'e}cile}, abstract={{T}his paper reports the results of a preliminary experiment on the detection of semantic variants of terms in a {F}rench technical document. {T}he general goal of our work is to help the structuration of terminologies. {T}wo kinds of semantic variants can be found in traditional terminologies : strict synonymy links and fuzzier relations like see-also. {W}e have designed three rules which exploit general dictionary information to infer synonymy relations between complex candidate terms. {T}he results have been examined by a human terminologist. {T}he expert has judged that half of the overall pairs of terms are relevant for the semantic variation. {H}e validated an important part of the detected links as synonymy. {M}oreover, it appeared that numerous errors are due to few mis-interpreted links: they could be eliminated by few exception rules.}, keywords={{T}erminology, synonymy, {NLP}}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {EDF} - {D}irection des {E}tudes et {R}echerche - {EDF} - {EDF} }, booktitle={{P}roceedings of the 36th {A}nnual {M}eeting of the {A}ssociation for {C}omputational {L}inguistics and the 17th {I}nternational {C}onference on {C}omputational {L}inguistics ({COLING}-{ACL}'98) }, pages={498-504 }, year={1998}, URL={http://hal.archives-ouvertes.fr/hal-00009174/en/}, } %% hal-00003371, version 1 %% http://hal.archives-ouvertes.fr/hal-00003371/en/ @inproceedings{VIENNET:1997:HAL-00003371:1, title={{C}onnectionnists {M}ethods for {H}uman {F}ace {P}rocessing}, author={{V}iennet, {E}mmanuel and {F}ogelman {S}ouli{\'e}, {F}rancoise}, abstract={{W}e show in this paper how {N}eural {N}etworks can be used for {H}uman {F}ace {P}rocessing. {I}n {P}art {I}, we show how {N}eural {N}etworks can be viewed as a particular class of {S}tatistical models. {W}e introduce learning as an estimation problem, then describe {M}ulti-{L}ayer {P}erceptrons ({MLP}) and {R}adial {B}asis {F}unction ({RBF}) networks, widely used {N}eural {N}etworks which we will use in {P}art~{II}, for face processing. {W}e further present {V}apnik's framework for learning, show the capacity/generalization dilemma and discuss its implications for {N}eural {N}etwork training and model selection. {V}apnik's ideas lead to a new interesting class of classifier, {S}upport {V}ector {M}achines, presented in section 3. {W}e then discuss the combination of models and give a formalism which allows to cooperatively train multi-modular {N}eural {N}etworks architectures. {F}inally, we present a multi-modular architecture to perform "{S}egmentation-{R}ecognition in the loop". {I}n {P}art {II}, we show how the presented models can be applied to build an efficient face localization and identification system. {T}he face images are detected by scanning the scene with a retina feeding a hierarchical coarse-to-fine classifier. {D}etections are then identified in a small family of known persons.}, keywords={modular neural networks; support vector machines; statistical learning therory; human face recognition; face localization.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{F}ace {R}ecognition: from theory to applications }, publisher={{S}pringer }, pages={124-156 }, editor={{H}. {W}echsler }, series={{NATO} {ASI} {S}eries {F}, vol. 163 }, year={1998}, URL={http://hal.archives-ouvertes.fr/hal-00003371/en/}, } %% inria-00077192, version 1 %% http://hal.inria.fr/inria-00077192/en/ @inproceedings{FAYOLLE:1993:INRIA-00077192:1, title={{A}symptotic probabilities of languages with generalized quantifiers}, author={{F}ayolle, {G}uy and {G}rumbach, {S}tephane and {T}ollu, {C}hristophe}, abstract={{W}e study the impact of adding certain families of generalized quantifiers to first-order logic ({FO}) on the asymptotic behavior of sentences. {A}ll our results are stated and proved for languages disallowing free variables in the scope of generalized quantifiers.for a class {K} of finite structures closed under isomorphism, the quantifier {Q}k is said to be strongly monotonic, sm, if membership in the class is preserved under a loose form of extensions. {O}ur first theorem (0/1 law for {FO} with any set of sm quantifiers) subsumes a previous criterion for proving that almost no graphs satisfy a given property. {W}e also establish a 0/1 law for {FO} with {H}artig quantifiers (equicardinality quantifiers) and a limit law for a fragment of {FO} with {R}escher quantifiers (expressing inequalities of cardinalities). {T}he proofs of these last two results combine standard combinatorial enumerations with more sophisticated techniques from complex analysis. {W}e also prove that the 0/1 law fails for the extension of {FO} with {H}artig quantifiers if the above syntactic restriction is relaxed. {W}e therefore get the best upper bound for the existence of a 0/1 law for {FO} with {H}artigg quantifiers.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {VERSO} - {INRIA} {R}ocquencourt - {INRIA} - {CNRS} : {UMR}8629 - {CNRS} : {UMR}7161 - {MEVAL} - {INRIA} {R}ocquencourt - {INRIA} }, booktitle={{E}ighth {A}nnual {IEEE} {S}ymposium on {L}ogic in {C}omputer {S}cience }, publisher={{IEEE} {C}omputer {S}ociety }, pages={199-207 }, address={{M}ontr{\'e}al / {C}anada }, note={{P}rojet {MEVAL}, {P}rojet {VERSO}/http://ieeexplore.ieee.org/ {RR}-1916 }, audience={non sp{\'e}cifi{\'e}e }, doi={10.1109/{LICS}.1993.287587 }, day={19}, month={06}, year={1993}, URL={dx.doi.org/10.1109/{LICS}.1993.287587 http://hal.inria.fr/inria-00077192/en/}, } %% edutice-00000632, version 1 %% http://edutice.archives-ouvertes.fr/edutice-00000632/en/ @inproceedings{CHANIER:1992:EDUTICE-00000632:1, title={{M}odelling lexical phrases acquisition in {L}2}, author={{C}hanier, {T}hierry and {C}olmerauer, {C}olette and {F}ouquer{\'e}, {C}hristophe and {A}beill{\'e}, {A}nne and {P}icard, {F}rancoise and {Z}ock, {M}ichael}, abstract={{T}he study focuses on the following points. {I}t compares the views psycholinguists and computational linguists have concerning the processes of lexical access and lexical choice. {T}hen it shows the similarities holding between the structure of the lexicon in {L}1 and in {L}2. {I}t tries to offer a pedagogically realistic approach in vocabulary teaching based on these results.}, language={{A}nglais}, affiliation={{U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {L}aboratoire d'{I}nformatique de {F}rance-{C}omt{\'e} - {UNIVERSIT}{\'E} {DE} {FRANCHE}-{COMT}{\'E} _ {LIFC} - {A}ucune - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - universit{\'e}s {P}ierre et {M}arie {C}urie ({P}aris-6) et {P}aris-{S}ud ({P}aris-11) - {L}aboratoire d'{I}nformatique pour la {M}{\'e}canique et les {S}ciences de l'{I}ng{\'e}nieur - {LIMSI} - {A}ucune - {U}niversit{\'e} {A}ix-{M}arseille 2 - {LABORATOIRE} {DE} {LANGUES} - {A}ucune - {U}niversit{\'e} {P}aris 8 - {D}{\'E}{PARTEMENT} {DE} {SCIENCES} {DU} {LANGAGE} - {A}ucune }, booktitle={{S}econd {L}anguage {A}cquisition {R}esearch: {T}he state of the art }, address={{U}trecht {P}ays-{B}as }, year={1992}, URL={http://edutice.archives-ouvertes.fr/edutice-00000632/en/}, } %% hal-00250258, version 1 %% http://hal.archives-ouvertes.fr/hal-00250258/en/ @inproceedings{CZACHORSKI:2008:HAL-00250258:1, title={{U}n mod{\`e}le d’approximation de diffusion pour la distribution du temps d’acheminement des paquets dans les r{\'e}seaux de senseurs}, author={{C}zach{\'o}rski, {T}adeusz and {G}rochla, {K}rzysztof and {P}ekergin, {F}erhan}, abstract={{N}ous proposons un mod{\`e}le qui s’appuie sur l’approximation de diffusion pour l’estimation de la fonction de densit{\'e} de probabilit{\'e} du temps d’acheminement des paquets dans un r{\'e}seaux de senseurs sans fils {\`a} sauts multiples. {D}ans sa forme g{\'e}n{\'e}rale, le mod{\`e}le tient compte d’une part de la non homog{\'e}n{\'e}it{\'e} du milieu de propagation et de la r{\'e}partition des noeuds interm{\'e}diaires dans l’espace et d’autre part, des {\'e}ventuels changements des caract{\'e}ristiques du r{\'e}seau dans le temps. {L}a retransmission des paquets perdus est {\'e}galement pris en compte dans le mod{\`e}le.}, keywords={approximation de diffusion, analyse transitoire, r{\'e}seaux sans fils, r{\'e}seaux de capteurs}, language={{F}ran{\c{c}}ais}, affiliation={{T}he {I}nstitute of {T}heoretical and {A}pplied {I}nformatics - {IIT}i{S} - {P}olish {A}cademy of {S}ciences - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{C}olloque {F}rancophone sur l’{I}ng{\'e}nierie des {P}rotocoles ({CFIP}) }, address={{L}es {A}rcs {F}rance }, day={25}, month={03}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00250258/en/}, } %% hal-00154172, version 1 %% http://hal.archives-ouvertes.fr/hal-00154172/en/ @inproceedings{ALFANDARI:2007:HAL-00154172:1, title={{A}pproximation du probl{\`e}me de localisation de centres {\`a} capacit{\'e}s variables}, author={{A}lfandari, {L}aurent}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{ROADEF} 2007 }, address={{G}renoble {F}rance }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00154172/en/}, } %% hal-00154161, version 1 %% http://hal.archives-ouvertes.fr/hal-00154161/en/ @inproceedings{ALFANDARI:2007:HAL-00154161:1, title={{A} greedy approximation algorithm for the soft-capacitated facility location problem}, author={{A}lfandari, {L}aurent}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{EURO} {XXII} }, address={{P}rague {T}ch{\`e}que, {R}{\'e}publique }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00154161/en/}, } %% hal-00152823, version 1 %% http://hal.archives-ouvertes.fr/hal-00152823/en/ @inproceedings{LETOCART:2007:HAL-00152823:1, title={{R}{\'e}optimisation dans les m{\'e}thodes lagrangiennes pour le sac-{\`a}-dos quadratique}, author={{L}{\'e}tocart, {L}ucas and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique {T}h{\'e}orique et {A}ppliqu{\'e}e - {LITA} - {U}niversit{\'e} {P}aul {V}erlaine - {M}etz }, booktitle={1{\`e}re journ{\'e}e {K}nap{S}ack et {O}ptimisation }, address={{F}rance }, day={09}, month={03}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00152823/en/}, } %% hal-00152817, version 1 %% http://hal.archives-ouvertes.fr/hal-00152817/en/ @inproceedings{LETOCART:2007:HAL-00152817:1, title={{I}n{\'e}galit{\'e}s valides pour le probl{\`e}me de multiflot maximum}, author={{L}{\'e}tocart, {L}ucas}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={2{\`e}me journ{\'e}e scientifique {P}oly{\`e}dres et {O}ptimisation {C}ombinatoire }, address={{P}aris {F}rance }, day={30}, month={03}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00152817/en/}, } %% hal-00152262, version 1 %% http://hal.archives-ouvertes.fr/hal-00152262/en/ @inproceedings{LETOCART:2007:HAL-00152262:1, title={{R}e-optimization in the resolution of the 0-1 quadratic knapsack problem}, author={{L}{\'e}tocart, {L}ucas and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, abstract={{W}e want to solve exactly large instances of the 0-1 quadratic knapsack problem with a branch-and-bound algorithm. {T}hus we need to obtain good lower and upper bounds in order to fix variables in the preprocessing phase at the root node of the search tree. {W}e introduce reoptimization technics in this preprocessing phase using the lagrangian relaxation of {C}aprara, {P}isinger and {T}oth and the lagrangian decomposition of {B}illionnet and {S}outif. {R}eoptimization technics are used to reduce importantly (up to 60%) the number of iterations in the linear knapsack resolutions done in both lagrangian methods.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique {T}h{\'e}orique et {A}ppliqu{\'e}e - {LITA} - {U}niversit{\'e} {P}aul {V}erlaine - {M}etz }, booktitle={{EURO} {XXII} }, address={{P}rague {T}ch{\`e}que, {R}{\'e}publique }, day={09}, month={07}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00152262/en/}, } %% hal-00152260, version 1 %% http://hal.archives-ouvertes.fr/hal-00152260/en/ @inproceedings{LETOCART:2007:HAL-00152260:1, title={{N}ew bounds for the 0-1 exact k-item quadratic knapsack problem}, author={{L}{\'e}tocart, {L}ucas and {P}lateau, {M}arie-{C}hristine and {P}lateau, {G}{\'e}rard}, abstract={{T}he 0-1 exact k-item quadratic knapsack problem consists of maximizing a quadratic function subject to a linear capacity constraint and to an equality cardinality constraint. {W}e want to solve exactly large instances of this problem with a branch-and-bound algorithm. {T}hus we need to obtain good lower and upper bounds in order to fix as much as possible variables in the preprocessing phase at the root node of the search tree. {T}o get lower bounds, we propose two new heuristics, the first one is derived from a classical heuristics devoted to the quadratic knapsack problem (a greedy algorithm followed by a fill-up and exchange procedure), the second one is based on a semi-definite relaxation of the problem. {D}ifferent technics are also proposed for the upper bounds, one of them uses a quadratic convex reformulation to obtain a good continuous relaxation, the other ones are based on lagrangian relaxations and decompositions. {N}umerical experiments over randomly generated instances validate the relevance of these new bounds.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers }, booktitle={{ECCO} {XX} }, address={{L}imassol {C}hypre }, day={24}, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00152260/en/}, } %% hal-00154162, version 1 %% http://hal.archives-ouvertes.fr/hal-00154162/en/ @inproceedings{PLATEAU:2007:HAL-00154162:1, title={{E}dge cover by bipartite subgraphs}, author={{P}lateau, {M}arie-{C}hirstine and {L}iberti, {L}eo and {A}lfandari, {L}aurent}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={6th {CTW} {W}orkshops }, address={{E}nschende {P}ays-{B}as }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00154162/en/}, } %% hal-00152264, version 1 %% http://hal.archives-ouvertes.fr/hal-00152264/en/ @inproceedings{TOUATI:2007:HAL-00152264:1, title={{D}iversification des solutions et r{\'e}optimisation pour la r{\'e}solution de probl{\`e}mes de plus court chemin avec contraintes de ressources dans un sch{\'e}ma de g{\'e}n{\'e}ration de colonnes}, author={{T}ouati, {N}ora and {L}{\'e}tocart, {L}ucas and {N}agih, {A}nass}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique {T}h{\'e}orique et {A}ppliqu{\'e}e - {LITA} - {U}niversit{\'e} {P}aul {V}erlaine - {M}etz }, booktitle={{FRANCORO} {V} / {ROADEF} 2007 }, address={{G}renoble {F}rance }, day={20}, month={02}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00152264/en/}, } %% hal-00155224, version 1 %% http://hal.archives-ouvertes.fr/hal-00155224/en/ @inproceedings{TOULOUSE:2007:HAL-00155224:1, title={{A}pproximation diff{\'e}rentielle : histoire, motivations, enjeux}, author={{T}oulouse, {S}ophie}, abstract={{C}ette pr{\'e}sentation arborde l'approximation diff{\'e}rentielle sous deux angles essentiels : le premier concerne les algorithmes {\`a} garantie de performance et consiste {\`a} mener une r{\'e}flexion quant {\`a} la notion m{\^e}me de garantie ; le second s'int{\'e}resse pour sa part aux aspects fondamentaux de l'approximation en discutant des question cruciales lev{\'e}es par l'analyse diff{\'e}rentielle quant {\`a} la structuration induite de {NPO}.}, keywords={algorithmes {\`a} garantie de performance ; structure de {NPO} ; approximation diff{\'e}rentielle}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{ROADEF} 2007 }, address={{G}renoble {F}rance }, note={pp 423-424 }, month={02}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00155224/en/}, } %% hal-00098033, version 1 %% http://hal.archives-ouvertes.fr/hal-00098033/en/ @inproceedings{AITELMEKKI:2006:HAL-00098033:1, title={{A}n application-oriented terminology evaluation: the case of back-of-the book indexes}, author={{A}{\"i}t {E}l {M}ekki, {T}ouria and {N}azarenko, {A}deline}, abstract={{T}his paper addresses the problem of computational terminology evaluation not per se but in a specific application context. {T}his paper describes the evaluation procedure that has been used to assess the validity of our overall indexing approach and the quality of the {I}nd{D}oc indexing tool. {E}ven if user-oriented extended evaluation is irreplaceable, we argue that early evaluations are possible and they are useful for development guidance.}, keywords={{E}valuation ; terminology ; back-of-the-book index}, language={{A}nglais}, affiliation={{L}aboratoire d'{E}tude et de {R}echerche en {I}nformatique d'{A}ngers - {LERIA} - {U}niversit{\'e} d'{A}ngers - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{W}orkshop on {T}erminology design: quality criteria and evaluation methods ({T}erm{E}val) }, address={{G}enoa {I}talie }, note={4 pages {H}.3.1 }, ARXIVID={cs.AI/0609133 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00098033/en/}, } %% hal-00154173, version 1 %% http://hal.archives-ouvertes.fr/hal-00154173/en/ @inproceedings{ALFANDARI:2006:HAL-00154173:1, title={{U}n mod{\`e}le de planification des rotations culturales dans un contexte de lutte contre la d{\'e}forestation {\`a} {M}adagascar}, author={{A}lfandari, {L}aurent and {L}emalade, {J}ean-{L}uc and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{ROADEF} 2006 }, address={{L}ille {F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00154173/en/}, } %% hal-00154163, version 1 %% http://hal.archives-ouvertes.fr/hal-00154163/en/ @inproceedings{ALFANDARI:2006:HAL-00154163:1, title={{A} {MIP} flow model for crop rotation planning in a sustainable development context}, author={{A}lfandari, {L}aurent and {L}emalade, {J}ean-{L}uc and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{EURO} {XXI} }, address={{R}eykjavik {I}slande }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00154163/en/}, } %% hal-00085547, version 3 %% http://hal.archives-ouvertes.fr/hal-00085547/en/ @inproceedings{BAILLOT:2006:HAL-00085547:3, title={{A}n {E}mbedding of the {BSS} {M}odel of {C}omputation in {L}ight {A}ffine {L}ambda-{C}alculus.}, author={{B}aillot, {P}atrick and {P}edicini, {M}arco}, abstract={{T}his paper brings together two lines of research: implicit characterization of complexity classes by {L}inear {L}ogic ({LL}) on the one hand, and computation over an arbitrary ring in the {B}lum-{S}hub-{S}male ({BSS}) model on the other. {G}iven a fixed ring structure {K} we define an extension of {T}erui's light affine lambda-calculus typed in {LAL} ({L}ight {A}ffine {L}ogic) with a basic type for {K}. {W}e show that this calculus captures the polynomial time function class {FP}({K}): every typed term can be evaluated in polynomial time and conversely every polynomial time {BSS} machine over {K} can be simulated in this calculus.}, keywords={lambda-calculus; {B}lum-{S}hub-{S}male model; polynomial time complexity; light linear logic; linear logic}, language={{A}nglais}, affiliation={{I}stituto per le {A}pplicazioni del {C}alcolo" {M}. {P}icone ({IAC}) - {C}onsiglio {N}azionale delle {R}icerche - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={8th {I}nternational {W}orkshop on {L}ogic and {C}omputational {C}omplexity {S}eattle, {A}ugust 10 - 11, 2006 ({S}atellite {W}orkshop of {FLOC}-{LICS} 2006) }, address={{S}eattle {\'E}tats-{U}nis d'{A}m{\'e}rique }, note={11 pages. {A} preliminary version appeared as {R}esearch {R}eport {IAC} {CNR} {R}oma , {N}.57 (11/2004), november 2004. {C}ooperation project "{I}nteraction et complexit{\'e}" {CNR}/{CNRS}, projects {GEOCAL} ({ACI}) , {NO}-{COST} ({ANR}) . }, ARXIVID={cs.LO/0608040 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085547/en/}, } %% hal-00023668, version 1 %% http://hal.archives-ouvertes.fr/hal-00023668/en/ @inproceedings{BAILLOT:2006:HAL-00023668:1, title={{O}n {Q}uasi-{I}nterpretations, {B}lind {A}bstractions and {I}mplicit {C}omplexity}, author={{B}aillot, {P}atrick and {D}al {L}ago, {U}go and {M}oyen, {J}ean-{Y}ves}, abstract={{Q}uasi-interpretations are a technique to guarantee complexity bounds on first-order functional programs: with termination orderings they give in particular a sufficient condition for a program to be executable in polynomial time, called here the {P}-criterion. {W}e study properties of the programs satisfying the {P}-criterion, in order to better understand its intensional expressive power. {G}iven a program on binary lists, its blind abstraction is the non-deterministic program obtained by replacing lists by their lengths (natural numbers). {A} program is blindly polynomial if its blind abstraction terminates in polynomial time. {W}e show that all programs satisfying a variant of the {P}-criterion are in fact blindly polynomial. {T}hen we give two extensions of the {P}-criterion: one by relaxing the termination ordering condition, and the other one (the bounded value property) giving a necessary and sufficient condition for a program to be polynomial time executable, with memoisation.}, keywords={quasi-interpretation ; implicit complexity ; term rewriting system ;}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {D}ipartimento di {S}cienze dell'{I}nformazione - {U}niversit{\`a} degli studi di {B}ologna }, booktitle={8th {I}nternational {W}orkshop on {L}ogic and {C}omputational {C}omplexity ({LCC}'06), {A}ugust 10 - 11, 2006 ({S}atellite {W}orkshop of {FLOC}-{LICS} 2006) }, address={{S}eattle {\'E}tats-{U}nis d'{A}m{\'e}rique }, note={{ANR} {N}o{C}ost {ACI} {CRISS} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00023668/en/}, } %% hal-00152860, version 1 %% http://hal.archives-ouvertes.fr/hal-00152860/en/ @inproceedings{BANDERIER:2006:HAL-00152860:1, title={{A}verage queue length and area below lattice paths}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}of{A}'2006 }, address={{F}rance }, month={07}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00152860/en/}, } %% hal-00084653, version 1 %% http://hal.archives-ouvertes.fr/hal-00084653/en/ @inproceedings{BENABDESLEM:2006:HAL-00084653:1, title={{C}lassification et visualisation des donn{\'e}es d'usages d'{I}nternet}, author={{B}enabdeslem, {K}halid and {B}ennani, {Y}oun{\`e}s}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}telier « {F}ouille du {W}eb », 6{\`e}me {EGC}'06 ({E}xtraction et {G}estion des {C}onnaissances) }, address={{V}illeneuve d'{A}scq {F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084653/en/}, } %% hal-00084652, version 1 %% http://hal.archives-ouvertes.fr/hal-00084652/en/ @inproceedings{BENABDESLEM:2006:HAL-00084652:1, title={{D}endogram based {SVM} for multi-class classification}, author={{B}enabdeslem, {K}halid and {B}ennani, {Y}oun{\`e}s}, abstract={{T}his paper presents a new approach called dendogram based support vector machines ({DSVM}), to treat multi-class problems. {F}irst, the method consists to build a taxonomy of classes in an ascendant manner done by ascendant hierarchical clustering method ({AHC}). {S}econd, {SVM} is injected at each internal node of the taxonomy in order to separate the two subsets of the current node. {F}inally, for classifying a pattern query, we present it to the “root” {SVM}, and then according to the output, the pattern is presented to one of the two {SVM}s of the subsets, and so on through the “leaf” nodes. {T}herefore, the classification procedure is done in a descendant way in the taxonomy from the root through the end level which represents the classes. {T}he pattern is thus associated to one of last {SVM}s associated class. {AHC} decomposition uses distance measures to investigate the class grouping in binary form at each level in the hierarchy. {SVM} method requires little tuning and yields both high accuracy levels and good generalization for binary classification. {T}herefore, {DSVM} method gives good results for multi class problems by both, training an optimal number of {SVM}s and rapidly classifying patterns in a descendant way by selecting an optimal set of {SVM}s which participate to the final decision. {T}he proposed method is compared to other multi-class {SVM} methods over several complex problems.}, keywords={{AHC}, {SVM}, {M}ulti-class problems.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={28th {I}nternational {C}onference {I}nformation {T}echnology {I}nterfaces {ITI} }, address={{C}avtat / {D}ubrovnik {C}roatie }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084652/en/}, } %% hal-00085170, version 1 %% http://hal.archives-ouvertes.fr/hal-00085170/en/ @inproceedings{BOUFFIER:2006:HAL-00085170:1, title={{S}egmentation et structuration de textes proc{\'e}duraux pour l'aide {\`a} la mod{\'e}lisation de connaissances : le r{\^o}le de la structure visuelle}, author={{B}ouffier, {A}manda and {P}oibeau, {T}hierry}, abstract={{D}ans cet article, nous {\'e}tudions le r{\^o}le de la structure visuelle pour la segmentation de textes proc{\'e}duraux. {N}ous nous focalisons sur un type de textes proc{\'e}duraux particulier : les {G}uides de {B}onnes {P}ratiques m{\'e}dicales. {U}ne {\'e}tude linguistique effectu{\'e}e sur ce corpus montre la pertinence ainsi que les limites des indices visuels, pour d{\'e}limiter des ensembles conditions-actions, qui forment des unit{\'e}s s{\'e}mantiques de base pour la segmentation. {C}ette {\'e}tude a permis de d{\'e}finir une architecture modulaire qui exploite ces indices pour segmenter et structurer les textes.}, keywords={{A}ide {\`a} la mod{\'e}lisation ; {T}raitement {A}utomatique des {L}angues, linguistique textuelle ; textes proc{\'e}duraux ; {G}uides de {B}onnes {P}ratiques}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}emaine de la {C}onnaissance }, address={{C}aen {F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085170/en/}, } %% hal-00101577, version 1 %% http://hal.archives-ouvertes.fr/hal-00101577/en/ @inproceedings{BOURGOIS:2006:HAL-00101577:1, title={{R}{\'e}paration de {W}eb services composites}, author={{B}ourgois, {L}aure and {D}elteil, {A}lexandre and {L}{\'e}vy, {F}ran{\c{c}}ois}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{INFORSID} {A}telier {C}onception des syst{\`e}mes d'information et services {W}eb }, address={{T}unisie }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00101577/en/}, } %% hal-00096738, version 1 %% http://hal.archives-ouvertes.fr/hal-00096738/en/ @inproceedings{CERIN:2006:HAL-00096738:1, title={{A}rchitecture d'une grille de calcul {T}unisienne}, author={{C}{\'e}rin, {C}hristophe and {A}bbes {N}abil {A}bdennadher {M}ohamed {J}emni, {H}eithem}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{JTEA} }, address={{H}ammamet {T}unisie }, note={http://www.esstt.rnu.tn/jtea06/jtea06.html }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00096738/en/}, } %% hal-00096731, version 1 %% http://hal.archives-ouvertes.fr/hal-00096731/en/ @inproceedings{CERIN:2006:HAL-00096731:1, title={{G}eometrical {I}nterpretation for {D}ata {P}artitioning on a {G}rid {A}rchitecture}, author={{C}{\'e}rin, {C}hristophe and {B}ernardi {M}ichel {K}oskas {M}ohamed {J}emni {H}azem {F}kaier, {D}ominique}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={15th {I}nternational {S}ymposium on {H}igh {P}erformance {D}istributed {C}omputing ({HPDC} 2006) }, address={{P}aris {F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00096731/en/}, } %% hal-00098063, version 1 %% http://hal.archives-ouvertes.fr/hal-00098063/en/ @inproceedings{DERIVIERE:2006:HAL-00098063:1, title={{A} robust linguistic infrastructure for efficient web content analysis: the {ALVIS} project}, author={{D}erivi{\`e}re, {J}ulien and {H}amon, {T}hierry and {N}azarenko, {A}deline and {P}oibeau, {T}hierry and {W}eissenbacher, {D}avy}, abstract={{T}his paper focuses on the design and the development of a text processing architecture exploiting specialized {NLP} tools, to produce linguistically annotated documents. {T}his architecture is instanciated using existing {NLP} modules and resources which need to be tuned to specific domains. {T}aking as an example the biological domain, we show how a syntactic analyser can be adapted to this domain. {W}e focus on parsing since it exhibits various kinds of adaptation, ranging from unknown words analysis to specific vocabulary (terms, named entities) and structure identification.}, keywords={{N}atural language processing ; robust text analysis ; information retrieval ; semantic indexing}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}ymposium on {D}igital {S}emantic {C}ontent across {C}ultures }, address={{P}aris {F}rance }, note={15 pages {H}.3.1 {ALVIS} {STREP} project }, collaboration={{ALVIS} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00098063/en/}, } %% hal-00152880, version 1 %% http://hal.archives-ouvertes.fr/hal-00152880/en/ @inproceedings{ELBAZ:2006:HAL-00152880:1, title={{I}mproved time and space complexity for {K}ianfar's inequality rotation algorithm}, author={{E}l {B}az, {D}idier and {E}lkihel, {M}oussa and {G}{\'e}ly, {L}aurent and {P}lateau, {G}{\'e}rard}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'analyse et d'architecture des syst{\`e}mes - {LAAS} - {CNRS} : {UPR}8001 - {U}niversit{\'e} {P}aul {S}abatier - {T}oulouse {III} - {I}nstitut {N}ational {P}olytechnique de {T}oulouse - {INPT} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {T}oulouse }, booktitle={{META}'06, {W}orkshop" {M}{\'e}taheuristiques : de la th{\'e}orie aux applications" }, address={{H}ammamet {T}unisie }, day={03}, month={11}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00152880/en/}, } %% hal-00084495, version 1 %% http://hal.archives-ouvertes.fr/hal-00084495/en/ @inproceedings{FOUQUERE:2006:HAL-00084495:1, title={{L}ogic programming revisited}, author={{F}ouquer{\'e}, {C}hristophe and {M}ogbil, {V}irgile}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{GEOCAL} 06 }, address={{F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084495/en/}, } %% hal-00084654, version 1 %% http://hal.archives-ouvertes.fr/hal-00084654/en/ @inproceedings{GUERIF:2006:HAL-00084654:1, title={{C}onnectionist and {E}thological {A}pproaches for {D}iscovering {S}alient {F}acial {M}ovement {F}eatures in {H}uman {G}ender {R}ecognition}, author={{G}u{\'e}rif, {S}{\'e}bastien and {B}ennani, {Y}oun{\`e}s and {B}audoin, {C}laude}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{\'e}thologie exp{\'e}rimentale et compar{\'e}e - {LEEC} - {CNRS} : {UMR}7153 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={28th {I}nternational {C}onference {I}nformation {T}echnology {I}nterfaces {ITI} }, address={{C}avtat / {D}ubrovnik {C}roatie }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084654/en/}, } %% hal-00084651, version 1 %% http://hal.archives-ouvertes.fr/hal-00084651/en/ @inproceedings{GUERIF:2006:HAL-00084651:1, title={{S}election of {C}lusters {N}umber and {F}eatures {S}ubset during a {T}wo-{L}evels {C}lustering {T}ask}, author={{G}u{\'e}rif, {S}{\'e}bastien and {B}ennani, {Y}oun{\`e}s}, abstract={{S}imultaneous selection of the number of clusters and of a relevant subset of features is part of data mining challenges. {A} new approach is proposed to address this difficult issue. {I}t takes benefits of both two-levels clustering approaches and wrapper features selection algorithms. {O}n the one hands, the former enhances the robustness to outliers and to reduce the running time of the algorithm. {O}n the other hands, wrapper features selection ({FS}) approaches are known to given better results than filter {FS} methods because the algorithm that uses the data is taken into account. {F}irst, a {S}elf-{O}rganizing {M}aps ({SOM}), trained using the original data sets, is clustered using k-means and the {D}avies-{B}ouldin index to determinate the best number of a clusters. {T}hen, an individual pertinence measure guides the backward elimination procedure and the feature mutual pertinence is measure using a collective pertinence based on the quality of the clustering.}, keywords={{C}lustering, feature selection, self-organizing maps, model selection.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{T}he 10th {I}nternational {C}onference on {A}rtificial {I}ntelligence and {S}oft {C}omputing ({ASC}'06), {I}nternational {A}ssociation of {S}cience and {T}echnology for {D}evelopment ({IASTED}) }, address={{P}alma de {M}allorca {E}spagne }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084651/en/}, } %% hal-00084198, version 1 %% http://hal.archives-ouvertes.fr/hal-00084198/en/ @inproceedings{HILLAH:2006:HAL-00084198:1, title={{PN} standardisation: a survey}, author={{H}illah, {L}om and {K}ordon, {F}abrice and {P}etrucci, {L}aure and {T}r{\`e}ves, {N}icolas}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers }, booktitle={26th international conference on {F}ormal {M}ethods for {N}etworked and {D}istributed {S}ystems ({FORTE}'06) }, address={{P}aris {F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084198/en/}, } %% hal-00167108, version 1 %% http://hal.archives-ouvertes.fr/hal-00167108/en/ @inproceedings{JAFF:2006:HAL-00167108:1, title={{M}oderate {G}rowth {T}ime {S}eries for {D}ynamic {C}ombinatorics {M}odelisation}, author={{J}aff, {L}ua{\"i} and {H}.{E}. {D}uchamp, {G}{\'e}rard and {H}adj {K}acem, {H}atem and {B}ertelle, {C}yrille}, abstract={{H}ere, we present a family of time series with a simple growth constraint. {T}his family can be the basis of a model to apply to emerging computation in business and micro-economy where global functions can be expressed from local rules. {W}e explicit a double statistics on these series which allows to establish a one-to-one correspondence between three other ballot-like strunctures.}, keywords={{T}ime series; {C}omplex systems; {G}rowth constraint; local rules; {D}yck words; {P}ermutations; {C}odes}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique, de {T}raitement de l'{I}nformation et des {S}yst{\`e}mes - {LITIS} - {U}niversit{\'e} du {H}avre - {U}niversit{\'e} de {R}ouen - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ouen - {MIRACL} - {S}fax {U}niversity }, booktitle={{ECELM}-2 }, address={{T}irgu-{M}ures {R}oumanie }, ARXIVID={0708.2213 }, month={06}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00167108/en/}, } %% hal-00084655, version 1 %% http://hal.archives-ouvertes.fr/hal-00084655/en/ @inproceedings{JRAD:2006:HAL-00084655:1, title={{A}rtificial {I}ntelligence techniques in the dynamic negotiation of {Q}o{S}: {A} user interface for the {I}nternet {N}ew {G}eneration}, author={{J}rad, {Z}eina and {K}rief, {F}rancine and {D}ehni, {L}ahc{\`e}ne and {B}ennani, {Y}oun{\`e}s}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux }, booktitle={{I}nternational {F}ederation for {I}nformation {P}rocessing ({IFIP}) {TC}6 {C}onference {S}martnet in {A}utonomic {N}etworking }, address={{P}aris {F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084655/en/}, } %% hal-00084200, version 1 %% http://hal.archives-ouvertes.fr/hal-00084200/en/ @inproceedings{KANAWATI:2006:HAL-00084200:1, title={{U}ne approche {R}{\`a}{PC} pour la formation d'un comit{\'e} d'agents dans un syst{\`e}me de recommandation d'{\'e}gal-{\`a}-{\'e}gal}, author={{K}anawati, {R}ushed and {K}aroui, {H}ager and {P}etrucci, {L}aure}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={14{\`e}me atelier {R}{\`a}{PC} }, address={{B}esan{\c{c}}on {F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084200/en/}, } %% hal-00084196, version 1 %% http://hal.archives-ouvertes.fr/hal-00084196/en/ @inproceedings{KANAWATI:2006:HAL-00084196:1, title={{COBRAS}: {C}ooperative {CBR} {S}ystem for {B}ibliographical {R}eference {R}ecommendation}, author={{K}anawati, {R}ushed and {K}aroui, {H}ager and {P}etrucci, {L}aure}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={8th european conference on {C}ase {B}ased {R}easonning }, address={{\"O}l{\"u}deniz/{F}ethiye {T}urquie }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084196/en/}, } %% hal-00084194, version 1 %% http://hal.archives-ouvertes.fr/hal-00084194/en/ @inproceedings{KANAWATI:2006:HAL-00084194:1, title={{C}ooperative {CBR} system for peer agent committee formation}, author={{K}anawati, {R}ushed and {K}aroui, {H}ager and {P}etrucci, {L}aure}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={workshop on {A}gents and {P}eer-{T}o{P}eer {C}omputing }, address={{H}akodate {J}apon }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084194/en/}, } %% hal-00085035, version 1 %% http://hal.archives-ouvertes.fr/hal-00085035/en/ @inproceedings{LETOCART:2006:HAL-00085035:1, title={{R}{\'e}optimisation du sac-{\`a}-dos quadratique}, author={{L}{\'e}tocart, {L}ucas and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard and {O}uaras, {R}achid}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={7{\`e}me congr{\`e}s de la {S}oci{\'e}t{\'e} {F}ran{\c{c}}aise de {R}echerche {O}p{\'e}rationnelle et d'{A}ide {\`a} la {D}{\'e}cision }, address={{L}ille {F}rance }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085035/en/}, } %% hal-00085034, version 1 %% http://hal.archives-ouvertes.fr/hal-00085034/en/ @inproceedings{LETOCART:2006:HAL-00085034:1, title={{R}eoptimization in lagrangean methods for the quadratic knapsack problem}, author={{L}{\'e}tocart, {L}ucas and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, abstract={{T}he 0-1 quadratic knapsack problem consists in maximizing a quadratic function subject to a linear capacity constraint. {T}o solve exactly this problem with a branch and bound algorithm, we need to obtain good lower an upper bounds in order to fix a lot of variables in the pre-treatment phase at the root node of the branch and bound tree if we want to solve large instances. {W}e introduce reoptimization technics in this pre-treatment phase using the lagrangean relaxation of {C}aprara, {P}isinger and {T}oth and the lagrangean decomposition of {B}illionnet and {S}outif that give the best upper bounds known today. {R}eoptimization technics are used to reduce importantly (until 60%) the number of iterations in the linear knapsack resolutions done in both lagrangean methods.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={19th {I}nternational {S}ymposium on {M}athematical {P}rogramming }, address={{R}io de {J}aneiro {B}r{\'e}sil }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085034/en/}, } %% hal-00084197, version 1 %% http://hal.archives-ouvertes.fr/hal-00084197/en/ @inproceedings{MAZOUZ:2006:HAL-00084197:1, title={{M}odular {D}iscrete {P}seudo-{S}tate {G}raphs for {T}ime {P}etri {N}ets}, author={{M}azouz, {S}amia and {P}etrucci, {L}aure}, language={{A}nglais}, affiliation={{USTHB} - {USTHB} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={workshop on {M}odelling of {O}bjects, {C}omponents and {A}gents }, address={{T}urku {F}inlande }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084197/en/}, } %% hal-00094950, version 1 %% http://hal.archives-ouvertes.fr/hal-00094950/en/ @inproceedings{NAZARENKO:2006:HAL-00094950:1, title={{S}emantic {A}nnotation in the {A}lvis {P}roject}, author={{N}azarenko, {A}deline and {N}{\'e}dellec, {C}laire and {A}lphonse, {E}rik and {A}ubin, {S}ophie and {H}amon, {T}hierry and {M}anine, {A}lain-{P}ierre}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} }, booktitle={{P}roceeding of {IIIA}-2006: {I}nternational {W}orkshop on {I}ntelligent {I}nformation {A}ccess }, address={{H}elsinki {F}inlande }, note={projet {ALVIS}: {IST}-1-002068-{STP}, projet europ{\'e}en {STREP} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00094950/en/}, } %% hal-00085158, version 1 %% http://hal.archives-ouvertes.fr/hal-00085158/en/ @inproceedings{NOUIOUA:2006:HAL-00085158:1, title={{U}sing {A}nswer {S}et {P}rogramming in an {I}nference-{B}ased approach to {N}atural {L}anguage {S}emantics}, author={{N}ouioua, {F}arid and {N}icolas, {P}ascal}, abstract={{I}n this paper we describe an inference-based approach to understand natural language. {W}e present a fragment of {R}eiter's default logic and its use in representing knowlege about the norms of the car crashes domain. {T}his fragment is used in a non-monotonic reasoning system to infer the cause of an accident from its description in the analyzed text. {W}e present then a method to translate the default rules into {E}xtended {L}ogic {P}rogram in order to use {A}nswer {S}et {P}rogramming to implement our system.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{E}tude et de {R}echerche en {I}nformatique d'{A}ngers - {LERIA} - {U}niversit{\'e} d'{A}ngers }, booktitle={{I}nference in {C}omputational {S}emantics {IC}o{S}-5 }, address={{B}uxton {F}rance }, ARXIVID={cs.AI/0607088 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085158/en/}, } %% hal-00152875, version 1 %% http://hal.archives-ouvertes.fr/hal-00152875/en/ @inproceedings{PLATEAU:2006:HAL-00152875:1, title={{S}ur le sac {\`a} dos en variables 0-1}, author={{P}lateau, {G}{\'e}rard}, abstract={{L}'expos{\'e} est principalement ax{\'e} sur la description de la m{\'e}thode de r{\'e}solution exacte actuellement disponible sur le site du {LIPN}. {E}lle comporte un pr{\'e}-traitement de complexit{\'e} lin{\'e}aire (r{\'e}solution en continu, heuristique gloutonne, fixation de variables via la relaxation lagrangienne) suivi d'une phase d'{\'e}num{\'e}ration hybridant le branch-and -bound et la programmation dynamique. {L}'histoire de cette conception sera rappel{\'e}e, depuis la m{\'e}thode originelle con{\c{c}}ue avec {D}idier {F}ayard, le principe de l'hybridation {\'e}labor{\'e}e avec {M}oussa {E}lkihel et l'implantation efficace r{\'e}alis{\'e}e avec {P}hilippe {B}ourgeois. {Q}uelques interactions avec les r{\'e}solution des sac {\`a} dos "baudruche", fractionnaire et {\`a} plusieurs contraintes seront {\'e}galement {\'e}voqu{\'e}es, ainsi que celles avec la r{\'e}-optimisation dans le cadre de la r{\'e}solution du dual lagrangien du sac {\`a} dos {\`a} deux contraintes.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{J}ourn{\'e}e {F}rancilienne de {R}echerche {O}p{\'e}rationnelle }, address={{P}aris {F}rance }, note={{OCAD} }, day={13}, month={01}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00152875/en/}, } %% hal-00085168, version 1 %% http://hal.archives-ouvertes.fr/hal-00085168/en/ @inproceedings{POIBEAU:2006:HAL-00085168:1, title={{L}inguistically {G}rounded {M}odels of {L}anguage {C}hange}, author={{P}oibeau, {T}hierry}, abstract={{Q}uestions related to the evolution of language have recently known an impressive increase of interest ({B}riscoe, 2002). {T}his short paper aims at questioning the scientific status of these models and their relations to attested data. {W}e show that one cannot directly model non-linguistic factors (exogenous factors) even if they play a crucial role in language evolution. {W}e then examine the relation between linguistic models and attested language data, as well as their contribution to cognitive linguistics.}, keywords={language evolution; language change; historical linguistics}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{T}he 28th {A}nnual {C}onference of the {C}ognitive {S}cience {S}ociety ({C}og{S}ci 2006) }, address={{V}ancouver {C}anada }, note={http://www.cogsci.rpi.edu/{CSJ}archive/{P}roceedings/2006/docs/p2587.pdf {M}ember poster }, ARXIVID={cs.AI/0607053 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085168/en/}, } %% hal-00085515, version 1 %% http://hal.archives-ouvertes.fr/hal-00085515/en/ @inproceedings{VAUZEILLES:2006:HAL-00085515:1, title={{T}emporal planning in {L}inear {L}ogic}, author={{V}auzeilles, {J}acqueline and {K}anovich, {M}ax}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omputer {S}cience {D}epartment - {QUEEN} {MARY} {COLLEGE} - {U}niversity of {L}ondon }, booktitle={{W}orkshop {G}eometria del calcolo }, address={{R}ome {I}talie }, note={{I}nvitation de {J}acqueline {V}auzeilles au workshop {G}eometria del calcolo - {R}ome 28-29 avril 2006 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085515/en/}, } %% hal-00098065, version 1 %% http://hal.archives-ouvertes.fr/hal-00098065/en/ @inproceedings{AITELMEKKI:2005:HAL-00098065:1, title={{H}istoire et avenir des index de fin de livre}, author={{A}{\"i}t {E}l {M}ekki, {T}ouria and {N}azarenko, {A}deline}, keywords={indexation}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes du colloque international {I}ndice, {I}ndex, {I}ndexation }, address={{L}ille {F}rance }, note={{H}.3.1 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00098065/en/}, } %% hal-00098064, version 1 %% http://hal.archives-ouvertes.fr/hal-00098064/en/ @inproceedings{AITELMEKKI:2005:HAL-00098064:1, title={{E}valuer le r{\'e}seau terminologique d'un index de document}, author={{A}{\"i}t {E}l {M}ekki, {T}ouria and {N}azarenko, {A}deline}, abstract={{T}his paper shows how terminological tools are concretely through the specific task of building back-of-the-book indexes.}, keywords={{A}cquisition de terminologie ; evaluation}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes des journ{\'e}es {T}erminologie et {I}ntelligence {A}rtificielle (atelier {E}valuation des outils terminologiques }, address={{R}ouen {F}rance }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00098064/en/}, } %% hal-00012228, version 1 %% http://hal.archives-ouvertes.fr/hal-00012228/en/ @inproceedings{BILLINGTON:2005:HAL-00012228:1, title={{T}ransforming {C}ouloured {P}etri {N}ets to {C}ounter {S}ystems for {P}arametric {V}erification: {A} {S}top-and-{W}ait {P}rotocol {C}ase {S}tudy}, author={{B}illington, {J}onathan and {G}allasch, {G}uy and {P}etrucci, {L}aure}, abstract={{P}rotocols may contain parameters that are chosen from a wide range. {I}n some cases we would like our analysis results to apply to an arbitrary upper limit on a parameter value, such as the maximum number of retransmissions. {I}n this case we have an infinite family of finite state systems. {T}his makes their verification difficult. {H}owever, techniques and tools are being developed for the verification of parametric and infinite state systems. {W}e explore the use of one such tool, fast, for verifying several properties of the stop-and-wait class of protocols, where the maximum number of retransmissions and the maximum sequence number are considered as parameters. {W}e are also interested in using expressive languages for representing protocols such as {C}oloured {P}etri nets ({CPN}s). fast's foundation is counter systems, which are automata whose states are a vector of non-negative integers, with operations limited to {P}resburger arithmetic. {W}e therefore also present some first steps in transforming {CPN}s to counter systems in the context of stop-and-wait protocols operating over unbounded {FIFO} channels.}, keywords={{P}arametric verification, {P}etri nets}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omputer {S}ystems {E}ngineering {C}entre - {CSEC} - {U}niversity of {S}outh {A}ustralia }, booktitle={2nd workshop on {MO}del-based {M}ethodologies for {P}ervasive and {E}mbedded {S}oftware ({MOMPES}'05, satellite of {ACSD}'05) }, address={{R}ennes {F}rance }, note={{ACM}: {D}2.2 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00012228/en/}, } %% hal-00096728, version 1 %% http://hal.archives-ouvertes.fr/hal-00096728/en/ @inproceedings{CERIN:2005:HAL-00096728:1, title={{M}ining {T}races of {L}arge {S}cale {S}ystems}, author={{C}{\'e}rin, {C}hristophe and {K}oskas, {M}ichel}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={6th {I}nternational {C}onference on {A}lgorithms and {A}rchitectures for {P}arallel {P}rocessing ({ICA}3{PP}) }, address={{M}elbourne {A}ustralie }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00096728/en/}, } %% hal-00088075, version 1 %% http://hal.archives-ouvertes.fr/hal-00088075/en/ @inproceedings{CZACHORSKI:2005:HAL-00088075:1, title={{F}orming optical packets, a diffusion approximation and simulation models}, author={{C}zachorski, {T}adeusz and {P}ekergin, {F}erhan and {S}zady, {B}artlomiej}, abstract={{D}esigning of smart edge routers and shaping the self-similar traffic in optical switched networks arise recently a lot of interest. {H}ere, we propose an analytical approach which we consider useful in modelling and dimensioning of buffers in the edge routers between electronic and optical networks. {W}e study a single buffer where packets of various sizes, classified by the class of service and the destination, are stored to build an optical packet of a fixed size. {W}e already studied this problem with the use of simulation model, remarking that self-similar traffic at the entrance of such a buffer remains self-similar when leaving it. {N}ow we are building analytical model based on diffusion approximation. and our previous contributions to this approach, i.e. a method to solve transient diffusion models. {T}he model is used to analyse the process of buffer filling and a a numerical example proves that this approach may give reasonable results in relatively short (compared to simulation, especially simulation of transient states) time.}, keywords={{D}iffusion approximation; {A}ll-optical networks}, language={{A}nglais}, affiliation={{I}nstytut {I}nformatyki {T}eoretycznej i {S}tosowanej {P}olskiej {A}kademii {N}auk - {IITIS} {PAN} - {P}olska {A}kademia {N}auk - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of {E}uro{NGI} ({E}uropean {N}ew {G}eneration {I}nternet) 2nd {W}orkshop {IA}.8.1 }, address={{A}veiro {P}ortugal }, note={{I}.6.5 }, collaboration={{P}rojet de coop{\'e}ration {CNRS} - {PAN} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00088075/en/}, } %% hal-00084645, version 1 %% http://hal.archives-ouvertes.fr/hal-00084645/en/ @inproceedings{DEHNI:2005:HAL-00084645:1, title={{L}ow {E}nergy {A}daptive {C}onnectionist {C}lustering for {W}ireless {S}ensor {N}etworks}, author={{D}ehni, {L}ahc{\`e}ne and {B}ennani, {Y}oun{\`e}s and {K}rief, {F}rancine}, abstract={{T}he use of the wireless sensor networks ({WSN}s) should be increasing in different fields (scientist, logistic, military and health, etc.). {H}owever, the sensor's size is an important limitation in term of energetic autonomy, and thus of life span because battery must be very small. {T}his is the reason why, today, research mainly carries on the energy management in the {WSN}s, taking into account communications, essentially. {I}n this context, we propose an adaptive routing algorithm based on the clustering that we named {LEA}2{C}. {T}his algorithm relies on connectionist learning techniques and more exactly on the topological selforganizing maps ({SOM}s). {N}ew rules for the choice of the clusterheads have also been added. {B}y comparing the results obtained by our protocol with those of other clustering methods used in the {WSN}s, such as {LEACH} and {LEACH}-{C}, we obtain important gains in term of energy and thus of network lifetime.}, keywords={{W}ireless sensor networks, clustering, energy consumption, routing, numerical learning, self-organizing maps of {K}ohonen.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux }, booktitle={{IEEE}/{IFIP} {MATA} 2005 : 2nd {I}nternational {W}orkshop on {M}obility {A}ware {T}echnologies and {A}pplications }, address={{M}ontr{\'e}al {C}anada }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084645/en/}, } %% hal-00084644, version 1 %% http://hal.archives-ouvertes.fr/hal-00084644/en/ @inproceedings{DEHNI:2005:HAL-00084644:1, title={{P}ower {C}ontrol and {C}lustering in {W}ireless {S}ensor {N}etworks}, author={{D}ehni, {L}ahc{\`e}ne and {K}rief, {F}rancine and {B}ennani, {Y}oun{\`e}s}, abstract={{T}he use of the wireless sensor networks ({WSN}s) should be increasing in different fields (scientist, logistic, military and health, etc.). {H}owever, the sensor's size is an important limitation in term of energetic autonomy, and thus of lifetime because battery must be very small. {T}his is the reason why, today, research mainly carries on the energy management in the {WSN}s, taking into account communications, essentially. {I}n this context, we compare different clustering methods used in the {WSN}s, particularly {EECS}, with an adaptive routing algorithm that we named {LEA}2{C}. {T}his algorithm is based on topological self-organizing maps. {W}e obtain important gains in term of energy and thus of network lifetime.}, keywords={{W}ireless sensor networks, clustering, power control, adaptative routing algorithm, and topological self-organizing maps.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux }, booktitle={{M}ed-{H}oc-{N}et 2005 : {M}editerranean {A}d {H}oc {N}etworking {W}orkshop }, address={{I}le de {P}orquerolles {F}rance }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084644/en/}, } %% hal-00084643, version 1 %% http://hal.archives-ouvertes.fr/hal-00084643/en/ @inproceedings{DEHNI:2005:HAL-00084643:1, title={{P}ower {C}ontrol and {C}lustering in {W}ireless {S}ensor {N}etworks}, author={{D}ehni, {L}ahc{\`e}ne and {K}rief, {F}rancine and {B}ennani, {Y}oun{\`e}s}, abstract={{T}he use of the wireless sensor networks ({WSN}s) should be increasing in different fields (scientist, logistic, military and health, etc.). {H}owever, the sensor's size is an important limitation in term of energetic autonomy, and thus of lifetime because battery must be very small. {T}his is the reason why, today, research mainly carries on the energy management in the {WSN}s, taking into account communications, essentially. {I}n this context, we compare different clustering methods used in the {WSN}s, particularly {EECS}, with an adaptive routing algorithm that we named {LEA}2{C}. {T}his algorithm is based on topological self-organizing maps. {W}e obtain important gains in term of energy and thus of network lifetime.}, keywords={{W}ireless sensor networks, clustering, power control, adaptative routing algorithm, and topological self-organizing maps.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux }, booktitle={{M}ed-{H}oc-{N}et 2005 : {M}editerranean {A}d {H}oc {N}etworking {W}orkshop }, address={{I}le de {P}orquerolles {F}rance }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084643/en/}, } %% hal-00009449, version 1 %% http://hal.archives-ouvertes.fr/hal-00009449/en/ @inproceedings{DELBECQUE:2005:HAL-00009449:1, title={{L}e syst{\`e}me {STIM}/{LIPN} {\`a} {EQ}ue{R} 2004, t{\^a}che m{\'e}dicale}, author={{D}elbecque, {T}hierry and {Z}weigenbaum, {P}ierre and {B}erroyer, {J}ean-{F}ran{\c{c}}ois and {P}oibeau, {T}hierry}, abstract={{P}r{\'e}sentation des principes du syst{\`e}me de questions-r{\'e}ponses {STIM}/{LIPN} qui a pris part {\`a} la t{\^a}che m{\'e}dicale de l'{\'e}valuation {EQ}ue{R} 2004}, keywords={syst{\`e}me de questions-r{\'e}ponses; langue m{\'e}dicale; traitement des langues; langues de sp{\'e}cialit{\'e}; {\'e}valuation}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}ngenierie des connaissances en sant{\'e} - {INSERM} : {U}729 - {IFR}58 - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{A}telier {EQ}ue{R} (conf{\'e}rence {TALN} 2005) }, address={{D}ourdan {F}rance }, note={http://taln.limsi.fr/site/taln{R}ecital05/tome2/{P}116.pdf }, collaboration={projet {STIM}/{LIPN} (campagne {EQ}ue{R}) }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00009449/en/}, } %% hal-00084847, version 1 %% http://hal.archives-ouvertes.fr/hal-00084847/en/ @inproceedings{DERIVIERE:2005:HAL-00084847:1, title={{D}{\'e}veloppement d'une plate-forme d'enrichissement des documents textuels~: l'exp{\'e}rience du projet {ALVIS}}, author={{D}erivi{\`e}re, {J}ulien and {H}amon, {T}hierry and {N}azarenko, {A}deline and {V}auvert, {G}uillaume}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{J}ourn{\'e}e {ATALA} "{A}rticuler les traitements sur corpus" }, address={{P}aris {F}rance }, note={projet europ{\'e}en {ALVIS} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084847/en/}, } %% hal-00084354, version 1 %% http://hal.archives-ouvertes.fr/hal-00084354/en/ @inproceedings{FOUQUERE:2005:HAL-00084354:1, title={{R}ewritings in {P}olarized ({P}artial) {P}roof {S}tructures}, author={{F}ouquer{\'e}, {C}hristophe and {M}ogbil, {V}irgile}, abstract={{T}his paper is a first step towards a study for a concurrent construction of proof-nets in the framework of linear logic after {A}ndreoli's works, by taking care of the properties of the structures. {W}e limit here to multiplicative linear logic. {W}e first give a criterion for closed modules (i.e. validity of polarized proof structures), then extend it to open modules (i.e. validity of partial proof structures) distinguishing criteria for acyclicity and connectability. {T}he keypoint is an extensive use of the fundamental structural properties of the logics. {W}e consider proof structures as built from n-ary bipolar objects and we show that strongly confluent (local) reductions on such objects are an elegant answer to the correctness problem. {T}his has natural applications in (concurrent) logic programming.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}tructures and {D}eduction - the {Q}uest for the {E}ssence of {P}roofs {ICALP} {W}orkshop }, address={{L}isbon {P}ortugal }, note={{ISSN} 1430-211{X} {ACI} {NIM} projet {GEOCAL} {F}rance }, day={16}, month={07}, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084354/en/}, } %% hal-00084646, version 1 %% http://hal.archives-ouvertes.fr/hal-00084646/en/ @inproceedings{GUERIF:2005:HAL-00084646:1, title={$\mu$-{SOM} : {W}eighting features during clustering}, author={{G}u{\'e}rif, {S}{\'e}bastien and {B}ennani, {Y}oun{\`e}s}, abstract={{R}eal life datasets used in marketing studies contain a lot of redundant features which may prevent data-mining techniques such as self-organizing maps from discovering relevant clusters. {A}n extension of the batch {K}ohonen's algorithm is proposed in this paper to avoid the large amount of work which is required by data preprocessing if redundancy isn't treated explicitly by the training method. {T}he proposed approach integrates a weighting of variables built on a simultaneous clustering of both observations and variables and avoids the side effects of redundancy. {A}n application to market segmentation is then briefly described to validate the learning algorithm introduced; identified clusters of products and motivations are used to simplify the analysis of the consumer segmentation by giving the user a first rough description of the different groups.}, keywords={{D}ata-mining, {M}arket segmentation, {R}edundant features, {S}elf- {O}rganizing {M}ap, {W}eighting}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{WSOM}'05, {I}nternational {W}orkshop {O}n {S}elf-{O}rganizing {M}aps }, address={{P}aris {F}rance }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084646/en/}, } %% hal-00082061, version 1 %% http://hal.archives-ouvertes.fr/hal-00082061/en/ @inproceedings{GUERIF:2005:HAL-00082061:1, title={\&\#956;-{SOM} : {W}eighting features during clustering}, author={{G}u{\'e}rif, {S}{\'e}bastien and {B}ennani, {Y}oun{\`e}s and {J}anvier, {E}ric}, abstract={{R}eal life datasets used in marketing studies contain a lot of redundant features which may prevent data-mining techniques such as self-organizing maps from discovering relevant clusters. {A}n extension of the batch {K}ohonen's algorithm is proposed in this paper to avoid the large amount of work which is required by data preprocessing if redundancy isn't treated explicitly by the training method. {T}he proposed approach integrates a weighting of variables built on a simultaneous clustering of both observations and variables and avoids the side effects of redundancy. {A}n application to market segmentation is then briefly described to validate the learning algorithm introduced; identified clusters of products and motivations are used to simplify the analysis of the consumer segmentation by giving the user a first rough description of the different groups.}, keywords={data-mining; market segmentation; redundant features; self-organizing maps; weighting}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the 5th {W}orkshop {O}n {S}elf-{O}rganizing {M}aps ({WSOM}'05) }, address={{P}aris {F}rance }, note={guerif:2005:wsom {C}onvention {CIFRE} avec {N}umsight {C}onsulting {F}rance }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00082061/en/}, } %% hal-00085161, version 1 %% http://hal.archives-ouvertes.fr/hal-00085161/en/ @inproceedings{NOUIOUA:2005:HAL-00085161:1, title={{N}orm {B}ased {C}ausal {R}easoning in {T}extual {C}orpus}, author={{N}ouioua, {F}arid}, abstract={{T}ruth based entailments are not sufficient for a good comprehension of {NL}. {I}n fact, it can not deduce implicit information necessary to understand a text. {O}n the other hand, norm based entailments are able to reach this goal. {T}his idea was behind the development of {F}rames ({M}insky 75) and {S}cripts ({S}chank 77, {S}chank 79) in the 70's. {B}ut these theories are not formalized enough and their adaptation to new situations is far from being obvious. {I}n this paper, we present a reasoning system which uses norms in a causal reasoning process in order to find the cause of an accident from a text describing it.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}roceedings of the {S}ixth {I}nternational {W}orkshop on {C}omputational {S}emantics {IWCS}-6 }, address={{T}ilburg {F}rance }, ARXIVID={cs.AI/0610016 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00085161/en/}, } %% hal-00004455, version 1 %% http://hal.archives-ouvertes.fr/hal-00004455/en/ @inproceedings{PAILLARD:2005:HAL-00004455:1, title={{A} fully distributed prime numbers generation using the wheel sieve}, author={{P}aillard, {G}abriel}, abstract={{T}his article presents a new distributed approach for generating all prime numbers up to a given limit, based on the wheel sieve.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}arallel and distributed computing and networks }, address={{I}nnsbruck {A}utriche }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00004455/en/}, } %% hal-00003832, version 1 %% http://hal.archives-ouvertes.fr/hal-00003832/en/ @inproceedings{PAILLARD:2005:HAL-00003832:1, title={{A} fully distributed prime number generation using the wheel sieve}, author={{P}aillard, {G}abriel}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{I}nternational {C}onference on {P}arallel and {D}istributed {C}omputing and {N}etworks }, address={{I}nnsbruck {A}utriche }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00003832/en/}, } %% hal-00082696, version 1 %% http://hal.archives-ouvertes.fr/hal-00082696/en/ @inproceedings{PAUCHET:2005:HAL-00082696:1, title={{A} {C}ognitive {M}odel of {I}nteraction for {S}oftware {A}gents}, author={{P}auchet, {A}lexandre and {C}haignaud, {N}athalie and {E}l {F}allah {S}eghrouchni, {A}mal}, abstract={{T}his article deals with a human model of interaction based on a psychological experiment. {I}t uses the {S}peech {A}ct theory to model the utterances and a discourse model, represented by timed automata, to describe the dynamics of human conversations. {T}he utterance level and the discourse level are linked by a semantics of the performatives.}, keywords={{C}ognitive modelling; human interaction; {BDI} agents; a semantics of speech acts; timed automata.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {P}erception, {S}yst{\`e}mes, {I}nformation - {PSI} - {CNRS} : {FRE}2645 - {U}niversit{\'e} de {R}ouen - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ouen - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={{A}ctes de {IAT}'05 }, address={{C}ompi{\`e}gne {F}rance }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00082696/en/}, } %% hal-00082691, version 1 %% http://hal.archives-ouvertes.fr/hal-00082691/en/ @inproceedings{PAUCHET:2005:HAL-00082691:1, title={{U}n mod{\`e}le cognitif de l'interaction pour agents logiciels}, author={{P}auchet, {A}lexandre and {C}haignaud, {N}athalie and {E}l {F}allah {S}eghrouchni, {A}mal}, abstract={{C}et article pr{\'e}sente un mod{\`e}le d'interaction humaine fond{\'e} sur une exp{\'e}rimentation psychologique, ainsi qu'une architecture appel{\'e}e {BDIGGY} reliant de fa{\c{c}}on homog{\`e}ne interaction et planification gr{\^a}ce au concept {BDI}. {BDIGGY} comprend un mod{\`e}le d'interaction humaine con{\c{c}}u sur deux niveaux : 1) un mod{\`e}le de l'{\'e}nonc{\'e} s'appuyant sur la th{\'e}orie des actes de langage ; 2) un mod{\`e}le du discours, sous la forme d'automates temporis{\'e}s, qui permet de tenir compte de la dynamique des conversations humaines. {L}es niveaux du discours et des {\'e}nonc{\'e}s sont li{\'e}s par une s{\'e}mantique des performatives.}, keywords={{C}ognitive modelling; human interaction; cooperative problem solving; {BDI} agents; semantics of speech acts; timed automata.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {P}erception, {S}yst{\`e}mes, {I}nformation - {PSI} - {CNRS} : {FRE}2645 - {U}niversit{\'e} de {R}ouen - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ouen - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={{A}ctes de {MFI}'05 }, address={{C}aen {F}rance }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00082691/en/}, } %% hal-00084190, version 1 %% http://hal.archives-ouvertes.fr/hal-00084190/en/ @inproceedings{PETRUCCI:2005:HAL-00084190:1, title={{D}istributed and {M}odular {S}tate {S}pace {E}xploration for {T}imed {P}etri {N}ets}, author={{P}etrucci, {L}aure and {L}akos, {C}harles}, language={{A}nglais}, affiliation={{U}niversity of {A}delaide, {D}epartment of {C}omputer {S}cience - {U}niversity of {A}delaide - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{W}orkshop on {P}ractical {U}se of {C}oloured {P}etri {N}ets }, address={{A}arhus {D}anemark }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084190/en/}, } %% hal-00095576, version 1 %% http://hal.archives-ouvertes.fr/hal-00095576/en/ @inproceedings{POIBEAU:2005:HAL-00095576:1, title={{A}rchitectures articulant des repr{\'e}sentations h{\'e}t{\'e}rog{\`e}nes: l'exemple de {G}ate}, author={{P}oibeau, {T}hierry}, abstract={{M}ini-tutoriel sur la plate-forme d'annotation linguistique {G}ate (d{\'e}velopp{\'e}e {\`a} l'universit{\'e} de {S}heffield)}, keywords={plate-forme d'annotation linguistique; traitements linguistiques; traitement automatique des langues}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{J}ourn{\'e}e {ATALA} ({A}ssociation pour le {T}raitement {A}utomatique des {L}angues) }, address={{P}aris {F}rance }, note={www.limsi.fr/{I}ndividu/habert/{P}rojets/{J}ournee{ATALA}05{A}rticuler{L}es{T}raitements/{P}oibeau.ppt }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00095576/en/}, } %% hal-00009448, version 1 %% http://hal.archives-ouvertes.fr/hal-00009448/en/ @inproceedings{POIBEAU:2005:HAL-00009448:1, title={{S}ur le statut r{\'e}f{\'e}rentiel des entit{\'e}s nomm{\'e}es}, author={{P}oibeau, {T}hierry}, abstract={{N}ous montrons dans cet article qu'une m{\^e}me entit{\'e} peut {\^e}tre d{\'e}sign{\'e}e de multiples fa{\c{c}}ons et que les noms d{\'e}signant ces entit{\'e}s sont par nature polys{\'e}miques. {L}'analyse ne peut donc se limiter {\`a} une tentative de r{\'e}solution de la r{\'e}f{\'e}rence mais doit mettre en {\'e}vidence les possibilit{\'e}s de nommage s'appuyant essentiellement sur deux op{\'e}rations de nature linguistique : la synecdoque et la m{\'e}tonymie. {N}ous pr{\'e}sentons enfin une mod{\'e}lisation permettant de rendre explicite les diff{\'e}rentes d{\'e}signations en discours, en unifiant le mode de repr{\'e}sentation des connaissances linguistiques et des connaissances sur le monde}, keywords={entit{\'e}s nomm{\'e}es; traitement du langage naturel; cat{\'e}gorie; s{\'e}mantique lexicale; s{\'e}mantique}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{C}onf{\'e}rence {T}raitement {A}utomatique des {L}angues 2005 }, address={{D}ourdan {F}rance }, note={http://taln.limsi.fr/site/taln{R}ecital05/tome1/{P}18.pdf }, ARXIVID={cs.AI/0510020 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00009448/en/}, } %% hal-00095205, version 1 %% http://hal.archives-ouvertes.fr/hal-00095205/en/ @inproceedings{WEISSENBACHER:2005:HAL-00095205:1, title={{A} {B}ayesian {N}etwork for the resolution of non-anaphoric pronoun it}, author={{W}eissenbacher, {D}avy}, abstract={{T}he {B}ayesian {N}etwork ({BN}) formalism has been scarcely used to model {NLP} problems. {H}owever this formalism has real advantages to over- come the limits of traditional knowledge-based approaches in {NLP}. {S}ince anaphora resolution is a traditional problem in {NLP}, we propose a sys- tem based on a {BN} for the recognition of non-anaphoric occurences of the pronoun it and show that this formalism takes advantage of existing knowledge, how heterogeneous, incomplete and noisy it may be. {T}he identi\&\#105;\&\#64257;cation is carried out on a corpus from the genomic domain. {T}he \&\#10;\&\#64257;rst results are very encouraging compared with previous systems.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{B}ayesian {M}ethods for {N}atural {L}anguage {P}rocessing {W}orkshop at {NIPS} }, address={{C}anada }, collaboration={{ALVIS} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00095205/en/}, } %% hal-00154164, version 1 %% http://hal.archives-ouvertes.fr/hal-00154164/en/ @inproceedings{ALFANDARI:2004:HAL-00154164:1, title={{B}oolean inverse optimization problems}, author={{A}lfandari, {L}aurent and {D}emange, {M}arc and {M}onnot, {J}{\'e}r{\^o}me}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{EURO} {XX} }, address={{R}hodes {G}r{\`e}ce }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00154164/en/}, } %% hal-00098054, version 1 %% http://hal.archives-ouvertes.fr/hal-00098054/en/ @inproceedings{ALPHONSE:2004:HAL-00098054:1, title={{E}xtraction d'information appliqu{\'e}e au domaine biom{\'e}dical: apprentissage et traitement automatique de la langue}, author={{A}lphonse, {E}rick and {A}ubin, {S}ophie and {B}essi{\`e}res, {P}hilippe and {B}isson, {G}illes and {H}amon, {T}hierry and {L}agarrigue, {S}andrine and {M}anine, {A}lain-{P}ierre and {N}azarenko, {A}deline and {N}{\'e}dellec, {C}laire and {O}uld {A}bdel {V}etah, {M}ohamed and {P}oibeau, {T}hierry and {W}eissenbacher, {D}avy and {O}uld {A}bdel {V}etah, {M}ohamed}, keywords={{E}xtraction d'information ; fouille de texte ; apprentissage}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} - {L}aboratoire {L}eibniz - {L}eibniz - {IMAG} - {CNRS} : {UMR}5522 - {U}niversit{\'e} {J}oseph {F}ourier - {G}renoble {I} - {I}nstitut {N}ational {P}olytechnique de {G}renoble - {INPG} - {L}aboratoire de g{\'e}n{\'e}tique animale - {INRA}-{ENSAR} - {INRA} }, booktitle={{A}ctes de la {C}onf{\'e}rence {I}nternationale sur la {F}ouille de textes ({CIFT}'04) }, address={{L}a {R}ochelle {F}rance }, note={{H}.3.1 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00098054/en/}, } %% hal-00098040, version 1 %% http://hal.archives-ouvertes.fr/hal-00098040/en/ @inproceedings{ALPHONSE:2004:HAL-00098040:1, title={{E}vent-based {I}nformation {E}xtraction for the biomedical domain: the {C}aderige project}, author={{A}lphonse, {E}rick and {A}ubin, {S}ophie and {B}essi{\`e}res, {P}hilippe and {B}isson, {G}illes and {H}amon, {T}hierry and {L}agarrigue, {S}andrine and {N}azarenko, {A}deline and {M}anine, {A}lain-{P}ierre and {N}{\'e}dellec, {C}laire and {O}uld {A}bdel {V}etah, {M}ohamed and {P}oibeau, {T}hierry and {W}eissenbacher, {D}avy}, abstract={{T}his paper gives an overview of the {C}aderige project. {T}his project involves teams from different areas (biology, machine learning, natural language processing) in order to develop high-level analysis tools for extracting structured information from biological bibliographical databases, especially {M}edline. {T}he paper gives an overview of the approach and compares it to the state of the art.}, keywords={{I}nformation extraction ; bio text mining}, language={{A}nglais}, affiliation={{U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} - {L}aboratoire {L}eibniz - {L}eibniz - {IMAG} - {CNRS} : {UMR}5522 - {U}niversit{\'e} {J}oseph {F}ourier - {G}renoble {I} - {I}nstitut {N}ational {P}olytechnique de {G}renoble - {INPG} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de g{\'e}n{\'e}tique animale - {INRA}-{ENSAR} - {INRA} }, booktitle={{P}roceedings of the {I}nternational {J}oint {W}orkshop on {N}atural {L}anguage {P}rocessing in {B}iomedicine and {I}ts {A}pplications ({COLING}'04) }, address={{G}eneva {S}uisse }, note={{H}.3.1 }, collaboration={{C}aderige }, ARXIVID={cs.AI/0609135 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00098040/en/}, } %% hal-00082486, version 1 %% http://hal.archives-ouvertes.fr/hal-00082486/en/ @inproceedings{BANDERIER:2004:HAL-00082486:1, title={{A}utomates infinis et la m{\'e}thode du noyau}, author={{B}anderier, {C}yril}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{J}ourn{\'e}es {M}ontoises d'{I}nformatique {T}h{\'e}orique 2004 }, address={{F}rance }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00082486/en/}, } %% hal-00082484, version 1 %% http://hal.archives-ouvertes.fr/hal-00082484/en/ @inproceedings{BANDERIER:2004:HAL-00082484:1, title={{I}nformatique et {B}iologie : deux sciences de l'{\'e}volution et de l'information}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{J}ourn{\'e}es {S}avante {B}anlieue }, address={{F}rance }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00082484/en/}, } %% hal-00082481, version 1 %% http://hal.archives-ouvertes.fr/hal-00082481/en/ @inproceedings{BANDERIER:2004:HAL-00082481:1, title={{\'E}num{\'e}ration et asymptotique pour les jeux de {N}im.}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{J}ourn{\'e}es {ALEA} 2004 }, address={{F}rance }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00082481/en/}, } %% hal-00082473, version 1 %% http://hal.archives-ouvertes.fr/hal-00082473/en/ @inproceedings{BANDERIER:2004:HAL-00082473:1, title={{K}ernel method and permutation patterns.}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}ermutation {P}atterns'04 }, address={{F}rance }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00082473/en/}, } %% hal-00003394, version 1 %% http://hal.archives-ouvertes.fr/hal-00003394/en/ @inproceedings{BARDIN:2004:HAL-00003394:1, title={{COAST} : des r{\'e}seaux de {P}etri {\`a} la planification assist{\'e}e}, author={{B}ardin, {S}{\'e}bastien and {P}etrucci, {L}aure}, abstract={{COAST} est un outil d'assistance {\`a} la planification militaire. {S}on architecture distribu{\'e}e comprend un serveur constitu{\'e} d'un moteur d'analyse de r{\'e}seaux de {P}etri tandis que l'interface graphique fournie par le client permet de masquer l'utilisation des m{\'e}thodes formelles. {L}es synchronisations entre t{\^a}ches {\`a} planifier sont un aspect essentiel de {COAST}. {D}ans cet article, apr{\`e}s une pr{\'e}sentation g{\'e}n{\'e}rale de la probl{\'e}matique et de l'outil, nous d{\'e}crivons les synchronisations, montrons comment elles sont mod{\'e}lis{\'e}es et implant{\'e}es.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire {S}p{\'e}cification et {V}{\'e}rification - {LSV} - {CNRS} : {UMR}8643 - {INRIA} - {E}cole {N}ormale {S}up{\'e}rieure de {C}achan }, booktitle={6{\`e}me {C}onf{\'e}rence sur les {A}pproches {F}ormelles dans l'{A}ssistance au {D}{\'e}veloppement de {L}ogiciels }, address={{B}esan{\c{c}}on {F}rance }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003394/en/}, } %% hal-00003391, version 1 %% http://hal.archives-ouvertes.fr/hal-00003391/en/ @inproceedings{BARDIN:2004:HAL-00003391:1, title={{F}rom {PNML} to counter systems for accelerating {P}etri {N}ets with {FAST}}, author={{B}ardin, {S}{\'e}bastien and {P}etrucci, {L}aure}, abstract={{W}e use the tool {FAST} to check parameterized safety properties on {P}etri nets with a large or infinite state space. {A}lthough this tool is not dedicated to {P}etri nets, it can be used for these as place/transition nets (and some of their extensions) are subcases of {FAST}input model. {T}he originality of the tool lies in the use of acceleration techniques in order to compute the exact reachability set for infinite systems. {I}n this paper, we present the automatic transformation of {P}etri nets written in {PNML} ({P}etri {N}et {M}arkup {L}anguage) into counter systems. {T}hen, {FAST} provides a simple but very powerful language to express complex properties and check these.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {SECSI} - {INRIA} {F}uturs - {INRIA} - {CNRS} : {UMR}8643 - {E}cole {N}ormale {S}up{\'e}rieure de {C}achan }, booktitle={{W}orkshop on {I}nterchange {F}ormats for {P}etri {N}ets }, address={{B}ologna {I}talie }, ARXIVID={cs.OH/0411099 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003391/en/}, } %% hal-00003390, version 1 %% http://hal.archives-ouvertes.fr/hal-00003390/en/ @inproceedings{CHOPPY:2004:HAL-00003390:1, title={{T}owards a methodology for modelling with {P}etri nets}, author={{C}hoppy, {C}hristine and {P}etrucci, {L}aure}, abstract={{F}ormal specifications remain difficult to write in general, due to both the complexity of the system to be developed, and the use of a formal language. {I}n [{CR}03a], a method is proposed for specification development, with {CASL}, the {C}ommon {A}lgebraic {S}pecification {L}anguage, and {CASL}-{LTL}, an extension for dynamic systems specification, as target languages. {H}owever, this method could be used with quite a variety of modeling languages, as shown in this paper which is a first attempt to provide systematic guidelines for {P}etri net specification on the ground of the aforementioned specification method. {I}t is shown how to express in terms of {P}etri nets the constituent features and the properties exhibited from the first specification approach. {A} model train specification from [{BP}00] is used as a running example.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{W}orkshop on {P}ractical {U}se of {C}oloured {P}etri {N}ets }, address={{A}arhus {D}anemark }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003390/en/}, } %% hal-00004456, version 1 %% http://hal.archives-ouvertes.fr/hal-00004456/en/ @inproceedings{DJEROUROU:2004:HAL-00004456:1, title={{A}ssigning {C}odes in a {R}andom {W}ireless {N}etwork}, author={{D}jerourou, {F}ay{\c{c}}al and {L}avault, {C}hristian and {P}aillard, {G}abriel and {R}avelomanana, {V}lady}, abstract={{I}n this paper we present an algorithm that can assign codes in the code division multiple access ({CDMA}) framework for multihop ad hoc wireless networks.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={11th {I}nternational {C}onference on {T}elecomunications }, address={{F}ortaleza {B}r{\'e}sil }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00004456/en/}, } %% hal-00084478, version 1 %% http://hal.archives-ouvertes.fr/hal-00084478/en/ @inproceedings{FOUQUERE:2004:HAL-00084478:1, title={{L}e web comme source d'informations : quelles m{\'e}thodes ?}, author={{F}ouquer{\'e}, {C}hristophe}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={72{\`e}me congr{\`e}s de l'{ACFAS} }, address={{C}anada }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084478/en/}, } %% hal-00092223, version 1 %% http://hal.archives-ouvertes.fr/hal-00092223/en/ @inproceedings{GAYRAL:2004:HAL-00092223:1, title={{T}he role of time in considering collections}, author={{G}ayral, {F}ran{\c{c}}oise and {K}ayser, {D}aniel and {L}{\'e}vy, {F}ran{\c{c}}ois}, abstract={{T}he paper concerns the understanding of plurals in the framework of {A}rtificial {I}ntelligence and emphasizes the role of time. {T}he construction of collection(s) and their evolution across time is often crucial and has to be accounted for. {T}he paper contrasts a "de dicto" collection where the collection can be considered as persisting over these situations even if its members change with a "de re" collection whose composition does not vary through time. {I}t expresses different criteria of choice between the two interpretations (de re and de dicto) depending on the context of enunciation.}, keywords={role of time;semantics; plural}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{J}ourn{\'e}es de {S}{\'e}mantique et {M}od{\'e}lisation }, address={{L}yon {F}rance }, ARXIVID={cs.CL/0609044 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00092223/en/}, } %% hal-00092218, version 1 %% http://hal.archives-ouvertes.fr/hal-00092218/en/ @inproceedings{GAYRAL:2004:HAL-00092218:1, title={{C}hallenging the principle of compositionality in interpreting natural language texts}, author={{G}ayral, {F}ran{\c{c}}oise and {K}ayser, {D}aniel and {L}{\'e}vy, {F}ran{\c{c}}ois}, abstract={{T}he paper aims at emphasizing that, even relaxed, the hypothesis of compositionality has to face many problems when used for interpreting natural language texts. {R}ather than fixing these problems within the compositional framework, we believe that a more radical change is necessary, and propose another approach.}, keywords={{C}ompositionality;semantics;default logic}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={conference on {C}ompositionality, {C}oncepts and {C}ognition }, address={{D}{\"u}sseldorf {A}llemagne }, ARXIVID={cs.CL/0609043 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00092218/en/}, } %% hal-00084832, version 1 %% http://hal.archives-ouvertes.fr/hal-00084832/en/ @inproceedings{HAMON:2004:HAL-00084832:1, title={{P}lateforme d'annotation terminologique de corpus des r{\'e}sum{\'e}s d'articles de biologie}, author={{H}amon, {T}hierry}, keywords={{T}raitement automatique des {L}angues, {I}ng{\'e}nierie des langues, terminologie}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes des 15i{\`e}me journ{\'e}es francophones d'{I}ng{\'e}nierie des {C}onnaissances ({IC}'2004) }, address={{L}yon {F}rance }, note={{P}oster }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084832/en/}, } %% hal-00003389, version 1 %% http://hal.archives-ouvertes.fr/hal-00003389/en/ @inproceedings{KAROUI:2004:HAL-00003389:1, title={{A}n intelligent peer-to-peer multi-agent system for collaborative management of bibliographic databases}, author={{K}aroui, {H}ager and {K}anawati, {R}ushed and {P}etrucci, {L}aure}, abstract={{T}his paper describes the design of a peer-to-peer system for collaborative management of distributed bibliographical databases. {T}he goal of this system is twofold: firstly, it aims at providing help for users to manage their local bibliographical databases. {S}econdly, it offers the possibility to exchange bibliographical data among like-minded user groups in an implicit and intelligent manner. {E}ach user is assisted by a personal agent that provides help such as: filling in bibliographical records, verifying the correctness of information entered and more importantly, recommendation of relevant bibliographical references. {T}o do this, the personal agent needs to collaborate with its peers in order to get relevant recommendations. {E}ach agent applies a case-based reasoning approach in order to provide peers with requested recommendations. {T}he paper focuses mainly on describing the recommendation computation approach.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{W}orkshop on {C}ase {B}ased {R}easoning }, address={{C}ambridge {R}oyaume-{U}ni }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003389/en/}, } %% hal-00003392, version 1 %% http://hal.archives-ouvertes.fr/hal-00003392/en/ @inproceedings{KRISTENSEN:2004:HAL-00003392:1, title={{A}n {A}pproach to {D}istributed {S}tate {S}pace {E}xploration for {C}oloured {P}etri {N}ets}, author={{K}ristensen, {L}ars and {P}etrucci, {L}aure}, abstract={{W}e present an approach and associated computer tool support for conducting distributed state space exploration for {C}oloured {P}etri {N}ets ({CPN}s). {T}he distributed state space exploration is based on the introduction of a coordinating process and a number of worker processes. {T}he worker processes are responsible for the storage of states and the computation of successor states. {T}he coordinator process is responsible for the distribution of states and termination detection. {A} main virtue of our approach is that it can be directly implemented in the existing single-threaded framework of {D}esign/{CPN} and {CPN} {T}ools. {T}his makes the distributed state space exploration and analysis largely transparent to the analyst. {W}e illustrate the use of the developed tool on an example.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {DAIMI} - {DAIMI} - {DAIMI} }, booktitle={25th {I}nternational {C}onference on {A}pplication and {T}heory of {P}etri {N}ets }, address={{B}ologna {I}talie }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003392/en/}, } %% hal-00003393, version 1 %% http://hal.archives-ouvertes.fr/hal-00003393/en/ @inproceedings{LAKOS:2004:HAL-00003393:1, title={{M}odular {A}nalysis of {S}ystems {C}omposed of {S}emiautonomous {S}ubsystems}, author={{L}akos, {C}harles and {P}etrucci, {L}aure}, abstract={{T}his paper reviews a proposal for the modular analysis of {P}etri nets and its applicability to factory automation systems. {I}t presents new algorithms to harness this modular analysis in the determination of reachable states with specified partial markings, to determine possible deadlocks, both global and local, and also liveness. {T}hese algorithms have been implemented in a prototype tool which has then been used to solve a problem in factory automation which, even for relatively simple configurations, can lead to state spaces beyond the capabilities of many analysis tools.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}niversity of {A}delaide, {D}epartment of {C}omputer {S}cience - {U}niversity of {A}delaide }, booktitle={4th {I}nternational {C}onference on {A}pplication of {C}oncurrency to {S}ystem {D}esign }, address={{H}amilton {C}anada }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003393/en/}, } %% hal-00085178, version 1 %% http://hal.archives-ouvertes.fr/hal-00085178/en/ @inproceedings{POIBEAU:2004:HAL-00085178:1, title={{P}r{\'e}-analyse de corpus}, author={{P}oibeau, {T}hierry}, abstract={{L}es applications de {T}raitement {A}utomatique des {L}angues n{\'e}cessitent le plus souvent des corpus homog{\`e}nes pour fournir des r{\'e}sultats pertinents. {D}e tels corpus sont rarement disponibles dans des contextes applicatifs ou industriels. {C}et article propose une approche originale pour pr{\'e}parer les corpus et obtenir des masses de textes utilisables. {L}es techniques pr{\'e}sent{\'e}es vont des statistiques {\`a} l'analyse linguistique de surface. {L}es techniques sont pr{\'e}sent{\'e}es puis appliqu{\'e}es au domaine de l'extraction d'information. {N}ous montrons l'int{\'e}r{\^e}t de ces techniques et nous en donnons une {\'e}valuation fond{\'e}e sur leur pertinence pour la t{\^a}che vis{\'e}e.}, keywords={{P}r{\'e}-analyse de corpus; analyse linguistique de surface; approches statistiques; statistique textuelle; statistiques; textom{\'e}trie; lexicom{\'e}trie}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{J}ourn{\'e}es d'{A}nalyse des {D}onn{\'e}es {T}extuelles ({JADT} 2004) }, address={{L}ouvain {B}elgique }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085178/en/}, } %% hal-00085175, version 1 %% http://hal.archives-ouvertes.fr/hal-00085175/en/ @inproceedings{POIBEAU:2004:HAL-00085175:1, title={{S}emi-automatic generation of command grammar}, author={{P}oibeau, {T}hierry and {G}oujon, {B}{\'e}n{\'e}dicte}, abstract={{T}his paper presents an original strategy for the production of command grammars for complex systems. {W}e show that command grammars describe a sub-language that can be processed by local syntactic rules and compositional semantic strategies. {T}he paper shows how prepositional attachment ambiguity can be handled by such a system.}, keywords={command grammar; speech analysis}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{L}anguage and {R}esource {E}valuation {C}onference ({LREC} 2004) }, address={{L}isbonne {P}ortugal }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085175/en/}, } %% hal-00084483, version 1 %% http://hal.archives-ouvertes.fr/hal-00084483/en/ @inproceedings{SUNA:2004:HAL-00084483:1, title={{M}obile multi-agent systems: a programming language and its semantics}, author={{S}una, {A}lexandru and {E}l {F}allah - {S}egrouchni, {A}mal and {F}ouquer{\'e}, {C}hristophe and {B}aillot, {P}atrick}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{AAMAS}04 }, address={{\'E}tats-{U}nis d'{A}m{\'e}rique }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084483/en/}, } %% hal-00085509, version 1 %% http://hal.archives-ouvertes.fr/hal-00085509/en/ @inproceedings{VAUZEILLES:2004:HAL-00085509:1, title={{S}emantics and {C}omplexity of {AI} planning problems}, author={{V}auzeilles, {J}acqueline and {K}anovich, {M}ax}, keywords={{L}inear {L}ogic - {A}rtificial {I}ntelligence - {P}lanning - {C}omplexity}, language={{A}nglais}, affiliation={{R}ussian {S}tate {U}niversity for the {H}umanities - {R}ussian {S}tate {U}niversity for the {H}umanities - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{P}rotocollo {P}rogetto {W}orkshop }, address={{T}urin {I}talie }, note={{I}nvitation de {J}acqueline {V}auzeilles au workshop de fin du projet national italien {P}rotocollo - 14-17 septembre 2004 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085509/en/}, } %% hal-00085502, version 1 %% http://hal.archives-ouvertes.fr/hal-00085502/en/ @inproceedings{VAUZEILLES:2004:HAL-00085502:1, title={{AI} {P}lanning problems in the {H}orn {L}inear {L}ogic: {S}emantics and {C}omplexity}, author={{V}auzeilles, {J}acqueline and {K}anovich, {M}ax}, keywords={{L}inear {L}ogic - {A}rtificial {I}ntelligence - {P}lanning - {C}omplexity{A}}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {R}ussian {S}tate {U}niversity for the {H}umanities - {R}ussian {S}tate {U}niversity for the {H}umanities }, booktitle={{W}orkshop {L}ogic and {C}omplexity, {GEOCAL}'04 }, address={{V}illetaneuse {F}rance }, note={{ACI} {G}{\'e}om{\'e}tie du {C}alcul ({GEOCAL}) }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085502/en/}, } %% hal-00101149, version 1 %% http://hal.archives-ouvertes.fr/hal-00101149/en/ @inproceedings{ZEHRAOUI:2004:HAL-00101149:1, title={{C}ase representation, retrieval and reuse in the hybrid system for sequence processing {C}asep2}, author={{Z}ehraoui, {F}arida and {K}anawati, {R}ushed and {S}alotti, {S}ylvie}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}pplying {CBR} to time series prediction {W}orkshop, {P}roceedings of the {ECCBR} 2004 {W}orfshops }, address={{M}adrid {E}spagne }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00101149/en/}, } %% hal-00098066, version 1 %% http://hal.archives-ouvertes.fr/hal-00098066/en/ @inproceedings{AITELMEKKI:2003:HAL-00098066:1, title={{S}emi-automatic method for the construction of a document index}, author={{A}{\"i}t {E}l {M}ekki, {T}ouria and {N}azarenko, {A}deline}, abstract={{T}his paper deals with document indexes, which somteimes appear at the back of books and list their main subjects. {I}t shows how recent advances in natural language processing may help the indexing process.}, keywords={{N}atural language processing ; indexes}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{W}orkshop :"{A}pplied {N}atural {L}anguage {P}rocessing, possible applications for the {S}emantic {W}eb" associated with the {EUROLAN}-2003 summer school }, address={{B}ucharest {R}oumanie }, note={{H}.3.1 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00098066/en/}, } %% hal-00098060, version 1 %% http://hal.archives-ouvertes.fr/hal-00098060/en/ @inproceedings{AITELMEKKI:2003:HAL-00098060:1, title={{L}e r{\'e}seau terminologique, un {\'e}l{\'e}ment central pour la construction d'index de document}, author={{A}{\"i}t {E}l {M}ekki, {T}ouria and {N}azarenko, {A}deline}, abstract={{C}et article montre comment les outils de structuration de terminologie qui {\'e}tablissent des liens s{\'e}mantiques entre termes (hyperonymie, synonymie...) contribuent {\`a} la construction des index de documents.}, keywords={{R}{\'e}seau terminologique, acquisition de relations, construction d'index, acc{\`e}s {\`a}  l'information, mesure de pertinence}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}ctes des 5{\`e}mes rencontres terminologie et {I}ntelligence {A}rtificielle ({TIA}'03) }, address={{S}trasbourg {F}rance }, note={{H}.3.1 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00098060/en/}, } %% hal-00154175, version 1 %% http://hal.archives-ouvertes.fr/hal-00154175/en/ @inproceedings{ALFANDARI:2003:HAL-00154175:1, title={{M}od{\`e}les de localisation pour l'aide multicrit{\`e}re {\`a} la d{\'e}cision}, author={{A}lfandari, {L}aurent}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{ROADEF} 2003 }, address={{A}vignon {F}rance }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00154175/en/}, } %% hal-00082471, version 1 %% http://hal.archives-ouvertes.fr/hal-00082471/en/ @inproceedings{BANDERIER:2003:HAL-00082471:1, title={{S}moothed analysis: what's new?}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}nalysis of {A}lgorithms }, address={{F}rance }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082471/en/}, } %% hal-00082470, version 1 %% http://hal.archives-ouvertes.fr/hal-00082470/en/ @inproceedings{BANDERIER:2003:HAL-00082470:1, title={{S}moothed analysis of discrete combinatorial algorithms}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{R}andom {S}tuctures and {A}lgorithms }, address={{F}rance }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082470/en/}, } %% hal-00084371, version 1 %% http://hal.archives-ouvertes.fr/hal-00084371/en/ @inproceedings{CASTRODEANDRADE:2003:HAL-00084371:1, title={{S}ynth{\`e}se de r{\'e}seaux multiservice {\`a} demande incertaine}, author={{C}astro {D}e {A}ndrade, {R}afael and {L}isser, {A}bdel and {M}aculan, {N}elson and {P}lateau, {G}{\'e}rard}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} }, booktitle={{ROADEF}'2003 : 5{\`e}me congr{\`e}s de la {S}oci{\'e}t{\'e} fran{\c{c}}aise de {R}echerche {O}p{\'e}rationnelle et {A}ide {\`a} la {D}{\'e}cision }, address={{A}vignon {F}rance }, note={{OCAD} }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084371/en/}, } %% hal-00092208, version 1 %% http://hal.archives-ouvertes.fr/hal-00092208/en/ @inproceedings{GAYRAL:2003:HAL-00092208:1, title={{C}ollections {\'e}volutives et partitions}, author={{G}ayral, {F}ran{\c{c}}oise and {K}ayser, {D}aniel and {L}{\'e}vy, {F}ran{\c{c}}ois}, keywords={s{\'e}mantique;pluriel;partition}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{C}olloque "{L}a partition en langue et en discours" }, address={{F}rance }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00092208/en/}, } %% hal-00084989, version 1 %% http://hal.archives-ouvertes.fr/hal-00084989/en/ @inproceedings{HAMDOUN:2003:HAL-00084989:1, title={{C}onstruction et {A}uto-maintenance d'un web warehouse}, author={{H}amdoun, {S}ana and {B}oufares, {F}aouzi}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={proceedings du {C}olloque {N}ational de {R}echerche en {IUT} ({CNRIUT}'03) }, address={tarbes {F}rance }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084989/en/}, } %% hal-00085037, version 1 %% http://hal.archives-ouvertes.fr/hal-00085037/en/ @inproceedings{LETOCART:2003:HAL-00085037:1, title={{M}inimal multicut and maximal integer multiflow in rings}, author={{L}{\'e}tocart, {L}ucas and {C}osta, {M}arie-{C}hristine and {R}oupin, {F}r{\'e}d{\'e}ric}, language={{A}nglais}, affiliation={{C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={18th {I}nternational {C}onference on {M}athematical {P}rogramming }, address={{C}openhague {D}anemark }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00085037/en/}, } %% hal-00098059, version 1 %% http://hal.archives-ouvertes.fr/hal-00098059/en/ @inproceedings{NAZARENKO:2003:HAL-00098059:1, title={{U}ne mesure de pertinence pour le tri de l'information dans un document}, author={{N}azarenko, {A}deline and {A}{\"i}t {E}l {M}ekki, {T}ouria}, abstract={{N}ous nous int{\'e}ressons {\`a} la construction des index de ``fin de livre'' qui sont des outils de navigation et de recherche d'information dans un document. {C}e travail ets largement effectu{\'e} {\`a} la{C}'est un travail essentiellement manuel main et le co{\^u}t de la construction est parfois r{\'e}dhibitoire. {I}l y a donc un r{\'e}el besoin pour des outils automatiques assistant la construction d'index.\\ {N}ous proposons un outil d'aide {\`a} la construction et {\`a} la consultation d'index, {I}nd{D}oc, qui permet de d{\'e}grossir le travail d'indexation tout en assurant sa coh{\'e}rence. {L}'un des enjeux de la construction d'index est la s{\'e}lection des informations: s{\'e}lection des entr{\'e}es les plus pertinentes et des renvois au texte les plus int{\'e}ressantes. {C}ette s{\'e}lection est {\'e}videmment utile pour le lecteur qui doit trouver suffisamment d'information mais sans en {\^e}tre submerg{\'e}. {E}lle est {\'e}galement pr{\'e}cieuse pour l'auteur de l'index qui doit valider et corriger une {\'e}bauche d'index produite automatiquement par {I}nd{D}oc.\\ {N}ous montrons comment cette s{\'e}lection de l'information est r{\'e}alis{\'e}e par {I}nd{D}oc. {N}ous proposons une mesure qui permet de trier les entr{\'e}es par ordre de pertinence d{\'e}croissante et une m{\'e}thode pour calculer les renvois au texte {\`a} associer {\`a} chaque entr{\'e}e de l'index.}, keywords={acquisition de terminologies, segmentation th{\'e}matique, extraction d'information}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}telier {A}cquisition, apprentissage et exploitation de connaissances s{\'e}mantiques pour l'acc{\`e}s au contenu textuel, {P}lateforme {AFIA} }, address={{L}aval {F}rance }, note={{H}.3.1 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00098059/en/}, } %% hal-00004459, version 1 %% http://hal.archives-ouvertes.fr/hal-00004459/en/ @inproceedings{PAILLARD:2003:HAL-00004459:1, title={{L}e crible de la roue en distribu{\'e}}, author={{P}aillard, {G}abriel and {L}avault, {C}hristian}, abstract={{C}et article aborde la g{\'e}n{\'e}ration des nombres premiers inf{\'e}rieurs {\`a} {N} en utilisant le crible de la roue de fa{\c{c}}on distribu{\'e}e [{P}ritchard, 1982]. {L}es algorithmes de crible peuvent {\^e}tre un moyen tr{\`e}s efficace de d{\'e}terminer la primarit{\'e} des entiers appartenant {\`a} un intervalle fini donn{\'e} [1..{N}], si celui-ci est assez grand et que le test de primarit{\'e} s'effectue sur tous les nombres de l'intervalle [{C}randall, 2001]. {C}ette distribution du crible de la roue est la premi{\`e}re realis{\'e}e. {P}our l'introduire, nous expliquons le crible classique d'{E}ratosth{\`e}ne et nous montrons une impl{\'e}mentation que nous avons realis{\'e} en s{\'e}quentiel de celui-ci, puis une impl{\'e}mentation en distribu{\'e}. {L}'objectif primordial de la parall{\'e}lisation de ce genre d'algorithme est, soit de repousser les limites de la g{\'e}n{\'e}ration des nombres premiers, soit d'atteindre les limites desir{\'e}es dans un d{\'e}lai de temps inf{\'e}rieur. {N}ous montrons les r{\'e}sultats exp{\'e}rimentaux des algorithmes du crible d'{E}ratosth{\`e}ne et du crible de la roue, aussi bien en s{\'e}quentiel qu'en distribu{\'e}.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{MA}nifestation des {JE}unes {C}hercheurs en {STIC} }, address={{M}arseille {F}rance }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00004459/en/}, } %% hal-00082685, version 1 %% http://hal.archives-ouvertes.fr/hal-00082685/en/ @inproceedings{PAUCHET:2003:HAL-00082685:1, title={{M}odelling {P}lanning and {I}nteraction in the {F}ramework of {H}uman {C}ooperative {P}roblem {S}olving}, author={{P}auchet, {A}lexandre and {C}haignaud, {N}athalie and {E}l {F}allah {S}eghrouchni, {A}mal}, abstract={{T}his article deals with a human model of cooperative problem solving based on a psychological experimentation. {O}ur main goal is to improve the design of open multi-agent systems able to interact with human beings. {W}e aim at analyzing, modelling and simulating human capabilities of planning and interacting in a cooperative problem solving context. {O}ur planning model uses the {BDI} concepts extended with the notions of phases, states of mind, strategies and tactics. {O}ur interaction model is twofold: 1) it is based on the {S}peech {A}ct theory to represent the utterances; 2) it uses a discourse model, represented by timed automata, to describe the dynamics of human conversations. {T}his paper goes on to present an original architecture called {BDI}ggy where interaction and planning are linked homogeneously.}, keywords={{C}ognitive modelling; cooperative problem solving; human planning; human interaction; {BDI} agents.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {P}erception, {S}yst{\`e}mes, {I}nformation - {PSI} - {CNRS} : {FRE}2645 - {U}niversit{\'e} de {R}ouen - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ouen - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={{AAMAS} {W}orkshop on {H}uman and {M}ulti-{A}gent {S}ystems }, address={{M}elbourne {A}ustralie }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082685/en/}, } %% hal-00082679, version 1 %% http://hal.archives-ouvertes.fr/hal-00082679/en/ @inproceedings{PAUCHET:2003:HAL-00082679:1, title={{BDI}ggy: a {C}ognitive {A}rchitecture for {C}ooperative {P}roblem {S}olving}, author={{P}auchet, {A}lexandre and {C}haignaud, {N}athalie and {E}l {F}allah {S}eghrouchni, {A}mal}, abstract={{T}his article deals with a human model of cooperative problem solving based on a psychological experiment. {O}ur main goal is to improve the design of open multi-agent systems able to interact with humans. {W}e aim at analyzing, modelling and simulating human capabilities of planning and interacting in a cooperative problem solving context. {T}his paper goes on to present an original architecture called {BDIGGY} where interaction and planning are linked homogeneously.}, keywords={{C}ognitive modelling; cooperative problem solving; human planning; human interaction; {BDI} agents.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {P}erception, {S}yst{\`e}mes, {I}nformation - {PSI} - {CNRS} : {FRE}2645 - {U}niversit{\'e} de {R}ouen - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ouen - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={{A}ctes de {IAT}'03 }, address={{H}alifax {C}anada }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082679/en/}, } %% hal-00082676, version 1 %% http://hal.archives-ouvertes.fr/hal-00082676/en/ @inproceedings{PAUCHET:2003:HAL-00082676:1, title={{R}{\'e}solution coop{\'e}rative de probl{\`e}mes int{\'e}grant planification et interaction}, author={{P}auchet, {A}lexandre and {C}haignaud, {N}athalie and {E}l {F}allah {S}eghrouchni, {A}mal}, abstract={{C}et article pr{\'e}sente un mod{\`e}le de planification et d'interaction humaine fond{\'e} sur une exp{\'e}rimentation psychologique. {N}otre but est d'am{\'e}liorer la conception des syst{\`e}mes multiagents interagissant avec les humains. {N}ous cherchons {\`a} analyser, mod{\'e}liser et simuler les capacit{\'e}s humaines de planification et d'interaction durant la r{\'e}solution coop{\'e}rative de probl{\`e}mes. {C}et article pr{\'e}sente une architecture originale appel{\'e}e {BDIGGY} reliant de fa{\c{c}}on homog{\`e}ne l'interaction et la planification.}, keywords={{M}od{\'e}lisation cognitive; r{\'e}solution coop{\'e}rative de probl{\`e}mes; planification humaine; interaction humaine; agents {BDI}.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {P}erception, {S}yst{\`e}mes, {I}nformation - {PSI} - {CNRS} : {FRE}2645 - {U}niversit{\'e} de {R}ouen - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ouen - {L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={{A}ctes des {JFSMA}'03 }, address={{H}ammamet {T}unisie }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082676/en/}, } %% hal-00084366, version 1 %% http://hal.archives-ouvertes.fr/hal-00084366/en/ @inproceedings{THIONGANE:2003:HAL-00084366:1, title={{T}echniques de r{\'e}optimisation dans une s{\'e}quence d'instances du probl{\`e}me du sac {\`a} dos unidimensionnel 0-1}, author={{T}hiongane, {B}abacar and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{ROADEF}'03 : 5{\`e}me congr{\`e}s de la {S}oci{\'e}t{\'e} fran{\c{c}}aise de {R}echerche {O}p{\'e}rationnelle et {A}ide {\`a} la {D}{\'e}cision }, address={{A}vignon {F}rance }, note={26-28 f{\'e}vrier {OCAD} }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084366/en/}, } %% hal-00084635, version 1 %% http://hal.archives-ouvertes.fr/hal-00084635/en/ @inproceedings{ZEBOULON:2003:HAL-00084635:1, title={{H}ybrid {C}onnectionist {A}pproach for {K}nowledge {D}iscovery from {W}eb {N}avigation {P}atterns}, author={{Z}eboulon, {A}rnaud and {B}ennani, {Y}oun{\`e}s and {B}enabdeslem, {K}halid}, abstract={{I}n this article, we apply the “{EM}” algorithm to learning the parameters of a {M}arkov chain mixture model for clus-tering navigation sessions on a {W}eb site. {O}ur main con-tribution is to deduce the model's initial parameters from clusters formed by a hierarchical clustering of a sample of sessions, whose dissimilarity matrix is computed by {D}ynamic {T}ime {W}arping. {T}he states of the {M}arkov chains are the neurons of a {K}ohonen {S}elf {O}rganizing {M}ap, which displays the site as it is seen by the users and also clusters its pages (one neuron corresponding to a cluster of pages). {T}his technique for clustering sessions has been validated on a set of semi-artificial data and the results are excellent. {F}inally, we tested several criteria for the determination of the optimal number of clusters and con-cluded that the {A}kaike {I}nformation {C}riterion was best suited to this problem.}, keywords={{C}onnectionist {L}earning, {K}nowledge {D}iscovery from {W}eb {N}avigation {P}atterns, {W}eb mining.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{ACS}/{IEEE} {I}nternational {C}onference on {C}omputer {S}ystems and {A}pplications }, address={tunis {T}unisie }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084635/en/}, } %% hal-00154165, version 1 %% http://hal.archives-ouvertes.fr/hal-00154165/en/ @inproceedings{ALFANDARI:2002:HAL-00154165:1, title={{A} path-relinking metaheuristic for the generalized assignment problem}, author={{A}lfandari, {L}aurent and {P}lateau, {A}gn{\`e}s and {T}olla, {P}ierre}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={12th {S}ymposium on {C}ombinatorial {O}ptimization ({CO}'02) }, address={{P}aris {F}rance }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00154165/en/}, } %% hal-00085552, version 1 %% http://hal.archives-ouvertes.fr/hal-00085552/en/ @inproceedings{BANDERIER:2002:HAL-00085552:1, title={{W}hy {D}elannoy numbers?}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{L}attice {P}aths'02, {M}ay 2002. }, address={{A}thens {G}r{\`e}ce }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00085552/en/}, } %% hal-00082462, version 1 %% http://hal.archives-ouvertes.fr/hal-00082462/en/ @inproceedings{BANDERIER:2002:HAL-00082462:1, title={{M}ultidimensional partitions}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}{\'e}minaire {L}otharingien de {C}ombinatoire }, address={{F}rance }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00082462/en/}, } %% hal-00082459, version 1 %% http://hal.archives-ouvertes.fr/hal-00082459/en/ @inproceedings{BANDERIER:2002:HAL-00082459:1, title={{C}omplexit{\'e} pertubative et analyse d'algoritmes}, author={{B}anderier, {C}yril}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{N}ouveaux mod{\`e}les de calculs: complexit{\'e} et algorithmes }, address={{F}rance }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00082459/en/}, } %% hal-00085307, version 2 %% http://hal.archives-ouvertes.fr/hal-00085307/en/ @inproceedings{DUCHAMP:2001:HAL-00085307:2, title={{E}xtending the scalars of minimizations}, author={{D}uchamp, {G}{\'e}rard and {L}augerotte, {E}ric and {L}uque, {J}ean-{G}abriel}, abstract={{I}n the classical theory of formal languages, finite state automata allow to recognize the words of a rational subset of $\{S}igma^*$ where $\{S}igma$ is a set of symbols (or the alphabet). {N}ow, given a semiring $(\{K},+,.)$, one can construct $\{K}$-subsets of $\{S}igma^*$ in the sense of {E}ilenberg , that are alternatively called noncommutative formal power series for which a framework very similar to language theory has been constructed {P}articular noncommutative formal power series, which are called rational series, are the behaviour of a family of weighted automata (or $\{K}$-automata). {I}n order to get an efficient encoding, it may be interesting to point out one of them with the smallest number of states. {M}inimization processes of $\{K}$-automata already exist for $\{K}$ being:\\ {\bf a)} a field ,\\ {\bf b)} a noncommutative field ,\\ {\bf c)} a {PID} .\\ {W}hen $\{K}$ is the bolean semiring, such a minimization process (with isomorphisms of minimal objects) is known within the category of deterministic automata. {M}inimal automata have been proved to be isomorphic in cases {\bf (a)} and {\bf (b)}. {B}ut the proof given for (b) is not constructive. {I}n fact, it lays on the existence of a basis for a submodule of $\{K}^n$. {H}ere we give an independent algorithm which reproves this fact and an example of a pair of nonisomorphic minimal automata. {M}oreover, we examine the possibility of extending {\bf (c)}. {T}o this end, we provide an {\em {E}ffective {M}inimization {P}rocess} (or {\em {EMP}}) which can be used for more general sets of coefficients.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'informatique fondamentale et appliqu{\'e}e de {R}ouen - {LIFAR} {EA}2655 - {U}niversit{\'e} de {R}ouen - {L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique }, booktitle={{SCI} }, address={{O}rlando {\'E}tats-{U}nis d'{A}m{\'e}rique }, ARXIVID={math.CO/0607411 }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00085307/en/}, } %% hal-00094963, version 1 %% http://hal.archives-ouvertes.fr/hal-00094963/en/ @inproceedings{HAMON:1998:HAL-00094963:1, title={{D}oes the general semantic information help the terminology structuration ?}, author={{H}amon, {T}hierry}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}econd {W}orkshop on {L}exical {S}emantics {S}ystems }, address={{P}ise {I}talie }, year={1998}, URL={http://hal.archives-ouvertes.fr/hal-00094963/en/}, } %% edutice-00180329, version 1 %% http://edutice.archives-ouvertes.fr/edutice-00180329/en/ @inproceedings{SELVA:1997:EDUTICE-00180329:1, title={{L}exical comprehension and production in {A}lexia system}, author={{S}elva, {T}hierry and {I}ssac, {F}abrice and {C}hanier, {T}hierry and {F}ouquer{\'e}, {C}hristophe}, abstract={{I}n language learning, vocabulary is very important. {S}tudies have shown that the dictionary is used very often in a written comprehension task. {H}owever, its utility is not always obvious. {I}n this paper we discuss the improvements electronic dictionaries can provide compared to classical paper ones. {I}n lexical access, they help the learner by making the relevant information selection and research easier and then improve the efficiency of usage. {O}ur system, {A}lexia, contains specific lexical information for learners. {I}n lexical production, computers gives us large possibilities with automatic processing. {W}e will see how we use an analyser and a parser in order to make pedagogical new style activities.}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique de l'{U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {LIFC} - {CNRS} : {FRE}2661 - {INRIA} - {U}niversit{\'e} de {F}ranche-{C}omt{\'e} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{L}anguage {T}eaching and {L}anguage {T}echnology }, address={{G}roningen {P}ays-{B}as }, month={04}, year={1997}, URL={http://edutice.archives-ouvertes.fr/edutice-00180329/en/}, } %% hal-00339909, version 1 %% http://hal.archives-ouvertes.fr/hal-00339909/en/ @book{ASEERVATHAM:2008:HAL-00339909:1, title={{A}pprentissage {\`a} base de {N}oyaux {S}{\'e}mantiques pour le {T}raitement de {D}onn{\'e}es {T}extuelles}, author={{A}seervatham, {S}ujeevan}, abstract={{D}epuis le d{\'e}but des ann{\'e}es 80, les m{\'e}thodes d'apprentissage automatique appliqu{\'e}es au traitement de donn{\'e}es textuelles connaissent un int{\'e}r{\^e}t grandissant. {C}ette tendance est principalement due au fait que la taille des corpus est en perp{\'e}tuelle croissance. {A}insi, les m{\'e}thodes utilisant le travail d'experts sont devenues co{\^u}teuses perdant peu {\`a} peu de leur popularit{\'e} au profit des syst{\`e}mes d'apprentissage. {D}ans cette th{\`e}se, nous nous int{\'e}ressons {\`a} deux axes. {L}e premier axe porte sur l'{\'e}tude des probl{\'e}matiques li{\'e}es au traitement de donn{\'e}es textuelles structur{\'e}es par des approches {\`a} noyaux. {N}ous pr{\'e}sentons un noyau s{\'e}mantique pour les documents structur{\'e}s au format {XML}. {L}e noyau tire ses informations s{\'e}mantiques d'une source de connaissances externe, {\`a} savoir un th{\'e}saurus. {C}e noyau a {\'e}t{\'e} test{\'e} sur un corpus de documents m{\'e}dicaux avec le th{\'e}saurus m{\'e}dical {UMLS}. {I}l a {\'e}t{\'e} class{\'e}, lors d'un challenge international de cat{\'e}gorisation de documents, parmi les 10 m{\'e}thodes les plus performantes sur 44. {L}e second axe porte sur l'{\'e}tude des concepts latents extraits par des m{\'e}thodes statistiques telles que l'{A}nalyse {S}{\'e}mantique {L}atente ({LSA}). {N}ous pr{\'e}sentons, dans une premi{\`e}re partie, des noyaux exploitant des concepts linguistiques provenant d'une source externe et des concepts statistiques issus de la {LSA}. {N}ous montrons qu'un noyau int{\'e}grant les deux types de concepts permet d'am{\'e}liorer les performances. {P}uis, dans une deuxi{\`e}me partie, nous pr{\'e}sentons un noyau utilisant des {LSA} locaux afin d'extraire des concepts latents permettant d'obtenir une repr{\'e}sentation plus fine des documents.}, keywords={apprentissage; th{\`e}se; noyaux; s{\'e}mantique; base; traitement; donn{\'e}es; textuelles; informatique}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{E}dilivre - {C}ollection {U}niversitaire }, pages={220 }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00339909/en/}, } %% hal-00347001, version 1 %% http://hal.archives-ouvertes.fr/hal-00347001/en/ @book{POIBEAU:2008:HAL-00347001:1, title={{P}roceedings of the 2nd workshop on {M}ulti-source, {M}ultilingual {I}nformation {E}xtraction and {S}ummarization}, author={{P}oibeau, {T}hierry and {B}andyopadhyay, {S}ivaji and {S}aggion, {H}oracio and {Y}angarber, {R}oman}, abstract={{I}nformation extraction ({IE}) and text summarization ({TS}) are key technologies aiming at extracting relevant information from texts and presenting the information to the user in a condensed form. {T}he ongoing information explosion makes {IE} and {TS} particularly critical for successful functioning within the information society. {T}hese technologies, however, face new challenges with the adoption of the {W}eb 2.0 paradigm (e.g., blogs, wikis) due to their inherent multi-source nature. {T}hese technologies must no longer deal only with isolated texts or narratives, but with large-scale repositories or sources—possibly in several languages—containing a multiplicity of views, opinions, and commentaries on particular topics, entities and events. {T}here is thus a need to adapt and/or develop new techniques to deal with these new phenomena. {R}ecognising similar information across different sources and/or in different languages is of paramount importance in this multi-source, multi-lingual context. {I}n information extraction, merging information from multiple sources can lead to increased accuracy, as compared to extraction from a single source. {I}n text summarization, similar facts found across sources can inform sentence scoring algorithms. {I}n question answering, the distribution of answers in similar contexts can inform answer-ranking components. {O}ften, it is not the similarity of information that matters, but its complementary nature. {I}n a multi-lingual context, information extraction and text summarization can provide solutions for crosslingual access: key pieces of information can be extracted from different texts in one or many languages, merged, and then conveyed in natural language in concise form. {A}pplications need to be able to cope with the idiosyncratic nature of the new {W}eb 2.0 media: mixed input, new jargon, ungrammatical and mixed-language input, emotional discourse, etc. {I}n this context, synthesizing or inferring opinions from multiple sources is a new and exciting challenge for {NLP}. {O}n another level, profiling of individuals who engage in the new social {W}eb, and identifying whether a particular opinion is appropriate/relevant in a given context are important topics to be addressed. {T}he objective of this second {M}ulti-source {M}ultilingual {I}nformation {E}xtraction and {S}ummarization ({MMIES}) workshop is to bring together researchers and practitioners in information-access technologies, to discuss recent approaches for dealing with multi-source and multi-lingual challenges.}, keywords={{I}nformation {E}xtraction; {A}utomatic {S}ummarization}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omputer {S}cience {L}ab. - {J}adavpur {U}niversity - {C}omputer {S}cience {D}pt - {U}niversity of {S}heffield - {U}niversity of {H}elsinki - {U}niversity of {H}elsinki }, publisher={{COLING}-{ACL} }, pages={80 }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00347001/en/}, } %% hal-00149430, version 1 %% http://hal.archives-ouvertes.fr/hal-00149430/en/ @book{CERIN:2007:HAL-00149430:1, title={{L}arge {S}cale {G}rid}, author={{C}{\'e}rin, {C}hristophe}, abstract={{T}he idea of this special issue on large scale grids came after a successful meeting that has been co-located with {E}uropar'2005 in {L}isboa. {T}his meeting, namely {G}rid@{L}arge1 was organized by {INRIA}2, the {U}niversity of {N}ice ({F}rance) and {C}oor{G}rid3. {I} take the opportunity to thank {L}uc {B}oug{\'e} and {I}gor {R}osenberg for the setting and organization of the meeting and for asking me to join the team. {T}he workshop was made up with the contribution of a dozen of invited speakers. {I}t gave “updated visions of large-scale deployment, user management, financial issues, and security in grids”. {I}t was also a matter of concerns on “grid achievements, large-scale grids in other domains, physical maintenance, failure recovery, networking, software/hardware upgrade”. {A}mong the rich conclusion of the workshop, {I} would like to mention the observation of participants saying that “a deployment phase of information technologies is starting, but the application interaction stage remains complicated”. {T}he lessons learned during the workshop pointed out the difficulties in/with {P}erformance (while structure can grow and spread, local memory does not hence programming difficulties), {S}implicity (grids should be easy to use for people who are already coming from other sciences than {C}omputer {S}cience or {E}ngineering), {I}nteroperability (the data format and communication models should follow the user needs), {U}pgrading (schemes where deprecated technology is working with state-of-the-art implementations), {S}ecurity/{R}eliability (do we leave it to the user?) and {M}anagement (distributed know-how can be hard to handle). {T}o carry on with such topics and to check the reality of such assertions, we decided to implement this special issue and to give the word to researchers rather than experts. {T}he aim was to find good projects with meaningful results that demonstrate the utility, the relevance of grids, but large scale grids. {M}any discussions with {D}enis {T}rystram ({P}arallel {C}omputing {R}epresentative) have been necessary to converge towards an adequate format. {T}hen a call for papers was setup. {T}he special issue aims at gathering papers in the fields of {G}rid, {D}istributed {S}ystems, {N}etworking. {T}he special issue was opened for contributions in connected fields: {P}2{P} systems, {S}ensors {N}etworks, {N}etworking, {L}arge {S}cale {H}eterogeneous {D}istributed databases. {T}his way, we expected to be able to confront concepts of these various areas and then, investigate which ones may present mutual interest for the different communities. {T}he “traditional” {G}rid community has up to now developed environments based on ‘in-house' ideas and skills ({G}lobus, {U}nicore, etc.), with little attention to sibling communities. {T}he challenges set by “large-scale” use of {G}rids will necessarily demand importing ideas from other technologies, in the first place peer-to-peer approaches, and component-based software engineering as mentioned previously. {R}esearch in large scale distributed systems requires a new methodology since most of the past work have not investigated the impact of large scale notions on algorithms and applications. {S}o, new tools, benchmarks and use cases have to be investigated. {F}or instance, several tools are emerging like large experimental testbeds. {O}utdoor platforms such as {P}lanet-{L}ab, {G}rid5000 (in {F}rance), and indoor platforms such as {E}mulab ({USA}), {AIST} {S}uper{C}luster ({J}apan) and {G}rid e{X}plorer ({F}rance) are some of the new tools proposed for investigating research challenge in {L}arge {S}cale distributed systems. {S}ince these tools are essential in the evaluation of concepts and technologies for large scale grid, the {PC} members have especially appreciated submissions in this area.}, keywords={{L}arge {S}cale {G}rid {R}elated {S}ystems;{L}arge {S}cale {H}eterogeneous {D}istributed {D}atabases;{L}arge {S}cale {P}2{P} {S}ystems/{D}esktop {G}rids; {L}arge {S}cale {S}ensor {N}etworks;{M}ethodology for {L}arge {S}cale {G}rids; {C}oncepts for {L}arge {S}cale {G}rids;{T}echnologies/environnent for {L}arge {S}cale {G}rids;{A}pplication of {L}arge {S}cale {G}rids}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{E}lsevier }, pages={123 }, editor={{C}hristophe {C}{\'e}rin }, note={{S}pecial {I}ssue of "{P}arallel {C}omputing" {J}ournal, {V}olume 33, {I}ssues 4-5, {M}ay 2007, {P}ages 235-237 }, doi={10.1016/j.parco.2007.02.009 }, day={30}, month={04}, year={2007}, URL={dx.doi.org/10.1016/j.parco.2007.02.009 http://hal.archives-ouvertes.fr/hal-00149430/en/}, } %% hal-00149425, version 1 %% http://hal.archives-ouvertes.fr/hal-00149425/en/ @book{CERIN:2007:HAL-00149425:1, title={{A}dvances in {G}rid and {P}ervasive {C}omputing, {S}econd {I}nternational {C}onference, {GPC} 2007, {P}aris, {F}rance, {M}ay 2007}, author={{C}{\'e}rin, {C}hristophe and {L}i, {K}uan-{C}hing}, abstract={{GPC} 2007 provided a high-profile, leading-edge forum for researchers and developers from industry and academia to report on the latest scientific and technical advances, discuss and debate the major issues, and showcase the latest systems in merging grid computing and the pervasive computing field. {T}his year, a total of 217 high-quality papers were submitted by researchers and practitioners from about 20 countries. {A}ll the submissions were rigorously reviewed by the {P}rogram {C}ommittee members. {T}o ensure fairness and the quality of the papers, we put a number of measures in place. {F}or example, each paper was assigned at least one reviewer from {A}ustralia, one reviewer from {A}merica, and one reviewer from {E}urope. {B}ased on the originality, significance, correctness, relevance, and clarity of presentation, 56 submissions were selected as regular papers and 12 were selected as short papers. {T}he acceptation rate is 32%. {A}lso, the authors of accepted papers were required to submit a read-me file along with the camera-ready version of their paper explaining how the reviewers comments were taken into account in the final version of their paper. {T}he publication {C}o-chairs, {L}ucian {F}inta ({P}aris {XIII}, {F}rance) and {J}emal {H}. {A}bawajy ({D}eakin {U}niversity, {A}ustralia), painstakingly went through each read-me file and reviewers' comments to ensure that the comments were indeed incorporated into the final version of the papers. {O}nly those papers that included reviewers' comments were finally accepted for inclusion in the proceedings. {U}ndoubtedly, {L}ucian and {J}emal had to work long hours to meet the tight deadline, which is greatly appreciated. {T}he overall outcome of the revision process is a selection of papers that showcase the very best of grid and pervasive computing technology today. {A}fter the conference, the proceedings editors selected and recommended some highquality papers from the {GPC} 2007 conference to be published in special issues of international journals. {S}pecial thanks go to {J}emal {H}. {A}bawajy for liasing with the chief editors of the journals. {T}he {GPC} 2007 program included presentations by accepted paper authors, keynote speeches, and a special round table on “{P}ervasive {G}rid.” {T}he special round table was organized by {L}ionel {B}runie, {M}anish {P}arashar, and {J}ean-{M}arc {P}ierson. {W}e thank them for this initiative. {W}e allocated a slot of 30 minutes for each paper presentation so that the participants had plenty of time for questions and answers.{W}e were also delighted to be able to welcome three well-known international researchers, {T}hierry {P}riol ({F}rance) representing the {E}uropean {C}ore{G}rid initiative, {M}inyi {G}uo, {P}rofessor at the {S}chool of {C}omputer {S}cience and {E}ngineering, {U}niversity of {A}izu ({J}apan), and {L}aurence {T}. {Y}ang representing {S}t. {F}rancis {X}avier {U}niversity ({C}anada), who delivered the keynote speeches.}, keywords={{G}rid, {P}ervasive computing}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{S}pringer {V}erlag, {LNCS} 4459 }, pages={759 }, editor={{C}hristophe {C}{\'e}rin and {K}uan {C}hing {L}i }, note={{LNCS} }, day={30}, month={04}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00149425/en/}, } %% hal-00082737, version 1 %% http://hal.archives-ouvertes.fr/hal-00082737/en/ @book{PLATEAU:2007:HAL-00082737:1, title={{L}e probl{\`e}me du sac {\`a} dos en variables 0-1}, author={{P}lateau, {G}{\'e}rard and {N}agih, {A}nass}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{H}erm{\`e}s }, pages={29 }, editor={{V}angelis {P}aschos }, note={{P}robl{\`e}mes paradigmatiques , {O}ptimisation {C}ombinatoire, volume 4 {OCAD} pages 163-190 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00082737/en/}, } %% hal-00084647, version 1 %% http://hal.archives-ouvertes.fr/hal-00084647/en/ @book{BENNANI:2006:HAL-00084647:1, title={{A}pprentissage {C}onnexionniste}, author={{B}ennani, {Y}oun{\`e}s}, abstract={{L}'apprentissage connexionniste est une discipline scientifique qui recouvre plusieurs aspects d'{\'e}tudes math{\'e}matiques, statistiques et algorithmiques. {L}es syst{\`e}mes d'apprentissage connexionnistes (ou r{\'e}seaux de neurones artificiels) sont des syst{\`e}mes num{\'e}riques permettant la mod{\'e}lisation de processus g{\'e}n{\'e}raux par l'{\'e}tablissement de mod{\`e}les fonctionnels. {C}eux-ci sont identifi{\'e}s {\`a} partir des observations du processus par des algorithmes dits "d'apprentissage" qui s'apparentent {\`a} des techniques d'estimation statistiques. {N}{\'e}s en informatique dans le domaine de l'intelligence artificielle, ils ont connu depuis le d{\'e}but des ann{\'e}es 80 un d{\'e}veloppement intensif d{\^u} au succ{\`e}s rencontr{\'e} dans une tr{\`e}s large gamme d'applications. {L}es r{\'e}seaux connexionnistes offrent une panoplie de techniques adaptatives pour de nombreux probl{\`e}mes g{\'e}n{\'e}riques : la classification, le classement, la mod{\'e}lisation, la pr{\'e}vision. {L}es applications de ces techniques sont tr{\`e}s strat{\'e}giques, notamment pour la fouille de donn{\'e}es et la reconnaissance des formes. {C}et ouvrage pr{\'e}sente les fondements th{\'e}oriques et algorithmiques de l'apprentissage connexionniste. {I}l s'adresse aux {\'e}tudiants, {\'e}l{\`e}ves-ing{\'e}nieurs, enseignants, chercheurs, ing{\'e}nieurs et industriel en informatique, et math{\'e}matiques appliqu{\'e}es.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{H}erm{\`e}s }, pages={370 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084647/en/}, } %% hal-00084193, version 1 %% http://hal.archives-ouvertes.fr/hal-00084193/en/ @book{KORDON:2006:HAL-00084193:1, title={{M}{\'e}thodes formelles pour les syst{\`e}mes r{\'e}partis et coop{\'e}ratifs}, author={{K}ordon, {F}abrice and {H}addad, {S}erge and {P}etrucci, {L}aure}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'{I}nformatique de {P}aris 6 - {LIP}6 - {CNRS} : {UMR}7606 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{H}erm{\`e}s }, pages={370 }, note={{\`a} para{\^i}tre en septembre 2006 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084193/en/}, } %% hal-00091642, version 1 %% http://hal.archives-ouvertes.fr/hal-00091642/en/ @book{KAYSER:2004:HAL-00091642:1, title={{I}ntelligence artificielle et agents intelligents}, author={{K}ayser, {D}aniel and {F}lorea, {A}dina {M}agda and {P}entiuc, {S}tefan {G}heorghe}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {D}{\'e}partement d'{O}rdinateurs, {F}acult{\'e} d'{A}utomatique et {O}rdinateurs - {UNIVERSITE} “{POLITEHNICA}” {DE} {BUCAREST} - {F}acult{\'e} d'{I}ng{\'e}nierie {E}lectrique, {C}ollectif d'{I}ntelligence {A}rtificielle et {G}{\'e}nie {L}ogiciel - {UNIVERSITE} “{STEFAN} {CEL} {MARE}” {SUCEAVA} }, publisher={{P}rintech }, pages={375 }, note={{ISBN} 973-652-976 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00091642/en/}, } %% hal-00082478, version 1 %% http://hal.archives-ouvertes.fr/hal-00082478/en/ @book{BANDERIER:2003:HAL-00082478:1, title={{D}iscrete {R}andom {W}alks: {T}heory and applications in combinatorics, computational biology, computer science, probability theory, and statistical physics.}, author={{B}anderier, {C}yril and {K}rattenthaler, {C}hristian}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}ombinatorics group - {U}niversit{\"a}t {W}ien }, publisher={{D}iscrete {M}athematics \& {T}heoretical {C}omputer {S}cience }, pages={1 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082478/en/}, } %% hal-00005506, version 1 %% http://hal.archives-ouvertes.fr/hal-00005506/en/ @book{POIBEAU:2003:HAL-00005506:1, title={{E}xtraction automatique d'information : {D}u texte brut au web s{\'e}mantique}, author={{P}oibeau, {T}hierry}, abstract={{L}es entreprises et les particuliers sont confront{\'e}s {\`a} une masse d'information sans cesse croissante. {P}artant de ce constat, de nombreux syst{\`e}mes ont {\'e}t{\'e} con{\c{c}}us pour filtrer, trier et cat{\'e}goriser l'information. {L}'offre est en revanche beaucoup plus faible en ce qui concerne l'analyse du contenu. {E}xtraction automatique d'information - du texte brut au web s{\'e}mantique pr{\'e}sente les progr{\`e}s r{\'e}cents en extraction d'information et en compr{\'e}hension de textes. {L}es recherches effectu{\'e}es ces derni{\`e}res ann{\'e}es dans le domaine du traitement automatique des langues rendent en effet possible l'annotation s{\'e}mantique de documents, l'extraction d'information pertinente et la cr{\'e}ation de bases de connaissances structur{\'e}es {\`a} partir de textes en langage naturel. {L}'ouvrage rappelle les grands courants de recherche qui ont marqu{\'e} le domaine de la compr{\'e}hension automatique de textes par ordinateur. {I}l se poursuit par la pr{\'e}sentation d{\'e}taill{\'e}e d'un syst{\`e}me appel{\'e} {SEMTEX}, qui est appliqu{\'e} {\`a} une grande vari{\'e}t{\'e} de textes et de situations diff{\'e}rentes. {L}es applications d{\'e}taill{\'e}es donnent des perspectives sur le web s{\'e}mantique et l'ing{\'e}nierie des connaissances.}, keywords={extraction d'information, traitement des langues, recherche d'information, linguistique, informatique}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{L}avoisier }, pages={238 }, note={{ISBN} 2-7462-0610-2 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00005506/en/}, } %% hal-00091603, version 1 %% http://hal.archives-ouvertes.fr/hal-00091603/en/ @book{KAYSER:1997:HAL-00091603:1, title={{L}a repr{\'e}sentation des connaissances}, author={{K}ayser, {D}aniel}, keywords={{I}nf{\'e}rence; {C}odage; {C}onnaissance; {M}od{\`e}le; {L}ogique; {L}ogique modale; {L}ogique multi-valu{\'e}e; {R}{\'e}seaux s{\'e}mantiques; {L}ogiques non monotones; {S}ciences {C}ognitives}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{H}erm{\`e}s }, pages={308 }, year={1997}, URL={http://hal.archives-ouvertes.fr/hal-00091603/en/}, } %% hal-00085062, version 1 %% http://hal.archives-ouvertes.fr/hal-00085062/en/ @book{RECANATI:1993:HAL-00085062:1, title={{X}-{W}indow: manuel de programmation - avec exercices corrig{\'e}s}, author={{R}ecanati, {C}atherine}, keywords={syst{\`e}me {X}-{W}indow; librairie {X}lib; programmation; interfaces graphiques; syst{\`e}mes de fen{\^e}trage;}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{E}ditions {E}yrolles }, pages={390 pages }, year={1993}, URL={http://hal.archives-ouvertes.fr/hal-00085062/en/}, } %% hal-00174388, version 1 %% http://hal.archives-ouvertes.fr/hal-00174388/en/ @incollection{SZULMAN:2008:HAL-00174388:1, title={{T}he {T}erminae {M}ethod and {P}latform for {O}ntology {E}ngineering from {T}exts}, author={{S}zulman, {S}ylvie and {A}ussenac-{G}illes, {N}athalie and {D}espres, {S}ylvie}, abstract={{D}esigned about ten years ago, the \textsc{{T}erminae} method and workbench for ontology engineering from texts have been going on evolving since then. {O}ur investigations integrate the experience gained through its use in industrial and academic projects, the progress of natural language processing as well as the evolution of the ontology engineering. {S}everal new methodological guidelines, such as the reuse of core ontologies, have been added to the method and implemented in the workbench. {I}t has also been modified in order to be compliant to some recent standards such as the {OWL} knowledge representation. {T}he paper recalls the terminology engineering principles underlying {T}erminae and comments its originality. {T}hen it presents the kind of conceptual model that is built with this method, and their knowledge representation. {T}he method and the support provided by the workbench are detailed and illustrated with a case-study in law. {W}ith regard to the state of the art, \textsc{{T}erminae} is one of the most supervised methods in the trend of ontology learning. {T}his option raises epistemological issues about how language and knowledge can be articulated and the distance that separate formal ontologies from learning conceptual models.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nstitut de recherche en informatique de {T}oulouse - {IRIT} - {CNRS} : {UMR}5505 - {U}niversit{\'e} des {S}ciences {S}ociales - {T}oulouse {I} - {U}niversit{\'e} {P}aul {S}abatier - {T}oulouse {III} }, booktitle={{B}ridging the {G}ap between {T}ext and {K}nowledge - {S}elected {C}ontributions to {O}ntology {L}earning and {P}opulation from {T}ext }, publisher={{IOS} press }, pages={paru }, month={02}, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00174388/en/}, } %% hal-00152277, version 1 %% http://hal.archives-ouvertes.fr/hal-00152277/en/ @incollection{MONNOT:2007:HAL-00152277:1, title={{C}omplexity and approximation results for bounded-size paths packing problems}, author={{M}onnot, {J}{\'e}r{\^o}me and {T}oulouse, {S}ophie}, abstract={{T}his chapter presents some recent works given by the authors (\cite{{MT}05,{MT}07}) about the complexity and the approximation of several problems on computing collections of (vertex)-disjoint paths of bounded size.}, language={{A}nglais}, affiliation={{L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{C}ombinatorial {O}ptimization and {T}heoretical {C}omputer {S}cience {I}nterfaces and {P}erspectives 30th anniversary of the {LAMSADE} }, publisher={{ISTE} }, pages={not printed yet }, editor={{V}angelis {T}h. {P}aschos }, day={15}, month={03}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00152277/en/}, } %% hal-00152332, version 1 %% http://hal.archives-ouvertes.fr/hal-00152332/en/ @incollection{MONNOT:2007:HAL-00152332:1, title={{L}e voyageur de commerce et ses variations : un tour d'horizon de ses r{\'e}solution}, author={{M}onnot, {J}{\'e}r{\^o}me and {T}oulouse, {S}ophie}, abstract={[extrait de l'intro] {L}a difficult{\'e} de r{\'e}solution du {TSP} a d'autant plus port{\'e} sur lui l'attention des chercheurs. {A}ussi a-t-il {\'e}t{\'e} {\'e}tudi{\'e} et retourn{\'e} sous tous les angles~: th{\'e}orie des graphes, programmation lin{\'e}aire, programmation dynamique, optima locaux, etc. {L}es premi{\`e}res formalisations de la recherche exhaustive par la strat{\'e}gie d'{\'e}valuation et s{\'e}paration seraient m{\^e}me n{\'e}es de recherches sur le voyageur de commerce. {C}e chapitre retrace, certainement pas de fa{\c{c}}on exhaustive, l'histoire conjointe de la recherche op{\'e}rationnelle et du voyageur de commerce. {A}pr{\`e}s avoir pr{\'e}sent{\'e} le probl{\`e}me, nous proposons des algorithmes, exacts puis approch{\'e}s, pour diff{\'e}rentes versions du probl{\`e}me~: minimisation ou maximisation, instances m{\'e}triques, distances binaires, etc. {C}ertains de ces algorithmes mettent en oeuvre des mod{\`e}les g{\'e}n{\'e}raux de r{\'e}solution tels que la strat{\'e}gie par s{\'e}paration et {\'e}valuation, la programmation dynamique ou la recherche locale. {C}ertains encore utilisent des heuristiques, qui ne sont autres que des id{\'e}es de bon sens quant {\`a} la constitution d'une solution pour le probl{\`e}me {\'e}tudi{\'e}~: nous pensons par exemple aux heuristiques du regret et du plus proche voisin. {D}'autres enfin, exploitant la relative facilit{\'e} de sous-probl{\`e}mes du {TSP}, partent d'une solution de ces sous-probl{\`e}mes et construisent {\`a} partir de celle-ci un cycle hamiltonien~; c'est le parti pris par l'algorithme de {C}hristofides avec l'arbre couvrant, mais de nombreux r{\'e}sultats sont {\'e}galement obtenus par le biais d'un 2-couplage optimal.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'analyse et mod{\'e}lisation de syst{\`e}mes pour l'aide {\`a} la d{\'e}cision - {LAMSADE} - {CNRS} : {UMR}7024 - {U}niversit{\'e} {P}aris {D}auphine - {P}aris {IX} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{O}ptimisation {C}ombinatoire volume 5 probl{\`e}mes paradigmatiques et nouvelles probl{\'e}matiques }, publisher={{H}ermes {S}cience }, pages={51-93 }, editor={{V}angelis {T}h. {P}aschos }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00152332/en/}, } %% hal-00161926, version 1 %% http://hal.archives-ouvertes.fr/hal-00161926/en/ @incollection{NAZARENKO:2007:HAL-00161926:1, title={{B}uilding back-of-the-book indexes}, author={{N}azarenko, {A}deline and {A}{\"i}t {E}l {M}ekki, {T}ouria}, abstract={{T}his paper presents an original natural language processing ({NLP}) approach for building of back-of-the-book indexes. {O}ur indexing system, {I}nd{D}oc, exploits some terminological tools and automatically builds an index draft out of the analysis of the document text. {T}he indexer then has to validate that index draft through a dedicated interface. {T}his approach has been tested on several documents, with promising results. {R}elying on our experience in developing and testing the {I}nd{D}oc indexing system, we aim at assessing the contribution of terminological analysis as well as the level of maturity that computational terminology has reached, in the indexing perspective.}, keywords={{T}erm extraction; terminological relations; indexing, relevance ranking}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{E}tude et de {R}echerche en {I}nformatique d'{A}ngers - {LERIA} - {U}niversit{\'e} d'{A}ngers }, booktitle={{A}pplication-{D}riven {T}erminology {E}ngineering }, publisher={{J}ohn {B}enjamins }, pages={179-201 }, editor={{F}idelia {I}bekwe-{S}an{J}uan, {A}nne {C}ondamines and {M}aria {T}eresa {C}abr{\'e} }, series={{C}urrent {T}opics 2 }, note={{I}.7.1 {I}.7.2 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00161926/en/}, } %% hal-00198268, version 1 %% http://hal.archives-ouvertes.fr/hal-00198268/en/ @incollection{POIBEAU:2007:HAL-00198268:1, title={{T}raitement automatique des langues et {S}yst{\`e}mes de {Q}uestion-{R}{\'e}ponses ({SQR})}, author={{P}oibeau, {T}hierry and {V}ilnat, {A}nne}, abstract={{L}a question {\`a} laquelle nous allons essayer de r{\'e}pondre dans ce chapitre est celle de l’usage des travaux de traitement automatique des langues au sein des syst{\`e}mes de question-r{\'e}ponse. {P}lut{\^o}t que de se limiter {\`a} une approche « utilisatrice » du {TAL}, nous tenterons de montrer comment les syst{\`e}mes de question-r{\'e}ponse fournissent non seulement un cadre d’application {\`a} des techniques existantes mais permettent de se poser {\`a} nouveau (voire autrement) des questions qui avaient {\'e}t{\'e} peu trait{\'e}es dans les d{\'e}cennies r{\'e}centes.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique pour la {M}{\'e}canique et les {S}ciences de l'{I}ng{\'e}nieur - {LIMSI} - {CNRS} : {UPR}3251 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={{L}a recherche d’informations pr{\'e}cises. {T}raitement automatique de la langue, apprentissage et connaissances pour les syst{\`e}mes de question-r{\'e}ponse }, publisher={{H}erm{\`e}s-{L}avoisier }, pages={105-130 }, editor={{B}. {G}rau et {J}.-{P}. {C}hevallet }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00198268/en/}, } %% hal-00174348, version 1 %% http://hal.archives-ouvertes.fr/hal-00174348/en/ @incollection{RAJMAN:2007:HAL-00174348:1, title={{S}yntactic {P}rocessing}, author={{R}ajman, {M}artin and {C}happelier, {J}ean-{C}{\'e}dric and {R}ozenknop, {A}ntoine}, abstract={{E}fficient processing of speech and language is required at all levels in the design of human-computer interfaces. {I}n this perspective, the book provides a global understanding of the required theoretical foundations, as well as practical examples of successful applications, in the area of human-language technology. {T}he authors start from acoustic signal processing to pragmatics, covering all the important aspects of speech and language processing such as phonetics, morphology, syntax, and semantics. {T}hroughout the volume, the reader can easily notice an emerging methodology, a key issue in the rational design of efficient and robust language-based computer applications. {W}hile engineering rigor is guaranteed in all chapters, particular care has been taken in highlighting intuitive aspects of technical details.}, keywords={{S}peech, {S}ignal {M}odelling, {S}ignal {A}nalysis, {S}peech recognition, {S}yntactical analysis, {S}yntax-driven filtering}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}ntelligence {A}rtificielle - {LIA} - {\'E}cole {P}olytechnique {F}{\'e}d{\'e}rale de {L}ausanne - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}peech and {L}anguage {E}ngineering }, publisher={{P}resses {P}olytechniques et {U}niversitaires {R}omandes ({CH})/ {M}arcel {D}ekker ({US}) }, pages={177--204 }, editor={{M}artin {R}ajman, {V}incenzo {P}allota }, series={{ISBN} 978-2-940222-04-9, {US} {ISBN} 978-0-8247-2219-7 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174348/en/}, } %% hal-00167770, version 1 %% http://hal.archives-ouvertes.fr/hal-00167770/en/ @incollection{ZEHRAOUI:2007:HAL-00167770:1, title={{CASEP}2 : syst{\`e}me hybride pour le traitement de s{\'e}quences de navigation sur le web}, author={{Z}ehraoui, {F}arida and {K}anawati, {R}ushed and {S}alotti, {S}ylvie}, keywords={{R}aisonnement {\`a} partir de cas ; r{\'e}seaux connexionnistes, syst{\`e}mes hybrides}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{R}aisonnement {\`a} partir de cas 2 }, publisher={{H}erm{\`e}s }, pages={151-176 }, editor={{J}ean {R}enaud, {B}rigitte {C}hebel, {B}{\'e}atrice {F}uchs, {J}ean {L}ieber }, series={{T}rait{\'e} {IC}2 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00167770/en/}, } %% hal-00153280, version 1 %% http://hal.archives-ouvertes.fr/hal-00153280/en/ @incollection{ALFANDARI:2006:HAL-00153280:1, title={{O}ptimisation de la construction de rotations d'{\'e}quipage en transport a{\'e}rien}, author={{A}lfandari, {L}aurent and {N}agih, {A}nass}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{O}ptimisation combinatoire {T}ome 3 }, publisher={{H}erm{\`e}s {L}avoisier }, pages={- }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153280/en/}, } %% hal-00084650, version 1 %% http://hal.archives-ouvertes.fr/hal-00084650/en/ @incollection{BENNANI:2006:HAL-00084650:1, title={{O}utils de simulation des syst{\`e}mes connexionnistes}, author={{B}ennani, {Y}oun{\`e}s}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}pprentissage connexionniste }, publisher={{H}erm{\`e}s }, pages={343-358 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084650/en/}, } %% hal-00084649, version 1 %% http://hal.archives-ouvertes.fr/hal-00084649/en/ @incollection{BENNANI:2006:HAL-00084649:1, title={{R}{\'e}seaux {\`a} dictionnaires : {L}earning {V}ector {Q}uantization}, author={{B}ennani, {Y}oun{\`e}s}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}pprentissage connexionniste }, publisher={{H}erm{\`e}s }, pages={123-140 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084649/en/}, } %% hal-00084648, version 1 %% http://hal.archives-ouvertes.fr/hal-00084648/en/ @incollection{BENNANI:2006:HAL-00084648:1, title={{S}{\'e}parateurs connexionnistes lin{\'e}aires}, author={{B}ennani, {Y}oun{\`e}s}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}pprentissage connexionniste }, publisher={{H}erm{\`e}s }, pages={21-46 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084648/en/}, } %% hal-00084640, version 1 %% http://hal.archives-ouvertes.fr/hal-00084640/en/ @incollection{BENNANI:2006:HAL-00084640:1, title={{R}{\'e}seaux de neurones artificiels}, author={{B}ennani, {Y}oun{\`e}s}, abstract={{L}'apprentissage connexionniste est une discipline scientifique qui recouvre plusieurs aspects d'{\'e}tudes math{\'e}matiques, statistiques et algorithmiques. {L}es syst{\`e}mes d'apprentissage connexionnistes (ou r{\'e}seaux de neurones artificiels) sont des syst{\`e}mes num{\'e}riques permettant la mod{\'e}lisation de processus g{\'e}n{\'e}raux par l'{\'e}tablissement de mod{\`e}les fonctionnels. {C}eux-ci sont identifi{\'e}s {\`a} partir des entr{\'e}es-sorties du processus par des algorithmes dits "d'apprentissage" qui s'apparentent {\`a} des techniques d'estimation statistiques. {N}{\'e}s en informatique dans le domaine de l'intelligence artificielle, ils ont connu depuis le d{\'e}but des ann{\'e}es 80 un d{\'e}veloppement intensif d{\^u} au succ{\`e}s rencontr{\'e} dans une tr{\`e}s large gamme d'applications. {L}es r{\'e}seaux connexionnistes offrent une panoplie de techniques adaptatives pour de nombreux probl{\`e}mes g{\'e}n{\'e}riques : la classification, le classement, la mod{\'e}lisation, la pr{\'e}vision. {P}armi les domaines o{\`u} ils ont {\'e}t{\'e} utilis{\'e}s, on peut citer le traitement du signal, de l'image, de la parole, le contr{\^o}le, la pr{\'e}vision, l'optimisation combinatoire, le diagnostic, la fouille de donn{\'e}es, ... {I}l s'agit donc d'un outil g{\'e}n{\'e}ral pouvant {\^e}tre utilis{\'e} dans des cadres diff{\'e}rents avec une grande souplesse. {L}es mod{\`e}les connexionnistes apparaissent comme une alternative ou plus souvent comme un compl{\'e}ment aux techniques classiques. {L}es recherches dans le domaine sont extr{\^e}mement actives actuellement. {P}lusieurs laboratoires tant industriels qu'universitaires participent {\`a} cette recherche en {E}urope, aux {\'E}tats-{U}nis et au {J}apon. {D}iff{\'e}rentes voies ont d{\'e}j{\`a} {\'e}t{\'e} explor{\'e}es et les r{\'e}seaux connexionnistes sont devenus un outil incorpor{\'e} dans diff{\'e}rents logiciels commercialis{\'e}s pour les statistiques, la fouille de donn{\'e}es, le traitement du signal et l'identification de syst{\`e}mes.}, keywords={{A}pprentissage {\`a} partir d'exemples, apprentissage supervis{\'e}, apprentissage non supervis{\'e}, auto-organisation, r{\'e}seaux de neurones artificiels, connexionnisme, classification, classement, discrimination, mod{\'e}lisation, pr{\'e}vision.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{E}ncyclop{\'e}die de l'informatique et syst{\`e}mes d'information. {S}ection {I}ntelligence {A}rtificielle, (sous la direction de {J}. {A}koka et {I}. {W}attiau), {ISBN}: 978-2-7117-4846-4. }, publisher={{V}uibert }, pages={981-999 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084640/en/}, } %% hal-00153747, version 1 %% http://hal.archives-ouvertes.fr/hal-00153747/en/ @incollection{CHOPPY:2006:HAL-00153747:1, title={{D}{\'e}marches de sp{\'e}cification}, author={{C}hoppy, {C}hristine and {P}etrucci, {L}aure}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{M}{\'e}thodes formelles pour les syst{\`e}mes r{\'e}partis et coop{\'e}ratifs }, publisher={{H}erm{\`e}s }, pages={27-49 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153747/en/}, } %% hal-00198093, version 1 %% http://hal.archives-ouvertes.fr/hal-00198093/en/ @incollection{GHNEMAT:2006:HAL-00198093:1, title={{A}utomata-based {A}daptive {B}ehavior for {E}conomical {M}odelling {U}sing {G}ame {T}heory}, author={{G}hnemat, {R}awan and {O}qeili, {S}aleh and {B}ertelle, {C}yrille and {D}uchamp, {G}{\'e}rard}, abstract={{I}n this chapter, we deal with some specific domains of applications to game theory. {T}his is one of the major class of models in the new approaches of modelling in the economic domain. {F}or that, we use genetic automata which allow to build adaptive strategies for the players. {W}e explain how the automata-based formalism proposed - matrix representation of automata with multiplicities - allows to define semi-distance between the strategy behaviors. {W}ith that tools, we are able to generate an automatic processus to compute emergent systems of entities whose behaviors are represented by these genetic automata.}, keywords={adaptive behavior; game theory; genetic automata; prisoner dilemma; emergent systems computing}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique, de {T}raitement de l'{I}nformation et des {S}yst{\`e}mes - {LITIS} - {U}niversit{\'e} du {H}avre - {U}niversit{\'e} de {R}ouen - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ouen - {I}nformation {T}echnology - {IT} - {A}l-{B}alqa'{A}pplied {U}niversity - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{E}mergent {P}roperties in {N}atural and {A}rtificial {D}ynamical {S}ystems }, publisher={{S}pringer }, pages={171-183 }, editor={{M}oulay {A}. {A}ziz-{A}laoui et {C}yrille {B}ertelle }, series={{S}pringer {C}omplexity: {U}nderstanding {C}omplex {S}ystems series }, ARXIVID={0712.2644 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00198093/en/}, } %% hal-00097092, version 1 %% http://hal.archives-ouvertes.fr/hal-00097092/en/ @incollection{NAZARENKO:2006:HAL-00097092:1, title={{L}e point sur l'{\'e}tat actuel des connaissances en traitement automatique des langues}, author={{N}azarenko, {A}deline}, abstract={{C}e chapitre montre comment le domaine du {T}raitement {A}utomatique des {L}angues en a oscill{\'e} entre deux pr{\'e}occupations, {\`a} la fois th{\'e}orique (formalisation des connaissances linguistiques) et applicative (d{\'e}veloppements technologiques de l'ing{\'e}nierie des langues). {A}pr{\`e}s avoir pr{\'e}sent{\'e} les r{\'e}sultats fondamentaux du {TAL} organis{\'e}s en niveau traditionnels d'analyse linguistique, le chapitre pr{\'e}sente le tournant des ann{\'e}es 1990 et les bouleversements la lexicalisation des traitements et {\`a} l'{\'e}mergence des corpus. {L}a conclusion pr{\'e}sente le {TAL} tel qu'il se pr{\'e}sente aujourd'hui, avec le poids des applications et les progr{\`e}s technologiques accomplis, puis souligne que l'{\'e}volution future du {TAL} n{\'e}cessitera une synth{\`e}se et une collaboration efficace de toutes les approches {\'e}voqu{\'e}es.}, keywords={{T}raitement automatique des langues}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{C}ompr{\'e}hension des langues et interaction }, publisher={{H}ermes science publications : {L}avoisier }, pages={31-70 }, editor={{G}{\'e}rard {S}abah }, note={38 pages 1.7.0 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00097092/en/}, } %% hal-00087010, version 1 %% http://hal.archives-ouvertes.fr/hal-00087010/en/ @incollection{PISANTI:2006:HAL-00087010:1, title={{I}mplicit and {E}xplicit {R}epresentation of {A}pproximated {M}otifs}, author={{P}isanti, {N}adia and {S}oldano, {H}enry and {C}arpentier, {M}athilde and {P}othier, {J}o{\"e}l}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {D}epartment of {C}omputer {S}cience, {U}niversity of {P}isa. - {UNIVERSIT}{\`A} {DEGLI} {STUDI} {DI} {PISA} - {A}telier de {B}io{I}nformatique - {ABI} - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, booktitle={{A}lgorithms in {B}ioinformatics }, publisher={{C}ollege {P}ress }, pages={1-15 }, editor={{C}. {S}. {I}liopoulos and {K}. {P}ark and {K}. {S}teinhoefel }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00087010/en/}, } %% hal-00247411, version 1 %% http://hal.archives-ouvertes.fr/hal-00247411/en/ @incollection{SZULMAN:2006:HAL-00247411:1, title={{T}erminae {M}ethod and {I}ntegration {P}rocess for {L}egal {O}ntology {B}uilding}}, author={{S}zulman, {S}ylvie and {D}espr{\'e}s, {S}ylvie}, abstract={{T}his paper describes the contruction method of a legal application ontology. {T}his method is based on the merging of micro-ontologies built from {E}uropean community directives. {T}he \textsc{terminae} construction method from texts enhanced by an alignment process with a core legal ontology is used for building micro-ontologies. {A} merging process allows constructing the legal ontology.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {CRIP}5- {E}quipe {IAA} - {U}niversit{\'e} {P}aris {D}escartes - {P}aris {V} }, booktitle={{L}ecture {N}otes in {C}omputer {S}cience }, publisher={{S}pringer {B}erlin/{H}eidelber }, pages={1014-1023 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00247411/en/}, } %% hal-00085092, version 1 %% http://hal.archives-ouvertes.fr/hal-00085092/en/ @incollection{VIENNET:2006:HAL-00085092:1, title={{R}{\'e}seaux {\`a} fonctions de base radiales}, author={{V}iennet, {E}mmanuel}, abstract={{T}his chapter presents the radial basis functions neural networks 5{RBF}). {T}he approximation problem is posed, and the different approaches for {RBF} learning are described. {S}everal applications of this model are given.}, keywords={{R}adial {B}asis {F}unctions, {RBF}, {R}{\'e}seaux de neurones, approximation de fonction, apprentissage.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}pprentissage connexionniste }, publisher={{L}avoisier }, pages={105 }, editor={{Y}oun{\`e}s {B}ennani }, series={{I}2{C} {H}erm{\`e}s }, note={18 pages }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085092/en/}, } %% hal-00341962, version 1 %% http://hal.archives-ouvertes.fr/hal-00341962/en/ @incollection{ZEHRAOUI:2006:HAL-00341962:1, title={5 : {CASEP}2 : {S}yst{\`e}me hybride pour le traitement de s{\'e}quences de navigation sur le web.}, author={{Z}ehraoui, {F}arida and {K}anawati, {R}ushed and {S}alotti, {S}ylvie}, abstract={{N}ous pr{\'e}sentons dans ce chapitre un syst{\`e}me baptis{\'e} {CASEP}2, qui combine le raisonnement {\`a} partir de cas ({R}{\`a}{PC}) avec des r{\'e}seaux de neurones ({RN}), pour le classement (ou la pr{\'e}diction) {\`a} partir de s{\'e}quences. {D}ans {CASEP}2, un cas est mod{\'e}lis{\'e} par une matrice de covariance dynamique qui prend en compte la distribution des {\'e}tats de la s{\'e}quence dans l'espace ainsi que leur ordre temporel et la base de cas du syst{\`e}me de {R}{\`a}{PC} est partitionn{\'e}e en utilisant un r{\'e}seau de neurones ad{\'e}quat.}, language={{F}ran{\c{c}}ais}, affiliation={{I}nformatique, {B}iologie {I}nt{\'e}grative et {S}yst{\`e}mes {C}omplexes - {IBISC} - {CNRS} : {FRE}3190 - {U}niversit{\'e} d'{E}vry-{V}al d'{E}ssonne - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{R}aisonnement {\`a} partir de cas 2 }, publisher={{H}ermes {L}avoisier }, pages={151--176 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00341962/en/}, } %% hal-00089085, version 1 %% http://hal.archives-ouvertes.fr/hal-00089085/en/ @incollection{BIEBOW:2005:HAL-00089085:1, title={{M}od{\'e}lisation du domaine par une m{\'e}thode fond{\'e}e sur l'analyse de corpus}, author={{B}i{\'e}bow, {B}rigitte and {S}zulman, {S}ylvie and {A}ussenac-{G}illes, {N}athalie}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {I}nstitut de recherche en informatique de {T}oulouse - {IRIT} - {CNRS} : {UMR}5505 - {U}niversit{\'e} des {S}ciences {S}ociales - {T}oulouse {I} - {U}niversit{\'e} {P}aul {S}abatier - {T}oulouse {III} }, booktitle={{I}ng{\'e}nierie des connaissances }, publisher={{L}'{H}amattan }, pages={49-71 }, editor={{R}.{T}eulier; {J}. {C}harlet; {P}. {T}chounikine }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00089085/en/}, } %% hal-00084948, version 1 %% http://hal.archives-ouvertes.fr/hal-00084948/en/ @incollection{GAYRAL:2005:HAL-00084948:1, title={{C}hallenging the {P}rinciple of {C}ompositionality in {I}nterpreting {N}atural {L}anguage {T}exts}, author={{G}ayral, {F}ran{\c{c}}oise and {K}ayser, {D}aniel and {L}{\'e}vy, {F}ran{\c{c}}ois}, abstract={{T}he main assumption of many contemporary semantic theories, from {M}ontague grammars to the most recent papers in journals of linguistics semantics, is and remains the principle of compositionality. {I}t is also adopted by more computation-oriented traditions ({A}rtificial {I}ntelligence or {N}atural {L}anguage {P}rocessing - henceforth, {NLP}). {A}lthough its adequacy to ”real” language clearly raises several difficulties, it is almost never challenged and the presuppositions on which it relies are seldom questioned. {R}ather than proposing some more arrangements to overcome some of its drawbacks, our point, in this paper, will actually consist in a more radical critique which addresses first the very notion of meaning. {F}or us, a semantic theory should not focus on finding ”the meaning of a complex expression” but rather on drawing adequate inferences. {T}his shift of focus allows us to present an approach which fulfills the tasks that the notion of meaning is supposed to carry out, without an explicit (and compositional) construction of the meaning of parts and wholes.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={the compositionality of meaning and content, vol {II}, }, publisher={ontos verlag }, pages={83--105 }, editor={{E}. {M}achery, {M}. {W}erning, {G}. {S}churz, eds. }, series={applications to {L}inguistics, {P}sychology and neuroscience }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00084948/en/}, } %% hal-00098028, version 1 %% http://hal.archives-ouvertes.fr/hal-00098028/en/ @incollection{NAZARENKO:2005:HAL-00098028:1, title={{S}ur quelle s{\'e}mantique reposent les m{\'e}thodes automatiques d'acc{\`e}s au contenu textuel ?}, author={{N}azarenko, {A}deline}, abstract={{B}eyond information retrieval, which aims at searching relevant documents in a document base, new tools for accessing document content have emerged during the last decade. {T}hese tools rely on various methods, ranging from mere text highlighting and robust text mining to information extraction and question-answering. {T}his paper analysis the nature of the semantics underlying these tools and argues that it is both referential and textual.}, keywords={{A}nalyse s{\'e}mantique ; recherche d'information ; extraction d'information ; syst{\`e}mes de question-r{\'e}ponse ; navigation documentaire ;}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{S}{\'e}mantique et corpus }, publisher={{L}avoisier }, pages={211-244 }, editor={{A}nne {C}ondamines }, series={{T}rait{\'e} {IC}2, s{\'e}rie {C}ognition et traitement de l'information }, note={32 pages {H}.3.1 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00098028/en/}, } %% hal-00097093, version 1 %% http://hal.archives-ouvertes.fr/hal-00097093/en/ @incollection{NEDELLEC:2005:HAL-00097093:1, title={{O}ntology and {I}nformation {E}xtraction: a necessary symbiosis}, author={{N}{\'e}dellec, {C}laire and {N}azarenko, {A}deline}, abstract={{T}his paper argues that the symbiosis between information extraction ({IE}) and ontologies is a necessary one. {O}n the one hand, {IE} needs ontologies as part of the understanding process for extracting the relevant information. {O}ne the other hand, ontologies can only be effectively and efficiently populated if one resorts to {IE} techniques. {IE} and ontology learning and population ({OLP}) can bearranged in a cyclic process in which {IE}, as an ontology-driven process, also helps to extend the ontology. {I}n turn, the ontology enriched in this way can be used in the next {IE} iteration. {T}his paper is illustrated by examples taken in the biology domain, a domain in which there are critical needs for content-based exploration of the scientific literature. {I}t takes the example of the {E}xtra{P}lo{D}ocs project, which aims at extracting gene-protein interaction information from the bibliography in genomics.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} }, booktitle={{O}ntology {D}esign and {P}opulation }, publisher={{IOS} {P}ress }, pages={155-170 }, editor={{P}aul {B}uitelaar, {P}hilipp {C}imiano, {B}ernardo {M}agnini }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00097093/en/}, } %% hal-00105680, version 1 %% http://hal.archives-ouvertes.fr/hal-00105680/en/ @incollection{POIBEAU:2005:HAL-00105680:1, title={{U}na metodologica per l'annotazione e l'estrazione d'informazione}, author={{P}oibeau, {T}hierry}, keywords={{T}ext mining; {T}raitement automatique des {L}angues; web s{\'e}mantique}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{K}nowledge {M}ining: {U}no strumento strategico per imprese e insitutioni }, publisher={{ASU} }, pages={37-45 }, editor={{S}. {B}olasco, {A}. {C}anzonetti et {F}.{M}. {C}apo }, note={{ISBN} 88-7975-341-{X} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00105680/en/}, } %% hal-00005507, version 1 %% http://hal.archives-ouvertes.fr/hal-00005507/en/ @incollection{POIBEAU:2005:HAL-00005507:1, title={{C}ontent annotation for the semantic web}, author={{P}oibeau, {T}hierry}, abstract={{T}his paper was presented during the 3rd {I}nternational {W}orkshop on {T}ext {M}ining and its {A}pplications held in {A}thens, {G}reece. {T}his workshop is the final event of the activities of a network of excellence in the area of text mining and its applications. {K}nowledge {M}ining includes contributions in the areas of: {D}ocument processing, visualization techniques, {W}eb mining, and knowledge management.}, keywords={{D}ocument processing; visualization techniques; {W}eb mining; knowledge management}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{K}nowledge {M}ining }, publisher={{S}pringer {V}erlag }, pages={250-262 }, editor={{S}piros {S}irmakessis }, note={{ISBN} 3-540-25070-0 {N}emis {N}etwork of {E}xcellence }, collaboration={{N}emis {N}etwork of {E}xcellence }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00005507/en/}, } %% hal-00153283, version 1 %% http://hal.archives-ouvertes.fr/hal-00153283/en/ @incollection{ALFANDARI:2004:HAL-00153283:1, title={{A} path-relinking algorithm for the {G}eneralized {A}ssignment {P}roblem}, author={{A}lfandari, {L}aurent and {P}lateau, {A}gn{\`e}s and {T}olla, {P}ierre}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{M}etaheuristics {C}omputer {D}ecision-{M}aking }, publisher={{K}luwer {A}cademic {P}ublisher }, pages={- }, editor={{MJP} resende, {JP} {D}e {S}ousa }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00153283/en/}, } %% hal-00085173, version 1 %% http://hal.archives-ouvertes.fr/hal-00085173/en/ @incollection{NAZARENKO:2004:HAL-00085173:1, title={{L}'{\'e}valuation des syst{\`e}mes d'analyse et de compr{\'e}hension de textes}, author={{N}azarenko, {A}deline and {P}oibeau, {T}hierry}, abstract={{C}et article dresse un panorama des m{\'e}thodes d'{\'e}valuation des syst{\`e}mes d'analyse et de compr{\'e}hension de textes. {L}es campagnes d'{\'e}valuation francophones et anglo-saxonnes sont pr{\'e}sent{\'e}es. {C}ette contribution ets aussi l'occasion d'une r{\'e}flexion plus g{\'e}n{\'e}rale sur la notion de compr{\'e}hension et la faisabilit{\'e} des approches automatiques.}, keywords={compr{\'e}hension de textes; extraction d'information; {\'e}valuation; traitement des langues}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{L}'{\'e}valuation des syst{\`e}mes de traitement de l'information }, publisher={{H}ermes }, pages={127-148 }, editor={{S}t{\'e}phane {C}haudiron }, note={{ISBN} 2-7462-0862-8 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085173/en/}, } %% hal-00082482, version 1 %% http://hal.archives-ouvertes.fr/hal-00082482/en/ @incollection{BANDERIER:2003:HAL-00082482:1, title={{D}igital sums and divide-and-conquer recurrences: {F}ourier expansions and absolute convergence, lecture notes on a talk by {H}sien {K}uei {H}wang}, author={{B}anderier, {C}yril}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{A}lgorithms {S}eminar {L}ecture {N}otes 2002-2003 }, publisher={{INRIA} }, pages={1 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00082482/en/}, } %% hal-00009167, version 1 %% http://hal.archives-ouvertes.fr/hal-00009167/en/ @incollection{HAMON:2002:HAL-00009167:1, title={{D}ictionary-based detection of term semantic variation}, author={{H}amon, {T}hierry and {N}azarenko, {A}deline}, keywords={{T}erminology, synonymy relation, dictionnary, {NLP}}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{E}xploring the {L}exicon }, publisher={{E}ditore {D}ell'{O}rso }, pages={151-177 }, editor={{A}lessandro {L}enci and {V}ittorio {D}i {T}omaso }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00009167/en/}, } %% hal-00088702, version 1 %% http://hal.archives-ouvertes.fr/hal-00088702/en/ @incollection{BLACHE:2001:HAL-00088702:1, title={{\'E}valuer des syst{\`e}mes de compr{\'e}hension de textes}, author={{B}lache, {P}hilippe and {G}uizol, {J}acques and {L}{\'e}vy, {F}ran{\c{c}}ois and {N}azarenko, {A}deline and {N}'{G}uema, {S}imon and {R}olbert, {M}onique and {P}asero, {R}obert and {S}abatier, {P}aul}, abstract={{A}n inventory of criteria is done, and these criteria are examined, in order to evaluate and compare different {T}ext {U}nderstanding systems.}, keywords={{I}ng{\'e}nierie de la langue; compr{\'e}hension de textes ; {\'e}valuation}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire {P}arole et {L}angage - {LPL} - {CNRS} : {UMR}6057 - {U}niversit{\'e} de {P}rovence - {A}ix-{M}arseille {I} - {L}aboratoire d'informatique {F}ondamentale de {M}arseille - {LIF} - {CNRS} : {UMR}6166 - {U}niversit{\'e} de la {M}{\'e}diterran{\'e}e - {A}ix-{M}arseille {II} - {U}niversit{\'e} de {P}rovence - {A}ix-{M}arseille {I} }, booktitle={{R}essources et {\'e}valuation en ing{\'e}nierie de la langue }, publisher={{D}uculot }, pages={265-275 }, editor={{C}hibout \& al. ed }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00088702/en/}, } %% hal-00009162, version 1 %% http://hal.archives-ouvertes.fr/hal-00009162/en/ @incollection{HAMON:2001:HAL-00009162:1, title={{D}etection of synonymy links between terms: experiment and results}, author={{H}amon, {T}hierry and {N}azarenko, {A}deline}, keywords={{T}erminology, synonymy relation, copora, {N}atural {L}anguage {P}rocessing}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{R}ecent {A}dvances in {C}omputational {T}erminology }, publisher={{J}ohn {B}enjamins }, pages={185-208 }, editor={{D}idier {B}ourigault, {C}hristian {J}acquemin and {M}arie-{C}laude {L}'{H}omme }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00009162/en/}, } %% edutice-00000631, version 1 %% http://edutice.archives-ouvertes.fr/edutice-00000631/en/ @incollection{CHANIER:1997:EDUTICE-00000631:1, title={{ALEXIA} : {U}n environnement d'aide {\`a} l'apprentissage lexical du fran{\c{c}}aislangue seconde}, author={{C}hanier, {T}hierry and {I}ssac, {F}abrice and {F}ouquer{\'e}, {C}hristophe}, abstract={{L}'acquisition lexicale, et plus pr{\'e}cis{\'e}ment l'acquisition des expressions lexicales, occupe ne place importante en apprentissage de langue seconde. {N}ous pr{\'e}sentons, dans cet article, un syst{\`e}me d'apprentissage appel{\'e} {ALEXIA}. {C}elui-ci propose une aide lexicale personnalis{\'e}e en production et en compr{\'e}hension. {I}l consid{\`e}re {\`a} la fois les strat{\'e}gies d'acc{\`e}s lexicaux couramment employ{\'e}es pour mod{\'e}liser la base de donn{\'e}es lexicales, et celles employ{\'e}es par l'utilisateur. {L}e syst{\`e}me propose {\'e}galement des activit{\'e}s lexicales pour l'aide {\`a} la r{\'e}tention bas{\'e}es sur le lexique {\'e}tudi{\'e} par l'apprenant lors de ses travaux de compr{\'e}hension ou/et de production. {E}n ce qui concerne notre base de donn{\'e}es lexicales, de nombreuses informations linguistiques sont disponibles. {D}e plus, une aide {\`a} la correction des erreurs lexicales en production est accessible qui permet {\`a} la fois d'indiquer qu'un mot est mal employ{\'e}, et de proposer expressions ou collocations mieux adapt{\'e}es {\`a} ce qui est suppos{\'e} {\^e}tre produit.}, language={{F}ran{\c{c}}ais}, affiliation={{U}niversit{\'e} de {F}ranche-{C}omt{\'e} _ {L}aboratoire d'{I}nformatique de {F}ranche-{C}omt{\'e} - {UNIVERSIT}{\'E} {DE} {FRANCHE}-{COMT}{\'E} _ {LIFC} - {A}ucune - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, booktitle={{L}a locution : entre syntaxe et pragmatique }, publisher={{INALF}-{K}lincksieck }, pages={105-118 }, editor={{F}iala {P}., {L}afon {P}., {P}iguet {M}-{P}. }, note={{C}et ouvrage a {\'e}t{\'e} publi{\'e} dans le cadre de la collection {S}aint {C}loud.{C}e texte a {\'e}r{\'e} aussi publi{\'e} dans les actes du colloque {E}nvironnements {I}nteractifs d'{A}pprentissage avec {O}rdinateur (1995), pp 79-90, {E}yrolles, {P}aris. }, month={11}, year={1997}, URL={http://edutice.archives-ouvertes.fr/edutice-00000631/en/}, } %% hal-00347007, version 1 %% http://hal.archives-ouvertes.fr/hal-00347007/en/ @book{POIBEAU:2008:HAL-00347007:1, title={{E}xtraction d’information : l’apport de la linguistique}, author={{P}oibeau, {T}hierry and {C}ondamines, {A}nne}, abstract={linguistique et recherche d'information. {A}u-del{\`a} de la recherche d'information au sens strict (recherche de documents pertinents par rapport {\`a} des mots-cl{\'e}s), nous souhaitons {\'e}largir la probl{\'e}matique {\`a} des domaines de recherche connexes : - {L}'extraction d'information, - {L}es syst{\`e}mes de question/r{\'e}ponse, - {L}e r{\'e}sum{\'e} automatique, - {L}a cat{\'e}gorisation de textes. {L}a dimension langagi{\`e}re est pr{\'e}sente dans toutes ces applications : la plupart exigent une analyse du contenu (on parle aujourd'hui de moteur de recherche « s{\'e}mantique ») et ne peuvent se contenter de voir le document comme un simple « sac de mots ». {L}a linguistique devrait donc jouer un r{\^o}le important dans ces disciplines. {O}r, ce n'est pas toujours le cas. {C}e num{\'e}ro de la {R}evue {F}ran{\c{c}}aise de {L}inguistique {A}ppliqu{\'e}e examine les raisons de cet {\'e}tat de fait.}, keywords={{I}nformatique; {L}inguistique; {E}pist{\'e}mologie; {E}xtraction d’information; {S}yst{\`e}mes de question/r{\'e}ponse; {R}{\'e}sum{\'e} automatique; {C}at{\'e}gorisation de textes}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {E}quipe de {R}echerche en {S}yntaxe et {S}{\'e}mantique - {ERSS} - {CNRS} : {UMR}5263 }, publisher={{R}evue {F}ren{\c{c}}aise de {L}inguistique {A}ppliqu{\'e}e }, pages={120 }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00347007/en/}, } %% hal-00198269, version 1 %% http://hal.archives-ouvertes.fr/hal-00198269/en/ @book{POIBEAU:2007:HAL-00198269:1, title={{P}roceedings of the {M}ulti-source, {M}ultilingual {I}nformation {E}xtraction and {S}ummarization}, author={{P}oibeau, {T}hierry and {S}aggion, {H}oracio}, abstract={{T}he objective of this {M}ulti-source {M}ultilingual {I}nformation {E}xtraction and {S}ummarization ({MMIES}) workshop is to bring together researchers and practitioners in information access technologies to discuss recent approaches to deal with multi-source and multi-lingual challenges.}, keywords={{M}ulti-document summarization; {M}ulti-source {I}nformation {E}xtraction; {M}ultilingual {I}nformation {E}xtraction; {I}nformation {E}xtraction; {S}ummarization}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{R}ecent {A}dvances in {N}atural {L}anguage {P}rocessing }, pages={50 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00198269/en/}, } %% hal-00153111, version 1 %% http://hal.archives-ouvertes.fr/hal-00153111/en/ @book{BUTELLE:2000:HAL-00153111:1, title={{P}rocedings of the 4th {I}nternational {C}onference on {P}rinciples of {D}istributed {S}ystems, {OPODIS} 2000}, author={{B}utelle, {F}ranck}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, publisher={{S}uger, {S}aint-{D}enis, rue {C}atulienne, {F}rance }, pages={282 }, note={{ISBN} 2-912590-11-6 }, year={2000}, URL={http://hal.archives-ouvertes.fr/hal-00153111/en/}, } %% tel-00274627, version 1 %% http://tel.archives-ouvertes.fr/tel-00274627/en/ @phdthesis{ASEERVATHAM:2007:TEL-00274627:1, title={{A}pprentissage {\`a} base de {N}oyaux {S}{\'e}mantiques pour le {T}raitement de {D}onn{\'e}es {T}extuelles}, author={{A}seervatham, {S}ujeevan}, abstract={{D}epuis le d{\'e}but des ann{\'e}es 80, les m{\'e}thodes statistiques et, plus sp{\'e}cifiquement, les m{\'e}thodes d'apprentissage appliqu{\'e}es au traitement de donn{\'e}es textuelles connaissent un int{\'e}r{\^e}t grandissant. {C}ette tendance est principalement due au fait que la taille des corpus est en perp{\'e}tuelle croissance. {A}insi, les m{\'e}thodes utilisant le travail d'experts sont devenues des processus co{\^u}teux perdant peu {\`a} peu de leur popularit{\'e} au profit des syst{\`e}mes d'apprentissage.{D}ans le cadre de cette th{\`e}se, nous nous int{\'e}ressons principalement {\`a} deux axes.{L}e premier axe porte sur l'{\'e}tude des probl{\'e}matiques li{\'e}es au traitement de donn{\'e}es textuelles structur{\'e}es par des approches {\`a} base de noyaux. {N}ous pr{\'e}sentons, dans ce contexte, un noyau s{\'e}mantique pour les documents structur{\'e}s en sections notamment sous le format {XML}. {L}e noyau tire ses informations s{\'e}mantiques {\`a} partir d'une source de connaissances externe, {\`a} savoir un th{\'e}saurus. {N}otre noyau a {\'e}t{\'e} test{\'e} sur un corpus de documents m{\'e}dicaux avec le th{\'e}saurus m{\'e}dical {UMLS}. {I}l a {\'e}t{\'e} class{\'e}, lors d'un challenge international de cat{\'e}gorisation de documents m{\'e}dicaux, parmi les 10 m{\'e}thodes les plus performantes sur 44. {L}e second axe porte sur l'{\'e}tude des concepts latents extraits par des m{\'e}thodes statistiques telles que l'analyse s{\'e}mantique latente ({LSA}). {N}ous pr{\'e}sentons, dans une premi{\`e}re partie, des noyaux exploitant des concepts linguistiques provenant d'une source externe et des concepts statistiques issus de la {LSA}. {N}ous montrons qu'un noyau int{\'e}grant les deux types de concepts permet d'am{\'e}liorer les performances. {P}uis, dans un deuxi{\`e}me temps, nous pr{\'e}sentons un noyau utilisant des {LSA} locaux afin d'extraire des concepts latents permettant d'obtenir une repr{\'e}sentation plus fine des documents.}, keywords={{A}pprentissage; {N}oyaux; {S}{\'e}parateurs {\`a} {V}aste {M}arge; {C}at{\'e}gorisation de texte; {M}esure de {S}imilarit{\'e} {S}{\'e}mantique}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, school={{U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII}; {I}nstitut {G}alilee}, day={12}, month={12}, year={2007}, URL={http://tel.archives-ouvertes.fr/tel-00274627/en/}, } %% tel-00299935, version 1 %% http://tel.archives-ouvertes.fr/tel-00299935/en/ @phdthesis{KAROUI:2007:TEL-00299935:1, title={{S}yst{\`e}me coop{\'e}ratif de type {\'e}gal-{\`a}-{\'e}gal pour la recommandation : {A}pplication {\`a} la gestion et la recommandation de r{\'e}f{\'e}rences bibliographiques.}, author={{K}aroui, {H}ajer}, abstract={{N}ous explorons la r{\'e}utilisation et le partage automatique des exp{\'e}riences pass{\'e}es des utilisateurs dans des t{\^a}ches de {RI}. {L}e but est de proposer des recommandations pertinentes {\`a} l'utilisateur selon ses int{\'e}r{\^e}ts. {N}ous utilisons le raisonnement {\`a} partir de cas ({R}{\`a}{PC}) comme une m{\'e}thodologie d'apprentissage et de mod{\'e}lisation de l'exp{\'e}rience des utilisateurs et, l'architecture {P}2{P} afin de pr{\'e}server l'autonomie des utilisateurs. {P}our illustrer notre approche, nous avons d{\'e}velopp{\'e} une application pilote {COBRAS} pour la gestion et la recommandation de r{\'e}f{\'e}rences bibliographiques. {D}eux probl{\'e}matiques se pr{\'e}sentent : comment obtenir les r{\'e}f{\'e}rences pertinentes et comment choisir des agents avec qui collaborer ? {P}our r{\'e}soudre ces probl{\`e}mes, nous nous sommes bas{\'e}s sur l'exploitation des historiques des interactions entre les agents.{L}e {R}{\`a}{PC} est utilis{\'e}e pour deux finalit{\'e}s : a)d{\'e}terminer pour une requ{\^e}te, des agents int{\'e}ressants {\`a} interroger ;b)chercher pour une requ{\^e}te, des r{\'e}f{\'e}rences pertinentes.}, keywords={{S}yst{\`e}me de recommandation, {F}ormation de comit{\'e}s, {R}aisonnement {\`a} partir de cas, {P}artage automatique d'exp{\'e}riences, {C}oop{\'e}ration d'agents, {S}yst{\`e}me d'{\'e}gal-{\`a}-{\'e}gal}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, school={{U}niversit{\'e} {P}aris 13}, day={11}, month={12}, year={2007}, URL={http://tel.archives-ouvertes.fr/tel-00299935/en/}, } %% tel-00125259, version 1 %% http://tel.archives-ouvertes.fr/tel-00125259/en/ @phdthesis{PAUCHET:2006:TEL-00125259:1, title={{M}od{\'e}lisation cognitive d'interactions humainesdans un cadre de planification multi-agents}, author={{P}auchet, {A}lexandre}, abstract={{C}ette th{\`e}se vise {\`a} am{\'e}liorer la conception des syst{\`e}mes multi-agents, par l'{\'e}tude et la mod{\'e}lisation des capacit{\'e}s humaines de planification et d'interaction. {E}lle s'appuie sur une exp{\'e}rimentation psychologique durant laquelle des sujets humains avaient {\`a} r{\'e}soudre un probl{\`e}me de planification en connaissances incompl{\`e}tes.{L}es protocoles collect{\'e}s au cours de cette exp{\'e}rimentation ont {\'e}t{\'e} analys{\'e}s du point de vue de la planification et du point de vue des interactions. {A}insi, un mod{\`e}le de la planification humaine et un mod{\`e}le de l'interaction humaine ont pu {\^e}tre con{\c{c}}us.{C}es deux mod{\`e}les sont int{\'e}gr{\'e}s de fa{\c{c}}on homog{\`e}ne {\`a} une nouvelle architecture d'agent appel{\'e}e {BDIGGY}. {P}armi les mod{\`e}les d'agents existants, le mod{\`e}le {BDI} ({B}elief, {D}esire, {I}ntention) offre un cadre int{\'e}ressant pour la conception d'agents d{\'e}lib{\'e}ratifs capables de planifier etd'interagir selon leurs {\'e}tats mentaux. {A}insi, l'architecture {BDIGGY} est n{\'e}e d'une fusion entre le syst{\`e}me {IGGY} (un syst{\`e}me pr{\'e}-existant de planification humaine) et une architecture {BDI} {\'e}tendue {\`a} la r{\'e}solution coop{\'e}rative de probl{\`e}mes.{L}e mod{\`e}le de l'interaction humaine introduit dans {BDIGGY} est sur deux niveaux :1. il s'appuie sur la th{\'e}orie des actes de langage pour mod{\'e}liser les {\'e}nonc{\'e}s, {\`a} l'aide d'un ensemble de performatives (comme c'est le cas dans les {ACL} classiques) appliqu{\'e}es {\`a} des {\'e}tats mentaux ;2. il utilise un mod{\`e}le du discours, repr{\'e}sent{\'e} par des automates temporis{\'e}s, pour d{\'e}crire la dynamique des conversations humaines, en remplacement des protocoles de communication jug{\'e}s trop rigides.{L}es niveaux de l'{\'e}nonc{\'e} et du discours sont li{\'e}s par une s{\'e}mantique des performatives. {C}ette s{\'e}mantique d{\'e}crit les pr{\'e}-conditions et les post-conditions portant sur les {\'e}tats mentaux des agents, {\`a} la r{\'e}ception et {\`a} l'envoi de messages.{D}ans {BDIGGY}, l'interaction, la planification et les connaissances s'entrelacent gr{\^a}ce auxconcepts {BDI}.{L}'architecture {BDIGGY} est valid{\'e}e en comparant au cours d'un test "{\`a} la {T}uring", les protocoles exp{\'e}rimentaux provenant de l'exp{\'e}rimentation psychologique et les protocoles g{\'e}n{\'e}r{\'e}s par des agents {BDIGGY}, durant une simulation de la r{\'e}solution du probl{\`e}me.}, keywords={{S}yst{\`e}mes multi-agents, agents {BDI}, architecture d'agent, th{\'e}orie des actes de langage, s{\'e}mantique des performatives, automates temporis{\'e}s, mod{\'e}lisation cognitive, interaction humaine, planification humaine, r{\'e}solution coop{\'e}rative de probl{\`e}mes.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, school={{I}nstitut {G}alilee}, day={22}, month={09}, year={2006}, URL={http://tel.archives-ouvertes.fr/tel-00125259/en/}, } %% tel-00082605, version 1 %% http://tel.archives-ouvertes.fr/tel-00082605/en/ @phdthesis{BUTELLE:1994:TEL-00082605:1, title={{C}ontribution {\`a} l'algorithmique distribu{\'e}e de contr{\^o}le : arbres couvrants avec et sans containtes}, author={{B}utelle, {F}ranck}, abstract={{N}ous pr{\'e}sentons dans cette th{\`e}se une {\'e}tude sur desalgorithmes distribu{\'e}s asynchrones et d{\'e}terministes decontr{\"o}le. {U}n syst{\`e}me distribu{\'e} consiste en un r{\'e}seaude sites (processeurs, ordinateurs ou r{\'e}seaux locaux). {D}ans cetteth{\`e}se, nous ne consid{\'e}rons que des r{\'e}seaux de sitescommunicants n'ayant ni m{\'e}moire partag{\'e}e ni horloge globale.{D}e nombreux probl{\`e}mes de l'algorithmique distribu{\'e}e sontr{\'e}ductibles {\`a} la construction d'un {A}rbre {C}ouvrant qui est lastructure de contr{\^o}le qui nous int{\'e}resse.{N}ous {\'e}tudions deux types d'algorithmes~: ceux utilisantla notion de phase logique et les autres qui ne consid{\`e}rent aucunm{\'e}canisme de synchronisation. {C}es derniers ont des comportementsimpr{\'e}visibles am{\'e}liorant la tol{\'e}rance aux fautes. {N}ouspr{\'e}sentons un nouvel algorithme de ce type associ{\'e} {\`a} une{\'e}lection qui n'est pas une recherche d'extremum contrairement{\`a} l'usage. {C}et algorithme est comparable au meilleuralgorithme connu qui utilise des jetons et des phases logiquesinduisant un comportement plus "s{\'e}quentiel".{D}'autres algorithmes, construisant des {AC} contraints, sontconsid{\'e}r{\'e}s. {E}n particulier l'{AC} de {D}iam{\`e}tre {M}inimum quiest, {\`a} notre connaissance, un probl{\`e}me qui n'a jamais{\'e}t{\'e} {\'e}tudi{\'e} dans ce domaine. {L}e diam{\`e}tre d'ungraphe est la somme des poids des ar{\^e}tes du plus long des pluscourts chemins. {S}i nous consid{\'e}rons la complexit{\'e} temporelle,cette contrainte est d'un int{\'e}r{\^e}t \&vident. {N}ous proposonsdiff{\'e}rents algorithmes suivant que la tol{\'e}rance aux fautes estn{\'e}cessaire ou non.{F}inalement, l'{\'e}tude pratique des algorithmes distribu{\'e}s surdes r{\'e}seaux de grande taille nous a conduit {\`a} la constructiond'un simulateur. {I}l permet l'ex{\'e}cution d'un m{\^e}me code sourcesur des machines s{\'e}quentielles ou parall{\`e}les.}, keywords={{O}rdinateurs, r{\'e}seaux d'; {A}lgorithmes; {A}rbres; th{\'e}orie des graphes; traitement r{\'e}parti; algorithme distribu{\'e}}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, school={{U}niversit{\'e} {P}aris {VIII} {V}incennes-{S}aint {D}enis}, day={01}, month={03}, year={1994}, URL={http://tel.archives-ouvertes.fr/tel-00082605/en/}, } %% tel-00180374, version 1 %% http://tel.archives-ouvertes.fr/tel-00180374/en/ @phdthesis{CHANIER:1989:TEL-00180374:1, title={{C}ompr{\'e}hension de {T}extes dans un domaine technique :le syst{\`e}me {ACTES}.{A}pplication des {G}rammaires d'{U}nification et de la {T}h{\'e}orie du {D}iscours}, author={{C}hanier, {T}hierry}, abstract={{L}e traitement automatique de textes de sp{\'e}cifications {\'e}crits en langage naturel pose au moins deux probl{\`e}mes : disposer d'outils g{\'e}n{\'e}raux permettant de reconna{\^i}tre les constituants de ces textes ; trouver une repr{\'e}sentation de leur contenu permettant {\`a} l'utilisateur de les modifier et de v{\'e}rifier leur coh{\'e}rence. {L}es textes analys{\'e}s ici sp{\'e}cifient les logiques d'alarmes d'un avion. {O}n veut en extraire des r{\`e}gles pour un syst{\`e}me expert simulant le comportement des processeurs embarqu{\'e}s, charg{\'e}s de g{\'e}rer ces alarmes. {L}e syst{\`e}me {ACTES} offre, d'une part, un formalisme permettant de d{\'e}finir des grammaires et de construire une repr{\'e}sentation s{\'e}mantique interm{\'e}diaire des textes, et, d'autre part, un environnement de d{\'e}veloppement de grammaires et d'analyse de textes. {L}e formalisme s'inspire des grammaires d'unification et de la {T}h{\'e}orie de la {R}epr{\'e}sentation du {D}iscours. {L}'approche mise en oeuvre ici pr{\'e}sente l'avantage d'{\^e}tre unifi{\'e}e: la syntaxe et la s{\'e}mantique sont trait{\'e}es par la m{\^e}me op{\'e}ration d'unification {P}rolog. {T}outefois, {P}rolog ne prenant pas en compte les m{\'e}canismes d'h{\'e}ritage, une op{\'e}ration d'unification {\'e}tendue g{\'e}rant les contraintes hi{\'e}rarchiques de types entre {\'e}l{\'e}ments du formalisme a {\'e}t{\'e} d{\'e}finie. {L}'environnement du syst{\`e}me comprend, notamment, un module de r{\'e}solution d'anaphores int{\'e}grant des sources de contraintes multiples ayant chacune leur propre strat{\'e}gie dans une architecture en 'tableau noir'. {Q}uant au mod{\`e}le de repr{\'e}sentation finale du contenu d'un texte, il s'inspire de la logique des d{\'e}fauts. {C}ette logique refl{\`e}te bien la construction non-monotone de ces textes. {E}lle permet d'envisager la modification interactive avec v{\'e}rification de coh{\'e}rence.}, keywords={{C}ompr{\'e}hension de textes en langage naturel; {G}rammaire d'unification;{R}epr{\'e}sentation du discours; {R}{\'e}solution d'anaphores;{A}pplication de la {L}ogique des d{\'e}fauts}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, school={{U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII}}, day={28}, month={06}, year={1989}, URL={http://tel.archives-ouvertes.fr/tel-00180374/en/}, } %% inria-00148133, version 2 %% http://hal.inria.fr/inria-00148133/en/ @techreport{DARONDEAU:2007:INRIA-00148133:2, title={{M}odular {A}utomata 2 {D}istributed {P}etri {N}ets 4 {S}ynthesis}, author={{D}arondeau, {P}hilippe and {P}etrucci, {L}aure}, abstract={{M}odular automata are symbolic transition systems halfway between families of automata and their synchronized products. {T}hey allow for analysis of liveness properties without incurring the state space explosion problem. {A} modular automaton is composed of modules and a synchronization graph. {W}e consider the problem whether such specifications may be implemented by a distributed {P}etri net up to language equivalence. {T}he challenge is to avoid computing the state space of the modular automaton to be implemented. {W}e show that this is possible, opening the way to the synthesis of nets from modular specifications.}, keywords={modular automaton, synchronized product, distributed {P}etri net, modular synthesis, regular languages, linear systems}, language={{A}nglais}, affiliation={{S}4 - {INRIA} - {IRISA} - {CNRS} : {UMR}6074 - {INRIA} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ennes - {U}niversit{\'e} de {R}ennes 1 - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, type={}, year={2007}, URL={http://hal.inria.fr/inria-00148133/en/}, } %% inria-00000425, version 1 %% http://hal.inria.fr/inria-00000425/en/ @techreport{CIARLETTA:2005:INRIA-00000425:1, title={{WP} - 3.2.1 : {N}etwork {C}onfiguration}, author={{C}iarletta, {L}aurent and {F}estor, {O}livier and {S}tate, {R}adu and {K}rief, {F}rancine}, keywords={{N}etwork {M}anagement;{D}ynamic {N}etworks;{C}onfiguration}, language={{A}nglais}, affiliation={{MADYNES} - {INRIA} {L}orraine - {LORIA} - {INRIA} - {CNRS} : {UMR}7503 - {U}niversit{\'e} {H}enri {P}oincar{\'e} - {N}ancy {I} - {U}niversit{\'e} {N}ancy {II} - {I}nstitut {N}ational {P}olytechnique de {L}orraine - {I}nstitut {N}ational {P}olytechnique de {L}orraine - {E}cole {N}ationale {S}up{\'e}rieure des {M}ines de {N}ancy - {INPL}-{ENSMN} - {I}nstitut {N}ational {P}olytechnique de {L}orraine - {INPL} - {E}cole {N}ationale {S}up{\'e}rieure des {M}ines de {N}ancy - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, type={}, note={{L}ivrable 3.2.1 du projet {RNRT} {SWAN}}, year={2005}, URL={http://hal.inria.fr/inria-00000425/en/}, } %% hal-00279743, version 1 %% http://hal.archives-ouvertes.fr/hal-00279743/en/ @misc{JANVIER:2002:HAL-00279743:1, title={{M}ethod for processing {I}nternet {R}equest files}, author={{J}anvier, {E}ric and {B}enabdeslem, {K}halid and {B}ennani, {Y}oun{\`e}s}, language={{A}nglais}, affiliation={{N}umsight - {M}inist{\`e}re de l'{E}nseignement {S}up{\'e}rieur et de la {R}echerche {S}cinetifique - {L}aboratoire d'{I}nformatique pour l'{E}ntreprise et les {S}yst{\`e}mes de {P}roduction - {LIESP} - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {U}niversit{\'e} {L}umi{\`e}re - {L}yon {II} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {L}yon - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, howpublished={patent no. {WO}02059781 }, number={{WO}02059781 }, day={01}, month={08}, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00279743/en/}, } %% hal-00159388, version 1 %% http://hal.archives-ouvertes.fr/hal-00159388/en/ @unpublished{ABBES:2007:HAL-00159388:1, title={{P}erformance {A}nalysis of {P}ublish/{S}ubscribe {S}ystems}, author={{A}bbes, {H}eithem and {C}{\'e}rin, {C}hristophe and {D}ubacq, {J}ean-{C}hristophe and {J}emni, {M}ohamed}, abstract={{T}he {D}esktop {G}rid offers solutions to overcome several challenges and to answer increasingly needs of scientific computing. {I}ts technology consists mainly in exploiting resources, geographically dispersed, to treat complex applications needing big power of calculation and/or important storage capacity. {H}owever, as resources number increases, the need for scalability, self-organisation, dynamic reconfigurations, decentralisation and performance becomes more and more essential. {S}ince such properties are exhibited by {P}2{P} systems, the convergence of grid computing and {P}2{P} computing seems natural. {I}n this context, this paper evaluates the scalability and performance of {P}2{P} tools for discovering and registering services. {T}hree protocols are used for this purpose: {B}onjour, {A}vahi and {F}ree-{P}astry. {W}e have studied the behaviour of theses protocols related to two criteria: the elapsed time for registrations services and the needed time to discover new services. {O}ur aim is to analyse these results in order to choose the best protocol we can use in order to create a decentralised middleware for desktop grid.}, keywords={{P}eer-to-{P}eer systems;{D}esktop grid;{P}erformance evaluation;{Z}ero-{C}onfiguration;{B}onjour;{A}vahi;m{DNSR}esponder;{F}ree-{P}astry}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {T}echnologie de l'{I}nformation et de la {C}ommunication - {UTIC} - {\'E}cole {S}up{\'e}rieure des {S}ciences et {T}echnologies de {T}unis }, note={{R}apport {I}nterne {LIPN} }, ARXIVID={0707.0365 }, day={15}, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00159388/en/}, } %% hal-00153745, version 1 %% http://hal.archives-ouvertes.fr/hal-00153745/en/ @unpublished{BOURGOIS:2007:HAL-00153745:1, title={{A} {F}ormalism for {W}eb {S}ervices {P}roperties}, author={{B}ourgois, {L}aure and {D}elteil, {A}lexandre and {L}{\'e}vy, {F}ran{\c{c}}ois}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{D}ans nos pr{\'e}c{\'e}dents travaux, nous avons d{\'e}gag{\'e} une diff{\'e}rence entre des {W}eb services actifs qui permettent d'ex{\'e}cuter une action_ par exemple acheter une place de th{\'e}{\^a}tre en ligne_ et des {W}eb services informatifs qui extraient de l'information _par exemple interroger des bases de donn{\'e}es pour avoir une liste des {CD} disponibles {\`a} l'achat. {C}e papier pr{\'e}sente une logique dynamique pour mod{\'e}li }, day={13}, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153745/en/}, } %% hal-00158884, version 1 %% http://hal.archives-ouvertes.fr/hal-00158884/en/ @unpublished{KANOVICH:2007:HAL-00158884:1, title={{L}inear {L}ogic foundations for {A}rtificial {I}ntelligence}, author={{K}anovich, {M}ax and {V}auzeilles, {J}acqueline}, abstract={{T}he potential usefulness of a logical approach to {AI} problems has motivated attempts to achieve higher efficiency than that provided by traditional predicate logic. {I}t is true that one could describe any {AI} system by means of formulas built up from certain basic predicates by traditional logical connectives and quantifiers. {H}owever, such a general approach runs into difficulties with the undecidability of certain fragments of traditional predicate logic, whereas it is not easy to describe a decidable fragment of it, which could be served for specifying {AI} systems and their problems. {T}he aim of this research is to introduce a comprehensive logical system that automatically exploits peculiarities of the {AI} systems under consideration, and to show that such a logical system can indeed achieve a significant speedup over the traditional ones. {W}e introduce {L}inear {L}ogic as a logical system capable of handling many {A}rtificial {I}ntelligence problems such as the typical {AI} problem of making a plan of the actions to be performed by a robot so that it could get into a set of final situations, if it started with a certain initial situation. {T}his problem is known as being generally very complex. {W}e show that linear logic provides a convenient and adequate tool for representing planning problems in nondeterministic domains: the planning problem under uncertainty about the effects of actions, or games `{R}obot against {N}ature', is proved to be {EXPTIME}-complete. {F}ixing a finite signature, that is a finite set of predicates and their finite domains, we get a polynomial time procedure of making plans for the robot system over this signature. {T}he planning complexity is reduced to {PSPACE} for the robot systems with only pure deterministic actions. {A}s a result, the {AI} planners are very sensitive to the number of the variables involved, the inherent symmetry of the problem, and the nature of the logic formalisms being used. {A} particular focus of our research is on planning problems with an unbounded number of functionally identical objects. {W}e show that for such problems linear logic is especially effective and leads to dramatic contraction of the search space from exponential to polynomial in size. {W}e employ the ability of linear logic to reason about multisets, which in this instance are created by identifying several distinct objects as being functionally equivalent for the problem at hand (think of a number of balls, each of which must be moved to some new location --- the balls are distinct, but are functionally equivalent for the problem). {M}oreover, this correspondence also guarantees to produce a real solution that works in polynomial time.}, keywords={{L}inear {L}ogic - {A}rtificial {I}ntelligence - {C}omplexity - {P}lanning - {S}ymmetries}, language={{A}nglais}, affiliation={{Q}ueen {M}ary {C}ollege - {U}niversity of {L}ondon - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={34 pages soumission {\`a} {A}nnals of {M}athematics and {A}rtificial {I}ntelligence - {S}pecial {I}ssue - 1st {I}nternational {S}ymmetry {C}onference }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00158884/en/}, } %% hal-00084728, version 1 %% http://hal.archives-ouvertes.fr/hal-00084728/en/ @unpublished{KANOVICH:2007:HAL-00084728:1, title={{S}trong {P}lanning under {U}ncertainty in {D}omains with {N}umerous but {I}dentical {E}lements (a generic approach)}, author={{K}anovich, {M}ax and {V}auzeilles, {J}acqueline}, abstract={{T}he typical {AI} problem of making a plan of the actions to be performed by a robot so that it could get into a set of final situations, if it started with a certain initial situation, is generally very complex. {E}ven within the case of ‘well-balanced' actions, strong planning under uncertainty about the effects of actions, or games ‘{R}obot against {N}ature', is {EXPTIME}-complete. {A}s a result, the {AI} planners are very sensitive to the number of the variables involved, the inherent symmetry of the problem, and the nature of the logic formalisms being used. {T}he paper shows that linear logic provides a convenient and adequate tool for representing strong and weak planning problems in nondeterministic domains. {A} particular interest of our paper is focused on planning problems with an unbounded number of functionally identical objects. {W}e show that for such problems linear logic is especially effective and leads to dramatic contraction of the search space (polynomial instead of exponential). {T}he paper addresses the key issue: “{H}ow to automatically recognize functions similarity among objects and break the extreme combinatorial explosion caused by the large number of objects that happen to be identical” by means of replacing the unbounded number of specific names of objects with one generic name and contracting thereby the exponential search space over ‘real' objects to a small polynomial search space but over the ‘generic' one, with providing a more abstract formulation whose solutions are proved to be directly translatable into (optimal) polytime solutions to the original planning problem.}, keywords={{L}inear {L}ogic - {A}rtificial {I}ntelligence - {P}lanning - {C}omplexity}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omputer {S}cience {D}epartment, {Q}ueen {M}ary - {U}niversity of {L}ondon }, note={37 pages {T}heoretical {C}omputer {S}cience }, doi={10.1016/j.tcs.2007.01.022 }, day={15}, month={05}, year={2007}, URL={dx.doi.org/10.1016/j.tcs.2007.01.022 http://hal.archives-ouvertes.fr/hal-00084728/en/}, } %% hal-00084726, version 1 %% http://hal.archives-ouvertes.fr/hal-00084726/en/ @unpublished{KANOVICH:2007:HAL-00084726:1, title={{L}inear {L}ogic in {T}emporal {P}lanning for {A}ctions with {D}elayed {E}ffects}, author={{K}anovich, {M}ax and {V}auzeilles, {J}acqueline}, abstract={{T}he typical {AI} problem is that of making a plan (program) of the actions to be performed by a controller so that it could get into a set of final situations, if it started with a certain initial situation. {T}he paper describes a linear logic approach to planning. {T}he key intuition of the use of linear logic is that a linear logic sequent of the ‘static' form {X} {Y} can be conceived of as an adequate representation of the dynamic difference between the ‘state' {X} before and the ‘state' {Y} after the specified event/action has occurred. {T}he usual assumption - that the effects of the actions are instantaneous, provides that the plans and even the related winning strategies happen to be finite in the case of a finite number of states. {A}mong other things, the previous papers on linear logic in planning adopted this assumption on the way to the transparent correspondence between plans and linear logic proofs. {T}he novelty of this paper is that we deal here with the planning under temporal uncertainty caused by actions with delayed effects. {E}ven in the case of a finite number of states and a finite number of actions, we run into essential difficulties with the winning strategies that are inherently of infinite branching: {T}he number of possible delays is infinite, since time is supposed to be the real time. {W}e show that in this, much more complex framework the correspondence between {LL} proofs and plans can be still maintained. {T}his result is helpful in understanding better the adequacy of linear logic for the {AI} problems.}, keywords={{L}inear {L}ogic - {A}rtificial {I}ntelligence - {T}emporal {P}lanning}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omputer {S}cience {D}epartment, {Q}ueen {M}ary - {U}niversity of {L}ondon }, note={20 pages rapport interne du {LIPN} rapport interne du {LIPN} }, day={15}, month={05}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00084726/en/}, } %% hal-00160524, version 1 %% http://hal.archives-ouvertes.fr/hal-00160524/en/ @unpublished{LODDO:2007:HAL-00160524:1, title={{M}arionnet/{I}utoppix : un environnement p{\'e}dagogique pour la simulation de r{\'e}seaux locaux}, author={{L}oddo, {J}ean-{V}incent and {H}amon, {T}hierry}, abstract={{C}et article pr{\'e}sente la r{\'e}alisation d'un outil de simulation de r{\'e}seau local pour l'apprentissage de la gestion d'un r{\'e}seau informatique. {C}et outil, appel{\'e} {M}arionnet/{I}utoppix, s'appuie sur les possibilit{\'e}s qu'offre conjointement la technologie de {CD}/{DVD} auto-amor{\c{c}}able {L}ive {CD} et la fonctionnalit{\'e} particuli{\`e}re des noyaux {L}inux r{\'e}cents, le {U}ser {M}ode {L}inux ({UML}), qui permet de lancer un ou plusieurs autres noyaux par dessus le noyau principal comme s'il s'agissait d'applications ordinaires. {L}'outil a {\'e}t{\'e} exploit{\'e} dans le cadre de travaux pratiques d'administration syst{\`e}me et de gestion des r{\'e}seaux.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{D}{\'e}monstration {\`a} la conf{\'e}rence {EIAH} 2007 ({E}nvironnements {I}nformatiques pour l'{A}pprentissage {H}umain) {P}rojet {E}-{L}earning {U}niversit{\'e} {P}aris 13 }, collaboration={{P}rojet {E}-{L}earning {P}aris 13 - {C}omposition « {\`a} la carte » de contenus p{\'e}dagogiques sur {CD}/{DVD} }, day={28}, month={07}, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00160524/en/}, } %% hal-00021834, version 1 %% http://hal.archives-ouvertes.fr/hal-00021834/en/ @unpublished{ATASSI:2006:HAL-00021834:1, title={{V}erification of {P}time reducibility for system {F} terms via {D}ual {L}ight {A}ffine {L}ogic.}, author={{A}tassi, {V}incent and {B}aillot, {P}atrick and {T}erui, {K}azushige}, abstract={{I}n a previous work we introduced {D}ual {L}ight {A}ffine {L}ogic ({DLAL}) ([{B}aillot{T}erui04]) as a variant of {L}ight {L}inear {L}ogic suitable for guaranteeing complexity properties on lambda-calculus terms: all typable terms can be evaluated in polynomial time and all {P}time functions can be represented. {I}n the present work we address the problem of typing lambda-terms in second-order {DLAL}. {F}or that we give a procedure which, starting with a term typed in system {F}, finds all possible ways to decorate it into a {DLAL} typed term. {W}e show that our procedure can be run in time polynomial in the size of the original {C}hurch typed system {F} term.}, keywords={linear logic ; lambda-calculus ; implicit computational complexity ; polynomial time complexity ; type inference.}, language={{A}nglais}, affiliation={{N}ational {I}nstitute of {I}nformatics - {NII} - {N}ational {I}nstitute of {I}nformatics - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{P}roceedings of {C}omputer {S}cience {L}ogic 2006 ({CSL}'06), volume 4207 of {L}ecture {N}otes in {C}omputer {S}cience, pp.150-166. \&\#65533; {S}pringer projets {CRISS} ({ACI} {SI}), {G}eo{C}al ({ACI} {NIM}), {NO}-{C}o{ST} ({ANR}). }, ARXIVID={cs.LO/0603104 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00021834/en/}, } %% hal-00090750, version 1 %% http://hal.archives-ouvertes.fr/hal-00090750/en/ @unpublished{AUBIN:2006:HAL-00090750:1, title={{Y}a{T}e{A} - version 2006}, author={{A}ubin, {S}ophie and {H}amon, {T}hierry}, keywords={{NLP}; {T}erminology; {T}erm extraction}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{Y}a{T}e{A} ({Y}et {A}nother {T}erm {E}xtr{A}ctor) aims at identifying and extracting noun phrases which are potential terms ({\em i.e. } term candidates). {E}ach term candidate is syntactically analysed in order to identify head and modifier components. {Y}a{T}e{A} can integra {P}rojet {E}urop{\'e}en {STREP} {IST}-1-002068-{STP} - {ALVIS} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00090750/en/}, } %% hal-00133597, version 1 %% http://hal.archives-ouvertes.fr/hal-00133597/en/ @unpublished{BUTELLE:2006:HAL-00133597:1, title={{R}eal-{T}ime {D}istributed {S}cheduling of {P}recedence {G}raphs on {A}rbitrary {W}ide {N}etworks}, author={{B}utelle, {F}ranck and {F}inta, {L}ucian and {H}akem, {M}ourad}, abstract={{P}revious work on scheduling dynamic competitive jobs is focused on multiprocessors configurations. {T}his paper presents a new distributed dynamic scheduling scheme for sporadic real-time jobs with arbitrary precedence relations on arbitrary wide networks. {A} job is modeled by a {D}irected {A}cyclic {G}raph ({DAG}). {J}obs arrive on any site at any time and compete for the computational resources of the network. {T}he scheduling algorithm developed in this paper is based upon a new concept of {C}omputing {S}pheres in order to determine a good neighborhood of sites that may cooperate for the execution of a job if it cannot be guaranteed locally. {T}he salient feature of this new concept is that it allows the algorithm to be performed on arbitrary wide networks since it uses a limited number of sites and communication links.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{R}apport de {R}echerche {LIPN} n°2006-01 }, month={01}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00133597/en/}, } %% hal-00083586, version 1 %% http://hal.archives-ouvertes.fr/hal-00083586/en/ @unpublished{BUTELLE:2006:HAL-00083586:1, title={{SCHUR}, an interactive program for calculating properties of {L}ie groups and symmetric functions.}, author={{B}utelle, {F}ranck and {K}ing, {R}onald and {T}oumazet, {F}r{\'e}d{\'e}ric}, abstract={{S}chur is a stand alone {C} program for interactively calculating properties of {L}ie groups and symmetric functions. {S}chur has been designed to answer questions of relevance to a wide range of problems of special interest to chemists, mathematicians and physicists - particularly for persons who need specific knowledge relating to some aspect of {L}ie groups or symmetric functions and yet do not wish to be encumbered with complex algorithms. {T}he objective of {S}chur is to supply results with the complexity of the algorithms hidden from view so that the user can effectively use {S}chur as a scratch pad, obtaining a result and then using that result to derive new results in a fully interactive manner. {S}chur can be used as a tool for calculating branching rules {K}ronecker products, {C}asimir invariants, dimensions, plethysms, {S}-function operations, {Y}oung diagrams and their hook lengths etc.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{L}ogiciel de calcul scientifique en {GPL} http://schur.sourceforge.net }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00083586/en/}, } %% hal-00158591, version 1 %% http://hal.archives-ouvertes.fr/hal-00158591/en/ @unpublished{DERIVIERE:2006:HAL-00158591:1, title={{A}nnotation linguistique de documents {W}eb dans une architecture distribu{\'e}e et adaptable}, author={{D}erivi{\`e}re, {J}ulien and {H}amon, {T}hierry}, abstract={{D}ans le cadre du projet {ALVIS} (www.alvis.info/alvis), nous avons con{\c{c}}u une plate-forme d'enrichissement linguistique de documents issus du {W}eb, exploitant des outils de {T}raitement {A}utomatique des {L}angues ({TAL}) existants. {C}ette architecture est distribu{\'e}e afin de r{\'e}pondre aux contraintes li{\'e}es aux traitements de gros volumes de textes, et adaptable pour sp{\'e}cialiser l'analyse linguistique de ces textes. {U}ne collection de 55 329 documents (soit plus 80 millions de mots) a pu {\^e}tre annot{\'e}e en 3 jours. {L}a plate-forme, d{\'e}velopp{\'e}e en {P}erl et disponible sous forme de modules, peut {\^e}tre vu comme un cadre de travail modulaire dans lequel il est possible d'int{\'e}grer de nouveaux outils de {TAL}. {L}ors de l'expos{\'e}, nous pr{\'e}senterons la plate-forme, aussi bien du point de vue de sa conception que de son impl{\'e}mentation. {N}ous donnerons {\'e}galement un aper{\c{c}}u des performances obtenues.}, keywords={{N}atural language processing ; robust text analysis}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{T}he {F}rench {P}erl {W}orkshop ({J}ourn{\'e}es {F}rancophones de {P}erl - {FPW}2006) {C}ommunication orale {ALVIS} {STREP} project }, collaboration={{ALVIS} }, day={25}, month={11}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00158591/en/}, } %% hal-00101559, version 1 %% http://hal.archives-ouvertes.fr/hal-00101559/en/ @unpublished{DERIVIERE:2006:HAL-00101559:1, title={{D}eliverable {D}5.2: {R}eport on theory and software of normalization options for {IR} (platform conception)}, author={{D}erivi{\`e}re, {J}ulien and {N}azarenko, {A}deline}, abstract={{T}his document gives technical details regarding the implementation and usage of the {ALVIS} platform for {E}nglish, {F}rench, {C}hinese and {S}lovene.}, keywords={semantic websites, python}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{H}.3.3 {ALVIS} {D}eliverable {R}eport {ALVIS} }, collaboration={{ALVIS} {STREP}/{IST} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00101559/en/}, } %% hal-00090753, version 1 %% http://hal.archives-ouvertes.fr/hal-00090753/en/ @unpublished{DERIVIERE:2006:HAL-00090753:1, title={{A}lvis {NLP} {P}latform}, author={{D}erivi{\`e}re, {J}ulien and {H}amon, {T}hierry}, keywords={{NLP}; {A}nnotation; {W}eb documents; {NLP} architecture}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{T}he {A}lvis {NLP} {P}latform is a scalable arcitecture using existing {NLP} tools to annotate large collections of web documents. {P}rojet {E}urop{\'e}en {STREP} {IST}-1-002068-{STP} - {ALVIS} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00090753/en/}, } %% hal-00083426, version 1 %% http://hal.archives-ouvertes.fr/hal-00083426/en/ @unpublished{HAKEM:2006:HAL-00083426:1, title={{A} {B}icriteria {S}cheduling {A}lgorithm for {M}inimizing {M}akespan and {F}ailure {P}robability of {A}pplications in {H}eterogeneous {D}istributed {C}omputing {S}ystems}, author={{H}akem, {M}ourad and {B}utelle, {F}ranck}, keywords={scheduling, clustering, distributed computing, precedence task graphs, reliability, safety, multicriteria scheduling, heterogeneous systems, parallel scheduling.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{R}apport de recherche {N}° 2006.02, {LIPN} {CNRS} {UMR} 7030 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00083426/en/}, } %% hal-00090744, version 1 %% http://hal.archives-ouvertes.fr/hal-00090744/en/ @unpublished{HAMON:2006:HAL-00090744:1, title={{S}yno{T}erm - version 2006}, author={{H}amon, {T}hierry}, keywords={{TAL};{T}erminologie;{S}ynonymie;{I}ndexation libre;{I}ndexation contr{\^o}l{\'e}e}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{S}yno{T}erm est un logiciel de d{\'e}tection de relations de synonymie entre termes. {I}l peut {\^e}tre utilis{\'e} pour l'indexation libre d'un corpus de textes (il calcule des relations de synonymie entre les termes extraits d'un corpus) ou pour l'indexation contr{\^o}l{\'e}e d }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00090744/en/}, } %% hal-00153962, version 1 %% http://hal.archives-ouvertes.fr/hal-00153962/en/ @unpublished{LAVAL:2006:HAL-00153962:1, title={{R}apport de recherche sur le probl{\`e}me du plus court chemin contraint}, author={{L}aval, {O}livier and {T}oulouse, {S}ophie and {N}agih, {A}nass}, abstract={{T}his article provides an overview of the performance and the theoretical complexity of approximate and exact methods for various versions of the shortest path problem. {T}he proposed study aims to improve the resolution of a more general covering problem within a column generation scheme in which the shortest path problem is the sub-problem.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique {T}h{\'e}orique et {A}ppliqu{\'e}e - {LITA} - {U}niversit{\'e} {P}aul {V}erlaine - {M}etz }, note={rapport interne {LIPN} }, ARXIVID={0803.2615 }, day={21}, month={12}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00153962/en/}, } %% hal-00084606, version 1 %% http://hal.archives-ouvertes.fr/hal-00084606/en/ @unpublished{LAVAULT:2006:HAL-00084606:1, title={{A} distributed prime sieving algorithm based on {SMER}}, author={{L}avault, {C}hristian and {P}aillard, {G}abriel and {F}ranca, {F}elipe}, abstract={{I}n this paper, we propose a fully distributed algorithm for finding all primes in an given interval $[2..n]$ (or $({L},{R})$, more generally), based on the {SMER} (\textit{{S}cheduling by {M}ultiple {E}dge {R}eversal}) multigraph dynamics. {G}iven a multigraph $\mathcal{{M}}$ of arbitrary topology, having ${N}$ nodes, the {SMER}-driven system is defined by the numberof directed edges (arcs) between any two nodes of $\mathcal{{M}}$, and by the global period length of all ``arc reversals'' in $\mathcal{{M}}$. {I}n the domain of prime numbers generation, such a graph method shows quite elegant, and it also yields a totally new kind of distributed prime sieving algorithms of an entirely original design. {T}he maximum number of steps required by the algorithm is at most $n + \sqrt{n}$. {A}lthough far beyond the ${O}(n/\log\log n)$ steps required by the improved sequential ``wheel sieve'' algorithms, our {SMER}-based algorithm is fully distributed and of linear (step) complexity. {T}he message complexity of the algorithm is at most $n\{D}elta_{N} + \sqrt{n} \{D}elta_{N}$, where $\{D}elta_{N}$ denotes the maximum ``multidegree'' of the arbitrary multigraph $\mathcal{{M}}$, and the space required per process is linear.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {P}rograma de {E}ngenharia de {S}istemas e {C}omputa{\c{c}}{\~a}o - {PESC} - {U}niversidade {F}ederal de {R}io de {J}aneiro }, note={{R}apport interne {LIPN} }, month={05}, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084606/en/}, } %% hal-00085017, version 1 %% http://hal.archives-ouvertes.fr/hal-00085017/en/ @unpublished{MOGBIL:2006:HAL-00085017:1, title={{M}ultiplicative exponential proof structures and logic programming}, author={{M}ogbil, {V}irgile and {F}ouquer{\'e}, {C}hristophe}, abstract={{W}e study conditions for a concurrent construction of proof-nets in the framework of linear logic following {A}ndreoli's works. {W}e define specific correctness criteria for that purpose. {W}e first study the multiplicative case and show how the correctness criterion given by {D}anos and decidable in linear time, may be extended to closed modules (i.e. validity of polarized proof structures), then generalize the criterion to open modules (i.e. validity of partial proof structures) distinguishing criteria for acyclicity and connectability in order to allow incremental verification. {W}e then study fragments of the exponential case. {T}his has natural applications in (concurrent) logic programming as validity of partial proof structures may be interpreted in terms of validity of a concurrent execution of clauses in an environment.}, keywords={linear logic; proof-nets; logic programming; focalization; concurrent execution}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={submitted ({M}arch 2006) }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085017/en/}, } %% hal-00101529, version 1 %% http://hal.archives-ouvertes.fr/hal-00101529/en/ @unpublished{POIBEAU:2006:HAL-00101529:1, title={{E}tat de l'art des m{\'e}thodes linguistiques et statistiques pour l'extraction d'informations}, author={{P}oibeau, {T}hierry and {N}azarenko, {A}deline}, abstract={{C}e document pr{\'e}sente un {\'e}tat de l'art des m{\'e}thodes linguistiques et statistiques pour l'extraction d'informations}, keywords={{E}xtraction d'information; {T}raitement automatique des langues}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={25 pages {C}e document pr{\'e}sente un {\'e}tat de l'art des m{\'e}thodes linguistiques et statistiques pour l'extraction d'informations {P}rojet {I}nfom@gic }, collaboration={{P}rojet infom@gic }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00101529/en/}, } %% hal-00090177, version 1 %% http://hal.archives-ouvertes.fr/hal-00090177/en/ @unpublished{SZULMAN:2006:HAL-00090177:1, title={{L}ogiciel {TERMINAE}- version 2006}, author={{S}zulman, {S}ylvie}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{L}'outil {TERMINAE} est une plate-forme d'aide {\`a} la construction de terminologies et d'ontologies {\`a} partir de l'{\'e}tude de textes. {I}l int{\'e}gre un concordancier ({L}inguae) et permet la visualisation des r{\'e}sultats de {L}exter et/ou {S}yntex d{\'e}velopp{\'e}s par {D}. {B}ourigaul }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00090177/en/}, } %% hal-00095573, version 1 %% http://hal.archives-ouvertes.fr/hal-00095573/en/ @unpublished{AUDIBERT:2005:HAL-00095573:1, title={{L}ogiciel {CONCORDANTA}}, author={{A}udibert, {L}aurent}, abstract={{C}oncordanta est un concordancier fonctionnant sous {L}inux/{M}acintosh/{W}indows et permettant d'effectuer des recherches dans des fichiers annot{\'e}s au format tabulaire comme ceux g{\'e}n{\'e}r{\'e}s par {C}ordial ({S}ynapse {D}{\'e}veloppement) ou {T}ree{T}agger ({TC} project, {I}nstitute for {C}omputational {L}inguistics, {U}niversity of {S}tuttgart). {C}oncordanta permet de tirer parti de tout le pouvoir expressif des m{\'e}ta-expressions r{\'e}guli{\`e}res de la biblioth{\`e}que {L}o{X}, pour d{\'e}finir la cible ou filtrer les contextes droit et gauche.}, keywords={concordancier ; expression r{\'e}guli{\`e}re ; cordial ; {T}ree{T}agger ; corpus ; extraction}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{C}oncordanta est un logiciel de type concordancier. }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00095573/en/}, } %% hal-00095572, version 1 %% http://hal.archives-ouvertes.fr/hal-00095572/en/ @unpublished{AUDIBERT:2005:HAL-00095572:1, title={{L}ogiciel {XEXPLORA} et {EXPLORA}}, author={{A}udibert, {L}aurent}, abstract={{I}l s'agit d'un outil de recherche et d'observation de ph{\'e}nom{\`e}nes linguistiques dans les corpus {\'e}crits. {U}n micro langage de formatage du r{\'e}sultat des recherches permet une tr{\`e}s grande souplesse d'utilisation. {XE}xplora et {E}xplora fonctionnent sous {L}inux/{M}acintosh/{W}indows. {E}xplora est la version ligne de commande de {XE}xplora permettant son utilisation dans des scripts.}, keywords={concordancier ; expression r{\'e}guli{\`e}re ; cordial ; {T}ree{T}agger ; corpus ; extraction}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{O}util de recherche et d'observation de ph{\'e}nom{\`e}nes linguistiques dans les corpus {\'e}crits. }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00095572/en/}, } %% hal-00091647, version 1 %% http://hal.archives-ouvertes.fr/hal-00091647/en/ @unpublished{KAYSER:2005:HAL-00091647:1, title={{C}ompte-rendu de lecture du livre « {I}nterpr{\'e}ter en contexte » sous la dir. de {F}rancis {CORBLIN} et de {C}laire {GARDENT}}, author={{K}ayser, {D}aniel}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={t.a.l. vol.46 n°1 pp. 197-200 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00091647/en/}, } %% hal-00098068, version 1 %% http://hal.archives-ouvertes.fr/hal-00098068/en/ @unpublished{NEDELLEC:2005:HAL-00098068:1, title={{O}ntologies and {I}nformation {E}xtraction}, author={{N}{\'e}dellec, {C}laire and {N}azarenko, {A}deline}, abstract={{T}his report argues that, even in the simplest cases, {IE} is an ontology-driven process. {I}t is not a mere text filtering method based on simple pattern matching and keywords, because the extracted pieces of texts are interpreted with respect to a predefined partial domain model. {T}his report shows that depending on the nature and the depth of the interpretation to be done for extracting the information, more or less knowledge must be involved. {T}his report is mainly illustrated in biology, a domain in which there are critical needs for content-based exploration of the scientific literature and which becomes a major application domain for {IE}.}, keywords={{O}ntology ; {I}nformation extraction ; {B}io text mining}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} }, note={{H}.3.1 {LIPN} {I}nternal {R}eport }, ARXIVID={cs.AI/0609137 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00098068/en/}, } %% hal-00158283, version 1 %% http://hal.archives-ouvertes.fr/hal-00158283/en/ @unpublished{ALFANDARI:2004:HAL-00158283:1, title={{C}hoice rules with size constraints for {M}ultiple {C}riteria {D}ecision {M}aking}, author={{A}lfandari, {L}aurent}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{DR} 04-002 {E}ssec {R}esearch {C}enter }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00158283/en/}, } %% hal-00101613, version 1 %% http://hal.archives-ouvertes.fr/hal-00101613/en/ @unpublished{ALPHONSE:2004:HAL-00101613:1, title={{D}eliverable {D}6.2: {R}equirements for integration of {WP}6 results into {WP}5 normalization and representation tasks and into {WP}9}, author={{A}lphonse, {E}rick and {B}essi{\`e}res, {P}hilippe and {D}eral, {G}a{\"e}l and {L}ehman, {G}a{\"e}tan and {M}anine, {A}lain-{P}ierre and {N}{\'e}dellec, {C}laire and {A}ubin, {S}ophie and {D}erivi{\`e}re, {J}ulien and {H}amon, {T}hierry and {N}azarenko, {A}deline and {P}oibeau, {T}hierry and {W}eissenbacher, {D}avy}, abstract={{A}s stated in the technical annex, the role of the work package 6 ("{L}inguistic resource learning", {WP}6) is to study the development and the adaptation methods to automate the acquisition of the linguistic resources as needed for document analysis and semantic normalization in specific domains ({WP}5) and for ontology navigation in the query refinement process ({WP}9, task 9.3 "{U}ser {I}nteraction"). {T}his requirement document specifies how the resources provided by the tools developed by {WP}6 are exploited by the linguistic processing line developed within {WP}5 and what type of ontology should be provided to the {WP}9 query refinement process.}, keywords={requirements; normalization}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} }, note={{H}.3.3 {ALVIS} deliverable report {ALVIS} }, collaboration={{ALVIS} {STREP}/{IST} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00101613/en/}, } %% hal-00101592, version 1 %% http://hal.archives-ouvertes.fr/hal-00101592/en/ @unpublished{AUBIN:2004:HAL-00101592:1, title={{D}eliverable {D}6.1: {R}equirement and training data for biological domain}, author={{A}ubin, {S}ophie and {B}essi{\`e}res, {P}hilippe and {H}amon, {T}hierry and {L}ehman, {G}a{\"e}tan and {M}anine, {A}lain-{P}ierre and {N}azarenko, {A}deline and {N}{\'e}dellec, {C}laire and {O}uld {A}bdel {V}etah, {M}ohamed and {P}oibeau, {T}hierry}, abstract={{T}his document describes the data sets to be used by the linguistic tools developed by {WP}5 and the machine learning tools developed by {WP}6 that aim at enriching and normalizing the document to be retrieved.}, keywords={requirements; training data}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} }, note={{I}.2.6 {ALVIS} {D}eliverable {R}eport {ALVIS} }, collaboration={{ALVIS} {STREP}/{IST} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00101592/en/}, } %% hal-00101493, version 1 %% http://hal.archives-ouvertes.fr/hal-00101493/en/ @unpublished{AUBIN:2004:HAL-00101493:1, title={{C}hoix, {\'e}valuation et adaptation d'un analyseur syntaxique pour l'extraction d'information}, author={{A}ubin, {S}ophie and {N}azarenko, {A}deline}, abstract={{C}e rapport du projet {E}xtra{P}lo{D}ocs pr{\'e}sente le choix, l'{\'e}valuation et l'adaptation d'un analyseur syntaxique pour l'extraction d'information dans des domaines de sp{\'e}cvialit{\'e}, , notamment la biologie}, keywords={{A}nalyse syntaxique; traitement automatique des langues}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={50 pages {R}apport extra{P}lo{D}ocs 3.3a {C}e rapport du projet {E}xtra{P}lo{D}ocs prt{\'e}sente le choix, l'{\'e}valuation et l'adaptation d'un analyseur syntaxique pour l'extraction d'information dans des domaines de sp{\'e}cvialit{\'e}, , notamment la biologie {C}ontrat {E}xtra{P}lo{D}ocs (laboratoire {LIPN}, laboratoire {INRA}/{MIG}, {I}soft) }, collaboration={{P}rojet extra{P}lo{D}ocs }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00101493/en/}, } %% hal-00101448, version 1 %% http://hal.archives-ouvertes.fr/hal-00101448/en/ @unpublished{AUBIN:2004:HAL-00101448:1, title={{A}nalyse terminologique (application et {\'e}valuation sur des textes de biologie)}, author={{A}ubin, {S}ophie and {H}amon, {T}hierry and {N}azarenko, {A}deline}, abstract={ce document traite de l'analyse terminologique, de son application et et de son {\'e}valuation sur des textes de biologie. {S}ont particuli{\`e}rement explor{\'e}s l'apport de ressources ext{\'e}rieures certifi{\'e}es et le filtrage automatique de termes par des techniques hybrides.}, keywords={{T}erminologie; {T}raitement automatique des langues; {TAL}}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={http://www-lipn.univ-paris13.fr/{RCLN}/{E}xtra/{E}xtra{P}lo{D}ocs/rapports.html 66 pages {C}e document traite de l'analyse terminologique, de son application et de son {\'e}valuation sur des textes de biologie. {S}ont particuli{\`e}rement explor{\'e}s l'apport de ressources ext{\'e}rieures certifi{\'e}es et le filtrage automatique de termes par des techniques hybrid {C}ontrat {E}xtra{P}lo{D}ocs (laboratoire {LIPN}, laboratoire {INRA}/{MIG}, {I}soft) }, collaboration={{P}rojet {RNTL} {E}xtra{P}lo{D}ocs }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00101448/en/}, } %% hal-00084722, version 1 %% http://hal.archives-ouvertes.fr/hal-00084722/en/ @unpublished{KANOVICH:2004:HAL-00084722:1, title={{S}trong {P}lanning under {U}ncertainty in {D}omains with {N}umerous but {I}dentical {E}lements (a generic approach)}, author={{K}anovich, {M}ax and {V}auzeilles, {J}acqueline}, abstract={{T}he typical {AI} problem of making a plan of the actions to be performed by a robot so that it could get into a set of final situations, if it started with a certain initial situation, is generally very complex. {E}ven within the case of ‘well-balanced' actions, strong planning under uncertainty about the effects of actions, or games ‘{R}obot against {N}ature', is {EXPTIME}-complete. {A}s a result, the {AI} planners are very sensitive to the number of the variables involved, the inherent symmetry of the problem, and the nature of the logic formalisms being used. {T}he paper shows that linear logic provides a convenient and adequate tool for representing strong and weak planning problems in nondeterministic domains. {A} particular interest of our paper is focused on planning problems with an unbounded number of functionally identical objects. {W}e show that for such problems linear logic is especially effective and leads to dramatic contraction of the search space (polynomial instead of exponential). {T}he paper addresses the key issue: “{H}ow to automatically recognize functions similarity among objects and break the extreme combinatorial explosion caused by the large number of objects that happen to be identical” by means of replacing the unbounded number of specific names of objects with one generic name and contracting thereby the exponential search space over ‘real' objects to a small polynomial search space but over the ‘generic' one, with providing a more abstract formulation whose solutions are proved to be directly translatable into (optimal) polytime solutions to the original planning problem.}, keywords={{L}inear {L}ogic - {A}rtificial {I}ntelligence - {P}lanning problem - {C}omplexity}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omputer {S}cience {D}ept, {Q}ueen {M}ary, {U}niversity of {L}ondon - {QUEEN} {MARY} {COLLEGE} - {U}niversity of {L}ondon }, note={en cours de publication - 32 pages {T}heoretical {C}omputer {S}cience (accept{\'e} pour publication) }, doi={10.1016/j.tcs.2007.01.022 }, year={2004}, URL={dx.doi.org/10.1016/j.tcs.2007.01.022 http://hal.archives-ouvertes.fr/hal-00084722/en/}, } %% hal-00085921, version 1 %% http://hal.archives-ouvertes.fr/hal-00085921/en/ @unpublished{LETOCART:2004:HAL-00085921:1, title={{A} bibliography on multicut and integer multiflow problems}, author={{L}{\'e}tocart, {L}ucas and {B}entz, {C}{\'e}dric and {C}osta, {M}arie-{C}hristine and {R}oupin, {F}r{\'e}d{\'e}ric}, abstract={{W}e present a bibliography about the maximum integral multiflow and the minimum multicut problems and their subproblems, such as the multiterminal cut and the unsplittable flow problems. {S}ome references also concern related problems, such as the integer multiflow problem with demands or the minimum cost multiflow problem. {P}apers are relative to unrestricted graphs as well as special graphs (trees, meshes, rings, trees of rings, bipartite and planar graphs, ...) {M}ost of the results are very recent, and a table summarizes the most important ones.}, language={{A}nglais}, affiliation={{C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{R}apport scientifique {CEDRIC} (ref. {CEDRIC} 654). }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085921/en/}, } %% hal-00080485, version 1 %% http://hal.archives-ouvertes.fr/hal-00080485/en/ @unpublished{MOGBIL:2004:HAL-00080485:1, title={{M}odules and logic programming}, author={{M}ogbil, {V}irgile and {F}ouquer{\'e}, {C}hristophe}, keywords={{M}ath{\'e}matiques et outils de mod{\'e}lisation; {L}ogique, math{\'e}matiques de l'informatique; {S}ciences du logiciel; {I}nformatique th{\'e}orique (algorithmique, logique, cryptographie); {L}angages et programmation}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={nb pages 25 test }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00080485/en/}, } %% hal-00003217, version 1 %% http://hal.archives-ouvertes.fr/hal-00003217/en/ @unpublished{MOGBIL:2004:HAL-00003217:1, title={{M}odules and {L}ogic {P}rogramming}, author={{M}ogbil, {V}irgile and {F}ouquer{\'e}, {C}hristophe}, abstract={{W}e study conditions for a concurrent construction of proof-nets in the framework developed by {A}ndreoli in recent papers. {W}e define specific correctness criteria for that purpose. {W}e first study closed modules (i.e. validity of the execution of a logic program), then extend the criterion to open modules (i.e. validity during the execution) distinguishing criteria for acyclicity and connectability in order to allow incremental verification.}, keywords={linear logic; proof-nets; logic programming; focalization; proof search; parallel execution}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={2004-05 {P}r{\'e}publication {LIPN} {UMR}7030 {P}r{\'e}publication {LIPN} }, ARXIVID={cs.LO/0411029 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003217/en/}, } %% hal-00101492, version 1 %% http://hal.archives-ouvertes.fr/hal-00101492/en/ @unpublished{POIBEAU:2004:HAL-00101492:1, title={{A}nalyse et rep{\'e}rage des entit{\'e}s nomm{\'e}es}, author={{P}oibeau, {T}hierry and {B}erroyer, {J}ean-{F}ran{\c{c}}ois}, abstract={{R}apport du projet {E}xtraplo{D}ocs concernant le rep{\'e}rage des entit{\'e}s nomm{\'e}es notamment dans le domaine g{\'e}n{\'e}ral et dans des domaines sp{\'e}cialis{\'e}s (biologie)}, keywords={{E}ntit{\'e}s nomm{\'e}es; {T}raitement automatique des langues}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={60 pages {R}apport {E}xtra{P}lo{D}ocs 3.3b {R}apport du projet {E}xtraplo{D}ocs concernant le rep{\'e}rage des entit{\'e}s nomm{\'e}es notamment dans le domaine g{\'e}n{\'e}ral et dans des domaines sp{\'e}cialis{\'e}s (biologie) {P}rojet {RNTL} {E}xtra{P}lo{D}ocs }, collaboration={{E}xtra{P}lo{D}ocs }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00101492/en/}, } %% hal-00090410, version 1 %% http://hal.archives-ouvertes.fr/hal-00090410/en/ @unpublished{POIBEAU:2004:HAL-00090410:1, title={{T}ag{EN}, un syst{\`e}me de reconnaissance d'entit{\'e}s nomm{\'e}es}, author={{P}oibeau, {T}hierry and {B}erroyer, {J}ean-{F}ran{\c{c}}ois}, abstract={{S}oftware for named entity recognition (mainly in {F}rench and {E}nglish, can be adapted to various domains/languages/corpora)}, keywords={logiciel; entit{\'e}s nomm{\'e}es; traitement des langues; corpus}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={60 pages {L}ogiciel de reconnaissance d'entit{\'e}s nomm{\'e}es (principalement pour l'anglais et le fran{\c{c}}ais ; peut facilement {\^e}tre adapt{\'e} {\`a} d'autres domaines ou {\`a} d'autres langues) }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00090410/en/}, } %% hal-00085056, version 1 %% http://hal.archives-ouvertes.fr/hal-00085056/en/ @unpublished{RECANATI:2004:HAL-00085056:1, title={{D}iagrammes pour r{\'e}soudre le probl{\`e}me d'{E}instein et celui d'un joueur de {M}aster{M}ind}, author={{R}ecanati, {C}atherine}, abstract={{T}his report has been thought as a supplement to the article “{R}epr{\'e}sentations diagrammatiques: perspectives cognitives et computationnelles” ({C}. {R}ecanati, {I}ntellectica n°40, 2005). {W}e give here two detailed examples of the use of diagrams in human reasoning. {T}he main part reports observations made on the strategy of players in the game of {M}aster {M}ind.}, keywords={diagrammes; raisonnement diagrammatique; repr{\'e}sentations iconiques; repr{\'e}sentations analogiques; syst{\`e}me de repr{\'e}sentation h{\'e}t{\'e}rog{\`e}ne; syst{\`e}me inf{\'e}rentiel; mod{\'e}lisation cognitive;}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={29 pages. rapport interne {LIPN} {C}e rapport est une annexe au rapport “{R}epr{\'e}sentations diagrammatiques: perspectives cognitives et computationnelles” ({C}. {R}ecanati, paru dans {I}ntellectica n°40, 2005). {N}ous y d{\'e}veloppons deux exemples d'utilisation de diagrammes dans des raisonnements huma }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00085056/en/}, } %% hal-00094652, version 1 %% http://hal.archives-ouvertes.fr/hal-00094652/en/ @unpublished{ZARGAYOUNA:2004:HAL-00094652:1, title={{S}em{I}ndex: a model of semantic indexing on {XML} documents}, author={{Z}argayouna, {H}aifa and {S}alotti, {S}ylvie}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique pour la {M}{\'e}canique et les {S}ciences de l'{I}ng{\'e}nieur - {LIMSI} - {CNRS} : {UPR}3251 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{P}oster dans {P}roceedings of 26th {E}uropean {C}onference on {I}nformation {R}etrieval ({ECIR}'2004), vol2 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00094652/en/}, } %% hal-00091621, version 1 %% http://hal.archives-ouvertes.fr/hal-00091621/en/ @unpublished{KAYSER:2003:HAL-00091621:1, title={{D}es mod{\`e}les de nature diff{\'e}rente peuvent approcher une m{\^e}me r{\'e}alit{\'e} ; r{\'e}ponse {\`a} {G}iuseppe {L}ongo}, author={{K}ayser, {D}aniel}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{I}ntellectica n° 35 pp.175-177 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00091621/en/}, } %% hal-00084376, version 1 %% http://hal.archives-ouvertes.fr/hal-00084376/en/ @unpublished{THIONGANE:2003:HAL-00084376:1, title={{A}lgorithms and complexity for parametric 0-1 linear programs relative to the objective function}, author={{T}hiongane, {B}abacar and {N}agih, {A}nass and {P}lateau, {G}{\'e}rard}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{OCAD} {R}apport {LIPN} 2003-01 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00084376/en/}, } %% hal-00084758, version 1 %% http://hal.archives-ouvertes.fr/hal-00084758/en/ @unpublished{MOGBIL:2002:HAL-00084758:1, title={{A} bilateral-free notion of modules for {N}on commutative logic}, author={{M}ogbil, {V}irgile and {Q}uintijn, {P}uite}, abstract={{A} module is a piece of a proof structure. {A}n adequate notion of type describes its behaviour, e.g. as a set of relations on the border, not making any reference to the original formulas or links of the module. {T}wo modules connected along their border constitute a proof net precisely if their types are ``orthogonal''. {F}or {MLL} the longtrip criterion of [{G}irard87] leads to a definition of type as (the biorthogonal of) the set of permutations on the border induced by the switchings. {T}he correctness criterion for {MNL}, being based on bilateral longtrips ([{A}b{R}u00]), leads to a notion of type for {MNL} modules as a set of tuples of partial permutations and some relations on the border taking care of bilaterality and inclusion of the conclusions ([{A}brusci99]). {W}e will show that the bilaterality condition for {MNL} can be replaced by the requirement that the underlying commutative structure be a net. {I}n other words it suffices to take into account commutative switchings as well: sequential-3-free switchings which may contain next-left-switches. {T}his yields a definition of type as a pair of sets of decorated partial permutations on the border. {T}he separation into pairs prevents composition of partial permutations being induced by two ``non-compatible'' switchings. {T}he decoration is needed because for {MNL} it no longer holds that the longtrip meets all formulas, notably the border formulas and the conclusions. {F}inally, we generalize the composition of modules into an operation which yields modules again. {T}his corresponds to a theory of types (without any reference to proof structures). {T}hen all subsets of conclusions can be regarded as border formulas, while we compose two types only on the intersection of the not necessarily coinciding border.}, keywords={{L}inear logic ; {N}on commutative logic ; proof structure ; module ; correctness criterion ; bilateral longtrips ; partial permutations}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {D}ipartemento di filosofia - {U}niversit{\`a} degli studi {R}oma {III} }, note={manuscrit }, year={2002}, URL={http://hal.archives-ouvertes.fr/hal-00084758/en/}, } %% hal-00165372, version 1 %% http://hal.archives-ouvertes.fr/hal-00165372/en/ @unpublished{RECANATI:1991:HAL-00165372:1, title={{H}ow to be correct, lazy and efficient ?}, author={{R}ecanati, {C}atherine}, abstract={{T}his paper is an introduction to {L}ambdix, a lazy {L}isp interpreter implemented at the {R}esearch {L}aboratory of {P}aris {XI} {U}niversity ({L}aboratoire de {R}echerche en {I}nformatique, {O}rsay). {L}ambdix was devised in the course of an investigation into the relationship between the semantics of programming languages and their implementation; it was used to demonstrate that in the {L}isp domain, semantic correctness is consistent with efficiency, contrary to what has often been claimed. {T}he first part of the paper is an overview of well-known semantic difficulties encountered by {L}isp as well as an informal presentation of {L}ambdix; it is shown that the difficulties which {L}isp encouters do not arise in {L}ambdix. {T}he second part is about efficiency in implementation models. {I}t explains why {L}ambdix is better suited for lazy evaluation than previous models. {T}he section ends by giving comparative execution time tables.}, keywords={lazy evaluation; lambda interpreter; call by need;}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={21 pages rapport interne {LIPN} {P}resentation of {L}ambdix, a lazy lisp interpreter designed at the same time than {S}cheme at the end of the eighties. }, ARXIVID={0707.3807 }, year={1991}, URL={http://hal.archives-ouvertes.fr/hal-00165372/en/}, } %% hal-00165673, version 1 %% http://hal.archives-ouvertes.fr/hal-00165673/en/ @unpublished{RECANATI:1987:HAL-00165673:1, title={{T}owards a denotational semantics for a reflective {S}cheme - {A}n implementation of the towerless model}, author={{R}ecanati, {C}atherine and {D}eutsch, {A}lain}, abstract={{T}his paper presented a {F}lat {R}eflexive {S}cheme {I}nterpreter ({FRSI}) by means of which process migration was performed in a prototypic system for dynamic migration of programs. {T}he implementation of this interpreter was based on the semantical description of the underlying language. {A} conclusion of this paper is that it is not possible to give an usual structural denotational description of reflective languages. {N}evertheless, we have given here what we have called a relative denotational semantics of this language.}, keywords={reflective language; denotational semantics;}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={16 pages {T}echnical report 87/36 {A} denotational description of a reflective scheme {E}sprit project 1228 {C}hameleon }, collaboration={{E}sprit project 1228 {C}hameleon }, year={1987}, URL={http://hal.archives-ouvertes.fr/hal-00165673/en/}, } %% hal-00367636, version 1 %% http://hal.archives-ouvertes.fr/hal-00367636/en/ @unpublished{DUCHAMP:2009:HAL-00367636:1, title={{C}ombinatorial {D}eformations: {T}wisting and {P}erturbations}, author={{D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {T}ollu, {C}hristophe and {C}heballah, {H}. and {P}enson, {K}. {A}. and {K}oshevoy, {G}leb}, abstract={{T}he framework used to prove the multiplicative law deformation of the algebra of {F}eynman-{B}ender diagrams is a \textit{twisted shifted dual law} (in fact, twice). {W}e give here a clear interpretation of its two parameters. {T}he crossing parameter is a deformation of the tensor structure whereas the superposition parameters is a perturbation of the shuffle coproduct of {H}offman type which, in turn, can be interpreted as the diagonal restriction of a superproduct. {H}ere, we systematically detail these constructions.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {P}hysique {T}h{\'e}orique de la {M}ati{\`e}re {C}ondens{\'e}e - {LPTMC} - {CNRS} : {UMR}7600 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {C}entral {I}nstitute of {E}conomics and {M}athematics - {CEMI} - {R}ussian {A}cademy of {S}cience }, ARXIVID={0903.2101 }, year={2009}, URL={http://hal.archives-ouvertes.fr/hal-00367636/en/}, } %% hal-00353947, version 1 %% http://hal.archives-ouvertes.fr/hal-00353947/en/ @unpublished{DUCHAMP:2009:HAL-00353947:1, title={{S}ome {O}pen {P}roblems in {C}ombinatorial {P}hysics}, author={{D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {C}heballah, {H}.}, abstract={{W}e point out four problems which have arisen during the recent research in the domain of {C}ombinatorial {P}hysics.}, keywords={{F}eynman-{B}ender diagrams, {R}iordan-{S}heffer group, one-parameter group, {C}ombinatorial vector fields, approximate substitutions.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, ARXIVID={0901.2612 }, year={2009}, URL={http://hal.archives-ouvertes.fr/hal-00353947/en/}, } %% hal-00361379, version 2 %% http://hal.archives-ouvertes.fr/hal-00361379/en/ @unpublished{POINSOT:2009:HAL-00361379:2, title={{A} formal calculus on the {R}iordan skew algebra}, author={{P}oinsot, {L}aurent and {D}uchamp, {G}{\'e}rard}, abstract={{I}n this paper the {R}iordan skew algebra is defined as the semi-direct product "algebra" of the formal power series and the principal ideal generated by the variable x. {T}he {R}iordan group can be seen as a subgroup of invertible elements of the {R}iordan skew algebra. {I}t is shown that a formal calculus, playing the same role as the holomorphic calculi for {B}anach or {F}r{\'e}chet algebras, can be defined on such an algebraic structure. {T}his makes it possible to define in particular some generalized powers for elements of the {R}iordan group.}, keywords={formal power series; {R}iordan group; formal substitution;}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={23 p. }, ARXIVID={0902.2853 }, year={2009}, URL={http://hal.archives-ouvertes.fr/hal-00361379/en/}, } %% hal-00348664, version 1 %% http://hal.archives-ouvertes.fr/hal-00348664/en/ @unpublished{BASSINO:2008:HAL-00348664:1, title={{E}numeration of {P}in-{P}ermutations}, author={{B}assino, {F}r{\'e}d{\'e}rique and {B}ouvel, {M}athilde and {R}ossin, {D}ominique}, abstract={{I}n this paper, we study the class of pin-permutations, that is to say of permutations having a pin representation. {T}his class has been recently introduced in an article of {B}rignall, {H}uczinska and {V}atter, where it is used to find properties (algebraicity of the generating function, decidability of membership) of classes of permutations, depending on the simple permutations this class contains. {W}e give a recursive characterization of the substitution decomposition trees of pin-permutations, which allows us to compute the generating function of this class, and consequently to prove, as it is conjectured, the rationality of this generating function. {M}oreover, we show that the basis of the pin-permutation class is infinite.}, keywords={{P}ermutation, {G}enerating function, {P}ermutation {P}attern}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'informatique {A}lgorithmique : {F}ondements et {A}pplications - {LIAFA} - {CNRS} : {UMR}7089 - {U}niversit{\'e} {D}enis {D}iderot - {P}aris {VII} }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00348664/en/}, } %% hal-00326880, version 1 %% http://hal.archives-ouvertes.fr/hal-00326880/en/ @unpublished{BOUSSICAULT:2008:HAL-00326880:1, title={{H}yperdeterminantal computation for the {L}aughlin wave function}, author={{B}oussicault, {A}drien and {L}uque, {J}ean-{G}abriel and {T}ollu, {C}hristophe}, abstract={{T}he decomposition of the {L}aughlin wave function in the {S}later orthogonal basis appears in the discussion on the second-quantized form of the {L}aughlin states and is straightforwardly equivalent to the decomposition of the even powers of the {V}andermonde determinants in the {S}chur basis. {S}uch a computation is notoriously difficult and the coefficients of the expansion have not yet been interpreted. {I}n our paper, we give an expression of these coefficients in terms of hyperdeterminants of sparse tensors. {W}e use this result to construct an algorithm allowing to compute one coefficient of the development without computing the others. {T}hanks to a program in {\tt {C}}, we performed the calculation for the square of the {V}andermonde up to an alphabet of eleven lettres.}, keywords={{H}yperdeterminant;{L}aughlin wave function;even powers of the {V}andermonde}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{MSC}:15{A}69,05{E}05,81-08,81{V}70 }, ARXIVID={0810.1012 }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00326880/en/}, } %% hal-00155565, version 2 %% http://hal.archives-ouvertes.fr/hal-00155565/en/ @unpublished{CARDINAL:2008:HAL-00155565:2, title={{M}inimum {S}um {E}dge {C}olorings of {M}ulticycles}, author={{C}ardinal, {J}ean and {R}avelomanana, {V}lady and {V}alencia-{P}abon, {M}ario}, abstract={{I}n the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigned to the edges is minimum. {T}he {\em chromatic edge strength} of a graph is the minimum number of colors required in a minimum sum edge coloring of this graph. {W}e study the case of multicycles, defined as cycles with parallel edges, and give a closed-form expression for the chromatic edge strength of a multicycle, thereby extending a theorem due to {B}erge. {I}t is shown that the minimum sum can be achieved with a number of colors equal to the chromatic index. {W}e also propose simple algorithms for finding a minimum sum edge coloring of a multicycle. {F}inally, these results are generalized to a large family of minimum cost coloring problems.}, keywords={graph coloring; minimum sum coloring; chromatic strength;}, language={{A}nglais}, affiliation={{U}niversit{\'e} {L}ibre de {B}ruxelles - {ULB} - {U}niversit{\'e} {L}ibre de {B}ruxelles - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{R}apport interne. {G}.2.2 }, ARXIVID={0706.3848 }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00155565/en/}, } %% hal-00249977, version 1 %% http://hal.archives-ouvertes.fr/hal-00249977/en/ @unpublished{CHEBALLAH:2008:HAL-00249977:1, title={{A}pproximate substitutions and the normal ordering problem}, author={{C}heballah, {H}. and {D}uchamp, {G}. {H}. {E}. and {P}enson, {K}. {A}.}, abstract={{I}n this paper, we show that the infinite generalised {S}tirling matrices associated with boson strings with one annihilation operator are projective limits of approximate substitutions, the latter being characterised by a finite set of algebraic equations.}, keywords={{B}onson strings, infinite matrix, generalized {S}tirling number, projective limit}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {P}hysique {T}h{\'e}orique de la {M}ati{\`e}re {C}ondens{\'e}e - {LPTMC} - {CNRS} : {UMR}7600 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, note={{ACM} :{G}.2.1, {PACS} : 02.10.{O}x, {MSC} : 05{E}20 }, ARXIVID={0802.1162 }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00249977/en/}, } %% hal-00332398, version 1 %% http://hal.archives-ouvertes.fr/hal-00332398/en/ @unpublished{DUCHAMP:2008:HAL-00332398:1, title={{R}ational {H}adamard products via {Q}uantum {D}iagonal {O}perators}, author={{D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {G}oodenough, {S}ilvia and {P}enson, {K}arol}, abstract={{W}e use the remark that, through {B}argmann-{F}ock representation, diagonal operators of the {H}eisenberg-{W}eyl algebra are scalars for the {H}adamard product to give some properties (like the stability of periodic fonctions) of the {H}adamard product by a rational fraction. {I}n particular, we provide through this way explicit formulas for the multiplication table of the {H}adamard product in the algebra of rational functions in $\{C}[[z]]$.}, keywords={{H}eisenberg-{W}eyl algebra, {D}iagonal {O}perators}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {P}hysique {T}h{\'e}orique de la {M}ati{\`e}re {C}ondens{\'e}e - {LPTMC} - {CNRS} : {UMR}7600 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, ARXIVID={0810.3641 }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00332398/en/}, } %% hal-00325270, version 1 %% http://hal.archives-ouvertes.fr/hal-00325270/en/ @unpublished{DUCHAMP:2008:HAL-00325270:1, title={{N}oncommutative {S}ymmetric {F}unctions {VII}: {F}ree {Q}uasi-{S}ymmetric {F}unctions {R}evisited}, author={{D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {H}ivert, {F}. and {N}ovelli, {J}ean-{C}hristophe and {T}hibon, {J}ean-{Y}ves}, abstract={{W}e prove a {C}auchy identity for free quasi-symmetric functions and apply it to the study of various bases. {A} free {W}eyl formula and a generalization of the splitting formula are also discussed.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique, de {T}raitement de l'{I}nformation et des {S}yst{\`e}mes - {LITIS} - {U}niversit{\'e} du {H}avre - {U}niversit{\'e} de {R}ouen - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es de {R}ouen - {L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique }, note={21 pages }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00325270/en/}, } %% hal-00232877, version 1 %% http://hal.archives-ouvertes.fr/hal-00232877/en/ @unpublished{DUCHAMP:2008:HAL-00232877:1, title={{H}opf {A}lgebras in {G}eneral and in {C}ombinatorial {P}hysics: a practical introduction}, author={{D}uchamp, {G}. {H}. {E}. and {B}lasiak, {P}. and {H}orzela, {A}. and {P}enson, {K}. {A}. and {S}olomon, {A}. {I}.}, abstract={{T}his tutorial is intended to give an accessible introduction to {H}opf algebras. {T}he mathematical context is that of representation theory, and we also illustrate the structures with examples taken from combinatorics and quantum physics, showing that in this latter case the axioms of {H}opf algebra arise naturally. {T}he text contains many exercises, some taken from physics, aimed at expanding and exemplifying the concepts introduced.}, keywords={{H}opf {A}lgebras, {R}epresentative {F}unctions, {R}epresentation {T}heory, {A}ntipode}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {H}. {N}iewodniczanski {I}nstitute of {N}uclear {P}hysics - {IFJ}-{PAN} - {P}olish {A}cademy of {S}ciences - {L}aboratoire de {P}hysique {T}h{\'e}orique de la {M}ati{\`e}re {C}ondens{\'e}e - {LPTMC} - {CNRS} : {UMR}7600 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {P}hysics and {A}stronomy {D}epartment - {T}he {O}pen {U}niversity }, note={{ACM}:{G}.2.1,{PACS}: 0.2, {MSC}: 81{R}99 }, ARXIVID={0802.0249 }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00232877/en/}, } %% hal-00360894, version 1 %% http://hal.archives-ouvertes.fr/hal-00360894/en/ @unpublished{JACOBEDENAUROIS:2008:HAL-00360894:1, title={{C}orrectness of {L}inear {L}ogic {P}roof {S}tructures is {NL}-{C}omplete}, author={{J}acob{\'e} {D}e {N}aurois, {P}aulin and {M}ogbil, {V}irgile}, abstract={{W}e provide new correctness criteria for all fragments (multiplicative, exponential, additive) of linear logic. {W}e use these criteria for proving that deciding the correctness of a linear logic proof structure is {NL}-complete.}, keywords={{C}omplexity {C}lasses; {C}orrectness {C}riterion; {L}inear {L}ogic; {N}ondeterministic {L}ogspace}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={23 pages rapport interne {LIPN} }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00360894/en/}, } %% hal-00278943, version 1 %% http://hal.archives-ouvertes.fr/hal-00278943/en/ @unpublished{MOYEN:2008:HAL-00278943:1, title={{SCT} and the idempotence condition}, author={{M}oyen, {J}ean-{Y}ves}, abstract={{T}hese notes show how to get rid of the idempotence condition ({G}={G};{G}) in (delta)-{S}ize {C}hange {T}ermination.}, keywords={{I}mplicit {C}omputational {C}omplexity ; {S}ize {C}hange {P}rinciple}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={5 pages rapport interne {LIPN} }, year={2008}, URL={http://hal.archives-ouvertes.fr/hal-00278943/en/}, } %% hal-00174878, version 1 %% http://hal.archives-ouvertes.fr/hal-00174878/en/ @unpublished{ALFANDARI:2007:HAL-00174878:1, title={{A}pproximation of the {C}onstrained {P}ath {C}overing {P}roblem}, author={{A}lfandari, {L}aurent}, abstract={{W}e study a generic covering problem frequently met in transportation planning. {T}he problem is to cover a set of tasks by constrained paths, representing routings of commodities, so that the total cost of selected paths is minimal. {I}n this paper, paths are constrained to have limited weight and limited number of tasks. {W}e show that the generic problem is {NP}-hard and that a greedy heuristic using dynamic programming at each step achieves an approximation ratio of ln(d), where d is the maximum number of tasks of a path.}, keywords={transportation planning ; constrained path ; set covering ; dynamic programming ; approximation}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{R}apport de recherche {LIPN} }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00174878/en/}, } %% hal-00273889, version 1 %% http://hal.archives-ouvertes.fr/hal-00273889/en/ @unpublished{CUCKER:2007:HAL-00273889:1, title={{P}arallel {T}ime and {Q}uantifier {P}rfixes}, author={{C}ucker, {F}elipe and {J}acob{\'e} {D}e {N}aurois, {P}aulin}, abstract={{W}e characterize the amount of alternation between blocks of digital quanti\&\#64257;ers (having both existential and universal), blocks of real existential quanti\&\#64257;ers, and blocks of real universal quanti\&\#64257;ers that can be decided in parallel polynomial time over the reals. {W}e do so under the assumption that blocks have a uniform bound in their size, both for the case of this bound to be polynomial and constant. {A}s a result of this characterization (and as a stepping stone towards it) we prove a real version of {S}avitch {T}heorem.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00273889/en/}, } %% hal-00153106, version 1 %% http://hal.archives-ouvertes.fr/hal-00153106/en/ @unpublished{DOAN:2007:HAL-00153106:1, title={{A}n energy-efficient initialization algorithm for random radio networks}, author={{D}oan, {B}inh {T}hanh and {L}avault, {C}hristian and {O}lariu, {S}tephan and {R}avelomanana, {V}lady}, abstract={{A} radio network is a distributed system consisting of a large number of tiny sensors with low-power transceivers and no central controller. {O}ne of the most important problems in such networks is to minimize the energy consumption, and maximize the network lifetime. {I}n the initialization problem (also known as naming) each of the $n$ indistinguishable (anonymous) nodes in a given network is assigned a unique identifier, ranging from $1$ to $n$. {W}e consider a network where $n$ nodes (processors) are randomly deployed in a square (resp. a cube) ${X}$. {T}he network is assumed to be synchronous and the time to be slotted. {T}wo nodes can communicate only if they are at a distance of at most $r$ from each other ($r$ is the transmitting/receiving range). {M}oreover, if two or more neighbors of a processor $u$ are transmitting concurrently at the same time slot, $u$ cannot receive either of their messages (collision). {W}e suppose also $n$ and $|{X}|$ represent the only topological knowledge in each node. {T}o solve the initialization problem, we propose an energy-efficient randomized algorithm running in at most $\mathcal{{O}}\l(n^{3/4}\,\log{(n)}^{1/4}\r)$ time slots, with no station being awake for more than $\mathcal{{O}}\l(n^{1/4}\,\log{(n)}^{3/4}\r)$ time slots.}, keywords={{S}ensor networks, energy efficient algorithms, naming, self-organization, random geometric graphs}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}omp. {S}cience {D}epart. {O}ld {D}ominion {U}niversity - {ODU} - {O}ld {D}ominion {U}niversity }, note={{F}.2 }, collaboration={{AUF} {V}iet-{N}am, {O}ld {D}ominion {U}niversity, {P}aris {N}ord }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153106/en/}, } %% hal-00193180, version 2 %% http://hal.archives-ouvertes.fr/hal-00193180/en/ @unpublished{DUCHAMP:2007:HAL-00193180:2, title={{S}weedler's duals and {S}ch{\"u}tzenberger's calculus}, author={{D}uchamp, {G}{\'e}rard {H}. {E}. and {T}ollu, {C}hristophe}, abstract={{W}e describe the problem of {S}weedler's duals for bialgebras as essentially characterizing the domain of the transpose of the multiplication. {T}his domain is the set of what could be called ``representative linear forms'' which are the elements of the algebraic dual which are also representative on the multiplicative semigroup of the algebra. {W}hen the algebra is free, this notion is indeed equivalent to that of rational functions of automata theory. {F}or the sake of applications, the range of coefficients has been considerably broadened, i.e. extended to semirings, so that the results could be specialized to the boolean and multiplicity cases. {T}his requires some caution (use of ``positive formulas'', iteration replacing inversion, stable submodules replacing finite-rank families for instance). {F}or the theory and its applications has been created a rational calculus which can, in return, be applied to harness {S}weedler's duals. {A} new theorem of rational closure and application to {H}opf algebras of use in {P}hysics and {C}ombinatorics is provided. {T}he concrete use of this ``calculus'' is eventually illustrated on an example.}, keywords={{S}weedler's dual, representative functions, automata, semiring, semigroup}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, ARXIVID={0712.0125 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00193180/en/}, } %% hal-00142496, version 2 %% http://hal.archives-ouvertes.fr/hal-00142496/en/ @unpublished{DUCHAMP:2007:HAL-00142496:2, title={{A} {T}hree {P}arameter {H}opf {D}eformation of the {A}lgebra of {F}eynman-like {D}iagrams}, author={{D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {B}lasiak, {P}awel and {H}orzela, {A}ndrzej and {P}enson, {K}arol {A}. and {S}olomon, {A}llan {I}.}, abstract={{W}e construct a three-parameter deformation of the {H}opf algebra $\{LDIAG}$. {T}his is the algebra that appears in an expansion in terms of {F}eynman-like diagrams of the {\em product formula} in a simplified version of {Q}uantum {F}ield {T}heory. {T}his new algebra is a true {H}opf deformation which reduces to $\{LDIAG}$ for some parameter values and to the algebra of {M}atrix {Q}uasi-{S}ymmetric {F}unctions ($\{MQS}$) for others, and thus relates $\{LDIAG}$ to other {H}opf algebras of contemporary physics. {M}oreover, there is an onto linear mapping preserving products from our algebra to the algebra of {E}uler-{Z}agier sums.}, keywords={{H}opf algebra; {F}eynman-like {D}iagram; {H}opfdeformation; {Q}uasi-{S}ymmetric {F}unctions; {E}uler-{Z}agier sums}, language={{A}nglais}, affiliation={{L}aboratoire de {P}hysique {T}h{\'e}orique de la {M}ati{\`e}re {C}ondens{\'e}e - {LPTMC} - {CNRS} : {UMR}7600 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {H}. {N}iewodniczanski {I}nstitute of {N}uclear {P}hysics - {P}olish {A}cademy of {S}ciences - {P}hysics and {A}stronomy {D}epartment - {T}he {O}pen {U}niversity }, note={81{R}10; 81{R}50 }, ARXIVID={0704.2522 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00142496/en/}, } %% hal-00198805, version 1 %% http://hal.archives-ouvertes.fr/hal-00198805/en/ @unpublished{FOUQUERE:2007:HAL-00198805:1, title={{L}ogic {P}rogramming {R}evisited}, author={{F}ouquer{\'e}, {C}hristophe and {M}ogbil, {V}irgile}, abstract={{T}he so famous {P}rolog paradigm is based on the refutation of a goal, i.e. inferring the empty clause by means of the resolution principle. {S}witching to sequent calculus, this reduces to a cut-free proof search of the empty formula using the program clauses and the negation of the goal as hypotheses. {I}t has already been applied to full {L}inear {L}ogic. {I}n this paper, we switch from sequent calculus to graph computation by means of bipolar modules. {W}e explain in which extent the use of such structures in the framework of {L}inear {L}ogic helps to enlarge logic programming towards a distributed backward and forward computation paradigm.}, keywords={linear logic, proof-nets, logic programming, focalization, proof search, parallel execution}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={15 pages rapport interne {LIPN} }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00198805/en/}, } %% hal-00156386, version 1 %% http://hal.archives-ouvertes.fr/hal-00156386/en/ @unpublished{FOUQUERE:2007:HAL-00156386:1, title={{A} {S}equent {C}alculus for {M}odelling {I}nterferences}, author={{F}ouquer{\'e}, {C}hristophe}, abstract={{A} logic calculus is presented that is a conservative extension of linear logic. {T}he motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. {T}he calculus includes two new connectives to deal with multisequent structures and has the cut-elimination property. {E}xtensions are proposed that give first results concerning our objectives.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, ARXIVID={0706.3341 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00156386/en/}, } %% hal-00122981, version 2 %% http://hal.archives-ouvertes.fr/hal-00122981/en/ @unpublished{MOGBIL:2007:HAL-00122981:2, title={{N}on deterministic {L}inear logic: application to {B}oolean circuits}, author={{M}ogbil, {V}irgile}, abstract={{F}ollowing the {C}urry-{H}oward isomorphism but for parallel model of computation, we study proof nets of the non-deterministic multiplicative {L}inear logic, i.e. with an explicit rule to sum up (as done in [{M}au03]). {W}e define nm{BN} (k(n)) the uniform families of multiplicative {B}oolean proof nets with {O}(k(n)) amount of explicit nondeterminism. {F}or k(n) respectively polynomial and constant, we obtain a {C}urry-{H}oward characterization of the complexity class respectively {NP} and {NC} (the efficiently parallelizable functions). {I}f k(n) is polylogarithmic then we characterize the class {NNC} (polylog), that is, {NC} with polylogarithmic amount of non-deterministic variables. {T}he depth of a proof net being defined to be the maximal logical depth of cut formulas in it, the cut-elimination corresponds to {B}oolean circuit evaluation and reciprocally.}, keywords={{I}mplicit computational complexity; {L}inear logic; {N}ondeterministic {B}oolean circuits; {N}ondeterministic {B}oolean proof nets; {P}arallel cut-elimination}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={16 pages rapport interne {LIPN} {ANR} {NO}-{C}o{ST} }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00122981/en/}, } %% hal-00107145, version 3 %% http://hal.archives-ouvertes.fr/hal-00107145/en/ @unpublished{MOYEN:2007:HAL-00107145:3, title={{R}esource {C}ontrol {G}raphs}, author={{M}oyen, {J}ean-{Y}ves}, abstract={{R}esource {C}ontrol {G}raphs can be seen as an abstract representation of programs. {E}ach state of the program is abstracted as its size, and each instruction is abstracted as the effects it has on the size whenever it is executed. {T}he {C}ontrol {F}low {G}raph of the programs gives indications on how the instructions might be combined during an execution. {T}ermination proofs usually work by finding a decrease in some well-founded order. {H}ere, the sizes of states are ordered and such kind of decrease is also found. {T}his allows to build termination proofs similar to the ones in {S}ize {C}hange {T}ermination. {B}ut the size of states can also be used to represent the space used by the program at each point. {T}his leads to an alternate characterisation of the {N}on {S}ize {I}ncreasing programs, that is the ones that can compute without allocating new memory. {T}his new tool is able to encompass several existing analysis and similarities with other studies hint that even more analysis might be expressable in this framework thus giving hopes for a generic tool for studying programs.}, keywords={{A}bstraction; implicit complexity; non-size increasing; program analysis; size change termination; termination}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={38 pages. {E}n r{\'e}vision {\`a} {ACM} {T}ransactions on {C}omputationnal {L}ogic {D}.2.4 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00107145/en/}, } %% hal-00145252, version 1 %% http://hal.archives-ouvertes.fr/hal-00145252/en/ @unpublished{OGIEVETSKY:2007:HAL-00145252:1, title={{R}-matrices in {R}ime}, author={{O}gievetsky, {O}. and {P}opov, {T}.}, abstract={{W}e replace the ice {A}nsatz on matrix solutions of the {Y}ang-{B}axter equation by a weaker condition which we call "rime". {R}ime solutions include the standard {D}rinfeld-{J}imbo {R}-matrix. {S}olutions of the {Y}ang--{B}axter equation within the rime {A}nsatz which are maximally different from the standard one we call "strict rime". {A} strict rime non-unitary solution is parameterized by a projective vector. {W}e show that this solution transforms to the {C}remmer-{G}ervais {R}-matrix by a change of basis with a matrix containing symmetric functions in the components of the parameterizing vector. {A} strict unitary solution (the rime {A}nsatz is well adapted for taking a unitary limit) is shown to be equivalent to a quantization of a classical "boundary" r-matrix of {G}erstenhaber and {G}iaquinto. {W}e analyze the structure of the elementary rime blocks and find, as a by-product, that all non-standard {R}-matrices of {GL}(1|1)-type can be uniformly described in a rime form. {W}e discuss then relations to the {B}ezout operators and the non-homogeneous associative classical {Y}ang-{B}axter equation. {W}e classify the rime {P}oisson brackets: they form a 3-dimensional pencil. {A} normal form of each individual member of the pencil depends on the discriminant of a certain quadratic polynomial. {F}or the standard {D}rinfeld-{J}imbo solution, there is a choice of the multiparameters, for which it can be non-trivially rimed. {H}owever, not every {B}elavin-{D}rinfeld triple admits a choice of the multiparameters for which it can be rimed. {W}e give a minimal example.}, language={{A}nglais}, affiliation={{C}entre de {P}hysique {T}h{\'e}orique - {CPT} - {CNRS} : {UMR}6207 - {CNRS} : {FR}2291 - {U}niversit{\'e} de {P}rovence - {A}ix-{M}arseille {I} - {U}niversit{\'e} de la {M}{\'e}diterran{\'e}e - {A}ix-{M}arseille {II} - {U}niversit{\'e} du {S}ud - {T}oulon - {V}ar - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={38 pages }, ARXIVID={0704.1947 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00145252/en/}, } %% hal-00153936, version 1 %% http://hal.archives-ouvertes.fr/hal-00153936/en/ @unpublished{RAVELOMANANA:2007:HAL-00153936:1, title={{ANOTHER} {PROOF} {OF} {WRIGHT}'{S} {INEQUALITIES}}, author={{R}avelomanana, {V}lady}, abstract={{W}e present a short way of proving the inequalities obtained by {W}right in [{J}ournal of {G}raph {T}heory, 4: 393 - 407 (1980)] concerning the number of connected graphs with $\ell$ edges more than vertices.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, ARXIVID={0706.1665 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00153936/en/}, } %% halshs-00152987, version 1 %% http://halshs.archives-ouvertes.fr/halshs-00152987/en/ @unpublished{SCHWER:2007:HALSHS-00152987:1, title={{O}rganisation des temps verbaux selon {M}arc {W}ilmet dans le formalisme des {S}-langages et des structures d'ordre associ{\'e}es}, author={{S}chwer, {S}ylviane}, abstract={{D}ans cet article nous appliquons sur le cas des temps verbaux de {M}arc {W}ilmet la d{\'e}marche suivante : {\`a} l'aide de la formalisation par les {S}-langages d'un mod{\`e}le linguistique des temps verbaux, en extraire des propri{\'e}t{\'e}s alg{\'e}briques et combinatoires que nous {\'e}tudions d'un point de vue math{\'e}matique, ce qui conduit {\`a} faire des remarques sur la coh{\'e}rence structurelle du mod{\`e}le et mettre en {\'e}vidence des ph{\'e}nom{\`e}nes qui peuvent en retour questionner le linguiste. {R}emarquons que le mod{\`e}le math{\'e}matique utilis{\'e}, autour des {S}-langages, se fonde sur l'hypoth{\`e}se que la langue ne traite pas du temps en tant que tel, mais de relations temporelles.}, keywords={{T}emps verbaux, langages formels, ordres et treillis}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{R}apport {I}nterne {LIPN} }, year={2007}, URL={http://halshs.archives-ouvertes.fr/halshs-00152987/en/}, } %% halshs-00132549, version 1 %% http://halshs.archives-ouvertes.fr/halshs-00132549/en/ @unpublished{SCHWER:2007:HALSHS-00132549:1, title={{R}epr{\'e}sentation math{\'e}matique du temps : apr{\`e}s {R}eichenbach}, author={{S}chwer, {S}ylviane}, abstract={{L}a plupart des mod{\`e}les formels du temps pour la linguistique assimilent in fine « la ligne m{\'e}taphorique du temps » {\`a} la droite num{\'e}rique des nombres r{\'e}els. {P}ourtant, beaucoup de linguistes ont adopt{\'e} une approche relationnelle de la temporalit{\'e}, se fondant sur les travaux de {R}eichenbach (1947). {N}ous montrons ici qu'il existe un mod{\`e}le math{\'e}matique qui suit de mani{\`e}re naturelle cette approche relationnelle. {I}l s'agit du mod{\`e}le des {S}-langages, fond{\'e} sur la th{\'e}orie des langages formels. {E}n effet, ce mod{\`e}le (i) capte les deux relations temporelles fondamentales de pr{\'e}c{\'e}dence et de simultan{\'e}it{\'e}, (ii) permet de repr{\'e}senter {\`a} la fois les propri{\'e}t{\'e}s de discr{\'e}tion et de continuit{\'e} des objets linguistiques, (iii) fournit les op{\'e}rateurs alg{\'e}briques n{\'e}cessaires au raisonnement temporel sans recours au temps d{\'e}fini par une th{\'e}orie logique.}, keywords={repr{\'e}sentation et raisonnement temporel}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{A}rticle {\`a} para{\^i}tre dans la revue {T}ranel. }, year={2007}, URL={http://halshs.archives-ouvertes.fr/halshs-00132549/en/}, } %% hal-00147704, version 1 %% http://hal.archives-ouvertes.fr/hal-00147704/en/ @unpublished{TOUATI:2007:HAL-00147704:1, title={{M}{\'e}thodes de d{\'e}composition pour l'optimisation discr{\`e}te}, author={{T}ouati, {N}ora and {L}{\'e}tocart, {L}ucas and {N}agih, {A}nass}, abstract={{M}any practical problems are modelled by integer programs. {T}he difficulty of their resolution lies in the characterization of the feasible domain. {F}ace to this difficulty, the researchers directed themselves towards approximations of this domain by decomposing the problem. {T}he decomposition generally results in the relaxation of the integrality conditions on a subset of constraints. {D}ecomposition methods differ from the bound quality and from the resolution methods used like their complexity. {W}e present in this report some of these methods, analyze their strong and weak points and finally, establish a synthesis showing the relation between some methods considered to be different.}, keywords={{I}nteger {P}rogramming; decomposition methods}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique {T}h{\'e}orique et {A}ppliqu{\'e}e - {LITA} - {U}niversit{\'e} {P}aul {V}erlaine - {M}etz }, note={30 pages lipn-2007-1 }, year={2007}, URL={http://hal.archives-ouvertes.fr/hal-00147704/en/}, } %% hal-00101549, version 1 %% http://hal.archives-ouvertes.fr/hal-00101549/en/ @unpublished{ALPHONSE:2006:HAL-00101549:1, title={{D}eliverable {D}5.1: {R}eport on method and language for the production of the augmented document representations}, author={{A}lphonse, {E}rick and {A}ubin, {S}ophie and {D}erivi{\`e}re, {J}ulien and {H}amon, {T}hierry and {M}ladenic, {D}unja and {N}azarenko, {A}deline and {N}{\'e}dellec, {C}laire and {P}oibeau, {T}hierry and {W}eissenbacher, {D}avy and {Z}hou, {Q}iang}, abstract={{T}his deliverable describes the specifications of the {N}atural {L}anguage {P}rocessing line to be developed within the {W}ork {P}ackage 5 ({WP}5) in the {A}lvis {P}roject. {T}he {WP}5 is in charge of the {NLP} aspects of the {I}nformation {R}etrieval process. {I}ts main objective is to enrich and normalise the crawled documents provided by the {WP}7 prior to their indexing. {I}n this respect, {WP}5 output is a set of annotated documents, which are provided either to {WP}2 as input of its probabilistic model, which in turn delivers document to {WP}3 for indexing, or to {WP}6 as acquisition corpora. {T}his deliverable presents the objectives of the {WP}5 process for document annotation. {I}t introduces the basic notions of linguistics that are used in the following. {T}he core section presents the various types of annotations that {WP}5 is expected to produce and describes the format in which these annotations are encoded. {I}n addition to that, this deliverable also gives an overview of the {WP}5 processing line, its architecture for the various languages studied in {A}lvis and the various {NLP} components that produce annotated documents.}, keywords={{N}atural {L}anguage processing, linguistic annotations, stand-off annotations, {XML}}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {U}nit{\'e} {M}ath{\'e}matique {I}nformatique et {G}{\'e}nome - {MIG} - {INRA} - {D}epartment of {K}nowledge {T}echnology - {KT} - {J}ozef {S}tefan {I}nstitute - {D}epartment of {C}omputer {S}cience and {T}echnology - {CST} - {T}singhua {U}niversity }, note={{H}.3.1 {ALVIS} }, collaboration={{ALVIS} {STREP}/{IST} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00101549/en/}, } %% hal-00102406, version 1 %% http://hal.archives-ouvertes.fr/hal-00102406/en/ @unpublished{BECHER:2006:HAL-00102406:1, title={{R}apport technique du projet {OGRE}}, author={{B}{\'e}cher, {G}{\'e}rard and {E}njalbert, {P}atrice and {F}iev{\'e}, {E}stelle and {G}osselin, {L}aurent and {L}{\'e}vy, {F}ran{\c{c}}ois and {L}igozat, {G}{\'e}rard}, abstract={{T}his repport concerns automatic understanding of (french) iterative sentences, i.e. sentences where one single verb has to be interpreted by a more or less regular plurality of events. {A} linguistic analysis is proposed along an extension of {R}eichenbach's theory, several formal representations are considered and a corpus of 18000 newspaper extracts is described.}, keywords={aspectualit{\'e} ; phrases it{\'e}ratives ; intervalle de proc{\`e}s}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique pour la {M}{\'e}canique et les {S}ciences de l'{I}ng{\'e}nieur - {LIMSI} - {CNRS} : {UPR}3251 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} - {G}roupe de {R}echerche en {I}nformatique, {I}mage, {A}utomatique et {I}nstrumentation de {C}aen - {GREYC} - {CNRS} : {UMR}6072 - {U}niversit{\'e} de {C}aen - {E}cole {N}ationale {S}up{\'e}rieure d'{I}ng{\'e}nieurs de {C}aen - {D}ynamiques sociolangagi{\`e}res - {DS} - {CNRS} : {FRE}2787 - {U}niversit{\'e} de {R}ouen }, note={92 pages {PI} {TCAN} du {CNRS} }, collaboration={programme interdisciplinaire {TCAN} du {CNRS} }, ARXIVID={cs.AI/0610004 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00102406/en/}, } %% hal-00084639, version 1 %% http://hal.archives-ouvertes.fr/hal-00084639/en/ @unpublished{BENABDESLEM:2006:HAL-00084639:1, title={{A}n incremental {SOM} for web navigation patterns clustering}, author={{B}enabdeslem, {K}halid and {B}ennani, {Y}oun{\`e}s}, abstract={{I}n this paper, we present a new clustering method which makes incremental the construction of an unsupervised neural model ({S}elf {O}rganizing {M}ap: {SOM}). {I}n other words, the method is computed with both, the initial model based on the a priori available data and the data which arrive dynamically in the time. {T}his approach is validated over web navigation data and it is compared to classical neural clustering applied to the same data.}, keywords={{I}ncremental clustering, {SOM}, learning, unsupervised learning, {W}ebmining.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084639/en/}, } %% hal-00085032, version 1 %% http://hal.archives-ouvertes.fr/hal-00085032/en/ @unpublished{BENTZ:2006:HAL-00085032:1, title={{M}ulticut and integral multiflow in rings}, author={{B}entz, {C}{\'e}dric and {C}osta, {M}arie-{C}hristine and {L}{\'e}tocart, {L}ucas and {R}oupin, {F}r{\'e}d{\'e}ric}, abstract={{W}e show how to solve in polynomial time the multicut and the maximum integral multiow problems in rings. {F}or the latter problem we generalize an approach proposed by {S}ai {A}nand and {E}r- lebach for special cases of the call control problem in ring networks. {M}oreover, we give linear-time procedures to solve both problems in rings with uniform capacities.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00085032/en/}, } %% hal-00091450, version 2 %% http://hal.archives-ouvertes.fr/hal-00091450/en/ @unpublished{BOUDES:2006:HAL-00091450:2, title={{N}on uniform (hyper/multi)coherence spaces}, author={{B}oudes, {P}ierre}, abstract={{I}n (hyper)coherence semantics, proofs/terms are cliques in (hyper)graphs. {I}ntuitively, vertices represent results of computations and the edge relation witnesses the ability of being assembled into a same piece of data or a same (strongly) stable function, at arrow types. {I}n (hyper)coherence semantics, the argument of a (strongly) stable functional is always a (strongly) stable function. {A}s a consequence, comparatively to the relational semantics, where there is no edge relation, some vertices are missing. {R}ecovering these vertices is essential for the purpose of reconstructing proofs/terms from their interpretations. {I}t shall also be useful for the comparison with other semantics, like game semantics. {I}n [{BE}01], {B}ucciarelli and {E}hrhard introduced a so called non uniform coherence space semantics where no vertex is missing. {B}y constructing the co-free exponential we set a new version of this last semantics, together with non uniform versions of hypercoherences and multicoherences, a new semantics where an edge is a finite multiset. {T}hanks to the co-free construction, these non uniform semantics are deterministic in the sense that the intersection of a clique and of an anti-clique contains at most one vertex, a result of interaction, and extensionally collapse onto the corresponding uniform semantics.}, keywords={linear logic; denotational semantics; coherence spaces; hypercoherences}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={39 pages {A}ccept{\'e} pour publication {\`a} {MSCS} {F}.3.2 }, ARXIVID={cs.LO/0609021 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00091450/en/}, } %% hal-00086995, version 1 %% http://hal.archives-ouvertes.fr/hal-00086995/en/ @unpublished{BOUTHINON:2006:HAL-00086995:1, title={{L}ogical settings for concept learning from incomplete examples in {F}irst {O}rder {L}ogic.}, author={{B}outhinon, {D}ominique and {S}oldano, {H}enry and {V}entos, {V}{\'e}ronique}, abstract={{W}e investigate here concept learning from incomplete examples. {O}ur first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with data incompleteness. {M}ore precisely we are interested in extending the learning from interpretations setting introduced by {L}. {D}e {R}aedt that extends to relational representations the classical propositional (or attribute-value) concept learning from examples framework. {W}e are inspired here by ideas presented by {H}. {H}irsh in a work extending the {V}ersion space inductive paradigm to incomplete data. {H}. {H}irsh proposes to slightly modify the notion of solution when dealing with incomplete examples: a solution has to be a hypothesis compatible with all pieces of information concerning the examples. {W}e identify two main classes of incompleteness. {F}irst, uncertainty deals with our state of knowledge concerning an example. {S}econd, generalization (or abstraction) deals with what part of the description of the example is sufficient for the learning purpose. {T}hese two main sources of incompleteness can be mixed up when only part of the useful information is known. {W}e discuss a general learning setting, referred to as "learning from possibilities" that formalizes these ideas, then we present a more specific learning setting, referred to as "assumption-based learning" that cope with examples which uncertainty can be reduced when considering contextual information outside of the proper description of the examples. {A}ssumption-based learning is illustrated on a recent work concerning the prediction of a consensus secondary structure common to a set of {RNA} sequences.}, keywords={machine learning; {I}nductive logic programming}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique - {LRI} - {CNRS} : {UMR}8623 - {U}niversit{\'e} {P}aris {S}ud - {P}aris {XI} }, note={rapport interne {LIPN} }, ARXIVID={cs.LG/0607096 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00086995/en/}, } %% hal-00084641, version 1 %% http://hal.archives-ouvertes.fr/hal-00084641/en/ @unpublished{DEHNI:2006:HAL-00084641:1, title={{U}ne approche neuronale adaptative de routage minimisant la consommation d'{\'e}nergie dans les r{\'e}seaux de capteurs}, author={{D}ehni, {L}ahc{\`e}ne and {B}ennani, {Y}oun{\`e}s and {K}rief, {F}rancine}, abstract={{L}'utilisation des r{\'e}seaux de capteurs ne devrait cesser d'augmenter et ceci dans de nombreux domaines, que ce soit scientifique, logistique, militaire ou encore de la sant{\'e}. {L}a taille des capteurs constitue, cependant, une limitation importante, principalement, en terme d'autonomie d'{\'e}nergie et donc de dur{\'e}e de vie car la batterie doit {\^e}tre tr{\`e}s petite. {C}'est pourquoi, de nombreux travaux portent aujourd'hui sur la gestion de l'{\'e}nergie consomm{\'e}e par les capteurs dans un r{\'e}seau en prenant en consid{\'e}ration, en premier lieu, les communications. {C}'est dans ce but, que nous avons propos{\'e} un algorithme de routage adaptatif bas{\'e} sur le clustering que nous avons nomm{\'e} {LEA}2{C}. {C}e dernier s'appuie sur des techniques d'apprentissage connexionniste et plus exactement sur les cartes autoorganisatrices de {K}ohonen auxquelles nous avons ajout{\'e} de nouvelles r{\`e}gles pour le choix des repr{\'e}sentants des clusters. {E}n comparant les r{\'e}sultats obtenus avec ce protocole {\`a} ceux d'autres m{\'e}thodes de clustering utilis{\'e}es dans les r{\'e}seaux de capteurs, {\`a} savoir {LEACH} et {LEACH}-{C}, nous avons pu constater des gains en terme d'{\'e}nergie et donc de dur{\'e}e de vie tr{\`e}s int{\'e}ressants.}, keywords={{R}{\'e}seaux de capteurs, {C}lustering, {C}onsommation d'{\'e}nergie, {R}outage, {A}pprentissage num{\'e}rique, {C}artes auto-organisatrices de {K}ohonen.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire {B}ordelais de {R}echerche en {I}nformatique - {L}a{BRI} - {CNRS} : {UMR}5800 - {U}niversit{\'e} {S}ciences et {T}echnologies - {B}ordeaux {I} - {E}cole {N}ationale {S}up{\'e}rieure d'{E}lectronique, {I}nformatique et {R}adiocommunications de {B}ordeaux }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084641/en/}, } %% hal-00095588, version 2 %% http://hal.archives-ouvertes.fr/hal-00095588/en/ @unpublished{DUCHAMP:2006:HAL-00095588:2, title={{A} multipurpose {H}opf deformation of the {A}lgebra of {F}eynman-like {D}iagrams}, author={{D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {S}olomon, {A}llan {I}. and {B}lasiak, {P}awel and {P}enson, {K}arol {A}. and {H}orzela, {A}ndrzej}, abstract={{W}e construct a three parameter deformation of the {H}opf algebra $\mathbf{{LDIAG}}$. {T}his new algebra is a true {H}opf deformation which reduces to $\mathbf{{LDIAG}}$ on one hand and to $\mathbf{{MQS}ym}$ on the other, relating $\mathbf{{LDIAG}}$ to other {H}opf algebras of interest in contemporary physics. {F}urther, its product law reproduces that of the algebra of polyzeta functions.}, keywords={{H}opf deformation, {A}lgebra of diagrams}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {P}hysique {T}h{\'e}orique de la {M}ati{\`e}re {C}ondens{\'e}e - {LPTMC} - {CNRS} : {UMR}7600 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, note={5 pages 05{E}99 }, ARXIVID={cs.OH/0609107 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00095588/en/}, } %% hal-00088823, version 1 %% http://hal.archives-ouvertes.fr/hal-00088823/en/ @unpublished{LAGO:2006:HAL-00088823:1, title={{C}ontext {S}emantics, {L}inear {L}ogic and {C}omputational {C}omplexity}, author={{L}ago, {U}go {D}al}, abstract={{W}e show that context semantics can be fruitfully applied to the quantitative analysis of proof normalization in linear logic. {I}n particular, context semantics lets us define the weight of a proof-net as a measure of its inherent complexity: it is both an upper bound to normalization time (modulo a polynomial overhead, independently on the reduction strategy) and a lower bound to the number of steps to normal form (for certain reduction strategies). {W}eights are then exploited in proving strong soundness theorems for various subsystems of linear logic, namely elementary linear logic, soft linear logic and light linear logic.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={22 pages }, collaboration={{NO}-{COST}, {FOLLIA} }, ARXIVID={cs.LO/0510092 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00088823/en/}, } %% hal-00067838, version 1 %% http://hal.archives-ouvertes.fr/hal-00067838/en/ @unpublished{MARION:2006:HAL-00067838:1, title={{H}eap-size analysis for assembly programs}, author={{M}arion, {J}ean-{Y}ves and {M}oyen, {J}ean-{Y}ves}, abstract={{O}ur objective is to propose methods for resource-aware compilation inspired by the implicit complexity community. {W}e consider a small assembly-like language and we build abstract finite machine models in order to predict a bound on the maximal heap usage of a program. {W}e propose a polynomial time procedure to detect and certify a broad and meaningful class of non-size increasing programs, which run in a constant size heap. {W}e end by discussing about programs running in linear heap space and discussing how to capture logarithmic space computation.}, keywords={{N}on-{S}ize increasing ; program analysis}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {CALLIGRAMME} - {INRIA} {L}orraine - {LORIA} - {INRIA} - {CNRS} : {UMR}7503 - {U}niversit{\'e} {H}enri {P}oincar{\'e} - {N}ancy {I} - {U}niversit{\'e} {N}ancy {II} - {I}nstitut {N}ational {P}olytechnique de {L}orraine }, note={{ACI} {CRISS} }, collaboration={{ACI} {C}riss }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00067838/en/}, } %% halshs-00085150, version 1 %% http://halshs.archives-ouvertes.fr/halshs-00085150/en/ @unpublished{SCHWER:2006:HALSHS-00085150:1, title={{T}raitement de la temporalit{\'e} des discours : une {A}nalysis {S}itus}, author={{S}chwer, {S}ylviane}, abstract={{L}e travail pr{\'e}sent{\'e} ici se situe {\`a} l'interface de celui du linguiste et celui de la formalisation math{\'e}matique. {A} partir de l'{\'e}tude de travaux linguistiques concernant la s{\'e}mantique de la temporalit{\'e}, nous avons mis en regard une certaine perception cognitivo-linguistique du temps et quelques d{\'e}finitions philosophiques du temps ({A}ristote, {L}eibniz) pour mettre en {\'e}vidence les hypoth{\`e}ses suivants :(i) {L}a temporalit{\'e} linguistique qualitative n'a pas besoin du temps physique pour s'exprimer.(ii) {Q}uelque soit les valeurs aspectuelles des proc{\`e}s en jeu (ponctuelle, p{\'e}riodique ou it{\'e}rative), le calcul se fait toujours sur des points ou des s{\'e}quences de points, avec les deux relations fondamentales de simultan{\'e}it{\'e} et de pr{\'e}c{\'e}dence. {C}'est une analysis situs, telle que {L}eibniz la voulait : exprimant directement les relations de position, et par suite les configurations et les constructions.(iii) {L}e formalisme des {S}-langages est un cadre idoine pour l'expression formelle de la temporalit{\'e} linguistique.{A}pr{\`e}s avoir montr{\'e} que la temporalit{\'e} linguistique pouvait s'exprimer sans recours au temps physique, nous pr{\'e}senterons le formalisme des {S}-langages qui permet de r{\'e}aliser l'analysis situs.}, keywords={mod{\'e}lisation des relations temporelles, {S}-langages}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}angues, logiques, informatiques, cognition et communication - {L}a{LIC} - {CNRS} : {UMR}8139 - {U}niversit{\'e} {P}aris-{S}orbonne - {P}aris {IV} }, note={{\`a} para{\^i}tre dans cahiers {C}hronos }, year={2006}, URL={http://halshs.archives-ouvertes.fr/halshs-00085150/en/}, } %% hal-00145748, version 1 %% http://hal.archives-ouvertes.fr/hal-00145748/en/ @unpublished{TOUATI:2006:HAL-00145748:1, title={{S}ur l'acc{\'e}l{\'e}ration de la convergence de la g{\'e}n{\'e}ration de colonnes}, author={{T}ouati, {N}ora and {L}{\'e}tocart, {L}ucas and {N}agih, {A}nass}, abstract={{T}he use of the method of column generation was intensified during the last decades, in particular for the resolution of huge discrete problems in order to obtain a lagrangian bound. {I}t is also integrated in a branch and bound method (branch-and-price) where it is used for the computation of the evaluation function at each node of the research tree. {T}he efficiency of this method is very related to the resolution of the subproblems and to the quality of the columns generated at each iteration. {L}ike iterative methods, it suffers from the long tail effect, particularly when it is used to solve degenerated problems. {T}he scheme of column generation offers several possibilities for improvements. {W}e present in this report some of these possibilities suggested in the literature, which are based on varied principles according to whether one operates on the primal or dual plan, or that acceleration relates to the resolution of the master problem, the subproblem or the whole process, or his hybridization with other resolution methods. {A}t the end of this report, we focus our study on reoptimization techniques, which prove to be promising for the acceleration of column generation, particularly when the total time of resolution is dominated by that of the subproblems.}, keywords={{G}{\'e}n{\'e}ration de colonnes; stabilisation; r{\'e}optimisation}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique {T}h{\'e}orique et {A}ppliqu{\'e}e - {LITA} - {U}niversit{\'e} {P}aul {V}erlaine - {M}etz }, note={29 pages 2006-4 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00145748/en/}, } %% hal-00086401, version 1 %% http://hal.archives-ouvertes.fr/hal-00086401/en/ @unpublished{TOUMAZET:2006:HAL-00086401:1, title={{U}nitary invariants of qubit systems}, author={{T}oumazet, {F}rederic and {L}uque, {J}ean-{G}abriel and {T}hibon, {J}ean-{Y}ves}, abstract={{W}e give an algorithm allowing to construct bases of local unitary invariants of pure k-qubit states from the knowledge of polynomial covariants of the group of invertible local filtering operations. {T}he simplest invariants obtained in this way are explicited and compared to various known entanglement measures. {C}omplete sets of generators are obtained for up to four qubits, and the structure of the invariant algebras is discussed in detail.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique }, note={19 pages, 1 figure }, ARXIVID={quant-ph/0604202 }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00086401/en/}, } %% hal-00084638, version 1 %% http://hal.archives-ouvertes.fr/hal-00084638/en/ @unpublished{ZEHRAOUI:2006:HAL-00084638:1, title={{M}-{SOM}: {M}atricial {S}elf {O}rganizing {M}ap for sequences clustering and classification}, author={{Z}ehraoui, {F}arida and {B}ennani, {Y}oun{\`e}s}, abstract={{T}his paper presents approaches for sequences clustering and classification. {T}hese approaches use the self organizing map “{SOM}”. {T}he inputs of the map are modelled in order to take into account the information and the correlation of the patterns contained in the sequences. {T}he first approaches represent the input of the map by a representative vector or by a covariance matrix in order to take into account the correlations between the sequence components. {T}hese approaches do not take into account the temporal order in the sequences (the dynamics). {T}he other approaches introduce the dynamics in the covariance matrix. {W}hen covariance matrices represent sequences, the {SOM} is modified in order to take into account the fact that the inputs are matrices. {T}he experimentations show that our approaches are better than some other temporal self organizing maps for user {W}eb navigation classification.}, keywords={{C}onnectionist learning, {S}elf {O}rganizing {M}ap, sequences clustering and classification.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084638/en/}, } %% hal-00084637, version 1 %% http://hal.archives-ouvertes.fr/hal-00084637/en/ @unpublished{ZEHRAOUI:2006:HAL-00084637:1, title={{M}-{SOM}-{ART}: {G}rowing {S}elf {O}rganizing {M}ap for sequence clustering and classification}, author={{Z}ehraoui, {F}arida and {B}ennani, {Y}oun{\`e}s}, abstract={{T}his paper presents a new growing neural network for sequence clustering and classification. {T}his network is a self organizing map ({SOM}), which has the properties of stability and plasticity. {T}he stability concerns the preservation of previously learned knowledge and the plasticity concerns the adaptation to any change in the input environment. {T}hese properties are obtained using {A}daptive {R}esonance {T}heory. {I}n order to take into account the temporal information (the dynamics) and the correlation of the patterns contained in the sequences, the inputs of the map are modelled using their associated dynamic covariance matrices. {T}his new model is inspired from the field of speaker recognition.{W}e have modified a covariance matrix in order to represent a temporal order in the sequence. {T}he experimentations show that our approach is better than some other temporal self organizing map for user's {W}eb navigation classification.}, keywords={{G}rowing {S}elf {O}rganizing {M}ap, sequence clustering, classification.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, year={2006}, URL={http://hal.archives-ouvertes.fr/hal-00084637/en/}, } %% hal-00004824, version 1 %% http://hal.archives-ouvertes.fr/hal-00004824/en/ @unpublished{ANDRIAMAMPIANINA:2005:HAL-00004824:1, title={{E}numeration of {C}onnected {U}niform {H}ypergraphs}, author={{A}ndriamampianina, {T}siriniaina and {R}avelomanana, {V}lady}, abstract={{I}n this paper, we are concerned in counting exactly and asymptotically connected labeled $b$-uniform hypergraphs ($b \geq 3$). {E}numerative results on connected graphs are generalized here to connected uniform hypergraphs. {F}or this purpose, these structures are counted according to the number of vertices and hyperedges. {F}irst, we show how to compute step by step the associated exponential generating functions ({EGF}s) by means of differential equations and provide combinatorial interpretations of the obtained results. {N}ext, we turn on asymptotic enumeration. {W}e establish {W}right-like inequalities for hypergraphs and by means of complex analysis, we obtain the asymptotic number of connected $b$-uniform hypergraphs with $n$ vertices and $(n+\ell)/(b-1)$ hyperedges whenever $\ell = o(n^{1/3}/b^{1/3})$. {T}his latter result confirms a conjecture made by {K}aro\'nski and {\{L}}uczak in \cite{{KL}97} about the validity of their formula for excesses in the `{W}right's range'.}, keywords={$b$-uniform hypergraphs; enumerative and analytic combinatorics; saddle-point method; generalized {W}right's coefficients; random hypergraphs.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{G}.2.1 {G}.2.2 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00004824/en/}, } %% hal-00004069, version 1 %% http://hal.archives-ouvertes.fr/hal-00004069/en/ @unpublished{ANEVA:2005:HAL-00004069:1, title={{H}opf {S}tructure and {G}reen {A}nsatzof {D}eformed {P}arastatistics {A}lgebras}, author={{A}neva, {B}oyka and {P}opov, {T}odor}, abstract={{D}eformed parabose and parafermi algebras are revised and endowed with {H}opf structure in a natural way. {T}he noncocommutative coproduct allows for construction of parastatistics {F}ock-like representations, built out of the simplest deformed bose and fermi representations.{T}he construction gives rise to quadratic algebras of deformed anomalous commutation relations which define the generalized {G}reen ansatz.}, affiliation={{I}nstitute for {N}uclear {R}esearch and {N}uclear {E}nergy - {INRNE} - {A}cad{\'e}mie des sciences de {B}ulgarie - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00004069/en/}, } %% hal-00004303, version 1 %% http://hal.archives-ouvertes.fr/hal-00004303/en/ @unpublished{BERTELLE:2005:HAL-00004303:1, title={{T}ables, {M}emorized {S}emirings and {A}pplications}, author={{B}ertelle, {C}yrille and {D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {K}hatatneh, {K}halaf}, abstract={{W}e define and construct a new data structure, the tables, this structure generalizes the (finite) $k$-sets sets of {E}ilenberg \cite{{E}i}, it is versatile (one can vary the letters, the words and the coefficients). {W}e derive from this structure a new semiring (with several semiring structures) which can be applied to the needs of automatic processing multi-agents behaviour problems. {T}he purpose of this account/paper is to present also the basic elements of this new structures from a combinatorial point of view. {T}hese structures present a bunch of properties. {T}hey will be endowed with several laws namely : {S}um, {H}adamard product, {C}auchy product, {F}uzzy operations (min, max, complemented product) {T}wo groups of applications are presented. {T}he first group is linked to the process of "forgetting" information in the tables. {T}he second, linked to multi-agent systems, is announced by showing a methodology to manage emergent organization from individual behaviour models.}, keywords={efficient algebraic structures; efficient data structures; tables; semirings}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique du {H}avre - {LIH} - {U}niversit{\'e} du {H}avre - {L}aboratoire d'{I}nformatique {F}ondamentale et {A}ppliqu{\'e}e de {R}ouen - {LIFAR} - {U}niversit{\'e} de {R}ouen }, note={{G}2 }, ARXIVID={cs.MA/0502081 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00004303/en/}, } %% hal-00004077, version 1 %% http://hal.archives-ouvertes.fr/hal-00004077/en/ @unpublished{BLASIAK:2005:HAL-00004077:1, title={{B}oson {N}ormal {O}rdering via {S}ubstitutions and {S}heffer-type {P}olynomials}, author={{B}lasiak, {P} and {H}orzela, {A} and {P}enson, {K} {A} and {D}uchamp, {G} {H} {E} and {S}olomon, {A} {I}}, abstract={{W}e solve the boson normal ordering problem for (q(a*)a + v(a*))^n with arbitrary functions q and v and integer n, where a and a* are boson annihilation and creation operators, satisfying [a,a*]=1. {T}his leads to exponential operators generalizing the shift operator and we show that their action can be expressed in terms of substitutions. {O}ur solution is naturally related through the coherent state representation to the exponential generating functions of {S}heffer-type polynomials. {T}his in turn opens a vast arena of combinatorial methodology which is applied to boson normal ordering and illustrated by a few examples.}, keywords={boson normal ordering problem; coherent states; {S}heffer-type polynomials; generating functions}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {P}hysique {T}h{\'e}orique des {L}iquides - {LPTL} - {CNRS} : {UMR}7600 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, note={10 pages, 24 references {ACM} {G}.2.1; {PACS} 03.65.{C}a; {MSC} 05{A}15; }, ARXIVID={quant-ph/0501155 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00004077/en/}, } %% hal-00009425, version 1 %% http://hal.archives-ouvertes.fr/hal-00009425/en/ @unpublished{DELAHAYE:2005:HAL-00009425:1, title={{D}iophantus' 20th {P}roblem and {F}ermat's {L}ast {T}heorem for n=4: {F}ormalization of {F}ermat's {P}roofs in the {C}oq {P}roof {A}ssistant}, author={{D}elahaye, {D}avid and {M}ayero, {M}icaela}, abstract={{W}e present the proof of {D}iophantus' 20th problem (book {VI} of {D}iophantus' {A}rithmetica), which consists in wondering if there exist right triangles whose sides may be measured as integers and whose surface may be a square. {T}his problem was negatively solved by {F}ermat in the 17th century, who used the "wonderful" method (ipse dixit {F}ermat) of infinite descent. {T}his method, which is, historically, the first use of induction, consists in producing smaller and smaller non-negative integer solutions assuming that one exists; this naturally leads to a reductio ad absurdum reasoning because we are bounded by zero. {W}e describe the formalization of this proof which has been carried out in the {C}oq proof assistant. {M}oreover, as a direct and no less historical application, we also provide the proof (by {F}ermat) of {F}ermat's last theorem for n=4, as well as the corresponding formalization made in {C}oq.}, keywords={{D}iophantus' {A}rithmetic; {F}ermat's {L}ast {T}heorem; {N}umber {T}heory; {F}ormal {P}roof; {C}oq}, language={{A}nglais}, affiliation={{C}entre d'{E}tude et {D}e {R}echerche en {I}nformatique du {C}nam - {CEDRIC} - {C}onservatoire {N}ational des {A}rts et {M}{\'e}tiers - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={16 pages }, ARXIVID={cs/0510011 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00009425/en/}, } %% hal-00010155, version 1 %% http://hal.archives-ouvertes.fr/hal-00010155/en/ @unpublished{DUCHAMP:2005:HAL-00010155:1, title={{F}eynman graphs and related {H}opf algebras}, author={{D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {B}lasiak, {P}awel and {H}orzela, {A}ndrzej and {A}. {P}enson, {K}arol and {I}. {S}olomon, {A}llan}, abstract={{I}n a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. {T}hese structures may be associated with a certain graphical description. {I}n this paper, we show that there is a {H}opf {A}lgebra structure associated with this problem which is, in a certain sense, unique.}, keywords={{B}oson strings; {F}eynman {G}raphs; {A}nalytic substitutions; {H}opf algebras; {M}atrix symmetric functions}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {P}hysique {T}h{\'e}orique des {L}iquides - {LPTL} - {CNRS} : {UMR}7600 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, note={{ACM} {G}2.1; {MCS} 05{E}99 }, ARXIVID={cs.SC/0510041 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00010155/en/}, } %% hal-00005781, version 1 %% http://hal.archives-ouvertes.fr/hal-00005781/en/ @unpublished{DUCHAMP:2005:HAL-00005781:1, title={{T}ransitive {H}all sets}, author={{D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {L}uque, {J}ean-{G}abriel and {D}eboysson-{F}louret, {M}arianne}, abstract={{W}e give the definition of {L}azard and {H}all sets in the context of transitive factorizations of free monoids. {T}he equivalence of the two properties is proved. {T}his allows to build new effective bases of free partially commutative {L}ie algebras. {T}he commutation graphs for which such sets exist are completely characterized and we explicit, in this context, the classical {PBW} rewriting process.}, keywords={{H}all sets; {F}ree {L}ie {A}lgebra; {P}artially {C}ommutative {S}tructures.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique - {L}aboratoire d'{I}nformatique du {H}avre - {LIH} - {U}niversit{\'e} du {H}avre }, note={05{E}99 {ACE} }, ARXIVID={math.CO/0507032 }, year={2005}, URL={http://hal.archives-ouvertes.fr/hal-00005781/en/}, } %% hal-00012752, version 1 %% http://hal.archives-ouvertes.fr/hal-00012752/en/ @unpublished{BAILLOT:2004:HAL-00012752:1, title={{L}ight types for polynomial time computation in lambda-calculus}, author={{B}aillot, {P}atrick and {T}erui, {K}azushige}, abstract={{W}e propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: {D}ual light affine logic ({DLAL}). {DLAL} has a simple type language with a linear and an intuitionistic type arrow, and one modality. {I}t corresponds to a fragment of {L}ight affine logic ({LAL}). {W}e show that contrarily to {LAL}, {DLAL} ensures good properties on lambda-terms: subject reduction is satisfied and a well-typed term admits a polynomial bound on the reduction by any strategy. {W}e establish that as {LAL}, {DLAL} allows to represent all polytime functions. {F}inally we give a type inference procedure for propositional {DLAL}.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={20 pages (including 10 pages of appendix). (revised version; in particular section 5 has been modified). {A} short version is to appear in the proceedings of the conference {LICS} 2004 ({IEEE} {C}omputer {S}ociety {P}ress) }, ARXIVID={cs.LO/0402059 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00012752/en/}, } %% hal-00003385, version 1 %% http://hal.archives-ouvertes.fr/hal-00003385/en/ @unpublished{BENMAMMAR:2004:HAL-00003385:1, title={{L}a mobilit{\'e} dans la future g{\'e}n{\'e}ration de protocoles de signalisation du monde {IP}}, author={{B}enmammar, {B}adr and {K}rief, {F}rancine}, abstract={{F}ournir {\`a} des terminaux mobiles {IP}v6 la {Q}o{S} demand{\'e}e est un domaine de recherche tr{\`e}s important. {D}ans les r{\'e}seaux {\`a} int{\'e}gration de services, la plupart des travaux cherchent {\`a} {\'e}tendre le protocole {RSVP} {\`a} un environnement mobile. {C}et article d{\'e}crit une nouvelle proc{\'e}dure de r{\'e}servation de ressources {\`a} l'avance dans un environnement sans fil. {I}l est bas{\'e} sur l'application de signalisation {Q}o{S} {NSLP}, issue des travaux du {WG} {NSIS} de l'{IETF}. {C}ette r{\'e}servation est bas{\'e}e sur un objet {MS}pec qui d{\'e}termine les futures localisations du terminal. {A}fin d'augmenter les performances du handover , nous proposons d'utiliser un protocole de transfert de context ({CTP}).}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003385/en/}, } %% hal-00003384, version 1 %% http://hal.archives-ouvertes.fr/hal-00003384/en/ @unpublished{BENMAMMAR:2004:HAL-00003384:1, title={{A}gents for {W}ireless {E}nvironments}, author={{B}enmammar, {B}adr and {K}rief, {F}rancine}, abstract={{T}he agent technology will have a role increasingly important in the telecommunications due to their properties, in particular, of autonomy, intelligence and/or mobility. {T}he {WLAN} will also play an increasingly important role in offering an omnipresent access to the network, thus supporting the mobility of the user. {I}n this context, we have identified some number of applicability of the agents in the {WLAN}. {T}hen we have described an example of agents use by taking as scenario of reference a user of the 4th generation of mobile having at his disposal several technologies of wireless access. {T}his user wants to be able to be connected in the best way, anywhere, any time and with any access network. {A}gent technology, in this case, is used to adapt the horizontal and/or vertical handover to the user's needs.}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003384/en/}, } %% hal-00003383, version 1 %% http://hal.archives-ouvertes.fr/hal-00003383/en/ @unpublished{BENMAMMAR:2004:HAL-00003383:1, title={{LA} {TECHNOLOGIE} {AGENT} {ET} {LES} {RESEAUX} {SANS} {FIL}}, author={{B}enmammar, {B}adr and {K}rief, {F}rancine}, abstract={{L}a technologie agent aura un r{\^o}le de plus en plus important {\`a} jouer dans les t{\'e}l{\'e}communications gr{\^a}ce {\`a} leur propri{\'e}t{\'e}s, notamment, d'autonomie, d'intelligence et/ou de mobilit{\'e}. {L}es r{\'e}seaux sans fil joueront {\'e}galement un r{\^o}le de plus en plus important offrant un acc{\`e}s omnipr{\'e}sent au r{\'e}seau, favorisant ainsi la mobilit{\'e} de l'utilisateur. {D}ans ce contexte, nous avons identifi{\'e} un certain nombre de domaines d'application des agents dans les r{\'e}seaux sans fil. {N}ous avons d{\'e}crit, ensuite, un exemple d'utilisation des agents en prenant comme sc{\'e}nario de r{\'e}f{\'e}rence un utilisateur de la 4{\`e}me g{\'e}n{\'e}ration de mobile ayant {\`a} sa disposition plusieurs technologies d'acc{\`e}s sans fil. {C}et utilisateur voudra {\^e}tre connect{\'e} au mieux, n'importe o{\`u}, n'importe quand et avec n'importe quel r{\'e}seau d'acc{\`e}s. {L}a technologie agent est, dans ce cas, utilis{\'e}e pour adapter le handover horizontal (changement au sein d'une m{\^e}me technologie d'acc{\`e}s) et vertical (changement de technologie d'acc{\`e}s) aux besoins de qualit{\'e} de service de l'utilisateur.}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003383/en/}, } %% hal-00004609, version 1 %% http://hal.archives-ouvertes.fr/hal-00004609/en/ @unpublished{DUCAMP:2004:HAL-00004609:1, title={{O}n the erasure of several letter-transitions}, author={{D}ucamp, {G}{\'e}rard and {H}adj {K}acem, {H}atem and {L}augerotte, {\'E}ric}, abstract={{W}e present here some algebraic formulas enabeling to define a $k$-automaton $\mathcal {A}_2$ from a given $k$-automaton $\mathcal {A}_1$ such that the behaviour of $\mathcal {A}_2$ is the behaviour of $\mathcal {A}_1$ after erasure of a given set of letters. {T}his procedure contains as particular case the algebraic elimination of $\ep$-transitions. {T}he time complexity of this process is evaluated. {I}n the case of well-known semirings (boolean and tropical) the closure is computed in ${O}(n^3)$. {W}hen $k$ is a ring, the complexity can be more finely tuned.}, keywords={{A}utomata with multiplicities; behaviour; star of matrices; morphisms}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'{I}nformatique {F}ondamentale et {A}ppliqu{\'e}e de {R}ouen - {LIFAR} - {U}niversit{\'e} de {R}ouen }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00004609/en/}, } %% hal-00084721, version 2 %% http://hal.archives-ouvertes.fr/hal-00084721/en/ @unpublished{DUCHAMP:2004:HAL-00084721:2, title={{L}azard's {E}limination (in traces) is finite-state recognizable}, author={{D}uchamp, {G}{\'e}rard and {L}uque, {J}ean-{G}abriel}, abstract={{W}e prove that the codes issued from the elimination of any subalphabet in a trace monoid are finite state recognizable. {T}his implies in particular that the transitive factorizations of the trace monoids are recognizable by (boolean) finite-state automata.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, ARXIVID={math.CO/0607280 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00084721/en/}, } %% hal-00003552, version 1 %% http://hal.archives-ouvertes.fr/hal-00003552/en/ @unpublished{DUCHAMP:2004:HAL-00003552:1, title={{F}ree quasi-symmetric functions, product actions and quantum field theory of partitions.}, author={{D}uchamp, {G}{\'e}rard {H}enry {E}dmond and {L}uque, {J}ean-{G}abriel and {P}enson, {K}arol {A}. and {T}ollu, {C}hristophe}, abstract={{W}e examine two associative products over the ring of symmetric functions related to the intransitive and {C}artesian products of permutation groups. {A}s an application, we give an enumeration of some {F}eynman type diagrams arising in {B}ender's {QFT} of partitions. {W}e end by exploring possibilities to construct noncommutative analogues.}, keywords={{F}onctions symetriques; enumeration; {F}eynman diagrams}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'informatique de l'{I}nstitut {G}aspard-{M}onge - {IGM}-{L}ab{I}nfo - {CNRS} : {UMR}8049 - {U}niversit{\'e} {P}aris-{E}st - {\'E}cole {S}up{\'e}rieure d'{I}ng{\'e}nieurs en {\'E}lectronique et {\'E}lectrotechnique - {L}aboratoire de {P}hysique {T}h{\'e}orique des {L}iquides - {LPTL} - {CNRS} : {UMR}7600 - {U}niversit{\'e} {P}ierre et {M}arie {C}urie - {P}aris {VI} }, note={{S}ubmitted 28.11.04 }, ARXIVID={cs.SC/0412061 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003552/en/}, } %% hal-00001038, version 2 %% http://hal.archives-ouvertes.fr/hal-00001038/en/ @unpublished{DUCHAMP:2004:HAL-00001038:2, title={{A}lgebraic {E}limination of epsilon-transitions}, author={{D}uchamp, {G}{\'e}rard and {H}adj {K}acem, {H}atem and {L}augerotte, {\'E}ric}, abstract={{W}e present here algebraic formulas associating a k-automaton to a k-epsilon-automaton. {T}he existence depends on the definition of the star of matrices and of elements in the semiring k. {F}or this reason, we present the theorem which allows the transformation of k-epsilon-automata into k-automata. {T}he two automata have the same behaviour.}, keywords={{A}utomata with multiplicities, epsilon-transitions, behaviour, star of matrices.}, language={{A}nglais}, affiliation={{L}aboratoire d'{I}nformatique appliqu{\'e}e et {F}ondamentale de {R}ouen - {LIFAR} - {CNRS} : {EA}2655 - {U}niversit{\'e} de {R}ouen - {L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={13 d{\'e}cembre 2004 {H}. 2 }, ARXIVID={cs.SC/0401012 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00001038/en/}, } %% hal-00003544, version 1 %% http://hal.archives-ouvertes.fr/hal-00003544/en/ @unpublished{DUCHAMP:2004:HAL-00003544:1, title={{A}n unexpected application of minimization theory to module decompositions}, author={{D}uchamp, {G}erard and {K}acem, {H}atem {H}adj and {L}augerotte, {E}ric}, abstract={{T}he aim of this work is to show how we can decompose a module (if decomposable) into an indecomposable module with the help of the minimization process.}, keywords={{E}ffective methods; indecomposable modules; minimization of automata with multiplicities}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={15-02-2004. pr{\'e}sent{\'e} {\`a} {JICCSE} }, ARXIVID={cs.SC/0405060 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003544/en/}, } %% hal-00003540, version 1 %% http://hal.archives-ouvertes.fr/hal-00003540/en/ @unpublished{DUCHAMP:2004:HAL-00003540:1, title={{O}ne-parameter groups and combinatorial physics}, author={{D}uchamp, {G}erard and {P}enson, {K}arol {A}. and {S}olomon, {A}llan {I}. and {H}orzela, {A}ndrej and {B}lasiak, {P}awel}, abstract={{I}n this communication, we consider the normal ordering of sums of elements of the form (a*^r a a*^s), where a* and a are boson creation and annihilation operators. {W}e discuss the integration of the associated one-parameter groups and their combinatorial by-products. {I}n particular, we show how these groups can be realized as groups of substitutions with prefunctions.}, keywords={{O}ne-parameter groups; combinatorial physics;substitutions}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={15 pages, 23 references. {P}resented at the {T}hird {I}nternational {W}orkshop on {C}ontemporary {P}roblems in {M}athematical {P}hysics ({COPROMAPH}3), {P}orto-{N}ovo ({B}enin), {N}ovember 2003 }, ARXIVID={quant-ph/0401126 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003540/en/}, } %% hal-00003536, version 1 %% http://hal.archives-ouvertes.fr/hal-00003536/en/ @unpublished{HORZELA:2004:HAL-00003536:1, title={{A} product formula and combinatorial field theory}, author={{H}orzela, {A}. and {B}lasiak, {P}. and {D}uchamp, {G}. {H}. {E}. and {P}enson, {K}. {A}. and {S}olomon, {A}. {I}.}, abstract={{W}e treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. {W}e show that a simple product formula for formal power series - essentially an extension of the {T}aylor expansion - leads to a double exponential formula which enables a powerful graphical description of the generating functions of the combinatorial sequences associated with such functions - in essence, a combinatorial field theory. {W}e apply these techniques to some examples related to specific physical {H}amiltonians.}, keywords={combinatorics;normal ordering;standard boson operators;{H}amiltonians.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{P}resented at the {XI} {I}nternational {C}onference on {S}ymmetry {M}ethods in {P}hysics ({SYMPHYS}-11), {P}rague, {C}zech {R}epublic, {J}une 21-24, 2004. 17 pages, 36 references, 3 f 05-xx; 81-xx }, ARXIVID={quant-ph/0409152 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003536/en/}, } %% hal-00003470, version 1 %% http://hal.archives-ouvertes.fr/hal-00003470/en/ @unpublished{RAVELOMANANA:2004:HAL-00003470:1, title={{R}andomized {I}nitialization of a {W}ireless {M}ultihop {N}etwork}, author={{R}avelomanana, {V}lady}, abstract={{A}ddress autoconfiguration is an important mechanism required to set the {IP} address of a node automatically in a wireless network. {T}he address autoconfiguration, also known as initialization or naming, consists to give a unique identifier ranging from $1$ to $n$ for a set of $n$ indistinguishable nodes. {W}e consider a wireless network where $n$ nodes (processors) are randomly thrown in a square ${X}$, uniformly and independently. {W}e assume that the network is synchronous and two nodes are able to communicate if they are within distance at most of $r$ of each other ($r$ is the transmitting/receiving range). {T}he model of this paper concerns nodes without the collision detection ability: if two or more neighbors of a processor $u$ transmit concurrently at the same time, then $u$ would not receive either messages. {W}e suppose also that nodes know neither the topology of the network nor the number of nodes in the network. {M}oreover, they start indistinguishable, anonymous and unnamed. {U}nder this extremal scenario, we design and analyze a fully distributed protocol to achieve the initialization task for a wireless multihop network of $n$ nodes uniformly scattered in a square ${X}$. {W}e show how the transmitting range of the deployed stations can affect the typical characteristics such as the degrees and the diameter of the network. {B}y allowing the nodes to transmit at a range $r= \sqrt{\frac{(1+\ell) \, \ln{n} \, \{SIZE}}{\pi \, n}}$ (slightly greater than the one required to have a connected network), we show how to design a randomized protocol running in expected time ${O}(n^{3/2} \log^2{n})$ in order to assign a unique number ranging from $1$ to $n$ to each of the $n$ participating nodes.}, keywords={{M}ultihop networks; address autoconfiguration; self-configuration in ad hoc networks; randomized distributed protocols; initialization; naming; fundamental limits of random networks.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{ACM} {C}lassification: {C}.2.1 {N}etwork architecture and design; {F}.2.2 {N}onnumerical algorithms and problems; {G}.3 {P}robability and statistics }, ARXIVID={cs.DC/0412014 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003470/en/}, } %% hal-00003325, version 1 %% http://hal.archives-ouvertes.fr/hal-00003325/en/ @unpublished{RAVELOMANANA:2004:HAL-00003325:1, title={{F}orbidden {S}ubgraphs in {C}onnected {G}raphs}, author={{R}avelomanana, {V}lady and {T}himonier, {L}o{\"y}s}, abstract={{G}iven a set $\xi=\{{H}_1,{H}_2,\cdots\}$ of connected non acyclic graphs, a $\xi$-free graph is one which does not contain any member of $% \xi$ as copy. {D}efine the excess of a graph as the difference between its number of edges and its number of vertices. {L}et ${\gr{{W}}}_{k,\xi}$ be theexponential generating function ({EGF} for brief) of connected $\xi$-free graphs of excess equal to $k$ ($k \geq 1$). {F}or each fixed $\xi$, a fundamental differential recurrence satisfied by the {EGF}s ${\gr{{W}}}_{k,\xi}$ is derived. {W}e give methods on how to solve this nonlinear recurrence for the first few values of $k$ by means of graph surgery. {W}e also show that for any finite collection $\xi$ of non-acyclic graphs, the {EGF}s ${\gr{{W}}}_{k,\xi}$ are always rational functions of the generating function, ${T}$, of {C}ayley's rooted (non-planar) labelled trees. {F}rom this, we prove that almost all connected graphs with $n$ nodes and $n+k$ edges are $\xi$-free, whenever $k=o(n^{1/3})$ and $|\xi| < \infty$ by means of {W}right's inequalities and saddle point method. {L}imiting distributions are derived for sparse connected $\xi$-free components that are present when a random graph on $n$ nodes has approximately $\frac{n}{2}$ edges. {I}n particular, the probability distribution that it consists of trees, unicyclic components, $\cdots$, $(q+1)$-cyclic components all $\xi$-free is derived. {S}imilar results are also obtained for multigraphs, which are graphs where self-loops and multiple-edges are allowed.}, keywords={{C}ombinatorial problems; enumerative combinatorics; analytic combinatorics; labelled graphs; multivariate generating functions; asymptotic enumeration; random graphs; triangle-free graphs.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire de {R}echerche en {I}nformatique d'{A}miens - {L}a{RIA} - {CNRS} : {FRE}2733 - {U}niversit{\'e} de {P}icardie {J}ules {V}erne }, note={{ACM} {C}lassification: {G}.2.1 {C}ombinatorics {G}.2.2 {G}raph {T}heory {G}eneral {T}erms: {A}lgorithms, {T}heory }, ARXIVID={cs.DS/0411093 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003325/en/}, } %% hal-00153209, version 1 %% http://hal.archives-ouvertes.fr/hal-00153209/en/ @unpublished{SCHWER:2004:HAL-00153209:1, title={{T}emporal {R}easoning without {T}ransitive {T}ables}, author={{S}chwer, {S}ylviane}, abstract={{R}epresenting and reasoning about qualitative temporal information is an essential part of many artificial intelligence tasks. {L}ots of models have been proposed in the litterature for representing such temporal information. {A}ll derive from a point-based or an interval-based framework. {O}ne fundamental reasoning task that arises in applications of these frameworks is given by the following scheme: given possibly indefinite and incomplete knowledge of the binary relationships between some temporal objects, find the consistent scenarii between all these objects. {A}ll these models require transitive tables --- or similarly inference rules--- for solving such tasks. {W}e have defined an alternative model, {S}-languages - to represent qualitative temporal information, based on the only two relations of \emph{precedence} and \emph{simultaneity}. {I}n this paper, we show how this model enables to avoid transitive tables or inference rules to handle this kind of problem.}, keywords={{T}emporal {R}easoning; {F}ormal language theory}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={rapport interne {F}.4.3 }, ARXIVID={0706.1290 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00153209/en/}, } %% hal-00003539, version 1 %% http://hal.archives-ouvertes.fr/hal-00003539/en/ @unpublished{SOLOMON:2004:HAL-00003539:1, title={{N}ormal {O}rder: {C}ombinatorial {G}raphs}, author={{S}olomon, {A}llan {I}. and {B}lasiak, {P}awel and {D}uchamp, {G}erard and {H}orzela, {A}ndrzej and {P}enson, {K}arol {A}.}, abstract={{A} conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. {I}n this note we consider the normal ordering problem for a string of such operators. {I}n the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called {R}ook numbers. {S}ince we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. {T}his problem leads to elegant generalisations of well-known combinatorial numbers, specifically {B}ell and {S}tirling numbers. {W}e explicitly give the generating functions for some classes of these numbers. {I}n this note we concentrate on the combinatorial graph approach, showing how some important classical results of graph theory lead to transparent representations of the combinatorial numbers associated with the boson normal ordering problem.}, keywords={supersymmetry; string of operators}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={7 pages, 15 references, 2 figures. {P}resented at "{P}rogress in {S}upersymmetric {Q}uantum {M}echanics" ({PSQM}'03), {V}alladolid, {S}pain, {J}uly 2003 }, ARXIVID={quant-ph/0402082 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003539/en/}, } %% hal-00003537, version 1 %% http://hal.archives-ouvertes.fr/hal-00003537/en/ @unpublished{SOLOMON:2004:HAL-00003537:1, title={{P}artition functions and graphs: {A} combinatorial approach}, author={{S}olomon, {A}llan {I}. and {B}lasiak, {P}awel and {D}uchamp, {G}erard and {H}orzela, {A}ndrzej and {P}enson, {K}arol {A}.}, abstract={{A}lthough symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. {O}ne exception is in the realm of {S}tatistical {P}hysics, where the calculation of the partition function, for example, is essentially a combinatorial problem. {I}n this talk we shall show that one approach is via the normal ordering of the second quantized operators appearing in the partition function. {T}his in turn leads to a combinatorial graphical description, giving essentially {F}eynman-type graphs associated with the theory. {W}e illustrate this methodology by the explicit calculation of two model examples, the free boson gas and a superfluid boson model. {W}e show how the calculation of partition functions can be facilitated by knowledge of the combinatorics of the boson normal ordering problem; this naturally gives rise to the {B}ell numbers of combinatorics. {T}he associated graphical representation of these numbers gives a perturbation expansion in terms of a sequence of graphs analogous to zero - dimensional {F}eynman diagrams.}, keywords={{F}eynmann diagrams; superfluid boson model; {B}ell numbers}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{P}resented at the {XI} {I}nternational {C}onference on {S}ymmetry {M}ethods in {P}hysics ({SYMPHYS}-11), {P}rague, {C}zech {R}epublic, {J}une 21-24, 2004. {O}ne figure, 10 pages, 10 references }, ARXIVID={quant-ph/0409082 }, year={2004}, URL={http://hal.archives-ouvertes.fr/hal-00003537/en/}, } %% hal-00012751, version 1 %% http://hal.archives-ouvertes.fr/hal-00012751/en/ @unpublished{BAILLOT:2003:HAL-00012751:1, title={{S}oft lambda-calculus: a language for polynomial time computation}, author={{B}aillot, {P}atrick and {M}ogbil, {V}irgile}, abstract={{S}oft linear logic ([{L}afont02]) is a subsystem of linear logic characterizing the class {PTIME}. {W}e introduce {S}oft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic. {W}e prove that the (untyped) terms of this calculus are reducible in polynomial time. {W}e then extend the type system of {S}oft logic with recursive types. {T}his allows us to consider non-standard types for representing lists. {U}sing these datatypes we examine the concrete expressivity of {S}oft lambda-calculus with the example of the insertion sort algorithm.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={20 pages }, ARXIVID={cs.LO/0312015 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00012751/en/}, } %% hal-00003541, version 1 %% http://hal.archives-ouvertes.fr/hal-00003541/en/ @unpublished{PENSON:2003:HAL-00003541:1, title={{H}ierarchical {D}obinski-type relations via substitution and the moment problem}, author={{P}enson, {K}. {A}. and {B}lasiak, {P}. and {D}uchamp, {G}. and {H}orzela, {A}. and {S}olomon, {A}. {I}.}, abstract={{W}e consider the transformation properties of integer sequences arising from the normal ordering of exponentiated boson ([a,a*]=1) monomials of the form exp(x (a*)^r a), r=1,2,..., under the composition of their exponential generating functions (egf). {T}hey turn out to be of {S}heffer-type. {W}e demonstrate that two key properties of these sequences remain preserved under substitutional composition: (a)the property of being the solution of the {S}tieltjes moment problem; and (b) the representation of these sequences through infinite series ({D}obinski-type relations). {W}e present a number of examples of such composition satisfying properties (a) and (b). {W}e obtain new {D}obinski-type formulas and solve the associated moment problem for several hierarchically defined combinatorial families of sequences.}, keywords={{S}tieltjes moment problem; {D}obinski-type relations; hierarchical combinatorial sequences}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={14 pages, 31 references }, ARXIVID={quant-ph/0312202 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00003541/en/}, } %% hal-00003542, version 1 %% http://hal.archives-ouvertes.fr/hal-00003542/en/ @unpublished{SOLOMON:2003:HAL-00003542:1, title={{C}ombinatorial {P}hysics, {N}ormal {O}rder and {M}odel {F}eynman {G}raphs}, author={{S}olomon, {A}. {I}. and {B}lasiak, {P}. and {D}uchamp, {G}. and {H}orzela, {A}. and {P}enson, {K}. {A}.}, abstract={{T}he general normal ordering problem for boson strings is a combinatorial problem. {I}n this note we restrict ourselves to single-mode boson monomials. {T}his problem leads to elegant generalisations of well-known combinatorial numbers, such as {B}ell and {S}tirling numbers. {W}e explicitly give the generating functions for some classes of these numbers. {F}inally we show that a graphical representation of these combinatorial numbers leads to sets of model field theories, for which the graphs may be interpreted as {F}eynman diagrams corresponding to the bosons of the theory. {T}he generating functions are the generators of the classes of {F}eynman diagrams.}, keywords={boson monomials; {S}tirling-type matrices; {S}heffer condition}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={9 pages, 4 figures. 12 references. {P}resented at the {S}ymposium '{S}ymmetries in {S}cience {XIII}', {B}regenz, {A}ustria, 2003 }, ARXIVID={quant-ph/0310174 }, year={2003}, URL={http://hal.archives-ouvertes.fr/hal-00003542/en/}, } %% hal-00265871, version 1 %% http://hal.archives-ouvertes.fr/hal-00265871/en/ @unpublished{SCHWER:2001:HAL-00265871:1, title={{S}-arrangements avec r{\'e}p{\'e}titions de tas {II}}, author={{S}chwer, {S}ylviane}, abstract={{N}ous {\'e}tudions quelques familles d'objets isomorphes {\`a} l'ensemble des arrangements avec r{\'e}p{\'e}titions par des blocs de tas ou multi-ensembles puis nous introduisons une op\{\'e}ration alg{\'e}{\'e}brique de composition fond{\'e}e sur les {S}-mots.}, keywords={langages formels, chemins dans des hypercubes, syst{\`e}mes d'addition de vecteurs, ordres et pr{\'e}ordres, intervalles g{\'e}n{\'e}ralis{\'e}s.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={5 pages {ACM} {G}2 }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00265871/en/}, } %% hal-00265870, version 1 %% http://hal.archives-ouvertes.fr/hal-00265870/en/ @unpublished{SCHWER:2001:HAL-00265870:1, title={{S}-arrangements avec r{\'e}p{\'e}titions de tas}, author={{S}chwer, {S}ylviane}, abstract={{N}ous {\'e}tudions quelques aspects combinatoires de l'ensemble des arrangements de blocs avec r{\'e}p{\'e}titions de tas ou multi-ensembles en utilisant le cadre des langages formels.}, keywords={combinatoire {\'e}num{\'e}rative, langages formels.}, language={{F}ran{\c{c}}ais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={4 pages {ACM} {G}2 }, year={2001}, URL={http://hal.archives-ouvertes.fr/hal-00265870/en/}, } %% hal-00265817, version 1 %% http://hal.archives-ouvertes.fr/hal-00265817/en/ @unpublished{SCHWER:1999:HAL-00265817:1, title={{A}n algebra for structured documents in the context of the object-oriented approach}, author={{S}chwer, {S}ylviane and {H}amza, {H}aider and {F}lory, {A}ndr{\'e}}, abstract={{T}he aim of this paper consists in defining an algebra allowing the request of structured documents in the context of object oriented approach. {T}he operators of this algebra are defined in conformity with the concepts of the object model. {I}t takes into consideration not only the embedding of structures and links between them, but also the informational aspect of the document as well as its structural aspect. {T}he operands of the proposed algebra are only one type: they are subdatabases. {A} subdatabase is made of a collection of the databases objects, grouped in classes and interconnected through links. {T}his algebra responds to two objectives. {F}irstly, it represents a basic nucleus of a declarative query system; it contains the whole of the elementary operations which will be used in the resolution of the request. {S}econdly, it provides facilities to users to formulate their requests and manipulate the documentary database.}, keywords={: {S}tructured documents, {O}bject oriented, {D}ocumentary database, {Q}uery, {A}lgebra}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} - {L}aboratoire d'ing{\'e}nierie des syst{\`e}mes d'information - {LISI} - {INSA} - {I}nstitut {N}ational des {S}ciences {A}ppliqu{\'e}es }, note={19 pages {ACM} {E}1 }, year={1999}, URL={http://hal.archives-ouvertes.fr/hal-00265817/en/}, } %% hal-00179884, version 1 %% http://hal.archives-ouvertes.fr/hal-00179884/en/ @unpublished{RECANATI:1990:HAL-00179884:1, title={{S}uccess and failure of programming environments - report on the design and use of a graphic abstract syntax tree editor}, author={{R}ecanati, {C}.}, abstract={{T}he {STAPLE} project investigated (at the end of the eighties), a persistent architecture for functional programming. {W}ork has been done in two directions: the development of a programming environment for a functional language within a persistent system and an experiment on transferring the expertise of functional prototyping into industry. {T}his paper is a report on the first activity. {T}he first section gives a general description of {A}bsynte - the abstract syntax tree editor developed within the {P}roject. {F}ollowing sections make an attempt at measuring the effectiveness of such an editor and discuss the problems raised by structured syntax editing - specially environments based on abstract syntax trees.}, language={{A}nglais}, affiliation={{L}aboratoire d'informatique de {P}aris-nord - {LIPN} - {CNRS} : {UMR}7030 - {U}niversit{\'e} {P}aris-{N}ord - {P}aris {XIII} }, note={{T}his is an old paper (1990) of 29 pages }, ARXIVID={0710.2358 }, year={1990}, URL={http://hal.archives-ouvertes.fr/hal-00179884/en/}, }