Search results for "IONT"

showing 10 items of 382 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

Security of public key cryptosystems based on Chebyshev Polynomials

2004

Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper we study a public key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries …

FOS: Computer and information sciencesPlaintext-aware encryptionTheoretical computer scienceComputer Science - Cryptography and SecurityCramer–Shoup cryptosystemData_CODINGANDINFORMATIONTHEORYDeterministic encryptionHybrid cryptosystemCryptosystemElectrical and Electronic EngineeringSemantic securityThreshold cryptosystemCryptography and Security (cs.CR)Goldwasser–Micali cryptosystemMathematics
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

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

A generalized method for the design of ergodic sum-of-cisoids simulators for multiple uncorrelated rayleigh fading channels

2010

In this paper, we present a new method for the design of ergodic sum-of-sinusoids (SOS) simulation models for multiple uncorrelated Rayleigh fading channels. The method, which is intended for a special class of SOS models, known as sum-of-cisoids (SOC) models, can be used to generate an arbitrary number of uncorrelated Rayleigh fading waveforms with specified Doppler power spectral characteristics. This is in contrast to the SOS simulators currently available in the open literature that have been designed under the isotropic scattering assumption, which are limited to the simulation of uncorrelated channels characterized by Clarke's U-shaped Doppler power spectral density (DPSD). The excell…

Fading distributionScatteringStochastic processControl theoryMIMOSpectral densityErgodic theoryData_CODINGANDINFORMATIONTHEORYCommunications systemAlgorithmComputer Science::Information TheoryMathematicsRayleigh fading2010 4th International Conference on Signal Processing and Communication Systems
researchProduct

Technological and molecular diversity of Lactobacillus plantarum strains isolated from naturally fermented sourdoughs.

2004

Thirty Lactobacillus (L.) plantarum strains, isolated from sourdough, were identified by biochemical tests as well as 16S rDNA sequencing and differentiated on the basis of technological properties, such as amylase, protease, phytase and antirope activities. These properties were shown to be widely differing among the strains, indicating a significant technological diversity. Genetic differentiation was achieved by restriction endonuclease analysis-pulsed field gel electrophoresis (REA-PFGE) that allowed the L. plantarum strains to be divided into 10 different genomic groups. Moreover, 32 different starters were employed in dough making experiments; each starter consisted of a single strain…

Fermentation starterMolecular Sequence DataApplied Microbiology and BiotechnologyMicrobiologyDNA RibosomalStarterLactobacillusRNA Ribosomal 16SFood scienceAmylaseEcology Evolution Behavior and SystematicsLeavening agentLactobacillus plantarum – starter cultures – sourdough – molecular differentiation – technological properties – dough makingbiologyfood and beveragesGenetic VariationBreadSequence Analysis DNAbiology.organism_classificationYeastLactobacillus plantarumstarter culturessourdoughmolecular differentiationtechnological propertiesdough makingLactobacillusFermentationbiology.proteinbacteriaFermentationLactobacillus plantarumSettore AGR/16 - Microbiologia AgrariaSystematic and applied microbiology
researchProduct

Variation in contents of main active components and antioxidant activity in leaves of different pigeon pea cultivars during growth.

2013

Pigeon pea is an important and multiuse grain legume crop, and its leaves are a very valuable natural resource. To obtain a high-quality biological resource, it is necessary to choose the excellent cultivar and determine the appropriate harvest time. In this study, the variation in contents of main active components and antioxidant activity in leaves of six pigeon pea cultivars during growth were investigated. The level of each individual active component significantly varied during growth, but with a different pattern, and this variation was different among cultivars. Flavonoid glycosides orientin, vitexin, and apigenin-6,8-di-C-α-L-arabinopyranoside showed two peak values at mid-late and …

FlavonoidsAntioxidantPlant ExtractsHarvest timemedicine.medical_treatmentActive componentsData_CODINGANDINFORMATIONTHEORYGeneral ChemistryBiologyAntioxidantsCropPlant LeavesHorticultureCajanusPhenolsBotanymedicineCultivarGlycosidesGeneral Agricultural and Biological SciencesLegumeJournal of agricultural and food chemistry
researchProduct

A simple joint estimation-detection technique for OFDM systems

2005

In this work a simple approach for the joint estimation-detection in a frequency selective severe fading environment of OFDM signals adopting PSK constellations is presented. A linear predictor of suitable order is adopted for the channel estimation in the frequency domain. The predictor coefficients are estimated on the basis of a sample estimation of the autocorrelation of the channel frequency response, aided by a preliminary differential decoding, in a blockwise manner. The detection technique proposed here is based on a simple tree search where a small number of best survivor paths are maintained at each step. Despite the simplicity of above detection approach, the simulation results s…

Frequency responseOrthogonal frequency division multiplexingComputer scienceOrthogonal frequency-division multiplexingChannel estimationLinear predictionData_CODINGANDINFORMATIONTHEORYControl and Systems Engineeringpilot symbolsFrequency domainSignal ProcessingElectronic engineeringFadingComputer Vision and Pattern RecognitionElectrical and Electronic EngineeringAlgorithmSoftwareDecoding methodsMultipath propagationComputer Science::Information TheoryCommunication channelPhase-shift keying
researchProduct

A Trajectory-Driven 3D Non-Stationary mm-Wave MIMO Channel Model for a Single Moving Point Scatterer

2021

This paper proposes a new non-stationary three-dimensional (3D) channel model for a physical millimeter wave (mm-Wave) multiple-input multiple-output (MIMO) channel. This MIMO channel model is driven by the trajectory of a moving point scatterer, which allows us to investigate the impact of a single moving point scatterer on the propagation characteristics in an indoor environment. Starting from the time-variant (TV) channel transfer function, the temporal behavior of the proposed non-stationary channel model has been analyzed by studying the TV micro-Doppler characteristics and the TV mean Doppler shift. The proposed channel model has been validated by measurements performed in an indoor e…

General Computer ScienceComputer scienceAcousticsMIMOData_CODINGANDINFORMATIONTHEORYMotion capturesymbols.namesakemm-Wave channelsInertial measurement unitGeneral Materials Sciencemean Doppler shiftVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550Computer Science::Information Theorymultipath propagationGeneral EngineeringPendulumnon-stationary channelsTK1-9971MIMO channelTrajectorysymbolsSpectrogramElectrical engineering. Electronics. Nuclear engineeringchannel measurementsDoppler effectCommunication channelIEEE Access
researchProduct

Mappings of finite distortion: Sharp Orlicz-conditions

2003

We establish continuity, openness and discreteness, and the condition $(N)$ for mappings of finite distortion under minimal integrability assumptions on the distortion.

General MathematicsDistortionMathematical analysisData_MISCELLANEOUSComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONData_CODINGANDINFORMATIONTHEORYfinite distortionTopologycontinuityopenness and discretenessMathematicsOrlicz conditions30C65
researchProduct