http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
서희종(Heejong Suh),Yongjin Park(Yongjin Park) 한국정보과학회 1988 한국정보과학회 학술발표논문집 Vol.15 No.1
프로그램과 자료파일을 갖는 분산시스템을 확율을 갖는 그래프로 모델화 한다. 분산프로그램 신뢰도와 분산시스템 신뢰도를 정의하고 K단국 신뢰도 계산알고리즘을 바탕으로 계산하는 알고리즘을 제안한다. 프로그램과 자료파일이 중복인 경우 감도를 분석한다.
서희종 여수대학교 1998 論文集 Vol.13 No.2
After discussing a few derivations of the polynomial form of a boolean function, the applications of this form are discussed. The polynomial form is shown to be very useful for understanding of switching function on fault tolerant electronics systems. In this paper, tutorial theories are explained.
서희종 여수대학교 1997 論文集 Vol.11 No.2
In this paper, we propose a effective and new algorithm by which encoders for good trellis code are constructed, and construct encoder with good code by the algorithm Relations between systematic feedback and its equivalent non-systematic feedforware code are clarified and formulated by mathmetics. After a relative structure of the registers of encoder is set, the states of non-systematic feedforward encoder are representated as a state diagram, and non-systematic feedforward encoder is constructed. An algorithm by which non-systematic feefforward and its equivalent systematic feedback encoder are constructed is proposed. The algorithm is effective, because of searching only necessary state of the state diagram. As examples, rate 1/2 trellis coded QPSK, rate 2/3 trellis coded 8-PSK, and rate 3/4 trellis coded 16-QASK are examined.
서희종 여수대학교 1998 論文集 Vol.12 No.2
In this paper, algorithms for conversion from feedforward to feedback codes, and vice veras are presented. The former is based on the trellis search and the latter on the existing method of an algebraic solution, is newly modified. The algorithms work on codes of rate R=k/n.
MPEG-4의 형상 정보 부호화에 사용되는 고속 움직임 추정부 알고리듬
서희종 여수대학교 2002 論文集 Vol.17 No.-
This paper proposes a fast motion estimation algorithm for MPEG-4 shape coding. The proposed algorithm is based on inherent properties of shape coding as well as shape information, i.e., context-based motion estimation feature, motion vector(MV) correlation between neighboring binary alpha blocks (BAB's), and binary feature of shape information. By using these properties, the proposed algorithm can achieve a high processing speed. Simulation results show that our algorithm can reduce the computational complexity of ME for shape coding up to 90% at least even for the worst case. Therefore, the algorithm is suitable for real-time software applications of MPEG-4 shape encoding.
서희종 여수대학교 2001 論文集 Vol.16 No.-
Today networks are becoming ubiquitous, fast, and cheap. But carriers and vendors endeavor in making networks more reliable and secure. Rapid technical evolution, market pressures, and complexity have contributed to large outages in data and voice networks. Owing to the unreliable deployment and operation of otherwise fault-tolerant communication technologies and architectures, there are severe disruptions to thousands of users and enterprises. Network reliability growth make the required services satisfying and must concentrate infrastructure to realize economies of scale.
Reliability Trees in the Distributed Systems
Suh, HeeJong 여수대학교 1998 論文集 Vol.12 No.2
본 논문에서는 분산시스템의 신뢰도 계산에 필요한 목을 구축한다. 분산시스템의 컴퓨터는 절점에 통신로는 가지에 대응시켜 그래프 G=(V,E)로 모델화한다. 분산 프로그램신뢰도와 시스템신뢰도를 계산하는데 필요한 프로세싱엘리먼트와 자료파일을 연결하는 패스를 표현하는 신뢰도 목을 생성한다. 신뢰도 목을 구축하기 위해서 O(|V|+2|E|)의 기억공간이 필요하고, 패스가 스패닝 트리를 구축할 때 패스 수를 T라하고 패스에 배반인 사상을 갖는 패스 수를 t₁이라고 할 때 계산복잡도는 O(|E|+|V|(t+t₁))이다. 신뢰도를 위한 계산복잡도도 같은 값을 갖는다. 이 방법은 DP(Disjoint-Products) 방법보다 우수하다.