Limiting the parameter search space for dynamic models with rational kinetics using semi-definite programming

2010 ◽  
Vol 43 (6) ◽  
pp. 150-155 ◽  
Author(s):  
Dirk Fey ◽  
Eric Bullinger
2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Seongjae Lee ◽  
Taehyoun Kim

The characteristics of an earthquake can be derived by estimating the source geometries of the earthquake using parameter inversion that minimizes the L2 norm of residuals between the measured and the synthetic displacement calculated from a dislocation model. Estimating source geometries in a dislocation model has been regarded as solving a nonlinear inverse problem. To avoid local minima and describe uncertainties, the Monte-Carlo restarts are often used to solve the problem, assuming the initial parameter search space provided by seismological studies. Since search space size significantly affects the accuracy and execution time of this procedure, faulty initial search space from seismological studies may adversely affect the accuracy of the results and the computation time. Besides, many source parameters describing physical faults lead to bad data visualization. In this paper, we propose a new machine learning-based search space reduction algorithm to overcome these challenges. This paper assumes a rectangular dislocation model, i.e., the Okada model, to calculate the surface deformation mathematically. As for the geodetic measurement of three-dimensional (3D) surface deformation, we used the stacking interferometric synthetic aperture radar (InSAR) and the multiple-aperture SAR interferometry (MAI). We define a wide initial search space and perform the Monte-Carlo restarts to collect the data points with root-mean-square error (RMSE) between measured and modeled displacement. Then, the principal component analysis (PCA) and the k-means clustering are used to project data points with low RMSE in the 2D latent space preserving the variance of original data as much as possible and extract k clusters of data with similar locations and RMSE to each other. Finally, we reduce the parameter search space using the cluster with the lowest mean RMSE. The evaluation results illustrate that our approach achieves 55.1~98.1% reductions in search space size and 60~80.5% reductions in 95% confidence interval size for all source parameters compared with the conventional method. It was also observed that the reduced search space significantly saves the computational burden of solving the nonlinear least square problem.


Nanophotonics ◽  
2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jie Huang ◽  
Hansi Ma ◽  
Dingbo Chen ◽  
Huan Yuan ◽  
Jinping Zhang ◽  
...  

AbstractNanophotonic devices with high densities are extremely attractive because they can potentially merge photonics and electronics at the nanoscale. However, traditional integrated photonic circuits are designed primarily by manually selecting parameters or employing semi-analytical models. Limited by the small parameter search space, the designed nanophotonic devices generally have a single function, and the footprints reach hundreds of microns. Recently, novel ultra-compact nanophotonic devices with digital structures were proposed. By applying inverse design algorithms, which can search the full parameter space, the proposed devices show extremely compact footprints of a few microns. The results from many groups imply that digital nanophotonics can achieve not only ultra-compact single-function devices but also miniaturized multi-function devices and complex functions such as artificial intelligence operations at the nanoscale. Furthermore, to balance the performance and fabrication tolerances of such devices, researchers have developed various solutions, such as adding regularization constraints to digital structures. We believe that with the rapid development of inverse design algorithms and continuous improvements to the nanofabrication process, digital nanophotonics will play a key role in promoting the performance of nanophotonic integration. In this review, we uncover the exciting developments and challenges in this field, analyse and explore potential solutions to these challenges and provide comments on future directions in this field.


Robotica ◽  
2018 ◽  
Vol 37 (3) ◽  
pp. 575-598 ◽  
Author(s):  
Massimo Cefalo ◽  
Giuseppe Oriolo

SUMMARYConsider the practically relevant situation in which a robotic system is assigned a task to be executed in an environment that contains moving obstacles. Generating collision-free motions that allow the robot to execute the task while complying with its control input limitations is a challenging problem, whose solution must be sought in the robot state space extended with time. We describe a general planning framework which can be tailored to robots described by either kinematic or dynamic models. The main component is a control-based scheme for producing configuration space subtrajectories along which the task constraint is continuously satisfied. The geometric motion and time history along each subtrajectory are generated separately in order to guarantee feasibility of the latter and at the same time make the scheme intrinsically more flexible. A randomized algorithm then explores the search space by repeatedly invoking the motion generation scheme and checking the produced subtrajectories for collisions. The proposed framework is shown to provide a probabilistically complete planner both in the kinematic and the dynamic case. Modified versions of the planners based on the exploration–exploitation approach are also devised to improve search efficiency or optimize a performance criterion along the solution. We present results in various scenarios involving non-holonomic mobile robots and fixed-based manipulators to show the performance of the planner.


Geophysics ◽  
2017 ◽  
Vol 82 (4) ◽  
pp. V229-V239 ◽  
Author(s):  
Jan Walda ◽  
Dirk Gajewski

The common-reflection surface (CRS) method represents a multidimensional stacking approach; i.e., the stacking surface is determined in the midpoint and offset directions. In the 2D case, three attributes span the stacking surface, thus requiring a three-parameter search contrary to a one-parameter search in the classic common-midpoint stack. However, CRS wavefront attributes use data redundancy in the midpoint direction as well, which makes them very useful in several seismic applications, e.g., data preconditioning, velocity model building, and migration. Contrary to previous works, we simultaneously estimate CRS attributes using differential evolution in subcubes of the 3D search space. Differential evolution is a global optimization technique that performs particularly well when the objective function is unknown. Because we apply DE for each subcube, we could find local maxima, additionally to the global maximum. Therefore, conflicting dips are recognized and can be used for the stack and subsequent CRS attribute-based processing, which has been an issue in the past. Our land data results from the Donbas Foldbelt in southeast Ukraine demonstrate that our method reduces coherent steep dipping noise and reveal more subsurface structures. Application of the CRS attributes for prestack data enhancement shows that velocity analysis can be carried out more reliably.


2017 ◽  
Vol 34 (5) ◽  
pp. 1113-1123 ◽  
Author(s):  
Xiaofeng Zhao ◽  
Caglar Yardim ◽  
Dongxiao Wang ◽  
Bruce M. Howe

AbstractThe refractivity from clutter (RFC) technique has been proved to be an effective way to estimate atmospheric duct structure. An important issue for RFC is how to make the estimate more robust, especially in range-dependent ducting conditions. Traditionally, statistical inversion methods need a large number of forward propagation model runs to obtain an acceptable result. Especially when the parameter search space is multidimensional, these methods are prone to being trapped into local optimal solutions. Recently published results (Zhao and Huang) indicate that the adjoint parabolic equation (PE) method holds promise for real-time estimation of one-dimensional refractive index structure from radar sea clutter returns. This paper is aimed at extending the adjoint PE method to range-dependent evaporation duct cases, with a log-linear relationship describing duct structures. Numerical simulations are used to test the performance of this method and the results are compared with that retrieved using a genetic algorithm. Both noise-free and 3-dB additive Gaussian noise clutter simulations are considered, as well as linearly and nonlinearly varying duct height with range.


2021 ◽  
Author(s):  
Fernando Buzzulini Prioste

This paper presents a genetic algorithm (GA) to solve Optimal Power Flow (OPF) problems, optimizing electricity generation fuel cost. The GA based OPF is a derivative free optimization technique that relies on the evaluation of several points in the parameter search space strictly on the objective function. A 3 bus system and the IEEE 30 bus test system are used to validate the developed GA based OPF by means of comparisons with an interior point based optimal power flow.


2020 ◽  
pp. 41-50
Author(s):  
Ph. S. Kartaev ◽  
I. D. Medvedev

The paper examines the impact of oil price shocks on inflation, as well as the impact of the choice of the monetary policy regime on the strength of this influence. We used dynamic models on panel data for the countries of the world for the period from 2000 to 2017. It is shown that mainly the impact of changes in oil prices on inflation is carried out through the channel of exchange rate. The paper demonstrates the influence of the transition to inflation targeting on the nature of the relationship between oil price shocks and inflation. This effect is asymmetrical: during periods of rising oil prices, inflation targeting reduces the effect of the transfer of oil prices, limiting negative effects of shock. During periods of decline in oil prices, this monetary policy regime, in contrast, contributes to a stronger transfer, helping to reduce inflation.


2016 ◽  
pp. 141-149
Author(s):  
S.V. Yershov ◽  
◽  
R.М. Ponomarenko ◽  

Parallel tiered and dynamic models of the fuzzy inference in expert-diagnostic software systems are considered, which knowledge bases are based on fuzzy rules. Tiered parallel and dynamic fuzzy inference procedures are developed that allow speed up of computations in the software system for evaluating the quality of scientific papers. Evaluations of the effectiveness of parallel tiered and dynamic schemes of computations are constructed with complex dependency graph between blocks of fuzzy Takagi – Sugeno rules. Comparative characteristic of the efficacy of parallel-stacked and dynamic models is carried out.


Sign in / Sign up

Export Citation Format

Share Document