• Journal of Plant Biotechnology
• /
• v.46 no.1
• /
• pp.1-8
• /
• 2019

The main goal of this study was to determine the genetic diversity among 36 grape cultivars grown in Palestine by using ISSR-polymerase chain reaction (PCR) fingerprints. Among the tested primers, 17 produced reasonable amplification products with high intensity and pattern stability. A total of 57 DNA fragments (loci) separated by electrophoresis on agarose gels were detected and they ranged in size, from 150 to 900 bp. Out of these fragments, 55 (88%) were polymorphic and 2 (3.5%) monomorphic. Our results also revealed an average of 3.1 loci per primer. A minimum of 1 and maximum of 10 DNA fragments were obtained (S-17, #820 and #841) and (S-31) primers, respectively. Therefore, the later primer (S-31) is considered to be the most powerful primer among the tested ones. The genetic distance matrix showed an average distance range of between 0.05 and 0.76. The maximum genetic distance value of 0.76 (24% similarity) was exhibited between the (Shami and Marawi.Hamadani.Adi) as well as (Bairuti and Marawi.Hamadani.Adi) genotypes. On the other hand, the lowest genetic distance of 0.05 (95% similarity) was exhibited between (Jandali.Tawel.Mofarad and Jandali. Kurawi.Mlzlz) along with (Shami.Aswad and Shami.mtartash. mlwn) genotypes. Furthermore, the UPGMA dendrogram generally clusters the grape cultivars into eight major clusters in addition to an isolated genotype. Based on these figures, the cultivars tested in this study could be characterized by large divergence at the DNA level. This is taking the assumption that our region has a very rich and varied clonal grape genetic structure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.10
• /
• pp.1359-1368
• /
• 2021

Steganography is a science of embedding secret data into innocent data and its goal is to conceal the existence of a carrier data. Many research on Steganography has been proposed by various hiding and detection techniques that are based on different algorithms. On the other hand, very few studies have been conducted to analyze the performance of each Steganography software. This paper describes five different Steganography software, each having its own algorithms, and analyzes the difference of each inherent feature. Image quality metrics of Peak Signal to Noise Ratio (PSNR) and Structural SIMilarity (SSIM) are used to define its performance of each Steganography software. We extracted PSNR and SSIM results of a quantitative amount of embedded output images for those five Steganography software. The results will show the optimal steganography software based on the evaluation metrics and ultimately contribute to forensics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.881-895
• /
• 2023

Modern image inpainting techniques based on deep learning have achieved remarkable performance, and more and more people are working on repairing more complex and larger missing areas, although this is still challenging, especially for facial image inpainting. For a face image with a huge missing area, there are very few valid pixels available; however, people have an ability to imagine the complete picture in their mind according to their subjective will. It is important to simulate this capability while maintaining the identity features of the face as much as possible. To achieve this goal, we propose a three-stage network model, which we refer to as the identity and structure feature refinement network (ISFRNet). ISFRNet is based on 1) a pre-trained pSp-styleGAN model that generates an extremely realistic face image with rich structural features; 2) a shallow structured network with a small receptive field; and 3) a modified U-net with two encoders and a decoder, which has a large receptive field. We choose structural similarity index (SSIM), peak signal-to-noise ratio (PSNR), L1 Loss and learned perceptual image patch similarity (LPIPS) to evaluate our model. When the missing region is 20%-40%, the above four metric scores of our model are 28.12, 0.942, 0.015 and 0.090, respectively. When the lost area is between 40% and 60%, the metric scores are 23.31, 0.840, 0.053 and 0.177, respectively. Our inpainting network not only guarantees excellent face identity feature recovery but also exhibits state-of-the-art performance compared to other multi-stage refinement models.

• Journal of Technology Innovation
• /
• v.18 no.2
• /
• pp.221-252
• /
• 2010

This study presents a concept of technology trade network and management, and proposes a procedural method for optimally selecting the technology transferor when a technology transferee needs to buy a specific technology. We develop a technology trade network where technology supplier, technology marketer, and technology transferee are informatively linked. And a technology trade management consists of three step of estimating technology, trading technology, and commercialization technology. Technology transferees could import the best appropriate technology which they want through these technology network method and cost optimization method. And we hope that these methodologies can be used in selecting new technology. A methodology can be classified into an estimating technology process and a choice of technology supplier process. In an estimating technology process, we calculate the technology similarity quantitatively through developing method of estimating technology which is focused on its technological characteristics. After defining the related cost of technology introduction, we suggest goal programming model to find a solution which can be acceptable both maximizing the technology similarity and minimizing the cost of technology. And suggested model is verified with a supplier selection problem of next generation tanks.

• Journal of Internet Computing and Services
• /
• v.17 no.2
• /
• pp.19-28
• /
• 2016

Internet traffic has been significantly increasing due to the development of information and communication networks and the growing numbers of cell phone users that access networks. This paper connects to this issue by presenting a way to detect and analyze a typical DDoS attack that results in Internet breaches and network attacks, which are on the increase. To achieve this goal, we improve features and GUI of the existing ATMSim analysis package and use it. This package operates on a network flow-based analysis method, which means that normal traffic collected through an internal LAN at the Korean Bible University campus as well as anomaly traffic with DDoS attacks are generated. Self-similarity processes are used to analyze normal and anomaly traffic that are collected and generated from the improved ATMSim. Our numerical results obtained from three Hurst parameter estimate techniques show that there is quantitatively a significant difference between normal traffic and anomaly traffic from a self-similarity perspective.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.26 no.4
• /
• pp.83-104
• /
• 2015

This study intends to provide guidance for library design and assessment by eliciting the emotional vocabulary related to academic library space. In order to accomplish the goal of this study, 12 major emotional vocabularies related to academic library space were derived through 5 stages of extraction and refinement processes. Literature search and analysis of preceding research, focus group interview and survey of academic librarians and users of the academic library, evaluation of similarity through KJ Method, etc., selected 12 adjectives of emotional vocabulary as follows: diverse, satisfactory, necessary, full, clean, stable, appropriate, harmonious, open, warm, natural, and excellent.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.3-16
• /
• 2006

In the age where the Internet changes everything, even the earth has become flat. The boarders between nations, locations, times, and industries are not maningful, and no single company can do the whole process well. Therefore, various types of 'Value network' and 'Relation web' emerge for moving first and fast learning. Bort the relationship maturity model (RMM) proposed and the partnership management initiatives at SKT demonstrate that the concept is important, and that the final goal can be reached only through a series of critical outcome at each phase. In particular, recognizing as core infrastructures various online/offline channels, deep trust, and rich communications is an important finding for a successful relationship management. Also, related literatures suggest the following key factors to be influential in more that two phases: professionalism including expertise, similarity, channel capacity. Based on these findings, future efforts need to be put on the research & development of related measurement and management tools. We do hope more people dance with their partners through these efforts.

• Journal of Korean Society for Geospatial Information Science
• /
• v.13 no.4 s.34
• /
• pp.33-38
• /
• 2005

The goal of this study is to segment building points effectively utilizing scan-line characteristics of airborne laser scanner. Points are classified as to their altitude similarity and adjacency with other classified points, and point searching range for the classification is restricted within some number of scan-lines, preventing classification speed from lowering as the process goes on. Besides, we detected wrong discrimination of one object into more than two classes, then integrated them into a single class. Consequently we could discriminate points of each building from others, its annexes and none building points simultaneously.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2000.11a
• /
• pp.17-20
• /
• 2000

Structural genomics aims to provide a good experimental structure or computational model of every tractable protein in a complete genome. Underlying this goal is the immense value of protein structure, especially in permitting recognition of distant evolutionary relationships for proteins whose sequence analysis has failed to find any significant homolog. A considerable fraction of the genes in all sequenced genomes have no known function, and structure determination provides a direct means of revealing homology that may be used to infer their putative molecular function. The solved structures will be similarly useful for elucidating the biochemical or biophysical role of proteins that have been previously ascribed only phenotypic functions. More generally, knowledge of an increasingly complete repertoire of protein structures will aid structure prediction methods, improve understanding of protein structure, and ultimately lend insight into molecular interactions and pathways. We use computational methods to select families whose structures cannot be predicted and which are likely to be amenable to experimental characterization. Methods to be employed included modern sequence analysis and clustering algorithms. A critical component is consultation of the presage database for structural genomics, which records the community's experimental work underway and computational predictions. The protein families are ranked according to several criteria including taxonomic diversity and known functional information. Individual proteins, often homologs from hyperthermophiles, are selected from these families as targets for structure determination. The solved structures are examined for structural similarity to other proteins of known structure. Homologous proteins in sequence databases are computationally modeled, to provide a resource of protein structure models complementing the experimentally solved protein structures.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.4
• /
• pp.299-303
• /
• 2000

The goal of the information retrieval system is to search the docments which the user wants to obtain in fast and effiecient way. Many information retrieval models, including boolean models, vector models and fuzzy models based on the trasitional fuzzy set theory, have been proposed to achieve these kinds of objectives. However, the previous models have a limitation on the fact that they do not consider the users' preference in the search of documents. In this paper, we proposed a new extenced fuzzy information retrieval System which can handle the shortcomings of the previous ones. In the proposed model, a new similarity measure was applied in order to calculate the degree among documents, which can expliot the users' preference.