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.

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>

Server-Based User-Created Contents Processing System

Myung Ho Yeo,Hak Sin Kim,Kyu Jong Roh,Yong Jun Cho,LI HE,Hak Cheol Kim,Kyung Soo Bok,Jae Soo Yoo 한국콘텐츠학회(IJOC) 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 metαdαtα 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 metαdαtα management subsystem supports the metαdαtα management and retrieval of image and video.

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.

Design and Implementation of a Directory System for Disease Services

Myung-Ho Yeo,Yoon-Kyeong Lee,Kyu-Jong Roh,Hyeong-Soon Park,Hak-Sin Kim,Jun Ho-Park,Tae-Ho Kang,Hak-Yong Kim,Jae-Soo Yoo 한국콘텐츠학회(IJOC) 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.

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>

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.

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.

WMI를 이용한 다중 클라이언트 원격 관리 시스템 설계 및 구현

여명호(Myung-Ho Yeo),박준호(Jun-Ho Park),강광구(Gwang-Goo Kang),권현호(Hyun-Ho Kwon),이진주(Jin-Ju Lee),이지희(Ji-Hee Lee),최형락(Hyoung-Rak Choi),장수민(Su-Min Jang),서원석(Won-Seok Seo),유재수(Jae-Soo Yoo) 한국콘텐츠학회 2010 한국콘텐츠학회논문지 Vol.10 No.10

최근 컴퓨터의 잉여 자원을 이용하기 위하여 최근에는 한 대의 컴퓨터를 여러 유저가 동시에 사용할 수 있는 다중 클라이언트 PC 기술이 고안되고 있다. 기존의 PC 매니지먼트 시스템은 일반적으로 한 대의 컴퓨터를 한 명의 사용자만이 사용하는 단일 클라이언트 PC만을 고려하였기 때문에 다양하고도 복잡한 문제를 야기 시킬 수 있다. 본 논문에서는 WMI 기술을 이용한 윈도우즈 OS 기반 다중 클라이언트의 사용 정보를 모니터링 및 제어 할 수 있는 원격 관리 시스템을 설계하고 구현한다. 제안하는 시스템은 WMI 기술과 새롭게 정의한 클라이언트 관리 프로토콜을 이용하여 다중 클라이언트 개별의 자원 사용 정보에 대한 모니터링 및 제어 기능을 제공한다. 뿐만 아니라, 서버와 클라이언트 간의 의사소통 기능을 제공하며, 잠금 설정 및 접근 제어 기능을 제공한다. Recently, multi client PC technologies that several users can use one set of computer at the same time are being designed to use the surplus computer resource. In general, as the existing PC management system considers only a single client PC that only one user uses a computer, various kinds of complicated problems may be arisen. This paper designs and realizes a remote management system that can monitor and control the information used in the windows based OS multi-client using WMI technology. The proposed system herein uses WMI technology and newly defined client management protocol and provides the monitoring and control functions on individual resource use information of multi-client. As well, it provides a communication function between the server and the client, and locking setting and access control functions.

센서 네트워크에서 시놉시스와 인코딩을 이용한 에너지 효율적인 인-네트워크 조인 질의 처리

여명호(Myung-Ho Yeo),장용진(Yong-Jin Jang),김현주(Hyun-Ju Kim),유재수(Jae-Soo Yoo) 한국콘텐츠학회 2011 한국콘텐츠학회논문지 Vol.11 No.2

최근 많은 연구자들은 서로 다른 영역에 저장된 센서 데이터를 이용한 조인 질의에 관심을 갖고 있다. 기존 기법은 예비 조인 조정자가 센서 노드로부터 시놉시스를 수집하고, 조인 질의 처리에 필요한 센서 데이터를 결정한다. 기지국은 전체 데이터를 수집하는 대신 일부 센서 데이터를 수집하여 최종 조인 처리를 수행한다. 하지만, 예비 조인을 수행하는 과정에서 통신 오버헤드를 발생시키는 단점을 가지고 있다. 본 논문에서는 이와 같은 문제점을 해결하는 새로운 에너지 효율적인 인-네트워크 조인 기법을 제안한다. 제안하는 기법은 네트워크 내부에서 예비 조인 조정자를 선정한다. 예비 조인 조정자는 조인의 초기 단계에서 조인 결과에 포함되지 않는 데이터를 제거하고 센서 데이터의 압축을 수행한다. 기지국은 압축된 데이터의 일부와 데이터 압축을 위한 인코딩 테이블을 수집하고 조인 결과를 결정한다. 그 결과, 제안하는 기법은 예비 조인 처리를 위한 통신 비용을 줄이고 네트워크 수명을 연장시킨다. Recently, many researchers are interested in using join queries to correlate sensor readings stored in different regions. In the conventional algorithm, the preliminary join coordinator collects the synopsis from sensor nodes and determines a set of sensor readings that are required for processing the join query. Then, the base station collects only a part of sensor readings instead of whole readings and performs the final join process. However, it has a problem that incurs communication overhead for processing the preliminary join. In this paper, we propose a novel energy-efficient in-network join scheme that solves such a problem. The proposed scheme determines a preliminary join coordinator located to minimize the communication cost for the preliminary join. The coordinator prunes data that do not contribute to the join result and performs the compression of sensor readings in the early stage of the join processing. Therefore, the base station just collects a part of compressed sensor readings with the decompression table and determines the join result from them. In the result, the proposed scheme reduces communication costs for the preliminary join processing and prolongs the network lifetime.