Search results for "Algorithm"

showing 10 items of 4887 documents

Gradient-based shape optimisation of ultra-wideband antennas parameterised using splines

2010

Methodology enabling the gradient-based optimisation of antennas parameterised using B-splines is presented. Use of the spline parametrisation allows us to obtain versatile new shapes, whereas the geometry can be represented with a small set of design variables. Moreover, good control over admissible geometries is retained. Advantages of gradient-based optimisation methods are quick convergence, and the fact that the obtained design can be guaranteed to be a local optimum. Focus of this study is to present techniques that enable the computation of exact gradients of the discrete problem, even though the complexity of the geometries does not permit establishing analytical expressions for the…

Mathematical optimizationSpline (mathematics)Local optimumComputer simulationFrequency bandComputationB-splineElectrical and Electronic EngineeringAlgorithmGradient methodSmall setMathematicsIET Microwaves, Antennas & Propagation
researchProduct

A novel technique for stochastic root-finding: Enhancing the search with adaptive d-ary search

2017

The most fundamental problem encountered in the field of stochastic optimization, is the Stochastic Root Finding (SRF) problem where the task is to locate an unknown point x∗ for which g(x∗) = 0 for a given function g that can only be observed in the presence of noise [15]. The vast majority of the state-of-the-art solutions to the SRF problem involve the theory of stochastic approximation. The premise of the latter family of algorithms is to oper ate by means of so-called “small-step”processesthat explorethe search space in a conservative manner. Using this paradigm, the point investigated at any time instant is in the proximity of the point investigated at the previous time instant, render…

Mathematical optimizationStochastic point location problemsInformation Systems and ManagementLearning automataComputer scienceStochastic root finding problemsLearning Automata020206 networking & telecommunications02 engineering and technologyInterval (mathematics)Function (mathematics)Stochastic approximationComputer Science ApplicationsTheoretical Computer ScienceArtificial IntelligenceControl and Systems Engineering0202 electrical engineering electronic engineering information engineeringSearch problem020201 artificial intelligence & image processingStochastic optimizationAlgorithmRoot-finding algorithmSoftwareInformation Sciences
researchProduct

Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method

2007

In geometric constraints solving, the detection of dependences and the decomposition of the system into smaller subsystems are two important steps that characterize any solving process, but nowadays solvers, which are graph-based in most of the cases, fail to detect dependences due to geometric theorems and to decompose such systems. In this paper, we discuss why detecting all dependences between constraints is a hard problem and propose to use the witness method published recently to detect both structural and non structural dependences.We study various examples of constraints systems and show the promising results of the witness method in subtle dependences detection and systems decomposi…

Mathematical optimizationStructural dependenceGraph (abstract data type)Geometric theoremAlgorithmWitnessMathematics
researchProduct

An improved method for estimating the frequency correlation function

2012

For time-invariant frequency-selective channels, the transfer function is a superposition of waves having different propagation delays and path gains. In order to estimate the frequency correlation function (FCF) of such channels, the frequency averaging technique can be utilized. The obtained FCF can be expressed as a sum of auto-terms (ATs) and cross-terms (CTs). The ATs are caused by the autocorrelation of individual path components. The CTs are due to the cross-correlation of different path components. These CTs have no physical meaning and leads to an estimation error. We propose a new estimation method aiming to improve the estimation accuracy of the FCF of a band-limited transfer fun…

Mathematical optimizationSuperposition principleInterleavingComputer scienceBandwidth (signal processing)AutocorrelationCorrelation function (quantum field theory)Transfer functionAlgorithmCoherence bandwidth2012 IEEE Wireless Communications and Networking Conference (WCNC)
researchProduct

Parametric and nonparametric methods to generate time-varying surrogate data.

2009

We present both nonparametric and parametric approaches to generating time-varying surrogate data. Nonparametric and parametric approaches are based on the use of the short-time Fourier transform and a time-varying autoregressive model, respectively. Time-varying surrogate data (TVSD) can be used to determine the statistical significance of the linear and nonlinear coherence function estimates. Two advantages of the TVSD are that it keeps one from having to make an arbitrary decision about the significance of the coherence value, and it properly takes into account statistical significance levels, which may change with time. Our simulation examples and experimental results on blood pressure …

Mathematical optimizationTime FactorsNormal DistributionBiomedical EngineeringBlood PressureHealth InformaticsStatistics NonparametricSurrogate dataNormal distributionsymbols.namesakeHeart RateHumansCoherence (signal processing)Computer Simulation1707MathematicsParametric statisticsFourier AnalysisNonparametric statisticsRegression analysisAutoregressive modelFourier analysisData Interpretation StatisticalSignal ProcessingSettore ING-INF/06 - Bioingegneria Elettronica E InformaticasymbolsRegression AnalysisAlgorithmAlgorithms
researchProduct

Optimal Paths on Urban Networks Using Travelling Times Prevision

2012

We deal with an algorithm that, once origin and destination are fixed, individuates the route that permits to reach the destination in the shortest time, respecting an assigned maximal travel time, and with risks measure below a given threshold. A fluid dynamic model for road networks, according to initial car densities on roads and traffic coefficients at junctions, forecasts the future traffic evolution, giving dynamical weights to a constrained 𝐾 shortest path algorithm. Simulations are performed on a case study to test the efficiency of the proposed procedure.

Mathematical optimizationTraffic congestion reconstruction with Kerner's three-phase theoryArticle SubjectComputer scienceFluid dynamic model; K shortest path algorithm; Travelling times previsionGeneral EngineeringTraffic simulationK shortest path algorithmMeasure (mathematics)lcsh:QA75.5-76.95Computer Science ApplicationsTraffic congestionFluid dynamic modelModeling and SimulationShortest path problemComputer Science::Networking and Internet Architecturelcsh:Electronic computers. Computer scienceTravelling times previsionDijkstra's algorithmConstrained Shortest Path FirstSimulationTraffic waveModelling and Simulation in Engineering
researchProduct

Online Metric Learning Methods Using Soft Margins and Least Squares Formulations

2012

Online metric learning using margin maximization has been introduced as a way to learn appropriate dissimilarity measures in an efficient way when information as pairs of examples is given to the learning system in a progressive way. These schemes have several practical advantages with regard to global ones in which a training set needs to be processed. On the other hand, they may suffer from a poor performance depending on the quality of the examples and the particular tuning or other implementation details. This paper formulates several online metric learning alternatives using a passive-aggressive schema. A new formulation of the online problem using least squares is also introduced. The…

Mathematical optimizationTraining setbusiness.industrymedia_common.quotation_subjectMachine learningcomputer.software_genreLeast squaresSchema (genetic algorithms)Margin maximizationMetric (mathematics)Learning methodsQuality (business)Artificial intelligencebusinesscomputerMathematicsmedia_common
researchProduct

The Rural Postman Problem on mixed graphs with turn penalties

2002

In this paper we deal with a problem which generalizes the Rural Postman Problem defined on a mixed graph (MRPP). The generalization consists of associating a non-negative penalty to every turn as well as considering the existence of forbidden turns. This new problem fits real-world situations more closely than other simpler problems. A solution tour must traverse all the requiring service arcs and edges of the graph while not making forbidden turns. Its total cost will be the sum of the costs of the traversed arcs and edges together with the penalties associated with the turns done. The Mixed Rural Postman Problem with Turn Penalties (MRPPTP) consists of finding such a tour with a total mi…

Mathematical optimizationTraverseGeneral Computer SciencePolynomial transformationTotal costMixed graphManagement Science and Operations ResearchTravelling salesman problemModeling and SimulationComputer Science::Data Structures and AlgorithmsHeuristicsArc routingMetaheuristicMathematicsComputers & Operations Research
researchProduct

ε-Regularized two-level optimization problems: Approximation and existence results

2006

The purpose of this work is to improve some results given in [12], relating to approximate solutions for two-level optimization problems. By considering an e-regularized problem, we get new properties, under convexity assumptions in the lower level problems. In particular, we prove existence results for the solutions to the e-regularized problem, whereas the initial two-level optimization problem may fail to have a solution. Finally, as an example, we consider an approximation method with interior penalty functions.

Mathematical optimizationVector optimizationWork (thermodynamics)Optimization problemL-reductionApproximation algorithmHardness of approximationConvexityPolynomial-time approximation schemeMathematics
researchProduct

Bayesian model averaging and weighted-average least squares: Equivariance, stability, and numerical issues

2011

In this article, we describe the estimation of linear regression models with uncertainty about the choice of the explanatory variables. We introduce the Stata commands bma and wals, which implement, respectively, the exact Bayesian model-averaging estimator and the weighted-average least-squares estimator developed by Magnus, Powell, and Prüfer (2010, Journal of Econometrics 154: 139–153). Unlike standard pretest estimators that are based on some preliminary diagnostic test, these model-averaging estimators provide a coherent way of making inference on the regression parameters of interest by taking into account the uncertainty due to both the estimation and the model selection steps. Spec…

Mathematical optimizationWalsBayesian probabilityStability (learning theory)Bayesian analysisSettore SECS-P/05 - EconometriaInferenceBmaBayesian inference01 natural sciencesLeast squares010104 statistics & probabilityMathematics (miscellaneous)st0239 bma wals model uncertainty model averaging Bayesian analysis exact Bayesian model averaging weighted-average least squares0502 economics and businessLinear regressionWeighted-average least squares0101 mathematicsSettore SECS-P/01 - Economia Politica050205 econometrics Mathematicsst0239Exact bayesian model averagingModel selection05 social sciencesEstimatorModel uncertaintyAlgorithmModel averaging
researchProduct