• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1126-1135
• /
• 2014

In recent years, RDF partitioning schemes have been studied for the effective distributed storage and management of large-scale RDF data. In this paper, we propose an RDF dynamic partitioning scheme to support load balancing in dynamic environments where the RDF data is continuously inserted and updated. The proposed scheme creates clusters and sub-clusters according to the frequency of the RDF data used by queries to set graph partitioning criteria. We partition the created clusters and sub-clusters by considering the workloads and data sizes for the servers. Therefore, we resolve the data concentration of a specific server, resulting from the continuous insertion and update of the RDF data, in such a way that the load is distributed among servers in dynamic environments. It is shown through performance evaluation that the proposed scheme significantly improves the query processing time over the existing scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5B
• /
• pp.520-530
• /
• 2004

A multidatabase system (MDBS) is designed to provide universal access to distributed data across multiple autonomous, heterogeneous local database systems (LDBSs). In this paper, we propose a global concurrency control (GCC) algorithm in MDBS. The proposed GCC algorithm adopts the idea of message ordering in group communication messaging system. A necessary condition of GCC algorithm is that global transactions are serialized in the same order at all LDBSs that they execute. n all operations of a transaction are bundled in a single message and the message arrives at LDBSs in the same order using message ordering property, each LDBS can perform subtransactions in the same order. As a result, message ordering allows to determine easily the relative serialization order of global transactions, and then it can support a local autonomy without any information about the serialization order of transactions executing locally.

• Research in Plant Disease
• /
• v.24 no.2
• /
• pp.170-173
• /
• 2018

Three isolates of Cucumber mosaic virus isolated from Commelina communis plants showing chlorosis and mosaic were collected in Chungju and Chuncheon, Korea. To confirm genetic variation of these three isolates (CMV-Co, CMV-Co2, and CMV-Co3), we performed PCR-RFLP and sequence analysis. Sequences of coat protein genes of CMV-C0, -Co2 and -Co3 were compared with CMV-Fny and showed 96.3%, 96.3%, and 95.9% similarities, respectively. In host reactions, three CMV-Co isolates induced systemic necrosis in Cucurbita pepo unlike CMV-Fny and CMV-Co, CMV-Co2 and CMV-Co3 observed differential symptoms responses in Physalis angulata and Nicotiana rustica. These results indicated that three isolates of CMV isolated from C. communis have genetic and biological variation.

• Journal of Digital Convergence
• /
• v.18 no.3
• /
• pp.189-194
• /
• 2020

Recently, various clustering techniques have been studied to efficiently handle data generated by heterogeneous IoT devices. However, existing clustering techniques are not suitable for mobile IoT devices because they focus on statically dividing networks. This paper proposes a probabilistic deep learning-based dynamic clustering model for collecting and analyzing information on IoT devices using edge networks. The proposed model establishes a subnet by applying the frequency of the attribute values collected probabilistically to deep learning. The established subnets are used to group information extracted from seeds into hierarchical structures and improve the speed and accuracy of dynamic clustering for IoT devices. The performance evaluation results showed that the proposed model had an average 13.8 percent improvement in data processing time compared to the existing model, and the server's overhead was 10.5 percent lower on average than the existing model. The accuracy of extracting IoT information from servers has improved by 8.7% on average from previous models.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.121-128
• /
• 2006

In Mobile IPv6, a handover latency is an important issue. To reduce the handover latency, mipshop working group in IETF has studied the fast handover(FMIPv6) which creates and verifies a new care-of address(NCoA) in advance before a layer 2 handover resulting in reduced handover latency. Even in FMIPv6, the NCoA must be registered in a home agent(HA). This registration still creates a significant amount of delay. To reduce registration latency, we propose a tentative and early binding update(TEBU) scheme that the NCoA is registered in the HA in advance during the layer 2 handover based on FMIPv6. We use cost analysis for the performance evaluation. As a result, we found that the TEBU scheme guarantees lower handover latency than FMIPv6 as much as approximately 21%.

• Research in Plant Disease
• /
• v.12 no.3
• /
• pp.298-302
• /
• 2006

An isolate of Cucumber mosaic virus(CMV), called as Can-CMV, was originally isolated from Canna generalis showing typical streak mosaic foliar symptoms, and its properties were investigated in this study. Whereas all known isolates of CMV could induce symptoms on their systemic hosts(four kinds of Nicotiana spp and a zucchini squash), Can-CMV induced no symptoms on its systemic hosts tested. Replication and movement of the virus on upper leaves as well as inoculated leaves-were confirmed by RT-PCR suggesting that Can-CMV could only infect systemically on N. benthamiana and N. glutinosa. Size of local lesions on the Can-CMV-inoculated leaves of Chenopodium amaranticolor was much smaller than that of Fny-CMV. Whereas Fny-CMV and LS-CMV could induce distinct necrotic local lesions on Vigna unguiculata 2 to 3 days postinoculation(dpi), chlorotic spots symptom was expressed by Can-CMV 4 to 5 dpi. Virus-specific 4 kinds of dsRNAs were isolated from leaves of N. benthamiana infected with Can-CMV, and these dsRNAs corresponded to the viral genomic RNAs and subgenomic RNAs and their patterns were indistinguishable to those of Fny-CMV and LS-CMV. By restriction mapping analysis of 950 bp of RT-PCR amplified products of coat protein gene of the virus as well as by serological analysis of gel diffusion test, Can-CMV belongs to a typical member of CMV subgroup IA. These results suggest that the Can-CMV isolated from C. generalis possesses unique pathological properties to understand further insight into the various interactions between virus and host.

• Research in Plant Disease
• /
• v.14 no.1
• /
• pp.15-20
• /
• 2008

Three isolates of Cucumber mosaic virus (CMV) were isolated from weed hosts showing typical mosaic symptoms, and some properties of the viruses were investigated. CMV isolates, designated as Is-CMV, Jd-CMV and Pla-CMV from Isodon inflexus, Jeffersonia dubia and Phryma leptostachya var. asiatica, respectively, were identified and characterized by biological reaction in several host plants, serological property, dsRNA analysis, reverse transcription-polymerase chain reaction (RT-PCR), restriction fragment-length polymorphism (RFLP). All isolates systemically infected in Nicotiana benthamiana, Cucurbita pepo cv. Black beauty and Cucumis sativus, and did not reveal any differences in these host plants between the isolates. However, remarkable difference in the symptoms was found between the CMVs in Capsicum annuum. Is-CMV induced an asymptomatic symptoms, while Jd-CMV and Pla-CMV produced severe mosaic symptoms in C. annuum plants. In dsRNA analysis, all isolates revealed four major bands with estimated molecular size of 3.4, 3.2, 2.1 and 1.0 kbp. The cDNAs of coat protein gene of the isolates were amplified by RT-PCR using a genus-specific single pair primers that designed to amplify a DNA fragment of approximately ranging from 938 to 966 bp. By restriction mapping analysis using RFLP of the RT-PCR products as well as by serological properties of gel diffusion test, the CMV isolates belong to a typical members of CMV subgroup IA. This is the first report on the occurrence of CMV in the three weed hosts.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.1-14
• /
• 2017

This paper proposes adaptive reference structure decision method to improve the performance of HEVC (High Efficiency Video Coding) encoder. When an event occurs in the input sequence, such as scene change, scene rotation, fade in/out, or light on/off, the proposed algorithm changes the reference structure to improve the inter prediction performance. The proposed algorithm divides GOP (Group Of Pictures) into two sub-groups based on the picture that has such event and decides the reference pictures in the divided sub-groups. Also, this paper proposes fast encoding method which changes the picture type of first encoded picture in the GOP that has such event to CRA (Clean Random Access). With the statistical feature that intra prediction is selected by high probability for the first encoded picture in the GOP carrying such event, the proposed fast encoding method does not operate inter prediction. The experimental result shows that the proposed adaptive reference structure decision method improves the BD-rate 0.3% and reduces encoding time 4.9% on average under the CTC (Common Test Condition) for standardization. In addition, the proposed reference structure decision method with the picture type change reduces the average encoding time 12.2% with 0.11% BD-rate loss.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.235-246
• /
• 2002

While the Internet is suffering from the massive data such as video stream, IP multicast can ease the load of the Internet by enabling one copy of digital information to be received by multiple computers simultaneously. But If multicast is based on UDP, packets are delivered using a best-effort Policy without any reliability, congestion control or flow control. Multicast group members can join or leave a multicast group at will, and multicast uses broadcast mechanism, it's very hard to keep security from unauthorized members. In this paper, we introduce a new reliable multicast protocol TRDMF proper for one-to-many multicast model with reliability, flow control, congestion control and key management.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.285-293
• /
• 2005

Whenever mobile node moves a new domain in multicast environments. Both handoff and join multicast group always occur. These procedures take a much of delay time and lost the packets in flight. Handoff delay is a significant factor fot the QoS of mobile node in mobile environments. In this paper. we propose a new handoff scheme which supports multicast and guarantees a low handoff delay in IPv6. The scheme makes adjacent subnets the member of multicast tree. After that, this eliminates packet loss and reduces the handoff delay time. Simulation shows that the proposed scheme takes a low delay and lower packet loss rate than the remote-subscription scheme.