http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
이성근,한치근,Pardalos, Panos M. 경희대학교 산학협력기술연구원 2002 산학협력기술연구논문집 Vol.8 No.-
In this paper, we study methods of designing survivable networks. The survivability networks can perform it's function even thoough there exist one or more node or conection failures. We propose four heuristic methods for the problems: Shortest Short-Cut method, Longest Short-Cut method, Tabsu Search method, and Simulated Annealing.
탐색 공간 Smoothing 방법의 연구 : The Case on the Survivable Network Design Problems 망의 생존도 문제를 중심으로
한치근,박종철 경희대학교 산학협력기술연구원 1995 산학협력기술연구논문집 Vol.1 No.-
In this paper, we consider the survivable network design problem which requires not only the minimum total cast but also the network survivability condition so that the network could be functioning normally in the occurrence of one or more failures. We use a heuristic approach based on local search method for solving the problems. The local search method is very efficient to solve combinatorial optimization problems. It, however, may find only a local optimum in the search space. Therefore, in this paper, we give a local search method with search space smoothing method which could be used for avoiding the problem that only local optimum is found. In order to improve the performance of the local search method(X-change), we attempt to limit the number of local minimum points by changing the structure in the search space. It is observed that the proposed method is efficient for solving the randomly generated survivable network problems.
도근영,김가현,이승휘,옥치율,강대석 東亞大學校 海洋資源硏究所 2003 硏究論文集 Vol.15 No.-
This study started with the measured experiment of climatic characteristic at the coastal reclamation area formed by the reclamation and development which is inevitable selection presently. As a result of the examination, the climate variation is predicted to be large in summer and the salt concentration is shown in the order of top layer, bottom layer and intermediate layer. Therefore, the greens space and wind path are occupied at the coastal reclamation.
한치근,이태주 慶熙大學校 1994 論文集 Vol.23 No.-
As the importance of the information increases, PC telecommunication service is becomming popular in Korea. It is necessary to analyze evaluate the domestic PC telecommunication service in order to make it competitive with foreign PC telecommunication service. In this paper, we are trying to find improvements of the service by questionnaire and business strategies services, we develop marketing strategies to improve the domestic PC telecommunication service usage.
P2P 프록시 캐싱을 이용한 VOD 시스템의 성능 향상
최치규,이근정,최창열,최황규 강원대학교 정보통신연구소 2005 정보통신논문지 Vol.9 No.-
This paper proposes a new proxy caching scheme of VOD systems in P2P network environments. In our P2Proxy caching scheme, a proxy server is composed of a client group in which each client stores a part of stream receiving from a VOD server into its client buffer. Each streaming part of the clients is equal to a buffer size which is desired at request its hour. A single client receives the request stream from other clients as long as the parts of the stream are available in the client group. Otherwise, the missing parts of the stream which are not in the client group are directly received from the VOD server through another patching channel. In the experiments, we evaluate the performance of our proposed scheme and the result is compared with the existing P2P streaming systems.
강영호,한치근 경희대학교 산학협력기술연구원 1999 산학협력기술연구논문집 Vol.5 No.-
The Network Survivability Problem is to design a network that can provide reliable network service with customers even if a loss or a failure occurs in some place of the network. In case of constructing the network, a method to design the network with minimum cost and survivability satisfaction simultaneously is required. In order to construct a network with low cost, it is also required to consider existing conduits and their capacity if there are already existed conduits in the network. In an earlier research, the network is constructed by considering only distance cost. In this paper, a heuristic method for solving the network survivability problem with conduits and their capacity is proposed.
기장도,박치영,류보열,김태종,모성환,곽재정,문철호,박근홍,박유환,정춘해 朝鮮大學校 附設 醫學硏究所 1996 The Medical Journal of Chosun University Vol.21 No.1
Chronic neutrophilic leukemia is a very rare myeloproliferative disorder which is characterized by severe sustained mature neutrophilic leukocytosis in peripheral blood (PB), hepatosplenomegaly, elevated leukocyte alkaline phosphatase, serum uric acid. serun viatmin B 12 and the bleeding tendency despite normal platelet count and coagulation time, absence of philadelphia chromosome, and the absence of fever or underlying infection or disease sufficient to mimic a leukemoid reaction. We have experienced a 34-years-old male patient with atypical chronic neutrophilic leukemia. On admission, the leukocyte count was 56,860/uL. severe neutrophic leukocytosis with 76% neutrophils and rare immature forms on PB smear. Many neutrophils had toxic granules, and vacuoloes. Leukocyte alkaline phosphatase score was decreased. The cytogenetic study showed Philadelphia chromosome negative with normal karyotype.
HMM과 PCA를 이용한 실시간 립리딩 시스템 설계 및 구현
이은숙,이지근,이상설,정성태 원광대학교 공업기술개발연구소 2003 工業技術開發硏究誌 Vol.23 No.-
Recently, lip-reading has become a hot topic in the field of multi-modal interface technology. Previous lip-reading systems work on some specific conditions. Especially, they can extract face region and lip region on some predefined conditions. Also, they support only off-line running environment. To overcome such problems, this paper proposes a technique which extracts face and lip region in real-time from the input video. Also, it proposes a method which extracts visual speech features from the lip region which can be used as input parameters to the HMM based recognition system. With the extracted visual speech features, our lip-reading system can execute training and recognition in real-time. Modified mean shift algorithm is then applied to detect and track the facial region from the facial region probability distribution. After finding face region, lip region is detected by finding the region which has minimum hue value distribution. Next, PCA(Princip1e Component Analysis) is applied to extract features data, and HMM (Hidden Markov Model) based pattern recognition is used to realize real-time training and recognition.
성연중,한치근 慶熙大學校 1997 論文集 Vol.26 No.-
In this paper, we consider a graph partition problem, in which we partition the vertices of the graph into 2 parts and minimize the sum of costs of edges that connect two parts. We use Kernighan's heuristic method based on a local search method for solving the problem, In order to increase the possibility of finding the global optimum, we apply smoothing techniques to the heuristic method and propose two smoothing algorithms. Also, we propose an algorithm for obtaining an initial solution and using the initial solution, we can get a minimum solution that is not worse than solutions that can be obtained using many random initial solutions. Through the computational experiments, we demonstrate the proposed methods are better than the existing method for the graph partition problem.