Search results for "Computer Science Application"

showing 10 items of 3998 documents

Coordination in a multi-cell multi-antenna multi-user W-CDMA system: a beamforming approach

2008

The problem of designing joint power control and optimal beamforming (JPCOB) algorithms for the downlink of a coordinated multi-cell WCDMA system is considered throughout this paper. In this case, the JPCOB design is formulated as the problem of minimizing the total transmitted power in the coordinated multi-cell system, subject to a certain quality of service requirement for each user. In this paper, the performance of two JPCOB algorithms based on different beamforming approaches is compared over the coordinated multi-cell system. The first one, obtains local beamformers by means of the well-known virtual uplink-downlink duality. In contrast, the second algorithm implements multi-base bea…

BeamformingWSDMAComputer scienceCode division multiple accessApplied MathematicsReal-time computingEqualizerData_CODINGANDINFORMATIONTHEORYInterference (wave propagation)Computer Science ApplicationsSpread spectrumTelecomunicacióBase stationAsynchronous communicationTelecommunications linkComputer Science::Networking and Internet ArchitectureSistemes multimèdiaAlgorithm designElectrical and Electronic EngineeringAntenna (radio)Power controlComputer Science::Information Theory
researchProduct

Isotopic Effect on the Kinetics of the Belousov-Zhabotinsky Reaction

2007

In this work we present results about the deuterium isotope effect on the global kinetics of a Belousov-Zhabotinsky reaction in batch conditions. A nonlinear dependence of the Induction Period upon the percentage of deuterated reactants was found. The isotopic effect on the bromination reaction of malonic acid was evaluated.

Belousov-Zhabotinsky reactionInduction periodKineticsInorganic chemistryBelousov-ZhabotinskyBromination reactionMalonic acidIsotopic effectCatalysislcsh:ChemistryInorganic Chemistrychemistry.chemical_compoundBromination reaction.Kinetic isotope effectPhysical and Theoretical Chemistrylcsh:QH301-705.5Molecular BiologySpectroscopyInduction PeriodChemistryCommunicationOrganic ChemistryBelousov-Zhabotinsky; reaction Isotopic effect; Induction Period; Enolization; Bromination reactionHalogenationGeneral MedicineKeto–enol tautomerismEnolizationComputer Science ApplicationsCHIM/02 Chimica fisicareaction Isotopic effectBelousov–Zhabotinsky reactionlcsh:Biology (General)lcsh:QD1-999DeuteriumPhysical chemistryInternational Journal of Molecular Sciences
researchProduct

FASTA/Q data compressors for MapReduce-Hadoop genomics: space and time savings made easy

2021

Abstract Background Storage of genomic data is a major cost for the Life Sciences, effectively addressed via specialized data compression methods. For the same reasons of abundance in data production, the use of Big Data technologies is seen as the future for genomic data storage and processing, with MapReduce-Hadoop as leaders. Somewhat surprisingly, none of the specialized FASTA/Q compressors is available within Hadoop. Indeed, their deployment there is not exactly immediate. Such a State of the Art is problematic. Results We provide major advances in two different directions. Methodologically, we propose two general methods, with the corresponding software, that make very easy to deploy …

Big DataFASTQ formatComputer scienceBig data02 engineering and technologycomputer.software_genrelcsh:Computer applications to medicine. Medical informaticsBiochemistry03 medical and health sciencesSoftwareStructural BiologySpark (mathematics)0202 electrical engineering electronic engineering information engineeringData_FILESMapReduceMapReduce; hadoop; sequence analysis; data compressionMolecular Biologylcsh:QH301-705.5030304 developmental biologyFile system0303 health sciencesSettore INF/01 - InformaticaDatabasebusiness.industryMethodology ArticleApplied MathematicsSequence analysisGenomicsData compression; Hadoop; MapReduce; Sequence analysis; Algorithms; Big Data; Data Compression; Genomics; SoftwareComputer Science Applicationslcsh:Biology (General)Software deploymentHadoopData compressionlcsh:R858-859.7020201 artificial intelligence & image processingState (computer science)businesscomputerAlgorithmsSoftwareData compressionBMC Bioinformatics
researchProduct

Computation of the area in the discrete plane: Green’s theorem revisited

2017

International audience; The detection of the contour of a binary object is a common problem; however, the area of a region, and its moments, can be a significant parameter. In several metrology applications, the area of planar objects must be measured. The area is obtained by counting the pixels inside the contour or using a discrete version of Green's formula. Unfortunately, we obtain the area enclosed by the polygonal line passing through the centers of the pixels along the contour. We present a modified version of Green's theorem in the discrete plane, which allows for the computation of the exact area of a two-dimensional region in the class of polyominoes. Penalties are introduced and …

Binary Objectcontour detectionPolyominoComputationGeometry0102 computer and information sciences02 engineering and technology01 natural sciencesconnectednessPick's theoremsymbols.namesake0202 electrical engineering electronic engineering information engineeringPick's theoremElectrical and Electronic EngineeringGreen's theoremMathematicsDigital picturesPixelMathematical analysisImage segmentationAtomic and Molecular Physics and OpticsComputer Science Applications[SPI.TRON]Engineering Sciences [physics]/Electronics010201 computation theory & mathematics[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV]Binary datasymbols[SPI.OPTI]Engineering Sciences [physics]/Optics / Photonic020201 artificial intelligence & image processingpolyominoesGreen's theorem
researchProduct

A distance metric on binary trees using lattice-theoretic measures

1990

A so called height function which is a strictly antitone supervaluation is defined on binary trees. Via lattice-theoretic results and using the height function, we can define a distance metric on binary trees of size n which can be computed in expected time O(n 3/2 )

Binary treeData structureRandom binary treeComputer Science ApplicationsTheoretical Computer ScienceHeight functionCombinatoricsTree structureLattice (order)Signal ProcessingMetric (mathematics)Metric treeComputer Science::DatabasesInformation SystemsMathematicsInformation Processing Letters
researchProduct

Efficient lower and upper bounds of the diagonal-flip distance between triangulations

2006

There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.

Binary treeOpen problem010102 general mathematicsDiagonalApproximation algorithmTriangulation (social science)0102 computer and information sciences01 natural sciencesUpper and lower boundsComputer Science ApplicationsTheoretical Computer ScienceCombinatorics010201 computation theory & mathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYSignal Processing[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsRotation (mathematics)Time complexityComputingMilieux_MISCELLANEOUSInformation SystemsMathematics
researchProduct

An efficient upper bound of the rotation distance of binary trees

2000

A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.

Binary treeRegular polygonComputer Science::Computational GeometryUpper and lower boundsComputer Science ApplicationsTheoretical Computer ScienceCombinatoricsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYLattice (order)Signal ProcessingTime complexityComputingMethodologies_COMPUTERGRAPHICSInformation SystemsMathematicsInformation Processing Letters
researchProduct

The Myriad Virtues of Wavelet Trees

2009

Wavelet Trees have been introduced in [Grossi, Gupta and Vitter, SODA '03] and have been rapidly recognized as a very flexible tool for the design of compressed full-text indexes and data compressors. Although several papers have investigated the beauty and usefulness of this data structure in the full-text indexing scenario, its impact on data compression has not been fully explored. In this paper we provide a complete theoretical analysis of a wide class of compression algorithms based on Wavelet Trees. We also show how to improve their asymptotic performance by introducing a novel framework, called Generalized Wavelet Trees, that aims for the best combination of binary compressors (like,…

Binary treeWeight-balanced treeWavelet transformCascade algorithmData_CODINGANDINFORMATIONTHEORYHuffman codingData CompressionTheoretical Computer ScienceComputer Science ApplicationsSet partitioning in hierarchical treessymbols.namesakeWaveletComputational Theory and Mathematicssymbolsempirical entropyBurrows-Wheeler TransformAlgorithmData compressionMathematicsInformation SystemsWavelet Trees
researchProduct

Full and Partial Agonism of Ionotropic Glutamate Receptors Indicated by Molecular Dynamics Simulations

2011

Ionotropic glutamate receptors (iGluRs) are synaptic proteins that facilitate signal transmission in the central nervous system. Extracellular iGluR cleft closure is linked to receptor activation; however, the mechanism underlying partial agonism is not entirely understood. Full agonists close the bilobed ligand-binding domain (LBD), while antagonists prevent closure; the transmembrane ion channel either opens or stays closed, respectively. Although some bulky partial agonists produce intermediate iGluR-LBD closure, the available crystal structures also imply that the cleft can be shut with certain partial agonists. Recently, we have shown that the iGluR-LBD closure stage can be recreated b…

Binding SitesProtein ConformationStereochemistryChemistryGeneral Chemical EngineeringGlutamate receptorHydrogen BondingGeneral ChemistryMolecular Dynamics SimulationLibrary and Information SciencesNeurotransmissionCrystallography X-RayLigandsReceptors Ionotropic GlutamateLigand (biochemistry)Partial agonistTransmembrane proteinComputer Science ApplicationsBiophysicsReceptorIon channelProtein BindingIonotropic effectJournal of Chemical Information and Modeling
researchProduct

The Link between Oxidative Stress, Redox Status, Bioenergetics and Mitochondria in the Pathophysiology of ALS

2021

Amyotrophic lateral sclerosis (ALS) is the most common neurodegenerative disease of the motor system. It is characterized by the degeneration of both upper and lower motor neurons, which leads to muscle weakness and paralysis. ALS is incurable and has a bleak prognosis, with median survival of 3–5 years after the initial symptomatology. In ALS, motor neurons gradually degenerate and die. Many features of mitochondrial dysfunction are manifested in neurodegenerative diseases, including ALS. Mitochondria have shown to be an early target in ALS pathophysiology and contribute to disease progression. Disruption of their axonal transport, excessive generation of reactive oxygen species, disruptio…

BioenergeticsQH301-705.5Calcium bufferingredox statusReviewMitochondrionmedicine.disease_causebioenergeticsCatalysisInorganic ChemistryMitophagymedicineAnimalsHumansoxidative stressPhysical and Theoretical ChemistryAmyotrophic lateral sclerosisBiology (General)Molecular BiologyQD1-999SpectroscopyMotor Neuronschemistry.chemical_classificationReactive oxygen speciesbusiness.industryAmyotrophic Lateral SclerosisOrganic ChemistryGeneral Medicinemedicine.diseaseComputer Science ApplicationsmitochondriaChemistrychemistryAxoplasmic transportALSEnergy MetabolismbusinessOxidation-ReductionNeuroscienceOxidative stressInternational Journal of Molecular Sciences
researchProduct