• Title/Summary/Keyword: 공통경로

Search Result 185, Processing Time 0.028 seconds

Investigation of Biological Activities of Enzymatic Hydrolysate of Spirulina (스피루리나 효소가수분해물의 생리활성 탐색)

  • Son, Min-Hee;Park, Keun-Hyoung;Choi, A-Reum;Yoo, Gui-Jae;In, Man-Jin;Kim, Dong-Ho;Chae, Hee-Jeong
    • Journal of the Korean Society of Food Science and Nutrition
    • /
    • v.38 no.2
    • /
    • pp.136-141
    • /
    • 2009
  • Biological activities of enzymatic hydrolysate of spirulina (EHS) were investigated. EHS showed no significant effects on the growth-stimulating activity for lactic-acid bacteria and antioxidant activity. EHS showed slight in vitro growth-inhibitory effects (15% at 1.42 mg/L) on a human cervical cancer cell line (HeLa). In addition, the anticoagulant activities of EHS were measured based on three different pathways: common, intrinsic and extrinsic pathways. As an indication of anticoagulant activity on common pathway, thrombin time (TT) of EHS (100 mg/L) was measured as 155.6 sec. Activated partial thromboplastin time (aPTT) for intrinsic pathway of EHS (1,000 mg/L) was measured as 95.8 sec. Prothrombin time (PT) based on extrinsic pathway of EHS (1,000 mg/L) was measured as 10.6 sec. These data showed that EHS have influences on anticoagulant factors of common pathway and intrinsic pathway. Consequently it was found that EHS could be used as a functional food for blood circulation.

A Study of Survivable Alternate Routing Algorithm (생존성있는 대체 경로 라우팅 알고리즘 연구)

  • Park, Young-Chul
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.7
    • /
    • pp.535-539
    • /
    • 2007
  • We study an degree of alternativeness and a survivability of alternate routing algorithm in mobile ad-hoc tactical communication networks. The common channel signaling scheme is used and flood search routing algorithm is used for analysis. We also study a connectivity performance for flood search routing, restricted flooding and hybrid routing. From the results we expect low blocking probabilities with alternate routing and the conventional flood search routing shows better connectivity performance which results in high survivability.

Common-path OCT Image Using Partial Reflecting Probe (부분 반사 프로브를 사용한 공통경로 OCT 이미지 획득)

  • Park, Jae-Seok;Jeong, Myung-Yung;Kim, Chang-Seok;Han, Jae-Ho;Kang, Jin-U.
    • Korean Journal of Optics and Photonics
    • /
    • v.19 no.2
    • /
    • pp.103-107
    • /
    • 2008
  • Unlike conventional optical coherence tomography systems based on Michelson interferometer, we suggest a common-path OCT system, which does not include a separated configuration between reference signal and sample signal. We optimize the refractive index of partial reflecting probe to induce a balanced intensity of the reference signal. At the end of the probe, convex lens was optimally fabricated to get images of biological samples in the position of focus. Using the experimental system, we could get 2-D images of various biological samples.

Screening of Anticoagulant Activities in Extracts from Edible Herbs (허브 추출물의 항응고 활성 검색)

  • 신동훈;이종임;이현순;전우진;유광원;홍범식;조홍연;양한철
    • Journal of the Korean Society of Food Science and Nutrition
    • /
    • v.29 no.2
    • /
    • pp.335-341
    • /
    • 2000
  • In order to search for blood anticoagulant substance from herbal extracts, we extracted with cold water (Fr. I), methanol (Fr. II) and hot water (Fr. III) from 93 commercially available herbs. The anticoagulant activity of herbal extracts was examined through the intrinsic pathway by activated partial thromboplastin time (APTT), the extriansic pathway by prothrombin time (PT) and the common pathway by thrombin time (TT). Onion, garlic, clove, fenugreek, mugwort, thyme and sage had on anticoagulant activity with intrinsic pathway and mint, italian seasoning, rosemary, turmeric, tarragon and wasabie had on anticoagulant activity with common pathway. Nobody had on anticogulant activity with extrinsic pathway. Among commerical herbs tested, clove cultivated in holland was selected because it showed the most potent anticoagulant activity among the samples investigated.

  • PDF

A Pre-Resource Reservation Mechanism using NSIS protocol (NSIS 프로토콜을 이용한 사전자원예약 방안)

  • Kim, Sun-Young;Byun, Hae-Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.538-548
    • /
    • 2008
  • In the Internet Engineering Task Force(IETF), Next Step in Signaling(NSIS) working group, proposed a mechanism to discover the Crossover Node(CRN), when the route is changed by Mobile Node(MN) handover. The CRN is divergence or convergence node on old and new path for reserving resources. Trough the CRN discovery mechanism, it possible to reduce a signaling delay and avoid the redundant reservation on the common path between old and new path. However, the QoS(Quality of Service) can be guaranteed continuously while the MN is performing handover, it is needed to pre-reserve the resource on the new path before completion of the handover. When the nodes on the new path try to make a pre-resource reservation before the handover, it is difficult to pre-reserve the resource with the existing CRN discovery mechanism. Therefore, we proposed a Passive CRN(PCRN) discovery scheme and pre-resource reservation mechanism. The PCRN which means an initial common point between the current reserved and the new paths, where the handover can take place.

A QoS Guaranteed Mechanism Using the FRSVP in the Hierarchical Mobile IPv6 (계층적 이동 IPv6 네트워크에서 FRSVP를 이용한 QoS 보증 방안)

  • Kim Bo-Gyun;Hong Choong-Seon;Lee Dae-Young
    • The KIPS Transactions:PartC
    • /
    • v.12C no.3 s.99
    • /
    • pp.419-428
    • /
    • 2005
  • This paper divides domains into the intra, inter domain according to the mobile node's movement and .proposes the Fast RSVP algorithm on the HMIPv6. It is done to advance reservation using L2 beacon signal when MN is located to overlapped cell area. In case of intra-region handoff, the advance reservation is reserved at the nearest common router and In case of inter-region handoff, it is done to advance reservation through the other site MAP's QA(QoS Agent) to the AR and optimize CN's path. Because of using the bandwidth efficiently and switching the data path quickly, the proposal algorithm minimizes the service disruption by data routing.

Locating Logistics Hub with Parcel Delivery Data (실제 택배 데이터 기반으로 최적의 물류 허브 위치 도출)

  • Song, Ha Yoon;Han, In Soo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2019.05a
    • /
    • pp.270-272
    • /
    • 2019
  • 택배 배달 서비스는 전국적 물류의 중요 부분이다. 노선이 잘못되면 시간과 비용 면에서 경제적 불이익이 발생할 수 있다. 이러한 위험을 최소화하기 위해 물류 회사나 IoT 기기 등에서 실제 배송 데이터 10만 개를 수집하여 최소 거리와 최소 시간의 관점에서 최적의 허브 후보 위치를 분석하였다. 택배의 공통 경로 데이터는 실제 택배의 경로 데이터에 Longest Common Route Sequence 알고리즘을 사용하여 계산하였다. 계산한 택배의 공통 경로 데이터를 기반으로, 최적의 허브 후보 위치를 설정하고, 이로부터 최적의 거리와 시간을 계산할 수 있다.

An Efficient Routing Algorithm Considering Packet Collisions in Cognitive Radio Ad-hoc Network (CR Ad-hoc Network에서 패킷 충돌을 고려한 효율적인 경로탐색 알고리즘)

  • Kim, Jin-Su;Choi, Jun-Ho;Shin, Myeong-Jin;Lee, Ji-Seon;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.9
    • /
    • pp.751-764
    • /
    • 2013
  • In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.

Optimal Configurations of Multidimensional Path Indexes for the Efficient Execution of Object-Oriented Queries (객체지향 질의의 효율적 처리를 위한 다차원 경로 색인구조의 최적 구성방법)

  • Lee, Jong-Hak
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.7
    • /
    • pp.859-876
    • /
    • 2004
  • This paper presents optimal configurations of multidimensional path indexes (MPIs) for the efficient execution of object-oriented queries in object databases. MPI uses a multidimensional index structure for efficiently supporting nested predicates that involve both nested attribute and class hierarchies, which are not supported by the nested attribute index using one-dimensional index structure such as $B^+$-tree. In this paper, we have analyzed the MPIs in the framework of complex queries, containing conjunctions of nested predicates, each one involving a path expression having target classes and domain classes substitution. First of all, we have considered MPI operations caused by updating of object databases, and the use of the MPI in the case of a query containing a single nested predicate. And then, we have considered the use of the MPIs in the framework of more general queries containing nested predicates over both overlapping and non-overlapping paths. The former are paths having common subpaths, while the latter have no common subpaths.

  • PDF

Design and Implementation of Common View for XML Documents using the Associative Value (연관값을 이용한 XML 공통 VIEW의 설계 및 구현)

  • 박진만;김태우;홍동완;윤지희
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10c
    • /
    • pp.202-204
    • /
    • 2002
  • 인터넷 상에 산재하는 분산이질 형태의 자료들에 대한 효율적인 검색을 지원하기 위해서는 이 들 문서들의 구조를 새로운 정보 구조로 통합하여 사용자에게 제시하여야 한다. 본 논문에서는 DTD 또는 XML Schema를 기반으로 하는 XML 문서의 공통 뷰 설계를 위한 공통 데이터 모델과 처리 방식을 제안한다. 계층, 상속, 복합 등의 다양한 구조 처리를 위한 XML 문서의 경로 정보, 관련성이 있는 요소들의 연결에 이용되는 연관값, 소스 매핑 정보 등으로 구성된 복합 필드 구조를 갖는 트리형의 새로운 공통 데이터 모델을 정의한다. 또한 XQuery 기반의 공통 뷰 정의 질의 기능과 공통 데이터 구조상의 질의 처리 방식을 보인다.

  • PDF