• Fibers and Polymers
• /
• v.4 no.4
• /
• pp.188-194
• /
• 2003

Phase behavior and spinodal phase separation kinetics in binary blends of a random copolymer of vinylidene fluoride and trifluoroethylene (75/25) [P(VDF/TrFE)] and poly(l,4-butylene adipate) (PBA) have been investigated by means of optical microscopic observation and time-resolved light scattering. The blends exhibited a typical lower critical solution temperature (LCST)∼${34}^{\circ}C$ above the melting temperature of the P(VDF/TrFE) crystals over the entire blend composition range. P(VDF/TrFE) and PBA were totally miscible in the temperature gap between the melting point of P(VDF/TrFE) and the LCST. Temperature jump experiments of the 3/7 P(VDF/TrFE)/PBA blend were carried out on a light-scattering apparatus from a single-phase melt state (${180}^{\circ}C$) to a two-phase region (205∼${215}^{\circ}C$). Since the late stage of spinodal decomposition (SD) is prevalent in the 3/7 blend, SD was analyzed using a power law scheme. Self-similarity was preserved well in the late stage of SD in the 3/7 blend.

• Proceedings of the Korea Crystallographic Association Conference
• /
• 2003.05a
• /
• pp.17-17
• /
• 2003

tRNA (m¹ G37) methyltransferase (TrmD) catalyze s the trans for of a methyl group from S-adenosyl-L-methionine (AdoMet) to G/sup 37/ within a subset of bacterial tRNA species, which have a residue G at 36th position. The modified guanosine is adjacent to and 3' of the anticodon and is essential for the maintenance of the correct reading frame during translation. We have determined the first crystal structure of TrmD from Haemophilus influenzae, as a binary complex with either AdoMet or S-adenosyl-L-homocysteine (AdoHcy), as a ternary complex with AdoHcy/phosphate, and as an apo form. The structure indicates that TrmD functions as a dimer (Figure 1). It also suggests the binding mode of G/sup 36/G/sup 37/ in the active site of TrmD and catalytic mechanism. The N-terminal domain has a trefoil knot, in which AdoMet or AdoHcy is bound in a novel, bent conformation. The C-terminal domain shows a structural similarity to DNA binding domain of trp or tot repressor. We propose a plausible model for the TrmD₂-tRNA₂ complex, which provides insights into recognition of the general tRNA structure by TrmD (Figure 2).

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.465-470
• /
• 2002

This paper presents a new model based method for tracking moving object from a moving camera. In the proposed method, binary model is derived from detected object regions and Hausdorff distance between the model and edge image is used as its similarity measure to overcome the target's shape changes. Also, a novel search algorithm and some optimization methods are proposed to enable realtime processing. The experimental results on our test sequences demonstrate the high efficiency and accuracy of our approach.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.18-26
• /
• 2008

The invariance relation existing in the non-negative matrix factorization (NMF) is used for constructing robust image hashes in this work. The image is first re-scaled to a fixed size. Low-pass filtering is performed on the luminance component of the re-sized image to produce a normalized matrix. Entries in the normalized matrix are pseudo-randomly re-arranged under the control of a secret key to generate a secondary image. Non-negative matrix factorization is then performed on the secondary image. As the relation between most pairs of adjacent entries in the NMF's coefficient matrix is basically invariant to ordinary image processing, a coarse quantization scheme is devised to compress the extracted features contained in the coefficient matrix. The obtained binary elements are used to form the image hash after being scrambled based on another key. Similarity between hashes is measured by the Hamming distance. Experimental results show that the proposed scheme is robust against perceptually acceptable modifications to the image such as Gaussian filtering, moderate noise contamination, JPEG compression, re-scaling, and watermark embedding. Hashes of different images have very low collision probability. Tampering to local image areas can be detected by comparing the Hamming distance with a predetermined threshold, indicating the usefulness of the technique in digital forensics.

• Journal of IKEEE
• /
• v.25 no.3
• /
• pp.451-461
• /
• 2021

As various smart devices spread and the damage caused by malicious codes becomes more serious, malicious code detection technology using machine learning technology is attracting attention. However, if the training data of machine learning is constructed based on only the fragmentary characteristics of the code, it is still easy to create variants and new malicious codes that avoid it. To solve such a problem, a research using the function call relationship of malicious code as training data is attracting attention. In particular, it is expected that more advanced malware detection will be possible by measuring the similarity of graphs using GNN. This paper proposes an efficient method to generate a function call graph from binary code to utilize GNN for malware detection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3654-3670
• /
• 2019

This paper proposes an Image Texture Median Filter (ITMF) to analyze and detect Android malware on Drebin datasets. We design a model of "ITMF" combined with Image Processing of Median Filter (MF) to reflect the similarity of the malware binary file block. At the same time, using the MAEVS (Malware Activity Embedding in Vector Space) to reflect the potential dynamic activity of malware. In order to ensure the improvement of the classification accuracy, the above-mentioned features(ITMF feature and MAEVS feature)are studied to train Restricted Boltzmann Machine (RBM) and Back Propagation (BP). The experimental results show that the model has an average accuracy rate of 95.43% with few false alarms. to Android malicious code, which is significantly higher than 95.2% of without ITMF, 93.8% of shallow machine learning model SVM, 94.8% of KNN, 94.6% of ANN.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.260-261
• /
• 2018

MPEG과 VCEG은 차세대 비디오 부호화 표준 기술 개발를 위한 JVET(Joint Video Exploration Team)을 구성하여 현재 비디오 표준화인 HEVC 대비 높은 부호화 효율을 목표로 연구를 진행하며 CfP(Call for Proposal) 단계를 진행 중이다. JVET의 공통 플랫폼인 JEM(Joint Exploration Test Model)은 HEVC의 quad-tree 기반 블록 분할 구조를 대신하여 더 많은 유연성을 제공하는 QTBT(Quad-tree plus binary-tree)가 적용되었다. QTBT는 화면 내 부호화 효율을 높이기 위한 하나의 방법으로 휘도와 색차 신호에 대해 분할된 블록 구조를 지원한다. 이러한 방법은 채널 간 블록 분할 모양이 동일하거나 비슷한 경우에 중복되는 블록 분할 신호가 발생할 수 있는 단점이 있다. 따라서 본 논문에서는 화면 내 부호화에서 채널 간 유사도 비교를 이용하여 적응형 색차 블록 방법을 제안한다. 제안한 방법의 실험 결과로 JEM 6.0과 비교하여 CfE(Call for Evidence) 영상에서 평균 0.28%의 Y BD-rate 감소와 함께 평균 124.5%의 부호화 복잡도 증가를 확인하였다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.1 s.307
• /
• pp.53-66
• /
• 2006

This paper proposes the combined image retrieval system that gives the same relevance as exhaustive search method while its performance can be considerably improved. This system is combined with two different retrieval methods and each gives the same results that full exhaustive search method does. Both of them are two-stage method. One uses condensation of feature vectors, and the other uses binary-tree clustering. These two methods extract the candidate images that always include correct answers at the first stage, and then filter out the incorrect images at the second stage. Inasmuch as these methods use equal algorithm, they can get the same result as full exhaustive search. The first method condenses the dimension of feature vectors, and it uses these condensed feature vectors to compute similarity of query and images in database. It can be found that there is an optimal condensation ratio which minimizes the overall retrieval time. The optimal ratio is applied to first stage of this method. Binary-tree clustering method, searching with recursive 2-means clustering, classifies each cluster dynamically with the same radius. For preserving relevance, its range of query has to be compensated at first stage. After candidate clusters were selected, final results are retrieved by computing similarities again at second stage. The proposed method is combined with above two methods. Because they are not dependent on each other, combined retrieval system can make a remarkable progress in performance.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.2
• /
• pp.305-318
• /
• 2023

The complexity of software products led many manufacturers to stitch open-source software for composing a product. Using open-source help reduce the development cost, but the difference in the different development life cycles makes it difficult to keep the product up-to-date. For this reason, even the patches for known vulnerabilities are not adopted quickly enough, leaving the entire product under threat. Existing studies propose to use binary differentiation techniques to determine if a product is left vulnerable against a particular vulnerability. Despite their effectiveness in finding real-world vulnerabilities, they often fail to locate the evidence of a vulnerability if it is a small function that usually is inlined at compile time. This work presents our tool FunRank which is designed to identify the short functions. Our experiments using synthesized and real-world software products show that FunRank can identify the short, inlined functions that suggest that the program is left vulnerable to a particular vulnerability.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.1
• /
• pp.45-52
• /
• 2015

The interoperability of multi-source data has become more important due to various digital maps, produced from public institutions and enterprises. In this study, the automatic matching algorithm of multi-source building data using hierarchical matching was proposed. At first, we divide digital maps into blocks and perform the primary geometric registration of buildings with the ICP algorithm. Then, corresponding building pairs were determined by evaluating the similarity of overlap area, and the matching threshold value of similarity was automatically derived by the Otsu binary thresholding. After the first matching, we extracted error matching candidates buildings which are similar with threshold value to conduct the secondary ICP matching and to make a matching decision using turning angle function analysis. For the evaluation, the proposed method was applied to representative public digital maps, road name address map and digital topographic map 2.0. As a result, the F measures of matching and non-matching buildings increased by 2% and 17%, respectively. Therefore, the proposed method is efficient for the matching of building polygons from multi-source digital maps.