• Title/Summary/Keyword: Minima

Search Result 453, Processing Time 0.021 seconds

THE PERFORMANCE OF A MODIFIED ARMIJO LINE SEARCH RULE IN BFGS OPTIMIZATION METHOD

  • Kim, MinSu;Kwon, SunJoo;Oh, SeYoung
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.21 no.1
    • /
    • pp.117-127
    • /
    • 2008
  • The performance of a modified Armijo line search rule related to BFGS gradient type method with the results from other well-known line search rules are compared as well as analyzed. Although the modified Armijo rule does require as much computational cost as the other rules, it shows more efficient in finding local minima of unconstrained optimization problems. The sensitivity of the parameters used in the line search rules is also analyzed. The results obtained by implementing algorithms in Matlab for the test problems in [3] are presented.

  • PDF

PERIOD VARIATION STUDY OF THE NEGLECTED ALGOL ECLIPSING BINARY SYSTEM V346 CYGNIUS

  • Hanna, Magdy
    • Journal of The Korean Astronomical Society
    • /
    • v.47 no.3
    • /
    • pp.99-104
    • /
    • 2014
  • We present the rst period variation study for the Algol eclipsing binary V346 Cyg by constructing the (O-C) residual diagram using all the available precise minima times. We conclude that the period variation can be explained by a sine-like variation due to the presence of a third body orbiting the binary in about $68.89{\pm}4.69$ years, together with a long-term orbital period decrease ($dP/dt=-1.23{\times}10^{-7}day/yr$) that can be interpreted to be due to slow mass loss from the ${\delta}$-Scuti primary component. The sinusoidal variation may also be explained by using the the Applegate (1992) mechanism involving cyclic magnetic activity due to star-spots on the secondary component. The present preliminary solution needs more precise photometric observations to be confirmed.

Simulation for the analysis of distortion and electrical characteristics of a two-dimensional BJT (2차원 BJT의 전기적 특성 및 왜곡 해석 시뮬레이션)

  • 이종화;신윤권
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.35D no.4
    • /
    • pp.84-92
    • /
    • 1998
  • A program was developed to analyze the electrical characteristics and harmonic distrotion in a two-dimensional silicon BJT. The finite difference equations of the small signal and its second and thired harmonics for basic semiconductor equations are formulated treating the nonlinearity and time dependence with Volterra series and Taylor series. The soluations for three sets of simultaneous equations were obtained sequantially by a decoupled iteration method and each set was solved by a modified Stone's algorithm. Distortion magins and ac parameters such as input impedance and current gains are calculated with frequency and load resistance as parameters. The distortion margin vs. load resistancecurves show cancellation minima when the pahse of output voltage shifts. It is shown that the distortionof small signal characteristics can be reduced by reducing the base width, increasing the emitter stripe length and reducing the collector epitaxial layer doping concentration in the silicon BJT structure. The simulation program called TRADAP can be used for the design and optimization of transistors and circuits as well as for the calculation of small signal and distortion solutions.

  • PDF

Solution of quadratic assignment problem using parallel combinatorial variant of evolution strategy (병렬 CES를 이용한 QAP 해법)

  • Park, Lae-Jeong;Lee, Hyun;Park, Cheol-Hoon
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.5
    • /
    • pp.66-70
    • /
    • 1997
  • This paper presents a parallel combinatorial variant of evolution strategy (PCES) to solve well-known combinatorial optimization problems, Quadratic assignment problems (QAPs). The PCES reduces the possibility of getting stuck in local minima due to maintenance of subpopulation and thus it is more effective than the CES. Experiment results on two benchmark problems show that the PCES is better than the cES and the genetic algorithm(GA).

  • PDF

Importance of Backscattering Effects in Ballistic Quantum Transport in Mesoscopic Ring Structures

  • Shin, Min-Cheol;Park, Kyoung-Wan;Lee, Seong-Jae;Lee, El-Hang
    • ETRI Journal
    • /
    • v.18 no.4
    • /
    • pp.301-313
    • /
    • 1997
  • We have found that in the ballistic electron transport in a ring structure, the junction-backscattering contribution is critical for all the major features of the Aharonov-Bohm-type interference patterns. In particular, by considering the backscattering effect, we present new and clear interpretation about the physical origin of the secondary minima in the electrostatic Aharonov-Bohm effect and that of the h/2e oscillations when both the electric and magnetic potentials are present. We have devised a convenient scheme of expanding the conductance by the junction backscattering amplitude, which enables us to determine most important electron paths among infinitely many paths and to gain insight about their contributions to the interference patterns. Based on the scheme, we have identified various interesting interference phenomena in the ballistic ring structure and found that the backscattering effect plays a critical role in all of them.

  • PDF

Characteristics of solutions in softening plasticity and path criterion

  • Chen, G.;Baker, G.
    • Structural Engineering and Mechanics
    • /
    • v.16 no.2
    • /
    • pp.141-152
    • /
    • 2003
  • Characteristics of solutions of softening plasticity are discussed in this article. The localized and non-localized solutions are obtained for a three-bar truss and their stability is evaluated with the aid of the second-order work. Beyond the bifurcation point, the single stable loading path splits into several post-bifurcation paths and the second-order work exhibits several competing minima. Among the multiple post-bifurcation equilibrium states, the localized solutions correspond to the minimum points of the second-order work, while the non-localized solutions correspond to the saddles and local maximum points. To determine the real post-bifurcation path, it is proposed that the structure should follow the path corresponding to the absolute minimum point of the second-order work. The proposal is further proved equivalent to Bazant's path criterion derived on a thermodynamics basis.

Visual Tracking Using Snake Algorithm Based on Optical Flow Information

  • Kim, Won;Lee, Ju-Jang
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1999.10a
    • /
    • pp.13-16
    • /
    • 1999
  • An active contour model, Snake, was developed as a useful segmenting and tracking tool lot rigid or non-rigid (i.e. deformable) objects by Kass in 1987 In this research, Snake is newly designed to cover this large moving case. Image flow energy is proposed to give Snake the motion information of the target object. By this image flow energy Snake's nodes can move uniformly along the direction of the target motion in spite of the existences of local minima. Furthermore, when the motion is too large to apply image flow energy to tracking, a jump mode is proposed for solving the problem. The vector used to make Snake's nodes jump to the new location can be obtained by processing the image flow. The effectiveness of the proposed Snake is confirmed by some simulations.

  • PDF

Single-Layer Neural Networks with Double Rejection Mechanisms for Character Recognition (단층 신경망과 이중 기각 방법을 이용한 문자인식)

  • 임준호;채수익
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.3
    • /
    • pp.522-532
    • /
    • 1995
  • Multilayer neural networks with backpropagation learning algorithm are widely used for pattern classification problems. For many real applications, it is more important to reduce the misclassification rate than to increase the rate of successful classification. But multilayer perceptrons(MLP's) have drawbacks of slow learning speed and false convergence to local minima. In this paper, we propose a new method for character recognition problems with a single-layer network and double rejection mechanisms, which guarantees a very low misclassification rate. Comparing to the MLP's, it yields fast learning and requires a simple hardware architecture. We also introduce a new coding scheme to reduce the misclassification rate. We have prepared two databases: one with 135,000 digit patterns and the other with 117,000 letter patterns, and have applied the proposed method for printed character recognition, which shows that the method reduces the misclassification rate significantly without sacrificing the correct recognition rate.

  • PDF

A Time-Domain Parameter Extraction Method for Speech Recognition using the Local Peak-to-Peak Interval Information (국소 극대-극소점 간의 간격정보를 이용한 시간영역에서의 음성인식을 위한 파라미터 추출 방법)

  • 임재열;김형일;안수길
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.2
    • /
    • pp.28-34
    • /
    • 1994
  • In this paper, a new time-domain parameter extraction method for speech recognition is proposed. The suggested emthod is based on the fact that the local peak-to-peak interval, i.e., the interval between maxima and minima of speech waveform is closely related to the frequency component of the speech signal. The parameterization is achieved by a sort of filter bank technique in the time domain. To test the proposed parameter extraction emthod, an isolated word recognizer based on Vector Quantization and Hidden Markov Model was constructed. As a test material, 22 words spoken by ten males were used and the recognition rate of 92.9% was obtained. This result leads to the conclusion that the new parameter extraction method can be used for speech recognition system. Since the proposed method is processed in the time domain, the real-time parameter extraction can be implemented in the class of personal computer equipped onlu with an A/D converter without any DSP board.

  • PDF

Inversion of Geophysical Data Using Genetic Algorithms (유전적 기법에 의한 지구물리자료의 역산)

  • Kim, Hee Joon
    • Economic and Environmental Geology
    • /
    • v.28 no.4
    • /
    • pp.425-431
    • /
    • 1995
  • Genetic algorithms are so named because they are analogous to biological processes. The model parameters are coded in binary form. The algorithm then starts with a randomly chosen population of models called chromosomes. The second step is to evaluate the fitness values of these models, measured by a correlation between data and synthetic for a particular model. Then, the three genetic processes of selection, crossover, and mutation are performed upon the model in sequence. Genetic algorithms share the favorable characteristics of random Monte Carlo over local optimization methods in that they do not require linearizing assumptions nor the calculation of partial derivatives, are independent of the misfit criterion, and avoid numerical instabilities associated with matrix inversion. An additional advantage over converntional methods such as iterative least squares is that the sampling is global, rather than local, thereby reducing the tendency to become entrapped in local minima and avoiding the dependency on an assumed starting model.

  • PDF