Search results for "COMPUTATION"

showing 10 items of 7362 documents

Genome-wide detection of copy-number variations in local cattle breeds

2019

The aim of the present study was to identify copy-number variations (CNVs) in Cinisara (CIN) and Modicana (MOD) cattle breeds on the basis of signal intensity (logR ratio) and B allele frequency of each marker, using Illumina’s BovineSNP50K Genotyping BeadChip. The CNVs were detected with the PennCNV and SVS 8.7.0 software and were aggregated into CNV regions (CNVRs). PennCNV identified 487 CNVs in CIN that aggregated into 86 CNVRs, and 424 CNVs in MOD that aggregated into 81 CNVRs. SVS identified a total of 207 CNVs in CIN that aggregated into 39 CNVRs, and 181 CNVs in MOD that aggregated into 41 CNVRs. The CNVRs identified with the two softwares contained 29 common CNVRs in CIN and 17 co…

cinisara0303 health sciencesFuture studies0402 animal and dairy scienceBovineSNP50K BeadChip Cinisara genomic variation Modicana04 agricultural and veterinary sciencesComputational biologyBiology040201 dairy & animal scienceGenome03 medical and health sciencesBovine genomeSettore AGR/17 - Zootecnica Generale E Miglioramento GeneticoAnimal Science and ZoologyCopy-number variationgenomic variationKEGGBovineSNP50K beadchipAllele frequencyGeneGenotypingmodicana030304 developmental biologyFood Science
researchProduct

Detection of Immunoglobulin Heavy Chain Gene Clonality By High-Throughput Sequencing for Minimal Residual Disease Monitoring in Chronic Lymphocytic L…

2019

Introduction: The negative minimal residual disease (MRD) after treatment has been recently accepted as endpoint for Chronic Lymphocytic Leukaemia (CLL) clinical trials. Conventionally, MRD can be detected by using multi-color Flow Cytometry (FC) with high sensitivity. Determination of the clonal immunoglobulin gene rearrangement can be a useful monitoring marker in a broad range of B-cell lymphoproliferative neoplasms. Moreover, the mutational status of immunoglobulin heavy chain variable (IgHV) rearrangement is considered one of the most important prognostic factors in CLL. Therefore, the identification of the IgHV rearrangement can be a useful marker both at diagnostic and as monitoring …

clone (Java method)Chronic lymphocytic leukemiaImmunologyCell BiologyHematologyComputational biologyBiologymedicine.diseaseBiochemistryMinimal residual diseasegenomic DNAEuroFlowhemic and lymphatic diseasesAcute lymphocytic leukemiamedicineMultiplexIGHV@Blood
researchProduct

GPU accelerated Monte Carlo simulations of lattice spin models

2011

We consider Monte Carlo simulations of classical spin models of statistical mechanics using the massively parallel architecture provided by graphics processing units (GPUs). We discuss simulations of models with discrete and continuous variables, and using an array of algorithms ranging from single-spin flip Metropolis updates over cluster algorithms to multicanonical and Wang-Landau techniques to judge the scope and limitations of GPU accelerated computation in this field. For most simulations discussed, we find significant speed-ups by two to three orders of magnitude as compared to single-threaded CPU implementations.

cluster algorithmsStatistical Mechanics (cond-mat.stat-mech)Computer scienceComputationNumerical analysisspin modelsMonte Carlo methodHigh Energy Physics - Lattice (hep-lat)FOS: Physical sciencesStatistical mechanicsGPU computingPhysics and Astronomy(all)Computational Physics (physics.comp-ph)generalized-ensemble simulationsMonte Carlo simulationsComputational scienceCUDAHigh Energy Physics - LatticeSpin modelGeneral-purpose computing on graphics processing unitsGraphicsPhysics - Computational PhysicsCondensed Matter - Statistical Mechanics
researchProduct

Computational cluster validation for microarray data analysis: experimental assessment of Clest, Consensus Clustering, Figure of Merit, Gap Statistic…

2008

Abstract Background Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analysis and Classification, in particular with regard to the prediction of the number of clusters in a dataset, usually established via internal validation measures. Despite the wealth of internal measures available in the literature, new ones have been recently proposed, some of them specifically for microarray data. Results We consider five such measures: Clest, Consensus (Consensus Clustering), FOM (Figure of Merit), Gap (Gap Statistics) and ME (Model Explorer), in addition to the classic WCSS (Within Cluster…

clustering microarray dataMicroarrayComputer scienceStatistics as Topiccomputer.software_genrelcsh:Computer applications to medicine. Medical informaticsBiochemistryStructural BiologyDatabases GeneticConsensus clusteringStatisticsCluster (physics)AnimalsCluster AnalysisHumansCluster analysislcsh:QH301-705.5Molecular BiologyOligonucleotide Array Sequence AnalysisStructure (mathematical logic)Microarray analysis techniquesApplied MathematicsComputational BiologyComputer Science ApplicationsBenchmarkingComputingMethodologies_PATTERNRECOGNITIONlcsh:Biology (General)Gene chip analysislcsh:R858-859.7Data miningDNA microarraycomputerAlgorithmsSoftwareResearch ArticleBMC Bioinformatics
researchProduct

BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS

2010

We study balance properties of circular words over alphabets of size greater than two. We give some new characterizations of balanced words connected to the Kawasaki-Ising model and to the notion of derivative of a word. Moreover we consider two different generalizations of the notion of balance, and we find some relations between them. Some of our results can be generalized to non periodic infinite words as well.

combinatoria delle parole parole circolari parole bilanciateCombinatoricsCombinatorics on wordsSettore INF/01 - InformaticaComputer Science (miscellaneous)Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Computer Science::Formal Languages and Automata TheoryMathematicsInternational Journal of Foundations of Computer Science
researchProduct

Complex composite structures with integrated piezoelectric transducers

2016

International audience; Nowadays, in different industrial fields as transport or aerospace, a research effort is conducted to reduce the structural weight. One of the most promising solutions is the use of composite structures due to their high stiffness, their low mass density and their low damping factor. At the same time, there is an intensification of the operational dynamic environment and an increase of durability requirements. These different expectations seem to be contradictory. One solution to manage these points is to design and manufacture smart composite structures with a fully distributed set of integrated piezoelec-tric transducers. These structures are able to modify their m…

composite structureComputer scienceComposite numberComputational MechanicsMechanical engineering[SPI.MECA.MSMECA]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Materials and structures in mechanics [physics.class-ph]02 engineering and technology01 natural sciences[SPI]Engineering Sciences [physics]Active vibration control0103 physical sciencesAerospace[PHYS.MECA.VIBR]Physics [physics]/Mechanics [physics]/Vibrations [physics.class-ph]010302 applied physicsbusiness.industryApplied Mathematicstransducers integration[PHYS.MECA]Physics [physics]/Mechanics [physics]material characterizationMechatronics021001 nanoscience & nanotechnologyPiezoelectricityDurabilityComputer Science ApplicationsComputational Mathematicscomplex structureModeling and SimulationDamping factorPMUT[PHYS.MECA] Physics [physics]/Mechanics [physics]0210 nano-technologybusiness
researchProduct

Computable majorants of the limit load in Hencky’s plasticity problems

2018

Abstract We propose a new method for analyzing the limit (safe) load of elastoplastic media governed by the Hencky plasticity law and deduce fully computable bounds of this load. The main idea of the method is based on a combination of kinematic approach and new estimates of the distance to the set of divergence free fields. We show that two sided bounds of the limit load are sharp and the computational efficiency of the method is confirmed by numerical experiments.

computable boundsMathematical optimizationpenalizationta111010103 numerical & computational mathematicsKinematicslimit loadPlasticitydivergence free fields01 natural sciences010101 applied mathematicsSet (abstract data type)Computational MathematicsComputational Theory and MathematicsModeling and SimulationApplied mathematicsLimit loadLimit (mathematics)Hencky’s plasticity0101 mathematicsDivergence (statistics)MathematicsComputers & Mathematics with Applications
researchProduct

meso-Aryl-substituted free-base porphyrins: formation, structure and photostability of diprotonated species

2015

Susceptibility to interact with trifluoroacetic acid (TFA) of selected free-base porphyrins, including a novel lipophilic 3-n-pentadecyl(phenoxy)-ethoxy-phenyl-substituted porphyrin, and photostability of their diprotonated compounds was explored in benzene and N,N-dimethylformamide (DMF). Results have been discussed in terms of the commonly applied pK a -based procedure and confronted with a simple approach derived from experimentally-determined correlations reflecting the porphyrins affinity for TFA. Density functional theory (DFT) has proved the porphyrin moiety creates stable diprotonated species involving two TFA molecules, in which the fluorine atoms effectively contribute to the over…

computationChemistry(all)free-base porphyrinsprotonationProtonationProtonationphotobleaching010402 general chemistryPhotochemistryDFT01 natural sciencesFree-base porphyrinchemistry.chemical_compoundPolymer chemistryTrifluoroacetic acidlipophilic porphyrinsMoietyMoleculeReactivity (chemistry)Lipophilic porphyrinPhotobleaching010405 organic chemistryArylDFT computationFree baseGeneral ChemistryPorphyrin0104 chemical scienceschemistryResearch on Chemical Intermediates
researchProduct

Efficient checking of coherence and propagation of imprecise probability assessments

2000

We consider the computational difficulties in the checking of coherence and propagation of imprecise probability assessments. We examine the linear structure of the random gain in betting criterion and we propose a general methodology which exploits suitable subsets of the set of values of the random gain. In this way the checking of coherence and propagation amount to examining linear systems with a reduced number of unknowns. We also illustrate an example.

computationCoherent probability assessments propagation random gain computation algorithmsSettore MAT/06 - Probabilita' E Statistica MatematicaCoherent probability assessmentsrandom gainCoherent probability assessments; propagation; random gain; computation; algorithms.Coherent probability assessments; Propagation; AlgorithmsPropagationAlgorithms
researchProduct

Turing's Error-revised

2016

Many important lines of argumentation have been presented during the last decades claiming that machines cannot think like people. Yet, it has been possible to construct devices and information systems, which replace people in tasks which have previously been occupied by people as the tasks require intelligence. The long and versatile discourse over, what machine intelligence is, suggests that there is something unclear in the foundations of the discourse itself. Therefore, we critically studied the foundations of used theory languages. By looking critically some of the main arguments of machine thinking, one can find unifying factors. Most of them are based on the fact that computers canno…

computationTuring machinemodelformal languageconsciousnessmind
researchProduct