• 천문학회보
• /
• 제46권2호
• /
• pp.47.1-47.1
• /
• 2021

Transverse magnetohydrodynamic waves often called Alfvénic (or kink) waves have been often theoretically put forward to solve the outstanding problems of the solar corona like coronal heating, solar wind acceleration, and chemical abundance enhancement. Here we report the first spectroscopic detection of Alfvénic waves around a sunspot at chromospheric heights. By analyzing the spectra of the Hα line and Ca II 854.2 nm line, we determined line-of-sight velocity and temperature as functions of position and time. As a result, we identified transverse magnetohydrodynamic waves pervading the superpenumbral fibrils. These waves are characterized by the periods of 2.5 to 4.5 minutes, and the propagation direction parallel to the fibrils, the supersonic propagation speeds of 45 to 145 km s-1, and the close association with umbral oscillations and running penumbral waves in sunspots. Our results support the notion that the chromosphere around sunspots abounds with Alfvénic waves excited by the mode conversion of the upward-propagating slow magnetoacoustic waves.

• 한국직업건강간호학회지
• /
• 제14권1호
• /
• pp.56-70
• /
• 2005

Objectives: The purpose of this study is to develop a linking model between industrial injury insurance organs and local organizations providing social welfare health services, for the activation of medical rehabilitation services for industrial injury patients. Method: Research design for this study was a multi-step research through literature review, field research, and group interviews with persons in charge, to compare local society-oriented medical rehabilitation programs. The term of researches Sep.1 ~ Nov. 30, 2004. Results: 1. Home nurses from Workers Accident Medical Corporation have been taken to be adequate to case managers, who link industrial accident insurance institutions to local society services for the activation of medical rehabilitation services for industrial injury patients. They have been chosen for case managers because they have richer understanding and experiences of objects of industrial accidents than any other specialists, and because they have proved to be able to provide direct home services as a specialist. We have established the center for case management affairs within the workers accident general hospital, organized the committee for case management with doctors in charge, doctors in rehabilitation, rehabilitation consultants, social welfare workers, physical therapists, and nurses, determined objects of case managements from those of long-term recuperation, and constructed a course of case management containing from case management plans to evaluation. 2. We have made files of community resources, and organized the council of industrial accident administration to have it in charge of the adjustment and linking of services in case management affairs. 3. Because there are inequality of community resources between areas, differences in experiences in and bases for linking, and disparity of core organizations with active linking in the system of linking between public and civil sectors, we have taken a system of linking between parallel organs to be the core. In our linking model, workers accident general hospital, hospitals designated for industrial injury, and rehabilitation hospitals are linked in parallel, inadequate long-term recuperation managers are trusted to an workers accident medical corporations through examination by the examination committee in Korea Labor Welfare Corporation, and are dealt with by the committee for case management. Of the hospitals designated for industrial accidents, those running a home caring center provide home caring services for the handicapped at home from industrial injury. 4. Workers Accident Medical Corporation take part in medical rehabilitation, and Korea Labor Welfare Corporation in vocational/social rehabilitation. Furthermore, in the model, the latter should construct a system for job opportunities through Internet portals and provide cyber vocational consultation and introduction. Conclusion: Improvement of systems is needed to apply the linking model to practical affairs. Because this model is centered for practical affairs, it should be put under the analysis of effects, and evaluation of its adequacy to practical application, and its effects and efficiency through experimental running in the 8 workers accident general hospital in Korea.

• 정보과학회 컴퓨팅의 실제 논문지
• /
• 제23권5호
• /
• pp.299-303
• /
• 2017

딥 러닝(Deep learning)은 기존 인공 신경망 내 계층 수를 증가시킴과 동시에 효과적인 학습 방법론을 제시함으로써 객체/음성 인식 및 자연어 처리 등 고수준 문제 해결에 있어 괄목할만한 성과를 보이고 있다. 그러나 학습에 필요한 시간과 리소스가 크다는 한계를 지니고 있어, 이를 줄이기 위한 연구가 활발히 진행되고 있다. 본 연구에서는 아파치 스파크 기반 클러스터 컴퓨팅 프레임워크 상에서 딥 러닝을 분산화하는 두 가지 툴(DeepSpark, SparkNet)의 성능을 학습 정확도와 속도 측면에서 측정하고 분석하였다. CIFAR-10/CIFAR-100 데이터를 사용한 실험에서 SparkNet은 학습 과정의 정확도 변동 폭이 적은 반면 DeepSpark는 학습 초기 정확도는 변동 폭이 크지만 점차 변동 폭이 줄어들면서 SparkNet 대비 약 15% 높은 정확도를 보였고, 조건에 따라 단일 머신보다도 높은 정확도로 보다 빠르게 수렴하는 양상을 확인할 수 있었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5231-5248
• /
• 2016

As a service-oriented paradigm, web service composition has obtained great attention from both academia and industry, especially in the area of cloud service. Nowadays more and more web services providing the same function but different in QoS are available in cloud, so an important mission of service composition strategy is to select the optimal composition solution according to QoS. Furthermore, the selected composition solution should satisfy the service level agreement (SLA) which defines users' request for the performance of composite service, such as price and response time. A composite service is feasible only if its QoS satisfies user's request. In order to obtain composite service with the optimal QoS and avoid SLA violations simultaneously, in this paper we first propose a QoS evaluation method which takes the SLA satisfaction into account. Then we design a service selection algorithm based on our QoS evaluation method. At last, we put forward a parallel running strategy for the proposed selection algorithm. The simulation results show that our approach outperforms existing approaches in terms of solutions' optimality and feasibility. Through our running strategy, the computation time can be reduced to a large extent.

• 전자공학회논문지
• /
• 제50권5호
• /
• pp.102-111
• /
• 2013

본 연구에서는 4K UHD($3840{\times}2160$) 영상을 실시간 복호화하기 위한 $4{\times}4$ 블록 병렬 보간 H.264/AVC 움직임보상기를 제안한다. 연산처리 성능을 향상시키기 위해 보간 연산을 $4{\times}4$ 블록 단위로 병렬화시켰으며, 병렬 보간 연산에서 필요한 메모리 대역폭을 확장하기 위해 $9{\times}9$개의 메모리 어레이를 가진 2D 캐쉬 버퍼 구조를 설계하였다. 그리고 2D 캐쉬 버퍼는 검색영역 간 재사용 기법을 적용하여 참조화소의 중복저장을 최소화하였으며, $4{\times}4$ 블록 병렬 보간 필터는 3단(수평 수직 1/2부화소, 대각선 1/2부화소, 1/4부화소) 평면 보간 연산 파이프라인 구조로 설계하여 연산회로를 고속화시켰다. 0.13um 공정에서 시뮬레이션한 결과, 161K게이트의 H.264/AVC 움직임보상기는 동작주파수 150MHz에서 4K UHD급 동영상을 초당 72프레임으로 실시간 처리하는 성능을 보였다.

• 한국정보과학회논문지:시스템및이론
• /
• 제30권3_4호
• /
• pp.130-137
• /
• 2003

본 논문에서는 단단계(Single-Stage) Shuffle-Exchange 네트워크의 분할성에 대하여 연구하였다. SSEN_to_PSEN 알고리즘은 단단계 Shuffle-Exchange 네트워크를 분할 가능한 Shuffle-Exchange 네트워크로 변환하는 방법을 제안한다. 제안된 알고리즘은 네트워크의 크기가 N $\leq$ 8일 경우에는 추가적인 링크없이 네트워크가 분할성을 갖는 것을 보이며, 네트워크의 크기가 N $\geq$ 16일 경우에 단단계 Shuffle-Exchange 네트워크를 분할하기 위해서는 추가적인 링크가 필요하다. SSEN_to_PSEN 알고리즘의 시간 복잡도는 $\theta$(NlogN)이며, 하이퍼큐브 네트워크와 비교하여 분할 가능한 Shuffle-Exchange 네트워크는 적은 링크 수를 사용한다. 분할이 가능해짐에 따라서 대용량의 병렬컴퓨터에서 분할 가능한 Shuffle-Exchange 네트워크는 여러 사용자들을 위한 다양한 문제의 처리가 동시에 가능하기 때문에 컴퓨터의 처리 효율이 향상됨을 알 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권11호
• /
• pp.2827-2848
• /
• 2012

Previously, we described a social media cloud computing service environment (SMCCSE). This SMCCSE supports the development of social networking services (SNSs) that include audio, image, and video formats. A social media cloud computing PaaS platform, a core component in a SMCCSE, processes large amounts of social media in a parallel and distributed manner for supporting a reliable SNS. Here, we propose a Hadoop-based multimedia system for image and video transcoding processing, necessary functions of our PaaS platform. Our system consists of two modules, including an image transcoding module and a video transcoding module. We also design and implement the system by using a MapReduce framework running on a Hadoop Distributed File System (HDFS) and the media processing libraries Xuggler and JAI. In this way, our system exponentially reduces the encoding time for transcoding large amounts of image and video files into specific formats depending on user-requested options (such as resolution, bit rate, and frame rate). In order to evaluate system performance, we measure the total image and video transcoding time for image and video data sets, respectively, under various experimental conditions. In addition, we compare the video transcoding performance of our cloud-based approach with that of the traditional frame-level parallel processing-based approach. Based on experiments performed on a 28-node cluster, the proposed Hadoop-based multimedia transcoding system delivers excellent speed and quality.

• 지구물리와물리탐사
• /
• 제20권3호
• /
• pp.129-136
• /
• 2017

파형 역산 또는 역시간 구조 보정과 같은 3차원 탄성파 자료 처리를 위해서는 3차원 파동 전파 모델링과 그에 따른 대량의 수치 계산이 필요하다. 본 연구에서는 3차원 주파수 영역 파동 전파 모델링을 이용해 제온 파이 가속기와 서버용 고성능 CPU의 성능 및 정확성을 비교하였다. 시간 영역 유한 차분법 알고리즘에 제온 파이의 특징을 고려하여 OpenMP 병렬 프로그래밍을 적용하였다. 주파수 영역 파동장을 얻기 위해서는 시간 영역 모델링과 동시에 푸리에 변환을 수행하였다. 3차원 SEG/EAGE 암염돔 속도 모델을 사용하여 주파수 영역 파동장을 생성한 결과, 제온 파이를 이용해 정확한 주파수 영역 파동장을 CPU 대비 1.44배 빠르게 얻을 수 있었다.

• 한국통신학회논문지
• /
• 제34권11B호
• /
• pp.1254-1260
• /
• 2009

본 논문에서는 다수의 병렬 TCP flow들을 가진 소수의 스테이션들이 링크 대역폭을 독점하는 불공평성 문제 에 대해 randam early detection (RED)을 수정한 history-aware RED (HRED)를 제안한다. BitTorrent와 같은 peer-to-peer방식의 파일 공유 애플리케이션들은 파일 다운로드를 위해 다수의 병렬 TCP flow들을 이용한다. 만약 파일 공유 애플리케이션을 수행하는 스테이션들이 다른 스테이션들과 링크를 공유할 경우 대역폭을 독점하는 문제가 발생한다. 이 경우 개별 TCP flow들 간의 공평성 지원을 위해 개발된 RED를 적용하더라도 불공평성은 개선되지 않는다. 제안하는 HRED는 RED와 유사하게 도착하는 패킷들에 대해 확률적으로 drop여부를 결정하되, 스테이션의 링크 점유율에 따라 drop 확률을 조정할 수 있어, 대역폭을 독점하는 스테이션들의 패킷들에 drop 패널티를 부과할 수 있다. 여러 가지 상황을 가정한 시뮬레이션을 통해 HRED가 RED에 비해 스테이션 차원에서의 throughput 공평성 지원 측면에서 최소 60%이상, 전송 효율성 측면에서 4%이상 개선되었음을 확인하였다.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1994년도 추계학술발표회 및 정기총회
• /
• pp.32-32
• /
• 1994

In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.