• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제10권2호
• /
• pp.146-151
• /
• 2010

This paper proposes a rank-based control method of mutation probability for improving the performances of genetic algorithms (GAs). In order to improve the performances of GAs, GAs should not fall into premature convergence phenomena and should also be able to easily get out of the phenomena when GAs fall into the phenomena without destroying good individuals. For this, it is important to keep diversity of individuals and to keep good individuals. If a method for keeping diversity, however, is not elaborately devised, then good individuals are also destroyed. We should devise a method that keeps diversity of individuals and also keeps good individuals at the same time. To achieve these two objectives, we introduce a rank-based control method of mutation probability in this paper. We set high mutation probabilities to lowly ranked individuals not to fall into premature convergence phenomena by keeping diversity and low mutation probabilities to highly ranked individuals not to destroy good individuals. We experimented our method with typical four function optimization problems in order to measure the performances of our method. It was found from extensive experiments that the proposed rank-based control method could accelerate the GAs considerably.

• 한국산업융합학회 논문집
• /
• 제26권2_2호
• /
• pp.315-325
• /
• 2023

Recently, various dynamic risk analysis methods have been suggested for estimating the risk index by predicting the possibility of accidents and damage. It is necessary to maintain and support the safety system for responding to accidents by continuously updating the probability of accidents and the results of accidents, which are quantitative standards of ship risk. In this study, when a LNG leakage that may occur in the LN G Fuel Gas Supply System (FGSS) room during LN G bunkering operation, a reliability physical model was prepared by the change in monitoring data as physical parameters to estimate the accident probability. The scenario in which LNG leakage occur were configured with FT (Fault Tree), and the coefficient of the covariate model and Weibull distribution was estimated based on the monitoring data. The possibility of an LNG leakage, which is the top event of FT, was confirmed by changes in time and monitoring data. A method for estimating the LNG leakage based on the reliability physical analysis is proposed, which supports fast decision-making by identifying the potential LNG leakage at the accident.

• International Journal of Control, Automation, and Systems
• /
• 제4권3호
• /
• pp.333-343
• /
• 2006

In this paper, the baseline-length information is directly modeled as a measurement for the Wald test, which speeds up the resolution convergence of the integer ambiguity of GPS carrier phase measurements. The convergent speed improvement is demonstrated using numerical simulation and real experiments. It is also shown that the integer ambiguities can be resolved using only four actual satellite measurements with very reasonable convergence speed, if the baseline-length information is used just like one additional observable satellite measurement. Finally, it is shown that the improvement of convergence speed of the Wald test is due to the increase of the probability ratio with the use of the baseline-length constraint.

• 융합신호처리학회논문지
• /
• 제2권2호
• /
• pp.83-88
• /
• 2001

본 논문에서는 요구할당 다중접속 방식을 사용하는 패킷 위성통신에서 스팟빔 스위칭 능력과 신호처리 능력을 가진 위성체의 특정 관찰하는 하향링크 출력포트에 초점을 두어 시스템의 처리량(Throughput)과 블록킹 확률 (Blocking Probability) 그리고 전송지연(Delay)을 요구트래픽과 채널의 서비스종료 확률에 따라 분석하였다. 수학적 검증과 시뮬레이션을 통해 각 채널 서비스종료 확률에 따라 전송지연 대 처리량 곡선을 요구트래픽 파라미터 함수로 구하였으며, 처리량에 따른 전송지연의 상대적인 변화를 비교하였다.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.677-681
• /
• 2010

This paper proposes a transmission probability control scheme for enhancing the performances of FSA-based RFID system. In order to maximize the system performance, the number of tags attempting to transmit their identifiers in a frame should be kept at a proper level. The reader calculates the transmission probability according to the number of tags within the identification range of reader and then broadcasts it to tags. Tags, in which their slot counter values reach to zero, attempt to transmit their identifiers with the received probability. Simulation results show that the proposed scheme can offer better throughput and delay performance than the conventional one regardless of the number of tags.

• Journal of the Korean Statistical Society
• /
• 제19권2호
• /
• pp.122-127
• /
• 1990

Consider the following problem in the large deviation theory. For constants $a_1, \cdots, a_p$ the tail probability $P(M_1 > a_1, \cdots, M_p > a_p)$ of the sample medians $(M_1, \cdots, M_p)$ is supposed to converge to zero as sample size increases. This paper shows that this probability converges to zero exponentially fast and estimates the convergence rates of the above tail probability of the sample medians. Also compare with the rates about the sample means.

• 대한수학회지
• /
• 제44권2호
• /
• pp.467-476
• /
• 2007

A complete convergence theorem for arrays of rowwise independent random variables was proved by Sung, Volodin, and Hu [14]. In this paper, we extend this theorem to the Banach space without any geometric assumptions on the underlying Banach space. Our theorem also improves some known results from the literature.

• 대한수학회지
• /
• 제32권4호
• /
• pp.679-688
• /
• 1995

Let $(B, \left\$\mid$ \right\$\mid$)$ be a real separable Banach space. Let $(\Omega, F, P)$ denote a probability space. A random elements in B is a function from $\Omega$ into B which is $F$-measurable with respect to the Borel $\sigma$-field $B$(B) in B.

• Journal of Communications and Networks
• /
• 제12권5호
• /
• pp.459-465
• /
• 2010

A new blind equalization algorithm that is based on maximizing the probability that the constant modulus errors concentrate near zero is proposed. The cost function of the proposed algorithm is to maximize the probability that the equalizer output power is equal to the constant modulus of the transmitted symbols. Two blind information-theoretic learning (ITL) algorithms based on constant modulus error signals are also introduced: One for minimizing the Euclidean probability density function distance and the other for minimizing the constant modulus error entropy. The relations between the algorithms and their characteristics are investigated, and their performance is compared and analyzed through simulations in multi-path channel environments. The proposed algorithm has a lower computational complexity and a faster convergence speed than the other ITL algorithms that are based on a constant modulus error. The error samples of the proposed blind algorithm exhibit more concentrated density functions and superior error rate performance in severe multi-path channel environments when compared with the other algorithms.

• KDI Journal of Economic Policy
• /
• 제39권1호
• /
• pp.19-40
• /
• 2017

This paper analyzes the interaction between monetary and macroprudential policies mainly in the context of the non-cooperation among policy authorities. Each policy authority's optimal response is to tighten its policy measures when other authorities' policy measures are loosened. This indicates that the two policies are substitutes for each other. This result still holds when an additional financial stability mandate is assigned to the central bank. The condition for the response functions to converge to a Nash equilibrium state is analyzed along with the speed of convergence, showing that they depend on the authorities' preferences and the number of mandates assigned to policy authorities. If the financial supervisory authority (FSA) assigns greater importance to the output gap or a stronger financial stability mandate is assigned to the central bank (CB), the probability of non-convergence increases and the speed of convergence declines even when the condition of convergence is satisfied. Meanwhile, if the CB considers output stability as an important task, the probability of convergence and the speed of converging to a state of equilibrium are high. Finally, when a single mandate or small number of mandates is/are assigned to each authority, stability is more quickly restored as compared to when many mandates are assigned.