http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
하기종 한국시뮬레이션학회 1997 한국시뮬레이션학회 논문지 Vol.6 No.2
In this paper, operations system was designed for the centralization of data processing of various state information from the facilities of mobile communication network. And the system performance experimental system module was measured and analyzed from the designed experimental system module. The configuration of system design was presented with the centralized type to monite and control the facilities of mobile communication network in the central office. The communication process design of the internal system was implemented with the resource of message queue having a excellent transmission ability for processing of a great quantity of information in the inter-process communication among communication resources of UNIX system. The process with a server function from the internal communication processes was constructed with a single server or a double server according to the quantity of operations and implemented with the policy of the presented server. And then, we have measured performance elements in accordance with the change of input parameters from the designed experimental module : response time, waiting time, buffer length, the maximum quantity existing in message queue. And from these results, we have compared and analyzed the system state each server algorithm according to performance variations.
The Placement Algorithm of the Shuffle-Exchange Graph Using Matrix
하기종,최영규,황호정,Hah, Ki Jong,Choi, Young Kyoo,Hwang, Ho Jung The Institute of Electronics and Information Engin 1987 전자공학회논문지 Vol.24 No.2
The shuffle-exchange graph is known as a structure to perform the parallel algorithms like Discrete Fourier Transform(DFT), matrix multiplication and sorting. In this paper, the layout for the shuffle-exchange graph is described and this layout places emphasis on the placement of nodes that has the capability to have as small area as possible, have as a small number of crossings as possible, and have as short wires as possible. The algorithm corrdsponding these conditions is proposed and each evaluation factor and the placement of the N-node shuffle-exchange graph is performed with FORTRAN and BASIC program, and these results are calcualted.
이중 채널 라우터를 사용하는 무선 센서네트워크를 위한 다중경로 라우팅 알고리즘
하기종,유승식,임상민,김병호,Hah, Ki-Jong,Yoo, Seung-Sik,Lim, Sang-Min,Kim, Brian 한국정보통신학회 2007 한국정보통신학회논문지 Vol.11 No.4
지속적인 데이터 전송이 필요한 센서네트워크의 경우 센서 노드가 증가할수록 네트워크의 요구 대역폭도 증가하게 되어 상대적으로 고속의 데이터 처리 및 전송이 필요하다. 본 논문에서는 이중채널 라우터를 사용하는 센서 네트워크에서 연속적인 데이터 스트림의 전송 속도를 최대화하기 위하여 여러 센서 노드로부터 싱크노드로의 다중경로를 설정하는 라우팅 알고리즘을 개발하고 제안하였다. 또한, 지그비 통신 모듈을 사용하는 이중채널 라우터에서 제안한 다중경로 알고리즘의 성능을 분석하였다. 실험을 통해 실제 통신 속도를 측정한 결과, 일반적인 단일 채널 라우터의 전송 성능의 2배에 가까운 150kbps 이상의 전송률을 안정적으로 얻을 수 있음을 확인하였다. In case of wireless sensor networks being applied to a target environment having continuous data transfer, high-speed data transmission and processing is necessary to meet increased bandwidth needs. This paper proposes a novel multipath routing algorithm to increase the bandwidth of continuous data stream for the wireless sensor network using dual channel routers. We evaluate performance of the proposed algorithm in the wireless sensor network using the dual channel touter based on ZigBee protocol. According to the experimental evaluation, the proposed algorithm showed outstanding performance enhancement with the bandwidth of 150kbps, which is about twice of existing single channel router.
A study on some variations of the k-d tree and BD tree for logical gates
Hah, ki jong,Choi, young gyu,Yi, cheon hee 청주대학교 산업과학연구소 1993 産業科學硏究 Vol.11 No.-
In this paper, a simple modification to the basic k-d tree structure is suggested to improve its performance for certain types of queries at the expense of slightly increased storage cost. Also present are some experimental results that compare the perfomance of the standard k-d tree and the modified k-d tree The k-d tree is one such example and it is a natural generalization of the standard one-dimensional binary search tree. Recently, a new storage structure, called the BD tree[1], was proposed to manage multidimensional data This structure has good dynamic characteristics, several variations are possible on the basic k-d tree structure This paper studies the performance implications of some variations. Further, it provides an empirical performance comparison of the k-d tree and BD tree in database applications.