• Plant Breeding and Biotechnology
• /
• v.6 no.4
• /
• pp.413-425
• /
• 2018

A previous work developed and identified a new omega-5 gliadin deficient wheat line named O-free by crossing Keumkang and Olgeuru, which is nutritionally quite meaningful in that omega-5 gliadin is one of the known wheat allergens. To verify the characteristics of the O-free, we performed RNA sequencing (RNAseq) analysis of the O-free and the two parent lines (Keumkang and Olgeuru). The results of the similarity analysis with the ESTs for gliadins and glutenins showed that the O-free ESTs had no similarity with the omega-5 gliadin sequences but had similarity to other gliadins and glutenins. Furthermore, mapping results between the raw RNAseq data from the O-free and the omega-5 gliadin sequence showed a clear deletion of the N-terminal sequences which are an important signature of omega-5 gliadin. We also designed specific PCR primers that could identify omega-5 gliadin in the genomic DNA. The results showed that no omega-5 gliadin fragments were detected in the O-free. According to these results, we confirmed that the deficiency of omega-5 gliadin in the O-free is not caused by post-transcriptional or post-translational regulations such as epigenetic phenomena but by a simple deletion in the chromosome. Furthermore, we showed that the low-molecular weight glutenin subunit (LMW-GS) gene in the O-free had a single nucleotide polymorphism (SNP) causing a premature stop codon, resulting in a truncated polypeptide. We expect that the O-free line may serve as an excellent source of wheat that could prevail in the hypo-allergen wheat market, which has recently gained interest world-wide.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.558-579
• /
• 2021

The cloud storage provides flexible data storage services for data owners to remotely outsource their data, and reduces data storage operations and management costs for data owners. These outsourced data bring data security concerns to the data owner due to malicious deletion or corruption by the cloud service provider. Data integrity verification is an important way to check outsourced data integrity. However, the existing data verification schemes only consider the case that a verifier launches multiple data verification challenges, and neglect the verification overhead of multiple data verification challenges launched by multiple verifiers at a similar time. In this case, the duplicate data in multiple challenges are verified repeatedly so that verification resources are consumed in vain. We propose a duplicate data verification algorithm based on multiple verifiers and multiple challenges to reduce the verification overhead. The algorithm dynamically schedules the multiple verifiers' challenges based on verification time and the frequent itemsets of duplicate verification data in challenge sets by applying FP-Growth algorithm, and computes the batch proofs of frequent itemsets. Then the challenges are split into two parts, i.e., duplicate data and unique data according to the results of data extraction. Finally, the proofs of duplicate data and unique data are computed and combined to generate a complete proof of every original challenge. Theoretical analysis and experiment evaluation show that the algorithm reduces the verification cost and ensures the correctness of the data integrity verification by flexible batch data verification.

• International Journal of Advanced Culture Technology
• /
• v.8 no.3
• /
• pp.192-197
• /
• 2020

Foreign students in South Korea face important challenges when they try to maintain their health. As a measure of their motivation to actively build skills for overcoming those challenges, we evaluated the 10-item Consumer Health Activation Index (CHAI), testing its feasibility, dimensionality, and reliability. There were no missing data, there was no floor effect, and for the total scores the ceiling effect was trivial (< 2%). Results of the Kaiser-Meyer-Olkin test and Bartlett's test of sphericity indicated that the data were suitable for the detection of structure by factor analysis. The results of parallel analysis and the shape of the scree plot supported a two-factor solution. One factor had 3 items concerning "my doctor" and the other factor had the 7 remaining items. Reliability was high for the 10-item CHAI (alpha = 0.856), for the 3-item subscale (alpha = 0.838), and for the 7-item subscale (alpha = 0.857). Reliability could not be improved by deletion of any items. Use of the CHAI to gather data from these foreign students is feasible, and reliable results can be obtained whether one uses the total score from all 10 items or scores from the proposed 7-item and 3-item subscales.

• Journal of Crop Science and Biotechnology
• /
• v.10 no.4
• /
• pp.237-242
• /
• 2007

Genome duplication(i.e. polyploidy) is a common phenomenon in the evolution of plants. The objective of this study was to achieve a comprehensive understanding of genome duplication for SNP discovery by Thymine/Adenine(TA) cloning for confirmation. Primer pairs were designed from 793 EST contigs expressed in the roots of a supernodulating soybean mutant and screened between 'Pureunkong' and 'Jinpumkong 2' by direct sequencing. Almost 27% of the primer sets were failed to obtain sequence data due to multiple bands on agarose gel or poor quality sequence data from a single band. TA cloning was able to identify duplicate genes and the paralogous sequences were coincident with the nonspecific peaks in direct sequencing. Our study confirmed that heterogeneous products by the co-amplification of a gene family member were the main cause of obtaining multiple bands or poor quality sequence data in direct sequencing. Counts of amplified bands on agarose gel and peaks of sequencing trace suggested that almost 27% of nonrepetitive soybean sequences were present in as many as four copies with an average of 2.33 duplications per segment. Copy numbers would be underestimated because of the presence of long intron between primer binding sites or mutation on priming site. Also, the copy numbers were not accurately estimated due to deletion or tandem duplication in the entire soybean genome.

• Journal of Distribution Science
• /
• v.16 no.8
• /
• pp.15-27
• /
• 2018

Purpose - The purpose of the study is to examine the relationships among the following retail operations variables: retail store operations (i.e., store management, sales personnel, promotion of merchandise), success of assortment planning, firm performance (i.e., market share, overall competitive position, profitability, product quality, consumer satisfaction), and retail buyer's demographics and firm's characteristics. Research design, data, and methodology - After conducting a pilot test, the survey was conducted in Seoul, South Korea. With using the listwise deletion method, 378 usable data sets were analyzed. For data analysis, descriptive statistics, factor analysis, and Structural Equation Modeling (SEM) methods were employed. Results - As evidenced from the path diagram, the relationship between retail store operations and the success of assortment planning is strong and significant. Retail store operations affect firm performance, though at a weaker significance than it affects the success of assortment planning. The relationship between the success of assortment planning and firm performance, is the strongest relationship observed by this research. Conclusions - The findings of this empirical study contribute to the retail/fashion buying/management field by confirming (a) the importance of assortment planning for retail firm performance and (b) the role of store operations for successful assortment planning and firm performance for fashion retailers.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.250-257
• /
• 2003

As the memory access time becomes slower relative to the fast processor speed, most systems use cache memory to reduce the gap. The cache performance has an increasingly large impact on the performance of algorithms. Blocking is the well known method to utilize cache and has shown good results in multiplying matrices and search trees like d-heap. But if we use blocking in the data structures which require rotation during insertion or deletion, the execution time increases as the data movements between blocks are necessary. In this paper, we have proposed the extended pairing heap algorithms using block node and shown by experiments that our structure is superior Also in case of using block node, we use less memory space as the number of pointers decreases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1286-1306
• /
• 2022

Searchable symmetric encryption (SSE) provides a safe and effective solution for retrieving encrypted data on cloud servers. However, the existing SSE schemes mainly focus on single keyword search in single client, which is inefficient for multiple keywords and cannot meet the needs for multiple clients. Considering the above drawbacks, we propose a scheme enabling dynamic multi-client and Boolean query in searchable symmetric encryption for cloud storage system (DMC-SSE). DMC-SSE realizes the fine-grained access control of multi-client in SSE by attribute-based encryption (ABE) and novel access control list (ACL), and supports Boolean query of multiple keywords. In addition, DMC-SSE realizes the full dynamic update of client and file. Compared with the existing multi-client schemes, our scheme has the following advantages: 1) Dynamic. DMC-SSE not only supports the dynamic addition or deletion of multiple clients, but also realizes the dynamic update of files. 2) Non-interactivity. After being authorized, the client can query keywords without the help of the data owner and the data owner can dynamically update client's permissions without requiring the client to stay online. At last, the security analysis and experiments results demonstrate that our scheme is safe and efficient.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.443-452
• /
• 2021

One of the key technologies in edge computing is that it always provides services close to the user by moving data between edge servers according to the user's movements. As such, the movement of data between edge servers is frequent. As IoT technology advances and usage areas expand, the data generated also increases, requiring technology to accurately track and process each data to properly manage the data present in the edge computing environment. Currently, cloud systems do not have data disposal technology based on tracking technology for data movement and distribution in their environment, so users cannot see where it is now, whether it is properly removed or not left in the cloud system if users request it to be deleted. In this paper, we propose a tracking data server to create and manage the movement and distribution of data for each edge server and data stored in the central cloud in an edge computing environment.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.1
• /
• pp.25-30
• /
• 2017

The influence of the data deletion method which is one of anti-forensic techniques is substantial in terms of forensic analysis compared to its simplicity of the act. In academic world, recovery techniques on deleted files have been continuously studied in response to the data deletion method and representatively, the file system-based file recovery technique and file format based recovery technique exist. If there's metadata of deleted file in file system, the file can be easily recovered by using it, but if there's no metadata, the file is recovered by using the signature-based carving technique or the file format based recovery technique has to be applied. At this time, in the file format based recovery technique, the file structure analysis and possible recovery technique should be provided. This paper proposes the page recovery technique on deleted PDF file based on the structural characteristics of PDF file. This technique uses the tag value of page object which constitutes one page of PDF file. Object is extracted by utilizing each tag value as a kind of signature and by analyzing extracted object, the metadata of PDF file is recombined and then it's reconfigured page by page. Recovering by page means that even if deleted PDF file is damaged, even some pages consisting of PDF file can be recovered. Generally, if the file system based file is not recoverable, deleted file is recovered by applying the signature based carving technique. The technique which we proposed in this paper can recover PDF files that are damaged. In the digital forensic perspective, it can be utilized to recover more data than previously.

• Journal of Korea Spatial Information System Society
• /
• v.2 no.1 s.3
• /
• pp.91-107
• /
• 2000

Geographic Information Systems(GISs) generally use a very large amount of spatial data. and are implemented on various software and hardware system. If it is impossible to exchange the spatial data efficiently among the different hardware, software, and operation systems, data sharing will be very difficult and duplicated storage & management of the spatial data will result in a great economic loss. To solve such problems, a national organization established a national standard for GIS and constructed spatial databases at the national level. In Korea, SDTS(Spatial Data Transfer Standard) is selected as a national standard for the common data transfer format. In this paper, we design and implement a SDTS Data Management System which can support display, insertion, update, deletion of SDTS data, extraction and creation of a specified area, error checking and reporting, setting and verification of a SDTS profile through the GUI (Graphic User Interface) environment. Hereafter, as GIS industry is continually activated and a demand for the SDTS data increases, a requirement for analysis and trust of the SDTS data will grow bigger, so the necessity of the SDTS Data Management System developed in this paper will also grow rapidly.