http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Helicobacter pylori와 대장균의 Shuttle Vector 개발
조명제,이우곤,이상룡,김경희,안영숙,김성희,김현주,류복덕,최여정,윤영혜,백승철,전영석,이광호 경상대학교 유전공학연구소 1997 遺傳工學硏究所報 Vol.16 No.-
In this study, a vehicle vector using cryptic plasmids was constructed for gene transfer in Helicobacter pylori. pHP51(3.9 kb) and pHP489(1.2 kb) were selected for constructing vectors from cryptic plasmid of H. pylori isolates in Korea. The HindⅢ-digestedDNA fragment(1.2kb) of pHP489 and 1.6kb DNA fragment of pHP51 were ligated with a kanamycin resistance gene(aph3'-Ⅲ) from C. jejuni to produce the recombinant plasmids pHP489K and pHP51K, respectively. Transformation frequency of pHP51K by electroporation was low. But pHP489K could be effectively transformed into various H. pylori strains. In order to design an intermdiate vehicle vector for gene transfer into H. pylori, pBlueHP489K was prepared by recloning pHP489K DNA into pBluescript and pTZ19R vector. This vector permitted the DNA fragment containing pHP489 sequence, aph3'-Ⅲ, and cloned DNA to be cut and self-ligated in the SacⅠ site after cloning. ureA and ureB gene were inserted into pBlueHP489K, resulting in pBlueHP489K/AB. The DNA fragment containing pHP489, kanamycin resistance gene(aph3'-Ⅲ), and urease structural gene was cut away from pBlueHP489K/AB and self-ligated to generate pBlueHP489K/AB. pBlueHP489K/AB made urease-negative H. pylori strains restore their urease activity. By this experiment, pBlueHP489K was confirmed to be the vehicle system for transferring H. pylori genes.
Design and Implementation of a Directory System for Disease Retrieval Services
Myung-ho Yeo,Yoon-kyeong Lee,Kyu-jong Roh,Hyoung-soon Park,Hak-sin Kim,Jun-ho Park,Tae-ho Kang,Chi-kwan Song,Chang-yong Yang,Hak-yong Kim,Jae-soo Yoo 한국콘텐츠학회 2009 ICCC International Digital Design Invitation Exhib Vol.2009 No.12
Recently, biological researches are required to deal with a large scale of data. While scientists used classical experimental approaches for researches in the past, it is possible to get more sophisticated observations easily with convergence of information technologies and biology. The study on diseases is one of the most important issues of the life science. Conventional services and databases provide users with information such as classification of diseases, symptoms, and medical treatments through the Web.. However, it is hard to connect or develop them for other new services because they have independent and different criteria. It may be a factor that interferes the development of biology. In this paper, we propose an integrated data structure for the disease databases. We also design and implement a novel directory system for diseases as an infrastructure for developing the new diseases services.
The Optimization of In-Memory Space Partitioning Trees for Cache Utilization
YEO, Myung Ho,MIN, Young Soo,BOK, Kyoung Soo,YOO, Jae Soo The Institute of Electronics, Information and Comm 2008 IEICE transactions on information and systems Vol.91 No.2
<P>In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered data partitioning and targeted fast information retrieval. Existing data partitioning-based index structures significantly degrade performance due to the redundant accesses of overlapped spaces. Specially, R-tree-based index structures suffer from the propagation of MBR (Minimum Bounding Rectangle) information by updating data frequently. In this paper, we propose an in-memory space partitioning index structure for optimal cache utilization. The proposed index structure is compared with the existing index structures in terms of update performance, insertion performance and cache-utilization rate in a variety of environments. The results demonstrate that the proposed index structure offers better performance than existing index structures.</P>
An Energy-Efficient Distributed Clustering Approach in Wireless Sensor Networks
YEO, Myung Ho,KIM, Yu Mi,YOO, Jae Soo The Institute of Electronics, Information and Comm 2009 IEICE TRANSACTIONS ON COMMUNICATIONS - Vol.92 No.2
<P>Clustering the sensor nodes is one of the most popular and effective approaches for applications that must support hundreds or thousands of nodes. The conventional algorithms consider various parameters to evenly distribute the energy load. However, energy consumption problem of the cluster head still remains. In this paper, we propose a novel clustering approach that periodically elects cluster heads with assistant nodes. The assistant nodes substitute for each cluster head to transmit sensor readings to the base station. Performance evaluations show that our proposed clustering algorithm achieves about 10-40% better performance than the existing clustering algorithms in terms of lifetime.</P>
Design and Implementation of a Directory System for Disease Services
Yeo, Myung-Ho,Lee, Yoon-Kyeong,Roh, Kyu-Jong,Park, Hyeong-Soon,Kim, Hak-Sin,Park, Jun-Ho,Kang, Tae-Ho,Kim, Hak-Yong,Yoo, Jae-Soo The Korea Contents Association 2010 International Journal of Contents Vol.6 No.1
Recently, biological researches are required to deal with a large scale of data. While scientists used classical experimental approaches for researches in the past, it is possible to get more sophisticated observations easily with the convergence of information technologies and biology. The study on diseases is one of the most important issues of the life science. Conventional services and databases provide users with information such as classification of diseases, symptoms, and medical treatments through the Web. However, it is hard to connect or develop them for other new services because they have independent and different criteria. It may be a factor that interferes the development of biology. In this paper, we propose integrated data structures for the disease databases. We also design and implement a novel directory system for diseases as an infrastructure for developing the new diseases services.
Server-Based User-Created Contents Processing System
Yeo, Myung-Ho,Kim, Hak-Sin,Roh, Kyu-Jong,Cho, Yong-Jun,He, Li,Kim, Hak-Cheol,Bok, Kyung-Soo,Yoo, Jae-Soo The Korea Contents Association 2008 International Journal of Contents Vol.4 No.4
The web 2.0 is leading a rapid change of internet services. The UCC(User Created Contents) service is one of the representative internet services with web 2.0 paradigm. In this paper, we design and implement the UCC services prototype system for image and video. The proposed system does not need to install ActiveX and client programs on devices of users to edit their contents. All processes for editing UCC are conducted on the server. Our proposed system consists of the two components such as the multimedia editing subsystem and the metadata management system. They provide the API to UCC service developers or vendors. The multimedia editing subsystem supports editing for image and video, and the streaming services of video. The metadata management subsystem supports the metadata management and retrieval of image and video.
노드 이용률과 검색 속도 개선을 위한 비트 벡터 기반 공간 분할 색인 기법
여명호(Myung Ho Yeo),성동욱(Dong Ook Seong),유재수(Jae Soo Yoo) 한국정보과학회 2010 정보과학회 컴퓨팅의 실제 논문지 Vol.16 No.7
KDB-트리는 다차원 데이터를 검색하기 위한 전통적인 색인 기법이다. 많은 연구에서 낮은 저장 공간 사용과 검색 성능이 KDB-트리군의 두 병목현상이라고 언급되고 있다. 데이터 삽입 순서와 데이터의 편향으로 인한 불필요한 공간 분할이 그 원인이다. 본 논문에서는 편향 데이터를 효율적으로 처리하고, 검색 성능을 향상시키기 위한 새로운 색인 구조인 KDB<SUB>CS</SUB>?-트리를 제안한다. KDB<SUB>CS</SUB>?-트리는 분할 정보를 비트벡터로 표현하는 압축 기법과 노드의 그룹화를 통한 포인터 제거 기법을 활용하여 중간 노드의 팬-아웃을 증가시키고, 중간 노드의 엔트리를 계층적으로 표현함으로써 중간 노드의 사용율을 높인다. The KDB-tree is a traditional indexing scheme for retrieving multidimensional data. Much research for KDB-tree family frequently addresses the low storage utilization and insufficient retrieval performance as their two bottlenecks. The bottlenecks occur due to a number of unnecessary splits caused by data insertion orders and data skewness. In this paper, we propose a novel index structure, called as KDB<SUB>CS</SUB>?-tree, to process skewed data efficiently and improve the retrieval performance. The KDB<SUB>CS</SUB>?-tree increases the number of fan-outs by exploiting bit-vectors for representing splitting information and pointer elimination. It also improves the storage utilization by representing entries as a hierarchical structure in each internal node.
무선 센서 네트워크를 위한 2-계층 기반의 에너지 효율적인 클러스터링 기법
여명호 ( Myung-ho Yeo ),김유미 ( Yu-mi Kim ),유재수 ( Jae-soo Yoo ) 한국정보처리학회 2006 한국정보처리학회 학술대회논문집 Vol.13 No.2
최근 무선 센서 네트워크에 대한 관심이 증가하고 있으며 여러 응용분야에서 활용되고 있다. 일반적으로 센서 네트워크는 수 백 ~ 수 만개의 작은 센서 노드들로 이루어지며, 센서 노드들은 제한된 에너지를 가지고 있기 때문에 효율적인 에너지 사용과 함께 범위성(Scalability), 부하 균등(Load Balancing) 이 센서 네트워크 응용 분야의 중요한 요구사항이다. 클러스터링은 이와 같은 요구사항을 처리하기 위한 효과적인 기술 중 하나이다. 하지만 클러스터의 모양에 따라 네트워크의 성능이 크게 달라지고, 수집과 전송에 대한 헤드의 부하가 일반 노드에 비해 크다는 단점이 있다. 본 논문은 이러한 문제점을 해결하기 위해서 그리드 구조를 기반으로 헤드 선출 영역을 제한하고, 수집과 전송을 수행하는 계층을 분리한 2-계층 기반 클러스터링 알고리즘을 제안한다.