Search results for "Random"

showing 10 items of 3931 documents

Parallelizing Epistasis Detection in GWAS on FPGA and GPU-Accelerated Computing Systems

2015

This is a post-peer-review, pre-copyedit version of an article published in IEEE - ACM Transactions on Computational Biology and Bioinformatics. The final authenticated version is available online at: http://dx.doi.org/10.1109/TCBB.2015.2389958 [Abstract] High-throughput genotyping technologies (such as SNP-arrays) allow the rapid collection of up to a few million genetic markers of an individual. Detecting epistasis (based on 2-SNP interactions) in Genome-Wide Association Studies is an important but time consuming operation since statistical computations have to be performed for each pair of measured markers. Computational methods to detect epistasis therefore suffer from prohibitively lon…

Computer scienceBioinformaticsDNA Mutational AnalysisGenome-wide association studyParallel computingPolymorphism Single NucleotideSensitivity and SpecificityComputational biologyComputer GraphicsGeneticsComputer architectureField-programmable gate arrayRandom access memoryApplied MathematicsChromosome MappingHigh-Throughput Nucleotide SequencingReproducibility of ResultsField programmable gate arraysEpistasis GeneticSignal Processing Computer-AssistedEquipment DesignRandom access memoryComputing systemsReconfigurable computingEquipment Failure AnalysisTask (computing)EpistasisHost (network)Graphics processing unitsGenome-Wide Association StudyBiotechnology
researchProduct

Are nonlinear model-free conditional entropy approaches for the assessment of cardiac control complexity superior to the linear model-based one?

2016

Objective : We test the hypothesis that the linear model-based (MB) approach for the estimation of conditional entropy (CE) can be utilized to assess the complexity of the cardiac control in healthy individuals. Methods : An MB estimate of CE was tested in an experimental protocol (i.e., the graded head-up tilt) known to produce a gradual decrease of cardiac control complexity as a result of the progressive vagal withdrawal and concomitant sympathetic activation. The MB approach was compared with traditionally exploited nonlinear model-free (MF) techniques such as corrected approximate entropy, sample entropy, corrected CE, two k -nearest-neighbor CE procedures and permutation CE. Electroca…

Computer scienceEntropyBiomedical EngineeringSensitivity and Specificity01 natural sciencesApproximate entropy03 medical and health sciencesEntropy (classical thermodynamics)0302 clinical medicineHeart RateHeart Rate Determination0103 physical sciencesStatisticsHumansEntropy (information theory)Autonomic nervous systemComputer SimulationEntropy (energy dispersal)010306 general physicsEntropy (arrow of time)Heart rate variabilityFeedback PhysiologicalConditional entropyEntropy (statistical thermodynamics)Head-up tiltModels CardiovascularLinear modelCardiovascular regulationReproducibility of ResultsHeartStatistical modelMutual informationSample entropyMutual informationNonlinear DynamicsConcomitantSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaLinear ModelsAlgorithmRandom variableAlgorithms030217 neurology & neurosurgeryEntropy (order and disorder)
researchProduct

A Comparison of Advanced Regression Algorithms for Quantifying Urban Land Cover

2014

Quantitative methods for mapping sub-pixel land cover fractions are gaining increasing attention, particularly with regard to upcoming hyperspectral satellite missions. We evaluated five advanced regression algorithms combined with synthetically mixed training data for quantifying urban land cover from HyMap data at 3.6 and 9 m spatial resolution. Methods included support vector regression (SVR), kernel ridge regression (KRR), artificial neural networks (NN), random forest regression (RFR) and partial least squares regression (PLSR). Our experiments demonstrate that both kernel methods SVR and KRR yield high accuracies for mapping complex urban surface types, i.e., rooftops, pavements, gras…

Computer scienceLand coverimaging spectrometrysub-pixel mappingKernel (linear algebra)urban land coverPartial least squares regressionlcsh:Sciencespatial resolutionHyMapRemote sensingmachine learning; regression; sub-pixel mapping; spatial resolution; imaging spectrometry; hyperspectral; urban land coverTraining setArtificial neural networkbusiness.industryHyperspectral imagingPattern recognitionRandom forestSupport vector machineKernel methodmachine learninghyperspectralKernel (statistics)General Earth and Planetary Sciencesregressionlcsh:QArtificial intelligencebusinessRemote Sensing
researchProduct

Adaptive Population Importance Samplers: A General Perspective

2016

Importance sampling (IS) is a well-known Monte Carlo method, widely used to approximate a distribution of interest using a random measure composed of a set of weighted samples generated from another proposal density. Since the performance of the algorithm depends on the mismatch between the target and the proposal densities, a set of proposals is often iteratively adapted in order to reduce the variance of the resulting estimator. In this paper, we review several well-known adaptive population importance samplers, providing a unified common framework and classifying them according to the nature of their estimation and adaptive procedures. Furthermore, we interpret the underlying motivation …

Computer scienceMatemáticasMonte Carlo methodPopulation02 engineering and technologyMachine learningcomputer.software_genre01 natural sciences010104 statistics & probability[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing0202 electrical engineering electronic engineering information engineering0101 mathematicseducationComputingMilieux_MISCELLANEOUSeducation.field_of_studybusiness.industryEstimator020206 networking & telecommunicationsStatistical classificationRandom measureMonte Carlo integrationData miningArtificial intelligencebusinessParticle filtercomputer[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingImportance sampling
researchProduct

Analysis of block random rocking on nonlinear flexible foundation

2020

Abstract In this paper the rocking response of a rigid block randomly excited at its foundation is examined. A nonlinear flexible foundation model is considered accounting for the possibility of uplifting in the case of strong excitation. Specifically, based on an appropriate nonlinear impact force model, the foundation is treated as a bed of continuously distributed springs in parallel with nonlinear dampers. The statistics of the rocking response is examined by an analytical procedure which involves a combination of static condensation and stochastic linearization methods. In this manner, repeated numerical integration of the highly nonlinear differential equations of motion is circumvent…

Computer scienceMonte Carlo methodAerospace Engineering020101 civil engineeringOcean Engineering02 engineering and technology0201 civil engineeringDamper0203 mechanical engineeringLinearizationCivil and Structural EngineeringBlock (data storage)Mechanical EngineeringMathematical analysisNonlinear flexible foundationStatistical and Nonlinear PhysicsFilter (signal processing)Condensed Matter PhysicsNumerical integrationNonlinear systemRocking motion020303 mechanical engineering & transportsNuclear Energy and EngineeringImpactRandom base excitationSettore ICAR/08 - Scienza Delle CostruzioniProbabilistic Engineering Mechanics
researchProduct

Additive noise and multiplicative bias as disclosure limitation techniques for continuous microdata: A simulation study

2004

This paper focuses on a combination of two disclosure limitation techniques, additive noise and multiplicative bias, and studies their efficacy in protecting confidentiality of continuous microdata. A Bayesian intruder model is extensively simulated in order to assess the performance of these disclosure limitation techniques as a function of key parameters like the variability amongst profiles in the original data, the amount of users prior information, the amount of bias and noise introduced in the data. The results of the simulation offer insight into the degree of vulnerability of data on continuous random variables and suggests some guidelines for effective protection measures.

Computer scienceMultiplicative functionBayesian probabilityGeneral Engineeringcomputer.software_genreComputer Science ApplicationsOriginal dataComputational MathematicsMicrodata (HTML)Simulated dataConfidentialityData miningRandom variablecomputerPrior information
researchProduct

A random-walk benchmark for single-electron circuits

2021

Mesoscopic integrated circuits aim for precise control over elementary quantum systems. However, as fidelities improve, the increasingly rare errors and component crosstalk pose a challenge for validating error models and quantifying accuracy of circuit performance. Here we propose and implement a circuit-level benchmark that models fidelity as a random walk of an error syndrome, detected by an accumulating probe. Additionally, contributions of correlated noise, induced environmentally or by memory, are revealed as limits of achievable fidelity by statistical consistency analysis of the full distribution of error counts. Applying this methodology to a high-fidelity implementation of on-dema…

Computer scienceScienceFOS: Physical sciencesGeneral Physics and AstronomyWord error rateQuantum metrology02 engineering and technologyIntegrated circuit01 natural sciencesNoise (electronics)ArticleGeneral Biochemistry Genetics and Molecular Biologylaw.inventionComputer Science::Hardware ArchitecturelawMesoscale and Nanoscale Physics (cond-mat.mes-hall)0103 physical sciencesElectronic devicesQuantum metrology010306 general physicsQuantumQuantum computerQuantum PhysicsMultidisciplinaryCondensed Matter - Mesoscale and Nanoscale PhysicsQuantum dotsQGeneral Chemistry021001 nanoscience & nanotechnologyRandom walkComputerSystemsOrganization_MISCELLANEOUSBenchmark (computing)Quantum Physics (quant-ph)0210 nano-technologyAlgorithmNature Communications
researchProduct

Classification of Melanoma Lesions Using Sparse Coded Features and Random Forests

2016

International audience; Malignant melanoma is the most dangerous type of skin cancer, yet it is the most treatable kind of cancer, conditioned by its early diagnosis which is a challenging task for clinicians and dermatologists. In this regard, CAD systems based on machine learning and image processing techniques are developed to differentiate melanoma lesions from benign and dysplastic nevi using dermoscopic images. Generally, these frameworks are composed of sequential processes: pre-processing, segmentation, and classification. This architecture faces mainly two challenges: (i) each process is complex with the need to tune a set of parameters, and is specific to a given dataset; (ii) the…

Computer scienceSparse codingComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONScale-invariant feature transformImage processingDermoscopy02 engineering and technology[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processing030218 nuclear medicine & medical imaging03 medical and health sciences0302 clinical medicineHistogram0202 electrical engineering electronic engineering information engineeringmedicineComputer visionSegmentationMelanoma[SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processingbusiness.industryMelanomaCancerPattern recognitionImage segmentationSparse approximationRandom forestsmedicine.diseaseClassificationRandom forest020201 artificial intelligence & image processingArtificial intelligenceSkin cancerNeural codingbusiness[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
researchProduct

Modelling of non-stationary mobile radio channels using two-dimensional brownian motion processes

2013

The interdisciplinary idea of this paper is to employ a two-dimensional (2D) Brownian motion (BM) process to model non-stationary mobile fading channels. It is assumed that the mobile station (MS) starts moving from a fixed point along a random path in the 2D plane. We model such a moving scenario by a 2D BM process, in which the variance of the process determines the deviation of the MS from its starting point. The propagation area is modelled by a non-centred one-ring scattering model, where the local scatterers are uniformly distributed on a ring centred not necessarily on the MS. The random movement of the MS in the proposed scattering model results in local angles-of-arrival (AOAs) and…

Computer scienceStochastic processMobile stationAutocorrelationTrajectorySpectral densityFadingStatistical physicsRandom variableBrownian motionSimulation2013 International Conference on Advanced Technologies for Communications (ATC 2013)
researchProduct

The role of the Access Point in Wi-Fi networks with selfish nodes

2009

In Wi-Fi networks, mobile nodes compete for accessing the shared channel by means of a random access protocol called Distributed Coordination Function (DCF), which is long term fair. But recent drivers allow users to configure protocol parameters differently from their standard values in order to break the protocol fairness and obtain a larger share of the available bandwidth at the expense of other users. This motivates a game theoretical analysis of DCF. Previous studies have already modeled access to a shared wireless channel in terms of non-cooperative games among the nodes, but they have mainly considered ad hoc mode operation. In this paper we consider the role of the Access Point (AP…

Computer scienceWireless ad hoc networkBidirectional trafficDistributed computingmedia_common.quotation_subjectMechanism designThroughputDistributed coordination functionNash equilibriumWi-fi networks[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]IEEE 802.11Settore ING-INF/04 - Automaticaselfish nodesSelfishnessmedia_commonIEEE 802.11business.industrySettore ING-INF/03 - TelecomunicazioniNode (networking)ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSWLAN; selfish nodesWLANbusinessRandom accessComputer network
researchProduct