• Korean Journal Plant Pathology
• /
• v.1 no.3
• /
• pp.199-206
• /
• 1985

Viroids are the smallest. well-characterized infectious agents presently known. and so far viroids have been found only in higher plants. The structures of viroid-molecules are single-stranded, covalently closed circular RNA molecules with a range of 240 to 380 nucleotides according to the various viroids. Viroids are remarkable not only as a new category of pathogen, which cause economically important diseases, but also as an excellent model system for biochemical and biophysical investigations because of their small size, relative stability and their self-replication. Four different patato spindle tuber viroid isolates, which express the different symptoms on the same host plant exchange only 2 to 6 nucleotides in the total number of 359 nucleotides, but now the mechanism of viroid pathogenicity is not explained fully. Viroid-melecules are replicated without any special viroid-associated proteins, and during the process of viroid replication oligomeric viroid-associated RNAs are detected at nuclei of viroid infected leaf tissue. The mechanism of viroid replication can now be illustrated according to a possible explanation of rolling-circle system. Although the rapid progress have been made in elucidation of the biochemical and biophysical properties of PSTV and other viroids, the mechanism of viroid replication and pathogenicity is less known and is still a matter of speculation. When these problems can be sufficiently explained, the viroid molecule could play an important role as an available vector in plant genetic engineering.

• Journal of Microbiology and Biotechnology
• /
• v.28 no.12
• /
• pp.2133-2140
• /
• 2018

Norovirus is the most common cause of acute gastroenteritis. Its pathogenesis is poorly understood owing to the difficulty of establishing viral infection in animal models. Here, post-weaning gnotobiotic pigs were infected with human norovirus genogroup II genotype 4 (HuNoV GII.4) to investigate the pathogenesis and replication of the virus. Three groups of four pigs were infected with $1{\times}10^5$, $1{\times}10^6$, or $1{\times}10^7$ genomic equivalent (GE) copies of HuNoV GII.4. Four pigs were used as negative controls. Blood and rectal swab samples were collected after viral infection, and gross legions were examined after necropsy. Diarrhea was induced in 25% and 75% of pigs infected with $1{\times}10^6$ and $1{\times}10^7$ GE copies, respectively. Viral shedding was detected in 50%, 75%, and 50% of pigs infected with $1{\times}10^5$, $1{\times}10^6$, and $1{\times}10^7$ GE copies, respectively. Viremia was detected in 25% of pigs infected with either $1{\times}10^6$ or $1{\times}10^7$ GE copies. When gross lesions of gastroenteritis were investigated, the ileum walls of the infected pigs were thinner than those of the controls. Villi atrophy and inflammatory cell infiltration were identified in the ileum of each infected pig. Viral capsid was identified in the jejunum, ileum, colon, spleen, and mesenteric lymph node. Virus replication was newly verified in the spleen and mesenteric lymph nodes by detection of negative-sense viral RNA. In conclusion, HuNoV GII.4 could induce acute gastroenteritis and replicate in the extra-intestinal lymphoid tissues in post-weaning gnotobiotic pigs. Therefore, such pigs would be a suitable animal model for studying the pathogenesis and replication of HuNoV.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3689-3700
• /
• 2016

It is not practically feasible to apply hardware-based fault-tolerant schemes, such as hardware replication, in mobile devices. Therefore, software-based fault-tolerance techniques, such as checkpoint and rollback schemes, are required. In checkpoint and rollback schemes, the optimal checkpoint interval should be applied to obtain the best performance. Most previous studies focused on minimizing the expected execution time or response time for completing a given task. Currently, most mobile applications run in real-time environments. Therefore, it is extremely essential for mobile devices to employ optimal checkpoint intervals as determined by the real-time constraints of tasks. In this study, we tackle the problem of determining the optimal inter-checkpoint interval of checkpoint and rollback schemes to maximize the deadline meet ratio in real-time systems and to build a probabilistic cost model. From this cost model, we can numerically find the optimal checkpoint interval using mathematical tools. The performance of the proposed solution is evaluated using analytical estimates.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2015.05a
• /
• pp.488-488
• /
• 2015

Intermittent streamflow is common phenomenon in arid and semi-arid regions. To manage water resources of intermittent streamflows, stochactic simulation data is essential; however the seasonally stochastic modeling for intermittent streamflow is a difficult task. In this study, using the periodic Markov chain model, we simulate intermittent monthly streamflow for occurrence and the periodic gamma autoregressive and copula models for amount. The copula models were tested in a previous study for the simulation of yearly streamflow, resulting in successful replication of the key and operational statistics of historical data; however, the copula models have never been tested on a monthly time scale. The intermittent models were applied to the Colorado River system in the present study. A few drawbacks of the PGAR model were identified, such as significant underestimation of minimum values on an aggregated yearly time scale and restrictions of the parameter boundaries. Conversely, the copula models do not present such drawbacks but show feasible reproduction of key and operational statistics. We concluded that the periodic Markov chain based the copula models is a practicable method to simulate intermittent monthly streamflow time series.

• BMB Reports
• /
• v.55 no.12
• /
• pp.615-620
• /
• 2022

The murine leukemia virus-based semi-retroviral replicating vectors (MuLV-based sRRV) had been developed to improve safety and transgene capacity for cancer gene therapy. However, despite the apparent advantages of the sRRV, improvements in the in vivo transduction efficiency are still required to deliver therapeutic genes efficiently for clinical use. In this study, we established a gibbon ape leukemia virus (GaLV) envelope-pseudotyped semi-replication-competent retrovirus vector system (spRRV) which is composed of two transcomplementing replication-defective retroviral vectors termed MuLV-Gag-Pol and GaLV-Env. We found that the spRRV shows considerable improvement in efficiencies of gene transfer and spreading in both human glioblastoma cells and pre-established human glioblastoma mouse model compared with an sRRV system. When treated with ganciclovir after intratumoral injection of each vector system into pre-established U-87 MG glioblastomas, the group of mice injected with spRRV expressing the herpes simplex virus type 1-thymidine kinase (HSV1-tk) gene showed a survival rate of 100% for more than 150 days, but all control groups of mice (HSV1-tk/PBS-treated and GFP/GCV-treated groups) died within 45 days after tumor injection. In conclusion, these findings sug-gest that intratumoral delivery of the HSV1-tk gene by the spRRV system is worthy of development in clinical trials for the treatment of malignant solid tumors.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.791-802
• /
• 1996

In this paper, we discuss a distributed shared memory management scheme based on multi-threaded programming model for a large-scale loosely coupled multiprocessor system. The scheme covers three major issues in the distribued shared memory;the address translation table management, the block coherence maintenance, and the block placement policy. The scheme efficiently resolves the general problems occurred in the distributed shared memory such as a false sharing, an unnecessary replication, a block bouncing, and an address aliasing phenomenon. It also provides the application transparency, good scalability, easy implementation, and multithreaded programming model to users.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.135-141
• /
• 2009

A variety of statistical methods are applied to model and optimize responses, related to product or system's quality, in terms of control and noise factors at design and manufacturing stages. Most of them assume continuous response variables but, assessing the performance of a product or system often involves categorical observations, such as ratings and scores. Although most previous works to deal with the categorical data provide sorhisticated response models and ensure unbiased outcomes, they require heavy computation to estimate the model parameters, as well as enough replications. In this study, we present some practical approaches for optimal parameter design with ordered categorical response when only a few or no replication is available. Two real-life examples are given to illustrate the presented methods.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.181-185
• /
• 2004

In these days, many reports noticed that the Internet worms spread out and have done considerable damage to all over the world network within a few days. The worms, which is infected from various route such as e-mail, can spread very fast with common property, self replication. But, there is not prepare for the way effectively to interrupt internet worm. Therefore, to prevent our network resource, internet hosts and user clients, the systemic categorization and automatic defense mechanism is required in the Internet worm research. Hence, in this paper, we describe internet worm propagation and defense model.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.5
• /
• pp.1-7
• /
• 2012

In this paper, we design and implement the simulator for WAN storage replication model performance evaluation in cloud computing environment. Each cloud of simulator is composed of virtual machine emulator and storage emulator. The virtual machine emulator is composed of read/write ratio module, the read/write sequence combination module, and the read/write request module. The storage emulator is composed of storage management module, data transfer module, read/write operations module, and overhead processing module. Using the simulator, we evaluate performance of migration scheme, pre-copy and the post-copy, considering about read/write ratio, network delay, and network bandwidth. Through simulation, we have confirmed that the average migration time of pre-copy was decreased proportional to the read operation. However, average migration time of post-copy was on the increase. Also, the average migration time of post-copy was increased proportional to the network delay. However, average migration time of pre-copy was shown uniformly. Therefore, we show that pre-copy model more effective to reduce the average migration time than the post-copy model. The average migration time of pre-copy and post-copy were not affected by the change of network bandwidth. Therefore, these results show that selects the storage replication model to be, the network bandwidth know not being the important element.

• The KIPS Transactions:PartA
• /
• v.11A no.6
• /
• pp.459-468
• /
• 2004

Sharing XML trees on mobile devices has become more and more popular. Optimistic replication of XML trees for mobile devices raises the need for reconciliation of concurrently modified data. Especially for reconciling the modified tree structures, we have to compare trees by node mapping which takes O($n^2$) time. Also, using semantic based conflict resolving policy is often discussed in the literature. In this research, we focused on an efficient reconciliation method for mobile environments, using edit scripts of XML data sent from each device. To get a simple model for mobile devices, we use the XML list data sharing model, which allows inserting/deleting subtrees only for the repetitive parts of the tree, based on the document type. Also, we use keys for repetitive part subtrees, keys are unique between nodes with a same parent. This model not only guarantees that the edit action always results a valid tree but also allows a linear time reconciliation algorithm due to key based list reconciliation. The algorithm proposed in this paper takes linear time to the length of edit scripts, if we can assume that there is no insertion key conflict. Since the previous methods take a linear time to the size of the tree, the proposed method is expected to provide a more efficient reconciliation model in the mobile environment.