• Title/Summary/Keyword: 원 찾기

Search Result 418, Processing Time 0.027 seconds

Double-layered Peer-to-Peer Systems in MobileAd-hoc Networks (모바일애드혹 네트워크에서의 2계층 피어-투-피어 시스템)

  • Kim, Ji-Hoon;Yang, Sung-Bong
    • The KIPS Transactions:PartC
    • /
    • v.17C no.1
    • /
    • pp.61-68
    • /
    • 2010
  • As the mobile technology advances, file searching among the mobile device users becomes more important. In this paper, we propose the uniform grid, greedy, and MIS P2P systems that have double-layered topology to search files efficiently for mobile ad-hoc networks. In these systems, peers are classified into two groups, super-peers and sub-peers, and each super-peer manages its neighboring sub-peers. In the proposed systems, each super-peer maintains the appropriate information of its sub-peers so that when a peer requests a file, the request is sent to its super-peers and then to neighboring super-peers. Hence the proposed systems could avoid multi-broadcasting and reduce network overheads. The experimental results show that the proposed systems outperform a single-layered P2P system in terms of the average number of messages to find target files. Especially the MISsystem improves by reducing the average number of messages by 48.9% while maintaining the same search accuracy.

An Index-Based Search Method for Performance Improvement of Set-Based Similar Sequence Matching (집합 유사 시퀀스 매칭의 성능 향상을 위한 인덱스 기반 검색 방법)

  • Lee, Juwon;Lim, Hyo-Sang
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.11
    • /
    • pp.507-520
    • /
    • 2017
  • The set-based similar sequence matching method measures similarity not for an individual data item but for a set grouping multiple data items. In the method, the similarity of two sets is represented as the size of intersection between them. However, there is a critical performances issue for the method in twofold: 1) calculating intersection size is a time consuming process, and 2) the number of set pairs that should be calculated the intersection size is quite large. In this paper, we propose an index-based search method for improving performance of set-based similar sequence matching in order to solve these performance issues. Our method consists of two parts. In the first part, we convert the set similarity problem into the intersection size comparison problem, and then, provide an index structure that accelerates the intersection size calculation. Second, we propose an efficient set-based similar sequence matching method which exploits the proposed index structure. Through experiments, we show that the proposed method reduces the execution time by 30 to 50 times then the existing methods. We also show that the proposed method has scalability since the performance gap becomes larger as the number of data sequences increases.

A Study on the Use of Genetic Algorithm for Compensate a Intelligent Controller (지능제어기 보상을 위한 유전 알고리즘 이용에 관한 연구)

  • Shin, Wee-Jae;Moon, Jeong-Hoon
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.10 no.1
    • /
    • pp.93-99
    • /
    • 2009
  • The fuzzy control, neural network and genetic algorithm(GA) are algorithms to make the intelligence of system more higher. In this paper, we optimized the fuzzy controller using a genetic algorithm for desire response. Also a compensated fuzzy controller has dual rules. One control rule used to decrease the overshoot and rise time occurring in transient response region and another fuzzy control rule use to decrease the steady state error and rapildy to converge at the convergence region. GA is necessary to optimal the exchange time of the two fuzzy control rule base. Fuzzy-GA controller have a process of reproduction, crossover and mutation and we experimented by hydraulic servo motor control system We could observe that compensated Fuzzy-GA controller have good control performance compare to the fuzzy control technique have two rule base table.

  • PDF

Unrecorded Host Plants of Powdery Mildew in Korea -Powdery Mildew of Oriental Cherry, European Bird Cherry, Korean Bittersweet and Ash Tree- (국내(國內) 미기록(未記錄) 수목(樹木)흰가루병(病) 기주식물(寄主植物) 4종(種)에 대한 보고(報告) - 벚나무, 귀룽나무, 푼지나무, 물들메나무 흰가루병(病) -)

  • Lee, Chong Kyu;Kim, Kyung Hee;Yi, Chang Keun
    • Journal of Korean Society of Forest Science
    • /
    • v.60 no.1
    • /
    • pp.1-9
    • /
    • 1983
  • The leaves and young shoots of several broad leaf trees infected with powdery mildew fungi were collected and observed for the purpose of seeking for the host plants and identifying its pathogenic fungi in the arboretum of Forest Research Institute, Seoul from October to November 1982. Of these, Prunus serrulata var. spontanea, Prunus padus, Celastrus flagellaris, and Fraxinus ${\times}$ chiisanensis were found out to be new host plants of powdery mildew fungi in korea. Morphological characteristics of imperfect state and perfect state of powdery mildew fungi on 4 new host plants were examined. These pathogenic fungi were identified as Podosphaera tridactyla, Uncinula sengokui, and Uncinula fraxini.

  • PDF

Optimum Condition for Mass Culture of Hairy Roots from Artemisia sylvatica MAX (국내 자생 그늘쑥 (Artemisia sylvatica MAX) 모상근의 대량배양을 위한 최적조건)

  • Shin, Sun-Hee;Yang, Deok-Cho
    • Journal of Plant Biotechnology
    • /
    • v.30 no.1
    • /
    • pp.65-71
    • /
    • 2003
  • This research aims the production of anti-tumor substances through in vitro culture of hairy roots transformed by Agrobacterium rhizogenes in Artemisia sylvatica MAX and the effect of culture conditions on optimum growth of hairy roots. We investigated the optimum medium, pH, carbon source, sucrose, light, Fe and polyamine conditions of various lines of hairy roots (NK3, NK4, YX. NK3-10) induced from Artemisia sylvatica to increase the optimum growth of hairy roots. MS medium was the best for optimum growth of hairy root clone, NK3-S10. The optimum culture period was 4 weeks for NK3-S10. The optimum sucrose concentration was 3.5%. The optimum concentration of FeSO$_4$, spermine and spermidine was 0.1 mM, 10 mM and 100 mM, respectively.

Hepatocellular Carcinoma with Right Atrial Invasion Detected by PET/CT (우심방에 침범한 간세포암을 PET/CT로 진단한 1예)

  • Kim, Ji-Hoon;Kim, Eun-Sil;Yu, Ji-Won;Ahn, Seok-Jin;Jung, Jun-Oh;Kim, So-Yon;Kim, Young-Jung
    • Nuclear Medicine and Molecular Imaging
    • /
    • v.42 no.5
    • /
    • pp.414-418
    • /
    • 2008
  • The role of positron emission tomography (PET) with F-18 fluorodeoxyglucose (F-18 FDG) in the diagnosis of hepatocellulcar carcinoma (HCC) has been limited because of a variable FDG uptake in HCC. However, the usefulness of PET/CT for detecting extrahepatic metastasis and monitoring of the treatment response in HCC has been reported. A 55-year-old man with a hepatitis B surface antigen-positive, was admitted to our hospital due to dyspnea, general weakness and body weight loss for one month. Chest X-ray showed multiple reticulo-nodular densities on both lower lung fields, which implies metastatic lesions. F-18 FDG PET/CT revealed consecutively intense hypermetabolic mass in right hepatic lobe, inferior vena cava and right atrium. We report a case of HCC with IVC and right atrium invasion identified by F-18 FDG PET/CT.

Property-based Hierarchical Clustering of Peers using Mobile Agent for Unstructured P2P Systems (비구조화 P2P 시스템에서 이동에이전트를 이용한 Peer의 속성기반 계층적 클러스터링)

  • Salvo, MichaelAngelG.;Mateo, RomeoMarkA.;Lee, Jae-Wan
    • Journal of Internet Computing and Services
    • /
    • v.10 no.4
    • /
    • pp.189-198
    • /
    • 2009
  • Unstructured peer-to-peer systems are most commonly used in today's internet. But file placement is random in these systems and no correlation exists between peers and their contents. There is no guarantee that flooding queries will find the desired data. In this paper, we propose to cluster nodes in unstructured P2P systems using the agglomerative hierarchical clustering algorithm to improve the search method. We compared the delay time of clustering the nodes between our proposed algorithm and the k-means clustering algorithm. We also simulated the delay time of locating data in a network topology and recorded the overhead of the system using our proposed algorithm, k-means clustering, and without clustering. Simulation results show that the delay time of our proposed algorithm is shorter compared to other methods and resource overhead is also reduced.

  • PDF

Isolation and Charcterization of Micrococcus sp. HJ-19 Secreting Extracellular Protease (단백질 분해효소를 분비하는 Micrococcus sp. HJ19의 분리 및 특성)

  • Cha, In-Tae;Oh, Yong-Sik;Roh, Dong-Hyun
    • Korean Journal of Microbiology
    • /
    • v.43 no.3
    • /
    • pp.222-226
    • /
    • 2007
  • Proteases are degradative enzymes which hydrolyze a peptide bond between amino acids and they are abundantly applied to commercial field. In order to screen new source of pretense, bacteria secreting extracellular pretense were isolated by enrichment culture from deep sea water samples of East Sea, Korea. A bacterium, named as HJ19, showed the best growth and the largest clear zone in plates supplemented skim milk at $30^{\circ}C$. The partial DNA sequence analysis of the 16S rRNA gene, phenotypic tests and morphology identified that this strain was In genus Micrococcus. The strain HJ19 could not grow at $10^{\circ}C$ but it started growth and showed pretense activity at $20^{\circ}C$. The optimal growth was at $37^{\circ}C$ and the maximal protease activity at $30^{\circ}C$ was about 480unit/ml.

Resource Allocation Based on Location Information in D2D Cellular Networks (D2D 셀룰러 네트워크에서 위치기반 자원할당)

  • Kang, Soo-Hyeong;Seo, Bang-Won;Kim, Jeong-Gon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.4
    • /
    • pp.750-757
    • /
    • 2017
  • Recently, mobile internet traffic has rapidly increased as the huge increase of the smart phone and mobile devices. D2D get attention, because D2D is known that it reduce the traffic load of the base station and also improves the reliability of the network performance. However, D2D has a problem that the efficiency decreases as interference is increased. In this paper, we propose a resource allocation scheme to use the resources efficiently when the D2D link share the cellular resources in the cellular network based the uplink. D2D communication utilizes the location information for allocating resources when the eNB know the location of all devices. The proposed scheme select some cellular user using location informations in order to ensure performance of the D2D communication. and D2D link choose cellular user that performs resource allocation using only selected cellular user. Simulation results show optimal value of resource selection in order to ensure most performance of the D2D communication.

Development of Annual Festival by Resource Plants in Jeju Island (자원식물을 이용한 제주도 연중 축제 프로그램 개발)

  • Park, Suk-Keun
    • Proceedings of the Plant Resources Society of Korea Conference
    • /
    • 2010.10a
    • /
    • pp.6-6
    • /
    • 2010
  • 제주도는 우리나라의 가장 남쪽에 위하고 있으며 따뜻한 기온과 연중 축제 및 식물원, 박물관 등의 테마파크가 많아 온국민이 가장 선호하는 관광지역이다. 식물을 이용한 지역축제 및 관광명소 만들기는 초기비용이 적게 들어가고 친환경적이며 날이 갈수록 부가가치가 커지는 장점을 가지고 있다. 본 연구에서는 현재 제주도에서 행하여지고 있는 축제의 특성을 간단히 알아보고 자원식물을 이용한 제주도에서 연중 가능한 축제 프로그램을 개발하고자 하였으며 결과는 다음과 같았다. 1. 제주도의 축제는 총 31개이었으며 그중에서 식물을 이용한 축제는 15개로 전체의 48%를 차지하였다. 2. 지역에 따른 구분을 보면 제주시의 전체 축제는 16개이었으며 그중에서 식물을 이용한 축제는 8개로 전체의 50%를 나타냈고 서귀포시는 15개중에서 7개로 절반이 안되는 47%이었다. 3. 자원식물을 이용한 제주도에서의 연중 축제 프로그램 개발에 있어서 50여개를 제안하며 봄의 3월은 동백꽃축제, 수선화축제, 칡캐기축제, 서향축제, 4월은 꽃잔디축제, 개나리축제, 고사리축제, 조팝나무축제, 모란 축제, 개복사꽃축제, 살구꽃축제, 유채꽃축제, 청보리축제, 새우란축제, 왕벚꽃축제, 진달래축제, 5월은 참꽃나무축제, 대나무축제, 해당화축제, 작약축제, 라일락축제 등이 가능하다. 4. 여름의 6월은 한라산철쭉축제, 꽃창포축제, 접시꽃축제, 우리밀축제, 7월은 풍란축제, 홍화축제, 도라지축제, 수련축제, 산수국축제, 배롱나무축제, 8월은 해바라기축제, 무궁화축제, 다알리아축제, 칸나축제, 다육식물축제, 하귤축제, 열대과수축제, 등이 가능하다. 5. 가을의 9월에는 꽃무릇축제, 미로찾기축제, 10월에는 감국축제, 구절초축제, 11월에는 닥나무한지축제, 국화축제, 제주한란축제, 포인세티아축제 등이 가능하다. 6. 겨울의 12월에는 제주자생 구상나무를 이용한 크리스마스트리 경연대회, 1월에는 납매꽃축제, 먼나무축제, 2월에는 매화축제, 풍년화축제 등이 가능하다.

  • PDF