• Journal of the Korean Data and Information Science Society
• /
• 제22권3호
• /
• pp.613-618
• /
• 2011

The proposed method is based on a penalized log partial likelihood of Cox proportional hazard model with L1-penalty. We use the iteratively reweighted least squares procedure to solve L1 penalized log partial likelihood function of Cox proportional hazard model. It provide the ecient computation including variable selection and leads to the generalized cross validation function for the model selection. Experimental results are then presented to indicate the performance of the proposed procedure.

• 한국경영과학회지
• /
• 제17권3호
• /
• pp.1-12
• /
• 1992

Parallel Genetic Algorithms (GAs) are developed to solve a single machine n-job scheduling problem which is to minimize the sum of absolute deviations of completion times from a common due date. (0, 1) binary scheme is employed to represent the n-job schedule. Two selection methods, best individual selection and simple selection are examined. The effect of crossover operator, due date adjustment mutation and due date adjustment reordering are discussed. The performance of the parallel genetic algorithm is illustrated with some example problems.

• Nuclear Engineering and Technology
• /
• 제47권2호
• /
• pp.187-195
• /
• 2015

Human-induced initiating events, also called Category B actions in human reliability analysis, are operator actions that may lead directly to initiating events. Most conventional probabilistic safety analyses typically assume that the frequency of initiating events also includes the probability of human-induced initiating events. However, some regulatory documents require Category B actions to be specifically analyzed and quantified in probabilistic safety analysis. An explicit modeling of Category B actions could also potentially lead to important insights into human performance in terms of safety. However, there is no standard procedure to identify Category B actions. This paper describes a systematic procedure to identify Category B actions for low power and shutdown conditions. The procedure includes several steps to determine operator actions that may lead to initiating events in the low power and shutdown stages. These steps are the selection of initiating events, the selection of systems or components, the screening of unlikely operating actions, and the quantification of initiating events. The procedure also provides the detailed instruction for each step, such as operator's action, information required, screening rules, and the outputs. Finally, the applicability of the suggested approach is also investigated by application to a plant example.

• Nuclear Engineering and Technology
• /
• 제34권4호
• /
• pp.358-369
• /
• 2002

Abundant information about analyses of single steam generator tube rupture (SGTR) events is available because of its importance in terms of safety. However, there are few literatures available on analyses of multiple steam generator tube rupture (MSGTR) events. In addition, knowledge of transients and consequences following a MSGTR event are very limited as there has been no occurrence of MSGTR event in the commercial operation of nuclear reactors. In this study, a postulated MSGTR event in an APR1400 is analyzed using thermal-hydraulic system code MARSI.4. The present study aims to examine the effects of affected steam generator selection. The main steam safety valve (MSSV) lift time for four cases are compared in order to examine how long operator response time is allowed depending on which steam generate. (S/G) is affected. The comparison shows that the cases where two steam generators are simultaneously affected allow longer time for operator action compared with the cases where a single steam generator is affected. Furthermore, the tube ruptures in the steam generator where a pressurizer is connected leads to the shortest operator response time.

• 제어로봇시스템학회논문지
• /
• 제17권12호
• /
• pp.1210-1218
• /
• 2011

GA (Genetic Algorithms) are efficient for searching for global optima but may have some problems such as premature convergence, convergence to local extremum and divergence. These phenomena are related to the evolutionary operators. As population diversity converges to low value, the search ability of a GA decreases and premature convergence or converging to local extremum may occur but population diversity converges to high value, then genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we analyze the effects of the selection operator, crossover operator, and mutation operator on convergence properties, and propose the sweeping method of mutation probability and elitist propagation rate to maintain the diversity of the GA's population for getting out of the premature convergence. Results of simulation studies verify the feasibility of using these sweeping operators to avoid premature convergence and convergence to local extrema.

• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• pp.112-115
• /
• 2007

본 논문은 퍼지추론을 통해 개체의 유사성과 적합도의 종합적 평가를 이용한 유전알고리즘의 선태연산자를 제안한다. 단일 집단을 가상적으로 임의의 n 개의 개체군을 나누고, 개체의 적합도와 유사도에 기반한 퍼지추론을 통해, 효율적인 계층화를 구성하고자 한다. 동시에 점진형(steady-state) 진화방식과 결합시켜 계층화된 군집내에서 개체들이 조기에 수렴하는 현상을 방지해 줄 수 있도록 하고, 적은 개체를 이용하여 효율적인 진화가 가능하도록 구현하였다. 2가지 기만적 문제에 대해서 다른 선태 연산자들의 결과와 비교하였으며, 만족할만한 성능을 얻었다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 춘계학술대회 학술발표 논문집
• /
• pp.81-84
• /
• 1998

Genetic Algorithms (GAs) are stochastic algorithms whose search methods model some natural phenomena. The procedure of GAs may be divided into two sub-procedures : Operation and Selection. Chromosomes can produce new offspring by means of operation, and the fitter chromosomes can produce more offspring than the less fit ones by means of selection. However, operation which is executed randomly and has some limits to its execution can not guarantee to produce fitter chromosomes. Thus, we propose a method which gives a directional information to the genetic operator by reinforcement learning. It can be achived by using neural networks to apply reinforcement learning to the genetic operator. We use the amount of fitness change which can be considered as reinforcement signal to calcualte the error terms for the output units. Then the weights are updated using backpropagtion algorithm. The performance improvement of GAs using reinforcement learning can be measured by applying the pr posed method to GA-hard problem.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권5호
• /
• pp.283-289
• /
• 2003

This paper proposes an expert system which can determine automatically the shunting routes corresponding to the given shunting works by considering totally the train operating environments in the station. The expert system proposes the multiple shunting routes with priority of selection based on heuristic search strategy. Accordingly, system operator can select a shunting route with the safety and efficiency among the those shunting routes. The expert system consists of a main inference engine and a sub inference engine. The main inference engine determines the shunting routes with selection priority using the segment routes obtained from the sub inference engine. The heuristic rules are extracted from operating knowledges of the veteran route operator and station topology. It is implemented in C computer language for the purpose of the implementation of the inference engine using the dynamic memory allocation technique. And, the validity of the builted expert system is proved by a test case for the model station.

• Journal of Information Processing Systems
• /
• 제19권4호
• /
• pp.450-464
• /
• 2023

To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.

• Journal of applied mathematics & informatics
• /
• 제10권1_2호
• /
• pp.41-50
• /
• 2002

We provide local and semilocal theorems for the convergence of Newton-like methods to a locally unique solution of an equation in a Banach space. The analytic property of the operator involved replaces the usual domain condition for Newton-like methods. In the case of the local results we show that the radius of convergence can be enlarged. A numerical example is given to justify our claim . This observation is important and finds applications in steplength selection in predictor-corrector continuation procedures.