Search results for "code"

showing 10 items of 1180 documents

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word

2020

A prefix normal word is a binary word with the property that no substring has more $1$s than the prefix of the same length. By proving that the set of prefix normal words is a bubble language, we can exhaustively list all prefix normal words of length $n$ as a combinatorial Gray code, where successive strings differ by at most two swaps or bit flips. This Gray code can be generated in $\Oh(\log^2 n)$ amortized time per word, while the best generation algorithm hitherto has $\Oh(n)$ running time per word. We also present a membership tester for prefix normal words, as well as a novel characterization of bubble languages.

FOS: Computer and information sciencesGeneral Computer ScienceFormal Languages and Automata Theory (cs.FL)Property (programming)combinatorial Gray codeComputer Science - Formal Languages and Automata TheoryData_CODINGANDINFORMATIONTHEORY0102 computer and information sciences02 engineering and technologyCharacterization (mathematics)01 natural sciencesTheoretical Computer ScienceCombinatoricsSet (abstract data type)Gray codeComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)MathematicsAmortized analysisSettore INF/01 - Informaticaprefix normal wordsSubstringcombinatorial generationPrefixjumbled pattern matching010201 computation theory & mathematics020201 artificial intelligence & image processingbinary languagesprefix normal words binary languages combinatorial Gray code combinatorial generation jumbled pattern matchingWord (computer architecture)Theoretical Computer Science
researchProduct

Estimating crop primary productivity with Sentinel-2 and Landsat 8 using machine learning methods trained with radiative transfer simulations

2019

Abstract Satellite remote sensing has been widely used in the last decades for agricultural applications, both for assessing vegetation condition and for subsequent yield prediction. Existing remote sensing-based methods to estimate gross primary productivity (GPP), which is an important variable to indicate crop photosynthetic function and stress, typically rely on empirical or semi-empirical approaches, which tend to over-simplify photosynthetic mechanisms. In this work, we take advantage of all parallel developments in mechanistic photosynthesis modeling and satellite data availability for an advanced monitoring of crop productivity. In particular, we combine process-based modeling with …

FOS: Computer and information sciencesLandsat 8Earth observation010504 meteorology & atmospheric sciencesComputer Vision and Pattern Recognition (cs.CV)0208 environmental biotechnologyComputer Science - Computer Vision and Pattern RecognitionSoil Science02 engineering and technologyGross primary productivity (GPP)Sentinel-2 (S2)Machine learningcomputer.software_genre01 natural sciencesRadiative transfer modeling (RTM)Atmospheric radiative transfer codesSoil-canopy-observation of photosynthesis and the energy balance (SCOPE)Computers in Earth SciencesC3 crops0105 earth and related environmental sciencesRemote sensing2. Zero hungerArtificial neural networkbusiness.industryEmpirical modellingNeural networks (NN)GeologyVegetationMachine learning (ML)15. Life on landHybrid approach22/4 OA procedure020801 environmental engineeringVariable (computer science)ITC-ISI-JOURNAL-ARTICLEEnvironmental scienceSatelliteArtificial intelligenceScale (map)businesscomputerRemote sensing of environment
researchProduct

Detecting informative higher-order interactions in statistically validated hypergraphs

2021

Recent empirical evidence has shown that in many real-world systems, successfully represented as networks, interactions are not limited to dyads, but often involve three or more agents at a time. These data are better described by hypergraphs, where hyperlinks encode higher-order interactions among a group of nodes. In spite of the large number of works on networks, highlighting informative hyperlinks in hypergraphs obtained from real world data is still an open problem. Here we propose an analytic approach to filter hypergraphs by identifying those hyperlinks that are over-expressed with respect to a random null hypothesis, and represent the most relevant higher-order connections. We apply…

FOS: Computer and information sciencesPhysics - Physics and SocietyComputer scienceQC1-999Open problemFOS: Physical sciencesGeneral Physics and AstronomyPhysics and Society (physics.soc-ph)Astrophysicscomputer.software_genreENCODEMethodology (stat.ME)Statistics - MethodologySocial and Information Networks (cs.SI)PhysicsComputer Science - Social and Information NetworksFilter (signal processing)HyperlinkClass (biology)Settore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)QB460-466Pairwise comparisonData miningNoise (video)Null hypothesiscomputerhigher order interactions statistical validation complex networksCommunications Physics
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

Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform

2012

Motivation The Burrows-Wheeler transform (BWT) is the foundation of many algorithms for compression and indexing of text data, but the cost of computing the BWT of very large string collections has prevented these techniques from being widely applied to the large sets of sequences often encountered as the outcome of DNA sequencing experiments. In previous work, we presented a novel algorithm that allows the BWT of human genome scale data to be computed on very moderate hardware, thus enabling us to investigate the BWT as a tool for the compression of such datasets. Results We first used simulated reads to explore the relationship between the level of compression and the error rate, the leng…

FOS: Computer and information sciencesStatistics and ProbabilityBurrows–Wheeler transformComputer scienceData_CODINGANDINFORMATIONTHEORYBurrows-Wheeler transformcomputer.software_genreBiochemistryBurrows-Wheeler transform; Data Compression; Next-generation sequencingComputer Science - Data Structures and AlgorithmsEscherichia coliCode (cryptography)HumansOverhead (computing)Data Structures and Algorithms (cs.DS)Computer SimulationQuantitative Biology - GenomicsMolecular BiologyGenomics (q-bio.GN)Genome HumanString (computer science)Search engine indexingSortingGenomicsSequence Analysis DNAConstruct (python library)Data CompressionComputer Science ApplicationsComputational MathematicsComputational Theory and MathematicsFOS: Biological sciencesNext-generation sequencingData miningDatabases Nucleic AcidcomputerAlgorithmsData compression
researchProduct

The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes

2021

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple input single output (MISO) channel there exist very few methods to analyze the DMT of such codes. Further, apart from the MISO case, no DMT optimal asymmetric codes are known. We first discuss previous criteria used to analyze the DMT of space-time codes and comment on why these methods fail when applied to asymmetric codes. We then consider two special classes of asymmetric codes where the code-words are restricted to either real or quaternion matrices. We p…

FOS: Computer and information sciencesmaximum likelihood decodingComputer Science - Information TheoryInformation Theory (cs.IT)upper boundspace-time codes020206 networking & telecommunications02 engineering and technologyalgebraLibrary and Information SciencesencodingtiedonsiirtoComputer Science ApplicationslatticeskoodausteoriaMIMO-tekniikka0202 electrical engineering electronic engineering information engineeringMIMO communicationComputer Science::Information TheoryInformation SystemsIEEE Transactions on Information Theory
researchProduct

Granice zewnętrzne Unii Europejskiej a bezpieczeństwo narodowe państw członkowskich w kontekście współczesnego kryzysu migracyjnego

2016

Unia Europejska jest miejscem, w którym swoboda obywateli wyrażona jest poprzez możliwość przemieszania się, podróżowania, pracy,nauki lub życia w wybranym kraju UE. Realizacja tej wolności była wynikiem zniesienia kontroli na granicach wewnętrznych Unii. Jednak dla członka UE ceną tej wolności jest konieczność zapewnienia bezpieczeństwa narodowego, co sprawia, że ochronę granic zewnętrznych postrzega się jako specjalne zadanie. Unia Europejska, za pośrednictwem układu z Schengen, tworzy instytucje w zakresie ochrony granic zewnętrznych, w zakresie zapewnienia bezpieczeństwa narodowego państw członkowskich. Obecny kryzys migracyjny jest weryfikacją skuteczności tych instytucji.

FRONTEXEuropejska Sieć Patroli (EPN)Schengen Borders CodePolicy of integrated border managementKonwencja DublińskaRapid Border Intcrvention Tcams (RABIT)Układ z SchengenEuropean Border Surveillance System (EUROSUR)Prum Conventionthe Schengen ConventionKodeks Graniczny SchengenPolityka zintegrowanego zarządzania granicamiEuropean Patrols Network (EPN)Konwencja SchengenZespoły szybkiej interwencji na granicy (RAB1T)Schengen AgreementKonwencja z PrumEuropejski System Nadzoru Granicznego (EUROSUR)Dublin ConventionFRONTEX Agency
researchProduct

More restrictive Gray codes for some classes of pattern avoiding permutations

2009

In a recent article [W.M.B. Dukes, M.F. Flanagan, T. Mansour, V. Vajnovszki, Combinatorial Gray codes for classes of pattern avoiding permutations, Theoret. Comput. Sci. 396 (2008) 35-49], Dukes, Flanagan, Mansour and Vajnovszki present Gray codes for several families of pattern avoiding permutations. In their Gray codes two consecutive objects differ in at most four or five positions, which is not optimal. In this paper, we present a unified construction in order to refine their results (or to find other Gray codes). In particular, we obtain more restrictive Gray codes for the two Wilf classes of Catalan permutations of length n; two consecutive objects differ in at most two or three posit…

Fibonacci number010103 numerical & computational mathematics0102 computer and information sciences01 natural sciencesComputer Science ApplicationsTheoretical Computer ScienceCatalan numberCombinatoricsGray codePermutation010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Signal ProcessingOrder (group theory)0101 mathematicsComputingMilieux_MISCELLANEOUSBinomial coefficientInformation SystemsMathematicsInformation Processing Letters
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

Towards a Reference Architecture for Model-Driven Business Apps

2016

Model-driven development techniques have been proposed for cross-platform app development. Typically, an individual domain-specific language (DSL) is used. The MD² framework consists of a DSL for business apps and generators, which transform a domain model to native platform code. Prior research on it focused on language and general generator design, this paper accentuates the code generation stage. A reference architecture for the generated apps is proposed to accelerate the development of new generators for which architectural decisions had been made on ad-hoc basis up to now. Moreover, generators are going to expose similar structures that facilitate maintenance. Our proposal takes MD²'s…

Flexibility (engineering)Enterprise architecture frameworkbusiness.industryComputer scienceMobile computing020207 software engineering02 engineering and technologySoftwareApplications architectureBusiness architecture0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingCode generationReference architectureSoftware engineeringbusiness2016 49th Hawaii International Conference on System Sciences (HICSS)
researchProduct