• Title/Summary/Keyword: Max-Min

Search Result 1,653, Processing Time 0.03 seconds

FCM-based RBF Network Using Fuzzy Control Method (퍼지 제어 기법을 이용한 FCM 기반 RBF 네트워크)

  • Kim, Tae-Hyung;Park, Choong-Shik;Kim, Kwang-Baek
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2008.06a
    • /
    • pp.149-154
    • /
    • 2008
  • FCM 기반 RBF 네트워크는 서로 다른 학습 구조가 결합된 혼합형 모델로서, 입력층과 중간층의 학습 구조는 FCM 알고리즘을 적용하고, 중간층과 출력층 사이의 학습 구조는 Max_Min 신경망을 적용한다. 입력층과 중간층의 학습시 입력벡터와 중간층의 노드중에서 중심과 입력벡터간의 가장 가까운 노드를 승자 노드로 선택하여 출력층으로 전달한다. 그리고 중간층과 출력층 사이의 학습 구조는 Max_Min 신경망을 적용하여 중간층의 승자 뉴런이 출력층의 입력벡터로 적용한다. 하지만 많은 패턴이 입력벡터로 제시될 경우 학습 성능이 저하되는 단점이 있다. 따라서 본 논문에서는 중간층과 출력층의 학습 구조인 Max_Min 알고리즘의 학습 성능을 개선시키기 위해 퍼지 제어시스템을 이용하여 학습률을 동적으로 조정하는 퍼지 제어 기법을 이용한 FCM 기반 RBF 네트워크를 제안한다. 제안된 방법의 학습 성능을 평가하기 위하여 컨테이너 영상에서 추출한 숫자, 영문 식별자를 학습 데이터로 적용한 결과, 기존의 ART2 기반 RBF 네트워크보다 학습 시간이 적게 소요되고, 학습의 수렴성이 개선된 것을 확인하였다.

  • PDF

Min-Max Stochastic Optimization with Applications to the Single-Period Inventory Control Problem

  • Park, Kyungchul
    • Management Science and Financial Engineering
    • /
    • v.21 no.1
    • /
    • pp.11-17
    • /
    • 2015
  • Min-max stochastic optimization is an approach to address the distribution ambiguity of the underlying random variable. We present a unified approach to the problem which utilizes the theory of convex order on the random variables. First, we consider a general framework for the problem and give a condition under which the convex order can be utilized to transform the min-max optimization problem into a simple minimization problem. Then extremal distributions are presented for some interesting classes of distributions. Finally, applications to the single-period inventory control problems are given.

Modified WRR Scheduling Algorithm for Satisfying Maximum of MCR or Max-Min Share Fairness Criterion (Maximum of MCR or Max-Min Share 공평성을 만족하는 개선된 WRR 스케줄링 알고리즘)

  • 정경택
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.6A
    • /
    • pp.1089-1098
    • /
    • 2001
  • WRR 스케줄링 알고리즘은 계산의 단순성과 저 비용 구현의 장점을 가지고 있어 고속 패킷 스위칭 네트워크에서 널리 쓰이고 있지만 버스티한 트래픽에 대해서는 입력 트래픽을 일정 비율로 스케줄링하기 때문에 효율성이 낮다는 문제점이 있다. 또한, WRR 알고리즘은 ABR 서비스 클래스의 공평성 기준의 하나인 Maximum of MCR or Max-Min share 공평성을 만족시키지 못한다. 따라서 ABR 서비스를 위한 공평성 기준을 만족시키는 스케줄링 알고리즘이 필요하다. 따라서, 본 논문에서는 ABR 서비스를 위한 5가지 공평성 기준들 중 Maximum of MCR or Max-Min share를 만족시키는 스케줄링 알고리즘을 제안한다. 제안된 알고리즘이 공평성 기준을 만족시키고, 네트워크 자원을 각 ABR VC들에게 공평하게 할당해 주는지를 컴퓨터 시뮬레이션을 통하여 WRR 알고리즘과 비교, 분석한다.

  • PDF

Flood Control Operation of Soyang and Choongju Reservoirs by the Min-max DP (Min-Max DP에 의한 소양 및 충주호의 홍수조절운영)

  • 오영민;이길성
    • Water for future
    • /
    • v.19 no.4
    • /
    • pp.339-346
    • /
    • 1986
  • A real-time single reservoir operation model using the Min-max Dynamic Programming for the flood control of Soyanggang Dam and Choongju Dam is developed. The objective function is to minimize the maximum release from each dam and the constraints are those from ther reservoir and channel characteristics. Control and utilization efficiencies are used to measure the performance of the reservoir operation method (ROM). In comparison with those of simulation models(such as the Rigid ROM, the Technical ROM and the Linear Decision Rule), the efficiencies of the optimization model are superior for all return periods.

  • PDF

Upper and Lower Bounds of the Expected Busy Period for the Triadic Med(N, T, D) Policy (삼변수 Med(N, T, D) 운용방침에 따른 Busy Period 기대값의 상한과 하한 유도)

  • Rhee, Hahn-Kyou
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.36 no.1
    • /
    • pp.58-63
    • /
    • 2013
  • Using the known result of the expected busy period for the triadic Med (N, T, D) operating policies applied to a controllable M/G/1 queueing model, its upper and lower bounds are derived to approximate its corresponding actual values. Both bounds are represented in terms of the expected busy periods for the dyadic Min (N, T), Min (N, D) and Min (T, D) or Max (N, T), Max (N, D) and Max (T, D) with the simple N, T and D operating policies without using any other types of triadic operating policies such as Min (N, T, D) and Max (N, T, D) policies. All three input variables N, T and D are equally contributed to construct such bounds for estimation of the expected busy period.

Anaysis of the max·min and local max·local min in the school mathematics and department mathematics textbook (학교수학과 대학수학 교과서에 나타난 최대·최소와 극대·극소의 분석)

  • Oh Hye Young
    • East Asian mathematical journal
    • /
    • v.40 no.2
    • /
    • pp.127-148
    • /
    • 2024
  • Maximum and minimum have a historical background in mathematics and occupy an important part of the differential unit in school mathematics. As the curriculum is revised, there are changes and problems in the way definition introduced. Therefore, this study analyzes the changes in the method of introducing maximum and minimum definitions following the reorganization of the 2007 and 2009 revised mathematics curriculum, and analyzes the differences in maximum and minimum definition methods compared to the nine mathematics II textbooks in the 2015 revised mathematics curriculum and three real analysis. In addition, methods to improve the terms used in relation to the maximum and minimum values are presented.

Deep Learning Based Digital Staining Method in Fourier Ptychographic Microscopy Image (Fourier Ptychographic Microscopy 영상에서의 딥러닝 기반 디지털 염색 방법 연구)

  • Seok-Min Hwang;Dong-Bum Kim;Yu-Jeong Kim;Yeo-Rin Kim;Jong-Ha Lee
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.23 no.2
    • /
    • pp.97-106
    • /
    • 2022
  • In this study, H&E staining is necessary to distinguish cells. However, dyeing directly requires a lot of money and time. The purpose is to convert the phase image of unstained cells to the amplitude image of stained cells. Image data taken with FPM was created with Phase image and Amplitude image using Matlab's parameters. Through normalization, a visually identifiable image was obtained. Through normalization, a visually distinguishable image was obtained. Using the GAN algorithm, a Fake Amplitude image similar to the Real Amplitude image was created based on the Phase image, and cells were distinguished by objectification using MASK R-CNN with the Fake Amplitude image As a result of the study, D loss max is 3.3e-1, min is 6.8e-2, G loss max is 6.9e-2, min is 2.9e-2, A loss max is 5.8e-1, min is 1.2e-1, Mask R-CNN max is 1.9e0, and min is 3.2e-1.

The Effect of Duration Protocols on VO2max and Presence of Plateau (운동검사시간이 최대산소섭취량과 정체현상에 미치는 영향)

  • Kim, Do-Yeon;Yoon, Byung-Kon
    • Journal of Life Science
    • /
    • v.19 no.12
    • /
    • pp.1712-1717
    • /
    • 2009
  • The purpose of this study was to compare $VO_2$max, maximal power output, and presence of $VO_2$ plateau across 4 protocol durations (5, 8, 12, and 16 min) during incremental cycling exercise to $VO_2$max. Twenty moderately to highly trained subjects ($24.9{\pm}6.6$) participated in the study. The mean $VO_2$max in the 5-min ($3.55{\pm}0.80\;l/min$) and 8-min ($3.66{\pm}0.88\;l/min$) duration protocols had higher and significantly higher mean value in the 8-min duration protocol compared to the 12-min ($3.49{\pm}0.76\;l/min$) and 16-min ($3.45{\pm}0.73\;l/min$) duration protocols. The AMPO across four protocols showed a significant difference. The AMPO for the 5-min protocol was 12%, 24%, and 35% higher than AMPO for the 8-min, 12-min and 16-min protocols. The presence of plateau was 12.5% for the 5 min protocol, 56.25% for the 8 min protocol, 37.5% for the 12 min protocol, and 56.25% for the 16 min protocol. This study indicates that the short duration protocol (<8 min) is a more valid measurement for $VO_2$ max than optimal duration protocol (8-12 min) in moderate to highly trained individuals on the cycle ergometer.

A study on the treatment of a max-value cost function in parametric optimization (매개변수 종속 최적화에서 최대치형 목적함수 처리에 관한 연구)

  • Kim, Min-Soo;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.10
    • /
    • pp.1561-1570
    • /
    • 1997
  • This study explores the treatment of the max-value cost function over a parameter interval in parametric optimization. To avoid the computational burden of the transformation treatment using an artificial variable, a direct treatment of the original max-value cost function is proposed. It is theoretically shown that the transformation treatment results in demanding an additional equality constraint of dual variables as a part of the Kuhn-Tucker necessary conditions. Also, it is demonstrated that the usability and feasibility conditions on the search direction of the transformation treatment retard convergence rate. To investigate numerical performances of both treatments, typical optimization algorithms in ADS are employed to solve a min-max steady-state response optimization. All the algorithm tested reveal that the suggested direct treatment is more efficient and stable than the transformation treatment. Also, the better performing of the direct treatment over the transformation treatment is clearly shown by constrasting the convergence paths in the design space of the sample problem. Six min-max transient response optimization problems are also solved by using both treatments, and the comparisons of the results confirm that the performances of the direct treatment is better than those of the tranformation treatment.

Soft decision for Gray Coded PAM Signals Using Max-Log-MAP (Max-Log-MAP을 이용한 Gray 부호화된 PAM 신호의 연판정 계산식)

  • Hyun, Kwang-Min;Yoon, Dong-Weon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.2C
    • /
    • pp.117-122
    • /
    • 2006
  • In this paper, we present a simple and general soft bit decision expression for a Gray coded PAM signal over additive white Gaussian noise(AWGN) channel with the log likelihood ratio(LLR). In order to reduce the complexity of the LLR calculation, we make the bitwise LLR expression simple by replacing the mathematical max functions of the conventional Max-Log-MAP expression with simple arithmetic functions associated with some deterministic parameters, such as a received value and distance between symbols on a signal space. Taking the implementation issues, like the area of silicon, the power consumption, the timing latency, and so on, into consideration, we submit that the proposed method is a promising alternative way to conventional methods for reconfigurable systems.