Search results for "Lexico"

showing 10 items of 275 documents

Fuzzy Boundaries in Discourse Studies : Theoretical, Methodological, and Lexico-Grammatical Fuzziness

2019

This book focuses on the multifarious aspects of ‘fuzzy boundaries’ in the field of discourse studies, a field that is marked by complex boundary work and a great degree of fuzziness regarding theoretical frameworks, methodologies, and the use of linguistic categories. Discourse studies is characterised by a variety of theoretical frameworks and disciplinary fields, research methodologies, and lexico-grammatical categories. The contributions in this book explore some of the nuances and implications of the fuzzy boundaries in these areas, resulting in a wide-reaching volume which will be of interest to students and scholars of discourse studies in fields including sociology, linguistics, int…

Discourse analysisLexicoSociologycomputerFuzzy logicLinguisticscomputer.programming_language
researchProduct

On the loopless generation of binary tree sequences

1998

Weight sequences were introduced by Pallo in 1986 for coding binary trees and he presented a constant amortized time algorithm for their generation in lexicographic order. A year later, Roelants van Baronaigien and Ruskey developed a recursive constant amortized time algorithm for generating Gray code for binary trees in Pallo's representation. It is common practice to find a loopless generating algorithm for a combinatorial object when enunciating a Gray code for this object. In this paper we regard weight sequences as variations and apply a Williamson algorithm in order to obtain a loopless generating algorithm for the Roelants van Baronaigien and Ruskey's Gray code for weight sequences.

Discrete mathematicsAmortized analysisBinary treeLexicographical orderPseudorandom binary sequenceComputer Science ApplicationsTheoretical Computer ScienceGray codeCombinatoricsSignal ProcessingBinary codeInformation SystemsCoding (social sciences)MathematicsInformation Processing Letters
researchProduct

A bijection between words and multisets of necklaces

2012

Two of the present authors have given in 1993 a bijection Phi between words on a totally ordered alphabet and multisets of primitive necklaces. At the same time and independently, Burrows and Wheeler gave a data compression algorithm which turns out to be a particular case of the inverse of Phi. In the present article, we show that if one replaces in Phi the standard permutation of a word by the co-standard one (reading the word from right to left), then the inverse bijection is computed using the alternate lexicographic order (which is the order of real numbers given by continued fractions) on necklaces, instead of the lexicographic order as for Phi(-1). The image of the new bijection, ins…

Discrete mathematicsBurrows and Wheeler TransformMathematics::CombinatoricsSettore INF/01 - InformaticaFree Lie algebraLie superalgebrastandard permutationLexicographical orderTheoretical Computer ScienceImage (mathematics)CombinatoricsSet (abstract data type)PermutationComputational Theory and MathematicsBijectionDiscrete Mathematics and CombinatoricsGeometry and TopologyComputer Science::Formal Languages and Automata TheoryWord (group theory)MathematicsReal number
researchProduct

Some properties of vertex-oblique graphs

2016

The type t G ( v ) of a vertex v ? V ( G ) is the ordered degree-sequence ( d 1 , ? , d d G ( v ) ) of the vertices adjacent with v , where d 1 ? ? ? d d G ( v ) . A graph G is called vertex-oblique if it contains no two vertices of the same type. In this paper we show that for reals a , b the class of vertex-oblique graphs G for which | E ( G ) | ? a | V ( G ) | + b holds is finite when a ? 1 and infinite when a ? 2 . Apart from one missing interval, it solves the following problem posed by Schreyer et?al. (2007): How many graphs of bounded average degree are vertex-oblique? Furthermore we obtain the tight upper bound on the independence and clique numbers of vertex-oblique graphs as a fun…

Discrete mathematicsClique-sumNeighbourhood (graph theory)020206 networking & telecommunications0102 computer and information sciences02 engineering and technology01 natural sciencesTheoretical Computer ScienceMetric dimensionCombinatoricsIndifference graphNew digraph reconstruction conjecture010201 computation theory & mathematicsChordal graphIndependent set0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsBound graphirregular graphsindependence numbervertex-oblique graphslexicographic productMathematicsDiscrete Mathematics
researchProduct

Universal Lyndon Words

2014

A word w over an alphabet Σ is a Lyndon word if there exists an order defined on Σ for which w is lexicographically smaller than all of its conjugates (other than itself). We introduce and study universal Lyndon words, which are words over an n-letter alphabet that have length n! and such that all the conjugates are Lyndon words. We show that universal Lyndon words exist for every n and exhibit combinatorial and structural properties of these words. We then define particular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in bijection with the set of the shortest unrepeated prefixes of the conjugates of a universal Lyndon word. This allows us t…

Discrete mathematicsExistential quantificationLyndon word Universal cycle Universal Lyndon wordComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Lyndon word Universal cycle Universal Lyndon word Lex-codeLexicographical orderLyndon wordUniversal Lyndon wordLyndon wordsPrefixCombinatoricsMathematics::Group TheoryCombinatorics on wordsComputer Science::Discrete MathematicsUniversal cycleBijectionAlphabetMathematics::Representation TheoryComputer Science::Formal Languages and Automata TheoryMathematics
researchProduct

A note on Sturmian words

2012

International audience; We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.

Discrete mathematicsProperty (philosophy)General Computer ScienceSettore INF/01 - Informatica010102 general mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Sturmian word0102 computer and information sciencesSturmian wordsLexicographical order01 natural sciencesTheoretical Computer ScienceCombinatoricsTransformation (function)010201 computation theory & mathematicsFactor (programming language)combinatorics0101 mathematicscomputerTime complexitycomputer.programming_languageMathematics
researchProduct

A diffusion model account of normal and impaired readers.

2004

Acquired aphasics and dyslexics with even very profound word reading impairments have been shown to perform relatively well on the lexical decision task (e.g., Buchanan, Hildebrandt, & MacKinnon, 1999), but direct contrasts with unimpaired participants data is often complicated by extremely long reaction times for patient data. The dissociation between lexical decision and word naming performance shown by these patients is of theoretical importance, and here we present an analysis of processing underlying the lexical decision task. We are able to determine what aspects of performance are affected by acquired aphasics in the lexical decision task. We fit lexical decision data from aphasic pa…

Dissociation (neuropsychology)Cognitive NeuroscienceDecision MakingExperimental and Cognitive PsychologyModels PsychologicalLexiconChoice BehaviorDyslexiaArts and Humanities (miscellaneous)NeurolinguisticsAphasiaDevelopmental and Educational PsychologyLexical decision taskmedicineAphasiaReaction TimeHumansLanguage disordercomputer.programming_languageCognitionmedicine.diseaseLinguisticsSemanticsStrokeNeuropsychology and Physiological PsychologyReadingHealthBrain Damage ChronicLexicomedicine.symptomPsychologycomputerCognitive psychologyBrain and cognition
researchProduct

Analysis of documentary and terminological needs of doctors and medical translators as a basis for the development of a next-generation multilingual …

2014

En el presente trabajo se plantea el diseño de un recurso lexicográfico multilingüe orientado a médicos y traductores médicos. En la actualidad, no existe ningún recurso que satisfaga a ambos colectivos por igual, debido a que estos poseen necesidades muy diferentes. Sin embargo, partimos de la premisa de que se podría crear una herramienta única, modular, adaptable y flexible, que responda a sus diversas expectativas, necesidades y preferencias. Se parte para ello de un análisis de necesidades siguiendo el método empírico de recogida de datos en línea mediante una encuesta trilingüe. The objective of this study is to develop a multilingual lexicographical resource aimed at doctors and medi…

E-lexicografíaMédicosencuesta a usuariosUNESCO::CIENCIAS DE LAS ARTES Y LAS LETRASTraductores médicosAnálisis de necesidadesMedical translatorsDoctorsTraducción e Interpretaciónusers questionnairee-lexicografíatraductores médicosmedical translatorsneeds analysis:CIENCIAS DE LAS ARTES Y LAS LETRAS [UNESCO]análisis de necesidadesNeeds analysise-lexicographyE-lexicographymédicosEncuesta a usuariosUsers questionnairedoctors
researchProduct

The lexicon of community acquis: how to negotiate the non-negotiable

2009

In the context of the activities aimed to improve and develop the integration and cooperation of new Member States together with the states already belonging to the European Community, EU institutions have carried out a number of measures to increase the coherence of the body of common rights and obligations, binding all the Member States of the European Union (community acquis), for a long time. For this reason, the Commission of the European Community began in 2001 a process of consultation and discussion about the way in which problems resulting from the lack of a correspondence between national contract laws (and related terms) belonging to different legal systems should be dealt with a…

EU institutions lexicon community acquis contract law terminology culture-bound legal conceptsSettore L-LIN/12 - Lingua E Traduzione - Lingua Inglese
researchProduct

A Multi-Objective Approach to Optimize a Periodic Maintenance Policy

2012

The present paper proposes a multi-objective approach to find out an optimal periodic maintenance policy for a repairable and stochastically deteriorating multi-component system over a finite time horizon. The tackled problem concerns the determination of the system elements to replace at each scheduled and periodical system inspection by ensuring the simultaneous minimization of both the expected total maintenance cost and the expected global system unavailability time. It is assumed that in the case of system elements failure they are instantaneously detected and repaired by means of minimal repair actions in order to rapidly restore the system. A nonlinear integer mathematical programmi…

EngineeringMathematical optimizationGeneral Computer ScienceReliability (computer networking)Energy Engineering and Power TechnologyAerospace EngineeringMulti-objective optimizationIndustrial and Manufacturing EngineeringMulti-Objective Optimization.Goal programmingSettore ING-IND/17 - Impianti Industriali MeccaniciElectrical and Electronic EngineeringSafety Risk Reliability and QualityMulti-Component SystemSettore ING-IND/16 - Tecnologie E Sistemi Di LavorazionePeriodic Maintenance; Multi-Component System; Non-Homogeneous Poisson Process; Multi-Objective Optimization.business.industryMulti-Objective OptimizationLexicographical orderNon-Homogeneous Poisson ProceNonlinear systemNuclear Energy and EngineeringPeriodic MaintenanceMinificationUnavailabilitybusinessInteger (computer science)
researchProduct