During wartime, the operation of engineering equipment plays a pivotal role in bolstering the combat prowess of military units. To fully harness this combat potential, it is imperative to provide efficient support precisely when and where it is needed most. While previous research has predominantly focused on optimizing equipment combinations to expedite individual mission performance, our model considers routing challenges encompassing multiple missions and temporal constraints. We implement a comprehensive analysis of potential wartime missions and developed a routing model for the operation of engineering equipment that takes into account multiple missions and their respective time windows of required start and completion time. Our approach focused on two primary objectives: maximizing overall capability and minimizing mission duration, all while adhering to a diverse set of constraints, including mission requirements, equipment availability, geographical locations, and time constraints.

PURPOSES : This study is to analyze the reduction effect on road pavement damage from the installation of weigh-in-motion systems used for overloaded vehicle enforcement, from the perspective of traffic assignment. METHODS : Fixed-demand multi-class traffic assignment was conducted by VISUM, a macroscopic traffic simulation software. We considered three vehicle classes and calculated the traffic load for each road link using the ESAL(Equivalent Single Wheel Load) factor, as proposed by ASHTTO(American Association of State Highway and Transportation Officials). We set up scenarios with weigh-in-motion installations in certain sections and observed how the traffic load changed before and after the installation of weigh-in-motion for each scenario. RESULTS : Three main trends were observed. Firstly, at points where weigh-in-motion systems were installed, traffic load significantly decreased even with the influx of cars and trucks following the restriction of overloaded trucks, highlighting the significant influence of overweight vehicles on the traffic load. Secondly, even when overweight vehicles detoured, there was no significant change in the overall network's traffic load. Lastly, the detour of overweight vehicles led to an increase in the total driving distance and time for all vehicles. CONCLUSIONS : Installing weigh-in-motion systems in sections with a lower structure number, which indicates thinner road pavement, can prevent damage in those specific areas without affecting the entire road network.

During wartime, the operation of engineering equipment plays a pivotal role in bolstering the combat prowess of military units. To fully harness this combat potential, it is imperative to provide efficient support precisely when and where it is needed most. While previous research has predominantly focused on optimizing equipment combinations to expedite individual mission performance, our model considers routing challenges encompassing multiple missions and temporal constraints. We implement a comprehensive analysis of potential wartime missions and developed a routing model for the operation of engineering equipment that takes into account multiple missions and their respective time windows. Our approach centered on two primary objectives: maximizing overall capability and minimizing mission duration, all while adhering to a diverse set of constraints, including mission requirements, equipment availability, geographical locations, and time constraints.

North Korea continues to upgrade and display its long-range rocket launchers to emphasize its military strength. Recently Republic of Korea kicked off the development of anti-artillery interception system similar to Israel’s “Iron Dome”, designed to protect against North Korea’s arsenal of long-range rockets. The system may not work smoothly without the function assigning interceptors to incoming various-caliber artillery rockets. We view the assignment task as a dynamic weapon target assignment (DWTA) problem. DWTA is a multistage decision process in which decision in a stage affects decision processes and its results in the subsequent stages. We represent the DWTA problem as a Markov decision process (MDP). Distance from Seoul to North Korea’s multiple rocket launchers positioned near the border, limits the processing time of the model solver within only a few second. It is impossible to compute the exact optimal solution within the allowed time interval due to the curse of dimensionality inherently in MDP model of practical DWTA problem. We apply two reinforcement-based algorithms to get the approximate solution of the MDP model within the time limit. To check the quality of the approximate solution, we adopt Shoot-Shoot-Look(SSL) policy as a baseline. Simulation results showed that both algorithms provide better solution than the solution from the baseline strategy.

In weapon assignment studies to defend against threats such as ballistic missiles and long range artillery, threat assessment was partially lacking in analysis of various threat attributes, and considering the threat characteristics of warheads, which are difficult to judge in the early flight stages, it is very important to apply more reliable optimal solutions than approximate solution using LP model, Meta heuristics Genetic Algorithm, Tabu search and Particle swarm optimization etc. Our studies suggest Generic Rule based threat evaluation and weapon assignment algorithm in the basis of various attributes of threats. First job of studies analyzes information on Various attributes such as the type of target, Flight trajectory and flight time, range and intercept altitude of the intercept system, etc. Second job of studies propose Rule based threat evaluation and weapon assignment algorithm were applied to obtain a more reliable solution by reflection the importance of the interception system. It analyzes ballistic missiles and long-range artillery was assigned to multiple intercept system by real time threat assessment reflecting various threat information. The results of this study are provided reliable solution for Weapon Assignment problem as well as considered to be applicable to establishing a missile and long range artillery defense system.

PURPOSES : This study aims to develop an algorithm to solve the user equilibrium traffic assignment problem using soft link capacity constraints. This model is used to relax the hard capacity constraints model. METHODS : In the traffic assignment model that imposes the hard capacity constraints, the well-known solution algorithms used are the augmented Lagrange multiplier method and the inner penalty function method. The major drawback of using the hard-capacity constraint model is the feasible solution issue. If the capacities in the network are not sufficient to absorb the flow from the diverged flows through the hard capacity constraints, it might result in no solution; whereas, using a soft capacity constraint model guarantees a feasible solution because the soft capacity constraint model uses the penalization of constraint violation in the objective function. In this study, the gradient projection (GP) algorithm was adapted. RESULTS : Two numerical experiments were conducted to demonstrate the features of the soft capacity constraint model and the computational performance of the solution algorithm. The results revealed that imposing the soft link capacity constraints can ensure convergence. CONCLUSIONS : The proposed model can be easily extended by considering other traffic assignment models, for e.g., non-additive traffic equilibrium problem, stochastic traffic equilibrium model, and, elastic demand traffic equilibrium problem. Furthermore, the model can exist regardless of the sufficient capacity for each O-D pair to cater to their demands.

PURPOSES : This study verifies the stability and uniqueness of the traffic assignment algorithm. METHODS : The traffic assignment step of the four-phase traffic demand model is an important step in determining the traffic volume of the link in the process of distributing the O/D traffic volume on each link. In this step, primarily, a link-based algorithm based on user equilibrium has been used. The typical link-based algorithm, FWA, is known to provide uniqueness and stability, in theory, regarding traffic assignment results. However, recent studies have raised the controversy that, in reality, the FWA is less stable and unique depending on the termination criterion applied to the FWA in the traffic assignment step. Stability tests and proportionality tests were conducted for the application of algorithms to widely used commercial software (for example, EMME, CUBE, and TransCAD). RESULTS : According to this study, the uniqueness and stability of the FWA were not followed in the process of actual traffic assignment, unlike the theory. CONCLUSIONS : The traffic assignment model has essentially the same result when the optimum level is reached, irrespective of the program and traffic allocation techniques used. Therefore, efforts will be required to recognize limitations in practice and to produce stable results at an appropriate level when predicting traffic demand, traffic volume, benefits, and feasibility studies using a traffic allocation model.

다양한 학문기반의 토대가 되는 한문과의 중요성에 대한 논의는 이미 선행 연구들을 통해서 가치 실현이 되었다. 이러한 전제 속에 본고는 연구자 실제 강의했던 경험을 바탕으로 실제 한문과의 운영이 어떻게 존립하고 현상 유지되거나 위기에 처해 있는지 실증적으로 보여주고자 했다. 이를 종합하면 2019년도 강행된 강사법 시행령 문제와 관련하여 대학 내 현장적 운영 모습은 다음과 같이 정리될 수 있다. 첫째 현 시류에 영향을 받지 않은 것으로 판단되나 계속 그 추이를 주목해야 하는 경우, 둘째 시행령의 포섭되어 강좌 폐지로 즉결된 경우 두 가지 사례가 진단되었다. 이러한 사실의 목도는 기실 이 논의가 필요한 이유이자 배태한 연원과 관련 깊다. 이러한 전후 상황과 관련하여, 실제 학습자들의 요구 사항을 검토해 본 결과, 유념해야 할 사항을 정리하면 3가지 정도로 추릴 수 있다. 먼저, 대학 본부에서는 학생들의 의견 수렴 창구 토대를 긴밀히 구축할 필요가 있다. 둘째, 학과별 한문과가 연합하여 제각기 다른 가치 창출을 위한 밑거름 이 될 수 있도록 통합적 모색이 필요한데, 이때 다양한 채널이 필요하다. 마지막으로 비전공자를 위한 수강과목 그리고 전공생을 위해서는 난이도 평가 구별을 통해 소수로만 운영될 분반별 강좌가 시행될 수 있도록 하는 조처도 요구된다. 이 같은 필요점은 취업 혹은 실용과 직결되는 교과목이 아닌 여타 학문과나 교양과 전체로 확대될 수 있을 것이다.

This study aimed to investigate the effects of voice recording as a speaking assignment on Korean EFL nursing students’ speaking confidence and perceptions of speaking assignment. The participants of the study were 22 nursing students who took college English course and were divided into two groups. One was an experimental group performing voice recording assignment for speaking practice during 5 weeks and the other was a control group that did not receive treatment by the researcher. Speaking confidence questionnaire and in-depth interview were used to collect the data in this study. The result of this study showed that there was some statistically significant achievement of the participants’ speaking confidence after speaking assignment of voice recording performed by them. In addition, the participants had positive reaction to the experience of the assignment. This suggests that voice recording assignment encourages students to have their speaking confidence and helps them to overcome speaking difficulties in EFL environment.

We focus on the weapon target assignment and fire scheduling problem (WTAFSP) with the objective of minimizing the makespan, i.e., the latest completion time of a given set of firing operations. In this study, we assume that there are m available weapons to fire at n targets (> m). The artillery attack operation consists of two steps of sequential procedure : assignment of weapons to the targets; and scheduling firing operations against the targets that are assigned to each weapon. This problem is a combination of weapon target assignment problem (WTAP) and fire scheduling problem (FSP). To solve this problem, we define the problem with a mixed integer programming model. Then, we develop exact algorithms based on a dynamic programming technique. Also, we suggest how to find lower bounds and upper bounds to a given problem. To evaluate the performance of developed exact algorithms, computational experiments are performed on randomly generated problems. From the results, we can see suggested exact algorithm solves problems of a medium size within a reasonable amount of computation time. Also, the results show that the computation time required for suggested exact algorithm can be seen to increase rapidly as the problem size grows. We report the result with analysis and give directions for future research for this study. This study is meaningful in that it suggests an exact algorithm for a more realistic problem than existing researches. Also, this study can provide a basis for developing algorithms that can solve larger size problems.

이 논문은 불교무용의 선행연구를 분석하고 성과를 검토하여 불교무용연구의 바람직한 발전방향을 제시하고자 한다. 불교무용에 대한 연구는 1968년 홍윤식의 무형문화재조사보고서 제46호인식당작법을 시작으로 약 50여년 동안 지속되었다. 이 연구는 초기 민속학자ㆍ무용학자ㆍ국악학자들에 의한 현지조사로 광의적 시각에서 불교무용을 조사하였으나, 현재는 무용전공자, 불교학자 중심으로 협의적 시각에서 세부적으로 연구한다. 현재 불교무용의 연구업적은 201편으로, 보고서 3편, 박사학위논문 9편, 석사학위논문 72편, 학술지논문 41편, 단행본 41권 등이 있다. 이 중에서 대부분이 영산재(119편)에 대한 연구이며, 수륙재, 상주권공재, 예수재의 논문은 매우 소량이다. 이는 영산재가 1973년 국가무형문화재 제50호로 지정된 이후 세간에 널리 전승, 보급되었기 때문이다. 영산재 논문 119편중에서 작법무 56편, 나비춤 25편, 바라춤 23편, 식당작법 10편, 법고춤 5편으로 작법무에 대한 연구가 많은데, 이는 불교무용을 통합․융합적으로 보는 시각의 확장과 작법무를 무대공연화, 창작작품화, 교육프로그램개발 등 콘텐츠로 변모하려는 다양한 시도들이 있었기 때문이다. 또한 불교무용 연구의 약 35%가 무보를 수록하였는데, 무보의 형식은 그림무보, 사진무보, 문자무보 등 다양한 형식의 무보가 사용되었다. 불교무용의 선행연구를 바탕으로 미래의 바람직한 불교무용의 연구과제는 불교무용의 용어정리, 작법승 계보에 대한 체계적인 연구, 불교무용에 적합한 무보개발, 작법무를 바탕으로 한 프로그램개발, 불교무용 콘텐츠와 산업과의 연계성 등의 다양한 연구가 요구된다.

1750년, 신경준이 저술한 『훈민정음운해(訓民正音韻解)』에 따라 순음(脣音) ㅁ･ㅂ을 水, 후음(喉音) ㅇ･ㅎ을 土로 오행을 배속하는 법이 성명학에서 다수설(多數說)로 정착되었으나 1940년에 발견된, 훈민정음 원본인 『훈민정음해례(訓民正音解例)』는 순음 ㅁ･ㅂ을 土, 후음 ㅇ･ㅎ을 水로 배속하고 있다. 본 연구는 이로 인해 야기된 혼란을 해소하고자 국어학과의 융합연구를 통해 훈민정음의 자음오행 배속원리를 궁구한 후, 『훈민정음운해』의 오행 배속법이 갖는 음운학(音韻學)적인 역사와 배경을 살펴보았다. 그 결과, 우리말 음운과 중국 한자음운의 오행배속을 각각 달리 본 신숙주의 인식체계가 신경준으로 이어졌으며 『훈민정음운해』의 궁극적 저술 목표는 중국의 한자 음운체계와 소통(疏 通)하기 위한 ‘한자음운도(漢字音韻圖)’에 있었다는 점에 주목하였다. 따라서 우리말 음운을 우리글로 적으려고 한 한글 창제의 주된 취지, 음운(音韻)이 시대･환경에 따라 분별되는 성향, 순 한글과 한자의 발음이 동일한 현대의 음운적 특징에 의거하여 『훈민정음해례』의 오행 배속이 더 합당하다는 결론을 이끌었다. 또한 한글이 발음기관의 동작이나 모습을 상형(象形)한 문자이므로 한글 자형오행(字 形五行)을 도입하고 오행배속은 『훈민정음해례』에 준(準)할 것을 제안하였다.

An aircraft engine is supposed to be used for a specified lifespan, and it is reused through the depot maintenance for a major overhaul when its cumulative service life reaches the lifespan. However, the depot maintenance takes a long time due to the complexity of its process, and thus to continuously operate aircraft, spare engines are required to substitute engines under renovation. Considering the limited capacity of the depot, the uniformity of the quantity and cycle of engines entering the depot maintenance provides an opportunity to the decrease of the spare engines and the improvement of aircraft availability. It is the purpose of engine life management. Furthermore, in establishing flight plans, the time for essential maintenance activities, such as pre/post-flight inspection, servicing, the preparation for next flight, has to guarantee. Especially, fighters additionally require much time for installing weapons for their mission. That is, the rearming procedure can be left out if the adjoining missions are identical. Otherwise, the rearming time is varyingly spent depending on the types of adjacent duties. Therefore, this study proposes the mathematical model for an aircraft-mission assignment considering engine life management and maintenance schedule, and it is formulated based on the time-space network. Moreover, to verify and validate the model, an example was developed by applying realistic aircraft operating environment and simulation to perform air operations for several days was fulfilled. The experimental results presented flight plans corresponding to the purpose of this study, such as engine life management and the assurance of maintenance time.

Quantum-inspired Genetic Algorithm (QGA) is a probabilistic search optimization method combined quantum computation and genetic algorithm. In QGA, the chromosomes are encoded by qubits and are updated by quantum rotation gates, which can achieve a genetic search. Asset-based weapon target assignment (WTA) problem can be described as an optimization problem in which the defenders assign the weapons to hostile targets in order to maximize the value of a group of surviving assets threatened by the targets. It has already been proven that the WTA problem is NP-complete. In this study, we propose a QGA and a hybrid-QGA to solve an asset-based WTA problem. In the proposed QGA, a set of probabilistic superposition of qubits are coded and collapsed into a target number. Q-gate updating strategy is also used for search guidance. The hybrid-QGA is generated by incorporating both the random search capability of QGA and the evolution capability of genetic algorithm (GA). To observe the performance of each algorithm, we construct three synthetic WTA problems and check how each algorithm works on them. Simulation results show that all of the algorithm have good quality of solutions. Since the difference among mean resulting value is within 2%, we run the nonparametric pairwise Wilcoxon rank sum test for testing the equality of the means among the results. The Wilcoxon test reveals that GA has better quality than the others. In contrast, the simulation results indicate that hybrid-QGA and QGA is much faster than GA for the production of the same number of generations.

The application of the theoretical model to real assembly lines has been one of the biggest challenges for researchers and industrial engineers. There should be some realistic approach to achieve the conflicting objectives on real systems. Therefore, in this paper, a model is developed to synchronize a real system (A discrete event simulation model) with a theoretical model (An optimization model). This synchronization will enable the realistic optimization of systems. A job assignment model of the assembly line is formulated for the evaluation of proposed realistic optimization to achieve multiple conflicting objectives. The objectives, fluctuation in cycle time, throughput, labor cost, energy cost, teamwork and deviation in the skill level of operators have been modeled mathematically. To solve the formulated mathematical model, a multi-objective simulation integrated hybrid genetic algorithm (MO-SHGA) is proposed. In MO-SHGA each individual in each population acts as an input scenario of simulation. Also, it is very difficult to assign weights to the objective function in the traditional multi-objective GA because of pareto fronts. Therefore, we have proposed a probabilistic based linearization and multi-objective to single objective conversion method at population evolution phase. The performance of MO-SHGA is evaluated with the standard multi-objective genetic algorithm (MO-GA) with both deterministic and stochastic data settings. A case study of the goalkeeping gloves assembly line is also presented as a numerical example which is solved using MO-SHGA and MO-GA. The proposed research is useful for the development of synchronized human based assembly lines for real time monitoring, optimization, and control.

The application of the theoretical model to real assembly lines has been one of the biggest challenges for researchers and industrial engineers. There should be some realistic approach to achieve the conflicting objectives on real systems. Therefore, in this paper, a model is developed to synchronize a real system (A simulation model) with a theoretical model (An optimization model). This synchronization will enable the realistic optimization of systems. A job assignment model of the assembly line is formulated for the evaluation of proposed realistic optimization with multiple objectives. The objectives, fluctuation in cycle time, throughput, labor cost, energy cost, teamwork and deviation in the skill level of operators have been modeled mathematically. To solve the formulated mathematical model, a multi-objective simulation integrated hybrid genetic algorithm (MO-SHGA) is proposed. The performance of MO-SHGA is evaluated with the standard multi-objective genetic algorithm (MO-GA) with both deterministic and stochastic data settings. A case study of the goalkeeping gloves assembly line is also presented as a numerical example which is solved using MO-SHGA and MO-GA.