Search results for "Algorithm"

showing 10 items of 4887 documents

Novel algorithms for 3D surface point cloud boundary detection and edge reconstruction

2019

Abstract Tessellated surfaces generated from point clouds typically show inaccurate and jagged boundaries. This can lead to tolerance errors and problems such as machine judder if the model is used for ongoing manufacturing applications. This paper introduces a novel boundary point detection algorithm and spatial FFT-based filtering approach, which together allow for direct generation of low noise tessellated surfaces from point cloud data, which are not based on pre-defined threshold values. Existing detection techniques are optimized to detect points belonging to sharp edges and creases. The new algorithm is targeted at the detection of boundary points and it is able to do this better tha…

PolynomialBoundary detection Edge reconstruction Point-cloudComputer scienceTKFast Fourier transformComputational MechanicsPoint cloudBoundary (topology)02 engineering and technologySettore ING-IND/14 - Progettazione Meccanica E Costruzione Di Macchine0203 mechanical engineeringlcsh:TA1740202 electrical engineering electronic engineering information engineeringEngineering (miscellaneous)Function (mathematics)lcsh:Engineering designComputer Graphics and Computer-Aided DesignHuman-Computer InteractionComputational MathematicsNoise020303 mechanical engineering & transportsModeling and SimulationCurve fittingArtificial noise020201 artificial intelligence & image processingAlgorithmJournal of Computational Design and Engineering
researchProduct

Learning of regular expressions by pattern matching

1995

We consider the problem of restoring regular expressions from good examples. We describe a natural learning algorithm for obtaining a “plausible” regular expression from one example. The algorithm is based on finding the longest substring which can be matched by some part of the so far obtained expression. We believe that the algorithm to a certain extent mimics humans guessing regular expressions from the same sort of examples. We show that for regular expressions of bounded length successful learning takes time linear in the length of the example, provided that the example is “good”. Under certain natural restrictions the run-time of the learning algorithm is polynomial also in unsuccessf…

PolynomialFinite-state machineRegular languageComputer scienceBounded functionRegular expressionPattern matchingAlgorithmExpression (mathematics)Substring
researchProduct

Continuous-Variable Instantaneous Quantum Computing is Hard to Sample

2017

Instantaneous quantum computing is a sub-universal quantum complexity class, whose circuits have proven to be hard to simulate classically in the Discrete-Variable (DV) realm. We extend this proof to the Continuous-Variable (CV) domain by using squeezed states and homodyne detection, and by exploring the properties of post-selected circuits. In order to treat post-selection in CVs we consider finitely-resolved homodyne detectors, corresponding to a realistic scheme based on discrete probability distributions of the measurement outcomes. The unavoidable errors stemming from the use of finitely squeezed states are suppressed through a qubit-into-oscillator GKP encoding of quantum information,…

PolynomialMathematical optimizationComputer scienceFOS: Physical sciencesGeneral Physics and Astronomy01 natural sciences010305 fluids & plasmas010309 opticsContinuous variableHomodyne detection[PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph]Quantum mechanics0103 physical sciencesComplexity classQuantum phase estimation algorithmStatistical physicsQuantum information010306 general physicsQuantumQuantum computerPhysicsQuantum PhysicsQuantum PhysicsSample (graphics)PostselectionProbability distributionQuantum Physics (quant-ph)Physical Review Letters
researchProduct

Benchmarking parameter-free AMaLGaM on functions with and without noise.

2013

We describe a parameter-free estimation-of-distribution algorithm (EDA) called the adapted maximum-likelihood Gaussian model iterated density-estimation evolutionary algorithm (AMaLGaM-ID[Formula: see text]A, or AMaLGaM for short) for numerical optimization. AMaLGaM is benchmarked within the 2009 black box optimization benchmarking (BBOB) framework and compared to a variant with incremental model building (iAMaLGaM). We study the implications of factorizing the covariance matrix in the Gaussian distribution, to use only a few or no covariances. Further, AMaLGaM and iAMaLGaM are also evaluated on the noisy BBOB problems and we assess how well multiple evaluations per solution can average ou…

PolynomialMathematical optimizationLikelihood FunctionsCovariance matrixGaussianEvolutionary algorithmNormal DistributionComputational BiologyComputational Mathematicssymbols.namesakeNoiseEstimation of distribution algorithmArtificial IntelligenceBlack boxsymbolsIncremental build modelComputer SimulationAlgorithmsSoftwareMathematicsEvolutionary computation
researchProduct

Distributed learning automata-based scheme for classification using novel pursuit scheme

2020

Learning Automata (LA) is a popular decision making mechanism to “determine the optimal action out of a set of allowable actions” (Agache and Oommen, IEEE Trans Syst Man Cybern-Part B Cybern 2002(6): 738–749, 2002). The distinguishing characteristic of automata-based learning is that the search for the optimising parameter vector is conducted in the space of probability distributions defined over the parameter space, rather than in the parameter space itself (Thathachar and Sastry, IEEE Trans Syst Man Cybern-Part B Cybern 32(6): 711–722, 2002). Recently, Goodwin and Yazidi pioneered the use of Ant Colony Optimisation (ACO) for solving classification problems (Goodwin and Yazidi 2016). In th…

PolynomialOptimization problemLearning automataComputer sciencePolygonsFeature vector02 engineering and technologyAnt colonyParameter spaceRandom walkLearning automataSupport vector machineKernel methodArtificial IntelligenceKernel (statistics)Polygon0202 electrical engineering electronic engineering information engineeringProbability distribution020201 artificial intelligence & image processingClassificationsVDP::Teknologi: 500::Informasjons- og kommunikasjonsteknologi: 550AlgorithmApplied Intelligence
researchProduct

Symbolic Worst Case Execution Times

2011

In immediate or hard real-time systems the correctness of an operation depends not only upon its logical correctness, but also on the time in which it is computed. In such systems, it is imperative that operations are performed within a given deadline because missing this deadline constitutes the failure of the complete system. Such systems include medical systems, flight control systems and other systems whose failure in responding punctually results in a high economical loss or even in the loss of human lives. These systems are usually analyzed in a sequence of steps in which first, a socalled control flow graph (CFG) is constructed that represents possible program flows. Furthermore, bou…

PolynomialSequenceCorrectnessWorst-case execution timeComputer scienceCode (cryptography)Control flow graphInteger programmingAlgorithmLongest path problem
researchProduct

Wavelet Frames Generated by Perfect Reconstruction Filter Banks

2015

It was indicated in Sect. 2.2 that oversampled perfect reconstruction (PR) filter banks generate specific types of frames in the signal space. In this chapter, a family of tight and semi-tight frames is presented. The three- and four-channel filter banks that generate the framed originate from polynomial and discrete splines. Those frames have properties, which are attractive for signal processing, such as symmetry, interpolation, flat spectra. These properties are combined with fine time-domain localization and efficient implementation. This family includes framelets, that have any number of discrete vanishing moments. Non-compactness of their supports is compensated by exponential decay o…

PolynomialSignal processingWaveletComputer scienceInterpolation (computer graphics)Filter (signal processing)Symmetry (geometry)Filter bankSignalAlgorithm
researchProduct

Non-Gaussian Approach for Stochastic Analysis of Offshore Structures

1995

An approach that is able to obtain the stochastic characteristics in terms of, stochastic momen.ts of a SDOF system excited by loads due to a fluid-structure mteraction is presented. In This approach the fluid horizontal velocity is considered as a filtered white noise, and the actual load expression is replaced by a Thirddegree polynomial of this velocity. The tools needed to p.romptly obtain the filters parameters and the equations governing the response moments are also presented; in particular, if the structure is sufficiently stiff, It is shown that these equations do not need any closure scheme III order to be solved. © ASCE.

PolynomialStochastic processMechanical EngineeringGaussianClosure (topology)White noiseStability (probability)Expression (mathematics)symbols.namesakeMechanics of MaterialsFluid–structure interactionsymbolsApplied mathematicsMechanics of MaterialAlgorithmMathematicsJournal of Engineering Mechanics
researchProduct

A Characterization of Quintic Helices

2005

A polynomial curve of degree 5, @a, is a helix if and only if both @[email protected]^'@? and @[email protected]^'@[email protected]^''@? are polynomial functions.

PolynomialTheorem of LancreteducationComputingMilieux_LEGALASPECTSOFCOMPUTINGCharacterization (mathematics)behavioral disciplines and activitiesMathematics::Algebraic TopologyCombinatoricsMathematics - Geometric TopologyTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYhealth services administrationComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONFOS: Mathematicshealth care economics and organizationsMathematicsPhysics::Biological PhysicsQuantitative Biology::BiomoleculesDegree (graph theory)InformationSystems_INFORMATIONSYSTEMSAPPLICATIONSApplied MathematicsMathematical analysisGeometric Topology (math.GT)Pythagorean hodograph curveshumanitiesQuintic functionComputational MathematicsGeneralized polynomial helices
researchProduct

Non Linear Fitting Methods for Machine Learning

2017

This manuscript presents an analysis of numerical fitting methods used for solving classification problems as discriminant functions in machine learning. Non linear polynomial, exponential, and trigonometric models are mathematically deduced and discussed. Analysis about their pros and cons, and their mathematical modelling are made on what method to chose for what type of highly non linear multi-dimension problems are more suitable to be solved. In this study only deterministic models with analytic solutions are involved, or parameters calculation by numeric methods, which the complete model can subsequently be treated as a theoretical model. Models deduction are summarised and presented a…

PolynomialWake-sleep algorithmbusiness.industryComputer scienceOnline machine learningType (model theory)Machine learningcomputer.software_genreExponential functionNonlinear systemDiscriminantArtificial intelligenceTrigonometrybusinesscomputer
researchProduct