• Journal of Life Science
• /
• v.32 no.12
• /
• pp.947-955
• /
• 2022

Silkworms, which have recently shown promise as functional health foods, show functional differences between varieties; therefore, the need for variety identification is emerging. In this study, we analyzed the whole silkworm genome to identify 10 unique silkworm varieties (Baekhwang, Baekok, Daebaek, Daebak, Daehwang, Goldensilk, Hansaeng, Joohwang, Kumkang, and Kumok) using single nucleotide polymorphisms (SNP) present in the genome as biomarkers. In addition, nine SNPs were selected to discriminate between varieties by selecting SNPs specific to each variety. We subsequently created a decision tree capable of cross-verifying each variety and classifying the varieties through sequential analysis. Restriction fragment length polymorphism (RFLP) was used for SNP867 and SNP9183 to differentiate between the varieties of Daehwang and Goldensilk and between Kumkang and Daebak, respectively. A tetra-primer amplification refractory (T-ARMS) mutation was used to analyze the remaining SNPs. As a result, we could isolate the same group or select an individual variety using the nine unique SNPs from SNP780 to SNP9183. Furthermore, nucleotide sequence analysis for the region confirmed that the alleles were identical. In conclusion, our results show that combining SNP analysis of the whole silkworm genome with the decision tree is of high value as a discriminative marker for classifying silkworm varieties.

• Journal of Broadcast Engineering
• /
• v.17 no.3
• /
• pp.503-518
• /
• 2012

In this paper, we propose a complexity-based parallelization method of the sample adaptive offset (SAO) algorithm which is one of HEVC in-loop filters. The SAO algorithm can be regarded as region-based process and the regions are obtained and represented with a quad-tree scheme. A offset to minimize a reconstruction error is sent for each partitioned region. The SAO of the HEVC can be parallelized in data-level. However, because the sizes and complexities of the SAO regions are not regular, workload imbalance occurs with multi-core platform. In this paper, we propose a LCU-based SAO algorithm and a complexity prediction algorithm for each LCU. With the proposed complexity-based LCU processing, we found that the proposed algorithm is faster than the sequential implementation by a factor of 2.38 times. In addition, the proposed algorithm is faster than regular parallel implementation SAO by 21%.

• Korean journal of applied entomology
• /
• v.51 no.2
• /
• pp.91-97
• /
• 2012

The dispersion indices, spatial pattern and sampling plan for pink citrus rust mite (PCRM), Aculops pelekassi, monitoring was investigated. Dispersion indices of PCRM indicated the aggregated spatial pattern. Taylor's power law provided better description of variance-mean relationship than Iwao's patchiness regression. Fixed-precision levels (D) of a sequential sampling plan were developed using by Taylor's power law parameters generated from PCRM on fruit sample (cumulated number of PCRM in $cm^2$ of fruit). Based on Kono-Sugino's empirical binomial the mean density per $cm^2$ could be estimated from fruit ratio with more than 12 rust mites per $cm^2$: $ln(m)=4.61+1.23ln[-ln(1-p_{12})]$. To determine the optimal tally threshold, the variance (var(lnm)) for mean (lnm) in Kono-Sugino equation was estimated. The lower and narrow ranged change of variance for esimated mean showed at a tally threshold of 12. To estimate PCRM mean density per $cm^2$ at fixed precision level 0.25, the required sample number was 13 trees, 5 fruits per tree and 2 points per fruit (total 130 samples).

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.7 no.2
• /
• pp.148-155
• /
• 2005

An accurate prediction of blooming date is crucial for many authorities to schedule and organize successful spring flower festivals in Korea. The Korea Meteorological Administration (KMA) has been using regression models combined with a subjective correction by forecasters to issue blooming date forecasts for major cities. Using mean monthly temperature data for February (observed) and March (predicted), they issue blooming date forecasts in late February to early March each year. The method has been proved accurate enough for the purpose of scheduling spring festivals in the relevant cities, but cannot be used in areas where no official climate and phenology data are available. We suggest a thermal time-based two-step phenological model for predicting the blooming dates of spring flowers, which can be applied to any geographic location regardless of data availability. The model consists of two sequential periods: the rest period described by chilling requirement and the forcing period described by heating requirement. It requires daily maximum and minimum temperature as an input and calculates daily chill units until a pre-determined chilling requirement for rest release. After the projected rest release date, it accumulates daily heat units (growing degree days) until a pre- determined heating requirement for flowering. Model parameters were derived from the observed bud-burst and flowering dates of cherry tree (Prunus serrulata var. spontanea) at KMA Seoul station along with daily temperature data for 1923-1950. The model was applied to the 1955-2004 daily temperature data to estimate the cherry blooming dates and the deviations from the observed dates were compared with those predicted by the KMA method. Our model performed better than the KMA method in predicting the cherry blooming dates during the last 50 years (MAE = 2.31 vs. 1.58, RMSE = 2.96 vs. 2.09), showing a strong feasibility of operational application.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.1
• /
• pp.79-85
• /
• 2001

In this paper, we propose a new technology mapping algorithm for CPLD consider area under time constraint(TMFCPLD). This technology mapping algorithm detect feedbacks from boolean networks, then variables that have feedback are replaced to temporary variables. Creating the temporary variables transform sequential circuit to combinational circuit. The transformed circuits are represented to DAG. After traversing all nodes in DAG, the nodes that have output edges more than two are replicated and reconstructed to fanout free tree. This method is for reason to reduce area and improve total run time of circuits by TEMPLA proposed previously. Using time constraints and delay time of device, the number of graph partitionable multi-level is decided. Initial cost of each node are the number of OR-terms that it have. Among mappable clusters, clusters of which the number of multi-level is least is selected, and the graph is partitioned. Several nodes in partitioned clusters are merged by collapsing, and are fitted to the number of OR-terms in a given CLB by bin packing. Proposed algorithm have been applied to MCNC logic synthesis benchmark circuits, and have reduced the number of CLBs by 62.2% than those of DDMAP. And reduced the number of CLBs by 17.6% than those of TEMPLA, and reduced the number of CLBs by 4.7% than those of TMCPLD. This results will give much efficiency to technology mapping for CPLDs.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.268-278
• /
• 2004

In this paper, we describe our experience in the design and implementation of the SMART file system to handle multimedia workload. Our work has three design objectives: (ⅰ) efficient support for sequential workload, (ⅱ) avoiding disk fragmentation, (ⅲ) logical unit based file access. To achieve these three objectives, we develop a file system where a file consists of linked list of Data Unit Group. Instead of tree like structure of the legacy Unix file system, we use single level file structure. Our file system can also access the file based upon the logical unit which can be video frame or audio samples. Data Unit Group is a group of logical data units which is allocated continuous disk blocks. At the beginning of each Data Unit Group, there exists an index array. Each index points to the beginning of logical data units, e.g. frames in the Data Unit Group. This index array enables the random access and sequencial access of semantic data units. SMART file system is elaborately tailored to effectively support multimedia workload. We perform physical experiments and compare the performance of SMART file system with EXT2 file system and SGI XFS file system. In this experiment, SMART file system exhibits superior performance under streaming workload.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.26 no.1
• /
• pp.135-170
• /
• 2015

This study aimed to investigate the transition of academic libraries' jobs by developing a model based on a shift of library generations including Library 1.0, Library 2.0, and Library 3.0 corresponding to the shift of web generations and to explore generational characteristics of library duties as well. The research used three phases of procedure: literature review about different library generations; job analyses for academic libraries in South Korea and the U.S.A.; the Delphi technique in tree sequential order. The research findings were as follows. First of all, there were 170 duties that continued from Library 1.0 to Library 3.0. There were 58 duties which continued from Library 2.0 to Library 3.0 whereas three duties that continued from Library 1.0 to Library 2.0. In addition, three distinctive duties existed only in Library 1.0 whereas one unique duty was only in Library 2.0. Library 3.0 generated 25 new duties. Secondly, considering general characteristics which cover specific parts of individual duties, there was a significant increase in importance, difficulty, and frequency of library administration throughout the three generations. In terms of importance, difficulty, and frequency of collection development and management, there was a significant increase only from Library 2.0 to Library 3.0. Considering information organization, there was a significant decrease in importance from Library 1.0 to Library 2.0. In addition, there was a significant decrease in frequency and there was no significant difference in difficulty throughout the three generations. In the case of information service, while there was a significant increase in importance among three generations, there was a significant increase in difficulty only from Library 1.0 to Library 2.0. However, there was no generational difference in frequency. With the respect of information system development and management, there was a significant increase in importance and frequency throughout the three generations, but there was no significant difference in difficulty among three generations.

• Journal of Korean Society of Forest Science
• /
• v.90 no.1
• /
• pp.64-73
• /
• 2001

Generally potassium in the soil can be remained as water soluble, exchangeable, and available types, respectively. Theses types of potassiums are also known to keep their kinetic relationships to each other. The Purpose on this research was to investigate types and relationships of potassium in the soil, and the characteristics of potassium supply in different forest soils. The results could be summarized as follows; 1. The amounts of available potassium in A and B horizon soils by continuous leaching with 0.01N-HCl were as follows : for A Horizon soils, pohang(Gray brown forest soils), Changsung (Brown forest soils), and Youngwol(Dark red forest soils) were ranged from 0.2me/l00g to 0.8me/100g, Taean(Red and Yellow forest soils) was 0.1-0.6me/100g, Kapyung(Brown forest soils) was 0.2-0.4me/100g. For the B layer, Youngwol was 0.1-0.5me/100g, Pohang, Taean, Kapyung were 0.1-0.4me/100g, Changsung was 0.1-0.3me/100g, respectivly. 2. Of ten times-pulse leaching with 0.01N-HCl for A layer soil, more 80% of total available potassium leaching were recovered by the second pulse as leachate for Pohang, Changsung, Youngwol, while similar amounts of potassium in the leachate were obtained with the third pulse leaching for Kapyung, Taean, respectively, On the other hand, the 80 % release of available potassium from the B layer soil was obtained by the second pulse leaching for all areas investigated. 3. For the relationships between soluble potassium and exchangeable potassium, the exchangeable potassium was increased while the soluble potassium was not changed significantly in B layer. And both soluble potassium and exchangeable potassium in A layer were similar. For the relationship between exchangeable potassium and available potassium in both A and B layers, the amounts of available potassium increased by 1.2 to 1.5 times as the exchangeable potassium increased. 4. For distribution of all types of potassium throughout locations investigated, the types of potassium were in the decreasing orders of available, exchangeable, and soluble. 5. The simplified method for an analysis of all types of potassium by sequential leaching with 0.01N-HCl should be developed not only with respect to time-saving and efficiency but also verification of the relationship between available potassium and tree growth.