본 연구는 장애인의 행복증진을 위해 필요한 정책과 실천방안 마련에 필요한 시사점을 찾고자 임금근로 장애인의 긍정적 대인관계와 행복감의 관계에서 자기효능감과 직무만족의 매개효과를 살펴보았다. 이를 위 해 앨더퍼(Alderfer)의 ERG이론 및 행복연구에 관한 선행연구를 토대로 변수 간 관련성을 연구모형으로 구축하여 구조방정식 모형을 통해 분석하였다. 분석자료는 한국장애인고용공단 산하 장애인고용개발원의 <2022년 장애인고용패널조사> 2차 웨이브조사 7차년도 자료를 활용하였다. 분석결과, 임금근로장애인의 고연령, 저학력, 신체외부장애 집단에서 행복감이 낮게 나타났다. 또한 긍정적 대인관계와 행복감의 관계에 서 자기효능감과 직무만족은 매개효과를 나타냈다. 이러한 결과는 한국 사회에 만연한 차별적 요소를 제거 할 수 있는 제도적 장치가 마련되어야 한다는 점과 장애인의 긍정적 대인관계 형성에 도움이 될 수 있는 다양한 차원의 실천적 개입이 필요하다는 점을 시사한다.

This paper proposes an algorithm for the Unrelated Parallel Machine Scheduling Problem(UPMSP) without setup times, aiming to minimize total tardiness. As an NP-hard problem, the UPMSP is hard to get an optimal solution. Consequently, practical scenarios are solved by relying on operator's experiences or simple heuristic approaches. The proposed algorithm has adapted two methods: a policy network method, based on Transformer to compute the correlation between individual jobs and machines, and another method to train the network with a reinforcement learning algorithm based on the REINFORCE with Baseline algorithm. The proposed algorithm was evaluated on randomly generated problems and the results were compared with those obtained using CPLEX, as well as three scheduling algorithms. This paper confirms that the proposed algorithm outperforms the comparison algorithms, as evidenced by the test results.

Massively Multiplayer Online Role-Playing Game(MMORPG) attract thousand of concurrent users, leading to a surge in server requests. The massive requests results in contention on the game server, causing unexpected latency issues that undermine user experience. Delayed latency leads to user dissatisfaction and, ultimately, user churn. In this paper, we propose a multi-threaded game server design that provides stable response time by utilizing computing resources. And we study the performance of the design under various environments by configuring the approaches we implemented. The server consists of a socket system that helps communicate between clients and servers, a task system that handles changes in the status of user, and a synchronization system that allows users to receive the same game information. To prevent serious contention, both lock and lock-free algorithms for process synchronization are applied, and some parallel programming approaches such as visual processing are introduced.

복부 MRI 검사에서 높은 수준의 병렬기법을 적용 시 영상의 질을 떨어뜨리는 둘러겹침인공물을 빈번히 생성한다. 이것 은 구조물이 겹쳐서 나타나는 현상으로 복부 인체 구조상 양쪽 팔이 맞닿아 있어서 FOV를 벗어난 양쪽 팔이 영상의 반대 방향 인공물을 발생하는 문제를 초래한다. 이러한 제한점으로 복부 MRI 검사에서는 두경부 및 근골격 검사 부위와 비교하 여 낮은 수준의 병렬기법을 적용하여 검사 시간을 증가시키는 문제가 있다. 이에 본 연구에서는 팔을 위로 올리는 자세를 활용하여 환자의 간단한 자세의 변화를 통하여 병렬기법을 극대화하여 검사 시간을 최소화하면서 영상의 인공물을 제거하 는 데 목적을 두었다. T2, T1 강조 영상을 관상면으로 획득하였다. 연구의 재현성을 높이기 위하여 작은 팬텀을 나란히 놓고(팔 내리는 자세), 한번은 작은 팬텀을 제거하고 영상을 (팔 올리는 자세) 각각 병렬기법인 SENSE 가속인자를 1.0, 1.5, 2.0, 2.5, 3.0, 3.5, 4.0까지 10번씩 획득한 후 영상의 불균일도를 측정하였다. 팬텀으로 확인하기 어려운 인체 부위 의 영상을 확인하기 위하여 정상인 자원자 1명을 대상으로 팬텀 연구와 같은 매개변수 조건으로 영상을 획득하였다. SENSE 가속인자가 높아질수록 팔을 올리는 자세에서 영상의 불균일도가 낮게 측정이 되었고 통계학적으로 유의하게 나타 났다. 본 연구는 간단한 자세 변화만으로 병렬기법을 극대화하며 영상획득 시간 단축 및 인공물을 개선방안을 제시하는 데 의의가 있다.

This paper is proposing a novel machine scheduling model for the unrelated parallel machine scheduling problem without setup times to minimize the total completion time, also known as “makespan”. This problem is a NP-complete problem, and to date, most approaches for real-life situations are based on the operator’s experience or simple heuristics. The new model based on the Memetic Algorithm, which was proposed by P. Moscato in 1989, is a hybrid algorithm that includes genetic algorithm and local search optimization. The new model is tested on randomly generated datasets, and is compared to optimal solution, and four scheduling models; three rule-based heuristic algorithms, and a genetic algorithm based scheduling model from literature; the test results show that the new model performed better than scheduling models from literature.

James S. Gale (1863-1937), a Protestant missionary to Korea (1888~1927), was well-known for his extensive and profound influence on Korean studies and for his translation of the Cloud Dream of Nine (九雲夢), which was the first Korean classical novel translated into English by a Westerner. However, it is not well-known that Gale published a translation of the Great Learning (Daxue, 1924) and arranged for the publication of the Mean of the Doctrine, the Analects and Mencius. This is because it was known that Gale regarded Chinese characters and Confucian scriptures as obstacles to establishing the Christianity during his early period of mission in Korea. This paper examined the change of Gale’s perspective of Chinese characters and the characteristics of Gale’s Daxue. The analysis compares Gale and James Legg in their translations of the Chinese characters ‘命,’ ‘天,’ ‘明’ and ‘君子’ He employed the pure Korean word ‘Hananim’ for ‘God’ from a traditional Korean religion and its Korean etymology, while he rejected the use of Sino-Korean ‘Sangje上帝’, or ‘Chunju天主’ in the Korean Bible. Gale subsequently translated Daxue from a Korean point of view. However, his Korean perspective is mingled with Christianized concepts, which are illustrated in his translation of ‘命’ as ‘God’s command’ ‘天’ as ‘God’ ‘明’ as ‘glory,’ and ‘君子’ as ‘good man’ and ‘godly man.’

Domain decomposition method (DDM) has been widely employed for the numerical analysis of large-scale problems due to its applicability to parallel computing. DDM divides the modeling domain into a set of subdomains and obtains the entire solution iteratively until the values of each subdomain which are shared with other subdomains, such as boundary values, are converged. Therefore, in general, DDM is a memory-efficient iterative algorithm with inherent parallelism on the geometric level. APro, the process-based total system performance assessment model, aims for simulating the radionuclide transport considering coupled multi-physics phenomena occurring in large-scale geological disposal system, which are inevitably accompanied by huge memory burden. Therefore, DDM is applicable for the large-scale problem of APro and its performance in parallel computing needs to be examined. The DDM solvers provided by COMSOL which constitute APro can be classified into two methods. One is the overlapping Schwarz method that each subdomain overlaps its neighboring domains and the other is the Schur complement method that subdomains are non-overlapping and separated by boundary domains. For the Schwarz method, the additive, hybrid, multiplicative and symmetric methods can be selected according to the solution update scheme. And for the Schur method, the additive and multiplicative ordering options can be chosen for solving Schur complement system. In this study, the calculation efficiency of the DDM solvers in COMSOL and the applicability to the cluster environment were examined. In aspect of efficiency, the memory requirements with different number of subdomains and calculation schemes were compared in a single node. Then, the memory requirements with increasing number of disposal tunnels and deposition holes were investigated in multiple nodes. As a result, on the cluster environment, with the help of distributed memory architecture which enables efficient memory usage, the applicability of DDM solvers to the large-scale problem of APro was confirmed.

APro, developed by KAERI as a process-based total system performance assessment model, can simulate the radionuclide transport affected by thermal, hydraulic, mechanical and geochemical changes that may occurs in the engineering and natural barriers of a geological disposal system. APro targets a large-scale and heterogeneous 3D system that includes more than 10,000 boreholes located about 500 m underground and hundreds of fractures of different sizes distributed within an area of several km2. Simulating transport and reaction phenomena for such a system through the global implicit approach (GIA) may require considerable computational resources or be intractable in some cases. Therefore, APro adopts the sequential non-iterative approach (SNIA), one of the operator splitting (OS) methods, to separate the mass transport and reaction phenomena into independent problems. By using SNIA, the parallel computation performance in APro with multiple cores is expected to be improved. In this study, the effect of SNIA on the parallel computation performance was analyzed through a simple 1D reactive transport problem. Without SNIA, finite difference equations, discretized from the partial differential equations (PDEs) describing the reactive transport problem, have to be solved at once because all dependent variables are nonlinearly and spatially interconnected through reaction and mass transport terms. When the reaction and mass transport terms are separated through SNIA, the mass transport problem can be converted into independent linear equations for each chemical and the efficient linear system solver can be applied to each linear equation. In particular, since the reaction problem is changed to independent nonlinear equations for each node, the parallel computation performance can be greatly improved. To verify this, the 1D reactive transport problem was implemented in MATLAB, and SNIA and GIA were applied to solve the problem. As a result, there was no significant difference in results between SNIA and GIA for proper spatial and temporal discretization, which verified the accuracy of SNIA. In order to see the parallel computation performance, the calculation times for SNIA and GIA with increasing number of cores were measured and compared. As the number of cores increased, the SNIA calculation speed became faster than that of GIA, which verified that SNIA could improve parallel computation performance in APro. In the future, the effect of SNIA on the parallel computation performance will be verified for the numerical analysis of large-scale geological disposal systems.

I investigated the homogeneous liquid crystal alignment using parallel patterning on nickel oxide thin film. Nickel oxide thin film was prepared by sol-gel process, which is and cost effective method to form oxide thin film. Since the sol-gel process is solution driven method, the patterning on nickel oxide can be achieved by imprinting lithography. Nickel oxide with parallel pattern was used for liquid crystal alignment layer, which can be a alternative to conventional rubbing process to aligning a liquid crystal molecules. As a result, a high transmittance of 83.9% was confirmed for the NiO film, and a stable horizontal orientation pretilt angle of 0.2° occurred in the imprinted NiO film. These results were judged to be a positive level that can be commercialized in the horizontal alignment type liquid crystal display that is currently used universally. Anisotropic characteristics of nickel oxide induced by a parallel pattern leads to the alignment of liquid crystals.

인공지능은 다양한 분야에서 사람을 대신하여 성과를 보여준다. 게임 분야에서도 인공지능은 다양한 방면으로 사용된다. NPC(Non Player Character) 제작, 게임 난이도, 콘텐츠 생성 등의 분야에서 활용되고 있다. 그러나 게임에서 사용되는 인공지능은 우수한 성과를 보여주며 사람을 이기기 위해 연구된다. 우수한 인공지능 모델이 게임에 존재하여 게임의 난이도가 상승하게 되면 플레이어가 게임에 흥미를 잃는 경우도 있다. 따라서 본 논문의 목적은 사람과의 대결이 아닌 사람을 서포트 하는 인공지능의 개발이다. 현재 모바일 시장의 게임에는 자동 사냥 시스템이 존재한다. 게임에서 이 시스템은 난수 방식을 사용하기 때문에 효율이 떨어진다. 그러므로 본 논문에서는 병렬구조의 DNN 모델을 사용하여 효율적인 자동 사냥 시스템을 구축한다. 새로 구축한 모델과 기존에 사용하던 난수 방식의 모델을 게임을 통해 비교한다.

The current scale of the import trade of the US with China is significant and has the potential to be more in near future. However, patent-based disputes, especially in terms of Section 337 investigation, have also been increased in recent years. In the context of parallel development of national innovation strategies of China’s “Made in China 2025 Plan” and the American “Advanced Manufacturing Partnership,” along with the latest expanded “Information Technology Agreement” in the WTO trading system, the implications for optimally resolving patent-based disputes in the US import trade with China is highly significant for two countries. These disputes may even impact the world trade, since bilateral trade between China and the US accounts for a considerable proportion. Thus, both China and the US should take precautions and appropriate measures to guard against such potential frictions in order to attain mutually beneficial outcomes in resolving such disputes.

This paper suggests a visual debugging plaftorm based on the game engine, Unity3D for massive parallel processing routines implemented in CUDA. In general, it is tiresome to debug or check the accuracy of numerical geometry information results calculated in a parallel way by GPU; usually, developers would pick and check each numerical value by rummaging overwhelming lines of seemingly meaningless numbers. This manual process is less productive and time-consuming. Also, it is not easy to produce some continuous movements of geometry information to check the validity of implemented CUDA codes for realtime geometry processing applications. To solve those problems, this paper presents a way to use Unity3D game engine to visually and interactively debug CUDA implementations. Also, some practical test results are presented with discussions on limitations of Unity3D as a CUDA debugging platform.

The computing environment has changed rapidly to enable large-scale finite element models to be analyzed at the PC or workstation level, such as multi-core CPU, optimal math kernel library implementing BLAS and LAPACK, and popularization of direct sparse solvers. In this paper, the design considerations on a parallel finite element code for shared memory based multi-core CPU system are proposed; (1) the use of optimized numerical libraries, (2) the use of latest direct sparse solvers, (3) parallelism using OpenMP for computing element stiffness matrices, and (4) assembly techniques using triplets, which is a type of sparse matrix storage. In addition, the parallelization effect is examined on the time-consuming works through a large scale finite element model.