• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.5
• /
• pp.213-217
• /
• 2001

Excessive memory buffer requirement in continuous media playback is a serious impediment of wide spread usage of on-line multimedia service. Skewed access frequency of available video files provides an opportunity of re-using the date blocks which has been loaded by one session for later usage. We present novel algorithm which minimizes the buffer requirement in multiple sessions of multimedia playbacks. In continuous media playback originated from the disk, a certain amount of memory buffer is required to synchronize asynchronous disk. Read operation and synchronous playback operation. As aggregate playback bandwodth increases, larger amount of buffer needs to be allocated for this synchronization purpose. The focus of this work is to study the asymptotic behavior of the synchronization buffer requirement and to develop an algorithm coping with this excessive buffer requirement under bandwidth congestioon. We argue that in a large scale continuous media server, it may not be necessary to read the blocks for each session directly from the disk. The beauty of our work lies in the fact that it dynamically adapts to disk utilization of the server and finds the optimal way of servicinh the individual sessions while minimizing the overall buffer space requirement. Optimality of the proposed algorithm is shown by proof. The effectiveness and performance of the proposed scheme is examined via simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.71-85
• /
• 2006

The environment of computational grid is composed of the LAN/WAN each of which has different efficiency and heterogeneous network conditions, and where various programs are running. In this environment, the role of the resource selection broker is very important because the work of each node is performed by considering heterogeneous network environment and the computing power of each node according to the characteristics of a program. In this paper, a new resource selection broker is presented that decides the number of work processes to be allocated at each node by considering network state information and the performance of each node according to the characteristics of a program in the environment of computational grid. The proposed resource selection broker has three steps as follows. First, the performance ratio of each node is computed using latency-bandwidth-cpu mixture information reflecting the characteristics of a program, and the number of work processes that will be performed at each node are decided by this ratio. Second, RSL file is automatically made based on the number of work processes decided at the previous step. Finally, each node creates work processes by using that RSL file and performs the work which has been allocated to itself. As experimental results, the proposed method reflecting characteristics of a program, compared with the existing (uniformity) and latency-bandwidth method is improved $278%\sim316%,\;524%\sim595%,\;924%\sim954%$ in the point of work amount, work process number, and node number respectively.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2017.04a
• /
• pp.161-161
• /
• 2017

스마트 시설환경의 제어 요소는 난방기, 창 개폐, 수분/양액 밸브 개폐, 환풍기, 제습기 등 직접적으로 시설환경의 조절에 관여하는 인자와 정보 교환을 위한 통신, 사용자 인터페이스 등 간접적으로 제어에 관련된 요소들이 복합적으로 존재한다. PID 제어와 같이 하는 수학적 논리를 바탕으로 한 제어와 전문 관리자의 지식을 기반으로 한 비선형 학습 모델에 의한 제어 등이 공존할 수 있다. 이러한 다양한 요소들을 복합적으로 연동시키기 위해선 기존의 시퀀스 기반 제어 방식에는 한계가 있을 수 있다. 관행의 방식과 같이 시계열 상에서 획득한 충분한 데이터를 이용하여 제어의 양과 시점을 결정하는 방식은 예외 상황에 충분히 대처하기 어려운 단점이 있을 수 있다. 이러한 예외 상황은 자연적인 조건의 변화에 따라 불가피하게 발생하는 경우와 시스템의 오류에 기인하는 경우로 나뉠 수 있다. 본 연구에서는 실시간으로 변하는 시설환경 내의 다양한 환경요소를 실시간으로 분석하고 상응하는 제어를 수행하여 수학적이며 예측 가능한 논리에 의해 준비된 제어시스템을 보완할 방법을 연구하였다. 과거의 고성능 컴퓨팅(HPC; High Performance Computing)은 다수의 컴퓨터를 고속 네트워크로 연동하여 집적적으로 연산능력을 향상시킨 기술로 비용과 규모의 측면에서 많은 투자를 필요로 하는 첨단 고급 기술이었다. 핸드폰과 모바일 장비의 발달로 인해 소형 마이크로프로세서가 발달하여 근래 2 Ghz의 클럭 속도에 이르는 어플리케이션 프로세서(AP: Application Processor)가 등장하기도 하였다. 상대적으로 낮은 성능에도 불구하고 저전력 소모와 플랫폼의 소형화를 장점으로 한 AP를 시설환경의 실시간 제어에 응용하기 위한 방안을 연구하였다. CPU의 클럭, 메모리의 양, 코어의 수량을 다음과 같이 달리한 3가지 시스템을 비교하여 AP를 이용한 마이크로 클러스터링 기술의 성능을 비교하였다.1) 1.5 Ghz, 8 Processors, 32 Cores, 1GByte/Processor, 32Bit Linux(ARMv71). 2) 2.0 Ghz, 4 Processors, 32 Cores, 2GByte/Processor, 32Bit Linux(ARMv71). 3) 1.5 Ghz, 8 Processors, 32 Cores, 2GByte/Processor, 64Bit Linux(Arch64). 병렬 컴퓨팅을 위한 개발 라이브러리로 MPICH(www.mpich.org)와 Open-MP(www.openmp.org)를 이용하였다. 2,500,000,000에 이르는 정수 중 소수를 구하는 연산에 소요된 시간은 1)17초, 2)13초, 3)3초 이었으며, $12800{\times}12800$ 크기의 행렬에 대한 2차원 FFT 연산 소요시간은 각각 1)10초, 2)8초, 3)2초 이었다. 3번 경우는 클럭속도가 3Gh에 이르는 상용 데스크탑의 연산 속도보다 빠르다고 평가할 수 있다. 라이브러리의 따른 결과는 근사적으로 동일하였다. 선행 연구에서 획득한 3차원 계측 데이터를 1초 단위로 3차원 선형 보간법을 수행한 경우 코어의 수를 4개 이하로 한 경우 근소한 차이로 동일한 결과를 보였으나, 코어의 수를 8개 이상으로 한 경우 앞선 결과와 유사한 경향을 보였다. 현장 보급 가능성, 구축비용 및 전력 소모 등을 종합적으로 고려한 AP 활용 마이크로 클러스터링 기술을 지속적으로 연구할 것이다.

• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.1
• /
• pp.51-62
• /
• 2002

EMI/EMS 측정을 위해서는 주변 전자파 잡음(background noise)이 낮은 야외시험장(Open Area Test Site)이 가장 바람직하나, 근래 전자(전기 기기 사용의 증가와 방송.무선통신 시스템의 다양화로 인한 인공잡음(artificial noise)의 증대로 조건에 부합된 부지 선정이 어렵고, 설치 비용이 매우 크며 날씨 변화에 따라 시험 계획이 변경 될 수도 있는 단점이 있다. 전자파 분-무반사실(Semi Anechoic Chamber)은 대부분의 환경 잡음을 감쇠시키므로 야외시험장처럼 장소의 구애를 받지 않아 도시나 혹은 제품 생산지 가까이에 설치 운용이 가능하다. 그러나 큰 설치 공간과 많은 시설 유지 비용을 필요로 하며, 저주파 대역에서는 반사에 의한 공진을 완전히 제거할 수 없어 성능이 떨어진다. 또한, 최근 컴퓨터 CPU의 동작주파수가 급속하게 높아지고 PCS, IMT-2000 등과 같은 이동전화의 사용주파수도 계속해서 높아짐에 다라 미연방통신위원회(Federal Communication Commission)에서는 5㎓까지의 복사 방출 시험을 요구하고 있다. IEC 61000-4-3 복사 내성 시험규격도 휴대폰 주파수인 2㎓까지 확장되었으며 IMT-2000, Bluetooth 등 새로운 이동통신서비스가 속속 개발됨에 따라 18㎓ 까지 시험 주파수가 확장되는 추세이다. 그러나, 현재 국내 각 연구실에서 보유하고 있는 야외시험장이나 전자파 반-무반사실의 경우 1㎓이상에서의 시험이 곤란하여 수 ㎓주파수대역에서 시험이 가능한 복사 및 내성시험 시설이 필요하게 되었다. 이러한 문제점들을 해결하기 위해 고안된 대용 측정 시설 중 대표적인 것이 TEM 셀이나 GTEM셀과 같은 TEM 도파관(waveguide) 형태의 장비들이다. 이들은 본래 EMS 측정을 위한 장비이지만 협소한 공간이나 외부와의 전자파 간섭의 우려가 없고, 설치가 비교적 자유로워 여러 연구기관에서 도파관 원리를 이용한 측정 방식을 연구(개발하여 범용적인 전자파 적합성 측정 장비로서 활용하고 있다. 야외시험장과 무반사실 등이 안테나에 의한 피시험기기 주변 공간에서의 1점 측정으로 인해 시험 시간이 많아 소요되는 공통적인 단점이 있는 반면, TEM 도파관에 의한 측정은 일단 피시험기기의 모델링 정보만 얻어지면 계산에 의해 EMI 측정을 바로 할 수 있다. <표 1>에서 현재 상용화되어 사용되고 있는 TEM/GTEM 셀, 야외 시험장 및 전자파 무반사실에 대해 EMI 측정과 관련된 몇 가지 사안에 대해 비교하였다. 본 문서에서는 야외시험장이나 전자파 반-무반사실 등과 같은 기존 EMI/EMS 측정 시설의 단점을 보완하고, 광대역 특성을 갖는 대용 측정 시설로서의 TEM 도파관에 대해 소개하고 야외시험장 결과와의 상관관계 알고리즘 및 표준화 동향에 대해 기술하였다. 2절에서는 대표적인 TEM 도파관 구조의 측정 시설인 TEM 셀과 GTEM 셀의 전기적.구조적 특징에 대해 간단히 기술하고, 3절에서는 TEM 셀과 GTEM 셀에서이 측정결과를 이용하여 야외 시험장 결과를 얻어내는 상관관계 알고리즘에 대해 기술하였다. 4절에서는 IEC/CISPR와 TC77에서의 표준화 활동을 중심으로 현재 진행중인 TEM 도파관 관련 표준화 동향과 내용에 대해 기술하고자 한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.692-704
• /
• 2005

With the improvement of computer hardware, GPUs(Graphics Processor Units) have tremendous memory bandwidth and computation power. This leads GPUs to use in general purpose computation. Especially, GPU implementation of compute-intensive physics based simulations is actively studied. In the solution of differential equations which are base of physics simulations, tridiagonal matrix systems occur repeatedly by finite-difference approximation. From the point of view of physics based simulations, fast solution of tridiagonal matrix system is important research field. We propose a fast GPU implementation for the solution of tridiagonal matrix systems. In this paper, we implement the cyclic reduction(also known as odd-even reduction) algorithm which is a popular choice for vector processors. We obtained a considerable performance improvement for solving tridiagonal matrix systems over Thomas method and conjugate gradient method. Thomas method is well known as a method for solving tridiagonal matrix systems on CPU and conjugate gradient method has shown good results on GPU. We experimented our proposed method by applying it to heat conduction, advection-diffusion, and shallow water simulations. The results of these simulations have shown a remarkable performance of over 35 frame-per-second on the 1024x1024 grid.

• Journal of KIISE:Software and Applications
• /
• v.34 no.5
• /
• pp.397-406
• /
• 2007

The problem of finding an optimal alignment between sequence A and B can be solved by dynamic programming algorithm(DPA) efficiently. But, if the length of string was longer, the problem might not be solvable because it requires O(m*n) time and space complexity.(where, $m={\mid}A{\mid},\;n={\mid}B{\mid}$) For space, Hirschberg developed a linear space and quadratic time algorithm, so computer memory was no longer a limiting factor for long sequences. As computers's processor and memory become faster and larger, a method is needed to speed processing up, although which uses more space. For this purpose, we present an algorithm which will solve the problem in quadratic time and linear space. By using division method, It computes optimal alignment faster than LSA, although requires more memory. We generalized the algorithm about division problem for not being divided into integer and pruned additional space by entry/exit node concept. Through the proofness and experiment, we identified that our algorithm uses d*(m+n) space and a little more (m*n) time faster than LSA.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.181-191
• /
• 2005

This article describes a simplified mathematical model and the relevant numerical algorithm to simulate the draped cloth on virtual human body. The proposed algorithm incorporates an elliptical, or non-consecutive, method to simulate the cloth wrinkles on moving bodies without resorting to the result of the past time-steps of drape simulation. A global-local analysis technique was employed to decompose the drape of cloths into the global deformation and the local wrinkles that will be superposed linearly The global deformation is determined directly by the rotation and the translation of body parts to generate a wrinkle-free yet globally deformed shape of cloth. The local wrinkles are calculated by solving simple elliptical equations based on the orthogonality between conjugate harmonic functions representing the wrinkle amplitude and the direction of wrinkles. The proposed method requires no interpolative time frames even for discontinuous body postures. Standing away from the incremental approach of time integration in conventional methods, the proposed method yields a remarkable reduction of CPU time and an enhanced stability. Also, the transient motion of cloth could be achieved by interpolating between the deformations corresponding to each static posture.

• 한국해양학회지
• /
• v.22 no.3
• /
• pp.143-152
• /
• 1987

The digital data were obtained using Kennedy 9000 magnetic tape deck which was connected to the SMS960 side scan sonar during the field operations. The data of three consecutive survey tracks near Seongsan-po, Cheju were used for the development of this study. The softwares were mainly written in Fortran-77 using VAX 11/780 MINI-COMPUTER (CPU Memory; 4MB). The established mapping system consists of the pretreatment and the digital processing of seafloor image data. The pretreatment was necessary because the raw digital data format of the field magnetic tapes was not compatible to the VAX system. Therefore the raw data were read by the personal computer using the Assembler language and the data format was converted to IBM compatible, and next data were communicated to the VAX system. The digital processing includes geometrical correction for slant range, statistical analysis and cartography of the seafloor image. The sound speed in the water column was assumed 1,500 m/sec for the slant range correction and the moving average method was used for the signal trace smoothing. Histograms and cumulative curves were established for the statistical analysis, that was purposed to classify the backscattering strength from the sea-bottom. The seafloor image was displayed on the color screen of the TEKTRONIX 4113B terminal. According to the brief interpretation of the result image map, rocky and sedimentary bottoms were very well discriminated. Also it was shown that the backscattered acoustic pressurecorrelateswith the grain size and sorting of surface sediments.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.6 no.2
• /
• pp.118-126
• /
• 2004

Grid is a new Information Technology (IT) concept of "super Internet" for high-performance computing: worldwide collections of high-end resources such as supercomputers, storage, advanced instruments and immerse environments. The Grid is expected to bring together geographically and organizationally dispersed computational resources, such as CPUs, storage systems, communication systems, real-time data sources and instruments, and human collaborators. The term "the Grid" was coined in the mid1990s to denote a proposed distributed computing infrastructure for advanced science and engineering. The term computational Grids refers to infrastructures aimed at allowing users to access and/or aggregate potentially large numbers of powerful and sophisticated resources. More formally, Grids are defined as infrastructure allowing flexible, secure, and coordinated resource sharing among dynamic collections of individuals, institutions and resources referred to as virtual Organizations. GRID is an emerging IT as a kind of next generation Internet technology which will fit very well with agrometeorological services in the future. I believe that it would contribute to the resource sharing in agrometeorology by providing super computing power, virtual storage, and efficient data exchanges, especially for developing countries that are suffering from the lack of resources for their agmet services at national level. Thus, the establishment of CAgM-GRID based on existing RADMINSII is proposed as a part of FWIS of WMO.part of FWIS of WMO.

• Therapeutic Science for Rehabilitation
• /
• v.8 no.1
• /
• pp.51-62
• /
• 2019

Objective: To develop and verify the usability of a cognitive rehabilitation system with diverse cognitive functional levels based on tangible objects for the elderly population. Methods: A study was conducted to investigate the system's strengths and weaknesses by upgrading it with responses from two groups of 15 patients and 4 occupational therapists. After undergoing three forms of training - regarding executive function, memory, and concentration for a total of 20-30 min, the participants were asked to answer a structured questionnaire about contents of the three forms of training, hardware including the tablet PC functioning as a CPU and display media and tangible objects, and satisfaction of experiential usage of the system. Results: Both groups responded that the most interesting training area was executive function while the least interesting was concentration. Six participants reported that the size of the screen of the tablet PC was inappropriate, and five responded that the size of the tool was inappropriate. All therapists and 40% of the patients responded that they were satisfied with this system. Conclusion: This system's features include easy manipulation of tangible tools for performing training tasks, easy selection of and training in cognitive areas based on users' needs, and automatic adjustment of difficulty level based on users' performance. The training environment was designed to be similar to the natural environment by using tangible objects in both hands as input devices for the system, and the system was considered as an alternative to the lack of community cognitive rehabilitation specialists.