• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.25 no.3
• /
• pp.44-50
• /
• 2017

This paper proposes arrival scheduling and advisory generation algorithms which can be used in the terminal airspace with Point-Merge procedures. The proposed scheduling algorithm consists of two steps. In the first step, the algorithm computes aircraft schedules at the entrance of the Point-Merge sequencing legs based on First-Come First-Served(FCFS) strategy. Then, in the second step, optimal sequence and schedules of all aircraft at the runway are computed using Multi-Objective Dynamic Programming(MODP) method. Finally, the advisories that have to be provided to the air traffic controllers are generated. To demonstrate the proposed algorithms, the simulation was conducted based on Jeju International Airport environments.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.105-114
• /
• 2003

This paper considers a single facility scheduling problem for the fabrication of components supporting the subsequent assembly into products. Each product consists of two types of components, one is common to all products and the other is unique to itself. The unique components are processed individually and the common components are processed in batches, and a distinct setup is incurred for the production of a batch of common components. Under the so-called “batch availability” environment, we propose an efficient dynamic programming(DP) procedure for the optimal sequencing and batching schedule with minimum total completion times of products in the situation that each product is said to be complete if both common and unique components of the product are finished. Computational results show that the proposed DB procedure is more efficient than the previous work which has considered the same problem as this paper.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1998.10a
• /
• pp.309-313
• /
• 1998

Delay time of receiving and delivery is one of important factors that should be considered in the evaluation of the customer service level of a container terminal. In this study, dispatching rules are tested with the objective of minimizing the service delay time for arriving outside trucks. A dynamic programming model is suggested for a static dispatching problem in which all the truck arrivals are known in advance. In order to overcome the excessive computational time of the dynamic programming technique, several heuristic rules are suggested that can be applied in practices. A simulation study is carried out to test the performances of the heuristic rules.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.431-446
• /
• 1998

In this paper, we consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, we first propose a dynamic programming(DP) algorithm for sequencing jobs processed on a single machine. The algorithm is then extended to handle jobs on parallel-identical machines. Finally, we developed an improved version of the algorithm which generates optimal solutions using much smaller amount of memory space and computing time. Computational results are provided to illustrate the performance of the DP algorithms.

• Journal of Navigation and Port Research
• /
• v.30 no.6 s.112
• /
• pp.457-464
• /
• 2006

Remarshalling operation is one of the operations considered important in an automated container terminal to perform quickly loading operations and delivery operations. It arranges the containers scattered at a verticla yard block in order to reduce the transfer time and the rehandling time of ATC(Automated Transfer Crane)s. This paper deals with the remarshalling planning problem minimizing the weighted operation time. This problem can be decomposed into 2 subproblems, storage space assignment problem and operation sequencing problem Storage space assignment problem decides to where containers are transported in terms of transportation time cost.. With results of a previous subproblem, operation sequence problem determines the ATC operation sequence, which minimizes the dead-heading of ATC This study formulates each subproblem with mixed integer program and dynamic program. To illustrate the proposed model, we propose an instance to explain the process of remarshalling planning.

• Molecules and Cells
• /
• v.44 no.8
• /
• pp.602-612
• /
• 2021

DNA methylation is an important epigenetic mechanism affecting genome structure, gene regulation, and the silencing of transposable elements. Cell- and tissue-specific methylation patterns are critical for differentiation and development in eukaryotes. Dynamic spatiotemporal methylation data in these cells or tissues is, therefore, of great interest. However, the construction of bisulfite sequencing libraries can be challenging if the starting material is limited or the genome size is small, such as in Arabidopsis. Here, we describe detailed methods for the purification of Arabidopsis embryos at all stages, and the construction of comprehensive bisulfite libraries from small quantities of input. We constructed bisulfite libraries by releasing embryos from intact seeds, using a different approach for each developmental stage, and manually picking single-embryo with microcapillaries. From these libraries, reliable Arabidopsis methylome data were collected allowing, on average, 11-fold coverage of the genome using as few as five globular, heart, and torpedo embryos as raw input material without the need for DNA purification step. On the other hand, purified DNA from as few as eight bending torpedo embryos or a single mature embryo is sufficient for library construction when RNase A is treated before DNA extraction. This method can be broadly applied to cells from different tissues or cells from other model organisms. Methylome construction can be achieved using a minimal amount of input material using our method; thereby, it has the potential to increase our understanding of dynamic spatiotemporal methylation patterns in model organisms.

• BMB Reports
• /
• v.55 no.9
• /
• pp.465-471
• /
• 2022

Understanding and monitoring virus-mediated infections has gained importance since the global outbreak of the coronavirus disease 2019 (COVID-19) pandemic. Studies of high-throughput omics-based immune profiling of COVID-19 patients can help manage the current pandemic and future virus-mediated pandemics. Although COVID-19 is being studied since past 2 years, detailed mechanisms of the initial induction of dynamic immune responses or the molecular mechanisms that characterize disease progression remains unclear. This study involved comprehensively collected biospecimens and longitudinal multi-omics data of 300 COVID-19 patients and 120 healthy controls, including whole genome sequencing (WGS), single-cell RNA sequencing combined with T cell receptor (TCR) and B cell receptor (BCR) sequencing (scRNA(+scTCR/BCR)-seq), bulk BCR and TCR sequencing (bulk TCR/BCR-seq), and cytokine profiling. Clinical data were also collected from hospitalized COVID-19 patients, and HLA typing, laboratory characteristics, and COVID-19 viral genome sequencing were performed during the initial diagnosis. The entire set of biospecimens and multi-omics data generated in this project can be accessed by researchers from the National Biobank of Korea with prior approval. This distribution of large-scale multi-omics data of COVID-19 patients can facilitate the understanding of biological crosstalk involved in COVID-19 infection and contribute to the development of potential methodologies for its diagnosis and treatment.

• Journal of Korean Neurosurgical Society
• /
• v.64 no.4
• /
• pp.505-513
• /
• 2021

Objective : The adaptive immune response following subarachnoid hemorrhage (SAH) is not well understood. We evaluated and compared the T cell receptor (TCR) immune repertoire of good-grade and poor-grade SAH patients to elucidate the T cell immunology after ictus. Methods : Peripheral blood from six SAH patients was collected at two different times, admission and at the 7-day follow-up. Composition and variation of the TCR β-chain (TCRB) complimentary determining regions (CDR) 3 repertoire was examined using high-throughput sequencing; the analysis was based on sampling time and disease severity (good vs. poor-grade SAH). Results : Clonality at admission and follow-up were 0.059 (0.037-0.038) and 0.027 (0.014-0.082) (median, 25th-75th percentile). Poor-grade SAH (0.025 [0.011-0.038]) was associated with significantly lower clonality than good-grade SAH (0.095 [0.079-0.101]). Poor-grade SAH patients had higher diversity scores than good-grade SAH patients. CDR length was shorter in good-grade SAH vs. poor-grade SAH. Differences in clonotype distribution were more prominent in TCRBV gene segments than TCRBJ segments. TCRBV19-01/TCRBJ02-04 and TCRBV28-01/TCRBJ02-04 were the most increased and the most decreased V-J pairs in the 7-day follow-up compared to admission in good-grade SAH. The most increased and decreased V-J pairs in poor-grade SAH patients were TCRBV28-01/TCRBJ02-06 and TCRBV30-01/TCRBJ02-04, respectively. Conclusion : The TCRB repertoire is dynamic in nature following SAH. TCRB repertoire may facilitate our understanding of adaptive immune response according to SAH severity.

• Asian-Australasian Journal of Animal Sciences
• /
• v.30 no.7
• /
• pp.957-966
• /
• 2017

Objective: To understand the dynamic structure, function, and influence on nutrient metabolism in hosts, it was crucial to assess the genetic potential of gut microbial community in yaks of different ages. Methods: The denaturing gradient gel electrophoresis (DGGE) profiles and Illumina-based metagenomic sequencing on colon contents of 15 semi-domestic yaks were investigated. Unweighted pairwise grouping method with mathematical averages (UPGMA) clustering and principal component analysis (PCA) were used to analyze the DGGE fingerprint. The Illumina sequences were assembled, predicted to genes and functionally annotated, and then classified by querying protein sequences of the genes against the Kyoto encyclopedia of genes and genomes (KEGG) database. Results: Metagenomic sequencing showed that more than 85% of ribosomal RNA (rRNA) gene sequences belonged to the phylum Firmicutes and Bacteroidetes, indicating that the family Ruminococcaceae (46.5%), Rikenellaceae (11.3%), Lachnospiraceae (10.0%), and Bacteroidaceae (6.3%) were dominant gut microbes. Over 50% of non-rRNA gene sequences represented the metabolic pathways of amino acids (14.4%), proteins (12.3%), sugars (11.9%), nucleotides (6.8%), lipids (1.7%), xenobiotics (1.4%), coenzymes, and vitamins (3.6%). Gene functional classification showed that most of enzyme-coding genes were related to cellulose digestion and amino acids metabolic pathways. Conclusion: Yaks' age had a substantial effect on gut microbial composition. Comparative metagenomics of gut microbiota in 0.5-, 1.5-, and 2.5-year-old yaks revealed that the abundance of the class Clostridia, Bacteroidia, and Lentisphaeria, as well as the phylum Firmicutes, Bacteroidetes, Lentisphaerae, Tenericutes, and Cyanobacteria, varied more greatly during yaks' growth, especially in young animals (0.5 and 1.5 years old). Gut microbes, including Bacteroides, Clostridium, and Lentisphaeria, make a contribution to the energy metabolism and synthesis of amino acid, which are essential to the normal growth of yaks.

• International Journal of Contents
• /
• v.16 no.1
• /
• pp.25-33
• /
• 2020

We develop a simulation method that affords very high variability of virtual pedagogical situations involving many independent plans, still achieves authoring (or implementation) scalability. While each individual plan would be coherently drawn up by an agent for its respective goal, those independently-made plans might be coincidentally intertwined in their execution. The inevitable non-determinism involved in this multi-event plan encompassing pre-planned and unforeseen events is resolved by (multi-phase) dynamic planning and articulated sequencing of events in contrast to static planning and monolithic authoring in conventional narrative systems. Connections between events are dictated by their associated rules and their actual connections are dynamically determined in execution time by current conditions of background-world. This unified connection scheme across pre-planned and unforeseen events allows a multi-plan, multi-agent situation to be coherently planned and executed in a global scale. To further the variability of a situation, the inter-event coupling is made in a fine level of action along with a limited episteme of each agent involved. We confirm analytically the viability of our approach with respect to the situation variability and authoring scalability, and demonstrate its practicality with an implementation of a composite situation.