Search results for "FIX"

showing 10 items of 1335 documents

The rightmost equal-cost position problem.

2013

LZ77-based compression schemes compress the input text by replacing factors in the text with an encoded reference to a previous occurrence formed by the couple (length, offset). For a given factor, the smallest is the offset, the smallest is the resulting compression ratio. This is optimally achieved by using the rightmost occurrence of a factor in the previous text. Given a cost function, for instance the minimum number of bits used to represent an integer, we define the Rightmost Equal-Cost Position (REP) problem as the problem of finding one of the occurrences of a factor whose cost is equal to the cost of the rightmost one. We present the Multi-Layer Suffix Tree data structure that, for…

FOS: Computer and information sciencesOffset (computer science)Computer scienceSuffix treeComputer Science - Information Theorylaw.inventionCombinatoricslawLog-log plotComputer Science - Data Structures and AlgorithmsCompression schemetext compressiondictionary text compressionData Structures and Algorithms (cs.DS)LZ77 compressiondata compressionLossless compressionfull text indexSuffix Tree Data StructuresSettore INF/01 - InformaticaInformation Theory (cs.IT)Data structurePrefixCompression ratioCompression scheme; Constant time; Suffix Tree Data StructuresAlgorithmData compressionConstant time
researchProduct

On prefix normal words and prefix normal forms

2016

A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of $1$s and $0$s (a given Parikh vector). Each binary word has an associated set of Parikh vectors of the factors of the word. Using prefix normal words, we provide a characterization of the equivalence class of binary words having the same set of Parikh vectors of their factors. We prove that the language of prefix normal words is not context-free and is strictly contai…

FOS: Computer and information sciencesPrefix codePrefix normal wordPre-necklaceDiscrete Mathematics (cs.DM)General Computer ScienceFormal Languages and Automata Theory (cs.FL)Binary numberComputer Science - Formal Languages and Automata TheoryContext (language use)Binary languageLyndon words0102 computer and information sciences02 engineering and technologyPrefix grammarprefix normal formsKraft's inequalityCharacterization (mathematics)Lyndon word01 natural sciencesPrefix normal formenumerationTheoretical Computer ScienceFOS: Mathematics0202 electrical engineering electronic engineering information engineeringMathematics - CombinatoricsMathematicsDiscrete mathematicsprefix normal words prefix normal forms binary languages binary jumbled pattern matching pre-necklaces Lyndon words enumerationbinary jumbled pattern matchingSettore INF/01 - InformaticaComputer Science (all)pre-necklacesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)prefix normal wordsPrefix010201 computation theory & mathematics020201 artificial intelligence & image processingCombinatorics (math.CO)binary languagesComputer Science::Formal Languages and Automata TheoryWord (group theory)Computer Science - Discrete MathematicsTheoretical Computer Science
researchProduct

Open and Closed Prefixes of Sturmian Words

2013

A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences, otherwise it is open. We deal with the sequence of open and closed prefixes of Sturmian words and prove that this sequence characterizes every finite or infinite Sturmian word up to isomorphisms of the alphabet. We then characterize the combinatorial structure of the sequence of open and closed prefixes of standard Sturmian words. We prove that every standard Sturmian word, after swapping its first letter, can be written as an infinite product of squares of reversed standard words.

FOS: Computer and information sciencesSequenceFibonacci numberDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)Sturmian wordStructure (category theory)Sturmian wordInfinite productComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science - Formal Languages and Automata Theory68R15CombinatoricsPrefixComputer Science::Discrete MathematicsCombinatorics on words Sturmian wordFOS: MathematicsMathematics - CombinatoricsClosed wordsCombinatorics (math.CO)SuffixWord (group theory)Computer Science::Formal Languages and Automata TheoryMathematicsComputer Science - Discrete Mathematics
researchProduct

Binary jumbled string matching for highly run-length compressible texts

2012

The Binary Jumbled String Matching problem is defined as: Given a string $s$ over $\{a,b\}$ of length $n$ and a query $(x,y)$, with $x,y$ non-negative integers, decide whether $s$ has a substring $t$ with exactly $x$ $a$'s and $y$ $b$'s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this index have running time $O(n^2/\log n)$ [Burcsi et al., FUN 2010; Moosa and Rahman, IPL 2010], or $O(n^2/\log^2 n)$ in the word-RAM model [Moosa and Rahman, JDA 2012]. We propose an index constructed directly from the run-length encoding of $s$. The construction time of our index i…

FOS: Computer and information sciencesString algorithmsStructure (category theory)Binary numberG.2.1Data_CODINGANDINFORMATIONTHEORY0102 computer and information sciences02 engineering and technologyString searching algorithm01 natural sciencesComputer Science - Information RetrievalTheoretical Computer ScienceCombinatoricsdata structuresSimple (abstract algebra)Computer Science - Data Structures and AlgorithmsString algorithms; jumbled pattern matching; prefix normal form; data structures0202 electrical engineering electronic engineering information engineeringParikh vectorData Structures and Algorithms (cs.DS)Run-length encodingMathematics68W32 68P05 68P20String (computer science)prefix normal formSubstringComputer Science Applicationsjumbled pattern matching010201 computation theory & mathematicsData structureSignal ProcessingRun-length encoding020201 artificial intelligence & image processingConstant (mathematics)Information Retrieval (cs.IR)Information SystemsInformation Processing Letters
researchProduct

Bifurcation analysis of a TaO memristor model

2019

This paper presents a study of bifurcation in the time-averaged dynamics of TaO memristors driven by narrow pulses of alternating polarities. The analysis, based on a physics-inspired model, focuses on the stable fixed points and on how these are affected by the pulse parameters. Our main finding is the identification of a driving regime when two stable fixed points exist simultaneously. To the best of our knowledge, such bistability is identified in a single memristor for the first time. This result can be readily tested experimentally, and is expected to be useful in future memristor circuit designs.

FOS: Computer and information sciencesstable fixed pointAcoustics and UltrasonicsBistabilityFOS: Physical sciencesComputer Science - Emerging Technologies02 engineering and technologyMemristorFixed pointTopology01 natural scienceslaw.inventionComputer Science::Emerging TechnologieslawMesoscale and Nanoscale Physics (cond-mat.mes-hall)0103 physical sciencesresistance switching memoriesmemristorBifurcation010302 applied physicsPhysicsCondensed Matter - Mesoscale and Nanoscale PhysicsNonlinear Sciences - Chaotic Dynamics021001 nanoscience & nanotechnologyCondensed Matter PhysicsNonlinear Sciences - Adaptation and Self-Organizing SystemsSurfaces Coatings and FilmsElectronic Optical and Magnetic MaterialsPulse (physics)Emerging Technologies (cs.ET)Bifurcation analysisbifurcationChaotic Dynamics (nlin.CD)0210 nano-technologyAdaptation and Self-Organizing Systems (nlin.AO)Journal of Physics D: Applied Physics
researchProduct

Optical Imaging of Coherent Molecular Rotors

2020

International audience; Short laser pulses are widely used for controlling molecular rotational degrees of freedom and inducing molecular alignment, orientation, unidirectional rotation and other types of coherent rotational motion. To follow the ultra-fast rotational dynamics in real time, several techniques for producing molecular movies have been proposed based on the Coulomb explosion of rotating molecules, or recovering molecular orientation from the angular distribution of high-harmonics. The present work offers and demonstrates a novel non-destructive optical method for direct visualization and recording of movies of coherent rotational dynamics in a molecular gas. The technique is b…

FOS: Physical sciences02 engineering and technology01 natural scienceslaw.invention010309 opticsMolecular dynamicsOpticslaw0103 physical sciencesPhysics[PHYS.PHYS.PHYS-OPTICS]Physics [physics]/Physics [physics]/Optics [physics.optics]Linear polarizationbusiness.industryCoulomb explosionRotation around a fixed axisPolarizer021001 nanoscience & nanotechnologyCondensed Matter PhysicsLaserPolarization (waves)Atomic and Molecular Physics and OpticsElectronic Optical and Magnetic Materials0210 nano-technologybusinessUltrashort pulseOptics (physics.optics)Physics - OpticsLaser & Photonics Reviews
researchProduct

FSW of Lap and T-Joints

2010

Even if in the last years several researches have studied the Friction Stir Welding (FSW) process, it should be observed that most of these studies are concerned with the butt joint and just a few of them extend to more complex geometries. It is worthy to notice that the acquired knowledge on FSW process of butt joints is not immediately extendable to lap and T-joints. The first observation is that in butt joints the surface to be welded is vertical, while in lap and T-joints it is horizontal and placed at the bottom of the top blank to be welded; in this way a major vertical component of the material flow is required to obtain sound joints. In the FSW of lap-joints four different geometric…

FSW Lap joint T jointMaterials sciencebusiness.industryStructural engineeringWeldingFixtureBlankClampingForgingMaterial flowlaw.inventionlawButt jointFriction stir weldingbusinessSettore ING-IND/16 - Tecnologie E Sistemi Di Lavorazione
researchProduct

Can we compare haemophilia carriers with clotting factor deficiency to male patients with mild haemophilia?

2020

Introduction Certain haemophilia carriers demonstrate an increased bleeding tendency, mainly related to clotting factor deficiency. No study has so far formally compared the bleeding phenotype of women and girls with mild FVIII or FIX deficiency and associated management with that of male patients affected by mild haemophilia A and B. Material and methods We retrospectively evaluated 44 women and girls with mild FVIII or FIX deficiency (FVIII or FIX 0.05-0.5 IU/mL) and 77 male patients with mild haemophilia A or B and compared them with respect to clotting factor level, age at and trigger for diagnosis, as well as treatment modalities. Results After excluding gender-related haemorrhagic sym…

FVIIImild haemophiliaAdultMalePediatricsmedicine.medical_specialtycongenital hereditary and neonatal diseases and abnormalitiesHeterozygoteAdolescentMucocutaneous zonecarriersPlasma factorAge at diagnosis030204 cardiovascular system & hematologyHaemophiliaHemophilia AHemostatics03 medical and health sciencesYoung Adult0302 clinical medicinecarrierhemic and lymphatic diseasesmedicineHumansDeamino Arginine VasopressinClotting factor deficiencyChildGenetics (clinical)AgedClotting factorAged 80 and overbusiness.industryFIXHematologyGeneral MedicineMiddle Agedmedicine.diseaseBlood Coagulation Factorsbleeding phenotypebleeding phenotype carriers FIX FVIII mild haemophiliaMale patientChild PreschoolMild haemophilia AFemalebusiness030215 immunologyHaemophilia : the official journal of the World Federation of HemophiliaREFERENCES
researchProduct

Minimal change list for Lucas strings and some graph theoretic consequences

2005

AbstractWe give a minimal change list for the set of order p length-n Lucas strings, i.e., the set of length-n binary strings with no p consecutive 1's nor a 1ℓ prefix and a 1m suffix with ℓ+m⩾p. The construction of this list proves also that the order p n-dimensional Lucas cube has a Hamiltonian path if and only if n is not a multiple of p+1, and its second power always has a Hamiltonian path.

Fibonacci numberGeneral Computer ScienceLucas sequenceCube (algebra)Fibonacci and Lucas stringHamiltonian pathTheoretical Computer ScienceCombinatoricsGray codeSet (abstract data type)symbols.namesakesymbolsHamiltonian pathOrder (group theory)Minimal change listSuffixGray codeLucas cubeComputer Science(all)MathematicsTheoretical Computer Science
researchProduct

Large-N kinetic theory for highly occupied systems

2018

We consider an effective kinetic description for quantum many-body systems, which is not based on a weak-coupling or diluteness expansion. Instead, it employs an expansion in the number of field components N of the underlying scalar quantum field theory. Extending previous studies, we demonstrate that the large-N kinetic theory at next-to-leading order is able to describe important aspects of highly occupied systems, which are beyond standard perturbative kinetic approaches. We analyze the underlying quasiparticle dynamics by computing the effective scattering matrix elements analytically and solve numerically the large-N kinetic equation for a highly occupied system far from equilibrium. T…

Field (physics)Lattice field theoryFOS: Physical sciencesFixed point01 natural sciencesMany-body problemHigh Energy Physics - Phenomenology (hep-ph)0103 physical sciencessirontanonperturbative effects in field theoryQuantum field theory010306 general physicsdynamiikkaPhysicsta114010308 nuclear & particles physicsScalar (physics)finite temperature field theoryultracold gasesHigh Energy Physics - PhenomenologyDistribution functionClassical mechanicsQuantum Gases (cond-mat.quant-gas)Kinetic theory of gaseskvanttikenttäteoriaCondensed Matter - Quantum Gasesrelativistic heavy-ion collisions
researchProduct