WorldWideScience

Sample records for globally optimized fourier

  1. Fourier Series Optimization Opportunity

    Science.gov (United States)

    Winkel, Brian

    2008-01-01

    This note discusses the introduction of Fourier series as an immediate application of optimization of a function of more than one variable. Specifically, it is shown how the study of Fourier series can be motivated to enrich a multivariable calculus class. This is done through discovery learning and use of technology wherein students build the…

  2. High-resolution wave-theory-based ultrasound reflection imaging using the split-step fourier and globally optimized fourier finite-difference methods

    Science.gov (United States)

    Huang, Lianjie

    2013-10-29

    Methods for enhancing ultrasonic reflection imaging are taught utilizing a split-step Fourier propagator in which the reconstruction is based on recursive inward continuation of ultrasonic wavefields in the frequency-space and frequency-wave number domains. The inward continuation within each extrapolation interval consists of two steps. In the first step, a phase-shift term is applied to the data in the frequency-wave number domain for propagation in a reference medium. The second step consists of applying another phase-shift term to data in the frequency-space domain to approximately compensate for ultrasonic scattering effects of heterogeneities within the tissue being imaged (e.g., breast tissue). Results from various data input to the method indicate significant improvements are provided in both image quality and resolution.

  3. Resolution optimization with irregularly sampled Fourier data

    International Nuclear Information System (INIS)

    Ferrara, Matthew; Parker, Jason T; Cheney, Margaret

    2013-01-01

    Image acquisition systems such as synthetic aperture radar (SAR) and magnetic resonance imaging often measure irregularly spaced Fourier samples of the desired image. In this paper we show the relationship between sample locations, their associated backprojection weights, and image resolution as characterized by the resulting point spread function (PSF). Two new methods for computing data weights, based on different optimization criteria, are proposed. The first method, which solves a maximal-eigenvector problem, optimizes a PSF-derived resolution metric which is shown to be equivalent to the volume of the Cramer–Rao (positional) error ellipsoid in the uniform-weight case. The second approach utilizes as its performance metric the Frobenius error between the PSF operator and the ideal delta function, and is an extension of a previously reported algorithm. Our proposed extension appropriately regularizes the weight estimates in the presence of noisy data and eliminates the superfluous issue of image discretization in the choice of data weights. The Frobenius-error approach results in a Tikhonov-regularized inverse problem whose Tikhonov weights are dependent on the locations of the Fourier data as well as the noise variance. The two new methods are compared against several state-of-the-art weighting strategies for synthetic multistatic point-scatterer data, as well as an ‘interrupted SAR’ dataset representative of in-band interference commonly encountered in very high frequency radar applications. (paper)

  4. Stochastic and global optimization

    National Research Council Canada - National Science Library

    Dzemyda, Gintautas; Šaltenis, Vydūnas; Zhilinskas, A; Mockus, Jonas

    2002-01-01

    ... and Effectiveness of Controlled Random Search E. M. T. Hendrix, P. M. Ortigosa and I. García 129 9. Discrete Backtracking Adaptive Search for Global Optimization B. P. Kristinsdottir, Z. B. Zabinsky and...

  5. Exploring chemical reaction mechanisms through harmonic Fourier beads path optimization.

    Science.gov (United States)

    Khavrutskii, Ilja V; Smith, Jason B; Wallqvist, Anders

    2013-10-28

    Here, we apply the harmonic Fourier beads (HFB) path optimization method to study chemical reactions involving covalent bond breaking and forming on quantum mechanical (QM) and hybrid QM∕molecular mechanical (QM∕MM) potential energy surfaces. To improve efficiency of the path optimization on such computationally demanding potentials, we combined HFB with conjugate gradient (CG) optimization. The combined CG-HFB method was used to study two biologically relevant reactions, namely, L- to D-alanine amino acid inversion and alcohol acylation by amides. The optimized paths revealed several unexpected reaction steps in the gas phase. For example, on the B3LYP∕6-31G(d,p) potential, we found that alanine inversion proceeded via previously unknown intermediates, 2-iminopropane-1,1-diol and 3-amino-3-methyloxiran-2-ol. The CG-HFB method accurately located transition states, aiding in the interpretation of complex reaction mechanisms. Thus, on the B3LYP∕6-31G(d,p) potential, the gas phase activation barriers for the inversion and acylation reactions were 50.5 and 39.9 kcal∕mol, respectively. These barriers determine the spontaneous loss of amino acid chirality and cleavage of peptide bonds in proteins. We conclude that the combined CG-HFB method further advances QM and QM∕MM studies of reaction mechanisms.

  6. Optimal Padding for the Two-Dimensional Fast Fourier Transform

    Science.gov (United States)

    Dean, Bruce H.; Aronstein, David L.; Smith, Jeffrey S.

    2011-01-01

    One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that

  7. Global optimization and simulated annealing

    NARCIS (Netherlands)

    Dekkers, A.; Aarts, E.H.L.

    1988-01-01

    In this paper we are concerned with global optimization, which can be defined as the problem of finding points on a bounded subset of Rn in which some real valued functionf assumes its optimal (i.e. maximal or minimal) value. We present a stochastic approach which is based on the simulated annealing

  8. Convex analysis and global optimization

    CERN Document Server

    Tuy, Hoang

    2016-01-01

    This book presents state-of-the-art results and methodologies in modern global optimization, and has been a staple reference for researchers, engineers, advanced students (also in applied mathematics), and practitioners in various fields of engineering. The second edition has been brought up to date and continues to develop a coherent and rigorous theory of deterministic global optimization, highlighting the essential role of convex analysis. The text has been revised and expanded to meet the needs of research, education, and applications for many years to come. Updates for this new edition include: · Discussion of modern approaches to minimax, fixed point, and equilibrium theorems, and to nonconvex optimization; · Increased focus on dealing more efficiently with ill-posed problems of global optimization, particularly those with hard constraints;

  9. Regularized spherical polar fourier diffusion MRI with optimal dictionary learning.

    Science.gov (United States)

    Cheng, Jian; Jiang, Tianzi; Deriche, Rachid; Shen, Dinggang; Yap, Pew-Thian

    2013-01-01

    Compressed Sensing (CS) takes advantage of signal sparsity or compressibility and allows superb signal reconstruction from relatively few measurements. Based on CS theory, a suitable dictionary for sparse representation of the signal is required. In diffusion MRI (dMRI), CS methods proposed for reconstruction of diffusion-weighted signal and the Ensemble Average Propagator (EAP) utilize two kinds of Dictionary Learning (DL) methods: 1) Discrete Representation DL (DR-DL), and 2) Continuous Representation DL (CR-DL). DR-DL is susceptible to numerical inaccuracy owing to interpolation and regridding errors in a discretized q-space. In this paper, we propose a novel CR-DL approach, called Dictionary Learning - Spherical Polar Fourier Imaging (DL-SPFI) for effective compressed-sensing reconstruction of the q-space diffusion-weighted signal and the EAP. In DL-SPFI, a dictionary that sparsifies the signal is learned from the space of continuous Gaussian diffusion signals. The learned dictionary is then adaptively applied to different voxels using a weighted LASSO framework for robust signal reconstruction. Compared with the start-of-the-art CR-DL and DR-DL methods proposed by Merlet et al. and Bilgic et al., respectively, our work offers the following advantages. First, the learned dictionary is proved to be optimal for Gaussian diffusion signals. Second, to our knowledge, this is the first work to learn a voxel-adaptive dictionary. The importance of the adaptive dictionary in EAP reconstruction will be demonstrated theoretically and empirically. Third, optimization in DL-SPFI is only performed in a small subspace resided by the SPF coefficients, as opposed to the q-space approach utilized by Merlet et al. We experimentally evaluated DL-SPFI with respect to L1-norm regularized SPFI (L1-SPFI), which uses the original SPF basis, and the DR-DL method proposed by Bilgic et al. The experiment results on synthetic and real data indicate that the learned dictionary produces

  10. Global optimization and sensitivity analysis

    International Nuclear Information System (INIS)

    Cacuci, D.G.

    1990-01-01

    A new direction for the analysis of nonlinear models of nuclear systems is suggested to overcome fundamental limitations of sensitivity analysis and optimization methods currently prevalent in nuclear engineering usage. This direction is toward a global analysis of the behavior of the respective system as its design parameters are allowed to vary over their respective design ranges. Presented is a methodology for global analysis that unifies and extends the current scopes of sensitivity analysis and optimization by identifying all the critical points (maxima, minima) and solution bifurcation points together with corresponding sensitivities at any design point of interest. The potential applicability of this methodology is illustrated with test problems involving multiple critical points and bifurcations and comprising both equality and inequality constraints

  11. Optimal and fast rotational alignment of volumes with missing data in Fourier space.

    Science.gov (United States)

    Shatsky, Maxim; Arbelaez, Pablo; Glaeser, Robert M; Brenner, Steven E

    2013-11-01

    Electron tomography of intact cells has the potential to reveal the entire cellular content at a resolution corresponding to individual macromolecular complexes. Characterization of macromolecular complexes in tomograms is nevertheless an extremely challenging task due to the high level of noise, and due to the limited tilt angle that results in missing data in Fourier space. By identifying particles of the same type and averaging their 3D volumes, it is possible to obtain a structure at a more useful resolution for biological interpretation. Currently, classification and averaging of sub-tomograms is limited by the speed of computational methods that optimize alignment between two sub-tomographic volumes. The alignment optimization is hampered by the fact that the missing data in Fourier space has to be taken into account during the rotational search. A similar problem appears in single particle electron microscopy where the random conical tilt procedure may require averaging of volumes with a missing cone in Fourier space. We present a fast implementation of a method guaranteed to find an optimal rotational alignment that maximizes the constrained cross-correlation function (cCCF) computed over the actual overlap of data in Fourier space. Copyright © 2013 The Authors. Published by Elsevier Inc. All rights reserved.

  12. Essays and surveys in global optimization

    CERN Document Server

    Audet, Charles; Savard, Giles

    2005-01-01

    Global optimization aims at solving the most general problems of deterministic mathematical programming. In addition, once the solutions are found, this methodology is also expected to prove their optimality. With these difficulties in mind, global optimization is becoming an increasingly powerful and important methodology. This book is the most recent examination of its mathematical capability, power, and wide ranging solutions to many fields in the applied sciences.

  13. Introduction to Nonlinear and Global Optimization

    NARCIS (Netherlands)

    Hendrix, E.M.T.; Tóth, B.

    2010-01-01

    This self-contained text provides a solid introduction to global and nonlinear optimization, providing students of mathematics and interdisciplinary sciences with a strong foundation in applied optimization techniques. The book offers a unique hands-on and critical approach to applied optimization

  14. Stochastic global optimization as a filtering problem

    International Nuclear Information System (INIS)

    Stinis, Panos

    2012-01-01

    We present a reformulation of stochastic global optimization as a filtering problem. The motivation behind this reformulation comes from the fact that for many optimization problems we cannot evaluate exactly the objective function to be optimized. Similarly, we may not be able to evaluate exactly the functions involved in iterative optimization algorithms. For example, we may only have access to noisy measurements of the functions or statistical estimates provided through Monte Carlo sampling. This makes iterative optimization algorithms behave like stochastic maps. Naive global optimization amounts to evolving a collection of realizations of this stochastic map and picking the realization with the best properties. This motivates the use of filtering techniques to allow focusing on realizations that are more promising than others. In particular, we present a filtering reformulation of global optimization in terms of a special case of sequential importance sampling methods called particle filters. The increasing popularity of particle filters is based on the simplicity of their implementation and their flexibility. We utilize the flexibility of particle filters to construct a stochastic global optimization algorithm which can converge to the optimal solution appreciably faster than naive global optimization. Several examples of parametric exponential density estimation are provided to demonstrate the efficiency of the approach.

  15. Advances in stochastic and deterministic global optimization

    CERN Document Server

    Zhigljavsky, Anatoly; Žilinskas, Julius

    2016-01-01

    Current research results in stochastic and deterministic global optimization including single and multiple objectives are explored and presented in this book by leading specialists from various fields. Contributions include applications to multidimensional data visualization, regression, survey calibration, inventory management, timetabling, chemical engineering, energy systems, and competitive facility location. Graduate students, researchers, and scientists in computer science, numerical analysis, optimization, and applied mathematics will be fascinated by the theoretical, computational, and application-oriented aspects of stochastic and deterministic global optimization explored in this book. This volume is dedicated to the 70th birthday of Antanas Žilinskas who is a leading world expert in global optimization. Professor Žilinskas's research has concentrated on studying models for the objective function, the development and implementation of efficient algorithms for global optimization with single and mu...

  16. Optimization of sampling pattern and the design of Fourier ptychographic illuminator.

    Science.gov (United States)

    Guo, Kaikai; Dong, Siyuan; Nanda, Pariksheet; Zheng, Guoan

    2015-03-09

    Fourier ptychography (FP) is a recently developed imaging approach that facilitates high-resolution imaging beyond the cutoff frequency of the employed optics. In the original FP approach, a periodic LED array is used for sample illumination, and therefore, the scanning pattern is a uniform grid in the Fourier space. Such a uniform sampling scheme leads to 3 major problems for FP, namely: 1) it requires a large number of raw images, 2) it introduces the raster grid artefacts in the reconstruction process, and 3) it requires a high-dynamic-range detector. Here, we investigate scanning sequences and sampling patterns to optimize the FP approach. For most biological samples, signal energy is concentrated at low-frequency region, and as such, we can perform non-uniform Fourier sampling in FP by considering the signal structure. In contrast, conventional ptychography perform uniform sampling over the entire real space. To implement the non-uniform Fourier sampling scheme in FP, we have designed and built an illuminator using LEDs mounted on a 3D-printed plastic case. The advantages of this illuminator are threefold in that: 1) it reduces the number of image acquisitions by at least 50% (68 raw images versus 137 in the original FP setup), 2) it departs from the translational symmetry of sampling to solve the raster grid artifact problem, and 3) it reduces the dynamic range of the captured images 6 fold. The results reported in this paper significantly shortened acquisition time and improved quality of FP reconstructions. It may provide new insights for developing Fourier ptychographic imaging platforms and find important applications in digital pathology.

  17. On the efficiency of chaos optimization algorithms for global optimization

    International Nuclear Information System (INIS)

    Yang Dixiong; Li Gang; Cheng Gengdong

    2007-01-01

    Chaos optimization algorithms as a novel method of global optimization have attracted much attention, which were all based on Logistic map. However, we have noticed that the probability density function of the chaotic sequences derived from Logistic map is a Chebyshev-type one, which may affect the global searching capacity and computational efficiency of chaos optimization algorithms considerably. Considering the statistical property of the chaotic sequences of Logistic map and Kent map, the improved hybrid chaos-BFGS optimization algorithm and the Kent map based hybrid chaos-BFGS algorithm are proposed. Five typical nonlinear functions with multimodal characteristic are tested to compare the performance of five hybrid optimization algorithms, which are the conventional Logistic map based chaos-BFGS algorithm, improved Logistic map based chaos-BFGS algorithm, Kent map based chaos-BFGS algorithm, Monte Carlo-BFGS algorithm, mesh-BFGS algorithm. The computational performance of the five algorithms is compared, and the numerical results make us question the high efficiency of the chaos optimization algorithms claimed in some references. It is concluded that the efficiency of the hybrid optimization algorithms is influenced by the statistical property of chaotic/stochastic sequences generated from chaotic/stochastic algorithms, and the location of the global optimum of nonlinear functions. In addition, it is inappropriate to advocate the high efficiency of the global optimization algorithms only depending on several numerical examples of low-dimensional functions

  18. On benchmarking Stochastic Global Optimization Algorithms

    NARCIS (Netherlands)

    Hendrix, E.M.T.; Lancinskas, A.

    2015-01-01

    A multitude of heuristic stochastic optimization algorithms have been described in literature to obtain good solutions of the box-constrained global optimization problem often with a limit on the number of used function evaluations. In the larger question of which algorithms behave well on which

  19. Laplace-Fourier-domain dispersion analysis of an average derivative optimal scheme for scalar-wave equation

    Science.gov (United States)

    Chen, Jing-Bo

    2014-06-01

    By using low-frequency components of the damped wavefield, Laplace-Fourier-domain full waveform inversion (FWI) can recover a long-wavelength velocity model from the original undamped seismic data lacking low-frequency information. Laplace-Fourier-domain modelling is an important foundation of Laplace-Fourier-domain FWI. Based on the numerical phase velocity and the numerical attenuation propagation velocity, a method for performing Laplace-Fourier-domain numerical dispersion analysis is developed in this paper. This method is applied to an average-derivative optimal scheme. The results show that within the relative error of 1 per cent, the Laplace-Fourier-domain average-derivative optimal scheme requires seven gridpoints per smallest wavelength and smallest pseudo-wavelength for both equal and unequal directional sampling intervals. In contrast, the classical five-point scheme requires 23 gridpoints per smallest wavelength and smallest pseudo-wavelength to achieve the same accuracy. Numerical experiments demonstrate the theoretical analysis.

  20. Optimal beneficiation of global resources

    Energy Technology Data Exchange (ETDEWEB)

    Aloisi de Larderel, J. (Industry and Environment Office, Paris (France). United Nations Environment Programme)

    1989-01-01

    The growth of the world's population and related human activities are clearly leaving major effects on the environment and on the level of use of natural resources: forests are disappearing, air pollution is leading to acid rains, changes are occuring in the atmospheric ozone and global climate, more and more people lack access to reasonable safe supplies of water, soil pollution is becoming a problem, mineral and energy resources are increasingly being used. Producing more with less, producing more, polluting less, these are basic challenges that the world now faces. Low- and non-waste technologies are certainly one of the keys to those challenges.

  1. A Direct Search Algorithm for Global Optimization

    Directory of Open Access Journals (Sweden)

    Enrique Baeyens

    2016-06-01

    Full Text Available A direct search algorithm is proposed for minimizing an arbitrary real valued function. The algorithm uses a new function transformation and three simplex-based operations. The function transformation provides global exploration features, while the simplex-based operations guarantees the termination of the algorithm and provides global convergence to a stationary point if the cost function is differentiable and its gradient is Lipschitz continuous. The algorithm’s performance has been extensively tested using benchmark functions and compared to some well-known global optimization algorithms. The results of the computational study show that the algorithm combines both simplicity and efficiency and is competitive with the heuristics-based strategies presently used for global optimization.

  2. Evolutionary global optimization, manifolds and applications

    CERN Document Server

    Aguiar e Oliveira Junior, Hime

    2016-01-01

    This book presents powerful techniques for solving global optimization problems on manifolds by means of evolutionary algorithms, and shows in practice how these techniques can be applied to solve real-world problems. It describes recent findings and well-known key facts in general and differential topology, revisiting them all in the context of application to current optimization problems. Special emphasis is put on game theory problems. Here, these problems are reformulated as constrained global optimization tasks and solved with the help of Fuzzy ASA. In addition, more abstract examples, including minimizations of well-known functions, are also included. Although the Fuzzy ASA approach has been chosen as the main optimizing paradigm, the book suggests that other metaheuristic methods could be used as well. Some of them are introduced, together with their advantages and disadvantages. Readers should possess some knowledge of linear algebra, and of basic concepts of numerical analysis and probability theory....

  3. Global optimization methods for engineering design

    Science.gov (United States)

    Arora, Jasbir S.

    1990-01-01

    The problem is to find a global minimum for the Problem P. Necessary and sufficient conditions are available for local optimality. However, global solution can be assured only under the assumption of convexity of the problem. If the constraint set S is compact and the cost function is continuous on it, existence of a global minimum is guaranteed. However, in view of the fact that no global optimality conditions are available, a global solution can be found only by an exhaustive search to satisfy Inequality. The exhaustive search can be organized in such a way that the entire design space need not be searched for the solution. This way the computational burden is reduced somewhat. It is concluded that zooming algorithm for global optimizations appears to be a good alternative to stochastic methods. More testing is needed; a general, robust, and efficient local minimizer is required. IDESIGN was used in all numerical calculations which is based on a sequential quadratic programming algorithm, and since feasible set keeps on shrinking, a good algorithm to find an initial feasible point is required. Such algorithms need to be developed and evaluated.

  4. Conference on Convex Analysis and Global Optimization

    CERN Document Server

    Pardalos, Panos

    2001-01-01

    There has been much recent progress in global optimization algo­ rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun­ damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon­ vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en­ dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by th...

  5. Beyond Fourier

    Science.gov (United States)

    Hoch, Jeffrey C.

    2017-10-01

    Non-Fourier methods of spectrum analysis are gaining traction in NMR spectroscopy, driven by their utility for processing nonuniformly sampled data. These methods afford new opportunities for optimizing experiment time, resolution, and sensitivity of multidimensional NMR experiments, but they also pose significant challenges not encountered with the discrete Fourier transform. A brief history of non-Fourier methods in NMR serves to place different approaches in context. Non-Fourier methods reflect broader trends in the growing importance of computation in NMR, and offer insights for future software development.

  6. Beyond Fourier.

    Science.gov (United States)

    Hoch, Jeffrey C

    2017-10-01

    Non-Fourier methods of spectrum analysis are gaining traction in NMR spectroscopy, driven by their utility for processing nonuniformly sampled data. These methods afford new opportunities for optimizing experiment time, resolution, and sensitivity of multidimensional NMR experiments, but they also pose significant challenges not encountered with the discrete Fourier transform. A brief history of non-Fourier methods in NMR serves to place different approaches in context. Non-Fourier methods reflect broader trends in the growing importance of computation in NMR, and offer insights for future software development. Copyright © 2017 Elsevier Inc. All rights reserved.

  7. A Novel Particle Swarm Optimization Algorithm for Global Optimization.

    Science.gov (United States)

    Wang, Chun-Feng; Liu, Kui

    2016-01-01

    Particle Swarm Optimization (PSO) is a recently developed optimization method, which has attracted interest of researchers in various areas due to its simplicity and effectiveness, and many variants have been proposed. In this paper, a novel Particle Swarm Optimization algorithm is presented, in which the information of the best neighbor of each particle and the best particle of the entire population in the current iteration is considered. Meanwhile, to avoid premature, an abandoned mechanism is used. Furthermore, for improving the global convergence speed of our algorithm, a chaotic search is adopted in the best solution of the current iteration. To verify the performance of our algorithm, standard test functions have been employed. The experimental results show that the algorithm is much more robust and efficient than some existing Particle Swarm Optimization algorithms.

  8. Generalizing, optimizing, and inventing numerical algorithms for the fractional Fourier, Fresnel, and linear canonical transforms

    Science.gov (United States)

    Hennelly, Bryan M.; Sheridan, John T.

    2005-05-01

    By use of matrix-based techniques it is shown how the space-bandwidth product (SBP) of a signal, as indicated by the location of the signal energy in the Wigner distribution function, can be tracked through any quadratic-phase optical system whose operation is described by the linear canonical transform. Then, applying the regular uniform sampling criteria imposed by the SBP and linking the criteria explicitly to a decomposition of the optical matrix of the system, it is shown how numerical algorithms (employing interpolation and decimation), which exhibit both invertibility and additivity, can be implemented. Algorithms appearing in the literature for a variety of transforms (Fresnel, fractional Fourier) are shown to be special cases of our general approach. The method is shown to allow the existing algorithms to be optimized and is also shown to permit the invention of many new algorithms.

  9. Competing intelligent search agents in global optimization

    Energy Technology Data Exchange (ETDEWEB)

    Streltsov, S.; Vakili, P. [Boston Univ., MA (United States); Muchnik, I. [Rutgers Univ., Piscataway, NJ (United States)

    1996-12-31

    In this paper we present a new search methodology that we view as a development of intelligent agent approach to the analysis of complex system. The main idea is to consider search process as a competition mechanism between concurrent adaptive intelligent agents. Agents cooperate in achieving a common search goal and at the same time compete with each other for computational resources. We propose a statistical selection approach to resource allocation between agents that leads to simple and efficient on average index allocation policies. We use global optimization as the most general setting that encompasses many types of search problems, and show how proposed selection policies can be used to improve and combine various global optimization methods.

  10. Global Optimization Ensemble Model for Classification Methods

    Science.gov (United States)

    Anwar, Hina; Qamar, Usman; Muzaffar Qureshi, Abdul Wahab

    2014-01-01

    Supervised learning is the process of data mining for deducing rules from training datasets. A broad array of supervised learning algorithms exists, every one of them with its own advantages and drawbacks. There are some basic issues that affect the accuracy of classifier while solving a supervised learning problem, like bias-variance tradeoff, dimensionality of input space, and noise in the input data space. All these problems affect the accuracy of classifier and are the reason that there is no global optimal method for classification. There is not any generalized improvement method that can increase the accuracy of any classifier while addressing all the problems stated above. This paper proposes a global optimization ensemble model for classification methods (GMC) that can improve the overall accuracy for supervised learning problems. The experimental results on various public datasets showed that the proposed model improved the accuracy of the classification models from 1% to 30% depending upon the algorithm complexity. PMID:24883382

  11. Global Optimization Ensemble Model for Classification Methods

    Directory of Open Access Journals (Sweden)

    Hina Anwar

    2014-01-01

    Full Text Available Supervised learning is the process of data mining for deducing rules from training datasets. A broad array of supervised learning algorithms exists, every one of them with its own advantages and drawbacks. There are some basic issues that affect the accuracy of classifier while solving a supervised learning problem, like bias-variance tradeoff, dimensionality of input space, and noise in the input data space. All these problems affect the accuracy of classifier and are the reason that there is no global optimal method for classification. There is not any generalized improvement method that can increase the accuracy of any classifier while addressing all the problems stated above. This paper proposes a global optimization ensemble model for classification methods (GMC that can improve the overall accuracy for supervised learning problems. The experimental results on various public datasets showed that the proposed model improved the accuracy of the classification models from 1% to 30% depending upon the algorithm complexity.

  12. Solving global optimization problems on GPU cluster

    Energy Technology Data Exchange (ETDEWEB)

    Barkalov, Konstantin; Gergel, Victor; Lebedev, Ilya [Lobachevsky State University of Nizhni Novgorod, Gagarin Avenue 23, 603950 Nizhni Novgorod (Russian Federation)

    2016-06-08

    The paper contains the results of investigation of a parallel global optimization algorithm combined with a dimension reduction scheme. This allows solving multidimensional problems by means of reducing to data-independent subproblems with smaller dimension solved in parallel. The new element implemented in the research consists in using several graphic accelerators at different computing nodes. The paper also includes results of solving problems of well-known multiextremal test class GKLS on Lobachevsky supercomputer using tens of thousands of GPU cores.

  13. Application of Fourier transform near-infrared spectroscopy to optimization of green tea steaming process conditions.

    Science.gov (United States)

    Ono, Daiki; Bamba, Takeshi; Oku, Yuichi; Yonetani, Tsutomu; Fukusaki, Eiichiro

    2011-09-01

    In this study, we constructed prediction models by metabolic fingerprinting of fresh green tea leaves using Fourier transform near-infrared (FT-NIR) spectroscopy and partial least squares (PLS) regression analysis to objectively optimize of the steaming process conditions in green tea manufacture. The steaming process is the most important step for manufacturing high quality green tea products. However, the parameter setting of the steamer is currently determined subjectively by the manufacturer. Therefore, a simple and robust system that can be used to objectively set the steaming process parameters is necessary. We focused on FT-NIR spectroscopy because of its simple operation, quick measurement, and low running costs. After removal of noise in the spectral data by principal component analysis (PCA), PLS regression analysis was performed using spectral information as independent variables, and the steaming parameters set by experienced manufacturers as dependent variables. The prediction models were successfully constructed with satisfactory accuracy. Moreover, the results of the demonstrated experiment suggested that the green tea steaming process parameters could be predicted on a larger manufacturing scale. This technique will contribute to improvement of the quality and productivity of green tea because it can objectively optimize the complicated green tea steaming process and will be suitable for practical use in green tea manufacture. Copyright © 2011 The Society for Biotechnology, Japan. Published by Elsevier B.V. All rights reserved.

  14. A perturbed martingale approach to global optimization

    Energy Technology Data Exchange (ETDEWEB)

    Sarkar, Saikat [Computational Mechanics Lab, Department of Civil Engineering, Indian Institute of Science, Bangalore 560012 (India); Roy, Debasish, E-mail: royd@civil.iisc.ernet.in [Computational Mechanics Lab, Department of Civil Engineering, Indian Institute of Science, Bangalore 560012 (India); Vasu, Ram Mohan [Department of Instrumentation and Applied Physics, Indian Institute of Science, Bangalore 560012 (India)

    2014-08-01

    A new global stochastic search, guided mainly through derivative-free directional information computable from the sample statistical moments of the design variables within a Monte Carlo setup, is proposed. The search is aided by imparting to the directional update term additional layers of random perturbations referred to as ‘coalescence’ and ‘scrambling’. A selection step, constituting yet another avenue for random perturbation, completes the global search. The direction-driven nature of the search is manifest in the local extremization and coalescence components, which are posed as martingale problems that yield gain-like update terms upon discretization. As anticipated and numerically demonstrated, to a limited extent, against the problem of parameter recovery given the chaotic response histories of a couple of nonlinear oscillators, the proposed method appears to offer a more rational, more accurate and faster alternative to most available evolutionary schemes, prominently the particle swarm optimization. - Highlights: • Evolutionary global optimization is posed as a perturbed martingale problem. • Resulting search via additive updates is a generalization over Gateaux derivatives. • Additional layers of random perturbation help avoid trapping at local extrema. • The approach ensures efficient design space exploration and high accuracy. • The method is numerically assessed via parameter recovery of chaotic oscillators.

  15. Optimal defocus selection based on normed Fourier transform for digital fringe pattern profilometry.

    Science.gov (United States)

    Kamagara, Abel; Wang, Xiangzhao; Li, Sikun

    2017-10-01

    Owing to gamma-effect robustness and high-speed imaging capabilities, projector defocusing of binary-coded fringe patterns is by far the most widely used and effective technique in generating sinusoidal fringe patterns for three-dimensional optical topography measurement with digital fringe projection techniques. However, this technique is not trouble-free. It is borne with uncertainty and challenges mainly because it remains somewhat difficult to quantify and ascertain the level of defocus required for desired fidelity in sinuousness of the projected fringe pattern. Too much or too little defocusing will affect the sinuosity accuracy of fringe patterns and consequently jeopardize the quality of the measurement results. In this paper, by combining intrinsic phase spectral sensitivities and normed Fourier transform, a method to quantify the amount of defocus and subsequently select the optimal degree of sinuosity for generating digital sinusoidal fringe patterns with projector defocusing for fringe pattern optical three-dimensional profilometry is proposed. Numerical simulations plus experiments give evidence of the feasibility and validity of the proposed method in enabling an improved digital binary defocusing technique for optical phase-shift profilometry using the digital fringe projection technique.

  16. Dual Schroedinger Equation as Global Optimization Algorithm

    International Nuclear Information System (INIS)

    Huang Xiaofei; eGain Communications, Mountain View, CA 94043

    2011-01-01

    The dual Schroedinger equation is defined as replacing the imaginary number i by -1 in the original one. This paper shows that the dual equation shares the same stationary states as the original one. Different from the original one, it explicitly defines a dynamic process for a system to evolve from any state to lower energy states and eventually to the lowest one. Its power as a global optimization algorithm might be used by nature for constructing atoms and molecules. It shall be interesting to verify its existence in nature.

  17. Global Optimization using Interval Analysis : Interval Optimization for Aerospace Applications

    NARCIS (Netherlands)

    Van Kampen, E.

    2010-01-01

    Optimization is an important element in aerospace related research. It is encountered for example in trajectory optimization problems, such as: satellite formation flying, spacecraft re-entry optimization and airport approach and departure optimization; in control optimization, for example in

  18. Fast optimal wavefront reconstruction for multi-conjugate adaptive optics using the Fourier domain preconditioned conjugate gradient algorithm.

    Science.gov (United States)

    Vogel, Curtis R; Yang, Qiang

    2006-08-21

    We present two different implementations of the Fourier domain preconditioned conjugate gradient algorithm (FD-PCG) to efficiently solve the large structured linear systems that arise in optimal volume turbulence estimation, or tomography, for multi-conjugate adaptive optics (MCAO). We describe how to deal with several critical technical issues, including the cone coordinate transformation problem and sensor subaperture grid spacing. We also extend the FD-PCG approach to handle the deformable mirror fitting problem for MCAO.

  19. A hybrid bird mating optimizer algorithm with teaching-learning-based optimization for global numerical optimization

    Directory of Open Access Journals (Sweden)

    Qingyang Zhang

    2015-02-01

    Full Text Available Bird Mating Optimizer (BMO is a novel meta-heuristic optimization algorithm inspired by intelligent mating behavior of birds. However, it is still insufficient in convergence of speed and quality of solution. To overcome these drawbacks, this paper proposes a hybrid algorithm (TLBMO, which is established by combining the advantages of Teaching-learning-based optimization (TLBO and Bird Mating Optimizer (BMO. The performance of TLBMO is evaluated on 23 benchmark functions, and compared with seven state-of-the-art approaches, namely BMO, TLBO, Artificial Bee Bolony (ABC, Particle Swarm Optimization (PSO, Fast Evolution Programming (FEP, Differential Evolution (DE, Group Search Optimization (GSO. Experimental results indicate that the proposed method performs better than other existing algorithms for global numerical optimization.

  20. Parallel Global Optimization with the Particle Swarm Algorithm (Preprint)

    National Research Council Canada - National Science Library

    Schutte, J. F; Reinbolt, J. A; Fregly, B. J; Haftka, R. T; George, A. D

    2004-01-01

    .... To obtain enhanced computational throughput and global search capability, we detail the coarse-grained parallelization of an increasingly popular global search method, the Particle Swarm Optimization (PSO) algorithm...

  1. 3rd World Congress on Global Optimization in Engineering & Science

    CERN Document Server

    Ruan, Ning; Xing, Wenxun; WCGO-III; Advances in Global Optimization

    2015-01-01

    This proceedings volume addresses advances in global optimization—a multidisciplinary research field that deals with the analysis, characterization, and computation of global minima and/or maxima of nonlinear, non-convex, and nonsmooth functions in continuous or discrete forms. The volume contains selected papers from the third biannual World Congress on Global Optimization in Engineering & Science (WCGO), held in the Yellow Mountains, Anhui, China on July 8-12, 2013. The papers fall into eight topical sections: mathematical programming; combinatorial optimization; duality theory; topology optimization; variational inequalities and complementarity problems; numerical optimization; stochastic models and simulation; and complex simulation and supply chain analysis.

  2. 4th International Conference on Frontiers in Global Optimization

    CERN Document Server

    Pardalos, Panos

    2004-01-01

    Global Optimization has emerged as one of the most exciting new areas of mathematical programming. Global optimization has received a wide attraction from many fields in the past few years, due to the success of new algorithms for addressing previously intractable problems from diverse areas such as computational chemistry and biology, biomedicine, structural optimization, computer sciences, operations research, economics, and engineering design and control. This book contains refereed invited papers submitted at the 4th international confer­ ence on Frontiers in Global Optimization held at Santorini, Greece during June 8-12, 2003. Santorini is one of the few sites of Greece, with wild beauty created by the explosion of a volcano which is in the middle of the gulf of the island. The mystic landscape with its numerous mult-extrema, was an inspiring location particularly for researchers working on global optimization. The three previous conferences on "Recent Advances in Global Opti­ mization", "State-of-the-...

  3. A proposal of Fourier-Bessel expansion with optimized ensembles of bases to analyse two dimensional image

    Science.gov (United States)

    Yamasaki, K.; Fujisawa, A.; Nagashima, Y.

    2017-09-01

    It is a critical issue to find the best set of fitting function bases in mode structural analysis of two dimensional images like plasma emission profiles. The paper proposes a method to optimize a set of the bases in the case of Fourier-Bessel function series, using their orthonormal property, for more efficient and precise analysis. The method is applied on a tomography image of plasma emission obtained with the Maximum-likelihood expectation maximization method in a linear cylindrical device. The result demonstrates the excellency of the method that realizes the smaller residual error and minimum Akaike information criterion using smaller number of fitting function bases.

  4. Microwave tomography global optimization, parallelization and performance evaluation

    CERN Document Server

    Noghanian, Sima; Desell, Travis; Ashtari, Ali

    2014-01-01

    This book provides a detailed overview on the use of global optimization and parallel computing in microwave tomography techniques. The book focuses on techniques that are based on global optimization and electromagnetic numerical methods. The authors provide parallelization techniques on homogeneous and heterogeneous computing architectures on high performance and general purpose futuristic computers. The book also discusses the multi-level optimization technique, hybrid genetic algorithm and its application in breast cancer imaging.

  5. Decentralized Control Using Global Optimization (DCGO) (Preprint)

    National Research Council Canada - National Science Library

    Flint, Matthew; Khovanova, Tanya; Curry, Michael

    2007-01-01

    The coordination of a team of distributed air vehicles requires a complex optimization, balancing limited communication bandwidths, non-instantaneous planning times and network delays, while at the...

  6. Reducing acquisition times in multidimensional NMR with a time-optimized Fourier encoding algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Zhiyong [Department of Chemical Physics, Weizmann Institute of Science, Rehovot 76100 (Israel); Department of Electronic Science, Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance, Xiamen University, Xiamen, Fujian 361005 (China); Smith, Pieter E. S.; Frydman, Lucio, E-mail: lucio.frydman@weizmann.ac.il [Department of Chemical Physics, Weizmann Institute of Science, Rehovot 76100 (Israel)

    2014-11-21

    Speeding up the acquisition of multidimensional nuclear magnetic resonance (NMR) spectra is an important topic in contemporary NMR, with central roles in high-throughput investigations and analyses of marginally stable samples. A variety of fast NMR techniques have been developed, including methods based on non-uniform sampling and Hadamard encoding, that overcome the long sampling times inherent to schemes based on fast-Fourier-transform (FFT) methods. Here, we explore the potential of an alternative fast acquisition method that leverages a priori knowledge, to tailor polychromatic pulses and customized time delays for an efficient Fourier encoding of the indirect domain of an NMR experiment. By porting the encoding of the indirect-domain to the excitation process, this strategy avoids potential artifacts associated with non-uniform sampling schemes and uses a minimum number of scans equal to the number of resonances present in the indirect dimension. An added convenience is afforded by the fact that a usual 2D FFT can be used to process the generated data. Acquisitions of 2D heteronuclear correlation NMR spectra on quinine and on the anti-inflammatory drug isobutyl propionic phenolic acid illustrate the new method's performance. This method can be readily automated to deal with complex samples such as those occurring in metabolomics, in in-cell as well as in in vivo NMR applications, where speed and temporal stability are often primary concerns.

  7. Reducing acquisition times in multidimensional NMR with a time-optimized Fourier encoding algorithm

    International Nuclear Information System (INIS)

    Zhang, Zhiyong; Smith, Pieter E. S.; Frydman, Lucio

    2014-01-01

    Speeding up the acquisition of multidimensional nuclear magnetic resonance (NMR) spectra is an important topic in contemporary NMR, with central roles in high-throughput investigations and analyses of marginally stable samples. A variety of fast NMR techniques have been developed, including methods based on non-uniform sampling and Hadamard encoding, that overcome the long sampling times inherent to schemes based on fast-Fourier-transform (FFT) methods. Here, we explore the potential of an alternative fast acquisition method that leverages a priori knowledge, to tailor polychromatic pulses and customized time delays for an efficient Fourier encoding of the indirect domain of an NMR experiment. By porting the encoding of the indirect-domain to the excitation process, this strategy avoids potential artifacts associated with non-uniform sampling schemes and uses a minimum number of scans equal to the number of resonances present in the indirect dimension. An added convenience is afforded by the fact that a usual 2D FFT can be used to process the generated data. Acquisitions of 2D heteronuclear correlation NMR spectra on quinine and on the anti-inflammatory drug isobutyl propionic phenolic acid illustrate the new method's performance. This method can be readily automated to deal with complex samples such as those occurring in metabolomics, in in-cell as well as in in vivo NMR applications, where speed and temporal stability are often primary concerns

  8. Interactive Cosegmentation Using Global and Local Energy Optimization

    OpenAIRE

    Xingping Dong,; Jianbing Shen,; Shao, Ling; Yang, Ming-Hsuan

    2015-01-01

    We propose a novel interactive cosegmentation method using global and local energy optimization. The global energy includes two terms: 1) the global scribbled energy and 2) the interimage energy. The first one utilizes the user scribbles to build the Gaussian mixture model and improve the cosegmentation performance. The second one is a global constraint, which attempts to match the histograms of common objects. To minimize the local energy, we apply the spline regression to learn the smoothne...

  9. Theory and Algorithms for Global/Local Design Optimization

    National Research Council Canada - National Science Library

    Haftka, Raphael T

    2004-01-01

    ... the component and overall design as well as on exploration of global optimization algorithms. In the former category, heuristic decomposition was followed with proof that it solves the original problem...

  10. Theory and Algorithms for Global/Local Design Optimization

    National Research Council Canada - National Science Library

    Watson, Layne T; Guerdal, Zafer; Haftka, Raphael T

    2005-01-01

    The motivating application for this research is the global/local optimal design of composite aircraft structures such as wings and fuselages, but the theory and algorithms are more widely applicable...

  11. Acceleration techniques in the univariate Lipschitz global optimization

    Science.gov (United States)

    Sergeyev, Yaroslav D.; Kvasov, Dmitri E.; Mukhametzhanov, Marat S.; De Franco, Angela

    2016-10-01

    Univariate box-constrained Lipschitz global optimization problems are considered in this contribution. Geometric and information statistical approaches are presented. The novel powerful local tuning and local improvement techniques are described in the contribution as well as the traditional ways to estimate the Lipschitz constant. The advantages of the presented local tuning and local improvement techniques are demonstrated using the operational characteristics approach for comparing deterministic global optimization algorithms on the class of 100 widely used test functions.

  12. Global optimization of silicon nanowires for efficient parametric processes

    DEFF Research Database (Denmark)

    Vukovic, Dragana; Xu, Jing; Mørk, Jesper

    2013-01-01

    We present a global optimization of silicon nanowires for parametric single-pump mixing. For the first time, the effect of surface roughness-induced loss is included in the analysis, significantly influencing the optimum waveguide dimensions.......We present a global optimization of silicon nanowires for parametric single-pump mixing. For the first time, the effect of surface roughness-induced loss is included in the analysis, significantly influencing the optimum waveguide dimensions....

  13. Optimization of a neutron detector system for the fourier RTOF-diffractometer facility at the ETRR-1 reactor

    Energy Technology Data Exchange (ETDEWEB)

    Maayouf, R M.A.; El-Kady, A S.I.; El-Shaer, Y H [Reactor and Neutron physics Dept., NRC, Atomic Energy Authority, Cairo (Egypt)

    1997-12-31

    This work deals with optimization of a detector system for use with the fourier reverse time of flight (RTOF) diffractometer facility recently installed at the ETRR-1 reactor. The detector system of the diffractometer was designed for detecting neutrons scattered from the sample. It consists of 4 independent scintillation detector elements arranged according to the time focusing geometry in order to increase the luminosity of the diffractometer for the given resolution. Each of the detector elements is made of 1 mm thick {sup 6} Li-glass scintillator (NE-912) whose surface area is 200 mm{sup 2}. The present detector system ensures reliable identification and separation of thermal neutron pulses from fast neutrons and gamma- quanta. It was found from measurements with Fe sample that it is possible to make neutron diffraction measurement, within one hour using the present detector system and with resultion 0.5%. 6 FIGS.

  14. Global optimization framework for solar building design

    Science.gov (United States)

    Silva, N.; Alves, N.; Pascoal-Faria, P.

    2017-07-01

    The generative modeling paradigm is a shift from static models to flexible models. It describes a modeling process using functions, methods and operators. The result is an algorithmic description of the construction process. Each evaluation of such an algorithm creates a model instance, which depends on its input parameters (width, height, volume, roof angle, orientation, location). These values are normally chosen according to aesthetic aspects and style. In this study, the model's parameters are automatically generated according to an objective function. A generative model can be optimized according to its parameters, in this way, the best solution for a constrained problem is determined. Besides the establishment of an overall framework design, this work consists on the identification of different building shapes and their main parameters, the creation of an algorithmic description for these main shapes and the formulation of the objective function, respecting a building's energy consumption (solar energy, heating and insulation). Additionally, the conception of an optimization pipeline, combining an energy calculation tool with a geometric scripting engine is presented. The methods developed leads to an automated and optimized 3D shape generation for the projected building (based on the desired conditions and according to specific constrains). The approach proposed will help in the construction of real buildings that account for less energy consumption and for a more sustainable world.

  15. Optimizing human activity patterns using global sensitivity analysis.

    Science.gov (United States)

    Fairchild, Geoffrey; Hickmann, Kyle S; Mniszewski, Susan M; Del Valle, Sara Y; Hyman, James M

    2014-12-01

    Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule's regularity for a population. We show how to tune an activity's regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. We use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

  16. Fourier transform and particle swarm optimization based modified LQR algorithm for mitigation of vibrations using magnetorheological dampers

    Science.gov (United States)

    Kumar, Gaurav; Kumar, Ashok

    2017-11-01

    Structural control has gained significant attention in recent times. The standalone issue of power requirement during an earthquake has already been solved up to a large extent by designing semi-active control systems using conventional linear quadratic control theory, and many other intelligent control algorithms such as fuzzy controllers, artificial neural networks, etc. In conventional linear-quadratic regulator (LQR) theory, it is customary to note that the values of the design parameters are decided at the time of designing the controller and cannot be subsequently altered. During an earthquake event, the response of the structure may increase or decrease, depending the quasi-resonance occurring between the structure and the earthquake. In this case, it is essential to modify the value of the design parameters of the conventional LQR controller to obtain optimum control force to mitigate the vibrations due to the earthquake. A few studies have been done to sort out this issue but in all these studies it was necessary to maintain a database of the earthquake. To solve this problem and to find the optimized design parameters of the LQR controller in real time, a fast Fourier transform and particle swarm optimization based modified linear quadratic regulator method is presented here. This method comprises four different algorithms: particle swarm optimization (PSO), the fast Fourier transform (FFT), clipped control algorithm and the LQR. The FFT helps to obtain the dominant frequency for every time window. PSO finds the optimum gain matrix through the real-time update of the weighting matrix R, thereby, dispensing with the experimentation. The clipped control law is employed to match the magnetorheological (MR) damper force with the desired force given by the controller. The modified Bouc-Wen phenomenological model is taken to recognize the nonlinearities in the MR damper. The assessment of the advised method is done by simulation of a three-story structure

  17. Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

    Science.gov (United States)

    Ng, Hok Kwan; Sridhar, Banavar

    2016-01-01

    This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASAs Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a feasible approach for national and global air traffic system studies.

  18. Deterministic global optimization an introduction to the diagonal approach

    CERN Document Server

    Sergeyev, Yaroslav D

    2017-01-01

    This book begins with a concentrated introduction into deterministic global optimization and moves forward to present new original results from the authors who are well known experts in the field. Multiextremal continuous problems that have an unknown structure with Lipschitz objective functions and functions having the first Lipschitz derivatives defined over hyperintervals are examined. A class of algorithms using several Lipschitz constants is introduced which has its origins in the DIRECT (DIviding RECTangles) method. This new class is based on an efficient strategy that is applied for the search domain partitioning. In addition a survey on derivative free methods and methods using the first derivatives is given for both one-dimensional and multi-dimensional cases. Non-smooth and smooth minorants and acceleration techniques that can speed up several classes of global optimization methods with examples of applications and problems arising in numerical testing of global optimization algorithms are discussed...

  19. Application of surrogate-based global optimization to aerodynamic design

    CERN Document Server

    Pérez, Esther

    2016-01-01

    Aerodynamic design, like many other engineering applications, is increasingly relying on computational power. The growing need for multi-disciplinarity and high fidelity in design optimization for industrial applications requires a huge number of repeated simulations in order to find an optimal design candidate. The main drawback is that each simulation can be computationally expensive – this becomes an even bigger issue when used within parametric studies, automated search or optimization loops, which typically may require thousands of analysis evaluations. The core issue of a design-optimization problem is the search process involved. However, when facing complex problems, the high-dimensionality of the design space and the high-multi-modality of the target functions cannot be tackled with standard techniques. In recent years, global optimization using meta-models has been widely applied to design exploration in order to rapidly investigate the design space and find sub-optimal solutions. Indeed, surrogat...

  20. Global Optimization for Bus Line Timetable Setting Problem

    Directory of Open Access Journals (Sweden)

    Qun Chen

    2014-01-01

    Full Text Available This paper defines bus timetables setting problem during each time period divided in terms of passenger flow intensity; it is supposed that passengers evenly arrive and bus runs are set evenly; the problem is to determine bus runs assignment in each time period to minimize the total waiting time of passengers on platforms if the number of the total runs is known. For such a multistage decision problem, this paper designed a dynamic programming algorithm to solve it. Global optimization procedures using dynamic programming are developed. A numerical example about bus runs assignment optimization of a single line is given to demonstrate the efficiency of the proposed methodology, showing that optimizing buses’ departure time using dynamic programming can save computational time and find the global optimal solution.

  1. A dynamic global and local combined particle swarm optimization algorithm

    International Nuclear Information System (INIS)

    Jiao Bin; Lian Zhigang; Chen Qunxian

    2009-01-01

    Particle swarm optimization (PSO) algorithm has been developing rapidly and many results have been reported. PSO algorithm has shown some important advantages by providing high speed of convergence in specific problems, but it has a tendency to get stuck in a near optimal solution and one may find it difficult to improve solution accuracy by fine tuning. This paper presents a dynamic global and local combined particle swarm optimization (DGLCPSO) algorithm to improve the performance of original PSO, in which all particles dynamically share the best information of the local particle, global particle and group particles. It is tested with a set of eight benchmark functions with different dimensions and compared with original PSO. Experimental results indicate that the DGLCPSO algorithm improves the search performance on the benchmark functions significantly, and shows the effectiveness of the algorithm to solve optimization problems.

  2. Global-local optimization of flapping kinematics in hovering flight

    KAUST Repository

    Ghommem, Mehdi; Hajj, M. R.; Mook, Dean T.; Stanford, Bret K.; Bé ran, Philip S.; Watson, Layne T.

    2013-01-01

    The kinematics of a hovering wing are optimized by combining the 2-d unsteady vortex lattice method with a hybrid of global and local optimization algorithms. The objective is to minimize the required aerodynamic power under a lift constraint. The hybrid optimization is used to efficiently navigate the complex design space due to wing-wake interference present in hovering aerodynamics. The flapping wing is chosen so that its chord length and flapping frequency match the morphological and flight properties of two insects with different masses. The results suggest that imposing a delay between the different oscillatory motions defining the flapping kinematics, and controlling the way through which the wing rotates at the end of each half stroke can improve aerodynamic power under a lift constraint. Furthermore, our optimization analysis identified optimal kinematics that agree fairly well with observed insect kinematics, as well as previously published numerical results.

  3. Global-local optimization of flapping kinematics in hovering flight

    KAUST Repository

    Ghommem, Mehdi

    2013-06-01

    The kinematics of a hovering wing are optimized by combining the 2-d unsteady vortex lattice method with a hybrid of global and local optimization algorithms. The objective is to minimize the required aerodynamic power under a lift constraint. The hybrid optimization is used to efficiently navigate the complex design space due to wing-wake interference present in hovering aerodynamics. The flapping wing is chosen so that its chord length and flapping frequency match the morphological and flight properties of two insects with different masses. The results suggest that imposing a delay between the different oscillatory motions defining the flapping kinematics, and controlling the way through which the wing rotates at the end of each half stroke can improve aerodynamic power under a lift constraint. Furthermore, our optimization analysis identified optimal kinematics that agree fairly well with observed insect kinematics, as well as previously published numerical results.

  4. Dispositional Optimism and Terminal Decline in Global Quality of Life

    Science.gov (United States)

    Zaslavsky, Oleg; Palgi, Yuval; Rillamas-Sun, Eileen; LaCroix, Andrea Z.; Schnall, Eliezer; Woods, Nancy F.; Cochrane, Barbara B.; Garcia, Lorena; Hingle, Melanie; Post, Stephen; Seguin, Rebecca; Tindle, Hilary; Shrira, Amit

    2015-01-01

    We examined whether dispositional optimism relates to change in global quality of life (QOL) as a function of either chronological age or years to impending death. We used a sample of 2,096 deceased postmenopausal women from the Women's Health Initiative clinical trials who were enrolled in the 2005-2010 Extension Study and for whom at least 1…

  5. Global Optimization of Nonlinear Blend-Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Pedro A. Castillo Castillo

    2017-04-01

    Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.

  6. Global Optimization Based on the Hybridization of Harmony Search and Particle Swarm Optimization Methods

    Directory of Open Access Journals (Sweden)

    A. P. Karpenko

    2014-01-01

    Full Text Available We consider a class of stochastic search algorithms of global optimization which in various publications are called behavioural, intellectual, metaheuristic, inspired by the nature, swarm, multi-agent, population, etc. We use the last term.Experience in using the population algorithms to solve challenges of global optimization shows that application of one such algorithm may not always effective. Therefore now great attention is paid to hybridization of population algorithms of global optimization. Hybrid algorithms unite various algorithms or identical algorithms, but with various values of free parameters. Thus efficiency of one algorithm can compensate weakness of another.The purposes of the work are development of hybrid algorithm of global optimization based on known algorithms of harmony search (HS and swarm of particles (PSO, software implementation of algorithm, study of its efficiency using a number of known benchmark problems, and a problem of dimensional optimization of truss structure.We set a problem of global optimization, consider basic algorithms of HS and PSO, give a flow chart of the offered hybrid algorithm called PSO HS , present results of computing experiments with developed algorithm and software, formulate main results of work and prospects of its development.

  7. Global Sufficient Optimality Conditions for a Special Cubic Minimization Problem

    Directory of Open Access Journals (Sweden)

    Xiaomei Zhang

    2012-01-01

    Full Text Available We present some sufficient global optimality conditions for a special cubic minimization problem with box constraints or binary constraints by extending the global subdifferential approach proposed by V. Jeyakumar et al. (2006. The present conditions generalize the results developed in the work of V. Jeyakumar et al. where a quadratic minimization problem with box constraints or binary constraints was considered. In addition, a special diagonal matrix is constructed, which is used to provide a convenient method for justifying the proposed sufficient conditions. Then, the reformulation of the sufficient conditions follows. It is worth noting that this reformulation is also applicable to the quadratic minimization problem with box or binary constraints considered in the works of V. Jeyakumar et al. (2006 and Y. Wang et al. (2010. Finally some examples demonstrate that our optimality conditions can effectively be used for identifying global minimizers of the certain nonconvex cubic minimization problem.

  8. Neoliberal Optimism: Applying Market Techniques to Global Health.

    Science.gov (United States)

    Mei, Yuyang

    2017-01-01

    Global health and neoliberalism are becoming increasingly intertwined as organizations utilize markets and profit motives to solve the traditional problems of poverty and population health. I use field work conducted over 14 months in a global health technology company to explore how the promise of neoliberalism re-envisions humanitarian efforts. In this company's vaccine refrigerator project, staff members expect their investors and their market to allow them to achieve scale and develop accountability to their users in developing countries. However, the translation of neoliberal techniques to the global health sphere falls short of the ideal, as profits are meager and purchasing power remains with donor organizations. The continued optimism in market principles amidst such a non-ideal market reveals the tenacious ideological commitment to neoliberalism in these global health projects.

  9. Solving Unconstrained Global Optimization Problems via Hybrid Swarm Intelligence Approaches

    Directory of Open Access Journals (Sweden)

    Jui-Yu Wu

    2013-01-01

    Full Text Available Stochastic global optimization (SGO algorithms such as the particle swarm optimization (PSO approach have become popular for solving unconstrained global optimization (UGO problems. The PSO approach, which belongs to the swarm intelligence domain, does not require gradient information, enabling it to overcome this limitation of traditional nonlinear programming methods. Unfortunately, PSO algorithm implementation and performance depend on several parameters, such as cognitive parameter, social parameter, and constriction coefficient. These parameters are tuned by using trial and error. To reduce the parametrization of a PSO method, this work presents two efficient hybrid SGO approaches, namely, a real-coded genetic algorithm-based PSO (RGA-PSO method and an artificial immune algorithm-based PSO (AIA-PSO method. The specific parameters of the internal PSO algorithm are optimized using the external RGA and AIA approaches, and then the internal PSO algorithm is applied to solve UGO problems. The performances of the proposed RGA-PSO and AIA-PSO algorithms are then evaluated using a set of benchmark UGO problems. Numerical results indicate that, besides their ability to converge to a global minimum for each test UGO problem, the proposed RGA-PSO and AIA-PSO algorithms outperform many hybrid SGO algorithms. Thus, the RGA-PSO and AIA-PSO approaches can be considered alternative SGO approaches for solving standard-dimensional UGO problems.

  10. An Optimal Method for Developing Global Supply Chain Management System

    Directory of Open Access Journals (Sweden)

    Hao-Chun Lu

    2013-01-01

    Full Text Available Owing to the transparency in supply chains, enhancing competitiveness of industries becomes a vital factor. Therefore, many developing countries look for a possible method to save costs. In this point of view, this study deals with the complicated liberalization policies in the global supply chain management system and proposes a mathematical model via the flow-control constraints, which are utilized to cope with the bonded warehouses for obtaining maximal profits. Numerical experiments illustrate that the proposed model can be effectively solved to obtain the optimal profits in the global supply chain environment.

  11. GLOBAL OPTIMIZATION METHODS FOR GRAVITATIONAL LENS SYSTEMS WITH REGULARIZED SOURCES

    International Nuclear Information System (INIS)

    Rogers, Adam; Fiege, Jason D.

    2012-01-01

    Several approaches exist to model gravitational lens systems. In this study, we apply global optimization methods to find the optimal set of lens parameters using a genetic algorithm. We treat the full optimization procedure as a two-step process: an analytical description of the source plane intensity distribution is used to find an initial approximation to the optimal lens parameters; the second stage of the optimization uses a pixelated source plane with the semilinear method to determine an optimal source. Regularization is handled by means of an iterative method and the generalized cross validation (GCV) and unbiased predictive risk estimator (UPRE) functions that are commonly used in standard image deconvolution problems. This approach simultaneously estimates the optimal regularization parameter and the number of degrees of freedom in the source. Using the GCV and UPRE functions, we are able to justify an estimation of the number of source degrees of freedom found in previous work. We test our approach by applying our code to a subset of the lens systems included in the SLACS survey.

  12. Global Optimization of Minority Game by Smart Agents

    OpenAIRE

    Yan-Bo Xie; Bing-Hong Wang; Chin-Kun Hu; Tao Zhou

    2004-01-01

    We propose a new model of minority game with so-called smart agents such that the standard deviation and the total loss in this model reach the theoretical minimum values in the limit of long time. The smart agents use trail and error method to make a choice but bring global optimization to the system, which suggests that the economic systems may have the ability to self-organize into a highly optimized state by agents who are forced to make decisions based on inductive thinking for their lim...

  13. External Second Gate, Fourier Transform Ion Mobility Spectrometry: Parametric Optimization for Detection of Weapons of Mass Destruction

    Directory of Open Access Journals (Sweden)

    Edward E. Tarver

    2004-03-01

    Full Text Available Abstract: Ion mobility spectrometry (IMS is recognized as one of the most sensitive and robust techniques for the detection of narcotics, explosives and chemical warfare agents. IMS is widely used in forensic, military and security applications. Increasing threat of terrorist attacks, the proliferation of narcotics, Chemical Weapons Convention (CWC treaty verification as well as humanitarian de-mining efforts have mandated that equal importance be placed on the time required to obtain results as well as the quality of the analytical data. [1] In this regard IMS is virtually unrivaled when both speed of response and sensitivity have to be considered. [2] The problem with conventional (signal averaging IMS systems is the fixed duty cycle of the entrance gate that restricts to less than 1%, the number of available ions contributing to the measured signal. Furthermore, the signal averaging process incorporates scan-to-scan variations that degrade the spectral resolution contributing to misidentifications and false positives. With external second gate, Fourier Transform ion mobility spectrometry (FT-IMS the entrance gate frequency is variable and can be altered in conjunction with other data acquisition parameters (scan time and sampling rate to increase the spectral resolution to reduce false alarms and improve the sensitivity for early warning and contamination avoidance. In addition, with FT-IMS the entrance gate operates with a 50% duty cycle and so affords a seven-fold increase in sensitivity. Recent data on high explosives are presented to demonstrate the parametric optimization in sensitivity and resolution of our system.

  14. Fourier series

    CERN Document Server

    Tolstov, Georgi P

    1962-01-01

    Richard A. Silverman's series of translations of outstanding Russian textbooks and monographs is well-known to people in the fields of mathematics, physics, and engineering. The present book is another excellent text from this series, a valuable addition to the English-language literature on Fourier series.This edition is organized into nine well-defined chapters: Trigonometric Fourier Series, Orthogonal Systems, Convergence of Trigonometric Fourier Series, Trigonometric Series with Decreasing Coefficients, Operations on Fourier Series, Summation of Trigonometric Fourier Series, Double Fourie

  15. An Algorithm for Global Optimization Inspired by Collective Animal Behavior

    Directory of Open Access Journals (Sweden)

    Erik Cuevas

    2012-01-01

    Full Text Available A metaheuristic algorithm for global optimization called the collective animal behavior (CAB is introduced. Animal groups, such as schools of fish, flocks of birds, swarms of locusts, and herds of wildebeest, exhibit a variety of behaviors including swarming about a food source, milling around a central locations, or migrating over large distances in aligned groups. These collective behaviors are often advantageous to groups, allowing them to increase their harvesting efficiency, to follow better migration routes, to improve their aerodynamic, and to avoid predation. In the proposed algorithm, the searcher agents emulate a group of animals which interact with each other based on the biological laws of collective motion. The proposed method has been compared to other well-known optimization algorithms. The results show good performance of the proposed method when searching for a global optimum of several benchmark functions.

  16. A Globally Convergent Parallel SSLE Algorithm for Inequality Constrained Optimization

    Directory of Open Access Journals (Sweden)

    Zhijun Luo

    2014-01-01

    Full Text Available A new parallel variable distribution algorithm based on interior point SSLE algorithm is proposed for solving inequality constrained optimization problems under the condition that the constraints are block-separable by the technology of sequential system of linear equation. Each iteration of this algorithm only needs to solve three systems of linear equations with the same coefficient matrix to obtain the descent direction. Furthermore, under certain conditions, the global convergence is achieved.

  17. Optimal design of RTCs in digital circuit fault self-repair based on global signal optimization

    Institute of Scientific and Technical Information of China (English)

    Zhang Junbin; Cai Jinyan; Meng Yafeng

    2016-01-01

    Since digital circuits have been widely and thoroughly applied in various fields, electronic systems are increasingly more complicated and require greater reliability. Faults may occur in elec-tronic systems in complicated environments. If immediate field repairs are not made on the faults, elec-tronic systems will not run normally, and this will lead to serious losses. The traditional method for improving system reliability based on redundant fault-tolerant technique has been unable to meet the requirements. Therefore, on the basis of (evolvable hardware)-based and (reparation balance technology)-based electronic circuit fault self-repair strategy proposed in our preliminary work, the optimal design of rectification circuits (RTCs) in electronic circuit fault self-repair based on global sig-nal optimization is deeply researched in this paper. First of all, the basic theory of RTC optimal design based on global signal optimization is proposed. Secondly, relevant considerations and suitable ranges are analyzed. Then, the basic flow of RTC optimal design is researched. Eventually, a typical circuit is selected for simulation verification, and detailed simulated analysis is made on five circumstances that occur during RTC evolution. The simulation results prove that compared with the conventional design method based RTC, the global signal optimization design method based RTC is lower in hardware cost, faster in circuit evolution, higher in convergent precision, and higher in circuit evolution success rate. Therefore, the global signal optimization based RTC optimal design method applied in the elec-tronic circuit fault self-repair technology is proven to be feasible, effective, and advantageous.

  18. Optimal convergence recovery for the Fourier-finite-element approximation of Maxwell's equations in non-smooth axisymmetric domains

    International Nuclear Information System (INIS)

    Nkemzi, B.

    2005-10-01

    Three-dimensional time-harmonic Maxwell's problems in axisymmetric domains Ω-circumflex with edges and conical points on the boundary are treated by means of the Fourier-finite-element method. The Fourier-fem combines the approximating Fourier series expansion of the solution with respect to the rotational angle using trigonometric polynomials of degree N (N → ∞), with the finite element approximation of the Fourier coefficients on the plane meridian domain Ω a is a subset of R + 2 of Ω-circumflex with mesh size h (h → 0). The singular behaviors of the Fourier coefficients near angular points of the domain Ω a are fully described by suitable singular functions and treated numerically by means of the singular function method with the finite element method on graded meshes. It is proved that the rate of convergence of the mixed approximations in H 1 (Ω-circumflex) 3 is of the order O (h+N -1 ) as known for the classical Fourier-finite-element approximation of problems with regular solutions. (author)

  19. Proposal of Evolutionary Simplex Method for Global Optimization Problem

    Science.gov (United States)

    Shimizu, Yoshiaki

    To make an agile decision in a rational manner, role of optimization engineering has been notified increasingly under diversified customer demand. With this point of view, in this paper, we have proposed a new evolutionary method serving as an optimization technique in the paradigm of optimization engineering. The developed method has prospects to solve globally various complicated problem appearing in real world applications. It is evolved from the conventional method known as Nelder and Mead’s Simplex method by virtue of idea borrowed from recent meta-heuristic method such as PSO. Mentioning an algorithm to handle linear inequality constraints effectively, we have validated effectiveness of the proposed method through comparison with other methods using several benchmark problems.

  20. Globally optimal superconducting magnets part II: symmetric MSE coil arrangement.

    Science.gov (United States)

    Tieng, Quang M; Vegh, Viktor; Brereton, Ian M

    2009-01-01

    A globally optimal superconducting magnet coil design procedure based on the Minimum Stored Energy (MSE) current density map is outlined. The method has the ability to arrange coils in a manner that generates a strong and homogeneous axial magnetic field over a predefined region, and ensures the stray field external to the assembly and peak magnetic field at the wires are in acceptable ranges. The outlined strategy of allocating coils within a given domain suggests that coils should be placed around the perimeter of the domain with adjacent coils possessing alternating winding directions for optimum performance. The underlying current density maps from which the coils themselves are derived are unique, and optimized to possess minimal stored energy. Therefore, the method produces magnet designs with the lowest possible overall stored energy. Optimal coil layouts are provided for unshielded and shielded short bore symmetric superconducting magnets.

  1. Global optimization for quantum dynamics of few-fermion systems

    Science.gov (United States)

    Li, Xikun; Pecak, Daniel; Sowiński, Tomasz; Sherson, Jacob; Nielsen, Anne E. B.

    2018-03-01

    Quantum state preparation is vital to quantum computation and quantum information processing tasks. In adiabatic state preparation, the target state is theoretically obtained with nearly perfect fidelity if the control parameter is tuned slowly enough. As this, however, leads to slow dynamics, it is often desirable to be able to carry out processes more rapidly. In this work, we employ two global optimization methods to estimate the quantum speed limit for few-fermion systems confined in a one-dimensional harmonic trap. Such systems can be produced experimentally in a well-controlled manner. We determine the optimized control fields and achieve a reduction in the ramping time of more than a factor of four compared to linear ramping. We also investigate how robust the fidelity is to small variations of the control fields away from the optimized shapes.

  2. Deconvolution, differentiation and Fourier transformation algorithms for noise-containing data based on splines and global approximation

    NARCIS (Netherlands)

    Wormeester, Herbert; Sasse, A.G.B.M.; van Silfhout, Arend

    1988-01-01

    One of the main problems in the analysis of measured spectra is how to reduce the influence of noise in data processing. We show a deconvolution, a differentiation and a Fourier Transform algorithm that can be run on a small computer (64 K RAM) and suffer less from noise than commonly used routines.

  3. Global structural optimizations of surface systems with a genetic algorithm

    International Nuclear Information System (INIS)

    Chuang, Feng-Chuan

    2005-01-01

    Global structural optimizations with a genetic algorithm were performed for atomic cluster and surface systems including aluminum atomic clusters, Si magic clusters on the Si(111) 7 x 7 surface, silicon high-index surfaces, and Ag-induced Si(111) reconstructions. First, the global structural optimizations of neutral aluminum clusters Al n (n up to 23) were performed using a genetic algorithm coupled with a tight-binding potential. Second, a genetic algorithm in combination with tight-binding and first-principles calculations were performed to study the structures of magic clusters on the Si(111) 7 x 7 surface. Extensive calculations show that the magic cluster observed in scanning tunneling microscopy (STM) experiments consist of eight Si atoms. Simulated STM images of the Si magic cluster exhibit a ring-like feature similar to STM experiments. Third, a genetic algorithm coupled with a highly optimized empirical potential were used to determine the lowest energy structure of high-index semiconductor surfaces. The lowest energy structures of Si(105) and Si(114) were determined successfully. The results of Si(105) and Si(114) are reported within the framework of highly optimized empirical potential and first-principles calculations. Finally, a genetic algorithm coupled with Si and Ag tight-binding potentials were used to search for Ag-induced Si(111) reconstructions at various Ag and Si coverages. The optimized structural models of √3 x √3, 3 x 1, and 5 x 2 phases were reported using first-principles calculations. A novel model is found to have lower surface energy than the proposed double-honeycomb chained (DHC) model both for Au/Si(111) 5 x 2 and Ag/Si(111) 5 x 2 systems

  4. Globally convergent optimization algorithm using conservative convex separable diagonal quadratic approximations

    NARCIS (Netherlands)

    Groenwold, A.A.; Wood, D.W.; Etman, L.F.P.; Tosserams, S.

    2009-01-01

    We implement and test a globally convergent sequential approximate optimization algorithm based on (convexified) diagonal quadratic approximations. The algorithm resides in the class of globally convergent optimization methods based on conservative convex separable approximations developed by

  5. A Novel Hybrid Firefly Algorithm for Global Optimization.

    Directory of Open Access Journals (Sweden)

    Lina Zhang

    Full Text Available Global optimization is challenging to solve due to its nonlinearity and multimodality. Traditional algorithms such as the gradient-based methods often struggle to deal with such problems and one of the current trends is to use metaheuristic algorithms. In this paper, a novel hybrid population-based global optimization algorithm, called hybrid firefly algorithm (HFA, is proposed by combining the advantages of both the firefly algorithm (FA and differential evolution (DE. FA and DE are executed in parallel to promote information sharing among the population and thus enhance searching efficiency. In order to evaluate the performance and efficiency of the proposed algorithm, a diverse set of selected benchmark functions are employed and these functions fall into two groups: unimodal and multimodal. The experimental results show better performance of the proposed algorithm compared to the original version of the firefly algorithm (FA, differential evolution (DE and particle swarm optimization (PSO in the sense of avoiding local minima and increasing the convergence rate.

  6. A Global Network Alignment Method Using Discrete Particle Swarm Optimization.

    Science.gov (United States)

    Huang, Jiaxiang; Gong, Maoguo; Ma, Lijia

    2016-10-19

    Molecular interactions data increase exponentially with the advance of biotechnology. This makes it possible and necessary to comparatively analyse the different data at a network level. Global network alignment is an important network comparison approach to identify conserved subnetworks and get insight into evolutionary relationship across species. Network alignment which is analogous to subgraph isomorphism is known to be an NP-hard problem. In this paper, we introduce a novel heuristic Particle-Swarm-Optimization based Network Aligner (PSONA), which optimizes a weighted global alignment model considering both protein sequence similarity and interaction conservations. The particle statuses and status updating rules are redefined in a discrete form by using permutation. A seed-and-extend strategy is employed to guide the searching for the superior alignment. The proposed initialization method "seeds" matches with high sequence similarity into the alignment, which guarantees the functional coherence of the mapping nodes. A greedy local search method is designed as the "extension" procedure to iteratively optimize the edge conservations. PSONA is compared with several state-of-art methods on ten network pairs combined by five species. The experimental results demonstrate that the proposed aligner can map the proteins with high functional coherence and can be used as a booster to effectively refine the well-studied aligners.

  7. Joint global optimization of tomographic data based on particle swarm optimization and decision theory

    Science.gov (United States)

    Paasche, H.; Tronicke, J.

    2012-04-01

    In many near surface geophysical applications multiple tomographic data sets are routinely acquired to explore subsurface structures and parameters. Linking the model generation process of multi-method geophysical data sets can significantly reduce ambiguities in geophysical data analysis and model interpretation. Most geophysical inversion approaches rely on local search optimization methods used to find an optimal model in the vicinity of a user-given starting model. The final solution may critically depend on the initial model. Alternatively, global optimization (GO) methods have been used to invert geophysical data. They explore the solution space in more detail and determine the optimal model independently from the starting model. Additionally, they can be used to find sets of optimal models allowing a further analysis of model parameter uncertainties. Here we employ particle swarm optimization (PSO) to realize the global optimization of tomographic data. PSO is an emergent methods based on swarm intelligence characterized by fast and robust convergence towards optimal solutions. The fundamental principle of PSO is inspired by nature, since the algorithm mimics the behavior of a flock of birds searching food in a search space. In PSO, a number of particles cruise a multi-dimensional solution space striving to find optimal model solutions explaining the acquired data. The particles communicate their positions and success and direct their movement according to the position of the currently most successful particle of the swarm. The success of a particle, i.e. the quality of the currently found model by a particle, must be uniquely quantifiable to identify the swarm leader. When jointly inverting disparate data sets, the optimization solution has to satisfy multiple optimization objectives, at least one for each data set. Unique determination of the most successful particle currently leading the swarm is not possible. Instead, only statements about the Pareto

  8. A New Hybrid Whale Optimizer Algorithm with Mean Strategy of Grey Wolf Optimizer for Global Optimization

    Directory of Open Access Journals (Sweden)

    Narinder Singh

    2018-03-01

    Full Text Available The quest for an efficient nature-inspired optimization technique has continued over the last few decades. In this paper, a hybrid nature-inspired optimization technique has been proposed. The hybrid algorithm has been constructed using Mean Grey Wolf Optimizer (MGWO and Whale Optimizer Algorithm (WOA. We have utilized the spiral equation of Whale Optimizer Algorithm for two procedures in the Hybrid Approach GWO (HAGWO algorithm: (i firstly, we used the spiral equation in Grey Wolf Optimizer algorithm for balance between the exploitation and the exploration process in the new hybrid approach; and (ii secondly, we also applied this equation in the whole population in order to refrain from the premature convergence and trapping in local minima. The feasibility and effectiveness of the hybrid algorithm have been tested by solving some standard benchmarks, XOR, Baloon, Iris, Breast Cancer, Welded Beam Design, Pressure Vessel Design problems and comparing the results with those obtained through other metaheuristics. The solutions prove that the newly existing hybrid variant has higher stronger stability, faster convergence rate and computational accuracy than other nature-inspired metaheuristics on the maximum number of problems and can successfully resolve the function of constrained nonlinear optimization in reality.

  9. Global optimization of minority game by intelligent agents

    Science.gov (United States)

    Xie, Yan-Bo; Wang, Bing-Hong; Hu, Chin-Kun; Zhou, Tao

    2005-10-01

    We propose a new model of minority game with intelligent agents who use trail and error method to make a choice such that the standard deviation σ2 and the total loss in this model reach the theoretical minimum values in the long time limit and the global optimization of the system is reached. This suggests that the economic systems can self-organize into a highly optimized state by agents who make decisions based on inductive thinking, limited knowledge, and capabilities. When other kinds of agents are also present, the simulation results and analytic calculations show that the intelligent agent can gain profits from producers and are much more competent than the noise traders and conventional agents in original minority games proposed by Challet and Zhang.

  10. An Adaptive Unified Differential Evolution Algorithm for Global Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Qiang, Ji; Mitchell, Chad

    2014-11-03

    In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.

  11. Global optimization in the adaptive assay of subterranean uranium nodules

    International Nuclear Information System (INIS)

    Vulkan, U.; Ben-Haim, Y.

    1989-01-01

    An adaptive assay is one in which the design of the assay system is modified during operation in response to measurements obtained on-line. The present work has two aims: to design an adaptive system for borehole assay of isolated subterranean uranium nodules, and to investigate globality of optimal design in adaptive assay. It is shown experimentally that reasonably accurate estimates of uranium mass are obtained for a wide range of nodule shapes, on the basis of an adaptive assay system based on a simple geomorphological model. Furthermore, two concepts are identified which underlie the optimal design of the assay system. The adaptive assay approach shows promise for successful measurement of spatially random material in many geophysical applications. (author)

  12. A concept for global optimization of topology design problems

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Achtziger, Wolfgang; Kawamoto, Atsushi

    2006-01-01

    We present a concept for solving topology design problems to proven global optimality. We propose that the problems are modeled using the approach of simultaneous analysis and design with discrete design variables and solved with convergent branch and bound type methods. This concept is illustrated...... on two applications. The first application is the design of stiff truss structures where the bar areas are chosen from a finite set of available areas. The second considered application is simultaneous topology and geometry design of planar articulated mechanisms. For each application we outline...

  13. A Unified Differential Evolution Algorithm for Global Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Qiang, Ji; Mitchell, Chad

    2014-06-24

    Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.

  14. Simulated Annealing-Based Krill Herd Algorithm for Global Optimization

    Directory of Open Access Journals (Sweden)

    Gai-Ge Wang

    2013-01-01

    Full Text Available Recently, Gandomi and Alavi proposed a novel swarm intelligent method, called krill herd (KH, for global optimization. To enhance the performance of the KH method, in this paper, a new improved meta-heuristic simulated annealing-based krill herd (SKH method is proposed for optimization tasks. A new krill selecting (KS operator is used to refine krill behavior when updating krill’s position so as to enhance its reliability and robustness dealing with optimization problems. The introduced KS operator involves greedy strategy and accepting few not-so-good solutions with a low probability originally used in simulated annealing (SA. In addition, a kind of elitism scheme is used to save the best individuals in the population in the process of the krill updating. The merits of these improvements are verified by fourteen standard benchmarking functions and experimental results show that, in most cases, the performance of this improved meta-heuristic SKH method is superior to, or at least highly competitive with, the standard KH and other optimization methods.

  15. A Novel Consensus-Based Particle Swarm Optimization-Assisted Trust-Tech Methodology for Large-Scale Global Optimization.

    Science.gov (United States)

    Zhang, Yong-Feng; Chiang, Hsiao-Dong

    2017-09-01

    A novel three-stage methodology, termed the "consensus-based particle swarm optimization (PSO)-assisted Trust-Tech methodology," to find global optimal solutions for nonlinear optimization problems is presented. It is composed of Trust-Tech methods, consensus-based PSO, and local optimization methods that are integrated to compute a set of high-quality local optimal solutions that can contain the global optimal solution. The proposed methodology compares very favorably with several recently developed PSO algorithms based on a set of small-dimension benchmark optimization problems and 20 large-dimension test functions from the CEC 2010 competition. The analytical basis for the proposed methodology is also provided. Experimental results demonstrate that the proposed methodology can rapidly obtain high-quality optimal solutions that can contain the global optimal solution. The scalability of the proposed methodology is promising.

  16. Identification of metabolic system parameters using global optimization methods

    Directory of Open Access Journals (Sweden)

    Gatzke Edward P

    2006-01-01

    Full Text Available Abstract Background The problem of estimating the parameters of dynamic models of complex biological systems from time series data is becoming increasingly important. Methods and results Particular consideration is given to metabolic systems that are formulated as Generalized Mass Action (GMA models. The estimation problem is posed as a global optimization task, for which novel techniques can be applied to determine the best set of parameter values given the measured responses of the biological system. The challenge is that this task is nonconvex. Nonetheless, deterministic optimization techniques can be used to find a global solution that best reconciles the model parameters and measurements. Specifically, the paper employs branch-and-bound principles to identify the best set of model parameters from observed time course data and illustrates this method with an existing model of the fermentation pathway in Saccharomyces cerevisiae. This is a relatively simple yet representative system with five dependent states and a total of 19 unknown parameters of which the values are to be determined. Conclusion The efficacy of the branch-and-reduce algorithm is illustrated by the S. cerevisiae example. The method described in this paper is likely to be widely applicable in the dynamic modeling of metabolic networks.

  17. GMG: A Guaranteed, Efficient Global Optimization Algorithm for Remote Sensing.

    Energy Technology Data Exchange (ETDEWEB)

    D' Helon, CD

    2004-08-18

    The monocular passive ranging (MPR) problem in remote sensing consists of identifying the precise range of an airborne target (missile, plane, etc.) from its observed radiance. This inverse problem may be set as a global optimization problem (GOP) whereby the difference between the observed and model predicted radiances is minimized over the possible ranges and atmospheric conditions. Using additional information about the error function between the predicted and observed radiances of the target, we developed GMG, a new algorithm to find the Global Minimum with a Guarantee. The new algorithm transforms the original continuous GOP into a discrete search problem, thereby guaranteeing to find the position of the global minimum in a reasonably short time. The algorithm is first applied to the golf course problem, which serves as a litmus test for its performance in the presence of both complete and degraded additional information. GMG is further assessed on a set of standard benchmark functions and then applied to various realizations of the MPR problem.

  18. Spatiotemporal radiotherapy planning using a global optimization approach

    Science.gov (United States)

    Adibi, Ali; Salari, Ehsan

    2018-02-01

    This paper aims at quantifying the extent of potential therapeutic gain, measured using biologically effective dose (BED), that can be achieved by altering the radiation dose distribution over treatment sessions in fractionated radiotherapy. To that end, a spatiotemporally integrated planning approach is developed, where the spatial and temporal dose modulations are optimized simultaneously. The concept of equivalent uniform BED (EUBED) is used to quantify and compare the clinical quality of spatiotemporally heterogeneous dose distributions in target and critical structures. This gives rise to a large-scale non-convex treatment-plan optimization problem, which is solved using global optimization techniques. The proposed spatiotemporal planning approach is tested on two stylized cancer cases resembling two different tumor sites and sensitivity analysis is performed for radio-biological and EUBED parameters. Numerical results validate that spatiotemporal plans are capable of delivering a larger BED to the target volume without increasing the BED in critical structures compared to conventional time-invariant plans. In particular, this additional gain is attributed to the irradiation of different regions of the target volume at different treatment sessions. Additionally, the trade-off between the potential therapeutic gain and the number of distinct dose distributions is quantified, which suggests a diminishing marginal gain as the number of dose distributions increases.

  19. Optimal correction and design parameter search by modern methods of rigorous global optimization

    International Nuclear Information System (INIS)

    Makino, K.; Berz, M.

    2011-01-01

    Frequently the design of schemes for correction of aberrations or the determination of possible operating ranges for beamlines and cells in synchrotrons exhibit multitudes of possibilities for their correction, usually appearing in disconnected regions of parameter space which cannot be directly qualified by analytical means. In such cases, frequently an abundance of optimization runs are carried out, each of which determines a local minimum depending on the specific chosen initial conditions. Practical solutions are then obtained through an often extended interplay of experienced manual adjustment of certain suitable parameters and local searches by varying other parameters. However, in a formal sense this problem can be viewed as a global optimization problem, i.e. the determination of all solutions within a certain range of parameters that lead to a specific optimum. For example, it may be of interest to find all possible settings of multiple quadrupoles that can achieve imaging; or to find ahead of time all possible settings that achieve a particular tune; or to find all possible manners to adjust nonlinear parameters to achieve correction of high order aberrations. These tasks can easily be phrased in terms of such an optimization problem; but while mathematically this formulation is often straightforward, it has been common belief that it is of limited practical value since the resulting optimization problem cannot usually be solved. However, recent significant advances in modern methods of rigorous global optimization make these methods feasible for optics design for the first time. The key ideas of the method lie in an interplay of rigorous local underestimators of the objective functions, and by using the underestimators to rigorously iteratively eliminate regions that lie above already known upper bounds of the minima, in what is commonly known as a branch-and-bound approach. Recent enhancements of the Differential Algebraic methods used in particle

  20. Truss topology optimization with discrete design variables — Guaranteed global optimality and benchmark examples

    DEFF Research Database (Denmark)

    Achtziger, Wolfgang; Stolpe, Mathias

    2007-01-01

    this problem is well-studied for continuous bar areas, we consider in this study the case of discrete areas. This problem is of major practical relevance if the truss must be built from pre-produced bars with given areas. As a special case, we consider the design problem for a single available bar area, i.......e., a 0/1 problem. In contrast to the heuristic methods considered in many other approaches, our goal is to compute guaranteed globally optimal structures. This is done by a branch-and-bound method for which convergence can be proven. In this branch-and-bound framework, lower bounds of the optimal......-integer problems. The main intention of this paper is to provide optimal solutions for single and multiple load benchmark examples, which can be used for testing and validating other methods or heuristics for the treatment of this discrete topology design problem....

  1. Implementation and verification of global optimization benchmark problems

    Science.gov (United States)

    Posypkin, Mikhail; Usov, Alexander

    2017-12-01

    The paper considers the implementation and verification of a test suite containing 150 benchmarks for global deterministic box-constrained optimization. A C++ library for describing standard mathematical expressions was developed for this purpose. The library automate the process of generating the value of a function and its' gradient at a given point and the interval estimates of a function and its' gradient on a given box using a single description. Based on this functionality, we have developed a collection of tests for an automatic verification of the proposed benchmarks. The verification has shown that literary sources contain mistakes in the benchmarks description. The library and the test suite are available for download and can be used freely.

  2. Global optimization applied to GPS positioning by ambiguity functions

    International Nuclear Information System (INIS)

    Baselga, Sergio

    2010-01-01

    Differential GPS positioning with carrier-phase observables is commonly done in a process that involves determination of the unknown integer ambiguity values. An alternative approach, named the ambiguity function method, was already proposed in the early days of GPS positioning. By making use of a trigonometric function ambiguity unknowns are eliminated from the functional model before the estimation process. This approach has significant advantages, such as ease of use and insensitivity to cycle slips, but requires such high accuracy in the initial approximate coordinates that its use has been practically dismissed from consideration. In this paper a novel strategy is proposed so that the need for highly accurate initial coordinates disappears: the application of a global optimization method to the ambiguity functions model. The use of this strategy enables the ambiguity function method to compete with the present prevailing approach of ambiguity resolution

  3. Global optimization numerical strategies for rate-independent processes

    Czech Academy of Sciences Publication Activity Database

    Benešová, Barbora

    2011-01-01

    Roč. 50, č. 2 (2011), s. 197-220 ISSN 0925-5001 R&D Projects: GA ČR GAP201/10/0357 Grant - others:GA MŠk(CZ) LC06052 Program:LC Institutional research plan: CEZ:AV0Z20760514 Keywords : rate-independent processes * numerical global optimization * energy estimates based algorithm Subject RIV: BA - General Mathematics Impact factor: 1.196, year: 2011 http://math.hnue.edu.vn/portal/rss.viewpage.php?id=0000037780&ap=L3BvcnRhbC9ncmFiYmVyLnBocD9jYXRpZD0xMDEyJnBhZ2U9Mg==

  4. Implementation and verification of global optimization benchmark problems

    Directory of Open Access Journals (Sweden)

    Posypkin Mikhail

    2017-12-01

    Full Text Available The paper considers the implementation and verification of a test suite containing 150 benchmarks for global deterministic box-constrained optimization. A C++ library for describing standard mathematical expressions was developed for this purpose. The library automate the process of generating the value of a function and its’ gradient at a given point and the interval estimates of a function and its’ gradient on a given box using a single description. Based on this functionality, we have developed a collection of tests for an automatic verification of the proposed benchmarks. The verification has shown that literary sources contain mistakes in the benchmarks description. The library and the test suite are available for download and can be used freely.

  5. Adjusting process count on demand for petascale global optimization

    KAUST Repository

    Sosonkina, Masha; Watson, Layne T.; Radcliffe, Nicholas R.; Haftka, Rafael T.; Trosset, Michael W.

    2013-01-01

    There are many challenges that need to be met before efficient and reliable computation at the petascale is possible. Many scientific and engineering codes running at the petascale are likely to be memory intensive, which makes thrashing a serious problem for many petascale applications. One way to overcome this challenge is to use a dynamic number of processes, so that the total amount of memory available for the computation can be increased on demand. This paper describes modifications made to the massively parallel global optimization code pVTdirect in order to allow for a dynamic number of processes. In particular, the modified version of the code monitors memory use and spawns new processes if the amount of available memory is determined to be insufficient. The primary design challenges are discussed, and performance results are presented and analyzed.

  6. WFH: closing the global gap--achieving optimal care.

    Science.gov (United States)

    Skinner, Mark W

    2012-07-01

    For 50 years, the World Federation of Hemophilia (WFH) has been working globally to close the gap in care and to achieve Treatment for All patients, men and women, with haemophilia and other inherited bleeding disorders, regardless of where they might live. The WFH estimates that more than one in 1000 men and women has a bleeding disorder equating to 6,900,000 worldwide. To close the gap in care between developed and developing nations a continued focus on the successful strategies deployed heretofore will be required. However, in response to the rapid advances in treatment and emerging therapeutic advances on the horizon it will also require fresh approaches and renewed strategic thinking. It is difficult to predict what each therapeutic advance on the horizon will mean for the future, but there is no doubt that we are in a golden age of research and development, which has the prospect of revolutionizing treatment once again. An improved understanding of "optimal" treatment is fundamental to the continued evolution of global care. The challenges of answering government and payer demands for evidence-based medicine, and cost justification for the introduction and enhancement of treatment, are ever-present and growing. To sustain and improve care it is critical to build the body of outcome data for individual patients, within haemophilia treatment centers (HTCs), nationally, regionally and globally. Emerging therapeutic advances (longer half-life therapies and gene transfer) should not be justified or brought to market based only on the notion that they will be economically more affordable, although that may be the case, but rather more importantly that they will be therapeutically more advantageous. Improvements in treatment adherence, reductions in bleeding frequency (including microhemorrhages), better management of trough levels, and improved health outcomes (including quality of life) should be the foremost considerations. As part of a new WFH strategic plan

  7. A practical globalization of one-shot optimization for optimal design of tokamak divertors

    Energy Technology Data Exchange (ETDEWEB)

    Blommaert, Maarten, E-mail: maarten.blommaert@kuleuven.be [Institute of Energy and Climate Research (IEK-4), FZ Jülich GmbH, D-52425 Jülich (Germany); Dekeyser, Wouter; Baelmans, Martine [KU Leuven, Department of Mechanical Engineering, 3001 Leuven (Belgium); Gauger, Nicolas R. [TU Kaiserslautern, Chair for Scientific Computing, 67663 Kaiserslautern (Germany); Reiter, Detlev [Institute of Energy and Climate Research (IEK-4), FZ Jülich GmbH, D-52425 Jülich (Germany)

    2017-01-01

    In past studies, nested optimization methods were successfully applied to design of the magnetic divertor configuration in nuclear fusion reactors. In this paper, so-called one-shot optimization methods are pursued. Due to convergence issues, a globalization strategy for the one-shot solver is sought. Whereas Griewank introduced a globalization strategy using a doubly augmented Lagrangian function that includes primal and adjoint residuals, its practical usability is limited by the necessity of second order derivatives and expensive line search iterations. In this paper, a practical alternative is offered that avoids these drawbacks by using a regular augmented Lagrangian merit function that penalizes only state residuals. Additionally, robust rank-two Hessian estimation is achieved by adaptation of Powell's damped BFGS update rule. The application of the novel one-shot approach to magnetic divertor design is considered in detail. For this purpose, the approach is adapted to be complementary with practical in parts adjoint sensitivities. Using the globalization strategy, stable convergence of the one-shot approach is achieved.

  8. ABCluster: the artificial bee colony algorithm for cluster global optimization.

    Science.gov (United States)

    Zhang, Jun; Dolg, Michael

    2015-10-07

    Global optimization of cluster geometries is of fundamental importance in chemistry and an interesting problem in applied mathematics. In this work, we introduce a relatively new swarm intelligence algorithm, i.e. the artificial bee colony (ABC) algorithm proposed in 2005, to this field. It is inspired by the foraging behavior of a bee colony, and only three parameters are needed to control it. We applied it to several potential functions of quite different nature, i.e., the Coulomb-Born-Mayer, Lennard-Jones, Morse, Z and Gupta potentials. The benchmarks reveal that for long-ranged potentials the ABC algorithm is very efficient in locating the global minimum, while for short-ranged ones it is sometimes trapped into a local minimum funnel on a potential energy surface of large clusters. We have released an efficient, user-friendly, and free program "ABCluster" to realize the ABC algorithm. It is a black-box program for non-experts as well as experts and might become a useful tool for chemists to study clusters.

  9. On the Performance of Linear Decreasing Inertia Weight Particle Swarm Optimization for Global Optimization

    Science.gov (United States)

    Arasomwan, Martins Akugbe; Adewumi, Aderemi Oluyinka

    2013-01-01

    Linear decreasing inertia weight (LDIW) strategy was introduced to improve on the performance of the original particle swarm optimization (PSO). However, linear decreasing inertia weight PSO (LDIW-PSO) algorithm is known to have the shortcoming of premature convergence in solving complex (multipeak) optimization problems due to lack of enough momentum for particles to do exploitation as the algorithm approaches its terminal point. Researchers have tried to address this shortcoming by modifying LDIW-PSO or proposing new PSO variants. Some of these variants have been claimed to outperform LDIW-PSO. The major goal of this paper is to experimentally establish the fact that LDIW-PSO is very much efficient if its parameters are properly set. First, an experiment was conducted to acquire a percentage value of the search space limits to compute the particle velocity limits in LDIW-PSO based on commonly used benchmark global optimization problems. Second, using the experimentally obtained values, five well-known benchmark optimization problems were used to show the outstanding performance of LDIW-PSO over some of its competitors which have in the past claimed superiority over it. Two other recent PSO variants with different inertia weight strategies were also compared with LDIW-PSO with the latter outperforming both in the simulation experiments conducted. PMID:24324383

  10. On fractional Fourier transform moments

    NARCIS (Netherlands)

    Alieva, T.; Bastiaans, M.J.

    2000-01-01

    Based on the relation between the ambiguity function represented in a quasi-polar coordinate system and the fractional power spectra, the fractional Fourier transform moments are introduced. Important equalities for the global second-order fractional Fourier transform moments are derived and their

  11. Fourier Series

    Indian Academy of Sciences (India)

    polynomials are dense in the class of continuous functions! The body of literature dealing with Fourier series has reached epic proportions over the last two centuries. We have only given the readers an outline of the topic in this article. For the full length episode we refer the reader to the monumental treatise of. A Zygmund.

  12. Fourier Series

    Indian Academy of Sciences (India)

    The theory of Fourier series deals with periodic functions. By a periodic ..... including Dirichlet, Riemann and Cantor occupied themselves with the problem of ... to converge only on a set which is negligible in a certain sense (Le. of measure ...

  13. Cloud Particles Differential Evolution Algorithm: A Novel Optimization Method for Global Numerical Optimization

    Directory of Open Access Journals (Sweden)

    Wei Li

    2015-01-01

    Full Text Available We propose a new optimization algorithm inspired by the formation and change of the cloud in nature, referred to as Cloud Particles Differential Evolution (CPDE algorithm. The cloud is assumed to have three states in the proposed algorithm. Gaseous state represents the global exploration. Liquid state represents the intermediate process from the global exploration to the local exploitation. Solid state represents the local exploitation. The best solution found so far acts as a nucleus. In gaseous state, the nucleus leads the population to explore by condensation operation. In liquid state, cloud particles carry out macrolocal exploitation by liquefaction operation. A new mutation strategy called cloud differential mutation is introduced in order to solve a problem that the misleading effect of a nucleus may cause the premature convergence. In solid state, cloud particles carry out microlocal exploitation by solidification operation. The effectiveness of the algorithm is validated upon different benchmark problems. The results have been compared with eight well-known optimization algorithms. The statistical analysis on performance evaluation of the different algorithms on 10 benchmark functions and CEC2013 problems indicates that CPDE attains good performance.

  14. Automatic Construction and Global Optimization of a Multisentiment Lexicon

    Directory of Open Access Journals (Sweden)

    Xiaoping Yang

    2016-01-01

    Full Text Available Manual annotation of sentiment lexicons costs too much labor and time, and it is also difficult to get accurate quantification of emotional intensity. Besides, the excessive emphasis on one specific field has greatly limited the applicability of domain sentiment lexicons (Wang et al., 2010. This paper implements statistical training for large-scale Chinese corpus through neural network language model and proposes an automatic method of constructing a multidimensional sentiment lexicon based on constraints of coordinate offset. In order to distinguish the sentiment polarities of those words which may express either positive or negative meanings in different contexts, we further present a sentiment disambiguation algorithm to increase the flexibility of our lexicon. Lastly, we present a global optimization framework that provides a unified way to combine several human-annotated resources for learning our 10-dimensional sentiment lexicon SentiRuc. Experiments show the superior performance of SentiRuc lexicon in category labeling test, intensity labeling test, and sentiment classification tasks. It is worth mentioning that, in intensity label test, SentiRuc outperforms the second place by 21 percent.

  15. A DE-Based Scatter Search for Global Optimization Problems

    Directory of Open Access Journals (Sweden)

    Kun Li

    2015-01-01

    Full Text Available This paper proposes a hybrid scatter search (SS algorithm for continuous global optimization problems by incorporating the evolution mechanism of differential evolution (DE into the reference set updated procedure of SS to act as the new solution generation method. This hybrid algorithm is called a DE-based SS (SSDE algorithm. Since different kinds of mutation operators of DE have been proposed in the literature and they have shown different search abilities for different kinds of problems, four traditional mutation operators are adopted in the hybrid SSDE algorithm. To adaptively select the mutation operator that is most appropriate to the current problem, an adaptive mechanism for the candidate mutation operators is developed. In addition, to enhance the exploration ability of SSDE, a reinitialization method is adopted to create a new population and subsequently construct a new reference set whenever the search process of SSDE is trapped in local optimum. Computational experiments on benchmark problems show that the proposed SSDE is competitive or superior to some state-of-the-art algorithms in the literature.

  16. Global Optimization Employing Gaussian Process-Based Bayesian Surrogates

    Directory of Open Access Journals (Sweden)

    Roland Preuss

    2018-03-01

    Full Text Available The simulation of complex physics models may lead to enormous computer running times. Since the simulations are expensive it is necessary to exploit the computational budget in the best possible manner. If for a few input parameter settings an output data set has been acquired, one could be interested in taking these data as a basis for finding an extremum and possibly an input parameter set for further computer simulations to determine it—a task which belongs to the realm of global optimization. Within the Bayesian framework we utilize Gaussian processes for the creation of a surrogate model function adjusted self-consistently via hyperparameters to represent the data. Although the probability distribution of the hyperparameters may be widely spread over phase space, we make the assumption that only the use of their expectation values is sufficient. While this shortcut facilitates a quickly accessible surrogate, it is somewhat justified by the fact that we are not interested in a full representation of the model by the surrogate but to reveal its maximum. To accomplish this the surrogate is fed to a utility function whose extremum determines the new parameter set for the next data point to obtain. Moreover, we propose to alternate between two utility functions—expected improvement and maximum variance—in order to avoid the drawbacks of each. Subsequent data points are drawn from the model function until the procedure either remains in the points found or the surrogate model does not change with the iteration. The procedure is applied to mock data in one and two dimensions in order to demonstrate proof of principle of the proposed approach.

  17. Global stability-based design optimization of truss structures using ...

    Indian Academy of Sciences (India)

    Furthermore, a pure pareto-ranking based multi-objective optimization model is employed for the design optimization of the truss structure with multiple objectives. The computational performance of the optimization model is increased by implementing an island model into its evolutionary search mechanism. The proposed ...

  18. An Improved Teaching-Learning-Based Optimization with the Social Character of PSO for Global Optimization

    Directory of Open Access Journals (Sweden)

    Feng Zou

    2016-01-01

    Full Text Available An improved teaching-learning-based optimization with combining of the social character of PSO (TLBO-PSO, which is considering the teacher’s behavior influence on the students and the mean grade of the class, is proposed in the paper to find the global solutions of function optimization problems. In this method, the teacher phase of TLBO is modified; the new position of the individual is determined by the old position, the mean position, and the best position of current generation. The method overcomes disadvantage that the evolution of the original TLBO might stop when the mean position of students equals the position of the teacher. To decrease the computation cost of the algorithm, the process of removing the duplicate individual in original TLBO is not adopted in the improved algorithm. Moreover, the probability of local convergence of the improved method is decreased by the mutation operator. The effectiveness of the proposed method is tested on some benchmark functions, and the results are competitive with respect to some other methods.

  19. App. 1. Fourier series and Fourier transform

    International Nuclear Information System (INIS)

    Anon.

    1977-01-01

    Definitions, formulas and practical properties in quantum mechanics are presented: Fourier series (development of periodic function, Bessel-Parseval equality); Fourier transform (Parseval-Plancherel formula, Fourier transform in three-dimensional space) [fr

  20. A Simple But Effective Canonical Dual Theory Unified Algorithm for Global Optimization

    OpenAIRE

    Zhang, Jiapu

    2011-01-01

    Numerical global optimization methods are often very time consuming and could not be applied for high-dimensional nonconvex/nonsmooth optimization problems. Due to the nonconvexity/nonsmoothness, directly solving the primal problems sometimes is very difficult. This paper presents a very simple but very effective canonical duality theory (CDT) unified global optimization algorithm. This algorithm has convergence is proved in this paper. More important, for this CDT-unified algorithm, numerous...

  1. Effective Energy Methods for Global Optimization for Biopolymer Structure Prediction

    National Research Council Canada - National Science Library

    Shalloway, David

    1998-01-01

    .... Its main strength is that it uncovers and exploits the intrinsic "hidden structures" of biopolymer energy landscapes to efficiently perform global minimization using a hierarchical search procedure...

  2. An Evaluation of the Sniffer Global Optimization Algorithm Using Standard Test Functions

    Science.gov (United States)

    Butler, Roger A. R.; Slaminka, Edward E.

    1992-03-01

    The performance of Sniffer—a new global optimization algorithm—is compared with that of Simulated Annealing. Using the number of function evaluations as a measure of efficiency, the new algorithm is shown to be significantly better at finding the global minimum of seven standard test functions. Several of the test functions used have many local minima and very steep walls surrounding the global minimum. Such functions are intended to thwart global minimization algorithms.

  3. Fourier Transform Spectroscopy of Carbonyl Sulfide from 4800 to 8000 cm -1and New Global Analysis of 16O 12C 32S

    Science.gov (United States)

    Rbaihi, E.; Belafhal, A.; Vander Auwera, J.; Naı̈m, S.; Fayt, A.

    1998-09-01

    We have measured the FT spectrum of natural OCS from 4800 to 8000 cm-1with a near Doppler resolution and a line-position accuracy between 2 and 8 × 10-4cm-1. For the normal isotopic species16O12C32S, 37 vibrational transitions have been analyzed for both frequencies and intensities. We also report six bands of16O12C34S, five bands of16O13C32S, two bands of16O12C33S, and two bands of18O12C32S. Important effective Herman-Wallis terms are explained by the anharmonic resonances between closely spaced states. As those results complete the study of the Fourier transform spectra of natural carbonyl sulfide from 1800 to 8000 cm-1, a new global rovibrational analysis of16O12C32S has been performed. We have determined a set of 148 molecular parameters, and a statistical agreement is obtained with all the available experimental data.

  4. Global optimization for overall HVAC systems - Part I problem formulation and analysis

    International Nuclear Information System (INIS)

    Lu Lu; Cai Wenjian; Chai, Y.S.; Xie Lihua

    2005-01-01

    This paper presents the global optimization technologies for overall heating, ventilating and air conditioning (HVAC) systems. The objective function of global optimization and constraints are formulated based on mathematical models of the major components. All these models are associated with power consumption components and heat exchangers for transferring cooling load. The characteristics of all the major components are briefly introduced by models, and the interactions between them are analyzed and discussed to show the complications of the problem. According to the characteristics of the operating components, the complicated original optimization problem for overall HVAC systems is transformed and simplified into a compact form ready for optimization

  5. A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

    KAUST Repository

    Fowkes, Jaroslav M.; Gould, Nicholas I. M.; Farmer, Chris L.

    2012-01-01

    We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation

  6. Global optimization of maintenance and surveillance testing based on reliability and probabilistic safety assessment. Research project

    International Nuclear Information System (INIS)

    Martorell, S.; Serradell, V.; Munoz, A.; Sanchez, A.

    1997-01-01

    Background, objective, scope, detailed working plan and follow-up and final product of the project ''Global optimization of maintenance and surveillance testing based on reliability and probabilistic safety assessment'' are described

  7. Global blending optimization of laminated composites with discrete material candidate selection and thickness variation

    DEFF Research Database (Denmark)

    Sørensen, Søren N.; Stolpe, Mathias

    2015-01-01

    rate. The capabilities of the method and the effect of active versus inactive manufacturing constraints are demonstrated on several numerical examples of limited size, involving at most 320 binary variables. Most examples are solved to guaranteed global optimality and may constitute benchmark examples...... but is, however, convex in the original mixed binary nested form. Convexity is the foremost important property of optimization problems, and the proposed method can guarantee the global or near-global optimal solution; unlike most topology optimization methods. The material selection is limited...... for popular topology optimization methods and heuristics based on solving sequences of non-convex problems. The results will among others demonstrate that the difficulty of the posed problem is highly dependent upon the composition of the constitutive properties of the material candidates....

  8. Globally Optimal Segmentation of Permanent-Magnet Systems

    DEFF Research Database (Denmark)

    Insinga, Andrea Roberto; Bjørk, Rasmus; Smith, Anders

    2016-01-01

    Permanent-magnet systems are widely used for generation of magnetic fields with specific properties. The reciprocity theorem, an energy-equivalence principle in magnetostatics, can be employed to calculate the optimal remanent flux density of the permanent-magnet system, given any objective...... remains unsolved. We show that the problem of optimal segmentation of a two-dimensional permanent-magnet assembly with respect to a linear objective functional can be reduced to the problem of piecewise linear approximation of a plane curve by perimeter maximization. Once the problem has been cast...

  9. The Tunneling Method for Global Optimization in Multidimensional Scaling.

    Science.gov (United States)

    Groenen, Patrick J. F.; Heiser, Willem J.

    1996-01-01

    A tunneling method for global minimization in multidimensional scaling is introduced and adjusted for multidimensional scaling with general Minkowski distances. The method alternates a local search step with a tunneling step in which a different configuration is sought with the same STRESS implementation. (SLD)

  10. Global Optimization of a Periodic System using a Genetic Algorithm

    Science.gov (United States)

    Stucke, David; Crespi, Vincent

    2001-03-01

    We use a novel application of a genetic algorithm global optimizatin technique to find the lowest energy structures for periodic systems. We apply this technique to colloidal crystals for several different stoichiometries of binary and trinary colloidal crystals. This application of a genetic algorithm is decribed and results of likely candidate structures are presented.

  11. Global Launcher Trajectory Optimization for Lunar Base Settlement

    NARCIS (Netherlands)

    Pagano, A.; Mooij, E.

    2010-01-01

    The problem of a mission to the Moon to set a permanent outpost can be tackled by dividing the journey into three phases: the Earth ascent, the Earth-Moon transfer and the lunar landing. In this paper we present an optimization analysis of Earth ascent trajectories of existing launch vehicles

  12. Vertical bifacial solar farms: Physics, design, and global optimization

    KAUST Repository

    Khan, M. Ryyan; Hanna, Amir; Sun, Xingshu; Alam, Muhammad A.

    2017-01-01

    10–20% more energy than a traditional monofacial farm for a practical row-spacing of 2 m (corresponding to 1.2 m high panels). With the prospect of additional 5–20% energy gain from reduced soiling and tilt optimization, bifacial solar farm do offer a

  13. Global stability-based design optimization of truss structures using ...

    Indian Academy of Sciences (India)

    The quality of current pareto front obtained in the end of a whole genetic search is assessed according to its closeness to the ...... better optimal designation with a lower displacement value of 0.3075 in. satisfying the service- .... Internal force. R.

  14. Global WASF-GA: An Evolutionary Algorithm in Multiobjective Optimization to Approximate the Whole Pareto Optimal Front.

    Science.gov (United States)

    Saborido, Rubén; Ruiz, Ana B; Luque, Mariano

    2017-01-01

    In this article, we propose a new evolutionary algorithm for multiobjective optimization called Global WASF-GA ( global weighting achievement scalarizing function genetic algorithm), which falls within the aggregation-based evolutionary algorithms. The main purpose of Global WASF-GA is to approximate the whole Pareto optimal front. Its fitness function is defined by an achievement scalarizing function (ASF) based on the Tchebychev distance, in which two reference points are considered (both utopian and nadir objective vectors) and the weight vector used is taken from a set of weight vectors whose inverses are well-distributed. At each iteration, all individuals are classified into different fronts. Each front is formed by the solutions with the lowest values of the ASF for the different weight vectors in the set, using the utopian vector and the nadir vector as reference points simultaneously. Varying the weight vector in the ASF while considering the utopian and the nadir vectors at the same time enables the algorithm to obtain a final set of nondominated solutions that approximate the whole Pareto optimal front. We compared Global WASF-GA to MOEA/D (different versions) and NSGA-II in two-, three-, and five-objective problems. The computational results obtained permit us to conclude that Global WASF-GA gets better performance, regarding the hypervolume metric and the epsilon indicator, than the other two algorithms in many cases, especially in three- and five-objective problems.

  15. Avoiding spurious submovement decompositions: a globally optimal algorithm

    International Nuclear Information System (INIS)

    Rohrer, Brandon Robinson; Hogan, Neville

    2003-01-01

    Evidence for the existence of discrete submovements underlying continuous human movement has motivated many attempts to extract them. Although they produce visually convincing results, all of the methodologies that have been employed are prone to produce spurious decompositions. Examples of potential failures are given. A branch-and-bound algorithm for submovement extraction, capable of global nonlinear minimization (and hence capable of avoiding spurious decompositions), is developed and demonstrated.

  16. A Global Optimization Algorithm for Sum of Linear Ratios Problem

    OpenAIRE

    Yuelin Gao; Siqiao Jin

    2013-01-01

    We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the c...

  17. Global Optimization for Transport Network Expansion and Signal Setting

    OpenAIRE

    Liu, Haoxiang; Wang, David Z. W.; Yue, Hao

    2015-01-01

    This paper proposes a model to address an urban transport planning problem involving combined network design and signal setting in a saturated network. Conventional transport planning models usually deal with the network design problem and signal setting problem separately. However, the fact that network capacity design and capacity allocation determined by network signal setting combine to govern the transport network performance requires the optimal transport planning to consider the two pr...

  18. Fast globally optimal segmentation of 3D prostate MRI with axial symmetry prior.

    Science.gov (United States)

    Qiu, Wu; Yuan, Jing; Ukwatta, Eranga; Sun, Yue; Rajchl, Martin; Fenster, Aaron

    2013-01-01

    We propose a novel global optimization approach to segmenting a given 3D prostate T2w magnetic resonance (MR) image, which enforces the inherent axial symmetry of the prostate shape and simultaneously performs a sequence of 2D axial slice-wise segmentations with a global 3D coherence prior. We show that the proposed challenging combinatorial optimization problem can be solved globally and exactly by means of convex relaxation. With this regard, we introduce a novel coupled continuous max-flow model, which is dual to the studied convex relaxed optimization formulation and leads to an efficient multiplier augmented algorithm based on the modern convex optimization theory. Moreover, the new continuous max-flow based algorithm was implemented on GPUs to achieve a substantial improvement in computation. Experimental results using public and in-house datasets demonstrate great advantages of the proposed method in terms of both accuracy and efficiency.

  19. Global issues and opportunities for optimized retinoblastoma care.

    Science.gov (United States)

    Gallie, Brenda L; Zhao, Junyang; Vandezande, Kirk; White, Abigail; Chan, Helen S L

    2007-12-01

    The RB1 gene is important in all human cancers. Studies of human retinoblastoma point to a rare retinal cell with extreme dependency on RB1 for initiation but not progression to full malignancy. In developed countries, genetic testing within affected families can predict children at high risk of retinoblastoma before birth; chemotherapy with local therapy often saves eyes and vision; and mortality is 4%. In less developed countries where 92% of children with retinoblastoma are born, mortality reaches 90%. Global collaboration is building for the dramatic change in mortality that awareness, simple expertise and therapies could achieve in less developed countries. Copyright 2007 Wiley-Liss, Inc.

  20. Fast globally optimal segmentation of cells in fluorescence microscopy images.

    Science.gov (United States)

    Bergeest, Jan-Philip; Rohr, Karl

    2011-01-01

    Accurate and efficient segmentation of cells in fluorescence microscopy images is of central importance for the quantification of protein expression in high-throughput screening applications. We propose a new approach for segmenting cell nuclei which is based on active contours and convex energy functionals. Compared to previous work, our approach determines the global solution. Thus, the approach does not suffer from local minima and the segmentation result does not depend on the initialization. We also suggest a numeric approach for efficiently computing the solution. The performance of our approach has been evaluated using fluorescence microscopy images of different cell types. We have also performed a quantitative comparison with previous segmentation approaches.

  1. A Global Optimization Algorithm for Sum of Linear Ratios Problem

    Directory of Open Access Journals (Sweden)

    Yuelin Gao

    2013-01-01

    Full Text Available We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.

  2. Hooke–Jeeves Method-used Local Search in a Hybrid Global Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    V. D. Sulimov

    2014-01-01

    Full Text Available Modern methods for optimization investigation of complex systems are based on development and updating the mathematical models of systems because of solving the appropriate inverse problems. Input data desirable for solution are obtained from the analysis of experimentally defined consecutive characteristics for a system or a process. Causal characteristics are the sought ones to which equation coefficients of mathematical models of object, limit conditions, etc. belong. The optimization approach is one of the main ones to solve the inverse problems. In the main case it is necessary to find a global extremum of not everywhere differentiable criterion function. Global optimization methods are widely used in problems of identification and computation diagnosis system as well as in optimal control, computing to-mography, image restoration, teaching the neuron networks, other intelligence technologies. Increasingly complicated systems of optimization observed during last decades lead to more complicated mathematical models, thereby making solution of appropriate extreme problems significantly more difficult. A great deal of practical applications may have the problem con-ditions, which can restrict modeling. As a consequence, in inverse problems the criterion functions can be not everywhere differentiable and noisy. Available noise means that calculat-ing the derivatives is difficult and unreliable. It results in using the optimization methods without calculating the derivatives.An efficiency of deterministic algorithms of global optimization is significantly restrict-ed by their dependence on the extreme problem dimension. When the number of variables is large they use the stochastic global optimization algorithms. As stochastic algorithms yield too expensive solutions, so this drawback restricts their applications. Developing hybrid algo-rithms that combine a stochastic algorithm for scanning the variable space with deterministic local search

  3. Vertical bifacial solar farms: Physics, design, and global optimization

    KAUST Repository

    Khan, M. Ryyan

    2017-09-04

    There have been sustained interest in bifacial solar cell technology since 1980s, with prospects of 30–50% increase in the output power from a stand-alone panel. Moreover, a vertical bifacial panel reduces dust accumulation and provides two output peaks during the day, with the second peak aligned to the peak electricity demand. Recent commercialization and anticipated growth of bifacial panel market have encouraged a closer scrutiny of the integrated power-output and economic viability of bifacial solar farms, where mutual shading will erode some of the anticipated energy gain associated with an isolated, single panel. Towards that goal, in this paper we focus on geography-specific optimization of ground-mounted vertical bifacial solar farms for the entire world. For local irradiance, we combine the measured meteorological data with the clear-sky model. In addition, we consider the effects of direct, diffuse, and albedo light. We assume the panel is configured into sub-strings with bypass-diodes. Based on calculated light collection and panel output, we analyze the optimum farm design for maximum yearly output at any given location in the world. Our results predict that, regardless of the geographical location, a vertical bifacial farm will yield 10–20% more energy than a traditional monofacial farm for a practical row-spacing of 2 m (corresponding to 1.2 m high panels). With the prospect of additional 5–20% energy gain from reduced soiling and tilt optimization, bifacial solar farm do offer a viable technology option for large-scale solar energy generation.

  4. Chaos optimization algorithms based on chaotic maps with different probability distribution and search speed for global optimization

    Science.gov (United States)

    Yang, Dixiong; Liu, Zhenjun; Zhou, Jilei

    2014-04-01

    Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.

  5. A global optimization method for evaporative cooling systems based on the entransy theory

    International Nuclear Information System (INIS)

    Yuan, Fang; Chen, Qun

    2012-01-01

    Evaporative cooling technique, one of the most widely used methods, is essential to both energy conservation and environment protection. This contribution introduces a global optimization method for indirect evaporative cooling systems with coupled heat and mass transfer processes based on the entransy theory to improve their energy efficiency. First, we classify the irreversible processes in the system into the heat transfer process, the coupled heat and mass transfer process and the mixing process of waters in different branches, where the irreversibility is evaluated by the entransy dissipation. Then through the total system entransy dissipation, we establish the theoretical relationship of the user demands with both the geometrical structures of each heat exchanger and the operating parameters of each fluid, and derive two optimization equation groups focusing on two typical optimization problems. Finally, an indirect evaporative cooling system is taken as an example to illustrate the applications of the newly proposed optimization method. It is concluded that there exists an optimal circulating water flow rate with the minimum total thermal conductance of the system. Furthermore, with different user demands and moist air inlet conditions, it is the global optimization, other than parametric analysis, will obtain the optimal performance of the system. -- Highlights: ► Introduce a global optimization method for evaporative cooling systems. ► Establish the direct relation between user demands and the design parameters. ► Obtain two groups of optimization equations for two typical optimization objectives. ► Solving the equations offers the optimal design parameters for the system. ► Provide the instruction for the design of coupled heat and mass transfer systems.

  6. A theoretical global optimization method for vapor-compression refrigeration systems based on entransy theory

    International Nuclear Information System (INIS)

    Xu, Yun-Chao; Chen, Qun

    2013-01-01

    The vapor-compression refrigeration systems have been one of the essential energy conversion systems for humankind and exhausting huge amounts of energy nowadays. Surrounding the energy efficiency promotion of the systems, there are lots of effectual optimization methods but mainly relied on engineering experience and computer simulations rather than theoretical analysis due to the complex and vague physical essence. We attempt to propose a theoretical global optimization method based on in-depth physical analysis for the involved physical processes, i.e. heat transfer analysis for condenser and evaporator, through introducing the entransy theory and thermodynamic analysis for compressor and expansion valve. The integration of heat transfer and thermodynamic analyses forms the overall physical optimization model for the systems to describe the relation between all the unknown parameters and known conditions, which makes theoretical global optimization possible. With the aid of the mathematical conditional extremum solutions, an optimization equation group and the optimal configuration of all the unknown parameters are analytically obtained. Eventually, via the optimization of a typical vapor-compression refrigeration system with various working conditions to minimize the total heat transfer area of heat exchangers, the validity and superior of the newly proposed optimization method is proved. - Highlights: • A global optimization method for vapor-compression systems is proposed. • Integrating heat transfer and thermodynamic analyses forms the optimization model. • A mathematical relation between design parameters and requirements is derived. • Entransy dissipation is introduced into heat transfer analysis. • The validity of the method is proved via optimization of practical cases

  7. Globally optimal, minimum stored energy, double-doughnut superconducting magnets.

    Science.gov (United States)

    Tieng, Quang M; Vegh, Viktor; Brereton, Ian M

    2010-01-01

    The use of the minimum stored energy current density map-based methodology of designing closed-bore symmetric superconducting magnets was described recently. The technique is further developed to cater for the design of interventional-type MRI systems, and in particular open symmetric magnets of the double-doughnut configuration. This extends the work to multiple magnet domain configurations. The use of double-doughnut magnets in MRI scanners has previously been hindered by the ability to deliver strong magnetic fields over a sufficiently large volume appropriate for imaging, essentially limiting spatial resolution, signal-to-noise ratio, and field of view. The requirement of dedicated interventional space restricts the manner in which the coils can be arranged and placed. The minimum stored energy optimal coil arrangement ensures that the field strength is maximized over a specific region of imaging. The design method yields open, dual-domain magnets capable of delivering greater field strengths than those used prior to this work, and at the same time it provides an increase in the field-of-view volume. Simulation results are provided for 1-T double-doughnut magnets with at least a 50-cm 1-ppm (parts per million) field of view and 0.7-m gap between the two doughnuts. Copyright (c) 2009 Wiley-Liss, Inc.

  8. Self-adaptive global best harmony search algorithm applied to reactor core fuel management optimization

    International Nuclear Information System (INIS)

    Poursalehi, N.; Zolfaghari, A.; Minuchehr, A.; Valavi, K.

    2013-01-01

    Highlights: • SGHS enhanced the convergence rate of LPO using some improvements in comparison to basic HS and GHS. • SGHS optimization algorithm obtained averagely better fitness relative to basic HS and GHS algorithms. • Upshot of the SGHS implementation in the LPO reveals its flexibility, efficiency and reliability. - Abstract: The aim of this work is to apply the new developed optimization algorithm, Self-adaptive Global best Harmony Search (SGHS), for PWRs fuel management optimization. SGHS algorithm has some modifications in comparison with basic Harmony Search (HS) and Global-best Harmony Search (GHS) algorithms such as dynamically change of parameters. For the demonstration of SGHS ability to find an optimal configuration of fuel assemblies, basic Harmony Search (HS) and Global-best Harmony Search (GHS) algorithms also have been developed and investigated. For this purpose, Self-adaptive Global best Harmony Search Nodal Expansion package (SGHSNE) has been developed implementing HS, GHS and SGHS optimization algorithms for the fuel management operation of nuclear reactor cores. This package uses developed average current nodal expansion code which solves the multi group diffusion equation by employment of first and second orders of Nodal Expansion Method (NEM) for two dimensional, hexagonal and rectangular geometries, respectively, by one node per a FA. Loading pattern optimization was performed using SGHSNE package for some test cases to present the SGHS algorithm capability in converging to near optimal loading pattern. Results indicate that the convergence rate and reliability of the SGHS method are quite promising and practically, SGHS improves the quality of loading pattern optimization results relative to HS and GHS algorithms. As a result, it has the potential to be used in the other nuclear engineering optimization problems

  9. A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems

    Directory of Open Access Journals (Sweden)

    Leilei Cao

    2016-01-01

    Full Text Available A Guiding Evolutionary Algorithm (GEA with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.

  10. The Global Optimal Algorithm of Reliable Path Finding Problem Based on Backtracking Method

    Directory of Open Access Journals (Sweden)

    Liang Shen

    2017-01-01

    Full Text Available There is a growing interest in finding a global optimal path in transportation networks particularly when the network suffers from unexpected disturbance. This paper studies the problem of finding a global optimal path to guarantee a given probability of arriving on time in a network with uncertainty, in which the travel time is stochastic instead of deterministic. Traditional path finding methods based on least expected travel time cannot capture the network user’s risk-taking behaviors in path finding. To overcome such limitation, the reliable path finding algorithms have been proposed but the convergence of global optimum is seldom addressed in the literature. This paper integrates the K-shortest path algorithm into Backtracking method to propose a new path finding algorithm under uncertainty. The global optimum of the proposed method can be guaranteed. Numerical examples are conducted to demonstrate the correctness and efficiency of the proposed algorithm.

  11. Fourier-muunnoksesta

    OpenAIRE

    NIEMELÄ, EERO

    2008-01-01

    Tutkielman aiheena on Fourier-muunnoksen esittely. Tarkoituksena on erityisesti johdatella lukija Fourier-sarjan ja -muunnoksen käsitteisiin. Fourier-muunnosten teoria kuuluu yleisempään Fourier-analyysin aihepiiriin. Fourier-analyysin keskiössä on tulos, jonka mukaan tietyt ehdot täyttävää funktiota voidaan approksimoida mielivaltaisen tarkasti niin sanotun Fourier-sarjan avulla. Osoitamme, että 2\\pi-jaksollisen funktion Lebesgue-neliöintegroituvuus takaa suppenevan Fourier-sarjakehitelm...

  12. A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions

    KAUST Repository

    Fowkes, Jaroslav M.

    2012-06-21

    We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation techniques to the objective function within an overlapping branch and bound algorithm for convex constrained global optimization. Unlike other branch and bound algorithms, lower bounds are obtained via nonconvex underestimators of the function. For a numerical example, we apply the proposed branch and bound algorithm to radial basis function approximations. © 2012 Springer Science+Business Media, LLC.

  13. Conference on "State of the Art in Global Optimization : Computational Methods and Applications"

    CERN Document Server

    Pardalos, P

    1996-01-01

    Optimization problems abound in most fields of science, engineering, and technology. In many of these problems it is necessary to compute the global optimum (or a good approximation) of a multivariable function. The variables that define the function to be optimized can be continuous and/or discrete and, in addition, many times satisfy certain constraints. Global optimization problems belong to the complexity class of NP-hard prob­ lems. Such problems are very difficult to solve. Traditional descent optimization algorithms based on local information are not adequate for solving these problems. In most cases of practical interest the number of local optima increases, on the aver­ age, exponentially with the size of the problem (number of variables). Furthermore, most of the traditional approaches fail to escape from a local optimum in order to continue the search for the global solution. Global optimization has received a lot of attention in the past ten years, due to the success of new algorithms for solvin...

  14. Global warming and carbon taxation. Optimal policy and the role of administration costs

    International Nuclear Information System (INIS)

    Williams, M.

    1995-01-01

    This paper develops a model relating CO 2 emissions to atmosphere concentrations, global temperature change and economic damages. For a variety of parameter assumptions, the model provides estimates of the marginal cost of emissions in various years. The optimal carbon tax is a function of the marginal emission cost and the costs of administering the tax. This paper demonstrates that under any reasonable assumptions, the optimal carbon tax is zero for at least several decades. (author)

  15. A kind of balance between exploitation and exploration on kriging for global optimization of expensive functions

    International Nuclear Information System (INIS)

    Dong, Huachao; Song, Baowei; Wang, Peng; Huang, Shuai

    2015-01-01

    In this paper, a novel kriging-based algorithm for global optimization of computationally expensive black-box functions is presented. This algorithm utilizes a multi-start approach to find all of the local optimal values of the surrogate model and performs searches within the neighboring area around these local optimal positions. Compared with traditional surrogate-based global optimization method, this algorithm provides another kind of balance between exploitation and exploration on kriging-based model. In addition, a new search strategy is proposed and coupled into this optimization process. The local search strategy employs a kind of improved 'Minimizing the predictor' method, which dynamically adjusts search direction and radius until finds the optimal value. Furthermore, the global search strategy utilizes the advantage of kriging-based model in predicting unexplored regions to guarantee the reliability of the algorithm. Finally, experiments on 13 test functions with six algorithms are set up and the results show that the proposed algorithm is very promising.

  16. On the inverse windowed Fourier transform

    OpenAIRE

    Rebollo Neira, Laura; Fernández Rubio, Juan Antonio

    1999-01-01

    The inversion problem concerning the windowed Fourier transform is considered. It is shown that, out of the infinite solutions that the problem admits, the windowed Fourier transform is the "optimal" solution according to a maximum-entropy selection criterion. Peer Reviewed

  17. Theoretical properties of the global optimizer of two layer neural network

    OpenAIRE

    Boob, Digvijay; Lan, Guanghui

    2017-01-01

    In this paper, we study the problem of optimizing a two-layer artificial neural network that best fits a training dataset. We look at this problem in the setting where the number of parameters is greater than the number of sampled points. We show that for a wide class of differentiable activation functions (this class involves "almost" all functions which are not piecewise linear), we have that first-order optimal solutions satisfy global optimality provided the hidden layer is non-singular. ...

  18. A global optimization algorithm inspired in the behavior of selfish herds.

    Science.gov (United States)

    Fausto, Fernando; Cuevas, Erik; Valdivia, Arturo; González, Adrián

    2017-10-01

    In this paper, a novel swarm optimization algorithm called the Selfish Herd Optimizer (SHO) is proposed for solving global optimization problems. SHO is based on the simulation of the widely observed selfish herd behavior manifested by individuals within a herd of animals subjected to some form of predation risk. In SHO, individuals emulate the predatory interactions between groups of prey and predators by two types of search agents: the members of a selfish herd (the prey) and a pack of hungry predators. Depending on their classification as either a prey or a predator, each individual is conducted by a set of unique evolutionary operators inspired by such prey-predator relationship. These unique traits allow SHO to improve the balance between exploration and exploitation without altering the population size. To illustrate the proficiency and robustness of the proposed method, it is compared to other well-known evolutionary optimization approaches such as Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Firefly Algorithm (FA), Differential Evolution (DE), Genetic Algorithms (GA), Crow Search Algorithm (CSA), Dragonfly Algorithm (DA), Moth-flame Optimization Algorithm (MOA) and Sine Cosine Algorithm (SCA). The comparison examines several standard benchmark functions, commonly considered within the literature of evolutionary algorithms. The experimental results show the remarkable performance of our proposed approach against those of the other compared methods, and as such SHO is proven to be an excellent alternative to solve global optimization problems. Copyright © 2017 Elsevier B.V. All rights reserved.

  19. Global optimal path planning of an autonomous vehicle for overtaking a moving obstacle

    Directory of Open Access Journals (Sweden)

    B. Mashadi

    Full Text Available In this paper, the global optimal path planning of an autonomous vehicle for overtaking a moving obstacle is proposed. In this study, the autonomous vehicle overtakes a moving vehicle by performing a double lane-change maneuver after detecting it in a proper distance ahead. The optimal path of vehicle for performing the lane-change maneuver is generated by a path planning program in which the sum of lateral deviation of the vehicle from a reference path and the rate of steering angle become minimum while the lateral acceleration of vehicle does not exceed a safe limit value. A nonlinear optimal control theory with the lateral vehicle dynamics equations and inequality constraint of lateral acceleration are used to generate the path. The indirect approach for solving the optimal control problem is used by applying the calculus of variation and the Pontryagin's Minimum Principle to obtain first-order necessary conditions for optimality. The optimal path is generated as a global optimal solution and can be used as the benchmark of the path generated by the local motion planning of autonomous vehicles. A full nonlinear vehicle model in CarSim software is used for path following simulation by importing path data from the MATLAB code. The simulation results show that the generated path for the autonomous vehicle satisfies all vehicle dynamics constraints and hence is a suitable overtaking path for the following vehicle.

  20. Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule

    KAUST Repository

    Liang, Faming; Cheng, Yichen; Lin, Guang

    2014-01-01

    cooling schedule, for example, a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural

  1. PS-FW: A Hybrid Algorithm Based on Particle Swarm and Fireworks for Global Optimization

    Science.gov (United States)

    Chen, Shuangqing; Wei, Lixin; Guan, Bing

    2018-01-01

    Particle swarm optimization (PSO) and fireworks algorithm (FWA) are two recently developed optimization methods which have been applied in various areas due to their simplicity and efficiency. However, when being applied to high-dimensional optimization problems, PSO algorithm may be trapped in the local optima owing to the lack of powerful global exploration capability, and fireworks algorithm is difficult to converge in some cases because of its relatively low local exploitation efficiency for noncore fireworks. In this paper, a hybrid algorithm called PS-FW is presented, in which the modified operators of FWA are embedded into the solving process of PSO. In the iteration process, the abandonment and supplement mechanism is adopted to balance the exploration and exploitation ability of PS-FW, and the modified explosion operator and the novel mutation operator are proposed to speed up the global convergence and to avoid prematurity. To verify the performance of the proposed PS-FW algorithm, 22 high-dimensional benchmark functions have been employed, and it is compared with PSO, FWA, stdPSO, CPSO, CLPSO, FIPS, Frankenstein, and ALWPSO algorithms. Results show that the PS-FW algorithm is an efficient, robust, and fast converging optimization method for solving global optimization problems. PMID:29675036

  2. Selective Segmentation for Global Optimization of Depth Estimation in Complex Scenes

    Directory of Open Access Journals (Sweden)

    Sheng Liu

    2013-01-01

    Full Text Available This paper proposes a segmentation-based global optimization method for depth estimation. Firstly, for obtaining accurate matching cost, the original local stereo matching approach based on self-adapting matching window is integrated with two matching cost optimization strategies aiming at handling both borders and occlusion regions. Secondly, we employ a comprehensive smooth term to satisfy diverse smoothness request in real scene. Thirdly, a selective segmentation term is used for enforcing the plane trend constraints selectively on the corresponding segments to further improve the accuracy of depth results from object level. Experiments on the Middlebury image pairs show that the proposed global optimization approach is considerably competitive with other state-of-the-art matching approaches.

  3. Global optimization based on noisy evaluations: An empirical study of two statistical approaches

    International Nuclear Information System (INIS)

    Vazquez, Emmanuel; Villemonteix, Julien; Sidorkiewicz, Maryan; Walter, Eric

    2008-01-01

    The optimization of the output of complex computer codes has often to be achieved with a small budget of evaluations. Algorithms dedicated to such problems have been developed and compared, such as the Expected Improvement algorithm (El) or the Informational Approach to Global Optimization (IAGO). However, the influence of noisy evaluation results on the outcome of these comparisons has often been neglected, despite its frequent appearance in industrial problems. In this paper, empirical convergence rates for El and IAGO are compared when an additive noise corrupts the result of an evaluation. IAGO appears more efficient than El and various modifications of El designed to deal with noisy evaluations. Keywords. Global optimization; computer simulations; kriging; Gaussian process; noisy evaluations.

  4. Material discovery by combining stochastic surface walking global optimization with a neural network.

    Science.gov (United States)

    Huang, Si-Da; Shang, Cheng; Zhang, Xiao-Jie; Liu, Zhi-Pan

    2017-09-01

    While the underlying potential energy surface (PES) determines the structure and other properties of a material, it has been frustrating to predict new materials from theory even with the advent of supercomputing facilities. The accuracy of the PES and the efficiency of PES sampling are two major bottlenecks, not least because of the great complexity of the material PES. This work introduces a "Global-to-Global" approach for material discovery by combining for the first time a global optimization method with neural network (NN) techniques. The novel global optimization method, named the stochastic surface walking (SSW) method, is carried out massively in parallel for generating a global training data set, the fitting of which by the atom-centered NN produces a multi-dimensional global PES; the subsequent SSW exploration of large systems with the analytical NN PES can provide key information on the thermodynamics and kinetics stability of unknown phases identified from global PESs. We describe in detail the current implementation of the SSW-NN method with particular focuses on the size of the global data set and the simultaneous energy/force/stress NN training procedure. An important functional material, TiO 2 , is utilized as an example to demonstrate the automated global data set generation, the improved NN training procedure and the application in material discovery. Two new TiO 2 porous crystal structures are identified, which have similar thermodynamics stability to the common TiO 2 rutile phase and the kinetics stability for one of them is further proved from SSW pathway sampling. As a general tool for material simulation, the SSW-NN method provides an efficient and predictive platform for large-scale computational material screening.

  5. Hybrid surrogate-model-based multi-fidelity efficient global optimization applied to helicopter blade design

    Science.gov (United States)

    Ariyarit, Atthaphon; Sugiura, Masahiko; Tanabe, Yasutada; Kanazaki, Masahiro

    2018-06-01

    A multi-fidelity optimization technique by an efficient global optimization process using a hybrid surrogate model is investigated for solving real-world design problems. The model constructs the local deviation using the kriging method and the global model using a radial basis function. The expected improvement is computed to decide additional samples that can improve the model. The approach was first investigated by solving mathematical test problems. The results were compared with optimization results from an ordinary kriging method and a co-kriging method, and the proposed method produced the best solution. The proposed method was also applied to aerodynamic design optimization of helicopter blades to obtain the maximum blade efficiency. The optimal shape obtained by the proposed method achieved performance almost equivalent to that obtained using the high-fidelity, evaluation-based single-fidelity optimization. Comparing all three methods, the proposed method required the lowest total number of high-fidelity evaluation runs to obtain a converged solution.

  6. Calibration of an agricultural-hydrological model (RZWQM2) using surrogate global optimization

    Science.gov (United States)

    Xi, Maolong; Lu, Dan; Gui, Dongwei; Qi, Zhiming; Zhang, Guannan

    2017-01-01

    Robust calibration of an agricultural-hydrological model is critical for simulating crop yield and water quality and making reasonable agricultural management. However, calibration of the agricultural-hydrological system models is challenging because of model complexity, the existence of strong parameter correlation, and significant computational requirements. Therefore, only a limited number of simulations can be allowed in any attempt to find a near-optimal solution within an affordable time, which greatly restricts the successful application of the model. The goal of this study is to locate the optimal solution of the Root Zone Water Quality Model (RZWQM2) given a limited simulation time, so as to improve the model simulation and help make rational and effective agricultural-hydrological decisions. To this end, we propose a computationally efficient global optimization procedure using sparse-grid based surrogates. We first used advanced sparse grid (SG) interpolation to construct a surrogate system of the actual RZWQM2, and then we calibrate the surrogate model using the global optimization algorithm, Quantum-behaved Particle Swarm Optimization (QPSO). As the surrogate model is a polynomial with fast evaluation, it can be efficiently evaluated with a sufficiently large number of times during the optimization, which facilitates the global search. We calibrate seven model parameters against five years of yield, drain flow, and NO3-N loss data from a subsurface-drained corn-soybean field in Iowa. Results indicate that an accurate surrogate model can be created for the RZWQM2 with a relatively small number of SG points (i.e., RZWQM2 runs). Compared to the conventional QPSO algorithm, our surrogate-based optimization method can achieve a smaller objective function value and better calibration performance using a fewer number of expensive RZWQM2 executions, which greatly improves computational efficiency.

  7. Statistical distributions of optimal global alignment scores of random protein sequences

    Directory of Open Access Journals (Sweden)

    Tang Jiaowei

    2005-10-01

    Full Text Available Abstract Background The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function underlying the optimal global alignments has not been completely determined. Results In this study, random and real but unrelated sequences prepared in six different ways were selected as reference datasets to obtain their respective statistical distributions of global alignment scores. All alignments were carried out with the Needleman-Wunsch algorithm and optimal scores were fitted to the Gumbel, normal and gamma distributions respectively. The three-parameter gamma distribution performs the best as the theoretical distribution function of global alignment scores, as it agrees perfectly well with the distribution of alignment scores. The normal distribution also agrees well with the score distribution frequencies when the shape parameter of the gamma distribution is sufficiently large, for this is the scenario when the normal distribution can be viewed as an approximation of the gamma distribution. Conclusion We have shown that the optimal global alignment scores of random protein sequences fit the three-parameter gamma distribution function. This would be useful for the inference of homology between sequences whose relationship is unknown, through the evaluation of gamma distribution significance between sequences.

  8. A Local and Global Search Combined Particle Swarm Optimization Algorithm and Its Convergence Analysis

    Directory of Open Access Journals (Sweden)

    Weitian Lin

    2014-01-01

    Full Text Available Particle swarm optimization algorithm (PSOA is an advantage optimization tool. However, it has a tendency to get stuck in a near optimal solution especially for middle and large size problems and it is difficult to improve solution accuracy by fine-tuning parameters. According to the insufficiency, this paper researches the local and global search combine particle swarm algorithm (LGSCPSOA, and its convergence and obtains its convergence qualification. At the same time, it is tested with a set of 8 benchmark continuous functions and compared their optimization results with original particle swarm algorithm (OPSOA. Experimental results indicate that the LGSCPSOA improves the search performance especially on the middle and large size benchmark functions significantly.

  9. Statistical surrogate model based sampling criterion for stochastic global optimization of problems with constraints

    Energy Technology Data Exchange (ETDEWEB)

    Cho, Su Gil; Jang, Jun Yong; Kim, Ji Hoon; Lee, Tae Hee [Hanyang University, Seoul (Korea, Republic of); Lee, Min Uk [Romax Technology Ltd., Seoul (Korea, Republic of); Choi, Jong Su; Hong, Sup [Korea Research Institute of Ships and Ocean Engineering, Daejeon (Korea, Republic of)

    2015-04-15

    Sequential surrogate model-based global optimization algorithms, such as super-EGO, have been developed to increase the efficiency of commonly used global optimization technique as well as to ensure the accuracy of optimization. However, earlier studies have drawbacks because there are three phases in the optimization loop and empirical parameters. We propose a united sampling criterion to simplify the algorithm and to achieve the global optimum of problems with constraints without any empirical parameters. It is able to select the points located in a feasible region with high model uncertainty as well as the points along the boundary of constraint at the lowest objective value. The mean squared error determines which criterion is more dominant among the infill sampling criterion and boundary sampling criterion. Also, the method guarantees the accuracy of the surrogate model because the sample points are not located within extremely small regions like super-EGO. The performance of the proposed method, such as the solvability of a problem, convergence properties, and efficiency, are validated through nonlinear numerical examples with disconnected feasible regions.

  10. Global optimization driven by genetic algorithms for disruption predictors based on APODIS architecture

    Energy Technology Data Exchange (ETDEWEB)

    Rattá, G.A., E-mail: giuseppe.ratta@ciemat.es [Laboratorio Nacional de Fusión, CIEMAT, Madrid (Spain); Vega, J. [Laboratorio Nacional de Fusión, CIEMAT, Madrid (Spain); Murari, A. [Consorzio RFX, Associazione EURATOM/ENEA per la Fusione, Padua (Italy); Dormido-Canto, S. [Dpto. de Informática y Automática, Universidad Nacional de Educación a Distancia, Madrid (Spain); Moreno, R. [Laboratorio Nacional de Fusión, CIEMAT, Madrid (Spain)

    2016-11-15

    Highlights: • A global optimization method based on genetic algorithms was developed. • It allowed improving the prediction of disruptions using APODIS architecture. • It also provides the potential opportunity to develop a spectrum of future predictors using different training datasets. • The future analysis of how their structures reassemble and evolve in each test may help to improve the development of disruption predictors for ITER. - Abstract: Since year 2010, the APODIS architecture has proven its accuracy predicting disruptions in JET tokamak. Nevertheless, it has shown margins for improvements, fact indisputable after the enhanced performances achieved in posterior upgrades. In this article, a complete optimization driven by Genetic Algorithms (GA) is applied to it aiming at considering all possible combination of signals, signal features, quantity of models, their characteristics and internal parameters. This global optimization targets the creation of the best possible system with a reduced amount of required training data. The results harbor no doubts about the reliability of the global optimization method, allowing to outperform the ones of previous versions: 91.77% of predictions (89.24% with an anticipation higher than 10 ms) with a 3.55% of false alarms. Beyond its effectiveness, it also provides the potential opportunity to develop a spectrum of future predictors using different training datasets.

  11. Global optimization driven by genetic algorithms for disruption predictors based on APODIS architecture

    International Nuclear Information System (INIS)

    Rattá, G.A.; Vega, J.; Murari, A.; Dormido-Canto, S.; Moreno, R.

    2016-01-01

    Highlights: • A global optimization method based on genetic algorithms was developed. • It allowed improving the prediction of disruptions using APODIS architecture. • It also provides the potential opportunity to develop a spectrum of future predictors using different training datasets. • The future analysis of how their structures reassemble and evolve in each test may help to improve the development of disruption predictors for ITER. - Abstract: Since year 2010, the APODIS architecture has proven its accuracy predicting disruptions in JET tokamak. Nevertheless, it has shown margins for improvements, fact indisputable after the enhanced performances achieved in posterior upgrades. In this article, a complete optimization driven by Genetic Algorithms (GA) is applied to it aiming at considering all possible combination of signals, signal features, quantity of models, their characteristics and internal parameters. This global optimization targets the creation of the best possible system with a reduced amount of required training data. The results harbor no doubts about the reliability of the global optimization method, allowing to outperform the ones of previous versions: 91.77% of predictions (89.24% with an anticipation higher than 10 ms) with a 3.55% of false alarms. Beyond its effectiveness, it also provides the potential opportunity to develop a spectrum of future predictors using different training datasets.

  12. A new global particle swarm optimization for the economic emission dispatch with or without transmission losses

    International Nuclear Information System (INIS)

    Zou, Dexuan; Li, Steven; Li, Zongyan; Kong, Xiangyong

    2017-01-01

    Highlights: • A new global particle swarm optimization (NGPSO) is proposed. • NGPSO has strong convergence and desirable accuracy. • NGPSO is used to handle the economic emission dispatch with or without transmission losses. • The equality constraint can be satisfied by solving a quadratic equation. • The inequality constraints can be satisfied by using penalty function method. - Abstract: A new global particle swarm optimization (NGPSO) algorithm is proposed to solve the economic emission dispatch (EED) problems in this paper. NGPSO is different from the traditional particle swarm optimization (PSO) algorithm in two aspects. First, NGPSO uses a new position updating equation which relies on the global best particle to guide the searching activities of all particles. Second, it uses the randomization based on the uniform distribution to slightly disturb the flight trajectories of particles during the late evolutionary process. The two steps enable NGPSO to effectively execute a number of global searches, and thus they increase the chance of exploring promising solution space, and reduce the probabilities of getting trapped into local optima for all particles. On the other hand, the two objective functions of EED are normalized separately according to all candidate solutions, and then they are incorporated into one single objective function. The transformation steps are very helpful in eliminating the difference caused by the different dimensions of the two functions, and thus they strike a balance between the fuel cost and emission. In addition, a simple and common penalty function method is employed to facilitate the satisfactions of EED’s constraints. Based on these improvements in PSO, objective functions and constraints handling, high-quality solutions can be obtained for EED problems. Five examples are chosen to testify the performance of three improved PSOs on solving EED problems with or without transmission losses. Experimental results show that

  13. SGO: A fast engine for ab initio atomic structure global optimization by differential evolution

    Science.gov (United States)

    Chen, Zhanghui; Jia, Weile; Jiang, Xiangwei; Li, Shu-Shen; Wang, Lin-Wang

    2017-10-01

    As the high throughout calculations and material genome approaches become more and more popular in material science, the search for optimal ways to predict atomic global minimum structure is a high research priority. This paper presents a fast method for global search of atomic structures at ab initio level. The structures global optimization (SGO) engine consists of a high-efficiency differential evolution algorithm, accelerated local relaxation methods and a plane-wave density functional theory code running on GPU machines. The purpose is to show what can be achieved by combining the superior algorithms at the different levels of the searching scheme. SGO can search the global-minimum configurations of crystals, two-dimensional materials and quantum clusters without prior symmetry restriction in a relatively short time (half or several hours for systems with less than 25 atoms), thus making such a task a routine calculation. Comparisons with other existing methods such as minima hopping and genetic algorithm are provided. One motivation of our study is to investigate the properties of magnetic systems in different phases. The SGO engine is capable of surveying the local minima surrounding the global minimum, which provides the information for the overall energy landscape of a given system. Using this capability we have found several new configurations for testing systems, explored their energy landscape, and demonstrated that the magnetic moment of metal clusters fluctuates strongly in different local minima.

  14. Efficient algorithms for multidimensional global optimization in genetic mapping of complex traits

    Directory of Open Access Journals (Sweden)

    Kajsa Ljungberg

    2010-10-01

    Full Text Available Kajsa Ljungberg1, Kateryna Mishchenko2, Sverker Holmgren11Division of Scientific Computing, Department of Information Technology, Uppsala University, Uppsala, Sweden; 2Department of Mathematics and Physics, Mälardalen University College, Västerås, SwedenAbstract: We present a two-phase strategy for optimizing a multidimensional, nonconvex function arising during genetic mapping of quantitative traits. Such traits are believed to be affected by multiple so called QTL, and searching for d QTL results in a d-dimensional optimization problem with a large number of local optima. We combine the global algorithm DIRECT with a number of local optimization methods that accelerate the final convergence, and adapt the algorithms to problem-specific features. We also improve the evaluation of the QTL mapping objective function to enable exploitation of the smoothness properties of the optimization landscape. Our best two-phase method is demonstrated to be accurate in at least six dimensions and up to ten times faster than currently used QTL mapping algorithms.Keywords: global optimization, QTL mapping, DIRECT 

  15. Stepwise optimization and global chaos of nonlinear parameters in exact calculations of few-particle systems

    International Nuclear Information System (INIS)

    Frolov, A.M.

    1986-01-01

    The problem of exact variational calculations of few-particle systems in the exponential basis of the relative coordinates using nonlinear parameters is studied. The techniques of stepwise optimization and global chaos of nonlinear parameters are used to calculate the S and P states of homonuclear muonic molecules with an error of no more than +0.001 eV. The global-chaos technique also has proved to be successful in the case of the nuclear systems 3 H and 3 He

  16. Global optimization of discrete truss topology design problems using a parallel cut-and-branch method

    DEFF Research Database (Denmark)

    Rasmussen, Marie-Louise Højlund; Stolpe, Mathias

    2008-01-01

    the physics, and the cuts (Combinatorial Benders’ and projected Chvátal–Gomory) come from an understanding of the particular mathematical structure of the reformulation. The impact of a stronger representation is investigated on several truss topology optimization problems in two and three dimensions.......The subject of this article is solving discrete truss topology optimization problems with local stress and displacement constraints to global optimum. We consider a formulation based on the Simultaneous ANalysis and Design (SAND) approach. This intrinsically non-convex problem is reformulated...

  17. Fourier transform NMR

    International Nuclear Information System (INIS)

    Hallenga, K.

    1991-01-01

    This paper discusses the concept of Fourier transformation one of the many precious legacies of the French mathematician Jean Baptiste Joseph Fourier, essential for understanding the link between continuous-wave (CW) and Fourier transform (FT) NMR. Although in modern FT NMR the methods used to obtain a frequency spectrum from the time-domain signal may vary greatly, from the efficient Cooley-Tukey algorithm to very elaborate iterative least-square methods based other maximum entropy method or on linear prediction, the principles for Fourier transformation are unchanged and give invaluable insight into the interconnection of many pairs of physical entities called Fourier pairs

  18. Principles of Fourier analysis

    CERN Document Server

    Howell, Kenneth B

    2001-01-01

    Fourier analysis is one of the most useful and widely employed sets of tools for the engineer, the scientist, and the applied mathematician. As such, students and practitioners in these disciplines need a practical and mathematically solid introduction to its principles. They need straightforward verifications of its results and formulas, and they need clear indications of the limitations of those results and formulas.Principles of Fourier Analysis furnishes all this and more. It provides a comprehensive overview of the mathematical theory of Fourier analysis, including the development of Fourier series, "classical" Fourier transforms, generalized Fourier transforms and analysis, and the discrete theory. Much of the author''s development is strikingly different from typical presentations. His approach to defining the classical Fourier transform results in a much cleaner, more coherent theory that leads naturally to a starting point for the generalized theory. He also introduces a new generalized theory based ...

  19. External costs in the global energy optimization models. A tool in favour of sustain ability

    International Nuclear Information System (INIS)

    Cabal Cuesta, H.

    2007-01-01

    The aim of this work is the analysis of the effects of the GHG external costs internalization in the energy systems. This may provide a useful tool to support decision makers to help reaching the energy systems sustain ability. External costs internalization has been carried out using two methods. First, CO 2 externalities of different power generation technologies have been internalized to evaluate their effects on the economic competitiveness of these present and future technologies. The other method consisted of analysing and optimizing the global energy system, from an economic and environmental point of view, using the global energy optimization model generator, TIMES, with a time horizon of 50 years. Finally, some scenarios regarding environmental and economic strategic measures have been analysed. (Author)

  20. Memetic Algorithms to Solve a Global Nonlinear Optimization Problem. A Review

    Directory of Open Access Journals (Sweden)

    M. K. Sakharov

    2015-01-01

    Full Text Available In recent decades, evolutionary algorithms have proven themselves as the powerful optimization techniques of search engine. Their popularity is due to the fact that they are easy to implement and can be used in all areas, since they are based on the idea of universal evolution. For example, in the problems of a large number of local optima, the traditional optimization methods, usually, fail in finding the global optimum. To solve such problems using a variety of stochastic methods, in particular, the so-called population-based algorithms, which are a kind of evolutionary methods. The main disadvantage of this class of methods is their slow convergence to the exact solution in the neighborhood of the global optimum, as these methods incapable to use the local information about the landscape of the function. This often limits their use in largescale real-world problems where the computation time is a critical factor.One of the promising directions in the field of modern evolutionary computation are memetic algorithms, which can be regarded as a combination of population search of the global optimum and local procedures for verifying solutions, which gives a synergistic effect. In the context of memetic algorithms, the meme is an implementation of the local optimization method to refine solution in the search.The concept of memetic algorithms provides ample opportunities for the development of various modifications of these algorithms, which can vary the frequency of the local search, the conditions of its end, and so on. The practically significant memetic algorithm modifications involve the simultaneous use of different memes. Such algorithms are called multi-memetic.The paper gives statement of the global problem of nonlinear unconstrained optimization, describes the most promising areas of AI modifications, including hybridization and metaoptimization. The main content of the work is the classification and review of existing varieties of

  1. Global optimization of proteins using a dynamical lattice model: Ground states and energy landscapes

    OpenAIRE

    Dressel, F.; Kobe, S.

    2004-01-01

    A simple approach is proposed to investigate the protein structure. Using a low complexity model, a simple pairwise interaction and the concept of global optimization, we are able to calculate ground states of proteins, which are in agreement with experimental data. All possible model structures of small proteins are available below a certain energy threshold. The exact lowenergy landscapes for the trp cage protein (1L2Y) is presented showing the connectivity of all states and energy barriers.

  2. Global optimization of truss topology with discrete bar areas-Part II: Implementation and numerical results

    DEFF Research Database (Denmark)

    Achtziger, Wolfgang; Stolpe, Mathias

    2009-01-01

    we use the theory developed in Part I to design a convergent nonlinear branch-and-bound method tailored to solve large-scale instances of the original discrete problem. The problem formulation and the needed theoretical results from Part I are repeated such that this paper is self-contained. We focus...... the largest discrete topology design problems solved by means of global optimization....

  3. Fast Gaussian kernel learning for classification tasks based on specially structured global optimization.

    Science.gov (United States)

    Zhong, Shangping; Chen, Tianshun; He, Fengying; Niu, Yuzhen

    2014-09-01

    For a practical pattern classification task solved by kernel methods, the computing time is mainly spent on kernel learning (or training). However, the current kernel learning approaches are based on local optimization techniques, and hard to have good time performances, especially for large datasets. Thus the existing algorithms cannot be easily extended to large-scale tasks. In this paper, we present a fast Gaussian kernel learning method by solving a specially structured global optimization (SSGO) problem. We optimize the Gaussian kernel function by using the formulated kernel target alignment criterion, which is a difference of increasing (d.i.) functions. Through using a power-transformation based convexification method, the objective criterion can be represented as a difference of convex (d.c.) functions with a fixed power-transformation parameter. And the objective programming problem can then be converted to a SSGO problem: globally minimizing a concave function over a convex set. The SSGO problem is classical and has good solvability. Thus, to find the global optimal solution efficiently, we can adopt the improved Hoffman's outer approximation method, which need not repeat the searching procedure with different starting points to locate the best local minimum. Also, the proposed method can be proven to converge to the global solution for any classification task. We evaluate the proposed method on twenty benchmark datasets, and compare it with four other Gaussian kernel learning methods. Experimental results show that the proposed method stably achieves both good time-efficiency performance and good classification performance. Copyright © 2014 Elsevier Ltd. All rights reserved.

  4. Ringed Seal Search for Global Optimization via a Sensitive Search Model.

    Directory of Open Access Journals (Sweden)

    Younes Saadi

    Full Text Available The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive and exploitation (intensive of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be

  5. Sequential Optimization of Global Sequence Alignments Relative to Different Cost Functions

    KAUST Repository

    Odat, Enas M.

    2011-05-01

    The purpose of this dissertation is to present a methodology to model global sequence alignment problem as directed acyclic graph which helps to extract all possible optimal alignments. Moreover, a mechanism to sequentially optimize sequence alignment problem relative to different cost functions is suggested. Sequence alignment is mostly important in computational biology. It is used to find evolutionary relationships between biological sequences. There are many algo- rithms that have been developed to solve this problem. The most famous algorithms are Needleman-Wunsch and Smith-Waterman that are based on dynamic program- ming. In dynamic programming, problem is divided into a set of overlapping sub- problems and then the solution of each subproblem is found. Finally, the solutions to these subproblems are combined into a final solution. In this thesis it has been proved that for two sequences of length m and n over a fixed alphabet, the suggested optimization procedure requires O(mn) arithmetic operations per cost function on a single processor machine. The algorithm has been simulated using C#.Net programming language and a number of experiments have been done to verify the proved statements. The results of these experiments show that the number of optimal alignments is reduced after each step of optimization. Furthermore, it has been verified that as the sequence length increased linearly then the number of optimal alignments increased exponentially which also depends on the cost function that is used. Finally, the number of executed operations increases polynomially as the sequence length increase linearly.

  6. Economic optimization of a global strategy to address the pandemic threat.

    Science.gov (United States)

    Pike, Jamison; Bogich, Tiffany; Elwood, Sarah; Finnoff, David C; Daszak, Peter

    2014-12-30

    Emerging pandemics threaten global health and economies and are increasing in frequency. Globally coordinated strategies to combat pandemics, similar to current strategies that address climate change, are largely adaptive, in that they attempt to reduce the impact of a pathogen after it has emerged. However, like climate change, mitigation strategies have been developed that include programs to reduce the underlying drivers of pandemics, particularly animal-to-human disease transmission. Here, we use real options economic modeling of current globally coordinated adaptation strategies for pandemic prevention. We show that they would be optimally implemented within 27 y to reduce the annual rise of emerging infectious disease events by 50% at an estimated one-time cost of approximately $343.7 billion. We then analyze World Bank data on multilateral "One Health" pandemic mitigation programs. We find that, because most pandemics have animal origins, mitigation is a more cost-effective policy than business-as-usual adaptation programs, saving between $344.0.7 billion and $360.3 billion over the next 100 y if implemented today. We conclude that globally coordinated pandemic prevention policies need to be enacted urgently to be optimally effective and that strategies to mitigate pandemics by reducing the impact of their underlying drivers are likely to be more effective than business as usual.

  7. Economic optimization of a global strategy to address the pandemic threat

    Science.gov (United States)

    Pike, Jamison; Bogich, Tiffany; Elwood, Sarah; Finnoff, David C.; Daszak, Peter

    2014-01-01

    Emerging pandemics threaten global health and economies and are increasing in frequency. Globally coordinated strategies to combat pandemics, similar to current strategies that address climate change, are largely adaptive, in that they attempt to reduce the impact of a pathogen after it has emerged. However, like climate change, mitigation strategies have been developed that include programs to reduce the underlying drivers of pandemics, particularly animal-to-human disease transmission. Here, we use real options economic modeling of current globally coordinated adaptation strategies for pandemic prevention. We show that they would be optimally implemented within 27 y to reduce the annual rise of emerging infectious disease events by 50% at an estimated one-time cost of approximately $343.7 billion. We then analyze World Bank data on multilateral “One Health” pandemic mitigation programs. We find that, because most pandemics have animal origins, mitigation is a more cost-effective policy than business-as-usual adaptation programs, saving between $344.0.7 billion and $360.3 billion over the next 100 y if implemented today. We conclude that globally coordinated pandemic prevention policies need to be enacted urgently to be optimally effective and that strategies to mitigate pandemics by reducing the impact of their underlying drivers are likely to be more effective than business as usual. PMID:25512538

  8. SU-E-J-130: Automating Liver Segmentation Via Combined Global and Local Optimization

    Energy Technology Data Exchange (ETDEWEB)

    Li, Dengwang; Wang, Jie [College of Physics and Electronics, Shandong Normal University, Jinan, Shandong (China); Kapp, Daniel S.; Xing, Lei [Department of Radiation Oncology, Stanford University School of Medicine, Stanford, CA (United States)

    2015-06-15

    Purpose: The aim of this work is to develop a robust algorithm for accurate segmentation of liver with special attention paid to the problems with fuzzy edges and tumor. Methods: 200 CT images were collected from radiotherapy treatment planning system. 150 datasets are selected as the panel data for shape dictionary and parameters estimation. The remaining 50 datasets were used as test images. In our study liver segmentation was formulated as optimization process of implicit function. The liver region was optimized via local and global optimization during iterations. Our method consists five steps: 1)The livers from the panel data were segmented manually by physicians, and then We estimated the parameters of GMM (Gaussian mixture model) and MRF (Markov random field). Shape dictionary was built by utilizing the 3D liver shapes. 2)The outlines of chest and abdomen were located according to rib structure in the input images, and the liver region was initialized based on GMM. 3)The liver shape for each 2D slice was adjusted using MRF within the neighborhood of liver edge for local optimization. 4)The 3D liver shape was corrected by employing SSR (sparse shape representation) based on liver shape dictionary for global optimization. Furthermore, H-PSO(Hybrid Particle Swarm Optimization) was employed to solve the SSR equation. 5)The corrected 3D liver was divided into 2D slices as input data of the third step. The iteration was repeated within the local optimization and global optimization until it satisfied the suspension conditions (maximum iterations and changing rate). Results: The experiments indicated that our method performed well even for the CT images with fuzzy edge and tumors. Comparing with physician delineated results, the segmentation accuracy with the 50 test datasets (VOE, volume overlap percentage) was on average 91%–95%. Conclusion: The proposed automatic segmentation method provides a sensible technique for segmentation of CT images. This work is

  9. SU-E-J-130: Automating Liver Segmentation Via Combined Global and Local Optimization

    International Nuclear Information System (INIS)

    Li, Dengwang; Wang, Jie; Kapp, Daniel S.; Xing, Lei

    2015-01-01

    Purpose: The aim of this work is to develop a robust algorithm for accurate segmentation of liver with special attention paid to the problems with fuzzy edges and tumor. Methods: 200 CT images were collected from radiotherapy treatment planning system. 150 datasets are selected as the panel data for shape dictionary and parameters estimation. The remaining 50 datasets were used as test images. In our study liver segmentation was formulated as optimization process of implicit function. The liver region was optimized via local and global optimization during iterations. Our method consists five steps: 1)The livers from the panel data were segmented manually by physicians, and then We estimated the parameters of GMM (Gaussian mixture model) and MRF (Markov random field). Shape dictionary was built by utilizing the 3D liver shapes. 2)The outlines of chest and abdomen were located according to rib structure in the input images, and the liver region was initialized based on GMM. 3)The liver shape for each 2D slice was adjusted using MRF within the neighborhood of liver edge for local optimization. 4)The 3D liver shape was corrected by employing SSR (sparse shape representation) based on liver shape dictionary for global optimization. Furthermore, H-PSO(Hybrid Particle Swarm Optimization) was employed to solve the SSR equation. 5)The corrected 3D liver was divided into 2D slices as input data of the third step. The iteration was repeated within the local optimization and global optimization until it satisfied the suspension conditions (maximum iterations and changing rate). Results: The experiments indicated that our method performed well even for the CT images with fuzzy edge and tumors. Comparing with physician delineated results, the segmentation accuracy with the 50 test datasets (VOE, volume overlap percentage) was on average 91%–95%. Conclusion: The proposed automatic segmentation method provides a sensible technique for segmentation of CT images. This work is

  10. Inversion of self-potential anomalies caused by simple-geometry bodies using global optimization algorithms

    International Nuclear Information System (INIS)

    Göktürkler, G; Balkaya, Ç

    2012-01-01

    Three naturally inspired meta-heuristic algorithms—the genetic algorithm (GA), simulated annealing (SA) and particle swarm optimization (PSO)—were used to invert some of the self-potential (SP) anomalies originated by some polarized bodies with simple geometries. Both synthetic and field data sets were considered. The tests with the synthetic data comprised of the solutions with both noise-free and noisy data; in the tests with the field data some SP anomalies observed over a copper belt (India), graphite deposits (Germany) and metallic sulfide (Turkey) were inverted. The model parameters included the electric dipole moment, polarization angle, depth, shape factor and origin of the anomaly. The estimated parameters were compared with those from previous studies using various optimization algorithms, mainly least-squares approaches, on the same data sets. During the test studies the solutions by GA, PSO and SA were characterized as being consistent with each other; a good starting model was not a requirement to reach the global minimum. It can be concluded that the global optimization algorithms considered in this study were able to yield compatible solutions with those from widely used local optimization algorithms. (paper)

  11. Annealing evolutionary stochastic approximation Monte Carlo for global optimization

    KAUST Repository

    Liang, Faming

    2010-04-08

    In this paper, we propose a new algorithm, the so-called annealing evolutionary stochastic approximation Monte Carlo (AESAMC) algorithm as a general optimization technique, and study its convergence. AESAMC possesses a self-adjusting mechanism, whose target distribution can be adapted at each iteration according to the current samples. Thus, AESAMC falls into the class of adaptive Monte Carlo methods. This mechanism also makes AESAMC less trapped by local energy minima than nonadaptive MCMC algorithms. Under mild conditions, we show that AESAMC can converge weakly toward a neighboring set of global minima in the space of energy. AESAMC is tested on multiple optimization problems. The numerical results indicate that AESAMC can potentially outperform simulated annealing, the genetic algorithm, annealing stochastic approximation Monte Carlo, and some other metaheuristics in function optimization. © 2010 Springer Science+Business Media, LLC.

  12. Global optimization methods for the aerodynamic shape design of transonic cascades

    International Nuclear Information System (INIS)

    Mengistu, T.; Ghaly, W.

    2003-01-01

    Two global optimization algorithms, namely Genetic Algorithm (GA) and Simulated Annealing (SA), have been applied to the aerodynamic shape optimization of transonic cascades; the objective being the redesign of an existing turbomachine airfoil to improve its performance by minimizing the total pressure loss while satisfying a number of constraints. This is accomplished by modifying the blade camber line; keeping the same blade thickness distribution, mass flow rate and the same flow turning. The objective is calculated based on an Euler solver and the blade camber line is represented with non-uniform rational B-splines (NURBS). The SA and GA methods were first assessed for known test functions and their performance in optimizing the blade shape for minimum loss is then demonstrated on a transonic turbine cascade where it is shown to produce a significant reduction in total pressure loss by eliminating the passage shock. (author)

  13. A global carbon assimilation system based on a dual optimization method

    Science.gov (United States)

    Zheng, H.; Li, Y.; Chen, J. M.; Wang, T.; Huang, Q.; Huang, W. X.; Wang, L. H.; Li, S. M.; Yuan, W. P.; Zheng, X.; Zhang, S. P.; Chen, Z. Q.; Jiang, F.

    2015-02-01

    Ecological models are effective tools for simulating the distribution of global carbon sources and sinks. However, these models often suffer from substantial biases due to inaccurate simulations of complex ecological processes. We introduce a set of scaling factors (parameters) to an ecological model on the basis of plant functional type (PFT) and latitudes. A global carbon assimilation system (GCAS-DOM) is developed by employing a dual optimization method (DOM) to invert the time-dependent ecological model parameter state and the net carbon flux state simultaneously. We use GCAS-DOM to estimate the global distribution of the CO2 flux on 1° × 1° grid cells for the period from 2001 to 2007. Results show that land and ocean absorb -3.63 ± 0.50 and -1.82 ± 0.16 Pg C yr-1, respectively. North America, Europe and China contribute -0.98 ± 0.15, -0.42 ± 0.08 and -0.20 ± 0.29 Pg C yr-1, respectively. The uncertainties in the flux after optimization by GCAS-DOM have been remarkably reduced by more than 60%. Through parameter optimization, GCAS-DOM can provide improved estimates of the carbon flux for each PFT. Coniferous forest (-0.97 ± 0.27 Pg C yr-1) is the largest contributor to the global carbon sink. Fluxes of once-dominant deciduous forest generated by the Boreal Ecosystems Productivity Simulator (BEPS) are reduced to -0.78 ± 0.23 Pg C yr-1, the third largest carbon sink.

  14. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...

  15. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities......) and cuts....

  16. Fractional finite Fourier transform.

    Science.gov (United States)

    Khare, Kedar; George, Nicholas

    2004-07-01

    We show that a fractional version of the finite Fourier transform may be defined by using prolate spheroidal wave functions of order zero. The transform is linear and additive in its index and asymptotically goes over to Namias's definition of the fractional Fourier transform. As a special case of this definition, it is shown that the finite Fourier transform may be inverted by using information over a finite range of frequencies in Fourier space, the inversion being sensitive to noise. Numerical illustrations for both forward (fractional) and inverse finite transforms are provided.

  17. Global-Local Analysis and Optimization of a Composite Civil Tilt-Rotor Wing

    Science.gov (United States)

    Rais-Rohani, Masound

    1999-01-01

    This report gives highlights of an investigation on the design and optimization of a thin composite wing box structure for a civil tilt-rotor aircraft. Two different concepts are considered for the cantilever wing: (a) a thin monolithic skin design, and (b) a thick sandwich skin design. Each concept is examined with three different skin ply patterns based on various combinations of 0, +/-45, and 90 degree plies. The global-local technique is used in the analysis and optimization of the six design models. The global analysis is based on a finite element model of the wing-pylon configuration while the local analysis uses a uniformly supported plate representing a wing panel. Design allowables include those on vibration frequencies, panel buckling, and material strength. The design optimization problem is formulated as one of minimizing the structural weight subject to strength, stiffness, and d,vnamic constraints. Six different loading conditions based on three different flight modes are considered in the design optimization. The results of this investigation reveal that of all the loading conditions the one corresponding to the rolling pull-out in the airplane mode is the most stringent. Also the frequency constraints are found to drive the skin thickness limits, rendering the buckling constraints inactive. The optimum skin ply pattern for the monolithic skin concept is found to be (((0/+/-45/90/(0/90)(sub 2))(sub s))(sub s), while for the sandwich skin concept the optimal ply pattern is found to be ((0/+/-45/90)(sub 2s))(sub s).

  18. Optimizing rice yields while minimizing yield-scaled global warming potential.

    Science.gov (United States)

    Pittelkow, Cameron M; Adviento-Borbe, Maria A; van Kessel, Chris; Hill, James E; Linquist, Bruce A

    2014-05-01

    To meet growing global food demand with limited land and reduced environmental impact, agricultural greenhouse gas (GHG) emissions are increasingly evaluated with respect to crop productivity, i.e., on a yield-scaled as opposed to area basis. Here, we compiled available field data on CH4 and N2 O emissions from rice production systems to test the hypothesis that in response to fertilizer nitrogen (N) addition, yield-scaled global warming potential (GWP) will be minimized at N rates that maximize yields. Within each study, yield N surplus was calculated to estimate deficit or excess N application rates with respect to the optimal N rate (defined as the N rate at which maximum yield was achieved). Relationships between yield N surplus and GHG emissions were assessed using linear and nonlinear mixed-effects models. Results indicate that yields increased in response to increasing N surplus when moving from deficit to optimal N rates. At N rates contributing to a yield N surplus, N2 O and yield-scaled N2 O emissions increased exponentially. In contrast, CH4 emissions were not impacted by N inputs. Accordingly, yield-scaled CH4 emissions decreased with N addition. Overall, yield-scaled GWP was minimized at optimal N rates, decreasing by 21% compared to treatments without N addition. These results are unique compared to aerobic cropping systems in which N2 O emissions are the primary contributor to GWP, meaning yield-scaled GWP may not necessarily decrease for aerobic crops when yields are optimized by N fertilizer addition. Balancing gains in agricultural productivity with climate change concerns, this work supports the concept that high rice yields can be achieved with minimal yield-scaled GWP through optimal N application rates. Moreover, additional improvements in N use efficiency may further reduce yield-scaled GWP, thereby strengthening the economic and environmental sustainability of rice systems. © 2013 John Wiley & Sons Ltd.

  19. Comparison of global optimization approaches for robust calibration of hydrologic model parameters

    Science.gov (United States)

    Jung, I. W.

    2015-12-01

    Robustness of the calibrated parameters of hydrologic models is necessary to provide a reliable prediction of future performance of watershed behavior under varying climate conditions. This study investigated calibration performances according to the length of calibration period, objective functions, hydrologic model structures and optimization methods. To do this, the combination of three global optimization methods (i.e. SCE-UA, Micro-GA, and DREAM) and four hydrologic models (i.e. SAC-SMA, GR4J, HBV, and PRMS) was tested with different calibration periods and objective functions. Our results showed that three global optimization methods provided close calibration performances under different calibration periods, objective functions, and hydrologic models. However, using the agreement of index, normalized root mean square error, Nash-Sutcliffe efficiency as the objective function showed better performance than using correlation coefficient and percent bias. Calibration performances according to different calibration periods from one year to seven years were hard to generalize because four hydrologic models have different levels of complexity and different years have different information content of hydrological observation. Acknowledgements This research was supported by a grant (14AWMP-B082564-01) from Advanced Water Management Research Program funded by Ministry of Land, Infrastructure and Transport of Korean government.

  20. QuickVina: accelerating AutoDock Vina using gradient-based heuristics for global optimization.

    Science.gov (United States)

    Handoko, Stephanus Daniel; Ouyang, Xuchang; Su, Chinh Tran To; Kwoh, Chee Keong; Ong, Yew Soon

    2012-01-01

    Predicting binding between macromolecule and small molecule is a crucial phase in the field of rational drug design. AutoDock Vina, one of the most widely used docking software released in 2009, uses an empirical scoring function to evaluate the binding affinity between the molecules and employs the iterated local search global optimizer for global optimization, achieving a significantly improved speed and better accuracy of the binding mode prediction compared its predecessor, AutoDock 4. In this paper, we propose further improvement in the local search algorithm of Vina by heuristically preventing some intermediate points from undergoing local search. Our improved version of Vina-dubbed QVina-achieved a maximum acceleration of about 25 times with the average speed-up of 8.34 times compared to the original Vina when tested on a set of 231 protein-ligand complexes while maintaining the optimal scores mostly identical. Using our heuristics, larger number of different ligands can be quickly screened against a given receptor within the same time frame.

  1. Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule

    KAUST Repository

    Liang, Faming

    2014-04-03

    Simulated annealing has been widely used in the solution of optimization problems. As known by many researchers, the global optima cannot be guaranteed to be located by simulated annealing unless a logarithmic cooling schedule is used. However, the logarithmic cooling schedule is so slow that no one can afford to use this much CPU time. This article proposes a new stochastic optimization algorithm, the so-called simulated stochastic approximation annealing algorithm, which is a combination of simulated annealing and the stochastic approximation Monte Carlo algorithm. Under the framework of stochastic approximation, it is shown that the new algorithm can work with a cooling schedule in which the temperature can decrease much faster than in the logarithmic cooling schedule, for example, a square-root cooling schedule, while guaranteeing the global optima to be reached when the temperature tends to zero. The new algorithm has been tested on a few benchmark optimization problems, including feed-forward neural network training and protein-folding. The numerical results indicate that the new algorithm can significantly outperform simulated annealing and other competitors. Supplementary materials for this article are available online.

  2. Jean Baptiste Joseph Fourier

    Science.gov (United States)

    Sterken, C.

    2003-03-01

    This paper gives a short account of some key elements in the life of Jean Baptiste Joseph Fourier (1768-1830), specifically his relation to Napoleon Bonaparte. The mathematical approach to Fourier series and the original scepticism by French mathematicians are briefly illustrated.

  3. Generalized Fourier transforms classes

    DEFF Research Database (Denmark)

    Berntsen, Svend; Møller, Steen

    2002-01-01

    The Fourier class of integral transforms with kernels $B(\\omega r)$ has by definition inverse transforms with kernel $B(-\\omega r)$. The space of such transforms is explicitly constructed. A slightly more general class of generalized Fourier transforms are introduced. From the general theory...

  4. A Game Theoretic Optimization Method for Energy Efficient Global Connectivity in Hybrid Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    JongHyup Lee

    2016-08-01

    Full Text Available For practical deployment of wireless sensor networks (WSN, WSNs construct clusters, where a sensor node communicates with other nodes in its cluster, and a cluster head support connectivity between the sensor nodes and a sink node. In hybrid WSNs, cluster heads have cellular network interfaces for global connectivity. However, when WSNs are active and the load of cellular networks is high, the optimal assignment of cluster heads to base stations becomes critical. Therefore, in this paper, we propose a game theoretic model to find the optimal assignment of base stations for hybrid WSNs. Since the communication and energy cost is different according to cellular systems, we devise two game models for TDMA/FDMA and CDMA systems employing power prices to adapt to the varying efficiency of recent wireless technologies. The proposed model is defined on the assumptions of the ideal sensing field, but our evaluation shows that the proposed model is more adaptive and energy efficient than local selections.

  5. A Game Theoretic Optimization Method for Energy Efficient Global Connectivity in Hybrid Wireless Sensor Networks

    Science.gov (United States)

    Lee, JongHyup; Pak, Dohyun

    2016-01-01

    For practical deployment of wireless sensor networks (WSN), WSNs construct clusters, where a sensor node communicates with other nodes in its cluster, and a cluster head support connectivity between the sensor nodes and a sink node. In hybrid WSNs, cluster heads have cellular network interfaces for global connectivity. However, when WSNs are active and the load of cellular networks is high, the optimal assignment of cluster heads to base stations becomes critical. Therefore, in this paper, we propose a game theoretic model to find the optimal assignment of base stations for hybrid WSNs. Since the communication and energy cost is different according to cellular systems, we devise two game models for TDMA/FDMA and CDMA systems employing power prices to adapt to the varying efficiency of recent wireless technologies. The proposed model is defined on the assumptions of the ideal sensing field, but our evaluation shows that the proposed model is more adaptive and energy efficient than local selections. PMID:27589743

  6. Research on optimal investment path of transmission corridor under the global energy Internet

    Science.gov (United States)

    Huang, Yuehui; Li, Pai; Wang, Qi; Liu, Jichun; Gao, Han

    2018-02-01

    Under the background of the global energy Internet, the investment planning of transmission corridor from XinJiang to Germany is studied in this article, which passes through four countries: Kazakhstan, Russia, Belarus and Poland. Taking the specific situation of different countries into account, including the length of transmission line, unit construction cost, completion time, transmission price, state tariff, inflation rate and so on, this paper constructed a power transmission investment model. Finally, the dynamic programming method is used to simulate the example, and the optimal strategies under different objective functions are obtained.

  7. Global stability, periodic solutions, and optimal control in a nonlinear differential delay model

    Directory of Open Access Journals (Sweden)

    Anatoli F. Ivanov

    2010-09-01

    Full Text Available A nonlinear differential equation with delay serving as a mathematical model of several applied problems is considered. Sufficient conditions for the global asymptotic stability and for the existence of periodic solutions are given. Two particular applications are treated in detail. The first one is a blood cell production model by Mackey, for which new periodicity criteria are derived. The second application is a modified economic model with delay due to Ramsey. An optimization problem for a maximal consumption is stated and solved for the latter.

  8. Global Convergence of a Spectral Conjugate Gradient Method for Unconstrained Optimization

    Directory of Open Access Journals (Sweden)

    Jinkui Liu

    2012-01-01

    Full Text Available A new nonlinear spectral conjugate descent method for solving unconstrained optimization problems is proposed on the basis of the CD method and the spectral conjugate gradient method. For any line search, the new method satisfies the sufficient descent condition gkTdk<−∥gk∥2. Moreover, we prove that the new method is globally convergent under the strong Wolfe line search. The numerical results show that the new method is more effective for the given test problems from the CUTE test problem library (Bongartz et al., 1995 in contrast to the famous CD method, FR method, and PRP method.

  9. Deterministic global optimization algorithm based on outer approximation for the parameter estimation of nonlinear dynamic biological systems.

    Science.gov (United States)

    Miró, Anton; Pozo, Carlos; Guillén-Gosálbez, Gonzalo; Egea, Jose A; Jiménez, Laureano

    2012-05-10

    The estimation of parameter values for mathematical models of biological systems is an optimization problem that is particularly challenging due to the nonlinearities involved. One major difficulty is the existence of multiple minima in which standard optimization methods may fall during the search. Deterministic global optimization methods overcome this limitation, ensuring convergence to the global optimum within a desired tolerance. Global optimization techniques are usually classified into stochastic and deterministic. The former typically lead to lower CPU times but offer no guarantee of convergence to the global minimum in a finite number of iterations. In contrast, deterministic methods provide solutions of a given quality (i.e., optimality gap), but tend to lead to large computational burdens. This work presents a deterministic outer approximation-based algorithm for the global optimization of dynamic problems arising in the parameter estimation of models of biological systems. Our approach, which offers a theoretical guarantee of convergence to global minimum, is based on reformulating the set of ordinary differential equations into an equivalent set of algebraic equations through the use of orthogonal collocation methods, giving rise to a nonconvex nonlinear programming (NLP) problem. This nonconvex NLP is decomposed into two hierarchical levels: a master mixed-integer linear programming problem (MILP) that provides a rigorous lower bound on the optimal solution, and a reduced-space slave NLP that yields an upper bound. The algorithm iterates between these two levels until a termination criterion is satisfied. The capabilities of our approach were tested in two benchmark problems, in which the performance of our algorithm was compared with that of the commercial global optimization package BARON. The proposed strategy produced near optimal solutions (i.e., within a desired tolerance) in a fraction of the CPU time required by BARON.

  10. OPTIMIZATION OF SPECIFIC FUEL CONSUMPTION OF HYDROGEN IN COMMERCIAL TURBOFANS FOR REDUCING GLOBAL WARMING EFFECTS

    Energy Technology Data Exchange (ETDEWEB)

    T. Hikmet Karakoc; Onder Turan [School of Civil Aviation, Anadolu University, Eskisehir (Turkey)

    2008-09-30

    The main objective of the present study is to perform minimizing specific fuel consumption of a non afterburning high bypass turbofan engine with separate exhaust streams and unmixed flow for reducing global effect. The values of engine design parameters are optimized for maintaining minimum specific fuel consumption of high bypass turbofan engine under different flight conditions, different fuel types and design criteria. The backbones of optimization approach consisted of elitism-based genetic algorithm coupled with real parametric cycle analysis of a turbofan engine. For solving optimization problem a new software program is developed in MATLAB programming language, while objective function is determined for minimizing the specific fuel consumption. The input variables included the compressor pressure ratio ({pi}{sub c}), bypass ratio ({alpha}) and the fuel heating value [h{sub PR}-(kJ/kg)]. Hydrogen was selected as fuel type in real parametric cycle analysis of commercial turbofans. It may be concluded that the software program developed can successfully solve optimization problems at 10{le}{pi}{sub c}{le}20, 2{le}{alpha}{le}10 and h{sub PR} 120,000 with aircraft flight Mach number {le}0.8.

  11. Model-data fusion across ecosystems: from multisite optimizations to global simulations

    Science.gov (United States)

    Kuppel, S.; Peylin, P.; Maignan, F.; Chevallier, F.; Kiely, G.; Montagnani, L.; Cescatti, A.

    2014-11-01

    This study uses a variational data assimilation framework to simultaneously constrain a global ecosystem model with eddy covariance measurements of daily net ecosystem exchange (NEE) and latent heat (LE) fluxes from a large number of sites grouped in seven plant functional types (PFTs). It is an attempt to bridge the gap between the numerous site-specific parameter optimization works found in the literature and the generic parameterization used by most land surface models within each PFT. The present multisite approach allows deriving PFT-generic sets of optimized parameters enhancing the agreement between measured and simulated fluxes at most of the sites considered, with performances often comparable to those of the corresponding site-specific optimizations. Besides reducing the PFT-averaged model-data root-mean-square difference (RMSD) and the associated daily output uncertainty, the optimization improves the simulated CO2 balance at tropical and temperate forests sites. The major site-level NEE adjustments at the seasonal scale are reduced amplitude in C3 grasslands and boreal forests, increased seasonality in temperate evergreen forests, and better model-data phasing in temperate deciduous broadleaf forests. Conversely, the poorer performances in tropical evergreen broadleaf forests points to deficiencies regarding the modelling of phenology and soil water stress for this PFT. An evaluation with data-oriented estimates of photosynthesis (GPP - gross primary productivity) and ecosystem respiration (Reco) rates indicates distinctively improved simulations of both gross fluxes. The multisite parameter sets are then tested against CO2 concentrations measured at 53 locations around the globe, showing significant adjustments of the modelled seasonality of atmospheric CO2 concentration, whose relevance seems PFT-dependent, along with an improved interannual variability. Lastly, a global-scale evaluation with remote sensing NDVI (normalized difference vegetation index

  12. The Multipoint Global Shape Optimization of Flying Configuration with Movable Leading Edges Flaps

    Directory of Open Access Journals (Sweden)

    Adriana NASTASE

    2012-12-01

    Full Text Available The aerodynamical global optimized (GO shape of flying configuration (FC, at two cruising Mach numbers, can be realized by morphing. Movable leading edge flaps are used for this purpose. The equations of the surfaces of the wing, of the fuselage and of the flaps in stretched position are approximated in form of superpositions of homogeneous polynomes in two variables with free coefficients. These coefficients together with the similarity parameters of the planform of the FC are the free parameters of the global optimization. Two enlarged variational problems with free boundaries occur. The first one consists in the determination of the GO shape of the wing-fuselageFC, with the flaps in retracted position, which must be of minimum drag, at higher cruising Mach number. The second enlarged variational problem consists in the determination of the GO shape of the flaps in stretched position in such a manner that the entire FC shall be of minimum drag at the second lower Mach number. The iterative optimum-optimorum (OO theory of the author is used for the solving of these both enlarged variational problems. The inviscid GO shape of the FC is used only in the first step of iteration and the own developed hybrid solutions for the compressible Navier-Stokes partial-differential equations (PDEs are used for the determination of the friction drag coefficient and up the second step of iteration of OO theory.

  13. An efficient global energy optimization approach for robust 3D plane segmentation of point clouds

    Science.gov (United States)

    Dong, Zhen; Yang, Bisheng; Hu, Pingbo; Scherer, Sebastian

    2018-03-01

    Automatic 3D plane segmentation is necessary for many applications including point cloud registration, building information model (BIM) reconstruction, simultaneous localization and mapping (SLAM), and point cloud compression. However, most of the existing 3D plane segmentation methods still suffer from low precision and recall, and inaccurate and incomplete boundaries, especially for low-quality point clouds collected by RGB-D sensors. To overcome these challenges, this paper formulates the plane segmentation problem as a global energy optimization because it is robust to high levels of noise and clutter. First, the proposed method divides the raw point cloud into multiscale supervoxels, and considers planar supervoxels and individual points corresponding to nonplanar supervoxels as basic units. Then, an efficient hybrid region growing algorithm is utilized to generate initial plane set by incrementally merging adjacent basic units with similar features. Next, the initial plane set is further enriched and refined in a mutually reinforcing manner under the framework of global energy optimization. Finally, the performances of the proposed method are evaluated with respect to six metrics (i.e., plane precision, plane recall, under-segmentation rate, over-segmentation rate, boundary precision, and boundary recall) on two benchmark datasets. Comprehensive experiments demonstrate that the proposed method obtained good performances both in high-quality TLS point clouds (i.e., http://SEMANTIC3D.NET)

  14. Protein structure modeling for CASP10 by multiple layers of global optimization.

    Science.gov (United States)

    Joo, Keehyoung; Lee, Juyong; Sim, Sangjin; Lee, Sun Young; Lee, Kiho; Heo, Seungryong; Lee, In-Ho; Lee, Sung Jong; Lee, Jooyoung

    2014-02-01

    In the template-based modeling (TBM) category of CASP10 experiment, we introduced a new protocol called protein modeling system (PMS) to generate accurate protein structures in terms of side-chains as well as backbone trace. In the new protocol, a global optimization algorithm, called conformational space annealing (CSA), is applied to the three layers of TBM procedure: multiple sequence-structure alignment, 3D chain building, and side-chain re-modeling. For 3D chain building, we developed a new energy function which includes new distance restraint terms of Lorentzian type (derived from multiple templates), and new energy terms that combine (physical) energy terms such as dynamic fragment assembly (DFA) energy, DFIRE statistical potential energy, hydrogen bonding term, etc. These physical energy terms are expected to guide the structure modeling especially for loop regions where no template structures are available. In addition, we developed a new quality assessment method based on random forest machine learning algorithm to screen templates, multiple alignments, and final models. For TBM targets of CASP10, we find that, due to the combination of three stages of CSA global optimizations and quality assessment, the modeling accuracy of PMS improves at each additional stage of the protocol. It is especially noteworthy that the side-chains of the final PMS models are far more accurate than the models in the intermediate steps. Copyright © 2013 Wiley Periodicals, Inc.

  15. Fourier analysis an introduction

    CERN Document Server

    Stein, Elias M

    2003-01-01

    This first volume, a three-part introduction to the subject, is intended for students with a beginning knowledge of mathematical analysis who are motivated to discover the ideas that shape Fourier analysis. It begins with the simple conviction that Fourier arrived at in the early nineteenth century when studying problems in the physical sciences--that an arbitrary function can be written as an infinite sum of the most basic trigonometric functions.The first part implements this idea in terms of notions of convergence and summability of Fourier series, while highlighting applications such as th

  16. A Comparative Study on Recently-Introduced Nature-Based Global Optimization Methods in Complex Mechanical System Design

    Directory of Open Access Journals (Sweden)

    Abdulbaset El Hadi Saad

    2017-10-01

    Full Text Available Advanced global optimization algorithms have been continuously introduced and improved to solve various complex design optimization problems for which the objective and constraint functions can only be evaluated through computation intensive numerical analyses or simulations with a large number of design variables. The often implicit, multimodal, and ill-shaped objective and constraint functions in high-dimensional and “black-box” forms demand the search to be carried out using low number of function evaluations with high search efficiency and good robustness. This work investigates the performance of six recently introduced, nature-inspired global optimization methods: Artificial Bee Colony (ABC, Firefly Algorithm (FFA, Cuckoo Search (CS, Bat Algorithm (BA, Flower Pollination Algorithm (FPA and Grey Wolf Optimizer (GWO. These approaches are compared in terms of search efficiency and robustness in solving a set of representative benchmark problems in smooth-unimodal, non-smooth unimodal, smooth multimodal, and non-smooth multimodal function forms. In addition, four classic engineering optimization examples and a real-life complex mechanical system design optimization problem, floating offshore wind turbines design optimization, are used as additional test cases representing computationally-expensive black-box global optimization problems. Results from this comparative study show that the ability of these global optimization methods to obtain a good solution diminishes as the dimension of the problem, or number of design variables increases. Although none of these methods is universally capable, the study finds that GWO and ABC are more efficient on average than the other four in obtaining high quality solutions efficiently and consistently, solving 86% and 80% of the tested benchmark problems, respectively. The research contributes to future improvements of global optimization methods.

  17. Intelligent optimization models based on hard-ridge penalty and RBF for forecasting global solar radiation

    International Nuclear Information System (INIS)

    Jiang, He; Dong, Yao; Wang, Jianzhou; Li, Yuqin

    2015-01-01

    Highlights: • CS-hard-ridge-RBF and DE-hard-ridge-RBF are proposed to forecast solar radiation. • Pearson and Apriori algorithm are used to analyze correlations between the data. • Hard-ridge penalty is added to reduce the number of nodes in the hidden layer. • CS algorithm and DE algorithm are used to determine the optimal parameters. • Proposed two models have higher forecasting accuracy than RBF and hard-ridge-RBF. - Abstract: Due to the scarcity of equipment and the high costs of maintenance, far fewer observations of solar radiation are made than observations of temperature, precipitation and other weather factors. Therefore, it is increasingly important to study several relevant meteorological factors to accurately forecast solar radiation. For this research, monthly average global solar radiation and 12 meteorological parameters from 1998 to 2010 at four sites in the United States were collected. Pearson correlation coefficients and Apriori association rules were successfully used to analyze correlations between the data, which provided a basis for these relative parameters as input variables. Two effective and innovative methods were developed to forecast monthly average global solar radiation by converting a RBF neural network into a multiple linear regression problem, adding a hard-ridge penalty to reduce the number of nodes in the hidden layer, and applying intelligent optimization algorithms, such as the cuckoo search algorithm (CS) and differential evolution (DE), to determine the optimal center and scale parameters. The experimental results show that the proposed models produce much more accurate forecasts than other models

  18. Negotiation and Optimality in an Economic Model of Global Climate Change

    Energy Technology Data Exchange (ETDEWEB)

    Gottinger, H. [International Institute for Environmental Economics and Management IIEEM, University of Maastricht, Maastricht (Netherlands)

    2000-03-01

    The paper addresses the problem of governmental intervention in a multi-country regime of controlling global climate change. Using a simplified case of a two-country, two-sector general equilibrium model the paper shows that the global optimal time path of economic outputs and temperature will converge to a unique steady state provided that consumers care enough about the future. To answer a set of questions relating to 'what will happen if governments decide to correct the problem of global warming?' we study the equilibrium outcome in a bargaining game where two countries negotiate an agreement on future consumption and production plans for the purpose of correcting the problem of climate change. It is shown that the agreement arising from such a negotiation process achieves the best outcome and that it can be implemented in decentralised economies by a system of taxes, subsidies and transfers. By employing the recent advances in non-cooperative bargaining theory, the agreement between two countries is derived endogenously through a well-specified bargaining procedure.

  19. Negotiation and Optimality in an Economic Model of Global Climate Change

    International Nuclear Information System (INIS)

    Gottinger, H.

    2000-03-01

    The paper addresses the problem of governmental intervention in a multi-country regime of controlling global climate change. Using a simplified case of a two-country, two-sector general equilibrium model the paper shows that the global optimal time path of economic outputs and temperature will converge to a unique steady state provided that consumers care enough about the future. To answer a set of questions relating to 'what will happen if governments decide to correct the problem of global warming?' we study the equilibrium outcome in a bargaining game where two countries negotiate an agreement on future consumption and production plans for the purpose of correcting the problem of climate change. It is shown that the agreement arising from such a negotiation process achieves the best outcome and that it can be implemented in decentralised economies by a system of taxes, subsidies and transfers. By employing the recent advances in non-cooperative bargaining theory, the agreement between two countries is derived endogenously through a well-specified bargaining procedure

  20. Prediction of energy demands using neural network with model identification by global optimization

    Energy Technology Data Exchange (ETDEWEB)

    Yokoyama, Ryohei; Wakui, Tetsuya; Satake, Ryoichi [Department of Mechanical Engineering, Osaka Prefecture University, 1-1 Gakuen-cho, Naka-ku, Sakai, Osaka 599-8531 (Japan)

    2009-02-15

    To operate energy supply plants properly from the viewpoints of stable energy supply, and energy and cost savings, it is important to predict energy demands accurately as basic conditions. Several methods of predicting energy demands have been proposed, and one of them is to use neural networks. Although local optimization methods such as gradient ones have conventionally been adopted in the back propagation procedure to identify the values of model parameters, they have the significant drawback that they can derive only local optimal solutions. In this paper, a global optimization method called ''Modal Trimming Method'' proposed for non-linear programming problems is adopted to identify the values of model parameters. In addition, the trend and periodic change are first removed from time series data on energy demand, and the converted data is used as the main input to a neural network. Furthermore, predicted values of air temperature and relative humidity are considered as additional inputs to the neural network, and their effect on the prediction of energy demand is investigated. This approach is applied to the prediction of the cooling demand in a building used for a bench mark test of a variety of prediction methods, and its validity and effectiveness are clarified. (author)

  1. Globally optimal superconducting magnets part I: minimum stored energy (MSE) current density map.

    Science.gov (United States)

    Tieng, Quang M; Vegh, Viktor; Brereton, Ian M

    2009-01-01

    An optimal current density map is crucial in magnet design to provide the initial values within search spaces in an optimization process for determining the final coil arrangement of the magnet. A strategy for obtaining globally optimal current density maps for the purpose of designing magnets with coaxial cylindrical coils in which the stored energy is minimized within a constrained domain is outlined. The current density maps obtained utilising the proposed method suggests that peak current densities occur around the perimeter of the magnet domain, where the adjacent peaks have alternating current directions for the most compact designs. As the dimensions of the domain are increased, the current density maps yield traditional magnet designs of positive current alone. These unique current density maps are obtained by minimizing the stored magnetic energy cost function and therefore suggest magnet coil designs of minimal system energy. Current density maps are provided for a number of different domain arrangements to illustrate the flexibility of the method and the quality of the achievable designs.

  2. Global optimization for motion estimation with applications to ultrasound videos of carotid artery plaques

    Science.gov (United States)

    Murillo, Sergio; Pattichis, Marios; Soliz, Peter; Barriga, Simon; Loizou, C. P.; Pattichis, C. S.

    2010-03-01

    Motion estimation from digital video is an ill-posed problem that requires a regularization approach. Regularization introduces a smoothness constraint that can reduce the resolution of the velocity estimates. The problem is further complicated for ultrasound videos (US), where speckle noise levels can be significant. Motion estimation using optical flow models requires the modification of several parameters to satisfy the optical flow constraint as well as the level of imposed smoothness. Furthermore, except in simulations or mostly unrealistic cases, there is no ground truth to use for validating the velocity estimates. This problem is present in all real video sequences that are used as input to motion estimation algorithms. It is also an open problem in biomedical applications like motion analysis of US of carotid artery (CA) plaques. In this paper, we study the problem of obtaining reliable ultrasound video motion estimates for atherosclerotic plaques for use in clinical diagnosis. A global optimization framework for motion parameter optimization is presented. This framework uses actual carotid artery motions to provide optimal parameter values for a variety of motions and is tested on ten different US videos using two different motion estimation techniques.

  3. Microseismic event location using global optimization algorithms: An integrated and automated workflow

    Science.gov (United States)

    Lagos, Soledad R.; Velis, Danilo R.

    2018-02-01

    We perform the location of microseismic events generated in hydraulic fracturing monitoring scenarios using two global optimization techniques: Very Fast Simulated Annealing (VFSA) and Particle Swarm Optimization (PSO), and compare them against the classical grid search (GS). To this end, we present an integrated and optimized workflow that concatenates into an automated bash script the different steps that lead to the microseismic events location from raw 3C data. First, we carry out the automatic detection, denoising and identification of the P- and S-waves. Secondly, we estimate their corresponding backazimuths using polarization information, and propose a simple energy-based criterion to automatically decide which is the most reliable estimate. Finally, after taking proper care of the size of the search space using the backazimuth information, we perform the location using the aforementioned algorithms for 2D and 3D usual scenarios of hydraulic fracturing processes. We assess the impact of restricting the search space and show the advantages of using either VFSA or PSO over GS to attain significant speed-ups.

  4. A Short Biography of Joseph Fourier and Historical Development of Fourier Series and Fourier Transforms

    Science.gov (United States)

    Debnath, Lokenath

    2012-01-01

    This article deals with a brief biographical sketch of Joseph Fourier, his first celebrated work on analytical theory of heat, his first great discovery of Fourier series and Fourier transforms. Included is a historical development of Fourier series and Fourier transforms with their properties, importance and applications. Special emphasis is made…

  5. Digital Fourier analysis fundamentals

    CERN Document Server

    Kido, Ken'iti

    2015-01-01

    This textbook is a thorough, accessible introduction to digital Fourier analysis for undergraduate students in the sciences. Beginning with the principles of sine/cosine decomposition, the reader walks through the principles of discrete Fourier analysis before reaching the cornerstone of signal processing: the Fast Fourier Transform. Saturated with clear, coherent illustrations, "Digital Fourier Analysis - Fundamentals" includes practice problems and thorough Appendices for the advanced reader. As a special feature, the book includes interactive applets (available online) that mirror the illustrations.  These user-friendly applets animate concepts interactively, allowing the user to experiment with the underlying mathematics. For example, a real sine signal can be treated as a sum of clockwise and counter-clockwise rotating vectors. The applet illustration included with the book animates the rotating vectors and the resulting sine signal. By changing parameters such as amplitude and frequency, the reader ca...

  6. Fourier Transform Mass Spectrometry

    Science.gov (United States)

    Scigelova, Michaela; Hornshaw, Martin; Giannakopulos, Anastassios; Makarov, Alexander

    2011-01-01

    This article provides an introduction to Fourier transform-based mass spectrometry. The key performance characteristics of Fourier transform-based mass spectrometry, mass accuracy and resolution, are presented in the view of how they impact the interpretation of measurements in proteomic applications. The theory and principles of operation of two types of mass analyzer, Fourier transform ion cyclotron resonance and Orbitrap, are described. Major benefits as well as limitations of Fourier transform-based mass spectrometry technology are discussed in the context of practical sample analysis, and illustrated with examples included as figures in this text and in the accompanying slide set. Comparisons highlighting the performance differences between the two mass analyzers are made where deemed useful in assisting the user with choosing the most appropriate technology for an application. Recent developments of these high-performing mass spectrometers are mentioned to provide a future outlook. PMID:21742802

  7. Generalized Fourier transforms classes

    DEFF Research Database (Denmark)

    Berntsen, Svend; Møller, Steen

    2002-01-01

    The Fourier class of integral transforms with kernels $B(\\omega r)$ has by definition inverse transforms with kernel $B(-\\omega r)$. The space of such transforms is explicitly constructed. A slightly more general class of generalized Fourier transforms are introduced. From the general theory foll...... follows that integral transform with kernels which are products of a Bessel and a Hankel function or which is of a certain general hypergeometric type have inverse transforms of the same structure....

  8. Generalized fiber Fourier optics.

    Science.gov (United States)

    Cincotti, Gabriella

    2011-06-15

    A twofold generalization of the optical schemes that perform the discrete Fourier transform (DFT) is given: new passive planar architectures are presented where the 2 × 2 3 dB couplers are replaced by M × M hybrids, reducing the number of required connections and phase shifters. Furthermore, the planar implementation of the discrete fractional Fourier transform (DFrFT) is also described, with a waveguide grating router (WGR) configuration and a properly modified slab coupler.

  9. A globally nonsingular quaternion-based formulation for all-electric satellite trajectory optimization

    Science.gov (United States)

    Libraro, Paola

    The general electric propulsion orbit-raising maneuver of a spacecraft must contend with four main limiting factors: the longer time of flight, multiple eclipses prohibiting continuous thrusting, long exposure to radiation from the Van Allen belt and high power requirement of the electric engines. In order to optimize a low-thrust transfer with respect to these challenges, the choice of coordinates and corresponding equations of motion used to describe the kinematical and dynamical behavior of the satellite is of critical importance. This choice can potentially affect the numerical optimization process as well as limit the set of mission scenarios that can be investigated. To increase the ability to determine the feasible set of mission scenarios able to address the challenges of an all-electric orbit-raising, a set of equations free of any singularities is required to consider a completely arbitrary injection orbit. For this purpose a new quaternion-based formulation of a spacecraft translational dynamics that is globally nonsingular has been developed. The minimum-time low-thrust problem has been solved using the new set of equations of motion inside a direct optimization scheme in order to investigate optimal low-thrust trajectories over the full range of injection orbit inclinations between 0 and 90 degrees with particular focus on high-inclinations. The numerical results consider a specific mission scenario in order to analyze three key aspects of the problem: the effect of the initial guess on the shape and duration of the transfer, the effect of Earth oblateness on transfer time and the role played by, radiation damage and power degradation in all-electric minimum-time transfers. Finally trade-offs between mass and cost savings are introduced through a test case.

  10. The Regularized Fast Hartley Transform Optimal Formulation of Real-Data Fast Fourier Transform for Silicon-Based Implementation in Resource-Constrained Environments

    CERN Document Server

    Jones, Keith

    2010-01-01

    The Regularized Fast Hartley Transform provides the reader with the tools necessary to both understand the proposed new formulation and to implement simple design variations that offer clear implementational advantages, both practical and theoretical, over more conventional complex-data solutions to the problem. The highly-parallel formulation described is shown to lead to scalable and device-independent solutions to the latency-constrained version of the problem which are able to optimize the use of the available silicon resources, and thus to maximize the achievable computational density, th

  11. Population Structures in Russia: Optimality and Dependence on Parameters of Global Evolution

    Directory of Open Access Journals (Sweden)

    Yuri Yegorov

    2016-07-01

    Full Text Available The paper is devoted to analytical investigation of the division of geographical space into urban and rural areas with application to Russia. Yegorov (2005, 2006, 2009 has suggested the role of population density on economics. A city has an attractive potential based on scale economies. The optimal city size depends on the balance between its attractive potential and the cost of living that can be approximated by equilibrium land rent and commuting cost. For moderate scale effects optimal population of a city depends negatively on transport costs that are related positively with energy price index. The optimal agricultural density of population can also be constructed. The larger is a land slot per peasant, the higher will be the output from one unit of his labour force applied to this slot. But at the same time, larger farm size results in increase of energy costs, related to land development, collecting the crop and bringing it to the market. In the last 10 years we have observed substantial rise of both food and energy prices at the world stock markets. However, the income of farmers did not grow as fast as food price index. This can shift optimal rural population density to lower level, causing migration to cities (and we observe this tendency globally. Any change in those prices results in suboptimality of existing spatial structures. If changes are slow, the optimal infrastructure can be adjusted by simple migration. If the shocks are high, adaptation may be impossible and shock will persist. This took place in early 1990es in the former USSR, where after transition to world price for oil in domestic markets existing spatial infrastructure became suboptimal and resulted in persistent crisis, leading to deterioration of both industry and agriculture. Russia is the largest country but this is also its problem. Having large resource endowment per capita, it is problematic to build sufficient infrastructure. Russia has too low population

  12. Optimizing Orbit-Instrument Configuration for Global Precipitation Mission (GPM) Satellite Fleet

    Science.gov (United States)

    Smith, Eric A.; Adams, James; Baptista, Pedro; Haddad, Ziad; Iguchi, Toshio; Im, Eastwood; Kummerow, Christian; Einaudi, Franco (Technical Monitor)

    2001-01-01

    Following the scientific success of the Tropical Rainfall Measuring Mission (TRMM) spearheaded by a group of NASA and NASDA scientists, their external scientific collaborators, and additional investigators within the European Union's TRMM Research Program (EUROTRMM), there has been substantial progress towards the development of a new internationally organized, global scale, and satellite-based precipitation measuring mission. The highlights of this newly developing mission are a greatly expanded scope of measuring capability and a more diversified set of science objectives. The mission is called the Global Precipitation Mission (GPM). Notionally, GPM will be a constellation-type mission involving a fleet of nine satellites. In this fleet, one member is referred to as the "core" spacecraft flown in an approximately 70 degree inclined non-sun-synchronous orbit, somewhat similar to TRMM in that it carries both a multi-channel polarized passive microwave radiometer (PMW) and a radar system, but in this case it will be a dual frequency Ku-Ka band radar system enabling explicit measurements of microphysical DSD properties. The remainder of fleet members are eight orbit-synchronized, sun-synchronous "constellation" spacecraft each carrying some type of multi-channel PMW radiometer, enabling no worse than 3-hour diurnal sampling over the entire globe. In this configuration the "core" spacecraft serves as a high quality reference platform for training and calibrating the PMW rain retrieval algorithms used with the "constellation" radiometers. Within NASA, GPM has advanced to the pre-formulation phase which has enabled the initiation of a set of science and technology studies which will help lead to the final mission design some time in the 2003 period. This presentation first provides an overview of the notional GPM program and mission design, including its organizational and programmatic concepts, scientific agenda, expected instrument package, and basic flight

  13. Fourier transformation for engineering and natural science

    International Nuclear Information System (INIS)

    Klingen, B.

    2001-01-01

    The following topics are covered: functions, Dirac delta function, Fourier operators, Fourier integrals, Fourier transformation and periodic functions, discrete Fourier transformations and discrete filters, applications. (WL)

  14. A New Method for Global Optimization Based on Stochastic Differential Equations.

    Science.gov (United States)

    1984-12-01

    Serie Naranja, n. 204, IINAS-UNAM, Mx ic o D. F. , 1979. [6] A. V. Levy, A. Montalvo, S. G6mez, A. Cald’er6n, ’Topics in global optimi~zation", in: J...FTFOPT aF 455. £ 456. C S7ART SERIES OF TR IAL5 457. C 458. DO 30 IC x 1,M7RIA&. 459. C 46r’. C SET INITIALIZATION IN&EX FOR NOISE GENERATOR 461. C 1 462...Ia iunghezza del passo di integrazione temporale , t k =o+ hi+ h 2+ ... + h kl rk e u ksono due vettori aleatori in n.-dimensioni scelti ii primo da

  15. Robust video watermarking via optimization algorithm for quantization of pseudo-random semi-global statistics

    Science.gov (United States)

    Kucukgoz, Mehmet; Harmanci, Oztan; Mihcak, Mehmet K.; Venkatesan, Ramarathnam

    2005-03-01

    In this paper, we propose a novel semi-blind video watermarking scheme, where we use pseudo-random robust semi-global features of video in the three dimensional wavelet transform domain. We design the watermark sequence via solving an optimization problem, such that the features of the mark-embedded video are the quantized versions of the features of the original video. The exact realizations of the algorithmic parameters are chosen pseudo-randomly via a secure pseudo-random number generator, whose seed is the secret key, that is known (resp. unknown) by the embedder and the receiver (resp. by the public). We experimentally show the robustness of our algorithm against several attacks, such as conventional signal processing modifications and adversarial estimation attacks.

  16. Two Modified Three-Term Type Conjugate Gradient Methods and Their Global Convergence for Unconstrained Optimization

    Directory of Open Access Journals (Sweden)

    Zhongbo Sun

    2014-01-01

    Full Text Available Two modified three-term type conjugate gradient algorithms which satisfy both the descent condition and the Dai-Liao type conjugacy condition are presented for unconstrained optimization. The first algorithm is a modification of the Hager and Zhang type algorithm in such a way that the search direction is descent and satisfies Dai-Liao’s type conjugacy condition. The second simple three-term type conjugate gradient method can generate sufficient decent directions at every iteration; moreover, this property is independent of the steplength line search. Also, the algorithms could be considered as a modification of the MBFGS method, but with different zk. Under some mild conditions, the given methods are global convergence, which is independent of the Wolfe line search for general functions. The numerical experiments show that the proposed methods are very robust and efficient.

  17. Quantifying global fossil-fuel CO2 emissions: from OCO-2 to optimal observing designs

    Science.gov (United States)

    Ye, X.; Lauvaux, T.; Kort, E. A.; Oda, T.; Feng, S.; Lin, J. C.; Yang, E. G.; Wu, D.; Kuze, A.; Suto, H.; Eldering, A.

    2017-12-01

    Cities house more than half of the world's population and are responsible for more than 70% of the world anthropogenic CO2 emissions. Therefore, quantifications of emissions from major cities, which are only less than a hundred intense emitting spots across the globe, should allow us to monitor changes in global fossil-fuel CO2 emissions, in an independent, objective way. Satellite platforms provide favorable temporal and spatial coverage to collect urban CO2 data to quantify the anthropogenic contributions to the global carbon budget. We present here the optimal observation design for future NASA's OCO-2 and Japanese GOSAT missions, based on real-data (i.e. OCO-2) experiments and Observing System Simulation Experiments (OSSE's) to address different error components in the urban CO2 budget calculation. We identify the major sources of emission uncertainties for various types of cities with different ecosystems and geographical features, such as urban plumes over flat terrains, accumulated enhancements within basins, and complex weather regimes in coastal areas. Atmospheric transport errors were characterized under various meteorological conditions using the Weather Research and Forecasting (WRF) model at 1-km spatial resolution, coupled to the Open-source Data Inventory for Anthropogenic CO2 (ODIAC) emissions. We propose and discuss the optimized urban sampling strategies to address some difficulties from the seasonality in cloud cover and emissions, vegetation density in and around cities, and address the daytime sampling bias using prescribed diurnal cycles. These factors are combined in pseudo data experiments in which we evaluate the relative impact of uncertainties on inverse estimates of CO2 emissions for cities across latitudinal and climatological zones. We propose here several sampling strategies to minimize the uncertainties in target mode for tracking urban fossil-fuel CO2 emissions over the globe for future satellite missions, such as OCO-3 and future

  18. A Novel Global MPP Tracking of Photovoltaic System based on Whale Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Santhan Kumar Cherukuri

    2016-11-01

    Full Text Available To harvest maximum amount of solar energy and to attain higher efficiency, photovoltaic generation (PVG systems are to be operated at their maximum power  point (MPP under both variable climatic and partial shaded condition (PSC. From literature most of conventional MPP tracking (MPPT methods are able to guarantee MPP successfully under uniform shading condition but fails to get global MPP as they may trap at local MPP under PSC, which adversely deteriorates the efficiency of Photovoltaic Generation (PVG system. In this paper a novel MPPT based on Whale Optimization Algorithm (WOA is proposed to analyze analytic modeling of PV system considering both series and shunt resistances for MPP tracking under PSC. The proposed algorithm is tested on 6S, 3S2P and 2S3P Photovoltaic array configurations for different shading patterns and results are presented. To compare the performance, GWO and PSO MPPT algorithms are also simulated and results are also presented.  From the results it is noticed that proposed MPPT method is superior to other MPPT methods with reference to accuracy and tracking speed. Article History: Received July 23rd 2016; Received in revised form September 15th 2016; Accepted October 1st 2016; Available online How to Cite This Article: Kumar, C.H.S and Rao, R.S. (2016 A Novel Global MPP Tracking of Photovoltaic System based on Whale Optimization Algorithm. Int. Journal of Renewable Energy Development, 5(3, 225-232. http://dx.doi.org/10.14710/ijred.5.3.225-232

  19. Identifying the preferred subset of enzymatic profiles in nonlinear kinetic metabolic models via multiobjective global optimization and Pareto filters.

    Directory of Open Access Journals (Sweden)

    Carlos Pozo

    Full Text Available Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study

  20. Identifying the preferred subset of enzymatic profiles in nonlinear kinetic metabolic models via multiobjective global optimization and Pareto filters.

    Science.gov (United States)

    Pozo, Carlos; Guillén-Gosálbez, Gonzalo; Sorribas, Albert; Jiménez, Laureano

    2012-01-01

    Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA) representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study that optimizes the

  1. Nacelle Chine Installation Based on Wind-Tunnel Test Using Efficient Global Optimization

    Science.gov (United States)

    Kanazaki, Masahiro; Yokokawa, Yuzuru; Murayama, Mitsuhiro; Ito, Takeshi; Jeong, Shinkyu; Yamamoto, Kazuomi

    Design exploration of a nacelle chine installation was carried out. The nacelle chine improves stall performance when deploying multi-element high-lift devices. This study proposes an efficient design process using a Kriging surrogate model to determine the nacelle chine installation point in wind-tunnel tests. The design exploration was conducted in a wind-tunnel using the JAXA high-lift aircraft model at the JAXA Large-scale Low-speed Wind Tunnel. The objective was to maximize the maximum lift. The chine installation points were designed on the engine nacelle in the axial and chord-wise direction, while the geometry of the chine was fixed. In the design process, efficient global optimization (EGO) which includes Kriging model and genetic algorithm (GA) was employed. This method makes it possible both to improve the accuracy of the response surface and to explore the global optimum efficiently. Detailed observations of flowfields using the Particle Image Velocimetry method confirmed the chine effect and design results.

  2. Knowledge-based modularization and global optimization of artificial neural network models in hydrological forecasting.

    Science.gov (United States)

    Corzo, Gerald; Solomatine, Dimitri

    2007-05-01

    Natural phenomena are multistationary and are composed of a number of interacting processes, so one single model handling all processes often suffers from inaccuracies. A solution is to partition data in relation to such processes using the available domain knowledge or expert judgment, to train separate models for each of the processes, and to merge them in a modular model (committee). In this paper a problem of water flow forecast in watershed hydrology is considered where the flow process can be presented as consisting of two subprocesses -- base flow and excess flow, so that these two processes can be separated. Several approaches to data separation techniques are studied. Two case studies with different forecast horizons are considered. Parameters of the algorithms responsible for data partitioning are optimized using genetic algorithms and global pattern search. It was found that modularization of ANN models using domain knowledge makes models more accurate, if compared with a global model trained on the whole data set, especially when forecast horizon (and hence the complexity of the modelled processes) is increased.

  3. Artificial Bee Colony Algorithm Combined with Grenade Explosion Method and Cauchy Operator for Global Optimization

    Directory of Open Access Journals (Sweden)

    Jian-Guo Zheng

    2015-01-01

    Full Text Available Artificial bee colony (ABC algorithm is a popular swarm intelligence technique inspired by the intelligent foraging behavior of honey bees. However, ABC is good at exploration but poor at exploitation and its convergence speed is also an issue in some cases. To improve the performance of ABC, a novel ABC combined with grenade explosion method (GEM and Cauchy operator, namely, ABCGC, is proposed. GEM is embedded in the onlooker bees’ phase to enhance the exploitation ability and accelerate convergence of ABCGC; meanwhile, Cauchy operator is introduced into the scout bees’ phase to help ABCGC escape from local optimum and further enhance its exploration ability. Two sets of well-known benchmark functions are used to validate the better performance of ABCGC. The experiments confirm that ABCGC is significantly superior to ABC and other competitors; particularly it converges to the global optimum faster in most cases. These results suggest that ABCGC usually achieves a good balance between exploitation and exploration and can effectively serve as an alternative for global optimization.

  4. Local search for optimal global map generation using mid-decadal landsat images

    Science.gov (United States)

    Khatib, L.; Gasch, J.; Morris, Robert; Covington, S.

    2007-01-01

    NASA and the US Geological Survey (USGS) are seeking to generate a map of the entire globe using Landsat 5 Thematic Mapper (TM) and Landsat 7 Enhanced Thematic Mapper Plus (ETM+) sensor data from the "mid-decadal" period of 2004 through 2006. The global map is comprised of thousands of scene locations and, for each location, tens of different images of varying quality to chose from. Furthermore, it is desirable for images of adjacent scenes be close together in time of acquisition, to avoid obvious discontinuities due to seasonal changes. These characteristics make it desirable to formulate an automated solution to the problem of generating the complete map. This paper formulates a Global Map Generator problem as a Constraint Optimization Problem (GMG-COP) and describes an approach to solving it using local search. Preliminary results of running the algorithm on image data sets are summarized. The results suggest a significant improvement in map quality using constraint-based solutions. Copyright ?? 2007, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

  5. Characterization of PV panel and global optimization of its model parameters using genetic algorithm

    International Nuclear Information System (INIS)

    Ismail, M.S.; Moghavvemi, M.; Mahlia, T.M.I.

    2013-01-01

    Highlights: • Genetic Algorithm optimization ability had been utilized to extract parameters of PV panel model. • Effect of solar radiation and temperature variations was taken into account in fitness function evaluation. • We used Matlab-Simulink to simulate operation of the PV-panel to validate results. • Different cases were analyzed to ascertain which of them gives more accurate results. • Accuracy and applicability of this approach to be used as a valuable tool for PV modeling were clearly validated. - Abstract: This paper details an improved modeling technique for a photovoltaic (PV) module; utilizing the optimization ability of a genetic algorithm, with different parameters of the PV module being computed via this approach. The accurate modeling of any PV module is incumbent upon the values of these parameters, as it is imperative in the context of any further studies concerning different PV applications. Simulation, optimization and the design of the hybrid systems that include PV are examples of these applications. The global optimization of the parameters and the applicability for the entire range of the solar radiation and a wide range of temperatures are achievable via this approach. The Manufacturer’s Data Sheet information is used as a basis for the purpose of parameter optimization, with an average absolute error fitness function formulated; and a numerical iterative method used to solve the voltage-current relation of the PV module. The results of single-diode and two-diode models are evaluated in order to ascertain which of them are more accurate. Other cases are also analyzed in this paper for the purpose of comparison. The Matlab–Simulink environment is used to simulate the operation of the PV module, depending on the extracted parameters. The results of the simulation are compared with the Data Sheet information, which is obtained via experimentation in order to validate the reliability of the approach. Three types of PV modules

  6. RDEL: Restart Differential Evolution algorithm with Local Search Mutation for global numerical optimization

    Directory of Open Access Journals (Sweden)

    Ali Wagdy Mohamed

    2014-11-01

    Full Text Available In this paper, a novel version of Differential Evolution (DE algorithm based on a couple of local search mutation and a restart mechanism for solving global numerical optimization problems over continuous space is presented. The proposed algorithm is named as Restart Differential Evolution algorithm with Local Search Mutation (RDEL. In RDEL, inspired by Particle Swarm Optimization (PSO, a novel local mutation rule based on the position of the best and the worst individuals among the entire population of a particular generation is introduced. The novel local mutation scheme is joined with the basic mutation rule through a linear decreasing function. The proposed local mutation scheme is proven to enhance local search tendency of the basic DE and speed up the convergence. Furthermore, a restart mechanism based on random mutation scheme and a modified Breeder Genetic Algorithm (BGA mutation scheme is combined to avoid stagnation and/or premature convergence. Additionally, an exponent increased crossover probability rule and a uniform scaling factors of DE are introduced to promote the diversity of the population and to improve the search process, respectively. The performance of RDEL is investigated and compared with basic differential evolution, and state-of-the-art parameter adaptive differential evolution variants. It is discovered that the proposed modifications significantly improve the performance of DE in terms of quality of solution, efficiency and robustness.

  7. Optimal model of economic diplomacy of Republic of Croatia in the contexst of global intelligence revolution

    Directory of Open Access Journals (Sweden)

    Zdravko Bazdan

    2010-12-01

    Full Text Available The aim of this study is to point to the fact that economic diplomacy is a relatively new practice in international economics, specifically the expansion of the occurrence of Intelligence Revolution. The history in global relations shows that without economic diplomacy there is no optimal economic growth and social development. It is important to note that economic diplomacy should be important for our country and the political elite, as well as for the administration of Croatian economic subjects that want to compete in international market economy. Comparative analysis are particularly highlighted by French experience. Therefore, Croatia should copy the practice of those countries that are successful in economic diplomacy. And in the curricula - especially of our economic faculties - we should introduce the course of Economic Diplomacy. It is important to note, that in order to form our optimal model of economic diplomacy which would be headed by the President of Republic of Croatia formula should be based on: Intelligence Security Agency (SOA, Intelligence Service of the Ministry of Foreign Affairs and European Integration, Intelligence Service of the Croatian Chamber of Commerce and the Intelligence Service of the Ministry of Economy, Labor and Entrepreneurship. Described model would consist of intelligence subsystem with at least twelve components.

  8. A global review of freshwater crayfish temperature tolerance, preference, and optimal growth

    Science.gov (United States)

    Westhoff, Jacob T.; Rosenberger, Amanda E.

    2016-01-01

    Conservation efforts, environmental planning, and management must account for ongoing ecosystem alteration due to a changing climate, introduced species, and shifting land use. This type of management can be facilitated by an understanding of the thermal ecology of aquatic organisms. However, information on thermal ecology for entire taxonomic groups is rarely compiled or summarized, and reviews of the science can facilitate its advancement. Crayfish are one of the most globally threatened taxa, and ongoing declines and extirpation could have serious consequences on aquatic ecosystem function due to their significant biomass and ecosystem roles. Our goal was to review the literature on thermal ecology for freshwater crayfish worldwide, with emphasis on studies that estimated temperature tolerance, temperature preference, or optimal growth. We also explored relationships between temperature metrics and species distributions. We located 56 studies containing information for at least one of those three metrics, which covered approximately 6 % of extant crayfish species worldwide. Information on one or more metrics existed for all 3 genera of Astacidae, 4 of the 12 genera of Cambaridae, and 3 of the 15 genera of Parastacidae. Investigations employed numerous methodological approaches for estimating these parameters, which restricts comparisons among and within species. The only statistically significant relationship we observed between a temperature metric and species range was a negative linear relationship between absolute latitude and optimal growth temperature. We recommend expansion of studies examining the thermal ecology of freshwater crayfish and identify and discuss methodological approaches that can improve standardization and comparability among studies.

  9. 3D prostate TRUS segmentation using globally optimized volume-preserving prior.

    Science.gov (United States)

    Qiu, Wu; Rajchl, Martin; Guo, Fumin; Sun, Yue; Ukwatta, Eranga; Fenster, Aaron; Yuan, Jing

    2014-01-01

    An efficient and accurate segmentation of 3D transrectal ultrasound (TRUS) images plays an important role in the planning and treatment of the practical 3D TRUS guided prostate biopsy. However, a meaningful segmentation of 3D TRUS images tends to suffer from US speckles, shadowing and missing edges etc, which make it a challenging task to delineate the correct prostate boundaries. In this paper, we propose a novel convex optimization based approach to extracting the prostate surface from the given 3D TRUS image, while preserving a new global volume-size prior. We, especially, study the proposed combinatorial optimization problem by convex relaxation and introduce its dual continuous max-flow formulation with the new bounded flow conservation constraint, which results in an efficient numerical solver implemented on GPUs. Experimental results using 12 patient 3D TRUS images show that the proposed approach while preserving the volume-size prior yielded a mean DSC of 89.5% +/- 2.4%, a MAD of 1.4 +/- 0.6 mm, a MAXD of 5.2 +/- 3.2 mm, and a VD of 7.5% +/- 6.2% in - 1 minute, deomonstrating the advantages of both accuracy and efficiency. In addition, the low standard deviation of the segmentation accuracy shows a good reliability of the proposed approach.

  10. Global Energy-Optimal Redundancy Resolution of Hydraulic Manipulators: Experimental Results for a Forestry Manipulator

    Directory of Open Access Journals (Sweden)

    Jarmo Nurmi

    2017-05-01

    Full Text Available This paper addresses the energy-inefficiency problem of four-degrees-of-freedom (4-DOF hydraulic manipulators through redundancy resolution in robotic closed-loop controlled applications. Because conventional methods typically are local and have poor performance for resolving redundancy with respect to minimum hydraulic energy consumption, global energy-optimal redundancy resolution is proposed at the valve-controlled actuator and hydraulic power system interaction level. The energy consumption of the widely popular valve-controlled load-sensing (LS and constant-pressure (CP systems is effectively minimised through cost functions formulated in a discrete-time dynamic programming (DP approach with minimum state representation. A prescribed end-effector path and important actuator constraints at the position, velocity and acceleration levels are also satisfied in the solution. Extensive field experiments performed on a forestry hydraulic manipulator demonstrate the performance of the proposed solution. Approximately 15–30% greater hydraulic energy consumption was observed with the conventional methods in the LS and CP systems. These results encourage energy-optimal redundancy resolution in future robotic applications of hydraulic manipulators.

  11. Development of a fuzzy optimization model, supporting global warming decision-making

    International Nuclear Information System (INIS)

    Leimbach, M.

    1996-01-01

    An increasing number of models have been developed to support global warming response policies. The model constructors are facing a lot of uncertainties which limit the evidence of these models. The support of climate policy decision-making is only possible in a semi-quantitative way, as presented by a Fuzzy model. The model design is based on an optimization approach, integrated in a bounded risk decision-making framework. Given some regional emission-related and impact-related restrictions, optimal emission paths can be calculated. The focus is not only on carbon dioxide but on other greenhouse gases too. In the paper, the components of the model will be described. Cost coefficients, emission boundaries and impact boundaries are represented as Fuzzy parameters. The Fuzzy model will be transformed into a computational one by using an approach of Rommelfanger. In the second part, some problems of applying the model to computations will be discussed. This includes discussions on the data situation and the presentation, as well as interpretation of results of sensitivity analyses. The advantage of the Fuzzy approach is that the requirements regarding data precision are not so strong. Hence, the effort for data acquisition can be reduced and computations can be started earlier. 9 figs., 3 tabs., 17 refs., 1 appendix

  12. Performance Optimization of Alternative Lower Global Warming Potential Refrigerants in Mini-Split Room Air Conditioners

    Energy Technology Data Exchange (ETDEWEB)

    Shen, Bo [ORNL; Abdelaziz, Omar [ORNL; Shrestha, Som S [ORNL

    2017-01-01

    Oak Ridge National laboratory (ORNL) recently conducted extensive laboratory, drop-in investigations for lower Global Warming Potential (GWP) refrigerants to replace R-22 and R-410A. ORNL studied propane, DR-3, ARM-20B, N-20B and R-444B as lower GWP refrigerant replacement for R-22 in a mini-split room air conditioner (RAC) originally designed for R-22; and, R-32, DR-55, ARM-71A, and L41-2, in a mini-split RAC designed for R-410A. We obtained laboratory testing results with very good energy balance and nominal measurement uncertainty. Drop-in studies are not enough to judge the overall performance of the alternative refrigerants since their thermodynamic and transport properties might favor different heat exchanger configurations, e.g. cross-flow, counter flow, etc. This study compares optimized performances of individual refrigerants using a physics-based system model tools. The DOE/ORNL Heat Pump Design Model (HPDM) was used to model the mini-split RACs by inputting detailed heat exchangers geometries, compressor displacement and efficiencies as well as other relevant system components. The RAC models were calibrated against the lab data for each individual refrigerant. The calibrated models were then used to conduct a design optimization for the cooling performance by varying the compressor displacement to match the required capacity, and changing the number of circuits, refrigerant flow direction, tube diameters, air flow rates in the condenser and evaporator at 100% and 50% cooling capacities. This paper compares the optimized performance results for all alternative refrigerants and highlights best candidates for R-22 and R-410A replacement.

  13. Multistage and multiobjective formulations of globally optimal upgradable expansions for electric power distribution systems

    Science.gov (United States)

    Vaziri Yazdi Pin, Mohammad

    practices. Single criterion optimization algorithms using mathematical programming for globally optimal solutions have been developed for three objectives of cost, reliability, and the social/environmental impacts. Additional algorithms for inclusions of upgrade and optimal load assignment possibilities have been developed. Algorithms have been developed to handle the expansion as a multiobjective decision process. Typical data from both major investor owned and major municipal utilities operating in California USA, have been utilized to implement and test the algorithms on practical test cases. Results of the case studies and associated analyses indicate that the developed algorithms also perform efficiently in solving the multistage and multiobjective expansion problem.

  14. On Fourier re-expansions

    OpenAIRE

    Liflyand, E.

    2012-01-01

    We study an extension to Fourier transforms of the old problem on absolute convergence of the re-expansion in the sine (cosine) Fourier series of an absolutely convergent cosine (sine) Fourier series. The results are obtained by revealing certain relations between the Fourier transforms and their Hilbert transforms.

  15. Fourier plane imaging microscopy

    Energy Technology Data Exchange (ETDEWEB)

    Dominguez, Daniel, E-mail: daniel.dominguez@ttu.edu; Peralta, Luis Grave de [Department of Physics, Texas Tech University, Lubbock, Texas 79409 (United States); Nano Tech Center, Texas Tech University, Lubbock, Texas 79409 (United States); Alharbi, Nouf; Alhusain, Mdhaoui [Department of Physics, Texas Tech University, Lubbock, Texas 79409 (United States); Bernussi, Ayrton A. [Nano Tech Center, Texas Tech University, Lubbock, Texas 79409 (United States); Department of Electrical and Computer Engineering, Texas Tech University, Lubbock, Texas 79409 (United States)

    2014-09-14

    We show how the image of an unresolved photonic crystal can be reconstructed using a single Fourier plane (FP) image obtained with a second camera that was added to a traditional compound microscope. We discuss how Fourier plane imaging microscopy is an application of a remarkable property of the obtained FP images: they contain more information about the photonic crystals than the images recorded by the camera commonly placed at the real plane of the microscope. We argue that the experimental results support the hypothesis that surface waves, contributing to enhanced resolution abilities, were optically excited in the studied photonic crystals.

  16. Global parameter optimization for maximizing radioisotope detection probabilities at fixed false alarm rates

    Energy Technology Data Exchange (ETDEWEB)

    Portnoy, David, E-mail: david.portnoy@jhuapl.edu [Johns Hopkins University Applied Physics Laboratory, 11100 Johns Hopkins Road, Laurel, MD 20723 (United States); Feuerbach, Robert; Heimberg, Jennifer [Johns Hopkins University Applied Physics Laboratory, 11100 Johns Hopkins Road, Laurel, MD 20723 (United States)

    2011-10-01

    Today there is a tremendous amount of interest in systems that can detect radiological or nuclear threats. Many of these systems operate in extremely high throughput situations where delays caused by false alarms can have a significant negative impact. Thus, calculating the tradeoff between detection rates and false alarm rates is critical for their successful operation. Receiver operating characteristic (ROC) curves have long been used to depict this tradeoff. The methodology was first developed in the field of signal detection. In recent years it has been used increasingly in machine learning and data mining applications. It follows that this methodology could be applied to radiological/nuclear threat detection systems. However many of these systems do not fit into the classic principles of statistical detection theory because they tend to lack tractable likelihood functions and have many parameters, which, in general, do not have a one-to-one correspondence with the detection classes. This work proposes a strategy to overcome these problems by empirically finding parameter values that maximize the probability of detection for a selected number of probabilities of false alarm. To find these parameter values a statistical global optimization technique that seeks to estimate portions of a ROC curve is proposed. The optimization combines elements of simulated annealing with elements of genetic algorithms. Genetic algorithms were chosen because they can reduce the risk of getting stuck in local minima. However classic genetic algorithms operate on arrays of Booleans values or bit strings, so simulated annealing is employed to perform mutation in the genetic algorithm. The presented initial results were generated using an isotope identification algorithm developed at Johns Hopkins University Applied Physics Laboratory. The algorithm has 12 parameters: 4 real-valued and 8 Boolean. A simulated dataset was used for the optimization study; the 'threat' set of

  17. Global parameter optimization for maximizing radioisotope detection probabilities at fixed false alarm rates

    International Nuclear Information System (INIS)

    Portnoy, David; Feuerbach, Robert; Heimberg, Jennifer

    2011-01-01

    Today there is a tremendous amount of interest in systems that can detect radiological or nuclear threats. Many of these systems operate in extremely high throughput situations where delays caused by false alarms can have a significant negative impact. Thus, calculating the tradeoff between detection rates and false alarm rates is critical for their successful operation. Receiver operating characteristic (ROC) curves have long been used to depict this tradeoff. The methodology was first developed in the field of signal detection. In recent years it has been used increasingly in machine learning and data mining applications. It follows that this methodology could be applied to radiological/nuclear threat detection systems. However many of these systems do not fit into the classic principles of statistical detection theory because they tend to lack tractable likelihood functions and have many parameters, which, in general, do not have a one-to-one correspondence with the detection classes. This work proposes a strategy to overcome these problems by empirically finding parameter values that maximize the probability of detection for a selected number of probabilities of false alarm. To find these parameter values a statistical global optimization technique that seeks to estimate portions of a ROC curve is proposed. The optimization combines elements of simulated annealing with elements of genetic algorithms. Genetic algorithms were chosen because they can reduce the risk of getting stuck in local minima. However classic genetic algorithms operate on arrays of Booleans values or bit strings, so simulated annealing is employed to perform mutation in the genetic algorithm. The presented initial results were generated using an isotope identification algorithm developed at Johns Hopkins University Applied Physics Laboratory. The algorithm has 12 parameters: 4 real-valued and 8 Boolean. A simulated dataset was used for the optimization study; the 'threat' set of spectra

  18. Global parameter optimization for maximizing radioisotope detection probabilities at fixed false alarm rates

    Science.gov (United States)

    Portnoy, David; Feuerbach, Robert; Heimberg, Jennifer

    2011-10-01

    Today there is a tremendous amount of interest in systems that can detect radiological or nuclear threats. Many of these systems operate in extremely high throughput situations where delays caused by false alarms can have a significant negative impact. Thus, calculating the tradeoff between detection rates and false alarm rates is critical for their successful operation. Receiver operating characteristic (ROC) curves have long been used to depict this tradeoff. The methodology was first developed in the field of signal detection. In recent years it has been used increasingly in machine learning and data mining applications. It follows that this methodology could be applied to radiological/nuclear threat detection systems. However many of these systems do not fit into the classic principles of statistical detection theory because they tend to lack tractable likelihood functions and have many parameters, which, in general, do not have a one-to-one correspondence with the detection classes. This work proposes a strategy to overcome these problems by empirically finding parameter values that maximize the probability of detection for a selected number of probabilities of false alarm. To find these parameter values a statistical global optimization technique that seeks to estimate portions of a ROC curve is proposed. The optimization combines elements of simulated annealing with elements of genetic algorithms. Genetic algorithms were chosen because they can reduce the risk of getting stuck in local minima. However classic genetic algorithms operate on arrays of Booleans values or bit strings, so simulated annealing is employed to perform mutation in the genetic algorithm. The presented initial results were generated using an isotope identification algorithm developed at Johns Hopkins University Applied Physics Laboratory. The algorithm has 12 parameters: 4 real-valued and 8 Boolean. A simulated dataset was used for the optimization study; the "threat" set of spectra

  19. Climate, Agriculture, Energy and the Optimal Allocation of Global Land Use

    Science.gov (United States)

    Steinbuks, J.; Hertel, T. W.

    2011-12-01

    The allocation of the world's land resources over the course of the next century has become a pressing research question. Continuing population increases, improving, land-intensive diets amongst the poorest populations in the world, increasing production of biofuels and rapid urbanization in developing countries are all competing for land even as the world looks to land resources to supply more environmental services. The latter include biodiversity and natural lands, as well as forests and grasslands devoted to carbon sequestration. And all of this is taking place in the context of faster than expected climate change which is altering the biophysical environment for land-related activities. The goal of the paper is to determine the optimal profile for global land use in the context of growing commercial demands for food and forest products, increasing non-market demands for ecosystem services, and more stringent GHG mitigation targets. We then seek to assess how the uncertainty associated with the underlying biophysical and economic processes influences this optimal profile of land use, in light of potential irreversibility in these decisions. We develop a dynamic long-run, forward-looking partial equilibrium framework in which the societal objective function being maximized places value on food production, liquid fuels (including biofuels), timber production, forest carbon and biodiversity. Given the importance of land-based emissions to any GHG mitigation strategy, as well as the potential impacts of climate change itself on the productivity of land in agriculture, forestry and ecosystem services, we aim to identify the optimal allocation of the world's land resources, over the course of the next century, in the face of alternative GHG constraints. The forestry sector is characterized by multiple forest vintages which add considerable computational complexity in the context of this dynamic analysis. In order to solve this model efficiently, we have employed the

  20. Fourier Transform Mass Spectrometry.

    Science.gov (United States)

    Gross, Michael L.; Rempel, Don L.

    1984-01-01

    Discusses the nature of Fourier transform mass spectrometry and its unique combination of high mass resolution, high upper mass limit, and multichannel advantage. Examines its operation, capabilities and limitations, applications (ion storage, ion manipulation, ion chemistry), and future applications and developments. (JN)

  1. Quantum separability and entanglement detection via entanglement-witness search and global optimization

    International Nuclear Information System (INIS)

    Ioannou, Lawrence M.; Travaglione, Benjamin C.

    2006-01-01

    We focus on determining the separability of an unknown bipartite quantum state ρ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal observables. We review the concept of an entanglement witness from the geometrical point of view and use this geometry to show that the set of separable states is not a polytope and to characterize the class of entanglement witnesses (observables) that detect entangled states on opposite sides of the set of separable states. All this serves to motivate a classical algorithm which, given the expected values of a subset of an orthogonal basis of observables of an otherwise unknown quantum state, searches for an entanglement witness in the span of the subset of observables. The idea of such an algorithm, which is an efficient reduction of the quantum separability problem to a global optimization problem, was introduced by [Ioannou et al., Phys. Rev. A 70, 060303(R)], where it was shown to be an improvement on the naive approach for the quantum separability problem (exhaustive search for a decomposition of the given state into a convex combination of separable states). The last section of the paper discusses in more generality such algorithms, which, in our case, assume a subroutine that computes the global maximum of a real function of several variables. Despite this, we anticipate that such algorithms will perform sufficiently well on small instances that they will render a feasible test for separability in some cases of interest (e.g., in 3x3 dimensional systems)

  2. Steady-state global optimization of metabolic non-linear dynamic models through recasting into power-law canonical models.

    Science.gov (United States)

    Pozo, Carlos; Marín-Sanguino, Alberto; Alves, Rui; Guillén-Gosálbez, Gonzalo; Jiménez, Laureano; Sorribas, Albert

    2011-08-25

    Design of newly engineered microbial strains for biotechnological purposes would greatly benefit from the development of realistic mathematical models for the processes to be optimized. Such models can then be analyzed and, with the development and application of appropriate optimization techniques, one could identify the modifications that need to be made to the organism in order to achieve the desired biotechnological goal. As appropriate models to perform such an analysis are necessarily non-linear and typically non-convex, finding their global optimum is a challenging task. Canonical modeling techniques, such as Generalized Mass Action (GMA) models based on the power-law formalism, offer a possible solution to this problem because they have a mathematical structure that enables the development of specific algorithms for global optimization. Based on the GMA canonical representation, we have developed in previous works a highly efficient optimization algorithm and a set of related strategies for understanding the evolution of adaptive responses in cellular metabolism. Here, we explore the possibility of recasting kinetic non-linear models into an equivalent GMA model, so that global optimization on the recast GMA model can be performed. With this technique, optimization is greatly facilitated and the results are transposable to the original non-linear problem. This procedure is straightforward for a particular class of non-linear models known as Saturable and Cooperative (SC) models that extend the power-law formalism to deal with saturation and cooperativity. Our results show that recasting non-linear kinetic models into GMA models is indeed an appropriate strategy that helps overcoming some of the numerical difficulties that arise during the global optimization task.

  3. Steady-state global optimization of metabolic non-linear dynamic models through recasting into power-law canonical models

    Directory of Open Access Journals (Sweden)

    Sorribas Albert

    2011-08-01

    Full Text Available Abstract Background Design of newly engineered microbial strains for biotechnological purposes would greatly benefit from the development of realistic mathematical models for the processes to be optimized. Such models can then be analyzed and, with the development and application of appropriate optimization techniques, one could identify the modifications that need to be made to the organism in order to achieve the desired biotechnological goal. As appropriate models to perform such an analysis are necessarily non-linear and typically non-convex, finding their global optimum is a challenging task. Canonical modeling techniques, such as Generalized Mass Action (GMA models based on the power-law formalism, offer a possible solution to this problem because they have a mathematical structure that enables the development of specific algorithms for global optimization. Results Based on the GMA canonical representation, we have developed in previous works a highly efficient optimization algorithm and a set of related strategies for understanding the evolution of adaptive responses in cellular metabolism. Here, we explore the possibility of recasting kinetic non-linear models into an equivalent GMA model, so that global optimization on the recast GMA model can be performed. With this technique, optimization is greatly facilitated and the results are transposable to the original non-linear problem. This procedure is straightforward for a particular class of non-linear models known as Saturable and Cooperative (SC models that extend the power-law formalism to deal with saturation and cooperativity. Conclusions Our results show that recasting non-linear kinetic models into GMA models is indeed an appropriate strategy that helps overcoming some of the numerical difficulties that arise during the global optimization task.

  4. Optimization of an artificial neural network dedicated to the multivariate forecasting of daily global radiation

    International Nuclear Information System (INIS)

    Voyant, Cyril; Muselli, Marc; Paoli, Christophe; Nivet, Marie-Laure

    2011-01-01

    This paper presents an application of Artificial Neural Networks (ANNs) to predict daily solar radiation. We look at the Multi-Layer Perceptron (MLP) network which is the most used of ANNs architectures. In previous studies, we have developed an ad-hoc time series preprocessing and optimized a MLP with endogenous inputs in order to forecast the solar radiation on a horizontal surface. We propose in this paper to study the contribution of exogenous meteorological data (multivariate method) as time series to our optimized MLP and compare with different forecasting methods: a naive forecaster (persistence), ARIMA reference predictor, an ANN with preprocessing using only endogenous inputs (univariate method) and an ANN with preprocessing using endogenous and exogenous inputs. The use of exogenous data generates an nRMSE decrease between 0.5% and 1% for two stations during 2006 and 2007 (Corsica Island, France). The prediction results are also relevant for the concrete case of a tilted PV wall (1.175 kWp). The addition of endogenous and exogenous data allows a 1% decrease of the nRMSE over a 6 months-cloudy period for the power production. While the use of exogenous data shows an interest in winter, endogenous data as inputs on a preprocessed ANN seem sufficient in summer. -- Research highlights: → Use of exogenous data as ANN inputs to forecast horizontal daily global irradiation data. → New methodology allowing to choice the adequate exogenous data - a systematic method comparing endogenous and exogenous data. → Different referenced mathematical predictors allows to conclude about the pertinence of the proposed methodology.

  5. Reducing Approximation Error in the Fourier Flexible Functional Form

    Directory of Open Access Journals (Sweden)

    Tristan D. Skolrud

    2017-12-01

    Full Text Available The Fourier Flexible form provides a global approximation to an unknown data generating process. In terms of limiting function specification error, this form is preferable to functional forms based on second-order Taylor series expansions. The Fourier Flexible form is a truncated Fourier series expansion appended to a second-order expansion in logarithms. By replacing the logarithmic expansion with a Box-Cox transformation, we show that the Fourier Flexible form can reduce approximation error by 25% on average in the tails of the data distribution. The new functional form allows for nested testing of a larger set of commonly implemented functional forms.

  6. Optimal estimation of regional N2O emissions using a three-dimensional global model

    Science.gov (United States)

    Huang, J.; Golombek, A.; Prinn, R.

    2004-12-01

    In this study, we use the MATCH (Model of Atmospheric Transport and Chemistry) model and Kalman filtering techniques to optimally estimate N2O emissions from seven source regions around the globe. The MATCH model was used with NCEP assimilated winds at T62 resolution (192 longitude by 94 latitude surface grid, and 28 vertical levels) from July 1st 1996 to December 31st 2000. The average concentrations of N2O in the lowest four layers of the model were then compared with the monthly mean observations from six national/global networks (AGAGE, CMDL (HATS), CMDL (CCGG), CSIRO, CSIR and NIES), at 48 surface sites. A 12-month-running-mean smoother was applied to both the model results and the observations, due to the fact that the model was not able to reproduce the very small observed seasonal variations. The Kalman filter was then used to solve for the time-averaged regional emissions of N2O for January 1st 1997 to June 30th 2000. The inversions assume that the model stratospheric destruction rates, which lead to a global N2O lifetime of 130 years, are correct. It also assumes normalized emission spatial distributions from each region based on previous studies. We conclude that the global N2O emission flux is about 16.2 TgN/yr, with {34.9±1.7%} from South America and Africa, {34.6±1.5%} from South Asia, {13.9±1.5%} from China/Japan/South East Asia, {8.0±1.9%} from all oceans, {6.4±1.1%} from North America and North and West Asia, {2.6±0.4%} from Europe, and {0.9±0.7%} from New Zealand and Australia. The errors here include the measurement standard deviation, calibration differences among the six groups, grid volume/measurement site mis-match errors estimated from the model, and a procedure to account approximately for the modeling errors.

  7. Expected Improvement in Efficient Global Optimization Through Bootstrapped Kriging - Replaced by CentER DP 2011-015

    NARCIS (Netherlands)

    Kleijnen, Jack P.C.; van Beers, W.C.M.; van Nieuwenhuyse, I.

    2010-01-01

    This paper uses a sequentialized experimental design to select simulation input com- binations for global optimization, based on Kriging (also called Gaussian process or spatial correlation modeling); this Kriging is used to analyze the input/output data of the simulation model (computer code). This

  8. Fourier series models through transformation | Omekara | Global ...

    African Journals Online (AJOL)

    As a result, the square transformation which outperforms the others is adopted. Consequently, each of the multiplicative and additive FSA models fitted to the transformed data are then subjected to a test for white noise based on spectral analysis. The result of this test shows that only the multiplicative model is adequate.

  9. Globalization

    Directory of Open Access Journals (Sweden)

    Tulio Rosembuj

    2006-12-01

    Full Text Available There is no singular globalization, nor is the result of an individual agent. We could start by saying that global action has different angles and subjects who perform it are different, as well as its objectives. The global is an invisible invasion of materials and immediate effects.

  10. Globalization

    OpenAIRE

    Tulio Rosembuj

    2006-01-01

    There is no singular globalization, nor is the result of an individual agent. We could start by saying that global action has different angles and subjects who perform it are different, as well as its objectives. The global is an invisible invasion of materials and immediate effects.

  11. Protein structure modeling and refinement by global optimization in CASP12.

    Science.gov (United States)

    Hong, Seung Hwan; Joung, InSuk; Flores-Canales, Jose C; Manavalan, Balachandran; Cheng, Qianyi; Heo, Seungryong; Kim, Jong Yun; Lee, Sun Young; Nam, Mikyung; Joo, Keehyoung; Lee, In-Ho; Lee, Sung Jong; Lee, Jooyoung

    2018-03-01

    For protein structure modeling in the CASP12 experiment, we have developed a new protocol based on our previous CASP11 approach. The global optimization method of conformational space annealing (CSA) was applied to 3 stages of modeling: multiple sequence-structure alignment, three-dimensional (3D) chain building, and side-chain re-modeling. For better template selection and model selection, we updated our model quality assessment (QA) method with the newly developed SVMQA (support vector machine for quality assessment). For 3D chain building, we updated our energy function by including restraints generated from predicted residue-residue contacts. New energy terms for the predicted secondary structure and predicted solvent accessible surface area were also introduced. For difficult targets, we proposed a new method, LEEab, where the template term played a less significant role than it did in LEE, complemented by increased contributions from other terms such as the predicted contact term. For TBM (template-based modeling) targets, LEE performed better than LEEab, but for FM targets, LEEab was better. For model refinement, we modified our CASP11 molecular dynamics (MD) based protocol by using explicit solvents and tuning down restraint weights. Refinement results from MD simulations that used a new augmented statistical energy term in the force field were quite promising. Finally, when using inaccurate information (such as the predicted contacts), it was important to use the Lorentzian function for which the maximal penalty arising from wrong information is always bounded. © 2017 Wiley Periodicals, Inc.

  12. Two-stage collaborative global optimization design model of the CHPG microgrid

    Science.gov (United States)

    Liao, Qingfen; Xu, Yeyan; Tang, Fei; Peng, Sicheng; Yang, Zheng

    2017-06-01

    With the continuous developing of technology and reducing of investment costs, renewable energy proportion in the power grid is becoming higher and higher because of the clean and environmental characteristics, which may need more larger-capacity energy storage devices, increasing the cost. A two-stage collaborative global optimization design model of the combined-heat-power-and-gas (abbreviated as CHPG) microgrid is proposed in this paper, to minimize the cost by using virtual storage without extending the existing storage system. P2G technology is used as virtual multi-energy storage in CHPG, which can coordinate the operation of electric energy network and natural gas network at the same time. Demand response is also one kind of good virtual storage, including economic guide for the DGs and heat pumps in demand side and priority scheduling of controllable loads. Two kinds of storage will coordinate to smooth the high-frequency fluctuations and low-frequency fluctuations of renewable energy respectively, and achieve a lower-cost operation scheme simultaneously. Finally, the feasibility and superiority of proposed design model is proved in a simulation of a CHPG microgrid.

  13. External force back-projective composition and globally deformable optimization for 3-D coronary artery reconstruction

    International Nuclear Information System (INIS)

    Yang, Jian; Cong, Weijian; Fan, Jingfan; Liu, Yue; Wang, Yongtian; Chen, Yang

    2014-01-01

    The clinical value of the 3D reconstruction of a coronary artery is important for the diagnosis and intervention of cardiovascular diseases. This work proposes a method based on a deformable model for reconstructing coronary arteries from two monoplane angiographic images acquired from different angles. First, an external force back-projective composition model is developed to determine the external force, for which the force distributions in different views are back-projected to the 3D space and composited in the same coordinate system based on the perspective projection principle of x-ray imaging. The elasticity and bending forces are composited as an internal force to maintain the smoothness of the deformable curve. Second, the deformable curve evolves rapidly toward the true vascular centerlines in 3D space and angiographic images under the combination of internal and external forces. Third, densely matched correspondence among vessel centerlines is constructed using a curve alignment method. The bundle adjustment method is then utilized for the global optimization of the projection parameters and the 3D structures. The proposed method is validated on phantom data and routine angiographic images with consideration for space and re-projection image errors. Experimental results demonstrate the effectiveness and robustness of the proposed method for the reconstruction of coronary arteries from two monoplane angiographic images. The proposed method can achieve a mean space error of 0.564 mm and a mean re-projection error of 0.349 mm. (paper)

  14. Searching for globally optimal functional forms for interatomic potentials using genetic programming with parallel tempering.

    Science.gov (United States)

    Slepoy, A; Peters, M D; Thompson, A P

    2007-11-30

    Molecular dynamics and other molecular simulation methods rely on a potential energy function, based only on the relative coordinates of the atomic nuclei. Such a function, called a force field, approximately represents the electronic structure interactions of a condensed matter system. Developing such approximate functions and fitting their parameters remains an arduous, time-consuming process, relying on expert physical intuition. To address this problem, a functional programming methodology was developed that may enable automated discovery of entirely new force-field functional forms, while simultaneously fitting parameter values. The method uses a combination of genetic programming, Metropolis Monte Carlo importance sampling and parallel tempering, to efficiently search a large space of candidate functional forms and parameters. The methodology was tested using a nontrivial problem with a well-defined globally optimal solution: a small set of atomic configurations was generated and the energy of each configuration was calculated using the Lennard-Jones pair potential. Starting with a population of random functions, our fully automated, massively parallel implementation of the method reproducibly discovered the original Lennard-Jones pair potential by searching for several hours on 100 processors, sampling only a minuscule portion of the total search space. This result indicates that, with further improvement, the method may be suitable for unsupervised development of more accurate force fields with completely new functional forms. Copyright (c) 2007 Wiley Periodicals, Inc.

  15. Global shape optimization of airfoil using multi-objective genetic algorithm

    International Nuclear Information System (INIS)

    Lee, Ju Hee; Lee, Sang Hwan; Park, Kyoung Woo

    2005-01-01

    The shape optimization of an airfoil has been performed for an incompressible viscous flow. In this study, Pareto frontier sets, which are global and non-dominated solutions, can be obtained without various weighting factors by using the multi-objective genetic algorithm. An NACA0012 airfoil is considered as a baseline model, and the profile of the airfoil is parameterized and rebuilt with four Bezier curves. Two curves, from leading to maximum thickness, are composed of five control points and the rest, from maximum thickness to tailing edge, are composed of four control points. There are eighteen design variables and two objective functions such as the lift and drag coefficients. A generation is made up of forty-five individuals. After fifteenth evolutions, the Pareto individuals of twenty can be achieved. One Pareto, which is the best of the reduction of the drag force, improves its drag to 13% and lift-drag ratio to 2%. Another Pareto, however, which is focused on increasing the lift force, can improve its lift force to 61%, while sustaining its drag force, compared to those of the baseline model

  16. Global shape optimization of airfoil using multi-objective genetic algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Ju Hee; Lee, Sang Hwan [Hanyang Univ., Seoul (Korea, Republic of); Park, Kyoung Woo [Hoseo Univ., Asan (Korea, Republic of)

    2005-10-01

    The shape optimization of an airfoil has been performed for an incompressible viscous flow. In this study, Pareto frontier sets, which are global and non-dominated solutions, can be obtained without various weighting factors by using the multi-objective genetic algorithm. An NACA0012 airfoil is considered as a baseline model, and the profile of the airfoil is parameterized and rebuilt with four Bezier curves. Two curves, from leading to maximum thickness, are composed of five control points and the rest, from maximum thickness to tailing edge, are composed of four control points. There are eighteen design variables and two objective functions such as the lift and drag coefficients. A generation is made up of forty-five individuals. After fifteenth evolutions, the Pareto individuals of twenty can be achieved. One Pareto, which is the best of the reduction of the drag force, improves its drag to 13% and lift-drag ratio to 2%. Another Pareto, however, which is focused on increasing the lift force, can improve its lift force to 61%, while sustaining its drag force, compared to those of the baseline model.

  17. Globally-Optimized Local Pseudopotentials for (Orbital-Free) Density Functional Theory Simulations of Liquids and Solids.

    Science.gov (United States)

    Del Rio, Beatriz G; Dieterich, Johannes M; Carter, Emily A

    2017-08-08

    The accuracy of local pseudopotentials (LPSs) is one of two major determinants of the fidelity of orbital-free density functional theory (OFDFT) simulations. We present a global optimization strategy for LPSs that enables OFDFT to reproduce solid and liquid properties obtained from Kohn-Sham DFT. Our optimization strategy can fit arbitrary properties from both solid and liquid phases, so the resulting globally optimized local pseudopotentials (goLPSs) can be used in solid and/or liquid-phase simulations depending on the fitting process. We show three test cases proving that we can (1) improve solid properties compared to our previous bulk-derived local pseudopotential generation scheme; (2) refine predicted liquid and solid properties by adding force matching data; and (3) generate a from-scratch, accurate goLPS from the local channel of a non-local pseudopotential. The proposed scheme therefore serves as a full and improved LPS construction protocol.

  18. Fourier optical cryptosystem using complex spatial modulation

    International Nuclear Information System (INIS)

    Sarkadi, T; Koppa, P

    2014-01-01

    Our goal is to enhance the security level of a Fourier optical encryption system. Therefore we propose a Mach–Zehnder interferometer based encryption setup. The input data is organized in a binary array, and it is encoded in the two wave fronts propagated in the arms of the interferometer. Both input wave fronts are independently encrypted by Fourier systems, hence the proposed method has two encryption keys. During decryption, the encrypted wave fronts are propagated through the interferometer setup. The interference pattern of the output shows the reconstructed data in cases where the correct decryption Fourier keys are used. We propose a novel input image modulation method with a user defined phase parameter. We show that the security level of the proposed cryptosystem can be enhanced by an optimally chosen phase parameter. (paper)

  19. Methods of Fourier analysis and approximation theory

    CERN Document Server

    Tikhonov, Sergey

    2016-01-01

    Different facets of interplay between harmonic analysis and approximation theory are covered in this volume. The topics included are Fourier analysis, function spaces, optimization theory, partial differential equations, and their links to modern developments in the approximation theory. The articles of this collection were originated from two events. The first event took place during the 9th ISAAC Congress in Krakow, Poland, 5th-9th August 2013, at the section “Approximation Theory and Fourier Analysis”. The second event was the conference on Fourier Analysis and Approximation Theory in the Centre de Recerca Matemàtica (CRM), Barcelona, during 4th-8th November 2013, organized by the editors of this volume. All articles selected to be part of this collection were carefully reviewed.

  20. Approximating the Analytic Fourier Transform with the Discrete Fourier Transform

    OpenAIRE

    Axelrod, Jeremy

    2015-01-01

    The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more rapidly than via a direct matrix multiplication. Advantages and limitations of using this method to approximate the Fourier transform are discussed, and prototypical MATLAB codes implementing the method are presented.

  1. Fourier phasing with phase-uncertain mask

    International Nuclear Information System (INIS)

    Fannjiang, Albert; Liao, Wenjing

    2013-01-01

    Fourier phasing is the problem of retrieving Fourier phase information from Fourier intensity data. The standard Fourier phase retrieval (without a mask) is known to have many solutions which cause the standard phasing algorithms to stagnate and produce wrong or inaccurate solutions. In this paper Fourier phase retrieval is carried out with the introduction of a randomly fabricated mask in measurement and reconstruction. Highly probable uniqueness of solution, up to a global phase, was previously proved with exact knowledge of the mask. Here the uniqueness result is extended to the case where only rough information about the mask’s phases is assumed. The exponential probability bound for uniqueness is given in terms of the uncertainty-to-diversity ratio of the unknown mask. New phasing algorithms alternating between the object update and the mask update are systematically tested and demonstrated to have the capability of recovering both the object and the mask (within the object support) simultaneously, consistent with the uniqueness result. Phasing with a phase-uncertain mask is shown to be robust with respect to the correlation in the mask as well as the Gaussian and Poisson noises. (paper)

  2. Classical Fourier analysis

    CERN Document Server

    Grafakos, Loukas

    2014-01-01

    The main goal of this text is to present the theoretical foundation of the field of Fourier analysis on Euclidean spaces. It covers classical topics such as interpolation, Fourier series, the Fourier transform, maximal functions, singular integrals, and Littlewood–Paley theory. The primary readership is intended to be graduate students in mathematics with the prerequisite including satisfactory completion of courses in real and complex variables. The coverage of topics and exposition style are designed to leave no gaps in understanding and stimulate further study. This third edition includes new Sections 3.5, 4.4, 4.5 as well as a new chapter on “Weighted Inequalities,” which has been moved from GTM 250, 2nd Edition. Appendices I and B.9 are also new to this edition.  Countless corrections and improvements have been made to the material from the second edition. Additions and improvements include: more examples and applications, new and more relevant hints for the existing exercises, new exercises, and...

  3. Fourier techniques and applications

    CERN Document Server

    1985-01-01

    The first systematic methods of Fourier analysis date from the early eighteenth century with the work of Joseph Fourier on the problem of the flow of heat. (A brief history is contained in the first paper.) Given the initial tempera­ ture at all points of a region, the problem was to determine the changes in the temperature distribution over time. Understanding and predicting these changes was important in such areas as the handling of metals and the determination of geological and atmospheric temperatures. Briefly, Fourier noticed that the solution of the heat diffusion problem was simple if the initial temperature dis­ tribution was sinusoidal. He then asserted that any distri­ bution can be decomposed into a sum of sinusoids, these being the harmonics of the original function. This meant that the general solution could now be obtained by summing the solu­ tions of the component sinusoidal problems. This remarkable ability of the series of sinusoids to describe all "reasonable" functions, the sine qua n...

  4. A Local and Global Search Combine Particle Swarm Optimization Algorithm for Job-Shop Scheduling to Minimize Makespan

    Directory of Open Access Journals (Sweden)

    Zhigang Lian

    2010-01-01

    Full Text Available The Job-shop scheduling problem (JSSP is a branch of production scheduling, which is among the hardest combinatorial optimization problems. Many different approaches have been applied to optimize JSSP, but for some JSSP even with moderate size cannot be solved to guarantee optimality. The original particle swarm optimization algorithm (OPSOA, generally, is used to solve continuous problems, and rarely to optimize discrete problems such as JSSP. In OPSOA, through research I find that it has a tendency to get stuck in a near optimal solution especially for middle and large size problems. The local and global search combine particle swarm optimization algorithm (LGSCPSOA is used to solve JSSP, where particle-updating mechanism benefits from the searching experience of one particle itself, the best of all particles in the swarm, and the best of particles in neighborhood population. The new coding method is used in LGSCPSOA to optimize JSSP, and it gets all sequences are feasible solutions. Three representative instances are made computational experiment, and simulation shows that the LGSCPSOA is efficacious for JSSP to minimize makespan.

  5. Visualization of Global Disease Burden for the Optimization of Patient Management and Treatment

    Directory of Open Access Journals (Sweden)

    Winfried Schlee

    2017-06-01

    Full Text Available BackgroundThe assessment and treatment of complex disorders is challenged by the multiple domains and instruments used to evaluate clinical outcome. With the large number of assessment tools typically used in complex disorders comes the challenge of obtaining an integrative view of disease status to further evaluate treatment outcome both at the individual level and at the group level. Radar plots appear as an attractive visual tool to display multivariate data on a two-dimensional graphical illustration. Here, we describe the use of radar plots for the visualization of disease characteristics applied in the context of tinnitus, a complex and heterogeneous condition, the treatment of which has shown mixed success.MethodsData from two different cohorts, the Swedish Tinnitus Outreach Project (STOP and the Tinnitus Research Initiative (TRI database, were used. STOP is a population-based cohort where cross-sectional data from 1,223 non-tinnitus and 933 tinnitus subjects were analyzed. By contrast, the TRI contained data from 571 patients who underwent various treatments and whose Clinical Global Impression (CGI score was accessible to infer treatment outcome. In the latter, 34,560 permutations were tested to evaluate whether a particular ordering of the instruments could reflect better the treatment outcome measured with the CGI.ResultsRadar plots confirmed that tinnitus subtypes such as occasional and chronic tinnitus from the STOP cohort could be strikingly different, and helped appreciate a gender bias in tinnitus severity. Radar plots with greater surface areas were consistent with greater burden, and enabled a rapid appreciation of the global distress associated with tinnitus in patients categorized according to tinnitus severity. Permutations in the arrangement of instruments allowed to identify a configuration with minimal variance and maximized surface difference between CGI groups from the TRI database, thus affording a means of optimally

  6. Cooperative Coevolution with Formula-Based Variable Grouping for Large-Scale Global Optimization.

    Science.gov (United States)

    Wang, Yuping; Liu, Haiyan; Wei, Fei; Zong, Tingting; Li, Xiaodong

    2017-08-09

    For a large-scale global optimization (LSGO) problem, divide-and-conquer is usually considered an effective strategy to decompose the problem into smaller subproblems, each of which can then be solved individually. Among these decomposition methods, variable grouping is shown to be promising in recent years. Existing variable grouping methods usually assume the problem to be black-box (i.e., assuming that an analytical model of the objective function is unknown), and they attempt to learn appropriate variable grouping that would allow for a better decomposition of the problem. In such cases, these variable grouping methods do not make a direct use of the formula of the objective function. However, it can be argued that many real-world problems are white-box problems, that is, the formulas of objective functions are often known a priori. These formulas of the objective functions provide rich information which can then be used to design an effective variable group method. In this article, a formula-based grouping strategy (FBG) for white-box problems is first proposed. It groups variables directly via the formula of an objective function which usually consists of a finite number of operations (i.e., four arithmetic operations "[Formula: see text]", "[Formula: see text]", "[Formula: see text]", "[Formula: see text]" and composite operations of basic elementary functions). In FBG, the operations are classified into two classes: one resulting in nonseparable variables, and the other resulting in separable variables. In FBG, variables can be automatically grouped into a suitable number of non-interacting subcomponents, with variables in each subcomponent being interdependent. FBG can easily be applied to any white-box problem and can be integrated into a cooperative coevolution framework. Based on FBG, a novel cooperative coevolution algorithm with formula-based variable grouping (so-called CCF) is proposed in this article for decomposing a large-scale white-box problem

  7. A GPS-Based Pitot-Static Calibration Method Using Global Output-Error Optimization

    Science.gov (United States)

    Foster, John V.; Cunningham, Kevin

    2010-01-01

    Pressure-based airspeed and altitude measurements for aircraft typically require calibration of the installed system to account for pressure sensing errors such as those due to local flow field effects. In some cases, calibration is used to meet requirements such as those specified in Federal Aviation Regulation Part 25. Several methods are used for in-flight pitot-static calibration including tower fly-by, pacer aircraft, and trailing cone methods. In the 1990 s, the introduction of satellite-based positioning systems to the civilian market enabled new inflight calibration methods based on accurate ground speed measurements provided by Global Positioning Systems (GPS). Use of GPS for airspeed calibration has many advantages such as accuracy, ease of portability (e.g. hand-held) and the flexibility of operating in airspace without the limitations of test range boundaries or ground telemetry support. The current research was motivated by the need for a rapid and statistically accurate method for in-flight calibration of pitot-static systems for remotely piloted, dynamically-scaled research aircraft. Current calibration methods were deemed not practical for this application because of confined test range size and limited flight time available for each sortie. A method was developed that uses high data rate measurements of static and total pressure, and GPSbased ground speed measurements to compute the pressure errors over a range of airspeed. The novel application of this approach is the use of system identification methods that rapidly compute optimal pressure error models with defined confidence intervals in nearreal time. This method has been demonstrated in flight tests and has shown 2- bounds of approximately 0.2 kts with an order of magnitude reduction in test time over other methods. As part of this experiment, a unique database of wind measurements was acquired concurrently with the flight experiments, for the purpose of experimental validation of the

  8. Fourier transforms principles and applications

    CERN Document Server

    Hansen, Eric W

    2014-01-01

    Fourier Transforms: Principles and Applications explains transform methods and their applications to electrical systems from circuits, antennas, and signal processors-ably guiding readers from vector space concepts through the Discrete Fourier Transform (DFT), Fourier series, and Fourier transform to other related transform methods.  Featuring chapter end summaries of key results, over two hundred examples and four hundred homework problems, and a Solutions Manual this book is perfect for graduate students in signal processing and communications as well as practicing engineers.

  9. Globalization

    OpenAIRE

    Andru?cã Maria Carmen

    2013-01-01

    The field of globalization has highlighted an interdependence implied by a more harmonious understanding determined by the daily interaction between nations through the inducement of peace and the management of streamlining and the effectiveness of the global economy. For the functioning of the globalization, the developing countries that can be helped by the developed ones must be involved. The international community can contribute to the institution of the development environment of the gl...

  10. Optimal Stomatal Behaviour Around the World: Synthesis of a Global Stomatal Conductance Database and Scaling from Leaf to Ecosystem

    Science.gov (United States)

    Lin, Y. S.; Medlyn, B. E.; Duursma, R.; Prentice, I. C.; Wang, H.

    2014-12-01

    Stomatal conductance (gs) is a key land surface attribute as it links transpiration, the dominant component of global land evapotranspiration and a key element of the global water cycle, and photosynthesis, the driving force of the global carbon cycle. Despite the pivotal role of gs in predictions of global water and carbon cycles, a global scale database and an associated globally applicable model of gs that allow predictions of stomatal behaviour are lacking. We present a unique database of globally distributed gs obtained in the field for a wide range of plant functional types (PFTs) and biomes. We employed a model of optimal stomatal conductance to assess differences in stomatal behaviour, and estimated the model slope coefficient, g1, which is directly related to the marginal carbon cost of water, for each dataset. We found that g1 varies considerably among PFTs, with evergreen savanna trees having the largest g1 (least conservative water use), followed by C3 grasses and crops, angiosperm trees, gymnosperm trees, and C4 grasses. Amongst angiosperm trees, species with higher wood density had a higher marginal carbon cost of water, as predicted by the theory underpinning the optimal stomatal model. There was an interactive effect between temperature and moisture availability on g1: for wet environments, g1 was largest in high temperature environments, indicated by high mean annual temperature during the period when temperature above 0oC (Tm), but it did not vary with Tm across dry environments. We examine whether these differences in leaf-scale behaviour are reflected in ecosystem-scale differences in water-use efficiency. These findings provide a robust theoretical framework for understanding and predicting the behaviour of stomatal conductance across biomes and across PFTs that can be applied to regional, continental and global-scale modelling of productivity and ecohydrological processes in a future changing climate.

  11. On the Fourier integral theorem

    NARCIS (Netherlands)

    Koekoek, J.

    1987-01-01

    Introduction. In traditional proofs of convergence of Fourier series and of the Fourier integraI theorem basic tools are the theory of Dirichlet integraIs and the Riemann-Lebesgue lemma. Recently CHERNOFF [I) and REoIlEFFER (2) gave new proofs of convergenceof Fourier series which make no use of the

  12. Step-by-step optimization and global chaos of nonlinear parameters in exact calculations of few-particle systems

    International Nuclear Information System (INIS)

    Frolov, A.M.

    1986-01-01

    Exact variational calculations are treated for few-particle systems in the exponential basis of relative coordinates using nonlinear parameters. The methods of step-by-step optimization and global chaos of nonlinear parameters are applied to calculate the S and P states of ppμ, ddμ, ttμ homonuclear mesomolecules within the error ≤±0.001 eV. The global chaos method turned out to be well applicable to nuclear 3 H and 3 He systems

  13. Step-by-step optimization and global chaos of nonlinear parameters in exact calculations of few-particle systems

    Energy Technology Data Exchange (ETDEWEB)

    Frolov, A M

    1986-09-01

    Exact variational calculations are treated for few-particle systems in the exponential basis of relative coordinates using nonlinear parameters. The methods of step-by-step optimization and global chaos of nonlinear parameters are applied to calculate the S and P states of pp..mu.., dd..mu.., tt..mu.. homonuclear mesomolecules within the error less than or equal to+-0.001 eV. The global chaos method turned out to be well applicable to nuclear /sup 3/H and /sup 3/He systems.

  14. Fourier transforms in spectroscopy

    CERN Document Server

    Kauppinen, Jyrki

    2000-01-01

    This modern approach to the subject is clearly and logically structured, and gives readers an understanding of the essence of Fourier transforms and their applications. All important aspects are included with respect to their use with optical spectroscopic data. Based on popular lectures, the authors provide the mathematical fundamentals and numerical applications which are essential in practical use. The main part of the book is dedicated to applications of FT in signal processing and spectroscopy, with IR and NIR, NMR and mass spectrometry dealt with both from a theoretical and practical poi

  15. Fourier Domain Sensing

    Science.gov (United States)

    Feldkhun, Daniel (Inventor); Wagner, Kelvin H. (Inventor)

    2013-01-01

    Methods and systems are disclosed of sensing an object. A first radiation is spatially modulated to generate a structured second radiation. The object is illuminated with the structured second radiation such that the object produces a third radiation in response. Apart from any spatially dependent delay, a time variation of the third radiation is spatially independent. With a single-element detector, a portion of the third radiation is detected from locations on the object simultaneously. At least one characteristic of a sinusoidal spatial Fourier-transform component of the object is estimated from a time-varying signal from the detected portion of the third radiation.

  16. Optimization of Terrestrial Ecosystem Model Parameters Using Atmospheric CO2 Concentration Data With the Global Carbon Assimilation System (GCAS)

    Science.gov (United States)

    Chen, Zhuoqi; Chen, Jing M.; Zhang, Shupeng; Zheng, Xiaogu; Ju, Weiming; Mo, Gang; Lu, Xiaoliang

    2017-12-01

    The Global Carbon Assimilation System that assimilates ground-based atmospheric CO2 data is used to estimate several key parameters in a terrestrial ecosystem model for the purpose of improving carbon cycle simulation. The optimized parameters are the leaf maximum carboxylation rate at 25°C (Vmax25), the temperature sensitivity of ecosystem respiration (Q10), and the soil carbon pool size. The optimization is performed at the global scale at 1° resolution for the period from 2002 to 2008. The results indicate that vegetation from tropical zones has lower Vmax25 values than vegetation in temperate regions. Relatively high values of Q10 are derived over high/midlatitude regions. Both Vmax25 and Q10 exhibit pronounced seasonal variations at middle-high latitudes. The maxima in Vmax25 occur during growing seasons, while the minima appear during nongrowing seasons. Q10 values decrease with increasing temperature. The seasonal variabilities of Vmax25 and Q10 are larger at higher latitudes. Optimized Vmax25 and Q10 show little seasonal variabilities at tropical regions. The seasonal variabilities of Vmax25 are consistent with the variabilities of LAI for evergreen conifers and broadleaf evergreen forests. Variations in leaf nitrogen and leaf chlorophyll contents may partly explain the variations in Vmax25. The spatial distribution of the total soil carbon pool size after optimization is compared favorably with the gridded Global Soil Data Set for Earth System. The results also suggest that atmospheric CO2 data are a source of information that can be tapped to gain spatially and temporally meaningful information for key ecosystem parameters that are representative at the regional and global scales.

  17. Global approach to the n-dimensional traveling salesman problem: Application to the optimization of crystallographic data collection

    Energy Technology Data Exchange (ETDEWEB)

    Weinrach, J.B.; Bennett, D.W.

    1987-12-01

    An algorithm for the optimization of data collection time has been written and a subsequent computer program tested for diffractometer systems. The program, which utilizes a global statistical approach to the traveling salesman problem, yields reasonable solutions in a relatively short time. The algorithm has been successful in treating very large data sets (up to 4000 points) in three dimensions with subsequent time savings of ca 30%.

  18. Fast Fourier transform telescope

    International Nuclear Information System (INIS)

    Tegmark, Max; Zaldarriaga, Matias

    2009-01-01

    We propose an all-digital telescope for 21 cm tomography, which combines key advantages of both single dishes and interferometers. The electric field is digitized by antennas on a rectangular grid, after which a series of fast Fourier transforms recovers simultaneous multifrequency images of up to half the sky. Thanks to Moore's law, the bandwidth up to which this is feasible has now reached about 1 GHz, and will likely continue doubling every couple of years. The main advantages over a single dish telescope are cost and orders of magnitude larger field-of-view, translating into dramatically better sensitivity for large-area surveys. The key advantages over traditional interferometers are cost (the correlator computational cost for an N-element array scales as Nlog 2 N rather than N 2 ) and a compact synthesized beam. We argue that 21 cm tomography could be an ideal first application of a very large fast Fourier transform telescope, which would provide both massive sensitivity improvements per dollar and mitigate the off-beam point source foreground problem with its clean beam. Another potentially interesting application is cosmic microwave background polarization.

  19. Annealing evolutionary stochastic approximation Monte Carlo for global optimization

    KAUST Repository

    Liang, Faming

    2010-01-01

    outperform simulated annealing, the genetic algorithm, annealing stochastic approximation Monte Carlo, and some other metaheuristics in function optimization. © 2010 Springer Science+Business Media, LLC.

  20. Implementing the global plan to stop TB, 2011-2015--optimizing allocations and the Global Fund's contribution: a scenario projections study.

    Directory of Open Access Journals (Sweden)

    Eline L Korenromp

    Full Text Available BACKGROUND: The Global Plan to Stop TB estimates funding required in low- and middle-income countries to achieve TB control targets set by the Stop TB Partnership within the context of the Millennium Development Goals. We estimate the contribution and impact of Global Fund investments under various scenarios of allocations across interventions and regions. METHODOLOGY/PRINCIPAL FINDINGS: Using Global Plan assumptions on expected cases and mortality, we estimate treatment costs and mortality impact for diagnosis and treatment for drug-sensitive and multidrug-resistant TB (MDR-TB, including antiretroviral treatment (ART during DOTS for HIV-co-infected patients, for four country groups, overall and for the Global Fund investments. In 2015, China and India account for 24% of funding need, Eastern Europe and Central Asia (EECA for 33%, sub-Saharan Africa (SSA for 20%, and other low- and middle-income countries for 24%. Scale-up of MDR-TB treatment, especially in EECA, drives an increasing global TB funding need--an essential investment to contain the mortality burden associated with MDR-TB and future disease costs. Funding needs rise fastest in SSA, reflecting increasing coverage need of improved TB/HIV management, which saves most lives per dollar spent in the short term. The Global Fund is expected to finance 8-12% of Global Plan implementation costs annually. Lives saved through Global Fund TB support within the available funding envelope could increase 37% if allocations shifted from current regional demand patterns to a prioritized scale-up of improved TB/HIV treatment and secondly DOTS, both mainly in Africa--with EECA region, which has disproportionately high per-patient costs, funded from alternative resources. CONCLUSIONS/SIGNIFICANCE: These findings, alongside country funding gaps, domestic funding and implementation capacity and equity considerations, should inform strategies and policies for international donors, national governments and

  1. Global On-Chip Differential Interconnects with Optimally-Placed Twists

    NARCIS (Netherlands)

    Mensink, E.; Schinkel, Daniel; Klumperink, Eric A.M.; van Tuijl, Adrianus Johannes Maria; Nauta, Bram

    2005-01-01

    Global on-chip communication is receiving quite some attention as global interconnects are rapidly becoming a speed, power and reliability bottleneck for digital CMOS systems. Recently, we proposed a bus-transceiver test chip in 0.13 μm CMOS using 10 mm long uninterrupted differential interconnects

  2. Subdivision, Sampling, and Initialization Strategies for Simplical Branch and Bound in Global Optimization

    DEFF Research Database (Denmark)

    Clausen, Jens; Zilinskas, A,

    2002-01-01

    We consider the problem of optimizing a Lipshitzian function. The branch and bound technique is a well-known solution method, and the key components for this are the subdivision scheme, the bound calculation scheme, and the initialization. For Lipschitzian optimization, the bound calculations are...

  3. Order-Constrained Solutions in K-Means Clustering: Even Better than Being Globally Optimal

    Science.gov (United States)

    Steinley, Douglas; Hubert, Lawrence

    2008-01-01

    This paper proposes an order-constrained K-means cluster analysis strategy, and implements that strategy through an auxiliary quadratic assignment optimization heuristic that identifies an initial object order. A subsequent dynamic programming recursion is applied to optimally subdivide the object set subject to the order constraint. We show that…

  4. Fourier Transform Spectrometer System

    Science.gov (United States)

    Campbell, Joel F. (Inventor)

    2014-01-01

    A Fourier transform spectrometer (FTS) data acquisition system includes an FTS spectrometer that receives a spectral signal and a laser signal. The system further includes a wideband detector, which is in communication with the FTS spectrometer and receives the spectral signal and laser signal from the FTS spectrometer. The wideband detector produces a composite signal comprising the laser signal and the spectral signal. The system further comprises a converter in communication with the wideband detector to receive and digitize the composite signal. The system further includes a signal processing unit that receives the composite signal from the converter. The signal processing unit further filters the laser signal and the spectral signal from the composite signal and demodulates the laser signal, to produce velocity corrected spectral data.

  5. Rainbow Fourier Transform

    Science.gov (United States)

    Alexandrov, Mikhail D.; Cairns, Brian; Mishchenko, Michael I.

    2012-01-01

    We present a novel technique for remote sensing of cloud droplet size distributions. Polarized reflectances in the scattering angle range between 135deg and 165deg exhibit a sharply defined rainbow structure, the shape of which is determined mostly by single scattering properties of cloud particles, and therefore, can be modeled using the Mie theory. Fitting the observed rainbow with such a model (computed for a parameterized family of particle size distributions) has been used for cloud droplet size retrievals. We discovered that the relationship between the rainbow structures and the corresponding particle size distributions is deeper than it had been commonly understood. In fact, the Mie theory-derived polarized reflectance as a function of reduced scattering angle (in the rainbow angular range) and the (monodisperse) particle radius appears to be a proxy to a kernel of an integral transform (similar to the sine Fourier transform on the positive semi-axis). This approach, called the rainbow Fourier transform (RFT), allows us to accurately retrieve the shape of the droplet size distribution by the application of the corresponding inverse transform to the observed polarized rainbow. While the basis functions of the proxy-transform are not exactly orthogonal in the finite angular range, this procedure needs to be complemented by a simple regression technique, which removes the retrieval artifacts. This non-parametric approach does not require any a priori knowledge of the droplet size distribution functional shape and is computationally fast (no look-up tables, no fitting, computations are the same as for the forward modeling).

  6. Globalization

    DEFF Research Database (Denmark)

    Plum, Maja

    Globalization is often referred to as external to education - a state of affair facing the modern curriculum with numerous challenges. In this paper it is examined as internal to curriculum; analysed as a problematization in a Foucaultian sense. That is, as a complex of attentions, worries, ways...... of reasoning, producing curricular variables. The analysis is made through an example of early childhood curriculum in Danish Pre-school, and the way the curricular variable of the pre-school child comes into being through globalization as a problematization, carried forth by the comparative practices of PISA...

  7. Globalization

    OpenAIRE

    F. Gerard Adams

    2008-01-01

    The rapid globalization of the world economy is causing fundamental changes in patterns of trade and finance. Some economists have argued that globalization has arrived and that the world is “flat†. While the geographic scope of markets has increased, the author argues that new patterns of trade and finance are a result of the discrepancies between “old†countries and “new†. As the differences are gradually wiped out, particularly if knowledge and technology spread worldwide, the t...

  8. Quadrature formulas for Fourier coefficients

    KAUST Repository

    Bojanov, Borislav

    2009-09-01

    We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node formula for the Fourier-Tchebycheff coefficients given by Micchelli and Sharma and construct new Gaussian formulas for the Fourier coefficients of a function, based on the values of the function and its derivatives. © 2009 Elsevier B.V. All rights reserved.

  9. Sequential Optimization of Global Sequence Alignments Relative to Different Cost Functions

    KAUST Repository

    Odat, Enas M.

    2011-01-01

    The algorithm has been simulated using C#.Net programming language and a number of experiments have been done to verify the proved statements. The results of these experiments show that the number of optimal alignments is reduced after each step of optimization. Furthermore, it has been verified that as the sequence length increased linearly then the number of optimal alignments increased exponentially which also depends on the cost function that is used. Finally, the number of executed operations increases polynomially as the sequence length increase linearly.

  10. Optimizing Quality of Care and Patient Safety in Malaysia: The Current Global Initiatives, Gaps and Suggested Solutions.

    Science.gov (United States)

    Jarrar, Mu'taman; Abdul Rahman, Hamzah; Don, Mohammad Sobri

    2015-10-20

    Demand for health care service has significantly increased, while the quality of healthcare and patient safety has become national and international priorities. This paper aims to identify the gaps and the current initiatives for optimizing the quality of care and patient safety in Malaysia. Review of the current literature. Highly cited articles were used as the basis to retrieve and review the current initiatives for optimizing the quality of care and patient safety. The country health plan of Ministry of Health (MOH) Malaysia and the MOH Malaysia Annual Reports were reviewed. The MOH has set four strategies for optimizing quality and sustaining quality of life. The 10th Malaysia Health Plan promotes the theme "1 Care for 1 Malaysia" in order to sustain the quality of care. Despite of these efforts, the total number of complaints received by the medico-legal section of the MOH Malaysia is increasing. The current global initiatives indicted that quality performance generally belong to three main categories: patient; staffing; and working environment related factors. There is no single intervention for optimizing quality of care to maintain patient safety. Multidimensional efforts and interventions are recommended in order to optimize the quality of care and patient safety in Malaysia.

  11. Optimizing Quality of Care and Patient Safety in Malaysia: The Current Global Initiatives, Gaps and Suggested Solutions

    Science.gov (United States)

    Jarrar, Mu’taman; Rahman, Hamzah Abdul; Don, Mohammad Sobri

    2016-01-01

    Background and Objective: Demand for health care service has significantly increased, while the quality of healthcare and patient safety has become national and international priorities. This paper aims to identify the gaps and the current initiatives for optimizing the quality of care and patient safety in Malaysia. Design: Review of the current literature. Highly cited articles were used as the basis to retrieve and review the current initiatives for optimizing the quality of care and patient safety. The country health plan of Ministry of Health (MOH) Malaysia and the MOH Malaysia Annual Reports were reviewed. Results: The MOH has set four strategies for optimizing quality and sustaining quality of life. The 10th Malaysia Health Plan promotes the theme “1 Care for 1 Malaysia” in order to sustain the quality of care. Despite of these efforts, the total number of complaints received by the medico-legal section of the MOH Malaysia is increasing. The current global initiatives indicted that quality performance generally belong to three main categories: patient; staffing; and working environment related factors. Conclusions: There is no single intervention for optimizing quality of care to maintain patient safety. Multidimensional efforts and interventions are recommended in order to optimize the quality of care and patient safety in Malaysia. PMID:26755459

  12. Automatic spinal cord localization, robust to MRI contrasts using global curve optimization.

    Science.gov (United States)

    Gros, Charley; De Leener, Benjamin; Dupont, Sara M; Martin, Allan R; Fehlings, Michael G; Bakshi, Rohit; Tummala, Subhash; Auclair, Vincent; McLaren, Donald G; Callot, Virginie; Cohen-Adad, Julien; Sdika, Michaël

    2018-02-01

    During the last two decades, MRI has been increasingly used for providing valuable quantitative information about spinal cord morphometry, such as quantification of the spinal cord atrophy in various diseases. However, despite the significant improvement of MR sequences adapted to the spinal cord, automatic image processing tools for spinal cord MRI data are not yet as developed as for the brain. There is nonetheless great interest in fully automatic and fast processing methods to be able to propose quantitative analysis pipelines on large datasets without user bias. The first step of most of these analysis pipelines is to detect the spinal cord, which is challenging to achieve automatically across the broad range of MRI contrasts, field of view, resolutions and pathologies. In this paper, a fully automated, robust and fast method for detecting the spinal cord centerline on MRI volumes is introduced. The algorithm uses a global optimization scheme that attempts to strike a balance between a probabilistic localization map of the spinal cord center point and the overall spatial consistency of the spinal cord centerline (i.e. the rostro-caudal continuity of the spinal cord). Additionally, a new post-processing feature, which aims to automatically split brain and spine regions is introduced, to be able to detect a consistent spinal cord centerline, independently from the field of view. We present data on the validation of the proposed algorithm, known as "OptiC", from a large dataset involving 20 centers, 4 contrasts (T 2 -weighted n = 287, T 1 -weighted n = 120, T 2 ∗ -weighted n = 307, diffusion-weighted n = 90), 501 subjects including 173 patients with a variety of neurologic diseases. Validation involved the gold-standard centerline coverage, the mean square error between the true and predicted centerlines and the ability to accurately separate brain and spine regions. Overall, OptiC was able to cover 98.77% of the gold-standard centerline, with a

  13. Global Optimization of Damping Ring Designs Using a Multi-Objective Evolutionary Algorithm

    CERN Document Server

    Emery, Louis

    2005-01-01

    Several damping ring designs for the International Linear Collider have been proposed recently. Some of the specifications, such as circumference and bunch train, are not fixed yet. Designers must make a choice anyway, select a geometry type (dog-bone or circular), an arc cell type (TME or FODO), and optimize linear and nonlinear part of the optics. The design process include straightforward steps (usually the linear optics), and some steps not so straightforward (when nonlinear optics optimization is affected by the linear optics). A first attempt at automating this process for the linear optics is reported. We first recognize that the optics is defined by just a few primary parameters (e.g., phase advance per cell) that determine the rest (e.g., quadrupole strength). In addition to the exact specification of circumference, equilibrium emittance and damping time there are some other quantities which could be optimized that may conflict with each other. A multiobjective genetic optimizer solves this problem b...

  14. A Global Multi-Objective Optimization Tool for Design of Mechatronic Components using Generalized Differential Evolution

    DEFF Research Database (Denmark)

    Bech, Michael Møller; Nørgård, Christian; Roemer, Daniel Beck

    2016-01-01

    This paper illustrates how the relatively simple constrained multi-objective optimization algorithm Generalized Differential Evolution 3 (GDE3), can assist with the practical sizing of mechatronic components used in e.g. digital displacement fluid power machinery. The studied bi- and tri-objectiv......This paper illustrates how the relatively simple constrained multi-objective optimization algorithm Generalized Differential Evolution 3 (GDE3), can assist with the practical sizing of mechatronic components used in e.g. digital displacement fluid power machinery. The studied bi- and tri...... different optimization control parameter settings and it is concluded that GDE3 is a reliable optimization tool that can assist mechatronic engineers in the design and decision making process....

  15. Fourier-Hermite communications; where Fourier meets Hermite

    NARCIS (Netherlands)

    Korevaar, C.W.; Kokkeler, Andre B.J.; de Boer, Pieter-Tjerk; Smit, Gerardus Johannes Maria

    A new signal set, based on the Fourier and Hermite signal bases, is introduced. It combines properties of the Fourier basis signals with the perfect time-frequency localization of the Hermite functions. The signal set is characterized by both a high spectral efficiency and good time-frequency

  16. From the social learning theory to a social learning algorithm for global optimization

    OpenAIRE

    Gong, Yue-Jiao; Zhang, Jun; Li, Yun

    2014-01-01

    Traditionally, the Evolutionary Computation (EC) paradigm is inspired by Darwinian evolution or the swarm intelligence of animals. Bandura's Social Learning Theory pointed out that the social learning behavior of humans indicates a high level of intelligence in nature. We found that such intelligence of human society can be implemented by numerical computing and be utilized in computational algorithms for solving optimization problems. In this paper, we design a novel and generic optimization...

  17. Cuckoo search with Lévy flights for weighted Bayesian energy functional optimization in global-support curve data fitting.

    Science.gov (United States)

    Gálvez, Akemi; Iglesias, Andrés; Cabellos, Luis

    2014-01-01

    The problem of data fitting is very important in many theoretical and applied fields. In this paper, we consider the problem of optimizing a weighted Bayesian energy functional for data fitting by using global-support approximating curves. By global-support curves we mean curves expressed as a linear combination of basis functions whose support is the whole domain of the problem, as opposed to other common approaches in CAD/CAM and computer graphics driven by piecewise functions (such as B-splines and NURBS) that provide local control of the shape of the curve. Our method applies a powerful nature-inspired metaheuristic algorithm called cuckoo search, introduced recently to solve optimization problems. A major advantage of this method is its simplicity: cuckoo search requires only two parameters, many fewer than other metaheuristic approaches, so the parameter tuning becomes a very simple task. The paper shows that this new approach can be successfully used to solve our optimization problem. To check the performance of our approach, it has been applied to five illustrative examples of different types, including open and closed 2D and 3D curves that exhibit challenging features, such as cusps and self-intersections. Our results show that the method performs pretty well, being able to solve our minimization problem in an astonishingly straightforward way.

  18. Multi-GPU configuration of 4D intensity modulated radiation therapy inverse planning using global optimization

    Science.gov (United States)

    Hagan, Aaron; Sawant, Amit; Folkerts, Michael; Modiri, Arezoo

    2018-01-01

    We report on the design, implementation and characterization of a multi-graphic processing unit (GPU) computational platform for higher-order optimization in radiotherapy treatment planning. In collaboration with a commercial vendor (Varian Medical Systems, Palo Alto, CA), a research prototype GPU-enabled Eclipse (V13.6) workstation was configured. The hardware consisted of dual 8-core Xeon processors, 256 GB RAM and four NVIDIA Tesla K80 general purpose GPUs. We demonstrate the utility of this platform for large radiotherapy optimization problems through the development and characterization of a parallelized particle swarm optimization (PSO) four dimensional (4D) intensity modulated radiation therapy (IMRT) technique. The PSO engine was coupled to the Eclipse treatment planning system via a vendor-provided scripting interface. Specific challenges addressed in this implementation were (i) data management and (ii) non-uniform memory access (NUMA). For the former, we alternated between parameters over which the computation process was parallelized. For the latter, we reduced the amount of data required to be transferred over the NUMA bridge. The datasets examined in this study were approximately 300 GB in size, including 4D computed tomography images, anatomical structure contours and dose deposition matrices. For evaluation, we created a 4D-IMRT treatment plan for one lung cancer patient and analyzed computation speed while varying several parameters (number of respiratory phases, GPUs, PSO particles, and data matrix sizes). The optimized 4D-IMRT plan enhanced sparing of organs at risk by an average reduction of 26% in maximum dose, compared to the clinical optimized IMRT plan, where the internal target volume was used. We validated our computation time analyses in two additional cases. The computation speed in our implementation did not monotonically increase with the number of GPUs. The optimal number of GPUs (five, in our study) is directly related to the

  19. Modern Fourier analysis

    CERN Document Server

    Grafakos, Loukas

    2014-01-01

    This text is addressed to graduate students in mathematics and to interested researchers who wish to acquire an in depth understanding of Euclidean Harmonic analysis. The text covers modern topics and techniques in function spaces, atomic decompositions, singular integrals of nonconvolution type, and the boundedness and convergence of Fourier series and integrals. The exposition and style are designed to stimulate further study and promote research. Historical information and references are included at the end of each chapter. This third edition includes a new chapter entitled "Multilinear Harmonic Analysis" which focuses on topics related to multilinear operators and their applications. Sections 1.1 and 1.2 are also new in this edition. Numerous corrections have been made to the text from the previous editions and several improvements have been incorporated, such as the adoption of clear and elegant statements. A few more exercises have been added with relevant hints when necessary. Reviews fr...

  20. Top-down constraints on global N2O emissions at optimal resolution: application of a new dimension reduction technique

    Science.gov (United States)

    Wells, Kelley C.; Millet, Dylan B.; Bousserez, Nicolas; Henze, Daven K.; Griffis, Timothy J.; Chaliyakunnel, Sreelekha; Dlugokencky, Edward J.; Saikawa, Eri; Xiang, Gao; Prinn, Ronald G.; O'Doherty, Simon; Young, Dickon; Weiss, Ray F.; Dutton, Geoff S.; Elkins, James W.; Krummel, Paul B.; Langenfelds, Ray; Steele, L. Paul

    2018-01-01

    We present top-down constraints on global monthly N2O emissions for 2011 from a multi-inversion approach and an ensemble of surface observations. The inversions employ the GEOS-Chem adjoint and an array of aggregation strategies to test how well current observations can constrain the spatial distribution of global N2O emissions. The strategies include (1) a standard 4D-Var inversion at native model resolution (4° × 5°), (2) an inversion for six continental and three ocean regions, and (3) a fast 4D-Var inversion based on a novel dimension reduction technique employing randomized singular value decomposition (SVD). The optimized global flux ranges from 15.9 Tg N yr-1 (SVD-based inversion) to 17.5-17.7 Tg N yr-1 (continental-scale, standard 4D-Var inversions), with the former better capturing the extratropical N2O background measured during the HIAPER Pole-to-Pole Observations (HIPPO) airborne campaigns. We find that the tropics provide a greater contribution to the global N2O flux than is predicted by the prior bottom-up inventories, likely due to underestimated agricultural and oceanic emissions. We infer an overestimate of natural soil emissions in the extratropics and find that predicted emissions are seasonally biased in northern midlatitudes. Here, optimized fluxes exhibit a springtime peak consistent with the timing of spring fertilizer and manure application, soil thawing, and elevated soil moisture. Finally, the inversions reveal a major emission underestimate in the US Corn Belt in the bottom-up inventory used here. We extensively test the impact of initial conditions on the analysis and recommend formally optimizing the initial N2O distribution to avoid biasing the inferred fluxes. We find that the SVD-based approach provides a powerful framework for deriving emission information from N2O observations: by defining the optimal resolution of the solution based on the information content of the inversion, it provides spatial information that is lost when

  1. An Effective Hybrid Firefly Algorithm with Harmony Search for Global Numerical Optimization

    Directory of Open Access Journals (Sweden)

    Lihong Guo

    2013-01-01

    Full Text Available A hybrid metaheuristic approach by hybridizing harmony search (HS and firefly algorithm (FA, namely, HS/FA, is proposed to solve function optimization. In HS/FA, the exploration of HS and the exploitation of FA are fully exerted, so HS/FA has a faster convergence speed than HS and FA. Also, top fireflies scheme is introduced to reduce running time, and HS is utilized to mutate between fireflies when updating fireflies. The HS/FA method is verified by various benchmarks. From the experiments, the implementation of HS/FA is better than the standard FA and other eight optimization methods.

  2. Attending Globally or Locally: Incidental Learning of Optimal Visual Attention Allocation

    Science.gov (United States)

    Beck, Melissa R.; Goldstein, Rebecca R.; van Lamsweerde, Amanda E.; Ericson, Justin M.

    2018-01-01

    Attention allocation determines the information that is encoded into memory. Can participants learn to optimally allocate attention based on what types of information are most likely to change? The current study examined whether participants could incidentally learn that changes to either high spatial frequency (HSF) or low spatial frequency (LSF)…

  3. Service ORiented Computing EnviRonment (SORCER) for Deterministic Global and Stochastic Optimization

    OpenAIRE

    Raghunath, Chaitra

    2015-01-01

    With rapid growth in the complexity of large scale engineering systems, the application of multidisciplinary analysis and design optimization (MDO) in the engineering design process has garnered much attention. MDO addresses the challenge of integrating several different disciplines into the design process. Primary challenges of MDO include computational expense and poor scalability. The introduction of a distributed, collaborative computational environment results in better...

  4. Optimal carbon emissions trajectories when damages depend on the rate or level of global warming

    International Nuclear Information System (INIS)

    Peck, S.C.; Teisberg, T.J.

    1994-01-01

    The authors extend earlier work with the Carbon Emissions Trajectory Assessment model (CETA) to consider a number of issues relating to the nature of optimal carbon emissions trajectories. They first explore model results when warming costs are associated with the rate of temperature rise, rather than with its level, as in earlier work. It is found that optimal trajectories are more strongly affected by the degree of non-linearity in the warming cost function than by whether the cost function is driven by the warming level or the warming rate. The authors briefly explore the implications of simple uncertainty and risk aversion for optimal emissions trajectories to be somewhat lower, but that the effect is not noticeable in the near term and not dramatic in the long term; the long term effect on the shadow price of carbon is more marked, however. Finally, they experiment with scaling up the warming cost functions until optimal policies are approximately the same as a policy of stabilising emissions at the 1990 level. Based on the results of this experiment, it is concluded that damages would have to be very high to justify anything like a stabilization policy; and even in this case, a policy allowing intertemporal variation in emissions would be better. 18 refs., 15 figs

  5. Global optimization for integrated design and control of computationally expensive process models

    NARCIS (Netherlands)

    Egea, J.A.; Vries, D.; Alonso, A.A.; Banga, J.R.

    2007-01-01

    The problem of integrated design and control optimization of process plants is discussed in this paper. We consider it as a nonlinear programming problem subject to differential-algebraic constraints. This class of problems is frequently multimodal and "costly" (i.e., computationally expensive to

  6. Optimization Case Study: ISR Allocation in the Global Force Management Process

    Science.gov (United States)

    2016-09-01

    assets available to meet the GCC requirements. The Joint Staff, in concert with USSTRATCOM, use many factors to prioritize allocation of assets to...include determining which GCC gets the assets and for how long. The decision influencers recommend a resource allocation solution based on experience...The allocation process illustrated in Figure 1 is the OV-1 diagram from the Joint Staff Global Force Management Enterprise Integration

  7. A comparison of global optimization algorithms with standard benchmark functions and real-world applications using Energy Plus

    Energy Technology Data Exchange (ETDEWEB)

    Kamph, Jerome Henri; Robinson, Darren; Wetter, Michael

    2009-09-01

    There is an increasing interest in the use of computer algorithms to identify combinations of parameters which optimise the energy performance of buildings. For such problems, the objective function can be multi-modal and needs to be approximated numerically using building energy simulation programs. As these programs contain iterative solution algorithms, they introduce discontinuities in the numerical approximation to the objective function. Metaheuristics often work well for such problems, but their convergence to a global optimum cannot be established formally. Moreover, different algorithms tend to be suited to particular classes of optimization problems. To shed light on this issue we compared the performance of two metaheuristics, the hybrid CMA-ES/HDE and the hybrid PSO/HJ, in minimizing standard benchmark functions and real-world building energy optimization problems of varying complexity. From this we find that the CMA-ES/HDE performs well on more complex objective functions, but that the PSO/HJ more consistently identifies the global minimum for simpler objective functions. Both identified similar values in the objective functions arising from energy simulations, but with different combinations of model parameters. This may suggest that the objective function is multi-modal. The algorithms also correctly identified some non-intuitive parameter combinations that were caused by a simplified control sequence of the building energy system that does not represent actual practice, further reinforcing their utility.

  8. Development of a model to optimize global use of nuclear energy considering competition of seawater uranium and reprocessing

    International Nuclear Information System (INIS)

    Undarmaa, Baatarkhuu; Horio, Kenta; Fujii, Yasumasa; Komiyama, Ryoichi

    2017-01-01

    In order to sustain long-term energy security and to mitigate the climate change, nuclear power remains an important baseload option for the global power generation mix. To utilize nuclear power in long-term, some important concerns such as economics, stability of fuel supply and spent fuel amount should be evaluated. Model developed in this study optimizes the global use nuclear power considering such issues. The Model is based on linear programming and calculates the best mix of nuclear reactor types by minimizing the current value of total power generation cost within the target period (next 100 years). Possibility of fuel cycle options such as reprocessing, seawater uranium and thorium utilization are also taken in to account, along with remaining spent fuel and plutonium stock. As result. reprocessing and uranium from seawater become essential part of nuclear fuel cycle in the long run. Amount of stored spent fuel is reduced following the deployment of Fast Breeder Reactor. Also, as an extension of current model, a baseload power generation mix model, which estimates the optimal mix of nuclear and coal-fired power generation will be introduced. (author)

  9. Parameter extraction using global particle swarm optimization approach and the influence of polymer processing temperature on the solar cell parameters

    Science.gov (United States)

    Kumar, S.; Singh, A.; Dhar, A.

    2017-08-01

    The accurate estimation of the photovoltaic parameters is fundamental to gain an insight of the physical processes occurring inside a photovoltaic device and thereby to optimize its design, fabrication processes, and quality. A simulative approach of accurately determining the device parameters is crucial for cell array and module simulation when applied in practical on-field applications. In this work, we have developed a global particle swarm optimization (GPSO) approach to estimate the different solar cell parameters viz., ideality factor (η), short circuit current (Isc), open circuit voltage (Voc), shunt resistant (Rsh), and series resistance (Rs) with wide a search range of over ±100 % for each model parameter. After validating the accurateness and global search power of the proposed approach with synthetic and noisy data, we applied the technique to the extract the PV parameters of ZnO/PCDTBT based hybrid solar cells (HSCs) prepared under different annealing conditions. Further, we examine the variation of extracted model parameters to unveil the physical processes occurring when different annealing temperatures are employed during the device fabrication and establish the role of improved charge transport in polymer films from independent FET measurements. The evolution of surface morphology, optical absorption, and chemical compositional behaviour of PCDTBT co-polymer films as a function of processing temperature has also been captured in the study and correlated with the findings from the PV parameters extracted using GPSO approach.

  10. Cuckoo Search with Lévy Flights for Weighted Bayesian Energy Functional Optimization in Global-Support Curve Data Fitting

    Directory of Open Access Journals (Sweden)

    Akemi Gálvez

    2014-01-01

    for data fitting by using global-support approximating curves. By global-support curves we mean curves expressed as a linear combination of basis functions whose support is the whole domain of the problem, as opposed to other common approaches in CAD/CAM and computer graphics driven by piecewise functions (such as B-splines and NURBS that provide local control of the shape of the curve. Our method applies a powerful nature-inspired metaheuristic algorithm called cuckoo search, introduced recently to solve optimization problems. A major advantage of this method is its simplicity: cuckoo search requires only two parameters, many fewer than other metaheuristic approaches, so the parameter tuning becomes a very simple task. The paper shows that this new approach can be successfully used to solve our optimization problem. To check the performance of our approach, it has been applied to five illustrative examples of different types, including open and closed 2D and 3D curves that exhibit challenging features, such as cusps and self-intersections. Our results show that the method performs pretty well, being able to solve our minimization problem in an astonishingly straightforward way.

  11. A global earthquake discrimination scheme to optimize ground-motion prediction equation selection

    Science.gov (United States)

    Garcia, Daniel; Wald, David J.; Hearne, Michael

    2012-01-01

    We present a new automatic earthquake discrimination procedure to determine in near-real time the tectonic regime and seismotectonic domain of an earthquake, its most likely source type, and the corresponding ground-motion prediction equation (GMPE) class to be used in the U.S. Geological Survey (USGS) Global ShakeMap system. This method makes use of the Flinn–Engdahl regionalization scheme, seismotectonic information (plate boundaries, global geology, seismicity catalogs, and regional and local studies), and the source parameters available from the USGS National Earthquake Information Center in the minutes following an earthquake to give the best estimation of the setting and mechanism of the event. Depending on the tectonic setting, additional criteria based on hypocentral depth, style of faulting, and regional seismicity may be applied. For subduction zones, these criteria include the use of focal mechanism information and detailed interface models to discriminate among outer-rise, upper-plate, interface, and intraslab seismicity. The scheme is validated against a large database of recent historical earthquakes. Though developed to assess GMPE selection in Global ShakeMap operations, we anticipate a variety of uses for this strategy, from real-time processing systems to any analysis involving tectonic classification of sources from seismic catalogs.

  12. Optimization Model for Mitigating Global Warming at the Farm Scale: An Application to Japanese Rice Farms

    Directory of Open Access Journals (Sweden)

    Kiyotaka Masuda

    2016-06-01

    Full Text Available In Japan, greenhouse gas emissions from rice production, especially CH4 emissions in rice paddy fields, are the primary contributors to global warming from agriculture. When prolonged midseason drainage for mitigating CH4 emissions from rice paddy fields is practiced with environmentally friendly rice production based on reduced use of synthetic pesticides and chemical fertilizers, Japanese rice farmers can receive an agri-environmental direct payment. This paper examines the economic and environmental effects of the agri-environmental direct payment on the adoption of a measure to mitigate global warming in Japanese rice farms using a combined application of linear programming and life cycle assessment at the farm scale. Eco-efficiency, which is defined as net farm income divided by global warming potential, is used as an integrated indicator for assessing the economic and environmental feasibilities. The results show that under the current direct payment level, the prolonged midseason drainage technique does not improve the eco-efficiency of Japanese rice farms because the practice of this technique in environmentally friendly rice production causes large economic disadvantages in exchange for small environmental advantages. The direct payment rates for agri-environmental measures should be determined based on the condition that environmentally friendly agricultural practices improve eco-efficiency compared with conventional agriculture.

  13. Solving non-standard packing problems by global optimization and heuristics

    CERN Document Server

    Fasano, Giorgio

    2014-01-01

    This book results from a long-term research effort aimed at tackling complex non-standard packing issues which arise in space engineering. The main research objective is to optimize cargo loading and arrangement, in compliance with a set of stringent rules. Complicated geometrical aspects are also taken into account, in addition to balancing conditions based on attitude control specifications. Chapter 1 introduces the class of non-standard packing problems studied. Chapter 2 gives a detailed explanation of a general model for the orthogonal packing of tetris-like items in a convex domain. A number of additional conditions are looked at in depth, including the prefixed orientation of subsets of items, the presence of unusable holes, separation planes and structural elements, relative distance bounds as well as static and dynamic balancing requirements. The relative feasibility sub-problem which is a special case that does not have an optimization criterion is discussed in Chapter 3. This setting can be exploit...

  14. Fourier transform infrared spectroscopy of peptides.

    Science.gov (United States)

    Bakshi, Kunal; Liyanage, Mangala R; Volkin, David B; Middaugh, C Russell

    2014-01-01

    Fourier transform infrared (FTIR) spectroscopy provides data that are widely used for secondary structure characterization of peptides. A wide array of available sampling methods permits structural analysis of peptides in diverse environments such as aqueous solution (including optically turbid media), powders, detergent micelles, and lipid bilayers. In some cases, side chain vibrations can also be resolved and used for tertiary structure and chemical analysis. Data from several low-resolution spectroscopic techniques, including FTIR, can be combined to generate an empirical phase diagram, an overall picture of peptide structure as a function of environmental conditions that can aid in the global interpretation of large amounts of spectroscopic data.

  15. Fourier phase in Fourier-domain optical coherence tomography

    Science.gov (United States)

    Uttam, Shikhar; Liu, Yang

    2015-01-01

    Phase of an electromagnetic wave propagating through a sample-of-interest is well understood in the context of quantitative phase imaging in transmission-mode microscopy. In the past decade, Fourier-domain optical coherence tomography has been used to extend quantitative phase imaging to the reflection-mode. Unlike transmission-mode electromagnetic phase, however, the origin and characteristics of reflection-mode Fourier phase are poorly understood, especially in samples with a slowly varying refractive index. In this paper, the general theory of Fourier phase from first principles is presented, and it is shown that Fourier phase is a joint estimate of subresolution offset and mean spatial frequency of the coherence-gated sample refractive index. It is also shown that both spectral-domain phase microscopy and depth-resolved spatial-domain low-coherence quantitative phase microscopy are special cases of this general theory. Analytical expressions are provided for both, and simulations are presented to explain and support the theoretical results. These results are further used to show how Fourier phase allows the estimation of an axial mean spatial frequency profile of the sample, along with depth-resolved characterization of localized optical density change and sample heterogeneity. Finally, a Fourier phase-based explanation of Doppler optical coherence tomography is also provided. PMID:26831383

  16. Fourier phase in Fourier-domain optical coherence tomography.

    Science.gov (United States)

    Uttam, Shikhar; Liu, Yang

    2015-12-01

    Phase of an electromagnetic wave propagating through a sample-of-interest is well understood in the context of quantitative phase imaging in transmission-mode microscopy. In the past decade, Fourier-domain optical coherence tomography has been used to extend quantitative phase imaging to the reflection-mode. Unlike transmission-mode electromagnetic phase, however, the origin and characteristics of reflection-mode Fourier phase are poorly understood, especially in samples with a slowly varying refractive index. In this paper, the general theory of Fourier phase from first principles is presented, and it is shown that Fourier phase is a joint estimate of subresolution offset and mean spatial frequency of the coherence-gated sample refractive index. It is also shown that both spectral-domain phase microscopy and depth-resolved spatial-domain low-coherence quantitative phase microscopy are special cases of this general theory. Analytical expressions are provided for both, and simulations are presented to explain and support the theoretical results. These results are further used to show how Fourier phase allows the estimation of an axial mean spatial frequency profile of the sample, along with depth-resolved characterization of localized optical density change and sample heterogeneity. Finally, a Fourier phase-based explanation of Doppler optical coherence tomography is also provided.

  17. Fourier-transforming with quantum annealers

    Directory of Open Access Journals (Sweden)

    Itay eHen

    2014-07-01

    Full Text Available We introduce a set of quantum adiabatic evolutions that we argue may be used as `building blocks', or subroutines, in the onstruction of an adiabatic algorithm that executes Quantum Fourier Transform (QFT with the same complexity and resources as its gate-model counterpart. One implication of the above construction is the theoretical feasibility of implementing Shor's algorithm for integer factorization in an optimal manner, and any other algorithm that makes use of QFT, on quantum annealing devices. We discuss the possible advantages, as well as the limitations, of the proposed approach as well as its relation to traditional adiabatic quantum computation.

  18. A stochastic algorithm for global optimization and for best populations: A test case of side chains in proteins

    Science.gov (United States)

    Glick, Meir; Rayan, Anwar; Goldblum, Amiram

    2002-01-01

    The problem of global optimization is pivotal in a variety of scientific fields. Here, we present a robust stochastic search method that is able to find the global minimum for a given cost function, as well as, in most cases, any number of best solutions for very large combinatorial “explosive” systems. The algorithm iteratively eliminates variable values that contribute consistently to the highest end of a cost function's spectrum of values for the full system. Values that have not been eliminated are retained for a full, exhaustive search, allowing the creation of an ordered population of best solutions, which includes the global minimum. We demonstrate the ability of the algorithm to explore the conformational space of side chains in eight proteins, with 54 to 263 residues, to reproduce a population of their low energy conformations. The 1,000 lowest energy solutions are identical in the stochastic (with two different seed numbers) and full, exhaustive searches for six of eight proteins. The others retain the lowest 141 and 213 (of 1,000) conformations, depending on the seed number, and the maximal difference between stochastic and exhaustive is only about 0.15 Kcal/mol. The energy gap between the lowest and highest of the 1,000 low-energy conformers in eight proteins is between 0.55 and 3.64 Kcal/mol. This algorithm offers real opportunities for solving problems of high complexity in structural biology and in other fields of science and technology. PMID:11792838

  19. Constructing IGA-suitable planar parameterization from complex CAD boundary by domain partition and global/local optimization

    Science.gov (United States)

    Xu, Gang; Li, Ming; Mourrain, Bernard; Rabczuk, Timon; Xu, Jinlan; Bordas, Stéphane P. A.

    2018-01-01

    In this paper, we propose a general framework for constructing IGA-suitable planar B-spline parameterizations from given complex CAD boundaries consisting of a set of B-spline curves. Instead of forming the computational domain by a simple boundary, planar domains with high genus and more complex boundary curves are considered. Firstly, some pre-processing operations including B\\'ezier extraction and subdivision are performed on each boundary curve in order to generate a high-quality planar parameterization; then a robust planar domain partition framework is proposed to construct high-quality patch-meshing results with few singularities from the discrete boundary formed by connecting the end points of the resulting boundary segments. After the topology information generation of quadrilateral decomposition, the optimal placement of interior B\\'ezier curves corresponding to the interior edges of the quadrangulation is constructed by a global optimization method to achieve a patch-partition with high quality. Finally, after the imposition of C1=G1-continuity constraints on the interface of neighboring B\\'ezier patches with respect to each quad in the quadrangulation, the high-quality B\\'ezier patch parameterization is obtained by a C1-constrained local optimization method to achieve uniform and orthogonal iso-parametric structures while keeping the continuity conditions between patches. The efficiency and robustness of the proposed method are demonstrated by several examples which are compared to results obtained by the skeleton-based parameterization approach.

  20. Fourier-Accelerated Nodal Solvers (FANS) for homogenization problems

    Science.gov (United States)

    Leuschner, Matthias; Fritzen, Felix

    2017-11-01

    Fourier-based homogenization schemes are useful to analyze heterogeneous microstructures represented by 2D or 3D image data. These iterative schemes involve discrete periodic convolutions with global ansatz functions (mostly fundamental solutions). The convolutions are efficiently computed using the fast Fourier transform. FANS operates on nodal variables on regular grids and converges to finite element solutions. Compared to established Fourier-based methods, the number of convolutions is reduced by FANS. Additionally, fast iterations are possible by assembling the stiffness matrix. Due to the related memory requirement, the method is best suited for medium-sized problems. A comparative study involving established Fourier-based homogenization schemes is conducted for a thermal benchmark problem with a closed-form solution. Detailed technical and algorithmic descriptions are given for all methods considered in the comparison. Furthermore, many numerical examples focusing on convergence properties for both thermal and mechanical problems, including also plasticity, are presented.

  1. Towards continuous global measurements and optimal emission estimates of NF3

    Science.gov (United States)

    Arnold, T.; Muhle, J.; Salameh, P.; Harth, C.; Ivy, D. J.; Weiss, R. F.

    2011-12-01

    We present an analytical method for the continuous in situ measurement of nitrogen trifluoride (NF3) - an anthropogenic gas with a global warming potential of ~16800 over a 100 year time horizon. NF3 is not included in national reporting emissions inventories under the United Nations Framework Convention on Climate Change (UNFCCC). However, it is a rapidly emerging greenhouse gas due to emission from a growing number of manufacturing facilities with increasing output and modern end-use applications, namely in microcircuit etching, and in production of flat panel displays and thin-film photovoltaic cells. Despite success in measuring the most volatile long lived halogenated species such as CF4, the Medusa preconcentration GC/MS system of Miller et al. (2008) is unable to detect NF3 under remote operation. Using altered techniques of gas separation and chromatography after initial preconcentration, we are now able to make continuous atmospheric measurements of NF3 with average precisions NF3 produced. Emission factors are shown to have reduced over the last decade; however, rising production and end-use have caused the average global atmospheric concentration to double between 2005 and 2011 i.e. half the atmospheric NF3 present today originates from emissions after 2005. Finally we show the first continuous in situ measurements from La Jolla, California, illustrating how global deployment of our technique could improve the temporal and spatial scale of NF3 'top-down' emission estimates over the coming years. These measurements will be important for independent verification of emissions should NF3 be regulated under a new climate treaty.

  2. Optimizing Global Coronal Magnetic Field Models Using Image-Based Constraints

    Science.gov (United States)

    Jones-Mecholsky, Shaela I.; Davila, Joseph M.; Uritskiy, Vadim

    2016-01-01

    The coronal magnetic field directly or indirectly affects a majority of the phenomena studied in the heliosphere. It provides energy for coronal heating, controls the release of coronal mass ejections, and drives heliospheric and magnetospheric activity, yet the coronal magnetic field itself has proven difficult to measure. This difficulty has prompted a decades-long effort to develop accurate, timely, models of the field, an effort that continues today. We have developed a method for improving global coronal magnetic field models by incorporating the type of morphological constraints that could be derived from coronal images. Here we report promising initial tests of this approach on two theoretical problems, and discuss opportunities for application.

  3. Global optimization of truss topology with discrete bar areas—Part I: Theory of relaxed problems

    DEFF Research Database (Denmark)

    Achtziger, Wolfgang; Stolpe, Mathias

    2008-01-01

    the case of discrete areas. This problem is of major practical relevance if the truss must be built from pre-produced bars with given areas. As a special case, we consider the design problem for a single bar area, i.e., a 0/1-problem. In contrast to heuristic methods considered in other approaches, Part I....... The main issue of the paper and of the approach lies in the fact that the relaxed nonlinear optimization problem can be formulated as a quadratic program (QP). Here the paper generalizes and extends the available theory from the literature. Although the Hessian of this QP is indefinite, it is possible...

  4. Fourier analysis and stochastic processes

    CERN Document Server

    Brémaud, Pierre

    2014-01-01

    This work is unique as it provides a uniform treatment of the Fourier theories of functions (Fourier transforms and series, z-transforms), finite measures (characteristic functions, convergence in distribution), and stochastic processes (including arma series and point processes). It emphasises the links between these three themes. The chapter on the Fourier theory of point processes and signals structured by point processes is a novel addition to the literature on Fourier analysis of stochastic processes. It also connects the theory with recent lines of research such as biological spike signals and ultrawide-band communications. Although the treatment is mathematically rigorous, the convivial style makes the book accessible to a large audience. In particular, it will be interesting to anyone working in electrical engineering and communications, biology (point process signals) and econometrics (arma models). A careful review of the prerequisites (integration and probability theory in the appendix, Hilbert spa...

  5. Quadrature formulas for Fourier coefficients

    KAUST Repository

    Bojanov, Borislav; Petrova, Guergana

    2009-01-01

    We consider quadrature formulas of high degree of precision for the computation of the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials. In particular, we show the uniqueness of a multiple node

  6. Symplectic geometry and Fourier analysis

    CERN Document Server

    Wallach, Nolan R

    2018-01-01

    Suitable for graduate students in mathematics, this monograph covers differential and symplectic geometry, homogeneous symplectic manifolds, Fourier analysis, metaplectic representation, quantization, Kirillov theory. Includes Appendix on Quantum Mechanics by Robert Hermann. 1977 edition.

  7. Slow Light Based On-Chip High Resolution Fourier Transform Spectrometer For Geostationary Imaging of Atmospheric Greenhouse Gases, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — Fourier transform spectroscopy (FTS) in infrared wavelength range is an effective measure for global greenhouse gas monitoring. However, conventional FTS instruments...

  8. Fourier transform nuclear magnetic resonance

    International Nuclear Information System (INIS)

    Geick, R.

    1981-01-01

    This review starts with the basic principles of resonance phenomena in physical systems. Especially, the connection is shown between the properties of these systems and Fourier transforms. Next, we discuss the principles of nuclear magnetic resonance. Starting from the general properties of physical systems showing resonance phenomena and from the special properties of nuclear spin systems, the main part of this paper reviews pulse and Fourier methods in nuclear magnetic resonance. Among pulse methods, an introduction will be given to spin echoes, and, apart from the principle of Fourier transform nuclear magnetic resonance, an introduction to the technical problems of this method, e.g. resolution in the frequency domain, aliasing, phase and intensity errors, stationary state of the spin systems for repetitive measurements, proton decoupling, and application of Fourier methods to systems in a nonequilibrium state. The last section is devoted to special applications of Fourier methods and recent developments, e.g. measurement of relaxation times, solvent peak suppression, 'rapid scan'-method, methods for suppressing the effects of dipolar coupling in solids, two-dimensional Fourier transform nuclear magnetic resonance, and spin mapping or zeugmatography. (author)

  9. A New Filled Function Method with One Parameter for Global Optimization

    Directory of Open Access Journals (Sweden)

    Fei Wei

    2013-01-01

    Full Text Available The filled function method is an effective approach to find the global minimizer of multidimensional multimodal functions. The conventional filled functions are numerically unstable due to exponential or logarithmic term and sensitive to parameters. In this paper, a new filled function with only one parameter is proposed, which is continuously differentiable and proved to satisfy all conditions of the filled function definition. Moreover, this filled function is not sensitive to parameter, and the overflow can not happen for this function. Based on these, a new filled function method is proposed, and it is numerically stable to the initial point and the parameter variable. The computer simulations indicate that the proposed filled function method is efficient and effective.

  10. Towards a globally optimized crop distribution: Integrating water use, nutrition, and economic value

    Science.gov (United States)

    Davis, K. F.; Seveso, A.; Rulli, M. C.; D'Odorico, P.

    2016-12-01

    Human demand for crop production is expected to increase substantially in the coming decades as a result of population growth, richer diets and biofuel use. In order for food production to keep pace, unprecedented amounts of resources - water, fertilizers, energy - will be required. This has led to calls for `sustainable intensification' in which yields are increased on existing croplands while seeking to minimize impacts on water and other agricultural resources. Recent studies have quantified aspects of this, showing that there is a large potential to improve crop yields and increase harvest frequencies to better meet human demand. Though promising, both solutions would necessitate large additional inputs of water and fertilizer in order to be achieved under current technologies. However, the question of whether the current distribution of crops is, in fact, the best for realizing sustainable production has not been considered to date. To this end, we ask: Is it possible to increase crop production and economic value while minimizing water demand by simply growing crops where soil and climate conditions are best suited? Here we use maps of yields and evapotranspiration for 14 major food crops to identify differences between current crop distributions and where they can most suitably be planted. By redistributing crops across currently cultivated lands, we determine the potential improvements in calorie (+12%) and protein (+51%) production, economic output (+41%) and water demand (-5%). This approach can also incorporate the impact of future climate on cropland suitability, and as such, be used to provide optimized cropping patterns under climate change. Thus, our study provides a novel tool towards achieving sustainable intensification that can be used to recommend optimal crop distributions in the face of a changing climate while simultaneously accounting for food security, freshwater resources, and livelihoods.

  11. Review on Doctoral Dissertation: Drago Pupavac: Logistics operator – the factor of dynamic optimization of global logistics chains

    Directory of Open Access Journals (Sweden)

    Ratko Zelenika

    2007-05-01

    Full Text Available The main objective of the scientific research of this doctoral thesis is the effect of the logistics operator in the function of cutting total costs of the global logistics chain. In order to achieve the objective of the research, a number of scientific methods have been applied such as survey methods, methods of dynamic programming and mixed convex programming. Owing to the applied scientific methodology,Drago Pupovac, M.Sc. has successfully interpreted the obtained results by proving that the selective model approach to active participants of the logistics chain gives the logistics operator the insight into potential logistics network, depicts skills of individual operators in the logistics network, specifies logistics activitiesof each logistics venture, provides information on costs of specific logistics activities and in that way proves that it enables logistics operator to optimize logistics chains by protecting them from the demand instability and changes.

  12. Global Time Tomography of Finite Frequency Waves with Optimized Tetrahedral Grids.

    Science.gov (United States)

    Montelli, R.; Montelli, R.; Nolet, G.; Dahlen, F. A.; Masters, G.; Hung, S.

    2001-12-01

    Besides true velocity heterogeneities, tomographic images reflect the effect of data errors, model parametrization, linearization, uncertainties involved with the solution of the forward problem and the greatly inadequate sampling of the earth by seismic rays. These influences cannot be easily separated and often produce artefacts in the final image with amplitudes comparable to those of the velocity heterogeneities. In practice, the tomographer uses some form of damping of the ill-resolved aspects of the model to get a unique solution and reduce the influence of the errors. However damping is not fully adequate, and may reveal a strong influence of the ray path coverage in tomographic images. If some cells are ill determinated regularization techniques may lead to heterogeneity because these cells are damped towards zero. Thus we want a uniform resolution of the parameters in our model. This can be obtained by using an irregular grid with variable length scales. We have introduced an irregular parametrization of the velocity structure by using a Delaunay triangulation. Extensively work on error analysis of tomographic images together with mesh optimization has shown that both resolution and ray density can provide the critical informations needed to re-design grids. However, criteria based on resolution are preferred in the presence of narrow ray beams coming from the same direction. This can be understood if we realise that resolution is not only determined by the number of rays crossing a region, but also by their azimutal coverage. We shall discuss various strategies for grid optimization. In general the computation of the travel times is restricted to ray theory, the infinite frequency approximation of the elastodynamic equation of motion. This simplifies the mathematic and is therefore widely applied in seismic tomography. But ray theory does not account for scattering, wavefront healing and other diffraction effects that render the traveltime of a finite

  13. Global Crisis as Enterprise Software Motivator: from Lifecycle Optimization to Efficient Implementation Series

    Directory of Open Access Journals (Sweden)

    Sergey V. Zykov

    2012-04-01

    Full Text Available It is generally known that software system development lifecycle (SSDL should be managed adequately. The global economy crisis and subsequent depression have taught us certain lessons on the subject, which is so vital for enterprises. The paper presents the adaptive methodology of enterprise SSDL, which allows to avoid "local crises" while producing large-scale software. The methodology is based on extracting common ERP module level patterns and applying them to series of heterogeneous implementations. The approach includes a lifecycle model, which extends conventional spiral model by formal data representation/management models and DSL-based "low-level" CASE tools supporting the formalisms. The methodology has been successfully implemented as a series of portal-based ERP systems in ITERA oil-and-gas corporation, and in a number of trading/banking enterprise applications for other enterprises. Semantic network-based airline dispatch system, and a 6D-model-driven nuclear power plant construction support system are currently in progress. Combining various SSDL models is discussed. Terms-and-cost reduction factors are examined. Correcting SSDL according to project size and scope is overviewed. The so-called “human factor errors” resulting from non-systematic SSDL approach, and their influencing crisis and depression, are analyzed. The ways to systematic and efficient SSDL are outlined. Troubleshooting advises are given for the problems concerned.

  14. Guiding automated NMR structure determination using a global optimization metric, the NMR DP score

    Energy Technology Data Exchange (ETDEWEB)

    Huang, Yuanpeng Janet, E-mail: yphuang@cabm.rutgers.edu; Mao, Binchen; Xu, Fei; Montelione, Gaetano T., E-mail: gtm@rutgers.edu [Rutgers, The State University of New Jersey, Department of Molecular Biology and Biochemistry, Center for Advanced Biotechnology and Medicine, and Northeast Structural Genomics Consortium (United States)

    2015-08-15

    ASDP is an automated NMR NOE assignment program. It uses a distinct bottom-up topology-constrained network anchoring approach for NOE interpretation, with 2D, 3D and/or 4D NOESY peak lists and resonance assignments as input, and generates unambiguous NOE constraints for iterative structure calculations. ASDP is designed to function interactively with various structure determination programs that use distance restraints to generate molecular models. In the CASD–NMR project, ASDP was tested and further developed using blinded NMR data, including resonance assignments, either raw or manually-curated (refined) NOESY peak list data, and in some cases {sup 15}N–{sup 1}H residual dipolar coupling data. In these blinded tests, in which the reference structure was not available until after structures were generated, the fully-automated ASDP program performed very well on all targets using both the raw and refined NOESY peak list data. Improvements of ASDP relative to its predecessor program for automated NOESY peak assignments, AutoStructure, were driven by challenges provided by these CASD–NMR data. These algorithmic improvements include (1) using a global metric of structural accuracy, the discriminating power score, for guiding model selection during the iterative NOE interpretation process, and (2) identifying incorrect NOESY cross peak assignments caused by errors in the NMR resonance assignment list. These improvements provide a more robust automated NOESY analysis program, ASDP, with the unique capability of being utilized with alternative structure generation and refinement programs including CYANA, CNS, and/or Rosetta.

  15. The q-G method : A q-version of the Steepest Descent method for global optimization.

    Science.gov (United States)

    Soterroni, Aline C; Galski, Roberto L; Scarabello, Marluce C; Ramos, Fernando M

    2015-01-01

    In this work, the q-Gradient (q-G) method, a q-version of the Steepest Descent method, is presented. The main idea behind the q-G method is the use of the negative of the q-gradient vector of the objective function as the search direction. The q-gradient vector, or simply the q-gradient, is a generalization of the classical gradient vector based on the concept of Jackson's derivative from the q-calculus. Its use provides the algorithm an effective mechanism for escaping from local minima. The q-G method reduces to the Steepest Descent method when the parameter q tends to 1. The algorithm has three free parameters and it is implemented so that the search process gradually shifts from global exploration in the beginning to local exploitation in the end. We evaluated the q-G method on 34 test functions, and compared its performance with 34 optimization algorithms, including derivative-free algorithms and the Steepest Descent method. Our results show that the q-G method is competitive and has a great potential for solving multimodal optimization problems.

  16. Two-step reconstruction method using global optimization and conjugate gradient for ultrasound-guided diffuse optical tomography.

    Science.gov (United States)

    Tavakoli, Behnoosh; Zhu, Quing

    2013-01-01

    Ultrasound-guided diffuse optical tomography (DOT) is a promising method for characterizing malignant and benign lesions in the female breast. We introduce a new two-step algorithm for DOT inversion in which the optical parameters are estimated with the global optimization method, genetic algorithm. The estimation result is applied as an initial guess to the conjugate gradient (CG) optimization method to obtain the absorption and scattering distributions simultaneously. Simulations and phantom experiments have shown that the maximum absorption and reduced scattering coefficients are reconstructed with less than 10% and 25% errors, respectively. This is in contrast with the CG method alone, which generates about 20% error for the absorption coefficient and does not accurately recover the scattering distribution. A new measure of scattering contrast has been introduced to characterize benign and malignant breast lesions. The results of 16 clinical cases reconstructed with the two-step method demonstrates that, on average, the absorption coefficient and scattering contrast of malignant lesions are about 1.8 and 3.32 times higher than the benign cases, respectively.

  17. Robust breathing signal extraction from cone beam CT projections based on adaptive and global optimization techniques

    International Nuclear Information System (INIS)

    Chao, Ming; Yuan, Yading; Rosenzweig, Kenneth E; Lo, Yeh-Chi; Wei, Jie; Li, Tianfang

    2016-01-01

    We present a study of extracting respiratory signals from cone beam computed tomography (CBCT) projections within the framework of the Amsterdam Shroud (AS) technique. Acquired prior to the radiotherapy treatment, CBCT projections were preprocessed for contrast enhancement by converting the original intensity images to attenuation images with which the AS image was created. An adaptive robust z-normalization filtering was applied to further augment the weak oscillating structures locally. From the enhanced AS image, the respiratory signal was extracted using a two-step optimization approach to effectively reveal the large-scale regularity of the breathing signals. CBCT projection images from five patients acquired with the Varian Onboard Imager on the Clinac iX System Linear Accelerator (Varian Medical Systems, Palo Alto, CA) were employed to assess the proposed technique. Stable breathing signals can be reliably extracted using the proposed algorithm. Reference waveforms obtained using an air bellows belt (Philips Medical Systems, Cleveland, OH) were exported and compared to those with the AS based signals. The average errors for the enrolled patients between the estimated breath per minute (bpm) and the reference waveform bpm can be as low as  −0.07 with the standard deviation 1.58. The new algorithm outperformed the original AS technique for all patients by 8.5% to 30%. The impact of gantry rotation on the breathing signal was assessed with data acquired with a Quasar phantom (Modus Medical Devices Inc., London, Canada) and found to be minimal on the signal frequency. The new technique developed in this work will provide a practical solution to rendering markerless breathing signal using the CBCT projections for thoracic and abdominal patients. (paper)

  18. Moment-tensor solutions estimated using optimal filter theory: Global seismicity, 2001

    Science.gov (United States)

    Sipkin, S.A.; Bufe, C.G.; Zirbes, M.D.

    2003-01-01

    This paper is the 12th in a series published yearly containing moment-tensor solutions computed at the US Geological Survey using an algorithm based on the theory of optimal filter design (Sipkin, 1982 and Sipkin, 1986b). An inversion has been attempted for all earthquakes with a magnitude, mb or MS, of 5.5 or greater. Previous listings include solutions for earthquakes that occurred from 1981 to 2000 (Sipkin, 1986b; Sipkin and Needham, 1989, Sipkin and Needham, 1991, Sipkin and Needham, 1992, Sipkin and Needham, 1993, Sipkin and Needham, 1994a and Sipkin and Needham, 1994b; Sipkin and Zirbes, 1996 and Sipkin and Zirbes, 1997; Sipkin et al., 1998, Sipkin et al., 1999, Sipkin et al., 2000a, Sipkin et al., 2000b and Sipkin et al., 2002).The entire USGS moment-tensor catalog can be obtained via anonymous FTP at ftp://ghtftp.cr.usgs.gov. After logging on, change directory to “momten”. This directory contains two compressed ASCII files that contain the finalized solutions, “mt.lis.Z” and “fmech.lis.Z”. “mt.lis.Z” contains the elements of the moment tensors along with detailed event information; “fmech.lis.Z” contains the decompositions into the principal axes and best double-couples. The fast moment-tensor solutions for more recent events that have not yet been finalized and added to the catalog, are gathered by month in the files “jan01.lis.Z”, etc. “fmech.doc.Z” describes the various fields.

  19. A Mixed Integer Efficient Global Optimization Framework: Applied to the Simultaneous Aircraft Design, Airline Allocation and Revenue Management Problem

    Science.gov (United States)

    Roy, Satadru

    Traditional approaches to design and optimize a new system, often, use a system-centric objective and do not take into consideration how the operator will use this new system alongside of other existing systems. This "hand-off" between the design of the new system and how the new system operates alongside other systems might lead to a sub-optimal performance with respect to the operator-level objective. In other words, the system that is optimal for its system-level objective might not be best for the system-of-systems level objective of the operator. Among the few available references that describe attempts to address this hand-off, most follow an MDO-motivated subspace decomposition approach of first designing a very good system and then provide this system to the operator who decides the best way to use this new system along with the existing systems. The motivating example in this dissertation presents one such similar problem that includes aircraft design, airline operations and revenue management "subspaces". The research here develops an approach that could simultaneously solve these subspaces posed as a monolithic optimization problem. The monolithic approach makes the problem a Mixed Integer/Discrete Non-Linear Programming (MINLP/MDNLP) problem, which are extremely difficult to solve. The presence of expensive, sophisticated engineering analyses further aggravate the problem. To tackle this challenge problem, the work here presents a new optimization framework that simultaneously solves the subspaces to capture the "synergism" in the problem that the previous decomposition approaches may not have exploited, addresses mixed-integer/discrete type design variables in an efficient manner, and accounts for computationally expensive analysis tools. The framework combines concepts from efficient global optimization, Kriging partial least squares, and gradient-based optimization. This approach then demonstrates its ability to solve an 11 route airline network

  20. Grid-Independent Compressive Imaging and Fourier Phase Retrieval

    Science.gov (United States)

    Liao, Wenjing

    2013-01-01

    This dissertation is composed of two parts. In the first part techniques of band exclusion(BE) and local optimization(LO) are proposed to solve linear continuum inverse problems independently of the grid spacing. The second part is devoted to the Fourier phase retrieval problem. Many situations in optics, medical imaging and signal processing call…

  1. General Correlation Theorem for Trinion Fourier Transform

    OpenAIRE

    Bahri, Mawardi

    2017-01-01

    - The trinion Fourier transform is an extension of the Fourier transform in the trinion numbers setting. In this work we derive the correlation theorem for the trinion Fourier transform by using the relation between trinion convolution and correlation definitions in the trinion Fourier transform domains.

  2. Fourier Series, the DFT and Shape Modelling

    DEFF Research Database (Denmark)

    Skoglund, Karl

    2004-01-01

    This report provides an introduction to Fourier series, the discrete Fourier transform, complex geometry and Fourier descriptors for shape analysis. The content is aimed at undergraduate and graduate students who wish to learn about Fourier analysis in general, as well as its application to shape...

  3. Comparative analysis of imaging configurations and objectives for Fourier microscopy.

    Science.gov (United States)

    Kurvits, Jonathan A; Jiang, Mingming; Zia, Rashid

    2015-11-01

    Fourier microscopy is becoming an increasingly important tool for the analysis of optical nanostructures and quantum emitters. However, achieving quantitative Fourier space measurements requires a thorough understanding of the impact of aberrations introduced by optical microscopes that have been optimized for conventional real-space imaging. Here we present a detailed framework for analyzing the performance of microscope objectives for several common Fourier imaging configurations. To this end, we model objectives from Nikon, Olympus, and Zeiss using parameters that were inferred from patent literature and confirmed, where possible, by physical disassembly. We then examine the aberrations most relevant to Fourier microscopy, including the alignment tolerances of apodization factors for different objective classes, the effect of magnification on the modulation transfer function, and vignetting-induced reductions of the effective numerical aperture for wide-field measurements. Based on this analysis, we identify an optimal objective class and imaging configuration for Fourier microscopy. In addition, the Zemax files for the objectives and setups used in this analysis have been made publicly available as a resource for future studies.

  4. Fourier series, Fourier transform and their applications to mathematical physics

    CERN Document Server

    Serov, Valery

    2017-01-01

    This text serves as an introduction to the modern theory of analysis and differential equations with applications in mathematical physics and engineering sciences.  Having outgrown from a series of half-semester courses given at University of Oulu, this book consists of four self-contained parts. The first part, Fourier Series and the Discrete Fourier Transform, is devoted to the classical one-dimensional trigonometric Fourier series with some applications to PDEs and signal processing.  The second part, Fourier Transform and Distributions, is concerned with distribution theory of L. Schwartz and its applications to the Schrödinger and magnetic Schrödinger operations.  The third part, Operator Theory and Integral Equations, is devoted mostly to the self-adjoint but unbounded operators in Hilbert spaces and their applications to integral equations in such spaces. The fourth and final part, Introduction to Partial Differential Equations, serves as an introduction to modern methods for classical theory o...

  5. Fourier series and orthogonal polynomials

    CERN Document Server

    Jackson, Dunham

    2004-01-01

    This text for undergraduate and graduate students illustrates the fundamental simplicity of the properties of orthogonal functions and their developments in related series. Starting with a definition and explanation of the elements of Fourier series, the text follows with examinations of Legendre polynomials and Bessel functions. Boundary value problems consider Fourier series in conjunction with Laplace's equation in an infinite strip and in a rectangle, with a vibrating string, in three dimensions, in a sphere, and in other circumstances. An overview of Pearson frequency functions is followe

  6. FOURIER SERIES MODELS THROUGH TRANSFORMATION

    African Journals Online (AJOL)

    DEPT

    monthly temperature data (1996 – 2005) collected from the National Root ... KEY WORDS: Fourier series, square transformation, multiplicative model, ... fluctuations or movements are often periodic(Ekpeyong,2005). .... significant trend or not, if the trend is not significant, the grand mean may be used as an estimate of trend.

  7. Global 3-D FDTD Maxwell's-Equations Modeling of Ionospheric Disturbances Associated with Earthquakes Using an Optimized Geodesic Grid

    Science.gov (United States)

    Simpson, J. J.; Taflove, A.

    2005-12-01

    We report a finite-difference time-domain (FDTD) computational solution of Maxwell's equations [1] that models the possibility of detecting and characterizing ionospheric disturbances above seismic regions. Specifically, we study anomalies in Schumann resonance spectra in the extremely low frequency (ELF) range below 30 Hz as observed in Japan caused by a hypothetical cylindrical ionospheric disturbance above Taiwan. We consider excitation of the global Earth-ionosphere waveguide by lightning in three major thunderstorm regions of the world: Southeast Asia, South America (Amazon region), and Africa. Furthermore, we investigate varying geometries and characteristics of the ionospheric disturbance above Taiwan. The FDTD technique used in this study enables a direct, full-vector, three-dimensional (3-D) time-domain Maxwell's equations calculation of round-the-world ELF propagation accounting for arbitrary horizontal as well as vertical geometrical and electrical inhomogeneities and anisotropies of the excitation, ionosphere, lithosphere, and oceans. Our entire-Earth model grids the annular lithosphere-atmosphere volume within 100 km of sea level, and contains over 6,500,000 grid-points (63 km laterally between adjacent grid points, 5 km radial resolution). We use our recently developed spherical geodesic gridding technique having a spatial discretization best described as resembling the surface of a soccer ball [2]. The grid is comprised entirely of hexagonal cells except for a small fixed number of pentagonal cells needed for completion. Grid-cell areas and locations are optimized to yield a smoothly varying area difference between adjacent cells, thereby maximizing numerical convergence. We compare our calculated results with measured data prior to the Chi-Chi earthquake in Taiwan as reported by Hayakawa et. al. [3]. Acknowledgement This work was suggested by Dr. Masashi Hayakawa, University of Electro-Communications, Chofugaoka, Chofu Tokyo. References [1] A

  8. Enhancement of the REMix energy system model. Global renewable energy potentials, optimized power plant siting and scenario validation

    Energy Technology Data Exchange (ETDEWEB)

    Stetter, Daniel

    2014-04-10

    As electricity generation based on volatile renewable resources is subject to fluctuations, data with high temporal and spatial resolution on their availability is indispensable for integrating large shares of renewable capacities into energy infrastructures. The scope of the present doctoral thesis is to enhance the existing energy modelling environment REMix in terms of (i.) extending the geographic coverage of the potential assessment tool REMix-EnDaT from a European to a global scale, (ii.) adding a new plant siting optimization module REMix-PlaSMo, capable of assessing siting effects of renewable power plants on the portfolio output and (iii.) adding a new alternating current power transmission model between 30 European countries and CSP electricity imports from power plants located in North Africa and the Middle East via high voltage direct current links into the module REMix-OptiMo. With respect to the global potential assessment tool, a thorough investigation is carried out creating an hourly global inventory of the theoretical potentials of the major renewable resources solar irradiance, wind speed and river discharge at a spatial resolution of 0.45°x0.45°. A detailed global land use analysis determines eligible sites for the installation of renewable power plants. Detailed power plant models for PV, CSP, wind and hydro power allow for the assessment of power output, cost per kWh and respective full load hours taking into account the theoretical potentials, technological as well as economic data. The so-obtined tool REMix-EnDaT can be used as follows: First, as an assessment tool for arbitrary geographic locations, countries or world regions, deriving either site-specific or aggregated installable capacities, cost as well as full load hour potentials. Second, as a tool providing input data such as installable capacities and hourly renewable electricity generation for further assessments using the modules REMix-PlasMo and OptiMo. The plant siting tool

  9. Enhancement of the REMix energy system model. Global renewable energy potentials, optimized power plant siting and scenario validation

    International Nuclear Information System (INIS)

    Stetter, Daniel

    2014-01-01

    As electricity generation based on volatile renewable resources is subject to fluctuations, data with high temporal and spatial resolution on their availability is indispensable for integrating large shares of renewable capacities into energy infrastructures. The scope of the present doctoral thesis is to enhance the existing energy modelling environment REMix in terms of (i.) extending the geographic coverage of the potential assessment tool REMix-EnDaT from a European to a global scale, (ii.) adding a new plant siting optimization module REMix-PlaSMo, capable of assessing siting effects of renewable power plants on the portfolio output and (iii.) adding a new alternating current power transmission model between 30 European countries and CSP electricity imports from power plants located in North Africa and the Middle East via high voltage direct current links into the module REMix-OptiMo. With respect to the global potential assessment tool, a thorough investigation is carried out creating an hourly global inventory of the theoretical potentials of the major renewable resources solar irradiance, wind speed and river discharge at a spatial resolution of 0.45°x0.45°. A detailed global land use analysis determines eligible sites for the installation of renewable power plants. Detailed power plant models for PV, CSP, wind and hydro power allow for the assessment of power output, cost per kWh and respective full load hours taking into account the theoretical potentials, technological as well as economic data. The so-obtined tool REMix-EnDaT can be used as follows: First, as an assessment tool for arbitrary geographic locations, countries or world regions, deriving either site-specific or aggregated installable capacities, cost as well as full load hour potentials. Second, as a tool providing input data such as installable capacities and hourly renewable electricity generation for further assessments using the modules REMix-PlasMo and OptiMo. The plant siting tool

  10. A global bioheat model with self-tuning optimal regulation of body temperature using Hebbian feedback covariance learning.

    Science.gov (United States)

    Ong, M L; Ng, E Y K

    2005-12-01

    In the lower brain, body temperature is continually being regulated almost flawlessly despite huge fluctuations in ambient and physiological conditions that constantly threaten the well-being of the body. The underlying control problem defining thermal homeostasis is one of great enormity: Many systems and sub-systems are involved in temperature regulation and physiological processes are intrinsically complex and intertwined. Thus the defining control system has to take into account the complications of nonlinearities, system uncertainties, delayed feedback loops as well as internal and external disturbances. In this paper, we propose a self-tuning adaptive thermal controller based upon Hebbian feedback covariance learning where the system is to be regulated continually to best suit its environment. This hypothesis is supported in part by postulations of the presence of adaptive optimization behavior in biological systems of certain organisms which face limited resources vital for survival. We demonstrate the use of Hebbian feedback covariance learning as a possible self-adaptive controller in body temperature regulation. The model postulates an important role of Hebbian covariance adaptation as a means of reinforcement learning in the thermal controller. The passive system is based on a simplified 2-node core and shell representation of the body, where global responses are captured. Model predictions are consistent with observed thermoregulatory responses to conditions of exercise and rest, and heat and cold stress. An important implication of the model is that optimal physiological behaviors arising from self-tuning adaptive regulation in the thermal controller may be responsible for the departure from homeostasis in abnormal states, e.g., fever. This was previously unexplained using the conventional "set-point" control theory.

  11. Characterizing Global Flood Wave Travel Times to Optimize the Utility of Near Real-Time Satellite Remote Sensing Products

    Science.gov (United States)

    Allen, G. H.; David, C. H.; Andreadis, K. M.; Emery, C. M.; Famiglietti, J. S.

    2017-12-01

    Earth observing satellites provide valuable near real-time (NRT) information about flood occurrence and magnitude worldwide. This NRT information can be used in early flood warning systems and other flood management applications to save lives and mitigate flood damage. However, these NRT products are only useful to early flood warning systems if they are quickly made available, with sufficient time for flood mitigation actions to be implemented. More specifically, NRT data latency, or the time period between the satellite observation and when the user has access to the information, must be less than the time it takes a flood to travel from the flood observation location to a given downstream point of interest. Yet the paradigm that "lower latency is always better" may not necessarily hold true in river systems due to tradeoffs between data latency and data quality. Further, the existence of statistical breaks in the global distribution of flood wave travel time (i.e. a jagged statistical distribution) would represent preferable latencies for river-observation NRT remote sensing products. Here we present a global analysis of flood wave velocity (i.e. flow celerity) and travel time. We apply a simple kinematic wave model to a global hydrography dataset and calculate flow wave celerity and travel time during bankfull flow conditions. Bankfull flow corresponds to the condition of maximum celerity and thus we present the "worst-case scenario" minimum flow wave travel time. We conduct a similar analysis with respect to the time it takes flood waves to reach the next downstream city, as well as the next downstream reservoir. Finally, we conduct these same analyses, but with regards to the technical capabilities of the planned Surface Water and Ocean Topography (SWOT) satellite mission, which is anticipated to provide waterbody elevation and extent measurements at an unprecedented spatial and temporal resolution. We validate these results with discharge records from paired

  12. Global Maximum Power Point Tracking (MPPT of a Photovoltaic Module Array Constructed through Improved Teaching-Learning-Based Optimization

    Directory of Open Access Journals (Sweden)

    Kuei-Hsiang Chao

    2016-11-01

    Full Text Available The present study proposes a maximum power point tracking (MPPT method in which improved teaching-learning-based optimization (I-TLBO is applied to perform global MPPT of photovoltaic (PV module arrays under dissimilar shading situations to ensure the maximum power output of the module arrays. The proposed I-TLBO enables the automatic adjustment of teaching factors according to the self-learning ability of students. Incorporating smart-tracking and self-study strategies can effectively improve the tracking response speed and steady-state tracking performance. To evaluate the feasibility of the proposed I-TLBO, a HIP-2717 PV module array from Sanyo Electric was employed to compose various arrays with different serial and parallel configurations. The arrays were operated under different shading conditions to test the MPPT with double, triple, or quadruple peaks of power-voltage characteristic curves. Boost converters were employed with TMS320F2808 digital signal processors to test the proposed MPPT method. Empirical results confirm that the proposed method exhibits more favorable dynamic and static-state response tracking performance compared with that of conventional TLBO.

  13. COOLING MICROELECTRONIC DEVICES USING OPTIMAL MICROCHANNEL HEAT SINKS: UNA COMPARACIÓN DE DOS ALGORITMOS DE OPTIMIZACIÓN GLOBAL

    Directory of Open Access Journals (Sweden)

    Jorge Mario Cruz Duarte

    Full Text Available This article deals with the design of optimum microchannel heat sinks through Unified Particle Swarm Optimisation (UPSO and Harmony Search (HS. These heat sinks are used for the thermal management of electronic devices, and we analyse the performance of UPSO and HS in their design, both, systematically and thoroughly. The objective function was created using the entropy generation minimisation criterion. In this study, we fixed the geometry of the microchannel, the amount of heat to be removed, and the properties of the cooling fluid. Moreover, we calculated the entropy generation rate, the volume flow rate of air, the channel width, the channel height, and the Knudsen number. The results of several simulation optimizations indicate that both global optimisation strategies yielded similar results, about 0.032 W/K, and that HS required five times more iterations than UPSO, but only about a nineteenth of its computation time. In addition, HS revealed a greater chance (about three times of finding a better solution than UPSO, but with a higher dispersion rate (about five times. Nonetheless, both algorithms successfully optimised the design for different scenarios, even when varying the material of the heat sink, and for different heat transfer rates.

  14. Accelerating the SCE-UA Global Optimization Method Based on Multi-Core CPU and Many-Core GPU

    Directory of Open Access Journals (Sweden)

    Guangyuan Kan

    2016-01-01

    Full Text Available The famous global optimization SCE-UA method, which has been widely used in the field of environmental model parameter calibration, is an effective and robust method. However, the SCE-UA method has a high computational load which prohibits the application of SCE-UA to high dimensional and complex problems. In recent years, the hardware of computer, such as multi-core CPUs and many-core GPUs, improves significantly. These much more powerful new hardware and their software ecosystems provide an opportunity to accelerate the SCE-UA method. In this paper, we proposed two parallel SCE-UA methods and implemented them on Intel multi-core CPU and NVIDIA many-core GPU by OpenMP and CUDA Fortran, respectively. The Griewank benchmark function was adopted in this paper to test and compare the performances of the serial and parallel SCE-UA methods. According to the results of the comparison, some useful advises were given to direct how to properly use the parallel SCE-UA methods.

  15. Optimal selective renewal policy for systems subject to propagated failures with global effect and failure isolation phenomena

    International Nuclear Information System (INIS)

    Maaroufi, Ghofrane; Chelbi, Anis; Rezg, Nidhal

    2013-01-01

    This paper considers a selective maintenance policy for multi-component systems for which a minimum level of reliability is required for each mission. Such systems need to be maintained between consecutive missions. The proposed strategy aims at selecting the components to be maintained (renewed) after the completion of each mission such that a required reliability level is warranted up to the next stop with the minimum cost, taking into account the time period allotted for maintenance between missions and the possibility to extend it while paying a penalty cost. This strategy is applied to binary-state systems subject to propagated failures with global effect, and failure isolation phenomena. A set of rules to reduce the solutions space for such complex systems is developed. A numerical example is presented to illustrate the modeling approach and the use of the reduction rules. Finally, the Monte-Carlo simulation is used in combination with the selective maintenance optimization model to deal with a number of successive missions

  16. Fourier-Based Fast Multipole Method for the Helmholtz Equation

    KAUST Repository

    Cecka, Cris

    2013-01-01

    The fast multipole method (FMM) has had great success in reducing the computational complexity of solving the boundary integral form of the Helmholtz equation. We present a formulation of the Helmholtz FMM that uses Fourier basis functions rather than spherical harmonics. By modifying the transfer function in the precomputation stage of the FMM, time-critical stages of the algorithm are accelerated by causing the interpolation operators to become straightforward applications of fast Fourier transforms, retaining the diagonality of the transfer function, and providing a simplified error analysis. Using Fourier analysis, constructive algorithms are derived to a priori determine an integration quadrature for a given error tolerance. Sharp error bounds are derived and verified numerically. Various optimizations are considered to reduce the number of quadrature points and reduce the cost of computing the transfer function. © 2013 Society for Industrial and Applied Mathematics.

  17. On the Alignment of Shapes Represented by Fourier Descriptors

    DEFF Research Database (Denmark)

    Sjöstrand, Karl; Ericsson, Anders; Larsen, Rasmus

    2006-01-01

    The representation of shapes by Fourier descriptors is a time-honored technique that has received relatively little attention lately. Nevertheless, it has many benefits and is applicable for describing a range of medical structures in two dimensions. Delineations in medical applications often...... consist of continuous outlines of structures, where no information of correspondence between samples exist. In this article, we discuss an alignment method that works directly with the functional representation of Fourier descriptors, and that is optimal in a least-squares sense. With corresponding...... represented by common landmarks can be constructed in an automatic fashion. If the aligned Fourier descriptors are inverse transformed from the frequency domain to the spatial domain, a set of roughly aligned landmarks are obtained. The positions of these are then adjusted along the contour of the objects...

  18. Global optimization at work

    NARCIS (Netherlands)

    Hendrix, E.M.T.

    1998-01-01

    In many research situations where mathematical models are used, researchers try to find parameter values such that a given performance criterion is at an optimum. If the parameters can be varied in a continuous way, this in general defines a so-called Nonlinear Programming Problem. Methods

  19. Implementing the global plan to stop TB, 2011-2015 - optimizing allocations and the global fund's contribution: A scenario projections study

    NARCIS (Netherlands)

    E.L. Korenromp (Eline); P. Glaziou (Philippe); C. Fitzpatrick (Christopher); K. Floyd (Katherine); M. Hosseini (Mehran); M.C. Raviglione (Mario); R. Atun (Rifat); B. Williams (Brian)

    2012-01-01

    textabstractBackground: The Global Plan to Stop TB estimates funding required in low- and middle-income countries to achieve TB control targets set by the Stop TB Partnership within the context of the Millennium Development Goals. We estimate the contribution and impact of Global Fund investments

  20. From Fourier analysis to wavelets

    CERN Document Server

    Gomes, Jonas

    2015-01-01

    This text introduces the basic concepts of function spaces and operators, both from the continuous and discrete viewpoints.  Fourier and Window Fourier Transforms are introduced and used as a guide to arrive at the concept of Wavelet transform.  The fundamental aspects of multiresolution representation, and its importance to function discretization and to the construction of wavelets is also discussed. Emphasis is given on ideas and intuition, avoiding the heavy computations which are usually involved in the study of wavelets.  Readers should have a basic knowledge of linear algebra, calculus, and some familiarity with complex analysis.  Basic knowledge of signal and image processing is desirable. This text originated from a set of notes in Portuguese that the authors wrote for a wavelet course on the Brazilian Mathematical Colloquium in 1997 at IMPA, Rio de Janeiro.

  1. Compact Microwave Fourier Spectrum Analyzer

    Science.gov (United States)

    Savchenkov, Anatoliy; Matsko, Andrey; Strekalov, Dmitry

    2009-01-01

    A compact photonic microwave Fourier spectrum analyzer [a Fourier-transform microwave spectrometer, (FTMWS)] with no moving parts has been proposed for use in remote sensing of weak, natural microwave emissions from the surfaces and atmospheres of planets to enable remote analysis and determination of chemical composition and abundances of critical molecular constituents in space. The instrument is based on a Bessel beam (light modes with non-zero angular momenta) fiber-optic elements. It features low power consumption, low mass, and high resolution, without a need for any cryogenics, beyond what is achievable by the current state-of-the-art in space instruments. The instrument can also be used in a wide-band scatterometer mode in active radar systems.

  2. Uncertainty Principles and Fourier Analysis

    Indian Academy of Sciences (India)

    analysis on the part of the reader. Those who are not fa- miliar with Fourier analysis are encouraged to look up Box. 1 along with [3]. (A) Heisenberg's inequality: Let us measure concentration in terms of standard deviation i.e. for a square integrable func-. 00 tion defined on 1R and normalized so that J If(x)12d,x = 1,. -00. 00.

  3. An introduction to Fourier series and integrals

    CERN Document Server

    Seeley, Robert T

    2006-01-01

    This compact guide emphasizes the relationship between physics and mathematics, introducing Fourier series in the way that Fourier himself used them: as solutions of the heat equation in a disk. 1966 edition.

  4. Properties of the distributional finite Fourier transform

    OpenAIRE

    Carmichael, Richard D.

    2016-01-01

    The analytic functions in tubes which obtain the distributional finite Fourier transform as boundary value are shown to have a strong boundedness property and to be recoverable as a Fourier-Laplace transform, a distributional finite Fourier transform, and as a Cauchy integral of a distribution associated with the boundary value.

  5. Fourier techniques in X-ray timing

    NARCIS (Netherlands)

    van der Klis, M.

    1988-01-01

    Basic principles of Fourier techniques often used in X-ray time series analysis are reviewed. The relation between the discrete Fourier transform and the continuous Fourier transform is discussed to introduce the concepts of windowing and aliasing. The relation is derived between the power spectrum

  6. The clustering of the SDSS-IV extended Baryon Oscillation Spectroscopic Survey DR14 quasar sample: anisotropic Baryon Acoustic Oscillations measurements in Fourier-space with optimal redshift weights

    Science.gov (United States)

    Wang, Dandan; Zhao, Gong-Bo; Wang, Yuting; Percival, Will J.; Ruggeri, Rossana; Zhu, Fangzhou; Tojeiro, Rita; Myers, Adam D.; Chuang, Chia-Hsun; Baumgarten, Falk; Zhao, Cheng; Gil-Marín, Héctor; Ross, Ashley J.; Burtin, Etienne; Zarrouk, Pauline; Bautista, Julian; Brinkmann, Jonathan; Dawson, Kyle; Brownstein, Joel R.; de la Macorra, Axel; Schneider, Donald P.; Shafieloo, Arman

    2018-06-01

    We present a measurement of the anisotropic and isotropic Baryon Acoustic Oscillations (BAO) from the extended Baryon Oscillation Spectroscopic Survey Data Release 14 quasar sample with optimal redshift weights. Applying the redshift weights improves the constraint on the BAO dilation parameter α(zeff) by 17 per cent. We reconstruct the evolution history of the BAO distance indicators in the redshift range of 0.8 < z < 2.2. This paper is part of a set that analyses the eBOSS DR14 quasar sample.

  7. Improved Fourier-transform profilometry

    International Nuclear Information System (INIS)

    Mao Xianfu; Chen Wenjing; Su Xianyu

    2007-01-01

    An improved optical geometry of the projected-fringe profilometry technique, in which the exit pupil of the projecting lens and the entrance pupil of the imaging lens are neither at the same height above the reference plane nor coplanar, is discussed and used in Fourier-transform profilometry. Furthermore, an improved fringe-pattern description and phase-height mapping formula based on the improved geometrical generalization is deduced. Employing the new optical geometry, it is easier for us to obtain the full-field fringe by moving either the projector or the imaging device. Therefore the new method offers a flexible way to obtain reliable height distribution of a measured object

  8. Fourier-transform optical microsystems

    Science.gov (United States)

    Collins, S. D.; Smith, R. L.; Gonzalez, C.; Stewart, K. P.; Hagopian, J. G.; Sirota, J. M.

    1999-01-01

    The design, fabrication, and initial characterization of a miniature single-pass Fourier-transform spectrometer (FTS) that has an optical bench that measures 1 cm x 5 cm x 10 cm is presented. The FTS is predicated on the classic Michelson interferometer design with a moving mirror. Precision translation of the mirror is accomplished by microfabrication of dovetailed bearing surfaces along single-crystal planes in silicon. Although it is miniaturized, the FTS maintains a relatively high spectral resolution, 0.1 cm-1, with adequate optical throughput.

  9. Fourier analysis and its applications

    CERN Document Server

    Folland, Gerald B

    2009-01-01

    This book presents the theory and applications of Fourier series and integrals, eigenfunction expansions, and related topics, on a level suitable for advanced undergraduates. It includes material on Bessel functions, orthogonal polynomials, and Laplace transforms, and it concludes with chapters on generalized functions and Green's functions for ordinary and partial differential equations. The book deals almost exclusively with aspects of these subjects that are useful in physics and engineering, and includes a wide variety of applications. On the theoretical side, it uses ideas from modern ana

  10. Fourier Transform Methods. Chapter 4

    Science.gov (United States)

    Kaplan, Simon G.; Quijada, Manuel A.

    2015-01-01

    This chapter describes the use of Fourier transform spectrometers (FTS) for accurate spectrophotometry over a wide spectral range. After a brief exposition of the basic concepts of FTS operation, we discuss instrument designs and their advantages and disadvantages relative to dispersive spectrometers. We then examine how common sources of error in spectrophotometry manifest themselves when using an FTS and ways to reduce the magnitude of these errors. Examples are given of applications to both basic and derived spectrophotometric quantities. Finally, we give recommendations for choosing the right instrument for a specific application, and how to ensure the accuracy of the measurement results..

  11. Fourier Spectroscopy: A Bayesian Way

    Directory of Open Access Journals (Sweden)

    Stefan Schmuck

    2017-01-01

    Full Text Available The concepts of standard analysis techniques applied in the field of Fourier spectroscopy treat fundamental aspects insufficiently. For example, the spectra to be inferred are influenced by the noise contribution to the interferometric data, by nonprobed spatial domains which are linked to Fourier coefficients above a certain order, by the spectral limits which are in general not given by the Nyquist assumptions, and by additional parameters of the problem at hand like the zero-path difference. To consider these fundamentals, a probabilistic approach based on Bayes’ theorem is introduced which exploits multivariate normal distributions. For the example application, we model the spectra by the Gaussian process of a Brownian bridge stated by a prior covariance. The spectra themselves are represented by a number of parameters which map linearly to the data domain. The posterior for these linear parameters is analytically obtained, and the marginalisation over these parameters is trivial. This allows the straightforward investigation of the posterior for the involved nonlinear parameters, like the zero-path difference location and the spectral limits, and hyperparameters, like the scaling of the Gaussian process. With respect to the linear problem, this can be interpreted as an implementation of Ockham’s razor principle.

  12. Pointwise convergence of Fourier series

    CERN Document Server

    Arias de Reyna, Juan

    2002-01-01

    This book contains a detailed exposition of Carleson-Hunt theorem following the proof of Carleson: to this day this is the only one giving better bounds. It points out the motivation of every step in the proof. Thus the Carleson-Hunt theorem becomes accessible to any analyst.The book also contains the first detailed exposition of the fine results of Hunt, Sjölin, Soria, etc on the convergence of Fourier Series. Its final chapters present original material. With both Fefferman's proof and the recent one of Lacey and Thiele in print, it becomes more important than ever to understand and compare these two related proofs with that of Carleson and Hunt. These alternative proofs do not yield all the results of the Carleson-Hunt proof. The intention of this monograph is to make Carleson's proof accessible to a wider audience, and to explain its consequences for the pointwise convergence of Fourier series for functions in spaces near $äcal Lü^1$, filling a well-known gap in the literature.

  13. HEART ABNORMALITY CLASSIFICATIONS USING FOURIER TRANSFORMS METHOD AND NEURAL NETWORKS

    Directory of Open Access Journals (Sweden)

    Endah Purwanti

    2014-05-01

    Full Text Available Health problems with cardiovascular system disorder are still ranked high globally. One way to detect abnormalities in the cardiovascular system especially in the heart is through the electrocardiogram (ECG reading. However, reading ECG recording needs experience and expertise, software-based neural networks has designed to help identify any abnormalities ofthe heart through electrocardiogram digital image. This image is processed using image processing methods to obtain ordinate chart which representing the heart’s electrical potential. Feature extraction using Fourier transforms which are divided into several numbers of coefficients. As the software input, Fourier transforms coefficient have been normalized. Output of this software is divided into three classes, namely heart with atrial fibrillation, coronary heart disease and normal. Maximum accuracy rate ofthis software is 95.45%, with the distribution of the Fourier transform coefficients 1/8 and number of nodes 5, while minimum accuracy rate of this software at least 68.18% by distribution of the Fourier transform coefficients 1/32 and the number of nodes 32. Overall result accuracy rate of this software has an average of86.05% and standard deviation of7.82.

  14. Precise and fast spatial-frequency analysis using the iterative local Fourier transform.

    Science.gov (United States)

    Lee, Sukmock; Choi, Heejoo; Kim, Dae Wook

    2016-09-19

    The use of the discrete Fourier transform has decreased since the introduction of the fast Fourier transform (fFT), which is a numerically efficient computing process. This paper presents the iterative local Fourier transform (ilFT), a set of new processing algorithms that iteratively apply the discrete Fourier transform within a local and optimal frequency domain. The new technique achieves 210 times higher frequency resolution than the fFT within a comparable computation time. The method's superb computing efficiency, high resolution, spectrum zoom-in capability, and overall performance are evaluated and compared to other advanced high-resolution Fourier transform techniques, such as the fFT combined with several fitting methods. The effectiveness of the ilFT is demonstrated through the data analysis of a set of Talbot self-images (1280 × 1024 pixels) obtained with an experimental setup using grating in a diverging beam produced by a coherent point source.

  15. Edge-augmented Fourier partial sums with applications to Magnetic Resonance Imaging (MRI)

    Science.gov (United States)

    Larriva-Latt, Jade; Morrison, Angela; Radgowski, Alison; Tobin, Joseph; Iwen, Mark; Viswanathan, Aditya

    2017-08-01

    Certain applications such as Magnetic Resonance Imaging (MRI) require the reconstruction of functions from Fourier spectral data. When the underlying functions are piecewise-smooth, standard Fourier approximation methods suffer from the Gibbs phenomenon - with associated oscillatory artifacts in the vicinity of edges and an overall reduced order of convergence in the approximation. This paper proposes an edge-augmented Fourier reconstruction procedure which uses only the first few Fourier coefficients of an underlying piecewise-smooth function to accurately estimate jump information and then incorporate it into a Fourier partial sum approximation. We provide both theoretical and empirical results showing the improved accuracy of the proposed method, as well as comparisons demonstrating superior performance over existing state-of-the-art sparse optimization-based methods.

  16. Applications of Fourier transforms to generalized functions

    CERN Document Server

    Rahman, M

    2011-01-01

    This book explains how Fourier transforms can be applied to generalized functions. The generalized function is one of the important branches of mathematics and is applicable in many practical fields. Its applications to the theory of distribution and signal processing are especially important. The Fourier transform is a mathematical procedure that can be thought of as transforming a function from its time domain to the frequency domain.The book contains six chapters and three appendices. Chapter 1 deals with preliminary remarks on Fourier series from a general point of view and also contains an introduction to the first generalized function. Chapter 2 is concerned with the generalized functions and their Fourier transforms. Chapter 3 contains the Fourier transforms of particular generalized functions. The author has stated and proved 18 formulas dealing with the Fourier transforms of generalized functions, and demonstrated some important problems of practical interest. Chapter 4 deals with the asymptotic esti...

  17. Global Optimization of Ventricular Myocyte Model to Multi-Variable Objective Improves Predictions of Drug-Induced Torsades de Pointes

    Directory of Open Access Journals (Sweden)

    Trine Krogh-Madsen

    2017-12-01

    Full Text Available In silico cardiac myocyte models present powerful tools for drug safety testing and for predicting phenotypical consequences of ion channel mutations, but their accuracy is sometimes limited. For example, several models describing human ventricular electrophysiology perform poorly when simulating effects of long QT mutations. Model optimization represents one way of obtaining models with stronger predictive power. Using a recent human ventricular myocyte model, we demonstrate that model optimization to clinical long QT data, in conjunction with physiologically-based bounds on intracellular calcium and sodium concentrations, better constrains model parameters. To determine if the model optimized to congenital long QT data better predicts risk of drug-induced long QT arrhythmogenesis, in particular Torsades de Pointes risk, we tested the optimized model against a database of known arrhythmogenic and non-arrhythmogenic ion channel blockers. When doing so, the optimized model provided an improved risk assessment. In particular, we demonstrate an elimination of false-positive outcomes generated by the baseline model, in which simulations of non-torsadogenic drugs, in particular verapamil, predict action potential prolongation. Our results underscore the importance of currents beyond those directly impacted by a drug block in determining torsadogenic risk. Our study also highlights the need for rich data in cardiac myocyte model optimization and substantiates such optimization as a method to generate models with higher accuracy of predictions of drug-induced cardiotoxicity.

  18. Handbook of Fourier analysis & its applications

    CERN Document Server

    Marks, Robert J

    2009-01-01

    Fourier analysis has many scientific applications - in physics, number theory, combinatorics, signal processing, probability theory, statistics, option pricing, cryptography, acoustics, oceanography, optics and diffraction, geometry, and other areas. In signal processing and related fields, Fourier analysis is typically thought of as decomposing a signal into its component frequencies and their amplitudes. This practical, applications-based professional handbook comprehensively covers the theory and applications of Fourier Analysis, spanning topics from engineering mathematics, signal process

  19. Fourier transform n.m.r. spectroscopy

    International Nuclear Information System (INIS)

    Shaw, D.

    1976-01-01

    This book is orientated to techniques rather than applications. The basic theory of n.m.r. is dealt with in a unified approach to the Fourier theory. The middle section of the book concentrates on the practical aspects of Fourier n.m.r., both instrumental and experimental. The final chapters briefly cover general application of n.m.r., but concentrate strongly on those areas where Fourier n.m.r. can give information which is not available by conventional techniques

  20. A simple approach to Fourier aliasing

    International Nuclear Information System (INIS)

    Foadi, James

    2007-01-01

    In the context of discrete Fourier transforms the idea of aliasing as due to approximation errors in the integral defining Fourier coefficients is introduced and explained. This has the positive pedagogical effect of getting to the heart of sampling and the discrete Fourier transform without having to delve into effective, but otherwise long and structured, introductions to the topic, commonly met in advanced, specialized books

  1. Tunable fractional-order Fourier transformer

    International Nuclear Information System (INIS)

    Malyutin, A A

    2006-01-01

    A fractional two-dimensional Fourier transformer whose orders are tuned by means of optical quadrupoles is described. It is shown that in the optical scheme considered, the Fourier-transform order a element of [0,1] in one of the mutually orthogonal planes corresponds to the transform order (2-a) in another plane, i.e., to inversion and inverse Fourier transform of the order a. (laser modes and beams)

  2. Fourier transform n. m. r. spectroscopy

    Energy Technology Data Exchange (ETDEWEB)

    Shaw, D [Varian Ltd., Walton (UK)

    1976-01-01

    This book is orientated to techniques rather than applications. The basic theory of n.m.r. is dealt with in a unified approach to the Fourier theory. The middle section of the book concentrates on the practical aspects of Fourier n.m.r., both instrumental and experimental. The final chapters briefly cover general application of n.m.r., but concentrate strongly on those areas where Fourier n.m.r. can give information which is not available by conventional techniques.

  3. Global parameter optimization of a Mather-type plasma focus in the framework of the Gratton–Vargas two-dimensional snowplow model

    International Nuclear Information System (INIS)

    Auluck, S K H

    2014-01-01

    Dense plasma focus (DPF) is known to produce highly energetic ions, electrons and plasma environment which can be used for breeding short-lived isotopes, plasma nanotechnology and other material processing applications. Commercial utilization of DPF in such areas would need a design tool that can be deployed in an automatic search for the best possible device configuration for a given application. The recently revisited (Auluck 2013 Phys. Plasmas 20 112501) Gratton–Vargas (GV) two-dimensional analytical snowplow model of plasma focus provides a numerical formula for dynamic inductance of a Mather-type plasma focus fitted to thousands of automated computations, which enables the construction of such a design tool. This inductance formula is utilized in the present work to explore global optimization, based on first-principles optimality criteria, in a four-dimensional parameter-subspace of the zero-resistance GV model. The optimization process is shown to reproduce the empirically observed constancy of the drive parameter over eight decades in capacitor bank energy. The optimized geometry of plasma focus normalized to the anode radius is shown to be independent of voltage, while the optimized anode radius is shown to be related to capacitor bank inductance. (paper)

  4. A nonlinear support vector machine model with hard penalty function based on glowworm swarm optimization for forecasting daily global solar radiation

    International Nuclear Information System (INIS)

    Jiang, He; Dong, Yao

    2016-01-01

    Highlights: • Eclat data mining algorithm is used to determine the possible predictors. • Support vector machine is converted into a ridge regularization problem. • Hard penalty selects the number of radial basis functions to simply the structure. • Glowworm swarm optimization is utilized to determine the optimal parameters. - Abstract: For a portion of the power which is generated by grid connected photovoltaic installations, an effective solar irradiation forecasting approach must be crucial to ensure the quality and the security of power grid. This paper develops and investigates a novel model to forecast 30 daily global solar radiation at four given locations of the United States. Eclat data mining algorithm is first presented to discover association rules between solar radiation and several meteorological factors laying a theoretical foundation for these correlative factors as input vectors. An effective and innovative intelligent optimization model based on nonlinear support vector machine and hard penalty function is proposed to forecast solar radiation by converting support vector machine into a regularization problem with ridge penalty, adding a hard penalty function to select the number of radial basis functions, and using glowworm swarm optimization algorithm to determine the optimal parameters of the model. In order to illustrate our validity of the proposed method, the datasets at four sites of the United States are split to into training data and test data, separately. The experiment results reveal that the proposed model delivers the best forecasting performances comparing with other competitors.

  5. Optimal voxel size for measuring global gray and white matter proton metabolite concentrations using chemical shift imaging

    DEFF Research Database (Denmark)

    Hanson, Lars Peter Grüner; Adalsteinsson, E; Pfefferbaum, A

    2000-01-01

    Quantification of gray and white matter levels of spectroscopically visible metabolites can provide important insights into brain development and pathological conditions. Chemical shift imaging offers a gain in efficiency for estimation of global gray and white matter metabolite concentrations co...

  6. Metasurface Enabled Wide-Angle Fourier Lens.

    Science.gov (United States)

    Liu, Wenwei; Li, Zhancheng; Cheng, Hua; Tang, Chengchun; Li, Junjie; Zhang, Shuang; Chen, Shuqi; Tian, Jianguo

    2018-06-01

    Fourier optics, the principle of using Fourier transformation to understand the functionalities of optical elements, lies at the heart of modern optics, and it has been widely applied to optical information processing, imaging, holography, etc. While a simple thin lens is capable of resolving Fourier components of an arbitrary optical wavefront, its operation is limited to near normal light incidence, i.e., the paraxial approximation, which puts a severe constraint on the resolvable Fourier domain. As a result, high-order Fourier components are lost, resulting in extinction of high-resolution information of an image. Other high numerical aperture Fourier lenses usually suffer from the bulky size and costly designs. Here, a dielectric metasurface consisting of high-aspect-ratio silicon waveguide array is demonstrated experimentally, which is capable of performing 1D Fourier transform for a large incident angle range and a broad operating bandwidth. Thus, the device significantly expands the operational Fourier space, benefitting from the large numerical aperture and negligible angular dispersion at large incident angles. The Fourier metasurface will not only facilitate efficient manipulation of spatial spectrum of free-space optical wavefront, but also be readily integrated into micro-optical platforms due to its compact size. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  7. Efficacy of very fast simulated annealing global optimization method for interpretation of self-potential anomaly by different forward formulation over 2D inclined sheet type structure

    Science.gov (United States)

    Biswas, A.; Sharma, S. P.

    2012-12-01

    Self-Potential anomaly is an important geophysical technique that measures the electrical potential due natural source of current in the Earth's subsurface. An inclined sheet type model is a very familiar structure associated with mineralization, fault plane, groundwater flow and many other geological features which exhibits self potential anomaly. A number of linearized and global inversion approaches have been developed for the interpretation of SP anomaly over different structures for various purposes. Mathematical expression to compute the forward response over a two-dimensional dipping sheet type structures can be described in three different ways using five variables in each case. Complexities in the inversion using three different forward approaches are different. Interpretation of self-potential anomaly using very fast simulated annealing global optimization has been developed in the present study which yielded a new insight about the uncertainty and equivalence in model parameters. Interpretation of the measured data yields the location of the causative body, depth to the top, extension, dip and quality of the causative body. In the present study, a comparative performance of three different forward approaches in the interpretation of self-potential anomaly is performed to assess the efficacy of the each approach in resolving the possible ambiguity. Even though each forward formulation yields the same forward response but optimization of different sets of variable using different forward problems poses different kinds of ambiguity in the interpretation. Performance of the three approaches in optimization has been compared and it is observed that out of three methods, one approach is best and suitable for this kind of study. Our VFSA approach has been tested on synthetic, noisy and field data for three different methods to show the efficacy and suitability of the best method. It is important to use the forward problem in the optimization that yields the

  8. Optimizing Quality of Care and Patient Safety in Malaysia: The Current Global Initiatives, Gaps and Suggested Solutions

    OpenAIRE

    Jarrar, Mu?taman; Rahman, Hamzah Abdul; Don, Mohammad Sobri

    2015-01-01

    Background and Objective: Demand for health care service has significantly increased, while the quality of healthcare and patient safety has become national and international priorities. This paper aims to identify the gaps and the current initiatives for optimizing the quality of care and patient safety in Malaysia. Design: Review of the current literature. Highly cited articles were used as the basis to retrieve and review the current initiatives for optimizing the quality of care and patie...

  9. Fourier acceleration in lattice gauge theories. I. Landau gauge fixing

    International Nuclear Information System (INIS)

    Davies, C.T.H.; Batrouni, G.G.; Katz, G.R.; Kronfeld, A.S.; Lepage, G.P.; Wilson, K.G.; Rossi, P.; Svetitsky, B.

    1988-01-01

    Fourier acceleration is a useful technique which can be applied to many different numerical algorithms in order to alleviate the problem of critical slowing down. Here we describe its application to an optimization problem in the simulation of lattice gauge theories, that of gauge fixing a configuration of link fields to the Landau gauge (partial/sub μ/A/sup μ/ = 0). We find that a steepest-descents method of gauge fixing link fields at β = 5.8 on an 8 4 lattice can be made 5 times faster using Fourier acceleration. This factor will grow as the volume of the lattice is increased. We also discuss other gauges that are useful to lattice-gauge-theory simulations, among them one that is a combination of the axial and Landau gauges. This seems to be the optimal gauge to impose for the Fourier acceleration of two other important algorithms, the inversion of the fermion matrix and the updating of gauge field configurations

  10. Pipeline Analyzer using the Fractional Fourier Transform for Engine Control and Satellites Data

    Directory of Open Access Journals (Sweden)

    Darian M. Onchiș

    2011-09-01

    Full Text Available The aim of this paper is to present an algorithm for computing the fractional Fourier transform integrated into the pipeline of processing multi-variate and distributed data recorded by the engine control unit (ECU of a car and its satellites. The role of this transform is vital in establishing a time-variant filter and therefore it must be computed in a fast way. But for large scale time series, the application of the discrete fractional Fourier transform involves the computations of a large number of Hermite polynomials of increasingly order. The parallel algorithm presented will optimally compute the discrete Fourier-type transform for any given angle.

  11. On the accurate fast evaluation of finite Fourier integrals using cubic splines

    International Nuclear Information System (INIS)

    Morishima, N.

    1993-01-01

    Finite Fourier integrals based on a cubic-splines fit to equidistant data are shown to be evaluated fast and accurately. Good performance, especially on computational speed, is achieved by the optimization of the spline fit and the internal use of the fast Fourier transform (FFT) algorithm for complex data. The present procedure provides high accuracy with much shorter CPU time than a trapezoidal FFT. (author)

  12. On the finite Fourier transforms of functions with infinite discontinuities

    Directory of Open Access Journals (Sweden)

    Branko Saric

    2002-01-01

    Full Text Available The introductory part of the paper is provided to give a brief review of the stability theory of a matrix pencil for discrete linear time-invariant singular control systems, based on the causal relationship between Jordan's theorem from the theory of Fourier series and Laurent's theorem from the calculus of residues. The main part is concerned with the theory of the integral transforms, which has proved to be a powerful tool in the control systems theory. On the basis of a newly defined notion of the total value of improper integrals, throughout the main part of the paper, an attempt has been made to present the global theory of the integral transforms, which are slightly more general with respect to the Laplace and Fourier transforms. The paper ends with examples by which the results of the theory are verified.

  13. Quantum arithmetic with the Quantum Fourier Transform

    OpenAIRE

    Ruiz-Perez, Lidia; Garcia-Escartin, Juan Carlos

    2014-01-01

    The Quantum Fourier Transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing Quantum Fourier Transform adders and multipliers and propose some modifications that extend their capabilities. Among the new circuits, we propose a quantum method to compute the weighted average of a series of inputs in the transform domain.

  14. Wigner distribution and fractional Fourier transform

    NARCIS (Netherlands)

    Alieva, T.; Bastiaans, M.J.; Boashash, B.

    2003-01-01

    We have described the relationship between the fractional Fourier transform and the Wigner distribution by using the Radon-Wigner transform, which is a set of projections of the Wigner distribution as well as a set of squared moduli of the fractional Fourier transform. We have introduced the concept

  15. Performance optimization of low-temperature power generation by supercritical ORCs (organic Rankine cycles) using low GWP (global warming potential) working fluids

    International Nuclear Information System (INIS)

    Le, Van Long; Feidt, Michel; Kheiri, Abdelhamid; Pelloux-Prayer, Sandrine

    2014-01-01

    This paper presents the system efficiency optimization scenarios of basic and regenerative supercritical ORCs (organic Rankine cycles) using low-GWP (global warming potential) organic compounds as working fluid. A more common refrigerant, i.e. R134a, was also employed to make the comparison. A 150-°C, 5-bar-pressurized hot water is used to simulate the heat source medium. Power optimization was equally performed for the basic configuration of supercritical ORC. Thermodynamic performance comparison of supercritical ORCs using different working fluids was achieved by ranking method and exergy analysis method. The highest optimal efficiency of the system (η sys ) is always obtained with R152a in both basic (11.6%) and regenerative (13.1%) configurations. The highest value of optimum electrical power output (4.1 kW) is found with R1234ze. By using ranking method and considering low-GWP criterion, the best working fluids for system efficiency optimization of basic and regenerative cycles are R32 and R152a, respectively. The best working fluid for net electrical power optimization of basic cycle is R1234ze. Although CO 2 has many desirable environmental and safety properties (e.g. zero ODP (Ozone Depletion Potential), ultra low-GWP, non toxicity, non flammability, etc.), the worst thermodynamic performance is always found with the cycle using this compound as working fluid. - Highlights: • Performance optimizations were carried out for the supercritical ORCs using low-GWP working fluids. • Heat regeneration was used to improve the system efficiency of the supercritical ORC. • Thermodynamic performances of supercritical ORCs at the optima were evaluated by ranking method and exergy analysis

  16. LETTER TO THE EDITOR: Constant-time solution to the global optimization problem using Brüschweiler's ensemble search algorithm

    Science.gov (United States)

    Protopopescu, V.; D'Helon, C.; Barhen, J.

    2003-06-01

    A constant-time solution of the continuous global optimization problem (GOP) is obtained by using an ensemble algorithm. We show that under certain assumptions, the solution can be guaranteed by mapping the GOP onto a discrete unsorted search problem, whereupon Brüschweiler's ensemble search algorithm is applied. For adequate sensitivities of the measurement technique, the query complexity of the ensemble search algorithm depends linearly on the size of the function's domain. Advantages and limitations of an eventual NMR implementation are discussed.

  17. The fractional Fourier transform and applications

    Science.gov (United States)

    Bailey, David H.; Swarztrauber, Paul N.

    1991-01-01

    This paper describes the 'fractional Fourier transform', which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e exp -2(pi)i/n, the fractional Fourier transform is based on fractional roots of unity e exp -2(pi)i(alpha), where alpha is arbitrary. The fractional Fourier transform and the corresponding fast algorithm are useful for such applications as computing DFTs of sequences with prime lengths, computing DFTs of sparse sequences, analyzing sequences with noninteger periodicities, performing high-resolution trigonometric interpolation, detecting lines in noisy images, and detecting signals with linearly drifting frequencies. In many cases, the resulting algorithms are faster by arbitrarily large factors than conventional techniques.

  18. Teaching Fourier optics through ray matrices

    International Nuclear Information System (INIS)

    Moreno, I; Sanchez-Lopez, M M; Ferreira, C; Davis, J A; Mateos, F

    2005-01-01

    In this work we examine the use of ray-transfer matrices for teaching and for deriving some topics in a Fourier optics course, exploiting the mathematical simplicity of ray matrices compared to diffraction integrals. A simple analysis of the physical meaning of the elements of the ray matrix provides a fast derivation of the conditions to obtain the optical Fourier transform. We extend this derivation to fractional Fourier transform optical systems, and derive the order of the transform from the ray matrix. Some examples are provided to stress this point of view, both with classical and with graded index lenses. This formulation cannot replace the complete explanation of Fourier optics provided by the wave theory, but it is a complementary tool useful to simplify many aspects of Fourier optics and to relate them to geometrical optics

  19. Global Optimal Energy Management Strategy Research for a Plug-In Series-Parallel Hybrid Electric Bus by Using Dynamic Programming

    Directory of Open Access Journals (Sweden)

    Hongwen He

    2013-01-01

    Full Text Available Energy management strategy influences the power performance and fuel economy of plug-in hybrid electric vehicles greatly. To explore the fuel-saving potential of a plug-in hybrid electric bus (PHEB, this paper searched the global optimal energy management strategy using dynamic programming (DP algorithm. Firstly, the simplified backward model of the PHEB was built which is necessary for DP algorithm. Then the torque and speed of engine and the torque of motor were selected as the control variables, and the battery state of charge (SOC was selected as the state variables. The DP solution procedure was listed, and the way was presented to find all possible control variables at every state of each stage in detail. Finally, the appropriate SOC increment is determined after quantizing the state variables, and then the optimal control of long driving distance of a specific driving cycle is replaced with the optimal control of one driving cycle, which reduces the computational time significantly and keeps the precision at the same time. The simulation results show that the fuel economy of the PEHB with the optimal energy management strategy is improved by 53.7% compared with that of the conventional bus, which can be a benchmark for the assessment of other control strategies.

  20. National US public policy on global warming derived from optimization of energy use and environmental impact studies

    International Nuclear Information System (INIS)

    Reck, R.

    1993-01-01

    This paper will discuss possible United States policy responses to global warming. The components of a voluntary program for emissions control will be presented as well as regulatory options, including a carbon tax and tradeable permits. The advantages and disadvantages of both options will be discussed as well as the need for a consistent overall policy response to climate change

  1. National US public policy on global warming derived from optimization of energy use and environmental impact studies

    Energy Technology Data Exchange (ETDEWEB)

    Reck, R.

    1993-12-31

    This paper will discuss possible United States policy responses to global warming. The components of a voluntary program for emissions control will be presented as well as regulatory options, including a carbon tax and tradeable permits. The advantages and disadvantages of both options will be discussed as well as the need for a consistent overall policy response to climate change.

  2. Optimal estimation of the surface fluxes of methyl chloride using a 3-D global chemical transport model

    Directory of Open Access Journals (Sweden)

    X. Xiao

    2010-06-01

    Full Text Available Methyl chloride (CH3Cl is a chlorine-containing trace gas in the atmosphere contributing significantly to stratospheric ozone depletion. Large uncertainties in estimates of its source and sink magnitudes and temporal and spatial variations currently exist. GEIA inventories and other bottom-up emission estimates are used to construct a priori maps of the surface fluxes of CH3Cl. The Model of Atmospheric Transport and Chemistry (MATCH, driven by NCEP interannually varying meteorological data, is then used to simulate CH3Cl mole fractions and quantify the time series of sensitivities of the mole fractions at each measurement site to the surface fluxes of various regional and global sources and sinks. We then implement the Kalman filter (with the unit pulse response method to estimate the surface fluxes on regional/global scales with monthly resolution from January 2000 to December 2004. High frequency observations from the AGAGE, SOGE, NIES, and NOAA/ESRL HATS in situ networks and low frequency observations from the NOAA/ESRL HATS flask network are used to constrain the source and sink magnitudes. The inversion results indicate global total emissions around 4100 ± 470 Gg yr−1 with very large emissions of 2200 ± 390 Gg yr−1 from tropical plants, which turn out to be the largest single source in the CH3Cl budget. Relative to their a priori annual estimates, the inversion increases global annual fungal and tropical emissions, and reduces the global oceanic source. The inversion implies greater seasonal and interannual oscillations of the natural sources and sink of CH3Cl compared to the a priori. The inversion also reflects the strong effects of the 2002/2003 globally widespread heat waves and droughts on global emissions from tropical plants, biomass burning and salt marshes, and on the soil sink.

  3. The assessment of global thermo-energy performances of existing district heating systems optimized by harnessing renewable energy sources

    Science.gov (United States)

    Şoimoşan, Teodora M.; Danku, Gelu; Felseghi, Raluca A.

    2017-12-01

    Within the thermo-energy optimization process of an existing heating system, the increase of the system's energy efficiency and speeding-up the transition to green energy use are pursued. The concept of multi-energy district heating system, with high harnessing levels of the renewable energy sources (RES) in order to produce heat, is expected to be the key-element in the future urban energy infrastructure, due to the important role it can have in the strategies of optimizing and decarbonizing the existing district heating systems. The issues that arise are related to the efficient integration of different technologies of harnessing renewable energy sources in the energy mix and to the increase of the participation levels of RES, respectively. For the holistic modeling of the district heating system, the concept of the energy hub was used, where the synergy of different primary forms of entered energy provides the system a high degree energy security and flexibility in operation. The optimization of energy flows within the energy hub allows the optimization of the thermo-energy district system in order to approach the dual concept of smart city & smart energy.

  4. The Geostationary Fourier Transform Spectrometer

    Science.gov (United States)

    Key, Richard; Sander, Stanley; Eldering, Annmarie; Blavier, Jean-Francois; Bekker, Dmitriy; Manatt, Ken; Rider, David; Wu, Yen-Hung

    2012-01-01

    The Geostationary Fourier Transform Spectrometer (GeoFTS) is an imaging spectrometer designed for a geostationary orbit (GEO) earth science mission to measure key atmospheric trace gases and process tracers related to climate change and human activity. GEO allows GeoFTS to continuously stare at a region of the earth for frequent sampling to capture the variability of biogenic fluxes and anthropogenic emissions from city to continental spatial scales and temporal scales from diurnal, synoptic, seasonal to interannual. The measurement strategy provides a process based understanding of the carbon cycle from contiguous maps of carbon dioxide (CO2), methane (CH4), carbon monoxide (CO), and chlorophyll fluorescence (CF) collected many times per day at high spatial resolution (2.7kmx2.7km at nadir). The CO2/CH4/CO/CF measurement suite in the near infrared spectral region provides the information needed to disentangle natural and anthropogenic contributions to atmospheric carbon concentrations and to minimize uncertainties in the flow of carbon between the atmosphere and surface. The half meter cube size GeoFTS instrument is based on a Michelson interferometer design that uses all high TRL components in a modular configuration to reduce complexity and cost. It is self-contained and as independent of the spacecraft as possible with simple spacecraft interfaces, making it ideal to be a "hosted" payload on a commercial communications satellite mission. The hosted payload approach for measuring the major carbon-containing gases in the atmosphere from the geostationary vantage point will affordably advance the scientific understating of carbon cycle processes and climate change.

  5. Sparse Generalized Fourier Series via Collocation-based Optimization

    Science.gov (United States)

    2014-11-01

    Theory 51, 12 (2005) 4203– 4215. [6] P. CONSTANTINE , M. ELDRED AND E. PHIPPS, Sparse pseu- dospectral approximation method. Comput. Methods Appl. Mech...Visition XVI: Algorithms, Techniques, Active Vision , and Materials Handling, 224 (1997). [15] J. SHEN AND L. WANG, Some recent advances on spectral methods

  6. Optimal cooling for the globalization of food and ornamental cultivation chains; Mondialisering van voedsel en sierteeltketens vereist optimale koeling

    Energy Technology Data Exchange (ETDEWEB)

    Boerrigter, H.A.M. [Agrotechnology and Food Sciences, Wageningen UR, Wageningen (Netherlands)

    2008-10-15

    Over the last years, the design of fresh food supply chains has been changing, with improved logistics and globalization of the trade as the major driving forces. In this article the consequences of these developments for the utilization of cooling will be addressed. [Dutch] Het inrichten van distributieketens is de laatste jaren sterk veranderd door verbeterde Iogistiek en door verdere mondialisering van bederfelijke goederenstromen. De consequenties hiervan voor bet gebruik van koeling worden in dit artikel behandeld.

  7. Enhancing Artificial Bee Colony Algorithm with Self-Adaptive Searching Strategy and Artificial Immune Network Operators for Global Optimization

    Directory of Open Access Journals (Sweden)

    Tinggui Chen

    2014-01-01

    Full Text Available Artificial bee colony (ABC algorithm, inspired by the intelligent foraging behavior of honey bees, was proposed by Karaboga. It has been shown to be superior to some conventional intelligent algorithms such as genetic algorithm (GA, artificial colony optimization (ACO, and particle swarm optimization (PSO. However, the ABC still has some limitations. For example, ABC can easily get trapped in the local optimum when handing in functions that have a narrow curving valley, a high eccentric ellipse, or complex multimodal functions. As a result, we proposed an enhanced ABC algorithm called EABC by introducing self-adaptive searching strategy and artificial immune network operators to improve the exploitation and exploration. The simulation results tested on a suite of unimodal or multimodal benchmark functions illustrate that the EABC algorithm outperforms ACO, PSO, and the basic ABC in most of the experiments.

  8. Global nonlinear optimization for the estimation of static shift and interpretation of 1-D magnetotelluric sounding data

    Directory of Open Access Journals (Sweden)

    Arkoprovo Biswas

    2011-07-01

    Full Text Available In the presence of conducting inhomogeneities in near-surface structures, apparent resistivity data in magnetotelluric sounding can be severely distorted. This is due to electric fields generated from boundary charges on surficial inhomogeneities. Such distortion persists throughout the entire recording range and is known as static shift in magnetotellurics. Frequency-independent static shifts manifest as vertical, parallel shifts that occur in plots of the dual logarithmic scale of apparent resistivity versus time period. The phase of magnetotelluric sounding data remains unaffected by the static shift and can be used to remove the static shift to some extent. However, individual inversion of phase data yields highly nonunique results, and alone it will not work to correctly remove the static shift. Inversions of uncorrected magnetotelluric data yield erroneous and unreliable estimations, while static-shift-corrected magnetotelluric data provide better and reliable estimations of the resistivities and thicknesses of subsurface structures. In the present study, static shift (a frequency-independent real constant is also considered as one of the model parameters and is optimized together with other model parameters (resistivity and thickness using the very fast simulated annealing global inversion technique. This implies that model parameters are determined simultaneously with the estimate of the static shift in the data. Synthetic and noisy data generated for a number of models are interpreted, to demonstrate the efficacy of the approach to yield reliable estimates of subsurface structures when the apparent resistivity data are affected by static shift. Individual inversions of static-shift-affected apparent resistivity data and phase data yield unreliable estimations of the model parameters. Furthermore, the estimated model parameters after individual data inversions do not show any systematic correlations with the amount of static shift in the

  9. Replica Fourier Transform: Properties and applications

    International Nuclear Information System (INIS)

    Crisanti, A.; De Dominicis, C.

    2015-01-01

    The Replica Fourier Transform is the generalization of the discrete Fourier Transform to quantities defined on an ultrametric tree. It finds use in conjunction of the replica method used to study thermodynamics properties of disordered systems such as spin glasses. Its definition is presented in a systematic and simple form and its use illustrated with some representative examples. In particular we give a detailed discussion of the diagonalization in the Replica Fourier Space of the Hessian matrix of the Gaussian fluctuations about the mean field saddle point of spin glass theory. The general results are finally discussed for a generic spherical spin glass model, where the Hessian can be computed analytically

  10. Fourier transforms in radar and signal processing

    CERN Document Server

    Brandwood, David

    2011-01-01

    Fourier transforms are used widely, and are of particular value in the analysis of single functions and combinations of functions found in radar and signal processing. Still, many problems that could have been tackled by using Fourier transforms may have gone unsolved because they require integration that is difficult and tedious. This newly revised and expanded edition of a classic Artech House book provides you with an up-to-date, coordinated system for performing Fourier transforms on a wide variety of functions. Along numerous updates throughout the book, the Second Edition includes a crit

  11. Simulation of global oceanic upper layers forced at the surface by an optimal bulk formulation derived from multi-campaign measurements.

    Science.gov (United States)

    Garric, G.; Pirani, A.; Belamari, S.; Caniaux, G.

    2006-12-01

    order to improve the air/sea interface for the future MERCATOR global ocean operational system, we have implemented the new bulk formulation developed by METEO-FRANCE (French Meteo office) in the MERCATOR 2 degree global ocean-ice coupled model (ORCA2/LIM). A single bulk formulation for the drag, temperature and moisture exchange coefficients is derived from an extended consistent database gathering 10 years of measurements issued from five experiments dedicated to air-sea fluxes estimates (SEMAPHORE, CATCH, FETCH, EQUALANT99 and POMME) in various oceanic basins (from Northern to equatorial Atlantic). The available database (ALBATROS) cover the widest range of atmospheric and oceanic conditions, from very light (0.3 m/s) to very strong (up to 29 m/s) wind speeds, and from unstable to extremely stable atmospheric boundary layer stratification. We have defined a work strategy to test this new formulation in a global oceanic context, by using this multi- campaign bulk formulation to derive air-sea fluxes from base meteorological variables produces by the ECMWF (European Centre for Medium Range and Weather Forecast) atmospheric forecast model, in order to get surface boundary conditions for ORCA2/LIM. The simulated oceanic upper layers forced at the surface by the previous air/sea interface are compared to those forced by the optimal bulk formulation. Consecutively with generally weaker transfer coefficient, the latter formulation reduces the cold bias in the equatorial Pacific and increases the too weak summer sea ice extent in Antarctica. Compared to a recent mixed layer depth (MLD) climatology, the optimal bulk formulation reduces also the too deep simulated MLDs. Comparison with in situ temperature and salinity profiles in different areas allowed us to evaluate the impact of changing the air/sea interface in the vertical structure.

  12. Capillary supercritical fluid chromatography - Fourier transform infrared spectrometry

    International Nuclear Information System (INIS)

    Olesik, S.V.; French, S.B.; Movotny, M.

    1984-01-01

    One of the most demanding tasks asked of an analytical chemist today is to separate and identify the components of a nonvolatile complex mixture. An efficient separation technique combined with a universal detector that provides structural information, therefore, would be a great asset to analytical chemists. Capillary supercritical fluid chromatography (SFC) - Fourier transform infrared spectrometry (FTIR) shows great potential for being such a technique. SFC-FTIR shows great potential as a very powerful technique for separation and identification of thermally labile and nonvolatile compounds. Research is continuing in these labs to further optimize the technique. 2 refs

  13. A heterogeneous computing accelerated SCE-UA global optimization method using OpenMP, OpenCL, CUDA, and OpenACC.

    Science.gov (United States)

    Kan, Guangyuan; He, Xiaoyan; Ding, Liuqian; Li, Jiren; Liang, Ke; Hong, Yang

    2017-10-01

    The shuffled complex evolution optimization developed at the University of Arizona (SCE-UA) has been successfully applied in various kinds of scientific and engineering optimization applications, such as hydrological model parameter calibration, for many years. The algorithm possesses good global optimality, convergence stability and robustness. However, benchmark and real-world applications reveal the poor computational efficiency of the SCE-UA. This research aims at the parallelization and acceleration of the SCE-UA method based on powerful heterogeneous computing technology. The parallel SCE-UA is implemented on Intel Xeon multi-core CPU (by using OpenMP and OpenCL) and NVIDIA Tesla many-core GPU (by using OpenCL, CUDA, and OpenACC). The serial and parallel SCE-UA were tested based on the Griewank benchmark function. Comparison results indicate the parallel SCE-UA significantly improves computational efficiency compared to the original serial version. The OpenCL implementation obtains the best overall acceleration results however, with the most complex source code. The parallel SCE-UA has bright prospects to be applied in real-world applications.

  14. Computing exact Fourier series coefficients of IC rectilinear polygons from low-resolution fast Fourier coefficients

    Science.gov (United States)

    Scheibler, Robin; Hurley, Paul

    2012-03-01

    We present a novel, accurate and fast algorithm to obtain Fourier series coefficients from an IC layer whose description consists of rectilinear polygons on a plane, and how to implement it using off-the-shelf hardware components. Based on properties of Fourier calculus, we derive a relationship between the Discrete Fourier Transforms of the sampled mask transmission function and its continuous Fourier series coefficients. The relationship leads to a straightforward algorithm for computing the continuous Fourier series coefficients where one samples the mask transmission function, compute its discrete Fourier transform and applies a frequency-dependent multiplicative factor. The algorithm is guaranteed to yield the exact continuous Fourier series coefficients for any sampling representing the mask function exactly. Computationally, this leads to significant saving by allowing to choose the maximal such pixel size and reducing the fast Fourier transform size by as much, without compromising accuracy. In addition, the continuous Fourier series is free from aliasing and follows closely the physical model of Fourier optics. We show that in some cases this can make a significant difference, especially in modern very low pitch technology nodes.

  15. Content adaptive illumination for Fourier ptychography.

    Science.gov (United States)

    Bian, Liheng; Suo, Jinli; Situ, Guohai; Zheng, Guoan; Chen, Feng; Dai, Qionghai

    2014-12-01

    Fourier ptychography (FP) is a recently reported technique, for large field-of-view and high-resolution imaging. Specifically, FP captures a set of low-resolution images, under angularly varying illuminations, and stitches them together in the Fourier domain. One of FP's main disadvantages is its long capturing process, due to the requisite large number of incident illumination angles. In this Letter, utilizing the sparsity of natural images in the Fourier domain, we propose a highly efficient method, termed adaptive Fourier ptychography (AFP), which applies content adaptive illumination for FP, to capture the most informative parts of the scene's spatial spectrum. We validate the effectiveness and efficiency of the reported framework, with both simulated and real experiments. Results show that the proposed AFP could shorten the acquisition time of conventional FP, by around 30%-60%.

  16. X-ray interferometric Fourier holography

    International Nuclear Information System (INIS)

    Balyan, M.K.

    2016-01-01

    The X-ray interferometric Fourier holography is proposed and theoretically investigated. Fourier The X-ray interferometric Young fringes and object image reconstruction are investigated. It is shown that the interference pattern of two slits formed on the exit surface of the crystal-analyzer (the third plate of the interferometer) is the X-ray interferometric Young fringes. An expression for X-ray interferometric Young fringes period is obtained. The subsequent reconstruction of the slit image as an object is performed by means of Fourier transform of the intensity distribution on the hologram. Three methods of reconstruction of the amplitude transmission complex function of the object are presented: analytical - approximate method, method of iteration and step by step method. As an example the X-ray Fourier interferometric hologram recording and the complex amplitude transmission function reconstruction for a beryllium circular wire are considered

  17. New focus on Fourier optics techniques

    NARCIS (Netherlands)

    Calvo, M.L.; Alieva, T.; Bastiaans, M.J.; Rodrigo Martín-Romo, J.A.; Rodríguez Merlo, D.; Vlad, V.I.

    2004-01-01

    We present a short overview on the application of fractional cyclic and linear canonical transformations to optical signal processing and dedicate some of the discussions to the particular features found in the fractional Fourier transform domain.

  18. The finite Fourier transform of classical polynomials

    OpenAIRE

    Dixit, Atul; Jiu, Lin; Moll, Victor H.; Vignat, Christophe

    2014-01-01

    The finite Fourier transform of a family of orthogonal polynomials $A_{n}(x)$, is the usual transform of the polynomial extended by $0$ outside their natural domain. Explicit expressions are given for the Legendre, Jacobi, Gegenbauer and Chebyshev families.

  19. On the Scaled Fractional Fourier Transformation Operator

    International Nuclear Information System (INIS)

    Hong-Yi, Fan; Li-Yun, Hu

    2008-01-01

    Based on our previous study [Chin. Phys. Lett. 24 (2007) 2238] in which the Fresnel operator corresponding to classical Fresnel transform was introduced, we derive the fractional Fourier transformation operator, and the optical operator method is then enriched

  20. Mountain Wave Analysis Using Fourier Methods

    National Research Council Canada - National Science Library

    Roadcap, John R

    2007-01-01

    ...) their requirements for only a coarse horizontal background state. Common traits of Fourier mountain wave models include use of the Boussinesq approximation and neglect of moisture and Coriolis terms...

  1. A new twist to fourier transforms

    CERN Document Server

    Meikle, Hamish D

    2004-01-01

    Making use of the inherent helix in the Fourier transform expression, this book illustrates both Fourier transforms and their properties in the round. The author draws on elementary complex algebra to manipulate the transforms, presenting the ideas in such a way as to avoid pages of complicated mathematics. Similarly, abbreviations are not used throughout and the language is kept deliberately clear so that the result is a text that is accessible to a much wider readership.The treatment is extended with the use of sampled data to finite and discrete transforms, the fast Fourier transform, or FFT, being a special case of a discrete transform. The application of Fourier transforms in statistics is illustrated for the first time using the examples operational research and later radar detection. In addition, a whole chapter on tapering or weighting functions is added for reference. The whole is rounded off by a glossary and examples of diagrams in three dimensions made possible by today's mathematics programs

  2. Mapped Fourier Methods for stiff problems in toroidal geometry

    OpenAIRE

    Guillard , Herve

    2014-01-01

    Fourier spectral or pseudo-spectral methods are usually extremely efficient for periodic problems. However this efficiency is lost if the solutions have zones of rapid variations or internal layers. For these cases, a large number of Fourier modes are required and this makes the Fourier method unpractical in many cases. This work investigates the use of mapped Fourier method as a way to circumvent this problem. Mapped Fourier method uses instead of the usual Fourier interpolant the compositio...

  3. Well Test Analysis of Naturally Fractured Vuggy Reservoirs with an Analytical Triple Porosity – Double Permeability Model and a Global Optimization Method

    Directory of Open Access Journals (Sweden)

    Gómez Susana

    2014-07-01

    Full Text Available The aim of this work is to study the automatic characterization of Naturally Fractured Vuggy Reservoirs via well test analysis, using a triple porosity-dual permeability model. The inter-porosity flow parameters, the storativity ratios, as well as the permeability ratio, the wellbore storage effect, the skin and the total permeability will be identified as parameters of the model. In this work, we will perform the well test interpretation in Laplace space, using numerical algorithms to transfer the discrete real data given in fully dimensional time to Laplace space. The well test interpretation problem in Laplace space has been posed as a nonlinear least squares optimization problem with box constraints and a linear inequality constraint, which is usually solved using local Newton type methods with a trust region. However, local methods as the one used in our work called TRON or the well-known Levenberg-Marquardt method, are often not able to find an optimal solution with a good fit of the data. Also well test analysis with the triple porosity-double permeability model, like most inverse problems, can yield multiple solutions with good match to the data. To deal with these specific characteristics, we will use a global optimization algorithm called the Tunneling Method (TM. In the design of the algorithm, we take into account issues of the problem like the fact that the parameter estimation has to be done with high precision, the presence of noise in the measurements and the need to solve the problem computationally fast. We demonstrate that the use of the TM in this study, showed to be an efficient and robust alternative to solve the well test characterization, as several optimal solutions, with very good match to the data were obtained.

  4. Efficient globally optimal segmentation of cells in fluorescence microscopy images using level sets and convex energy functionals.

    Science.gov (United States)

    Bergeest, Jan-Philip; Rohr, Karl

    2012-10-01

    In high-throughput applications, accurate and efficient segmentation of cells in fluorescence microscopy images is of central importance for the quantification of protein expression and the understanding of cell function. We propose an approach for segmenting cell nuclei which is based on active contours using level sets and convex energy functionals. Compared to previous work, our approach determines the global solution. Thus, the approach does not suffer from local minima and the segmentation result does not depend on the initialization. We consider three different well-known energy functionals for active contour-based segmentation and introduce convex formulations of these functionals. We also suggest a numeric approach for efficiently computing the solution. The performance of our approach has been evaluated using fluorescence microscopy images from different experiments comprising different cell types. We have also performed a quantitative comparison with previous segmentation approaches. Copyright © 2012 Elsevier B.V. All rights reserved.

  5. A compact skeletal mechanism for n -dodecane with optimized semi-global low-temperature chemistry for diesel engine simulations

    Energy Technology Data Exchange (ETDEWEB)

    Yao, Tong; Pei, Yuanjiang; Zhong, Bei-Jing; Som, Sibendu; Lu, Tianfeng; Luo, Kai Hong

    2017-03-01

    A skeletal mechanism with 54 species and 269 reactions was developed to predict pyrolysis and oxidation of n-dodecane as a diesel fuel surrogate involving both high-temperature (high-T) and low-temperature (low-T) conditions. The skeletal mechanism was developed from a semi-detailed mechanism developed at the University of Southern California (USC). Species and reactions for high-T pyrolysis and oxidation of C5-C12 were reduced by using reaction flow analysis (RFA), isomer lumping, and then merged into a skeletal C0-C4 core to form a high-T sub-mechanism. Species and lumped semi-global reactions for low-T chemistry were then added to the high-T sub-mechanism and a 54-species skeletal mechanism is obtained. The rate parameters of the low-T reactions were tuned against a detailed mechanism by the Lawrence Livermore National Laboratory (LLNL), as well as the Spray A flame experimental data, to improve the prediction of ignition delay at low-T conditions, while the high-T chemistry remained unchanged. The skeletal mechanism was validated for auto-ignition, perfectly stirred reactors (PSR), flow reactors and laminar premixed flames over a wide range of flame conditions. The skeletal mechanism was then employed to simulate three-dimensional turbulent spray flames at compression ignition engine conditions and validated against experimental data from the Engine Combustion Network (ECN).

  6. A small world of weak ties provides optimal global integration of self-similar modules in functional brain networks.

    Science.gov (United States)

    Gallos, Lazaros K; Makse, Hernán A; Sigman, Mariano

    2012-02-21

    The human brain is organized in functional modules. Such an organization presents a basic conundrum: Modules ought to be sufficiently independent to guarantee functional specialization and sufficiently connected to bind multiple processors for efficient information transfer. It is commonly accepted that small-world architecture of short paths and large local clustering may solve this problem. However, there is intrinsic tension between shortcuts generating small worlds and the persistence of modularity, a global property unrelated to local clustering. Here, we present a possible solution to this puzzle. We first show that a modified percolation theory can define a set of hierarchically organized modules made of strong links in functional brain networks. These modules are "large-world" self-similar structures and, therefore, are far from being small-world. However, incorporating weaker ties to the network converts it into a small world preserving an underlying backbone of well-defined modules. Remarkably, weak ties are precisely organized as predicted by theory maximizing information transfer with minimal wiring cost. This trade-off architecture is reminiscent of the "strength of weak ties" crucial concept of social networks. Such a design suggests a natural solution to the paradox of efficient information flow in the highly modular structure of the brain.

  7. Development of TRU transmuters for optimization of the global fuel cycle. Final Report for the NERI Project

    International Nuclear Information System (INIS)

    Lee, John C.

    2009-01-01

    This final report summarizes the research activities during the entire performance period of the NERI grant, including the extra 9 months granted under a no-cost time extension. Building up on the 14 quarterly reports submitted through October 2008, we present here an overview of the research accomplishments under the five tasks originally proposed in July 2004, together with citations for publications resulting from the project. The AFCI-NERI project provided excellent support for two undergraduate and 10 graduates students at the University of Michigan during a period of three years and nine months. Significant developments were achieved in three areas: (1) Efficient deterministic fuel cycle optimization algorithms both for PWR and SFR configurations, (2) Efficient search algorithm for PWR equilibrium cycles, and (3) Simplified Excel-based script for dynamic fuel cycle analysis of diverse cycles. The project resulted in a total of 8 conference papers and three journal papers, including two that will be submitted shortly. Three pending publications are attached to the report

  8. Quantum copying and simplification of the quantum Fourier transform

    Science.gov (United States)

    Niu, Chi-Sheng

    Theoretical studies of quantum computation and quantum information theory are presented in this thesis. Three topics are considered: simplification of the quantum Fourier transform in Shor's algorithm, optimal eavesdropping in the BB84 quantum cryptographic protocol, and quantum copying of one qubit. The quantum Fourier transform preceding the final measurement in Shor's algorithm is simplified by replacing a network of quantum gates with one that has fewer and simpler gates controlled by classical signals. This simplification results from an analysis of the network using the consistent history approach to quantum mechanics. The optimal amount of information which an eavesdropper can gain, for a given level of noise in the communication channel, is worked out for the BB84 quantum cryptographic protocol. The optimal eavesdropping strategy is expressed in terms of various quantum networks. A consistent history analysis of these networks using two conjugate quantum bases shows how the information gain in one basis influences the noise level in the conjugate basis. The no-cloning property of quantum systems, which is the physics behind quantum cryptography, is studied by considering copying machines that generate two imperfect copies of one qubit. The best qualities these copies can have are worked out with the help of the Bloch sphere representation for one qubit, and a quantum network is worked out for an optimal copying machine. If the copying machine does not have additional ancillary qubits, the copying process can be viewed using a 2-dimensional subspace in a product space of two qubits. A special representation of such a two-dimensional subspace makes possible a complete characterization of this type of copying. This characterization in turn leads to simplified eavesdropping strategies in the BB84 and the B92 quantum cryptographic protocols.

  9. Rotation-type input-output relationships for Wigner distribution moments in fractional Fourier transform systems

    NARCIS (Netherlands)

    Bastiaans, M.J.; Alieva, T.

    2002-01-01

    It is shown how all global Wigner distribution moments of arbitrary order in the output plane of a (generally anamorphic) two-dimensional fractional Fourier transform system can be expressed in terms of the moments in the input plane. This general input-output relationship is then broken down into a

  10. On the measurement of Wigner distribution moments in the fractional Fourier transform domain

    NARCIS (Netherlands)

    Bastiaans, M.J.; Alieva, T.

    2002-01-01

    It is shown how all global Wigner distribution moments of arbitrary order can be measured as intensity moments in the output plane of an appropriate number of fractional Fourier transform systems (generally anamorphic ones). The minimum number of (anamorphic) fractional power spectra that are needed

  11. Alternative difference analysis scheme combining R-space EXAFS fit with global optimization XANES fit for X-ray transient absorption spectroscopy.

    Science.gov (United States)

    Zhan, Fei; Tao, Ye; Zhao, Haifeng

    2017-07-01

    Time-resolved X-ray absorption spectroscopy (TR-XAS), based on the laser-pump/X-ray-probe method, is powerful in capturing the change of the geometrical and electronic structure of the absorbing atom upon excitation. TR-XAS data analysis is generally performed on the laser-on minus laser-off difference spectrum. Here, a new analysis scheme is presented for the TR-XAS difference fitting in both the extended X-ray absorption fine-structure (EXAFS) and the X-ray absorption near-edge structure (XANES) regions. R-space EXAFS difference fitting could quickly provide the main quantitative structure change of the first shell. The XANES fitting part introduces a global non-derivative optimization algorithm and optimizes the local structure change in a flexible way where both the core XAS calculation package and the search method in the fitting shell are changeable. The scheme was applied to the TR-XAS difference analysis of Fe(phen) 3 spin crossover complex and yielded reliable distance change and excitation population.

  12. Towards the Selection of an Optimal Global Geopotential Model for the Computation of the Long-Wavelength Contribution: A Case Study of Ghana

    Directory of Open Access Journals (Sweden)

    Caleb Iddissah Yakubu

    2017-11-01

    Full Text Available The selection of a global geopotential model (GGM for modeling the long-wavelength for geoid computation is imperative not only because of the plethora of GGMs available but more importantly because it influences the accuracy of a geoid model. In this study, we propose using the Gaussian averaging function for selecting an optimal GGM and degree and order (d/o for the remove-compute-restore technique as a replacement for the direct comparison of terrestrial gravity anomalies and GGM anomalies, because ground data and GGM have different frequencies. Overall, EGM2008 performed better than all the tested GGMs and at an optimal d/o of 222. We verified the results by computing geoid models using Heck and Grüninger’s modification and validated them against GPS/trigonometric data. The results of the validation were consistent with those of the averaging process with EGM2008 giving the smallest standard deviation of 0.457 m at d/o 222, resulting in an 8% improvement over the previous geoid model. In addition, this geoid model, the Ghanaian Gravimetric Geoid 2017 (GGG 2017 may be used to replace second-order class II leveling, with an expected error of 6.8 mm/km for baselines ranging from 20 to 225 km.

  13. A variable structure fuzzy neural network model of squamous dysplasia and esophageal squamous cell carcinoma based on a global chaotic optimization algorithm.

    Science.gov (United States)

    Moghtadaei, Motahareh; Hashemi Golpayegani, Mohammad Reza; Malekzadeh, Reza

    2013-02-07

    Identification of squamous dysplasia and esophageal squamous cell carcinoma (ESCC) is of great importance in prevention of cancer incidence. Computer aided algorithms can be very useful for identification of people with higher risks of squamous dysplasia, and ESCC. Such method can limit the clinical screenings to people with higher risks. Different regression methods have been used to predict ESCC and dysplasia. In this paper, a Fuzzy Neural Network (FNN) model is selected for ESCC and dysplasia prediction. The inputs to the classifier are the risk factors. Since the relation between risk factors in the tumor system has a complex nonlinear behavior, in comparison to most of ordinary data, the cost function of its model can have more local optimums. Thus the need for global optimization methods is more highlighted. The proposed method in this paper is a Chaotic Optimization Algorithm (COA) proceeding by the common Error Back Propagation (EBP) local method. Since the model has many parameters, we use a strategy to reduce the dependency among parameters caused by the chaotic series generator. This dependency was not considered in the previous COA methods. The algorithm is compared with logistic regression model as the latest successful methods of ESCC and dysplasia prediction. The results represent a more precise prediction with less mean and variance of error. Copyright © 2012 Elsevier Ltd. All rights reserved.

  14. Direct fourier method reconstruction based on unequally spaced fast fourier transform

    International Nuclear Information System (INIS)

    Wu Xiaofeng; Zhao Ming; Liu Li

    2003-01-01

    First, We give an Unequally Spaced Fast Fourier Transform (USFFT) method, which is more exact and theoretically more comprehensible than its former counterpart. Then, with an interesting interpolation scheme, we discusse how to apply USFFT to Direct Fourier Method (DFM) reconstruction of parallel projection data. At last, an emulation experiment result is given. (authors)

  15. Exploitation of the Fourier chopper in neutron diffractometry at pulsed sources

    International Nuclear Information System (INIS)

    Hiismaeki, P.; Poeyry, H.; Tiitta, A.

    1988-01-01

    The application of the Fourier chopper in the reverse time-of-flight mode to upgrading the performance of neutron powder diffractometry at pulsed sources is considered. Exploitation of a dual-delay-line binary correlator is suggested and a comprehensive analysis of the necessary data acquisition process is given. The best benefit is shown to be achievable at intensity optimized moderators. (orig.)

  16. Harmonic analysis from Fourier to wavelets

    CERN Document Server

    Pereyra, Maria Cristina

    2012-01-01

    In the last 200 years, harmonic analysis has been one of the most influential bodies of mathematical ideas, having been exceptionally significant both in its theoretical implications and in its enormous range of applicability throughout mathematics, science, and engineering. In this book, the authors convey the remarkable beauty and applicability of the ideas that have grown from Fourier theory. They present for an advanced undergraduate and beginning graduate student audience the basics of harmonic analysis, from Fourier's study of the heat equation, and the decomposition of functions into sums of cosines and sines (frequency analysis), to dyadic harmonic analysis, and the decomposition of functions into a Haar basis (time localization). While concentrating on the Fourier and Haar cases, the book touches on aspects of the world that lies between these two different ways of decomposing functions: time-frequency analysis (wavelets). Both finite and continuous perspectives are presented, allowing for the introd...

  17. Projective Fourier duality and Weyl quantization

    International Nuclear Information System (INIS)

    Aldrovandi, R.; Saeger, L.A.

    1996-08-01

    The Weyl-Wigner correspondence prescription, which makes large use of Fourier duality, is reexamined from the point of view of Kac algebras, the most general background for non-commutative Fourier analysis allowing for that property. It is shown how the standard Kac structure has to be extended in order to accommodate the physical requirements. An Abelian and a symmetric projective Kac algebras are shown to provide, in close parallel to the standard case, a new dual framework and a well-defined notion of projective Fourier duality for the group of translations on the plane. The Weyl formula arises naturally as an irreducible component of the duality mapping between these projective algebras. (author). 29 refs

  18. Fourier duality as a quantization principle

    International Nuclear Information System (INIS)

    Aldrovandi, R.; Saeger, L.A.

    1996-08-01

    The Weyl-Wigner prescription for quantization on Euclidean phase spaces makes essential use of Fourier duality. The extension of this property to more general phase spaces requires the use of Kac algebras, which provide the necessary background for the implementation of Fourier duality on general locally groups. Kac algebras - and the duality they incorporate are consequently examined as candidates for a general quantization framework extending the usual formalism. Using as a test case the simplest non-trivial phase space, the half-plane, it is shown how the structures present in the complete-plane case must be modified. Traces, for example, must be replaced by their noncommutative generalizations - weights - and the correspondence embodied in the Weyl-Wigner formalism is no more complete. Provided the underlying algebraic structure is suitably adapted to each case, Fourier duality is shown to be indeed a very powerful guide to the quantization of general physical systems. (author). 30 refs

  19. Fourier analysis and boundary value problems

    CERN Document Server

    Gonzalez-Velasco, Enrique A

    1996-01-01

    Fourier Analysis and Boundary Value Problems provides a thorough examination of both the theory and applications of partial differential equations and the Fourier and Laplace methods for their solutions. Boundary value problems, including the heat and wave equations, are integrated throughout the book. Written from a historical perspective with extensive biographical coverage of pioneers in the field, the book emphasizes the important role played by partial differential equations in engineering and physics. In addition, the author demonstrates how efforts to deal with these problems have lead to wonderfully significant developments in mathematics.A clear and complete text with more than 500 exercises, Fourier Analysis and Boundary Value Problems is a good introduction and a valuable resource for those in the field.Key Features* Topics are covered from a historical perspective with biographical information on key contributors to the field* The text contains more than 500 exercises* Includes practical applicati...

  20. Group-invariant finite Fourier transforms

    International Nuclear Information System (INIS)

    Shenefelt, M.H.

    1988-01-01

    The computation of the finite Fourier transform of functions is one of the most used computations in crystallography. Since the Fourier transform involved in 3-dimensional, the size of the computation becomes very large even for relatively few sample points along each edge. In this thesis, there is a family of algorithms that reduce the computation of Fourier transform of functions respecting the symmetries. Some properties of these algorithms are: (1) The algorithms make full use of the group of symmetries of a crystal. (2) The algorithms can be factored and combined according to the prime factorization of the number of points in the sample space. (3) The algorithms are organized into a family using the group structure of the crystallographic groups to make iterative procedures possible

  1. Implementation of quantum and classical discrete fractional Fourier transforms

    Science.gov (United States)

    Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N.; Szameit, Alexander

    2016-01-01

    Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools. PMID:27006089

  2. Implementation of quantum and classical discrete fractional Fourier transforms.

    Science.gov (United States)

    Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N; Szameit, Alexander

    2016-03-23

    Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools.

  3. An optical Fourier transform coprocessor with direct phase determination.

    Science.gov (United States)

    Macfaden, Alexander J; Gordon, George S D; Wilkinson, Timothy D

    2017-10-20

    The Fourier transform is a ubiquitous mathematical operation which arises naturally in optics. We propose and demonstrate a practical method to optically evaluate a complex-to-complex discrete Fourier transform. By implementing the Fourier transform optically we can overcome the limiting O(nlogn) complexity of fast Fourier transform algorithms. Efficiently extracting the phase from the well-known optical Fourier transform is challenging. By appropriately decomposing the input and exploiting symmetries of the Fourier transform we are able to determine the phase directly from straightforward intensity measurements, creating an optical Fourier transform with O(n) apparent complexity. Performing larger optical Fourier transforms requires higher resolution spatial light modulators, but the execution time remains unchanged. This method could unlock the potential of the optical Fourier transform to permit 2D complex-to-complex discrete Fourier transforms with a performance that is currently untenable, with applications across information processing and computational physics.

  4. Fourier analysis in several complex variables

    CERN Document Server

    Ehrenpreis, Leon

    2006-01-01

    Suitable for advanced undergraduates and graduate students, this text develops comparison theorems to establish the fundamentals of Fourier analysis and to illustrate their applications to partial differential equations.The three-part treatment begins by establishing the quotient structure theorem or fundamental principle of Fourier analysis. Topics include the geometric structure of ideals and modules, quantitative estimates, and examples in which the theory can be applied. The second part focuses on applications to partial differential equations and covers the solution of homogeneous and inh

  5. Fourier transforms and convolutions for the experimentalist

    CERN Document Server

    Jennison, RC

    1961-01-01

    Fourier Transforms and Convolutions for the Experimentalist provides the experimentalist with a guide to the principles and practical uses of the Fourier transformation. It aims to bridge the gap between the more abstract account of a purely mathematical approach and the rule of thumb calculation and intuition of the practical worker. The monograph springs from a lecture course which the author has given in recent years and for which he has drawn upon a number of sources, including a set of notes compiled by the late Dr. I. C. Browne from a series of lectures given by Mr. J . A. Ratcliffe of t

  6. Electro-optic imaging Fourier transform spectrometer

    Science.gov (United States)

    Chao, Tien-Hsin (Inventor); Znod, Hanying (Inventor)

    2009-01-01

    An Electro-Optic Imaging Fourier Transform Spectrometer (EOIFTS) for Hyperspectral Imaging is described. The EOIFTS includes an input polarizer, an output polarizer, and a plurality of birefringent phase elements. The relative orientations of the polarizers and birefringent phase elements can be changed mechanically or via a controller, using ferroelectric liquid crystals, to substantially measure the spectral Fourier components of light propagating through the EIOFTS. When achromatic switches are used as an integral part of the birefringent phase elements, the EIOFTS becomes suitable for broadband applications, with over 1 micron infrared bandwidth.

  7. The periodogram at the Fourier frequencies

    NARCIS (Netherlands)

    Kokoszka, P; Mikosch, T

    In the time series literature one can often find the claim that the periodogram ordinates of an lid sequence at the Fourier frequencies behave like an lid standard exponential sequence. We review some results about functions of these periodogram ordinates, including the convergence of extremes,

  8. Pi, Fourier Transform and Ludolph van Ceulen

    NARCIS (Netherlands)

    Vajta, Miklos

    2000-01-01

    The paper describes an interesting (and unexpected) application of the Fast Fourier transform in number theory. Calculating more and more decimals of p (first by hand and then from the mid-20th century, by digital computers) not only fascinated mathematicians from ancient times but kept them busy as

  9. Fourier transform infrared spectrometery: an undergraduate experiment

    International Nuclear Information System (INIS)

    Lerner, L

    2016-01-01

    Simple apparatus is developed, providing undergraduate students with a solid understanding of Fourier transform (FT) infrared (IR) spectroscopy in a hands on experiment. Apart from its application to measuring the mid-IR spectra of organic molecules, the experiment introduces several techniques with wide applicability in physics, including interferometry, the FT, digital data analysis, and control theory. (paper)

  10. Wigner distribution and fractional Fourier transform

    NARCIS (Netherlands)

    Alieva, T.; Bastiaans, M.J.

    2001-01-01

    The connection between the Wigner distribution and the squared modulus of the fractional Fourier transform - which are both well-known time-frequency representations of a signal - is established. In particular the Radon-Wigner transform is used, which relates projections of the Wigner distribution

  11. The Fourier transform of tubular densities

    KAUST Repository

    Prior, C B; Goriely, A

    2012-01-01

    molecules. We consider tubes of both finite radii and unrestricted radius. When there is overlap of the tube structure the net density is calculated using the super-position principle. The Fourier transform of this density is composed of two expressions, one

  12. Geometric Representations for Discrete Fourier Transforms

    Science.gov (United States)

    Cambell, C. W.

    1986-01-01

    Simple geometric representations show symmetry and periodicity of discrete Fourier transforms (DFT's). Help in visualizing requirements for storing and manipulating transform value in computations. Representations useful in any number of dimensions, but particularly in one-, two-, and three-dimensional cases often encountered in practice.

  13. Fourier analysis in combinatorial number theory

    International Nuclear Information System (INIS)

    Shkredov, Il'ya D

    2010-01-01

    In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.

  14. Fourier analysis in combinatorial number theory

    Energy Technology Data Exchange (ETDEWEB)

    Shkredov, Il' ya D [M. V. Lomonosov Moscow State University, Moscow (Russian Federation)

    2010-09-16

    In this survey applications of harmonic analysis to combinatorial number theory are considered. Discussion topics include classical problems of additive combinatorics, colouring problems, higher-order Fourier analysis, theorems about sets of large trigonometric sums, results on estimates for trigonometric sums over subgroups, and the connection between combinatorial and analytic number theory. Bibliography: 162 titles.

  15. A Fourier analysis of extremal events

    DEFF Research Database (Denmark)

    Zhao, Yuwei

    is the extremal periodogram. The extremal periodogram shares numerous asymptotic properties with the periodogram of a linear process in classical time series analysis: the asymptotic distribution of the periodogram ordinates at the Fourier frequencies have a similar form and smoothed versions of the periodogram...

  16. Bernoulli Polynomials, Fourier Series and Zeta Numbers

    DEFF Research Database (Denmark)

    Scheufens, Ernst E

    2013-01-01

    Fourier series for Bernoulli polynomials are used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent...

  17. The Fourier modal method for aperiodic structures

    NARCIS (Netherlands)

    Pisarenco, M.; Maubach, J.M.L.; Setija, I.D.; Mattheij, R.M.M.

    2010-01-01

    This paper extends the area of application of the Fourier modal method from periodic structures to non-periodic ones illuminated under arbitrary angles. This is achieved by placing perfectly matched layers at the lateral boundaries and reformulating the problem in terms of a contrast field.

  18. Discrete Fourier analysis of multigrid algorithms

    NARCIS (Netherlands)

    van der Vegt, Jacobus J.W.; Rhebergen, Sander

    2011-01-01

    The main topic of this report is a detailed discussion of the discrete Fourier multilevel analysis of multigrid algorithms. First, a brief overview of multigrid methods is given for discretizations of both linear and nonlinear partial differential equations. Special attention is given to the

  19. Euler Polynomials, Fourier Series and Zeta Numbers

    DEFF Research Database (Denmark)

    Scheufens, Ernst E

    2012-01-01

    Fourier series for Euler polynomials is used to obtain information about values of the Riemann zeta function for integer arguments greater than one. If the argument is even we recover the well-known exact values, if the argument is odd we find integral representations and rapidly convergent series....

  20. Fourier inversion on a reductive symmetric space

    NARCIS (Netherlands)

    Ban, E.P. van den

    1999-01-01

    Let X be a semisimple symmetric space. In previous papers, [8] and [9], we have dened an explicit Fourier transform for X and shown that this transform is injective on the space C 1 c (X) ofcompactly supported smooth functions on X. In the present paper, which is a continuation of these papers, we

  1. Fractional-Fourier-domain weighted Wigner distribution

    NARCIS (Netherlands)

    Stankovic, L.; Alieva, T.; Bastiaans, M.J.

    2001-01-01

    A fractional-Fourier-domain realization of the weighted Wigner distribution (or S-method), producing auto-terms close to the ones in the Wigner distribution itself, but with reduced cross-terms, is presented. The computational cost of this fractional-domain realization is the same as the

  2. Fourier Series Formalization in ACL2(r

    Directory of Open Access Journals (Sweden)

    Cuong K. Chau

    2015-09-01

    Full Text Available We formalize some basic properties of Fourier series in the logic of ACL2(r, which is a variant of ACL2 that supports reasoning about the real and complex numbers by way of non-standard analysis. More specifically, we extend a framework for formally evaluating definite integrals of real-valued, continuous functions using the Second Fundamental Theorem of Calculus. Our extended framework is also applied to functions containing free arguments. Using this framework, we are able to prove the orthogonality relationships between trigonometric functions, which are the essential properties in Fourier series analysis. The sum rule for definite integrals of indexed sums is also formalized by applying the extended framework along with the First Fundamental Theorem of Calculus and the sum rule for differentiation. The Fourier coefficient formulas of periodic functions are then formalized from the orthogonality relations and the sum rule for integration. Consequently, the uniqueness of Fourier sums is a straightforward corollary. We also present our formalization of the sum rule for definite integrals of infinite series in ACL2(r. Part of this task is to prove the Dini Uniform Convergence Theorem and the continuity of a limit function under certain conditions. A key technique in our proofs of these theorems is to apply the overspill principle from non-standard analysis.

  3. Clifford Fourier transform on vector fields.

    Science.gov (United States)

    Ebling, Julia; Scheuermann, Gerik

    2005-01-01

    Image processing and computer vision have robust methods for feature extraction and the computation of derivatives of scalar fields. Furthermore, interpolation and the effects of applying a filter can be analyzed in detail and can be advantages when applying these methods to vector fields to obtain a solid theoretical basis for feature extraction. We recently introduced the Clifford convolution, which is an extension of the classical convolution on scalar fields and provides a unified notation for the convolution of scalar and vector fields. It has attractive geometric properties that allow pattern matching on vector fields. In image processing, the convolution and the Fourier transform operators are closely related by the convolution theorem and, in this paper, we extend the Fourier transform to include general elements of Clifford Algebra, called multivectors, including scalars and vectors. The resulting convolution and derivative theorems are extensions of those for convolution and the Fourier transform on scalar fields. The Clifford Fourier transform allows a frequency analysis of vector fields and the behavior of vector-valued filters. In frequency space, vectors are transformed into general multivectors of the Clifford Algebra. Many basic vector-valued patterns, such as source, sink, saddle points, and potential vortices, can be described by a few multivectors in frequency space.

  4. Fourier transforms on a semisimple symmetric space

    NARCIS (Netherlands)

    Ban, E.P. van den; Schlichtkrull, H.

    1994-01-01

    Let G=H be a semisimple symmetric space, that is, G is a connected semisimple real Lie group with an involution ?, and H is an open subgroup of the group of xed points for ? in G. The main purpose of this paper is to study an explicit Fourier transform on G=H. In terms of general representation

  5. Fourier transforms on a semisimple symmetric space

    NARCIS (Netherlands)

    Ban, E.P. van den; Carmona, J.; Delorme, P.

    1997-01-01

    Let G=H be a semisimple symmetric space, that is, G is a connected semisimple real Lie group with an involution ?, and H is an open subgroup of the group of xed points for ? in G. The main purpose of this paper is to study an explicit Fourier transform on G=H. In terms of general representation

  6. Analysis of regional timelines to set up a global phase III clinical trial in breast cancer: the adjuvant lapatinib and/or trastuzumab treatment optimization experience.

    Science.gov (United States)

    Metzger-Filho, Otto; de Azambuja, Evandro; Bradbury, Ian; Saini, Kamal S; Bines, José; Simon, Sergio D; Dooren, Veerle Van; Aktan, Gursel; Pritchard, Kathleen I; Wolff, Antonio C; Smith, Ian; Jackisch, Christian; Lang, Istvan; Untch, Michael; Boyle, Frances; Xu, Binghe; Baselga, Jose; Perez, Edith A; Piccart-Gebhart, Martine

    2013-01-01

    This study measured the time taken for setting up the different facets of adjuvant lapatinib and/or trastuzumab treatment optimization (ALTTO), an nternational phase III study being conducted in 44 participating countries. Time to regulatory authority (RA) approval, time to ethics committee/institutional review board (EC/IRB) approval, time from study approval by EC/IRB to first randomized patient, and time from first to last randomized patient were prospectively collected in the ALTTO study. Analyses were conducted by grouping countries into either geographic regions or economic classes as per the World Bank's criteria. South America had a significantly longer time to RA approval (median: 236 days, range: 21-257 days) than Europe (median: 52 days, range: 0-151 days), North America (median: 26 days, range: 22-30 days), and Asia-Pacific (median: 62 days, range: 37-75 days). Upper-middle economies had longer times to RA approval (median: 123 days, range: 21-257 days) than high-income (median: 47 days, range: 0-112 days) and lower-middle income economies (median: 57 days, range: 37-62 days). No significant difference was observed for time to EC/IRB approval across the studied regions (median: 59 days, range 0-174 days). Overall, the median time from EC/IRB approval to first recruited patient was 169 days (range: 26-412 days). This study highlights the long time intervals required to activate a global phase III trial. Collaborative research groups, pharmaceutical industry sponsors, and regulatory authorities should analyze the current system and enter into dialogue for optimizing local policies. This would enable faster access of patients to innovative therapies and enhance the efficiency of clinical research.

  7. Influences of overlap index on Fourier ptychography imaging

    Science.gov (United States)

    Wang, Honghong; Rong, Lu; Wang, Dayong; Zhang, Xu; Zhai, Changchao; Panezai, Spozmai; Wang, Yunxin; Zhao, Jie

    2018-01-01

    Fourier ptychography is a new type of synthetic aperture imaging technique based on phase retrieval method which can improve microscopeic imaging performance beyond the diffraction limit of the employed optical components by illuminating the object with oblique waves of different incident angles where the field of view remains unchanged. illumination angle and the overlap rate of spectrum will have a certain impact on the quality of reconstruction. In this paper, we study the effects of illumination angle and spectral overlap rate on the image quality of Fourier ptychography. The simulation results show that increasing the illumination angle and spectral overlap can improve the resolution, but there is a threshold for the key parameters of spectral overlap rate. The convergence rate decreases when the overlap rate exceeds 70%, and the reconstruction process is more time-consuming due to the high overlap rate. However the results of proposed study shows that an overlap of 60% is the optimal choice to acquire a high-quality recovery with high speed.

  8. Optimizing Clinical Operations as part of a Global Emergency Medicine Initiative in Kumasi, Ghana: Application of Lean Manufacturing Principals to Low Resource Health Systems

    Science.gov (United States)

    Carter, Patrick M.; Desmond, Jeffery S.; Akanbobnaab, Christopher; Oteng, Rockefeller A.; Rominski, Sarah; Barsan, William G.; Cunningham, Rebecca

    2012-01-01

    Background Although many global health programs focus on providing clinical care or medical education, improving clinical operations can have a significant effect on patient care delivery, especially in developing health systems without high-level operations management. Lean manufacturing techniques have been effective in decreasing emergency department (ED) length of stay, patient waiting times, numbers of patients leaving without being seen, and door-to-balloon times for ST-elevation myocardial infarction in developed health systems; but use of Lean in low to middle income countries with developing emergency medicine systems has not been well characterized. Objectives To describe the application of Lean manufacturing techniques to improve clinical operations at Komfo Anokye Teaching Hospital in Ghana and to identify key lessons learned to aid future global EM initiatives. Methods A three-week Lean improvement program focused on the hospital admissions process at Komfo Anokye Teaching Hospital was completed by a 14-person team in six stages: problem definition, scope of project planning, value stream mapping, root cause analysis, future state planning, and implementation planning. Results The authors identified eight lessons learned during our use of Lean to optimize the operations of an ED in a global health setting: 1) the Lean process aided in building a partnership with Ghanaian colleagues; 2) obtaining and maintaining senior institutional support is necessary and challenging; 3) addressing power differences among the team to obtain feedback from all team members is critical to successful Lean analysis; 4) choosing a manageable initial project is critical to influence long-term Lean use in a new environment; 5) data intensive Lean tools can be adapted and are effective in a less resourced health system; 6) several Lean tools focused on team problem solving techniques worked well in a low resource system without modification; 7) using Lean highlighted that

  9. Optimizing clinical operations as part of a global emergency medicine initiative in Kumasi, Ghana: application of Lean manufacturing principals to low-resource health systems.

    Science.gov (United States)

    Carter, Patrick M; Desmond, Jeffery S; Akanbobnaab, Christopher; Oteng, Rockefeller A; Rominski, Sarah D; Barsan, William G; Cunningham, Rebecca M

    2012-03-01

    Although many global health programs focus on providing clinical care or medical education, improving clinical operations can have a significant effect on patient care delivery, especially in developing health systems without high-level operations management. Lean manufacturing techniques have been effective in decreasing emergency department (ED) length of stay, patient waiting times, numbers of patients leaving without being seen, and door-to-balloon times for ST-elevation myocardial infarction in developed health systems, but use of Lean in low to middle income countries with developing emergency medicine (EM) systems has not been well characterized. To describe the application of Lean manufacturing techniques to improve clinical operations at Komfo Anokye Teaching Hospital (KATH) in Ghana and to identify key lessons learned to aid future global EM initiatives. A 3-week Lean improvement program focused on the hospital admissions process at KATH was completed by a 14-person team in six stages: problem definition, scope of project planning, value stream mapping, root cause analysis, future state planning, and implementation planning. The authors identified eight lessons learned during our use of Lean to optimize the operations of an ED in a global health setting: 1) the Lean process aided in building a partnership with Ghanaian colleagues; 2) obtaining and maintaining senior institutional support is necessary and challenging; 3) addressing power differences among the team to obtain feedback from all team members is critical to successful Lean analysis; 4) choosing a manageable initial project is critical to influence long-term Lean use in a new environment; 5) data intensive Lean tools can be adapted and are effective in a less resourced health system; 6) several Lean tools focused on team problem-solving techniques worked well in a low-resource system without modification; 7) using Lean highlighted that important changes do not require an influx of resources; and

  10. Automatic Fourier transform and self-Fourier beams due to parabolic potential

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Yiqi, E-mail: zhangyiqi@mail.xjtu.edu.cn [Key Laboratory for Physical Electronics and Devices of the Ministry of Education & Shaanxi Key Lab of Information Photonic Technique, Xi’an Jiaotong University, Xi’an 710049 (China); Liu, Xing [Key Laboratory for Physical Electronics and Devices of the Ministry of Education & Shaanxi Key Lab of Information Photonic Technique, Xi’an Jiaotong University, Xi’an 710049 (China); Belić, Milivoj R., E-mail: milivoj.belic@qatar.tamu.edu [Science Program, Texas A& M University at Qatar, P.O. Box 23874 Doha (Qatar); Zhong, Weiping [Department of Electronic and Information Engineering, Shunde Polytechnic, Shunde 528300 (China); Petrović, Milan S. [Institute of Physics, P.O. Box 68, 11001 Belgrade (Serbia); Zhang, Yanpeng, E-mail: ypzhang@mail.xjtu.edu.cn [Key Laboratory for Physical Electronics and Devices of the Ministry of Education & Shaanxi Key Lab of Information Photonic Technique, Xi’an Jiaotong University, Xi’an 710049 (China)

    2015-12-15

    We investigate the propagation of light beams including Hermite–Gauss, Bessel–Gauss and finite energy Airy beams in a linear medium with parabolic potential. Expectedly, the beams undergo oscillation during propagation, but quite unexpectedly they also perform automatic Fourier transform, that is, periodic change from the beam to its Fourier transform and back. In addition to oscillation, the finite-energy Airy beams exhibit periodic inversion during propagation. The oscillating period of parity-asymmetric beams is twice that of the parity-symmetric beams. Based on the propagation in parabolic potential, we introduce a class of optically-interesting beams that are self-Fourier beams—that is, the beams whose Fourier transforms are the beams themselves.

  11. Investigations of new cardiac functional imaging using Fourier analysis of gated blood-pool study

    International Nuclear Information System (INIS)

    Maeda, H.; Takeda, K.; Nakagawa, T.; Yamaguchi, N.; Taguchi, M.; Konishi, T.; Hamada, M.

    1982-01-01

    A new cardiac functional imaging, using temporal Fourier analysis of 28-frame gated cardiac blood-pool studies, was developed. A time-activity curve of each pixel was approximated by its Fourier series. Approximation by the sum for terms to the 3rd frequency of its Fourier series was considered to be most reasonable because of having the least aberration due to statistical fluctuation and close agreement between the global left ventricular curve and the regional fitted curves in normal subjects. To evaluate the ventricular systolic and diastolic performances, 9 parameters were analyzed from thus fitted curves on a pixel-by-pixel basis and displayed on a colour CRT in 64x64 matrix form. In patients with hypertrophic obstructive cardiomyopathy and other cardiac lesions, detailed information on the regional ventricular systolic and diastolic performances was clearly visualized by this method, which was difficult to obtain from the usual functional images of phase and amplitude at the fundamental frequency alone

  12. Combustion system optimization of a P-62 lignite boiler in ContourGlobal Maritsa East 3 with NOx-reduction and efficiency improvement

    International Nuclear Information System (INIS)

    Petkov, Ch.; Thierbach, Hans-Ulrich; Totev, T.

    2013-01-01

    Steinmueller Engineering GmbH, Gummersbach, Germany, successfully concluded in consortium with Siemens EOOD, Sofia, the combustion system modification of a P62 lignite fired boiler in TPP ContourGlobal Maritsa East 3, which was targeting mainly the reduction of the NOx emissions below 180 mg/Nm 3 at 6 % O 2 . The modification is part of an EPC contract covering the design, fabrication, installation and commissioning works needed to upgrade the boilers at the power station. The Modification concept involves optimization of PF- and Vapor distribution, replacement of the coal burners, installation of new Over-fire air (OFA) system and Side-wall air (SWA) system and minor modification of the existing control system to allow control of the OFAflow. The main results of the modification are: Reduction of the NOx emissions (at ESP exit) from approximately 390 g/Nm³ to below 180 mg/Nm³ at 6% O 2 , Efficiency increase of the furnace by reduction of the excess air ratio from 1.2 to 1.15 (at furnace outlet) and overall increase of the boiler efficiency. (authors)

  13. (Anti)symmetric multivariate exponential functions and corresponding Fourier transforms

    International Nuclear Information System (INIS)

    Klimyk, A U; Patera, J

    2007-01-01

    We define and study symmetrized and antisymmetrized multivariate exponential functions. They are defined as determinants and antideterminants of matrices whose entries are exponential functions of one variable. These functions are eigenfunctions of the Laplace operator on the corresponding fundamental domains satisfying certain boundary conditions. To symmetric and antisymmetric multivariate exponential functions there correspond Fourier transforms. There are three types of such Fourier transforms: expansions into the corresponding Fourier series, integral Fourier transforms and multivariate finite Fourier transforms. Eigenfunctions of the integral Fourier transforms are found

  14. On a Convergence of Rational Approximations by the Modified Fourier Basis

    Directory of Open Access Journals (Sweden)

    Tigran Bakaryan

    2017-12-01

    Full Text Available We continue investigations of the modified-trigonometric-rational approximations that arise while accelerating the convergence of the modified Fourier expansions by means of rational corrections. Previously, we investigated the pointwise convergence of the rational approximations away from the endpoints and the $L_2$-convergence on the entire interval. Here, we study the convergence at the endpoints and derive the exact constants for the main terms of asymptotic errors. We show that the Fourier-Pade approximations are much more accurate in all frameworks than the modified expansions for sufficiently smooth functions. Moreover, we consider a simplified version of the rational approximations and explore the optimal values of parameters that lead to better accuracy in the framework of the $L_2$-error. Numerical experiments perform comparisons of the rational approximations with the modified Fourier expansions.

  15. Fourier Spot Volatility Estimator: Asymptotic Normality and Efficiency with Liquid and Illiquid High-Frequency Data

    Science.gov (United States)

    2015-01-01

    The recent availability of high frequency data has permitted more efficient ways of computing volatility. However, estimation of volatility from asset price observations is challenging because observed high frequency data are generally affected by noise-microstructure effects. We address this issue by using the Fourier estimator of instantaneous volatility introduced in Malliavin and Mancino 2002. We prove a central limit theorem for this estimator with optimal rate and asymptotic variance. An extensive simulation study shows the accuracy of the spot volatility estimates obtained using the Fourier estimator and its robustness even in the presence of different microstructure noise specifications. An empirical analysis on high frequency data (U.S. S&P500 and FIB 30 indices) illustrates how the Fourier spot volatility estimates can be successfully used to study intraday variations of volatility and to predict intraday Value at Risk. PMID:26421617

  16. Closed fringe demodulation using phase decomposition by Fourier basis functions.

    Science.gov (United States)

    Kulkarni, Rishikesh; Rastogi, Pramod

    2016-06-01

    We report a new technique for the demodulation of a closed fringe pattern by representing the phase as a weighted linear combination of a certain number of linearly independent Fourier basis functions in a given row/column at a time. A state space model is developed with the weights of the basis functions as the elements of the state vector. The iterative extended Kalman filter is effectively utilized for the robust estimation of the weights. A coarse estimate of the fringe density based on the fringe frequency map is used to determine the initial row/column to start with and subsequently the optimal number of basis functions. The performance of the proposed method is evaluated with several noisy fringe patterns. Experimental results are also reported to support the practical applicability of the proposed method.

  17. Direct phase retrieval in double blind Fourier holography.

    Science.gov (United States)

    Raz, Oren; Leshem, Ben; Miao, Jianwei; Nadler, Boaz; Oron, Dan; Dudovich, Nirit

    2014-10-20

    Phase measurement is a long-standing challenge in a wide range of applications, from X-ray imaging to astrophysics and spectroscopy. While in some scenarios the phase is resolved by an interferometric measurement, in others it is reconstructed via numerical optimization, based on some a-priori knowledge about the signal. The latter commonly use iterative algorithms, and thus have to deal with their convergence, stagnation, and robustness to noise. Here we combine these two approaches and present a new scheme, termed double blind Fourier holography, providing an efficient solution to the phase problem in two dimensions, by solving a system of linear equations. We present and experimentally demonstrate our approach for the case of lens-less imaging.

  18. Fourier analysis: from cloaking to imaging

    Science.gov (United States)

    Wu, Kedi; Cheng, Qiluan; Wang, Guo Ping

    2016-04-01

    Regarding invisibility cloaks as an optical imaging system, we present a Fourier approach to analytically unify both Pendry cloaks and complementary media-based invisibility cloaks into one kind of cloak. By synthesizing different transfer functions, we can construct different devices to realize a series of interesting functions such as hiding objects (events), creating illusions, and performing perfect imaging. In this article, we give a brief review on recent works of applying Fourier approach to analysis invisibility cloaks and optical imaging through scattering layers. We show that, to construct devices to conceal an object, no constructive materials with extreme properties are required, making most, if not all, of the above functions realizable by using naturally occurring materials. As instances, we experimentally verify a method of directionally hiding distant objects and create illusions by using all-dielectric materials, and further demonstrate a non-invasive method of imaging objects completely hidden by scattering layers.

  19. Fourier analysis: from cloaking to imaging

    International Nuclear Information System (INIS)

    Wu, Kedi; Ping Wang, Guo; Cheng, Qiluan

    2016-01-01

    Regarding invisibility cloaks as an optical imaging system, we present a Fourier approach to analytically unify both Pendry cloaks and complementary media-based invisibility cloaks into one kind of cloak. By synthesizing different transfer functions, we can construct different devices to realize a series of interesting functions such as hiding objects (events), creating illusions, and performing perfect imaging. In this article, we give a brief review on recent works of applying Fourier approach to analysis invisibility cloaks and optical imaging through scattering layers. We show that, to construct devices to conceal an object, no constructive materials with extreme properties are required, making most, if not all, of the above functions realizable by using naturally occurring materials. As instances, we experimentally verify a method of directionally hiding distant objects and create illusions by using all-dielectric materials, and further demonstrate a non-invasive method of imaging objects completely hidden by scattering layers. (review)

  20. Multichannel Dynamic Fourier-Transform IR Spectrometer

    Science.gov (United States)

    Balashov, A. A.; Vaguine, V. A.; Golyak, Il. S.; Morozov, A. N.; Khorokhorin, A. I.

    2017-09-01

    A design of a multichannel continuous scan Fourier-transform IR spectrometer for simultaneous recording and analysis of the spectral characteristics of several objects is proposed. For implementing the design, a multi-probe fiber is used, constructed from several optical fibers connected into a single optical connector and attached at the output of the interferometer. The Fourier-transform spectrometer is used as a signal modulator. Each fiber is individually mated with an investigated sample and a dedicated radiation detector. For the developed system, the radiation intensity of the spectrometer is calculated from the condition of the minimum spectral resolution and parameters of the optical fibers. Using the proposed design, emission spectra of a gas-discharge neon lamp have been recorded using a single fiber 1 mm in diameter with a numerical aperture NA = 0.22.