Search results for "Algorithm"

showing 10 items of 4887 documents

Split Bregman Method for Gravitational Wave Denoising

2014

This paper presents a progress report in our aim to develop a Total Variation algorithm for denoising of gravitational waves. These algorithms, are routinely employed in the context of image processing and they do not need any a priori information on the signals. We apply our method to two different types of numerically-simulated gravitational wave signals, namely burst produced from the core collapse of rotating stars and waveforms from binary black hole mergers, and present a preliminary assessment of its capabilities.

General Relativity and Quantum CosmologyMathematical optimizationBregman methodBinary black holeGravitational waveComputer scienceNoise reductionA priori and a posterioriWaveformImage processingContext (language use)Algorithm
researchProduct

Order statistics-based parametric classification for multi-dimensional distributions

2013

Traditionally, in the field of Pattern Recognition (PR), the moments of the class-conditional densities of the respective classes have been used to perform classification. However, the use of phenomena that utilized the properties of the Order Statistics (OS) were not reported. Recently, in [10,8], we proposed a new paradigm named CMOS, Classification by the Moments of Order Statistics, which specifically used these quantifiers. It is fascinating that CMOS is essentially ''anti''-Bayesian in its nature because the classification is performed in a counter-intuitive manner, i.e., by comparing the testing sample to a few samples distant from the mean, as opposed to the Bayesian approach in whi…

GeneralizationGaussianBayesian probabilityOrder statisticExponential functionsymbols.namesakeExponential familyArtificial IntelligenceSignal ProcessingPattern recognition (psychology)symbolsComputer Vision and Pattern RecognitionAlgorithmSoftwareMathematicsParametric statisticsPattern Recognition
researchProduct

Approximation of exit times for one-dimensional linear diffusion processes

2020

International audience; In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm was already introduced in both the Brownian context and the Ornstein-Uhlenbeck context, that is for particular time-homogeneous diffusion processes. Here the aim is therefore to generalize this efficient numerical approach in order to obtain an approximation of both the exit time and position for a general linear diffusion. The main challenge of such a generalization is to handle with time-inhomogeneous diffusions. The efficiency of the method is described with particular care through theoretical results and numerical example…

GeneralizationOrder (ring theory)Context (language use)Exit timeRandom walk010103 numerical & computational mathematicsStochastic algorithmRandom walk01 natural sciencesLinear diffusion010101 applied mathematicsComputational MathematicsComputational Theory and MathematicsDiffusion processPosition (vector)Modeling and SimulationApplied mathematicsGeneralized spheroids[MATH]Mathematics [math]0101 mathematicsDiffusion (business)Brownian motionMathematicsComputers & Mathematics with Applications
researchProduct

The Study of Dynamic Objects Identification Algorithms Based on Anisotropic Properties of Generalized Amplitude-Phase Images

2018

The article presents some results of dynamical objects identification technology based on coincidence matrixes of templates and tested objects’ amplitude-phase images (APIm) calculated with discrete Hilbert transforms (DHT). DHT algorithms are modeled on basis of isotropic (HTI), anisotropic (HTA), generalized transforms – AP-analysis (APA) and the difference (residual) relative shifted phase (DRSP-) images to calculate the APIm. The identified objects are recognized as members of classes modeled with 3D templates – images of different types airplanes rotated in space. The dynamic anisotropic properties of APIm causes the increasing of sensitivity to circular angle rotation and make possibl…

Generalized hilbert transformsMatching (graph theory)Basis (linear algebra)Dynamic object identificationComputer scienceIsotropyPhase (waves)Sensitivity (control systems)ResidualAmplitude-phase imagesAlgorithmRotation (mathematics)Coincidence
researchProduct

Using the dglars Package to Estimate a Sparse Generalized Linear Model

2015

dglars is a publicly available R package that implements the method proposed in Augugliaro et al. (J. R. Statist. Soc. B 75(3), 471-498, 2013) developed to study the sparse structure of a generalized linear model (GLM). This method, called dgLARS, is based on a differential geometrical extension of the least angle regression method. The core of the dglars package consists of two algorithms implemented in Fortran 90 to efficiently compute the solution curve. dglars is a publicly available R package that implements the method proposed in Augugliaro et al. (J. R. Statist. Soc. B 75(3), 471-498, 2013) developed to study the sparse structure of a generalized linear model (GLM). This method, call…

Generalized linear modelFortranLeast-angle regressionGeneralized linear array modelFeature selectionSparse approximationdgLARS generalized linear models sparse models variable selectionGeneralized linear mixed modelSettore SECS-S/01 - StatisticacomputerGeneralized estimating equationAlgorithmMathematicscomputer.programming_language
researchProduct

2020

Piping erosion is one form of water erosion that leads to significant changes in the landscape and environmental degradation. In the present study, we evaluated piping erosion modeling in the Zarandieh watershed of Markazi province in Iran based on random forest (RF), support vector machine (SVM), and Bayesian generalized linear models (Bayesian GLM) machine learning algorithms. For this goal, due to the importance of various geo-environmental and soil properties in the evolution and creation of piping erosion, 18 variables were considered for modeling the piping erosion susceptibility in the Zarandieh watershed. A total of 152 points of piping erosion were recognized in the study area that…

Generalized linear modelGlobal and Planetary ChangeWatershedPiping010504 meteorology & atmospheric sciencesEcologybusiness.industryBayesian probabilityDecision tree010501 environmental sciencesMachine learningcomputer.software_genre01 natural sciencesRandom forestSupport vector machineErosionEnvironmental scienceArtificial intelligencebusinessAlgorithmcomputer0105 earth and related environmental sciencesNature and Landscape ConservationLand
researchProduct

Efficiency Control for Permanent Magnet Synchronous Generators

2006

In this paper a control algorithm for the efficiency improvement of permanent magnet synchronous generators (PMSG) is presented. The proposed algorithm reduces the losses of the generator without affecting its performances. In details, after a description of a dynamic model of the PMSG, which has been purposely modified in order to take into account the iron losses, the basic equations and the constraints to obtain the loss minimization are presented and discussed. Some simulations of a specific PMSG employing the proposed algorithm are performed. The results of these simulations show that enhancement of the efficiency up to 3 % can be reached in comparison to a PMSG using a traditional con…

Generator (circuit theory)Control algorithmControl theoryComputer scienceMagnetControl (management)Loss minimizationPermanent magnet synchronous generatorMachine control
researchProduct

Design of the CGAL 3D Spherical Kernel and application to arrangements of circles on a sphere

2009

AbstractThis paper presents a cgal kernel for algorithms manipulating 3D spheres, circles, and circular arcs. The paper makes three contributions. First, the mathematics underlying two non-trivial predicates are presented. Second, the design of the kernel concept is developed, and the connexion between the mathematics and this design is established. In particular, we show how two different frameworks can be combined: one for the general setting, and one dedicated to the case where all the objects handled lie on a reference sphere. Finally, an assessment about the efficacy of the 3D Spherical Kernel is made through the calculation of the exact arrangement of circles on a sphere. On average w…

Generic programmingControl and OptimizationSpheresCurved objectsGeneric programmingConstructionsComputer Science ApplicationsComputational MathematicsGeometric kernelsComputational Theory and MathematicsRobustness (computer science)cgalSPHERESGeometry and TopologyRobustnessAlgorithmPredicatesMathematicsComputational Geometry
researchProduct

An Innovative Structural Dynamic Identification Procedure Combining Time Domain OMA Technique and GA

2022

In this paper an innovative and simple Operational Modal Analysis (OMA) method for structural dynamic identification is proposed. It combines the recently introduced Time Domain–Analytical Signal Method (TD–ASM) with the Genetic Algorithm (GA). Specifically, TD–ASM is firstly employed to estimate a subspace of candidate modal parameters, and then the GA is used to identify the structural parameters minimizing the fitness value returned by an appropriately introduced objective function. Notably, this method can be used to estimate structural parameters even for high damping ratios, and it also allows one to identify the Power Spectral Density (PSD) of the structural excitat…

Genetic AlgorithmPower Spectral Densitystructural dynamic identificationStructural Health MonitoringArchitecturecorrelation functionBuilding and Constructioncorrelation function; Power Spectral Density; Structural Health Monitoring; Hilbert transform; Genetic Algorithm; structural dynamic identification; Operational Modal AnalysisSettore ICAR/08 - Scienza Delle CostruzioniHilbert transformOperational Modal AnalysiCivil and Structural EngineeringBuildings; Volume 12; Issue 7; Pages: 963
researchProduct

Genetic variability at neutral markers, quantitative trait loci and trait in a subdivided population under selection

2003

Abstract Genetic variability in a subdivided population under stabilizing and diversifying selection was investigated at three levels: neutral markers, QTL coding for a trait, and the trait itself. A quantitative model with additive effects was used to link genotypes to phenotypes. No physical linkage was introduced. Using an analytical approach, we compared the diversity within deme (HS) and the differentiation (FST) at the QTL with the genetic variance within deme (VW) and the differentiation (QST) for the trait. The difference between FST and QST was shown to depend on the relative amounts of covariance between QTL within and between demes. Simulations were used to study the effect of se…

Genetic Markers0106 biological sciencesGenotypeQuantitative Trait LociPopulation[SDV.GEN] Life Sciences [q-bio]/GeneticsQuantitative trait locusBiology010603 evolutionary biology01 natural sciences03 medical and health sciencesFamily-based QTL mappingGeneticsComputer SimulationGenetic variabilitySelection Genetic10. No inequalityeducationSelection (genetic algorithm)ComputingMilieux_MISCELLANEOUS030304 developmental biologyDemeGenetics0303 health scienceseducation.field_of_study[SDV.GEN]Life Sciences [q-bio]/GeneticsModels GeneticDisruptive selectionGenetic VariationGenetic architectureGenetics PopulationPhenotypeEvolutionary biologyResearch Article
researchProduct