• 제목/요약/키워드: Candidate nodes

검색결과 90건 처리시간 0.025초

XML문서에서 어노테이션의 위치재생성 기법 (Annotation Repositioning Methods in XML Documents)

  • 손원성;김재경;고명철;임순범;최윤철
    • 한국정보과학회논문지:소프트웨어및응용
    • /
    • 제32권7호
    • /
    • pp.650-662
    • /
    • 2005
  • 어노테이션 시스템에서 원본문서가 갱신되었을 경우 어노테이션이 항상 적절한 위치를 유지하기 위해서는 로버스트(robust)한 위치재생성(repositioning) 기능이 필요하다. XML 문서환경에서 어노테이션에 대한 위치재생성을 위해서는 텍스트 정보뿐만 아니라 구조문서 특성을 포함할 수 있어야 한다. 이를 위하여 본 논문에서는 XML 기반의 원본문서 및 어노테이션 정보를 논리구조트리(logical structure tree)로 표현하고, 각 트리간의 대응관계를 분석하여 복수의 후보 앵커들을 생성한다 또한 복수의 후보 앵커들 중 최적의 후보 앵커를 선택하기 위하여 논리구조트리 앵커 노드의 문자열(textual data) 및 레이블 정보에 기반한 단계별 앵커링 기준을 제시한다. 그 결과 본 논문에서는 구조문서 환경에서 다양한 형태의 컨텍스트 갱신이 발생하였을 경우에도 로버스트한 위치재생성이 가능하다.

Individual expression and processing of hepatitis C virus E1/E2 epitopes-based DNA vaccine candidate in healthy humans' peripheral blood mononuclear cells

  • Rola Nadeem;Amany Sayed Maghraby;Dina Nadeem Abd-Elshafy;Ahmed Barakat Barakat;Mahmoud Mohamed Bahgat
    • Clinical and Experimental Vaccine Research
    • /
    • 제12권1호
    • /
    • pp.47-59
    • /
    • 2023
  • Purpose: The development and study of hepatitis C virus (HCV) vaccine candidates' individualized responses are of great importance. Here we report on an HCV DNA vaccine candidate based on selected envelope (E1/E2) epitopes. Besides, we assessed its expression and processing in human peripheral blood mononuclear cells (PBMCs) and in vivo cellular response in mice. Materials and Methods: HCV E1/E2 DNA construct (EC) was designed. The antigen expression of EC was assayed in PBMCs of five HCV-uninfected donors via a real-time quantitative polymerase chain reaction. Serum samples from 20 HCV antibody-positive patients were used to detect each individual PBMCs expressed antigens via enzyme-linked immunosorbent assay. Two groups, five Swiss albino mice each, were immunized with the EC or a control construct. The absolute count of lymph nodes' CD4+ and CD8+ T-lymphocytes was assessed. Results: Donors' PBMCs showed different levels of EC expression, ranging between 0.83-2.61-fold in four donors, while donor-3 showed 34.53-fold expression. The antigens expressed in PBMCs were significantly reactive to the 20 HCV antibody repertoire (all p=0.0001). All showed comparable reactivity except for donor-3 showing the lowest reactivity level. The absolute count % of the CD4+ T-cell significantly increased in four of the five EC-immunized mice compared to the control group (p=0.03). No significant difference in CD8+ T-cells % was observed (p=0.89). Conclusion: The inter-individual variation in antigen expression and processing dominance was evident, showing independence in individuals' antigen expression and reactivity levels to antibodies. The described vaccine candidate might result in a promising natural immune response with a possibility of CD4+ T-cell early priming.

Improvement of High-Availability Seamless Redundancy (HSR) Traffic Performance for Smart Grid Communications

  • Nsaif, Saad Allawi;Rhee, Jong Myung
    • Journal of Communications and Networks
    • /
    • 제14권6호
    • /
    • pp.653-661
    • /
    • 2012
  • High-availability seamless redundancy (HSR) is a redundancy protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy will pass through separate physical paths, pursuing zero fault recovery time. This means that even in the case of a node or a link failure, there is no stoppage of network operations whatsoever. HSR is a potential candidate for the communications of a smart grid, but its main drawback is the unnecessary traffic created due to the duplicated copies of each sent frame, which are generated and circulated inside the network. This downside will degrade network performance and might cause network congestion or even stoppage. In this paper, we present two approaches to solve the above-mentioned problem. The first approach is called quick removing (QR), and is suited to ring or connected ring topologies. The idea is to remove the duplicated frame copies from the network when all the nodes have received one copy of the sent frame and begin to receive the second copy. Therefore, the forwarding of those frame copies until they reach the source node, as occurs in standard HSR, is not needed in QR. Our example shows a traffic reduction of 37.5%compared to the standard HSR protocol. The second approach is called the virtual ring (VRing), which divides any closed-loop HSR network into several VRings. Each VRing will circulate the traffic of a corresponding group of nodes within it. Therefore, the traffic in that group will not affect any of the other network links or nodes, which results in an enhancement of traffic performance. For our sample network, the VRing approach shows a network traffic reduction in the range of 67.7 to 48.4%in a healthy network case and 89.7 to 44.8%in a faulty network case, compared to standard HSR.

Study on the efficient consensus process of PBFT

  • Min, Youn-A
    • 한국컴퓨터정보학회논문지
    • /
    • 제25권4호
    • /
    • pp.47-53
    • /
    • 2020
  • 블록체인은 분산 네트워크에 연결된 노드 간 검증과 합의를 통하여 정보를 투명하게 관리하는 분산공유원장이다. 최근에 프라이빗 블록체인을 기반으로 허가된 기관 간 데이터 관리 사례가 증가하고 있다. 본 논문에서는 프라이빗 블록체인의 대표적 합의 알고리즘인 PBFT(Practical Byzantine Fault Tolerance)의 적용 사례 및 기술적 처리과정을 조사하고 PBFT 처리 시 발생하는 중복된 검증과 합의과정을 간소화 하여 효율적인 합의가 가능하도록 수정된 PBFT 알고리즘을 제안하였다. 본 논문에서 제안한 알고리즘은 권위 있는 노드를 통한 위임노드 선출과정을 거치며 후보노드 대상 효율적인 재선출 알고리즘을 고려하여 위임노드선출과정의 안전성을 높일 수 있기 때문에 전반적으로 합의과정의 네트워크 통신비용에 대한 부담을 줄이고 노드 간 최종 합의과정을 빠르게 처리할 수 있다.

Code Combining Cooperative Diversity in Long-haul Transmission of Cluster based Wireless Sensor Networks

  • Asaduzzaman, Asaduzzaman;Kong, Hyung-Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권7호
    • /
    • pp.1293-1310
    • /
    • 2011
  • A simple modification of well known Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is proposed to exploit cooperative diversity. Instead of selecting a single cluster-head, we propose M cluster-heads in each cluster to obtain a diversity of order M. The cluster-heads gather data from all the sensor nodes within the cluster using same technique as LEACH. Cluster-heads transmit gathered data cooperatively towards the destination or higher order cluster-head. We propose a code combining based cooperative diversity protocol which is similar to coded cooperation that maximizes the performance of the proposed cooperative LEACH protocol. The implementation of the proposed cooperative strategy is analyzed. We develop the upper bounds on bit error rate (BER) and frame error rate (FER) for our proposal. Space time block codes (STBC) are also a suitable candidate for our proposal. In this paper, we argue that the STBC performs worse than the code combining cooperation.

ATM 망에서의 가상경로 설계 (Virtual path design in ATM network)

  • 박구현;신용식
    • 한국통신학회논문지
    • /
    • 제21권4호
    • /
    • pp.939-951
    • /
    • 1996
  • 단일 트래픽 클래스에 대해서 ATM DCS로만 구성되는 초기의 가상경로 설계 연구에서 복수의 트래픽 클래스를 갖으며 각 트래픽 클래스에 대해서는 가상경로 집합이나 양종단이 주어지지 않은 일반 망구조 상황에서의 가상경로망 설계 연구가 요구된다. 본 논문은 복수 트래픽 클래스와 일반 망구조 상황에서의 가상경로망 설계를 위한 모형을 제시한다. 설계 모형은 특별한 형태의 최적화 문제로 표현되는 데 이를 효과적으로 해결하기 위해 최근에 개발된 SQA법[3, 4]을 적용하여 최적 가상경로를 설계한다. 실제 수치예에 대해서 제시한 가상경로망 설계 모형과 해법을 적용하며 그 결과를 소개한다.

  • PDF

작업 스케쥴링 문제 해결을 위한 Branch & Bound 해법의 비교분석 (Heuristic Aspects of the Branch and Bound Procedure for a Job Scheduling Problem)

  • 고석주;이채영
    • 대한산업공학회지
    • /
    • 제18권2호
    • /
    • pp.141-147
    • /
    • 1992
  • This article evaluates the efficiency of three branch-and-bound heuristics for a job scheduling problem that minimizes the sum of absolute deviations of completion times from a common due date. To improve the performance of the branch-and-bound procedure, Algorithm SA is presented for the initial feasible schedule and three heuristics : breadth-first, depth-first and best-first search are investigated depending on the candidate selection procedure. For the three heuristics the CPU time, memory space, and the number of nodes generated are computed and tested with nine small examples (6 ${\leq}$ n ${\leq}$ 4). Medium sized random problems (10 ${\leq}$ n ${\leq}$ 30) are also generated and examined. The computational results are compared and discussed for the three heuristics.

  • PDF

Therapeutic effects of orally administered CJLP55 for atopic dermatitis via the regulation of immune response

  • Hyung, Kyeong Eun;Kim, Soo Jeong;Jang, Ye Won;Lee, Da Kyoung;Hyun, Kee Hyeob;Moon, Byoung Seok;Kim, Bongjoon;Ahn, Heeyoon;Park, So-Young;Sohn, Uy Dong;Park, Eon Sub;Hwang, Kwang Woo
    • The Korean Journal of Physiology and Pharmacology
    • /
    • 제21권3호
    • /
    • pp.335-343
    • /
    • 2017
  • Atopic dermatitis (AD) is an inflammatory skin condition accompanied by symptoms such as edema and hemorrhage. Kimchi is a traditional fermented Korean dish consisting of various probiotics. In this study, the therapeutic effect of Lactobacillus plantarum CJLP55 isolated from Kimchi was studied in AD-induced mice. Orally administered Lactobacillus strain, CJLP55, suppressed AD symptoms and high serum IgE levels. CJLP55 administration reduced the thickness of the epidermis, infiltration of mast cells and eosinophils into the skin lesion, enlargement of axillary lymph nodes, and increase in cell population in axillary lymph nodes. CJLP55 treatment decreased the production of type 2 cytokines, such as interleukin (IL)-4, IL-5, IL-10, IL-12, interferon (IFN)-${\gamma}$, and IL-6,which were stimulated by house dust mite extracts, in the axillary lymph node cells. Orally administered CJLP55 exhibited a therapeutic effect on house dust mite-induced AD in NC/Nga mice after onset of the disease by altering immune cell activation. The Lactobacillus strain, CJLP55, isolated from Kimchi, suppressed AD. Our results suggest its possible use as a potential candidate for management of AD.

Causal Inference Network of Genes Related with Bone Metastasis of Breast Cancer and Osteoblasts Using Causal Bayesian Networks

  • Park, Sung Bae;Chung, Chun Kee;Gonzalez, Efrain;Yoo, Changwon
    • 대한골대사학회지
    • /
    • 제25권4호
    • /
    • pp.251-266
    • /
    • 2018
  • Background: The causal networks among genes that are commonly expressed in osteoblasts and during bone metastasis (BM) of breast cancer (BC) are not well understood. Here, we developed a machine learning method to obtain a plausible causal network of genes that are commonly expressed during BM and in osteoblasts in BC. Methods: We selected BC genes that are commonly expressed during BM and in osteoblasts from the Gene Expression Omnibus database. Bayesian Network Inference with Java Objects (Banjo) was used to obtain the Bayesian network. Genes registered as BC related genes were included as candidate genes in the implementation of Banjo. Next, we obtained the Bayesian structure and assessed the prediction rate for BM, conditional independence among nodes, and causality among nodes. Furthermore, we reported the maximum relative risks (RRs) of combined gene expression of the genes in the model. Results: We mechanistically identified 33 significantly related and plausibly involved genes in the development of BC BM. Further model evaluations showed that 16 genes were enough for a model to be statistically significant in terms of maximum likelihood of the causal Bayesian networks (CBNs) and for correct prediction of BM of BC. Maximum RRs of combined gene expression patterns showed that the expression levels of UBIAD1, HEBP1, BTNL8, TSPO, PSAT1, and ZFP36L2 significantly affected development of BM from BC. Conclusions: The CBN structure can be used as a reasonable inference network for accurately predicting BM in BC.

에드 혹 네트워크에서 최적 경로의 유효성 있는 클러스터링 알고리즘에 관한 연구 (A Study of Optimal path Availability Clustering algorithm in Ad Hoc network)

  • 오영준;이강환
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2012년도 춘계학술대회
    • /
    • pp.278-280
    • /
    • 2012
  • 본 논문에서는 노드의 위치 정보와 유효성 경로에 따라 클러스터링내의 헤드 노드를 선출하는 방법 중 하나로 에너지 효율성을 고려한 ECOPS(Energy Conserving Optimal path Schedule) 알고리즘을 제안한다. 기존 LEACH 알고리즘은 헤드 노드를 선출할 때 노드의 에너지 확률적 분포 함수에 기반 하여 헤드 노드의 주기를 선택적으로 관리하게 된다. 그러나 이 경우 중계노드의 거리 정보 등 상황 정보 인자가 반영되지 않아 위치적으로 또는 중계노드로 적당하지 않은 노드들이 확률분포에 포함되어 헤드노드로 선택 되는 경우가 발생한다. 따라서 본 논문에서는 기존의 LEACH 기반에서 계층적인 클러스터 구조의 토폴로지로부터 헤드 노드를 선택함에 있어 인접한 노드와의 위치상황 정보인자 및 잔존에너지의 상황정보를 이용하는 ECOPS 알고리즘을 제안 한다. 제안된 ECOPS 알고리즘은 헤드 노드 교체 상황에서 후보 헤드노드 중 최적의 효율적인 에너지 보존 경로를 가지는 멤버 노드가 새로운 헤드 노드로 선출됨으로써 전체 노드 수명 및 네트워크의 관리를 향상시키는 것으로 모의실험 결과를 나타내었다.

  • PDF