• 제목/요약/키워드: Discovery Time

검색결과 565건 처리시간 0.035초

DDS 미들웨어의 상호운용성 제공을 위한 표준 디스커버리 프로토콜 (Standard Discovery Protocol for Supporting Interoperability between DDS Middlewares)

  • 안성우;최종우;최윤석
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2011년도 춘계학술대회
    • /
    • pp.205-208
    • /
    • 2011
  • 최근 분산 환경에서 실시간 데이터 교환에 대한 요구가 증가하면서 발간/구독(publish/subscribe) 기반의 데이터 중심 통신 미들웨어인 DDS (Data Distribution Service)에 대한 관심 또한 증대되고 있다. 현재 다수의 벤더 및 연구단체에서 DDS 미들웨어를 제공하고 있으나 이들 간에 메시지 교환 포맷, 디스커버리 방식 등의 차이로 인해 상호연동이 제대로 되지 않는 문제가 있다. 이에 따라, OMG에서는 네트워크를 통한 메시지 교환을 위한 표준명세인 RTPS (Real-Time Publish-Subscribe)를 정의함으로써 서로 다른 DDS 간의 상호운용성을 제공하고자 하고 있다. 본 논문에서는 DDS의 핵심 기능인 디스커버리의 상호운용성을 위해 RTPS에서 정의하고 있는 SDP (Simple Discovery Protocol)에 대해서 분석하며 SDP의 구현을 위한 효율적인 설계방안을 제공한다.

  • PDF

유비쿼터스 컴퓨팅 환경에서 클러스터링 기반 효율적인 서비스 디스커버리 기법 (Efficient Service Discovery Scheme based on Clustering for Ubiquitous Computing Environments)

  • 강은영
    • 한국인터넷방송통신학회논문지
    • /
    • 제9권2호
    • /
    • pp.123-128
    • /
    • 2009
  • 유비쿼터스 컴퓨팅 환경에서는 네트워크상의 서비스를 자동으로 발견하고 서비스는 자신의 능력을 광고할 수 있는 서비스 디스커버리(service discovery)가 중요하다. 본 논문에서는 클러스터링 기반 서비스 디스커버리 기법과 P2P 캐슁 기법을 혼합하여 효율적인 서비스 디스커버리 기법을 제안한다. 제안한 기법은 노드 ID를 기반으로 클러스터링 하고 이를 이용하여 서비스를 검색한다. 또한 서비스 검색을 빠르게 하기 위하여 P2P 캐쉬를 기반으로 이웃 노드의 정보를 사용하여 서비스 검색 성능을 향상시킨다. 제안된 기법은 노드의 부하를 가중 시키며 병목 현상을 일으키는 중앙 서버를 사용하지 않고 많은 쿼리를 생성하는 플러딩 방식을 사용하지 않는다. 시뮬레이션을 통하여 서비스 디스커버리를 이용하는 주고받는 메시지수를 줄이고 평균 탐색 거리를 줄임으로서 전체 네트워크 로드와 응답 시간이 성능 향상 면에서 우수함을 보인다.

  • PDF

Computer-Aided Drug Discovery in Plant Pathology

  • Shanmugam, Gnanendra;Jeon, Junhyun
    • The Plant Pathology Journal
    • /
    • 제33권6호
    • /
    • pp.529-542
    • /
    • 2017
  • Control of plant diseases is largely dependent on use of agrochemicals. However, there are widening gaps between our knowledge on plant diseases gained from genetic/mechanistic studies and rapid translation of the knowledge into target-oriented development of effective agrochemicals. Here we propose that the time is ripe for computer-aided drug discovery/design (CADD) in molecular plant pathology. CADD has played a pivotal role in development of medically important molecules over the last three decades. Now, explosive increase in information on genome sequences and three dimensional structures of biological molecules, in combination with advances in computational and informational technologies, opens up exciting possibilities for application of CADD in discovery and development of agrochemicals. In this review, we outline two categories of the drug discovery strategies: structure- and ligand-based CADD, and relevant computational approaches that are being employed in modern drug discovery. In order to help readers to dive into CADD, we explain concepts of homology modelling, molecular docking, virtual screening, and de novo ligand design in structure-based CADD, and pharmacophore modelling, ligand-based virtual screening, quantitative structure activity relationship modelling and de novo ligand design for ligand-based CADD. We also provide the important resources available to carry out CADD. Finally, we present a case study showing how CADD approach can be implemented in reality for identification of potent chemical compounds against the important plant pathogens, Pseudomonas syringae and Colletotrichum gloeosporioides.

A Novel Route Discovery Scheme Equipped with Two Augmented Functions for Ad Hoc Networks

  • 이해룡
    • 정보통신설비학회논문지
    • /
    • 제3권1호
    • /
    • pp.15-24
    • /
    • 2004
  • 'The delay and control overhead during route discovery for destinations outside ad hoc networks are major obstacle to achieving scalability in the Internet. To solve this issue, we propose a novel route discovery scheme equipped with two augmented functions. In this paper, the Internet gateway maintains an address cache of Internet nodes frequently accessed from the ad hoc network and replies with an extended Route Response (RREP) message to the Route Request (RREQ) message based on its routing table and the address cache called EXIT(EXternal node Information Table). These augmented functions make the source node determine the location of the destination as fast as possible. Through simulations, the proposed route discovery scheme using both EXIT and extended RREP message shows considerable' reduction in both route discovery time and control message overhead.

  • PDF

ODM: A Neighbor Discovery Protocol Based on Optimal Discovery Model in WSNs

  • Wang, Hao;Wei, Liangxiong;Yuan, Ping;Li, Xiaodi;Luo, Qian;Luo, Xiao;Chen, Liangyin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권10호
    • /
    • pp.4889-4902
    • /
    • 2018
  • It is a challenging issue to improve the energy efficiency of neighbor discovery in WSNs. This paper proposes an optimal discovery model (ODM) for the first time. Based on the model, we investigate the influence of the relative size of two unequal active slots on the energy efficiency. ODM provides the energy optimal value of the length of the larger active slot at a given duty cycle. Other than existing methods, the worst-case latency bound of ODM is only one period. This is a subversive conclusion, because almost all other related methods are based on a wake-up schedule that contains several periods. We theoretically deduce that ODM can reduce worst-case discovery latency by 43.89% compared to Searchlight-Trim when their duty cycles are the same. The simulations verify the advantage of ODM.

Empirical Risk Assessment in Major Graphical Design Software Systems

  • Joh, HyunChul;Lee, JooYoung
    • Journal of Multimedia Information System
    • /
    • 제8권4호
    • /
    • pp.259-266
    • /
    • 2021
  • Security vulnerabilities have been reported in major design software systems such as Adobe Photoshop and Illustrator, which are recognized as de facto standard design tools in most of the design industries. Companies need to evaluate and manage their risk levels posed by those vulnerabilities, so that they could mitigate the potential security bridges in advance. In general, security vulnerabilities are discovered throughout their life cycles repeatedly if software systems are continually used. Hence, in this study, we empirically analyze risk levels for the three major graphical design software systems, namely Photoshop, Illustrator and GIMP with respect to a software vulnerability discovery model. The analysis reveals that the Alhazmi-Malaiya Logistic model tends to describe the vulnerability discovery patterns significantly. This indicates that the vulnerability discovery model makes it possible to predict vulnerability discovery in advance for the software systems. Also, we found that none of the examined vulnerabilities requires even a single authentication step for successful attacks, which suggests that adding an authentication process in software systems dramatically reduce the probability of exploitations. The analysis also discloses that, for all the three software systems, the predictions with evenly distributed and daily based datasets perform better than the estimations with the datasets of vulnerability reporting dates only. The observed outcome from the analysis allows software development managers to prepare proactively for a hostile environment by deploying necessary resources before the expected time of vulnerability discovery. In addition, it can periodically remind designers who use the software systems to be aware of security risk, related to their digital work environments.

Mitigating the Impact of Mobility on H.264 Real-Time Video Streams Using Multiple Paths

  • Calafate, Carlos T.;Malumbres, Manuel P.;Manzoni, Pietro
    • Journal of Communications and Networks
    • /
    • 제6권4호
    • /
    • pp.387-396
    • /
    • 2004
  • One of the main problems associated with MANETs is that mobility and the associated route discovery and maintenance procedures of reactive routing protocols cause severe interruptions on real-time video streams. Some of these interruptions are too large to be concealed using any sort of video technology, resulting in communications breaks unpleasant for the final end user. We present a solution for enhanced video transmission that increases route stability by using an improved route discovery process based on the DSR routing protocol, along with traffic splitting algorithms and a preventive route discovery mechanism. We also present some video adaptative mechanisms that improve the overall performance of multipath routing in terms of video data replication and video packet splitting strategies. Combining our proposals, we achieve up to 97% less interruptions on communication with high mobility and over 1.2 dB of improvements in terms of video distortion.

Real-Time White Spectrum Recognition for Cognitive Radio Networks over TV White Spaces

  • Kim, Myeongyu;Jeon, Youchan;Kim, Haesoo;Kim, Taekook;Park, Jinwoo
    • Journal of Communications and Networks
    • /
    • 제16권2호
    • /
    • pp.238-244
    • /
    • 2014
  • A key technical challenge in TV white spaces is the efficient spectrum usage without interfering with primary users. This paper considers available spectrum discovery scheme using in-band sensing signal to support super Wi-Fi services effectively. The proposed scheme in this paper adopts non-contiguous orthogonal frequency-division multiplexing (NC-OFDM) to utilize the fragmented channel in TV white space due to microphones while this channel cannot be used in IEEE 802.11af. The proposed solution is a novel available spectrum discovery scheme by exploiting the advantages of a sensing signaling. The proposed method achieves considerable improvement in throughput and delay time. The proposed method can use more subcarriers for transmission by applying NC-OFDM in contrast with the conventional IEEE 802.11af standard. Moreover, the increased number of wireless microphones (WMs) hardly affects the throughput of the proposed method because our proposal only excludes some subcarriers used by WMs. Additionally, the proposed method can cut discovery time down to under 10 ms because it can find available channels in real time by exchanging sensing signal without interference to the WM.

Minor Phenolic Constituents of the Anemarrhenae Rhizoma

  • Youn, Ui-Joung;Lee, Ye-Seul;Jeong, Ha-Na;Nam, Joo-Won;Lee, Yoo-Jin;Son, Young-Min;Hwang, Eun-Sook;Seo, Eun-Kyoung
    • Natural Product Sciences
    • /
    • 제15권4호
    • /
    • pp.203-207
    • /
    • 2009
  • A homoisoflavanone, 7,4'-dihydroxyhomoisoflavanone (1) and a flavanone, (2S)-7,4'-dihydroxy-5-methoxyflavanone (2), were isolated from the rhizomes of Anemarrhena asphodeloides, together with 4,4'-dihydroxychalcon (3), 2'-O-methylphlorethin (4), 1,3-bis-di-p-hydroxyphenyl-4-penten-1-one (5), and 2,4'-dihydroxy-4-methoxybenzophenone (6) on the basis of spectroscopic and physicochemical analyses including 1Dand 2D- NMR techniques as well as by comparison of their data with the published values. Compounds 1 - 4 were isolated for the first time from this plant source. Among isolates, compound 2 exhibited moderate inhibitory effect on the differentiation of pre-adipocyte 3T3-L1 cells.

A Semantic Service Discovery Network for Large-Scale Ubiquitous Computing Environments

  • Kang, Sae-Hoon;Kim, Dae-Woong;Lee, Young-Hee;Hyun, Soon-J.;Lee, Dong-Man;Lee, Ben
    • ETRI Journal
    • /
    • 제29권5호
    • /
    • pp.545-558
    • /
    • 2007
  • This paper presents an efficient semantic service discovery scheme called UbiSearch for a large-scale ubiquitous computing environment. A semantic service discovery network in the semantic vector space is proposed where services that are semantically close to each other are mapped to nearby positions so that the similar services are registered in a cluster of resolvers. Using this mapping technique, the search space for a query is efficiently confined within a minimized cluster region while maintaining high accuracy in comparison to the centralized scheme. The proposed semantic service discovery network provides a number of novel features to evenly distribute service indexes to the resolvers and reduce the number of resolvers to visit. Our simulation study shows that UbiSearch provides good semantic searchability as compared to the centralized indexing system. At the same time, it supports scalable semantic queries with low communication overhead, balanced load distribution among resolvers for service registration and query processing, and personalized semantic matching.

  • PDF