• Nuclear Engineering and Technology
• /
• 제56권1호
• /
• pp.92-99
• /
• 2024

To minimize the cumulative radiation dose, various path-finding approaches for single agent have been proposed. However, for emergence situations such as nuclear power plant accident, these methods cannot be effectively utilized for evacuating a large number of workers because no multi-agent method is valid to conduct the mission. In this study, a novel algorithm for solving the multi-agent path-finding problem is proposed using the conflict-based search approach and the objective function redefined in terms of the cumulative radiation dose. The proposed method can find multi paths that all agents arrive at the destinations with reducing the overall radiation dose. To verify the proposed method, three problems were defined. In the single-agent problem, the objective function proposed in this study reduces the cumulative dose by 82% compared with that of the shortest distance algorithm in experiment environment of this study. It was also verified in the two multi-agent problems that multi paths with minimized the overall radiation dose, in which all agents can reach the destination without collision, can be found. The method proposed in this study will contribute to establishing evacuation plans for improving the safety of workers in radiation-related facilities.

• 품질경영학회지
• /
• 제44권4호
• /
• pp.845-853
• /
• 2016

Purpose: This research is to find the general and somewhat prevailing problems in quality circle papers. Many quality circles try to benchmark awarded papers even though they may have common problems. By pointing out popular problems in papers, many quality circles hopefully could be guided to the right direction in working out improvement actions. Methods: Many papers awarded in national quality circle conferences are deeply analyzed to figure out common problems. 69 recent papers are analyzed step by step and the most important and frequently occurring problems in each step are indicated. Results: Many prevailing problems are found in each step of QC stories. Especially finding themes, Grasping status quo, Cause analysis, Setting targets, Development of and Implementing counter attacks are the most common areas that have problems. Conclusion: Some problems are already too popular to be recognized as problems. In this paper those problems are logically criticized and thereby right directions for future quality circle activities are proposed.

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1179-1191
• /
• 2011

In this paper, we introduce a new iterative scheme for finding a common element of the set of fixed points of a finite family of strict pseudocontractions and the solution set of pseudomonotone and Lipschitz-type continuous equilibrium problems. The scheme is based on the idea of extragradient methods and fixed point iteration methods. We show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

• Journal of applied mathematics & informatics
• /
• 제27권1_2호
• /
• pp.161-173
• /
• 2009

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of the variational inequality for an inverse-strongly monotone mapping and the set of solutions of an equilibrium problem in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the three sets. The results of this paper extend and improve the corresponding results announced by many others.

• Journal of applied mathematics & informatics
• /
• 제7권3호
• /
• pp.1045-1058
• /
• 2000

In usual synchronous parallel computing, workload balance is a crucial factor to reduce idle times of some processors that have finished their jobs earlier than others. However, it is difficult to achieve on a heterogeneous workstation clusters where the available computing power of each processor is unpredictable. As a way to overcome such a problem, the idea of asynchronous methods has grown out and is being increasingly used and studied, but there is none for eigenvalue problems yet. In this paper, we suggest a new asynchronous method to solve some singular matrix problems, that can also be used for finding a certain eigenvector of some matrices.

• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1263-1275
• /
• 2010

In this paper, we introduce a new iterative scheme for finding a common element of the set of common fixed points of infinite family of nonexpansive mappings and the set of solutions to a generalized equilibrium problem and the set of solutions to a variational inequality problem in a real Hilbert space. Then strong convergence of the scheme to a common element of the three sets is proved. As applications, three new strong convergence theorems are obtained. Our theorems extend important recent results.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.42.2-42
• /
• 2002

We discuss a neural network solver for the inverse optimization problem. The problem is that find functional relations between input and output data, which are include defects. Finding the relations, predictions of the defect parts are also required. The part of finding the defects in the input data is an inverse problem . We consider the meanings to solve the problem on the neural network system at first. Next, we consider the network structure of the system, the learning scheme of the network, and at last, examine the precision on the numerical calculations. In the paper, we proposed the high-precision learning method for plural three-layer neural network system that is series-connect...

• 경영과학
• /
• 제4권
• /
• pp.76-83
• /
• 1987

The machine-part group formation(MPGF) problem arises frequently in FMS planning. By viewing the problem as one of finding good assignments, a powerful solution algorithm is presented. The new algorithm solves the threshold dilemma found in previous solution procedures employing similarity coefficients. It also compared favorably with other existing MPGF algorithms by finding minimum exceptional elements for the tested problems. Furthermore the new algorithm can solve dynamic and more realistic MPGF problems by considering production volumes or costs. Such diverse machine-part relationship values were not considered in previous MPGF studies, which included only 0,1 incidence values. An example problem is solved where production volumes are the elements of MPGF incidence matrix.

• 인지과학
• /
• 제1권1호
• /
• pp.103-127
• /
• 1989

예를 이용하여 학습하는 방법은 ALEX,LP,LEX 에 이르기까지 각각 특유의 방법을 가지면서 발전해 왔다.특히 Silver 의 LP 시스템은 방정식(Symbolic Equation)을 푸는데 있어, 과거에 풀었던 예로부터 이에 적용된 일련의 연산자들을 이용하는 방법으로 구축되어 있다. 본논문에서는 기존의 학습시스템 LEX,LP를 보다 일반화시킨 새로운 학습시스템 LRD를 제안한다. LRD에서는 연구된 예에서의 연산자 활용을 이와 유사한 모든 문제에까지 적용시킬 수 있도록 하기위하여 일반화 과정과 세분화 과정을 설정하여 학습하는 방법을 제시한다.초월함수의 치역을 구하는 예를 통하여 LRD의 학습기법을 설명하고,기존의 LEX및 LP시스템 에서 다루어지는 문제들을 통해 LEX및 LP시스템과 LRD 시스템이 비교 되어진다.

• 한국조리학회지
• /
• 제5권2호
• /
• pp.237-257
• /
• 1999

Food ＆ beverage part of nowadays hotel is steadily going up with the improvement of tourism industry and with the raise of income of the people, but some of the hotel kitchen has unchanged problem of low commercial profit and can't make improvement, so there are many kitchen problems. Especially, for the administrators of the hotels are avoiding from Korean kitchen with their cause that it makes lower profit than the other kitchen style. So, they are avoiding Korean kitchen itself, or showing minimized running. But, Korean kitchen should take off from its ways of being an assistant role or necessary evil as the part of income, by finding ways to make appropriate profit and ways to fulfill the variant desires of guests by running systematized and reasonable menu and Food cost control. This study is to suggest efficient management ways for the raise of profit and satisfaction of the guests by finding ways by analyzing the present situation of the menu and Food cost control of Korean kitchen by understanding these problems.