Search results for "Compres"

showing 10 items of 1107 documents

Reducing complexity in H.264/AVC motion estimation by using a GPU

2011

H.264/AVC applies a complex mode decision technique that has high computational complexity in order to reduce the temporal redundancies of video sequences. Several algorithms have been proposed in the literature in recent years with the aim of accelerating this part of the encoding process. Recently, with the emergence of many-core processors or accelerators, a new approach can be adopted for reducing the complexity of the H.264/AVC encoding algorithm. This paper focuses on reducing the inter prediction complexity adopted in H.264/AVC and proposes a GPU-based implementation using CUDA. Experimental results show that the proposed approach reduces the complexity by as much as 99% (100x of spe…

SpeedupComputational complexity theoryComputer science020206 networking & telecommunicationsData_CODINGANDINFORMATIONTHEORY02 engineering and technologyParallel computingCUDAAlgorithmic efficiency0202 electrical engineering electronic engineering information engineeringWorst-case complexity020201 artificial intelligence & image processingContext-adaptive binary arithmetic codingData compressionContext-adaptive variable-length coding
researchProduct

On-line Construction of Two-Dimensional Suffix Trees

1999

AbstractWe say that a data structure is builton-lineif, at any instant, we have the data structure corresponding to the input we have seen up to that instant. For instance, consider the suffix tree of a stringx[1,n]. An algorithm building iton-lineis such that, when we have read the firstisymbols ofx[1,n], we have the suffix tree forx[1,i]. We present a new technique, which we refer to asimplicit updates, based on which we obtain: (a) an algorithm for theon-lineconstruction of the Lsuffix tree of ann×nmatrixA—this data structure is the two-dimensional analog of the suffix tree of a string; (b) simple algorithms implementing primitive operations forLZ1-typeon-line losslessimage compression m…

Statistics and ProbabilityCompressed suffix arrayNumerical AnalysisControl and OptimizationAlgebra and Number TheoryTheoretical computer scienceApplied MathematicsGeneral MathematicsSuffix treeString (computer science)Generalized suffix treelaw.inventionLongest common substring problemTree (data structure)lawSuffixAlgorithmFM-indexMathematicsJournal of Complexity
researchProduct

Step-by-Step Control of the Dynamics of a Superconducting QED-like System

2007

We discuss the modus operandi of a theoretical scalable coupling scheme to control step by step the time evolution of a pair of flux qubits embedded in a lossy resonant cavity. The sequential interaction of each qubit with the quantized cavity mode is controlled by externally applied magnetic fluxes. Our analysis indicates that indirect qubit-qubit interactions, with the electromagnetic mode acting as a data bus, can be selectively performed and exploited both for the implementation of entangling gates and for the generation of states with a priori known characteristics.

Statistics and ProbabilityCouplingPhysicsSuperconductivityFlux qubitComplex systemTime evolutionStatistical and Nonlinear PhysicsData_CODINGANDINFORMATIONTHEORYQuantum PhysicsLossy compressioncoupling schemeTopologyComputer Science::Emerging TechnologiesControl theoryQubitHardware_ARITHMETICANDLOGICSTRUCTURESMathematical PhysicsSystem busOpen Systems & Information Dynamics
researchProduct

Textual data compression in computational biology: a synopsis.

2009

Abstract Motivation: Textual data compression, and the associated techniques coming from information theory, are often perceived as being of interest for data communication and storage. However, they are also deeply related to classification and data mining and analysis. In recent years, a substantial effort has been made for the application of textual data compression techniques to various computational biology tasks, ranging from storage and indexing of large datasets to comparison and reverse engineering of biological networks. Results: The main focus of this review is on a systematic presentation of the key areas of bioinformatics and computational biology where compression has been use…

Statistics and ProbabilityDatabases Factualbusiness.industryComputer sciencemedia_common.quotation_subjectSearch engine indexingcompression dataComputational BiologyInformation Storage and RetrievalComputational biologyBiochemistryData scienceComputer Science ApplicationsComputational MathematicsPresentationSoftwareComputational Theory and MathematicsBenchmark (computing)businessMolecular BiologyBiological networkSoftwareData compressionmedia_commonBioinformatics (Oxford, England)
researchProduct

Adaptive reference-free compression of sequence quality scores

2014

Motivation: Rapid technological progress in DNA sequencing has stimulated interest in compressing the vast datasets that are now routinely produced. Relatively little attention has been paid to compressing the quality scores that are assigned to each sequence, even though these scores may be harder to compress than the sequences themselves. By aggregating a set of reads into a compressed index, we find that the majority of bases can be predicted from the sequence of bases that are adjacent to them and hence are likely to be less informative for variant calling or other applications. The quality scores for such bases are aggressively compressed, leaving a relatively small number at full reso…

Statistics and ProbabilityFOS: Computer and information sciencesComputer sciencemedia_common.quotation_subjectReference-freecomputer.software_genreBiochemistryDNA sequencingSet (abstract data type)Redundancy (information theory)BWTComputer Science - Data Structures and AlgorithmsCode (cryptography)AnimalsHumansQuality (business)Data Structures and Algorithms (cs.DS)Quantitative Biology - GenomicsCaenorhabditis elegansMolecular Biologymedia_commonGenomics (q-bio.GN)SequenceGenomeSettore INF/01 - Informaticareference-free compressionHigh-Throughput Nucleotide SequencingGenomicsSequence Analysis DNAData CompressioncompressionComputer Science ApplicationsComputational MathematicsComputational Theory and MathematicsFOS: Biological sciencesData miningquality scoreMetagenomicscomputerBWT; compression; quality score; reference-free compressionAlgorithmsReference genome
researchProduct

Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices

1999

AbstractWe describe fast parallel algorithms for building index data structures that can be used to gather various statistics on square matrices. The main data structure is the Lsuffix tree, which is a generalization of the classical suffix tree for strings. Given ann×ntext matrixA, we build our data structures inO(logn) time withn2processors on a CRCW PRAM, so that we can quickly processAin parallel as follows: (i) report some statistical information aboutA, e.g., find the largest repeated square submatrices that appear at least twice inAor determine, for each position inA, the smallest submatrix that occurs only there; (ii) given, on-line, anm×mpattern matrixPAT, check whether it occurs i…

Statistics and ProbabilityNumerical AnalysisControl and OptimizationAlgebra and Number TheoryApplied MathematicsGeneral MathematicsSuffix treeParallel algorithmData structureSquare matrixSquare (algebra)law.inventionTree (data structure)lawPattern matchingAlgorithmMathematicsData compressionJournal of Complexity
researchProduct

The Mean-Field Limit for Solid Particles in a Navier-Stokes Flow

2008

We propose a mathematical derivation of Brinkman's force for a cloud of particles immersed in an incompressible viscous fluid. Specifically, we consider the Stokes or steady Navier-Stokes equations in a bounded domain Omega subset of R-3 for the velocity field u of an incompressible fluid with kinematic viscosity v and density 1. Brinkman's force consists of a source term 6 pi rvj where j is the current density of the particles, and of a friction term 6 pi vpu where rho is the number density of particles. These additional terms in the motion equation for the fluid are obtained from the Stokes or steady Navier-Stokes equations set in Omega minus the disjoint union of N balls of radius epsilo…

Stokes equation01 natural sciencesHomogenization (chemistry)Navier-Stokes equationPhysics::Fluid DynamicsMathematics - Analysis of PDEsFOS: Mathematics[MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP]Boundary value problem0101 mathematicsMathematical Physics(MSC) 35Q30 35B27 76M50Particle systemPhysicsHomogenization010102 general mathematicsMathematical analysis35Q30 35B27 76M50Stokes equationsStatistical and Nonlinear Physics010101 applied mathematicsFlow velocityDragSuspension FlowsBounded functionCompressibilityBall (bearing)Navier-Stokes equationsAnalysis of PDEs (math.AP)
researchProduct

Increase in dissolution rate of sodium chlorate induced by elastic strain

2001

Recent experimental studies carried out on the kinetics of crystal growth in solution have revealed that mechanically induced elastic strain can have a strong influence on the crystal growth rate. We present experimental evidence to show that it can also strongly affect the dissolution rate. Sodium chlorate crystals held in an undersaturated sodium chlorate solution and uniaxially stressed in compression to values up to 15 MPa dissolved up to about 1.3 times faster than crystals free of stress. The increase in dissolution rate varies linearly with the stress.

Strain (chemistry)ChemistryInorganic chemistryKineticsAnalytical chemistryCrystal growthCondensed Matter PhysicsInorganic ChemistryStress (mechanics)chemistry.chemical_compoundMaterials ChemistryCompression (geology)Elasticity (economics)DissolutionSodium chlorateJournal of Crystal Growth
researchProduct

Competition between the buckling-driven delamination and wrinkling in compressed thin coatings

2012

Abstract The competition between two common failure modes of a thin coating under in-plane compression, the surface wrinkling and the buckling-driven delamination, is studied to assess the critical strain when the mechanical instability may occur at given geometrical and material parameters. A buckling map is constructed based on results of a finite element analysis, which relates the critical applied strain for the onset of instability to the interface adhesion and elastic properties of materials. An approximate scaling relation is derived for the energy release rate of buckling-driven delamination of a coating deposited on a compliant substrate.

Strain energy release rateMaterials sciencebusiness.industryDelaminationStructural engineeringengineering.materialCondensed Matter PhysicsCompression (physics)InstabilityAtomic and Molecular Physics and OpticsFinite element methodSurfaces Coatings and FilmsElectronic Optical and Magnetic MaterialsCoatingBucklingengineeringElectrical and Electronic EngineeringComposite materialSafety Risk Reliability and QualitybusinessMaterial propertiesMicroelectronics Reliability
researchProduct

Recristallisation Dynamique au Cours de la Déformation à Chaud de Quatre Nuances de Bronze à 9% d'Etain

1995

Pour cerner les techniques metallurgiques des artisans protohistoriques, il est necessaire de connaitre les evolutions microstructurales obtenues selon les deformations imposees. La compression a chaud de deux bronzes industriels (contenant soit 0,026% soit 0,26% de zinc) et deux bronzes «archeologiques» (contenant soit 0,5% de soufre soit 0,5% de soufre et 0,5% de plomb) permet les observations suivantes : - Les comportements des bronzes «archeologiques» sont tres similaires : jusqu'a 600°C pour e = 0,1 on n'observe pas de recristallisation ; pour e = 1,2 on observe une recristallisation en collier le long des joints de grains. A 750°C la recristallisation semble homogene dans tout le mate…

Strain softeningMaterials scienceengineeringGeneral Physics and AstronomyCompression testBronzeengineering.materialHumanitiesLe Journal de Physique IV
researchProduct