• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.42
• /
• pp.171-179
• /
• 1997

Genetic Algorithms face an inherent conflict between exploitation and exploration. Exploitation refers to taking advantage of information already obtained in the search. Exploration show that a pattern in bits coupled with another pattern elsewhere in the string is more effective. In this paper shows that the selection method has a major impact on the balance between exploitation and exploration. A more heavy-handed approach seeks to exploit the available information. If decisions must be made quickly, especially those in real-time trading environments, then quicker convergence through exploitation may be more desirable. Also this paper we present some theoretical and empirical the selection method in genetic algorithms for a GA-hard problem.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.3
• /
• pp.405-415
• /
• 2020

With the increase in smartphone user, mobile forensics has become an essential element in modern digital forensic investigation. Mobile messenger data is very important data in mobile forensics because it can acquire information such as user's life pattern and mental state. In order to analyze messenger data, a decryption technique of an encrypted messenger data is required. Since most messengers provide a message deleting function, a technique for recovering deleted messages is required. WeChat Messenger, a messenger used by about 1 billion people around the world, uses IMEI (International Mobile Equipment Identity) information to encrypt data and provides message deletion function. In this paper, we propose a data decryption method in the absence of IMEI information and propose a method for recovering deleted messages using FTS (Full Text Search) database created for full-text search function of SQLite database.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.5
• /
• pp.411-419
• /
• 2013

Research on developing algorithms for building modeling such as extracting outlines of the buildings and segmenting patches of the roofs using aerial images or LiDAR data are active. However, utilizing information from the building model is not well implemented yet. This study aims to propose a scheme for search identical or similar shape of buildings by utilizing graph topology pattern matching under the assumptions: (1) Buildings were modeled beforehand using imagery or LiDAR data, or (2) 3D building data from digital maps are available. Side walls, segmented roofs and footprints were represented as nodes, and relationships among the nodes were defined using graph topology. Topology graph database was generated and pattern matching was performed with buildings of various shapes. The results show that efficiency of the proposed method in terms of reliability of matching and database structure. In addition, flexibility in the search was achieved by altering conditions for the pattern matching. Furthermore, topology graph representation could be used as scale and rotation invariant shape descriptor.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.5
• /
• pp.203-211
• /
• 1996

This paper describes CAD tools for the construction of image database in IC chip analysis CAD system. For IC chip analysis by high-resolution microscopy, the image database is essential to manage more than several thousand images. But manual database construction is error-prone and time-consuming. In order to solve this problem, we develop a set of CAD toos that include image grabber to capture chip images, image editor to make the whole chip image database from the grabbed images, and image divider to reconstruct the database that consists of evenly overlapped images for efficient region search. we also develop an interactive pattern matching method for user-friendly image editing, and a heuristic region search method for fast image division. The tools are developed with a high-performance graphic hardware with JPEG image comparession chip to process the huge color image data. The tools are under the field test and experimental resutls show that the database construction time can be redcued in 1/3 compared to manual database construction.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.941-944
• /
• 2009

In this paper, we present a improved algorithm for thinning vein pattern. The vein image scanned using near infra-red is sliced in the horizontality or verticality direction, and then average value is gained from each slice image. Using curvature value changed from average value, search candidate part and extract vein pattern through re-searched candidate part in overlapping area. For the extracted vein pattern connecting, we proposed a DAL method that verify distance, angle and luminosity on pattern before tracking pattern extracted. The proposed improved thinning method is helpful for accurate connecting of vein pattern more than method used distance material in candidate part.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.143-146
• /
• 2012

Enforcement of private information preservation law the infringement accident which is still caused by despite with private information outflow occurs. The private information outflow avoids finance and to become the fire tube. Analyzes the pattern of private information from search of private information and detection process and the research which it extracts and the research is necessary in about perfection elimination of the private information which is unnecessary. From the research which it sees it researched a pattern extraction research and a complete elimination method in about private information protection and it did the pattern extraction and a complete elimination experiment of private information.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.4
• /
• pp.354-359
• /
• 2013

In this paper, we suggested the method for implementation of unsupervised nonlinear classification using Binary Harmony Search (BHS) algorithm, which is known as a optimization algorithm. Various algorithms have been suggested for classification of feature vectors from the process of machine learning for pattern recognition or EEG signal analysis processing. Supervised learning based support vector machine or fuzzy c-mean (FCM) based on unsupervised learning have been used for classification in the field. However, conventional methods were hard to apply nonlinear dataset classification or required prior information for supervised learning. We solved this problems with proposed classification method using heuristic approach which took the minimal Euclidean distance between vectors, then we assumed them as same class and the others were another class. For the comparison, we used FCM, self-organizing map (SOM) based on artificial neural network (ANN). KEEL machine learning datset was used for simulation. We concluded that proposed method was superior than other algorithms.

• BMB Reports
• /
• v.29 no.1
• /
• pp.38-44
• /
• 1996

Taq DNA polymerase from Thermus aquaticus has been shown to be very useful in the polymerase chain reaction method, which is being used for amplifying DNA. Not only does Taq DNA polymerase have high commercial value commercial value for the polymerase chain reaction application, but it is also important in studying DNA replication, because it is apparently an homologue to E. coli DNA polymerase I, which has long been used for DNA replication study (Lawyer et ai., 1993). The crystal structure determination of Taq DNA polymerase was initiated. An X-ray diffraction pattern breaks down a crystal structure into discrete sine waves in a Fourier series. The original shape of a crystal object in terms of electron density may be represented as the sum of those sine waves with varying amplitudes and phases in three dimensions. The molecular replacement method was initially employed to provide phase information for the structure of Taq DNA polymerase. The rotation search using the program MERLOT resulted in a solution peak with 5.4 r.m.s. PC-refinement of the X-PLOR program verified the result and also optimized the orientation angles. Next, the translation search using the X-PLOR program resulted in a unique solution peak with 7.35 r.m.s. In addition, the translation search indicated $P3_121$ to be the true space group out of two possible ones. The phase information from the molecular replacement was useful in the MIR phasing experiment.

• Fashion & Textile Research Journal
• /
• v.13 no.4
• /
• pp.614-623
• /
• 2011

The purpose of this study is to develop a wedding dress basic torso pattern and sleeve pattern considering good fit and aesthetic for figures of Korean brides in their 20s. For the research method, 3 women in their 20s who has the body size of ${\pm}$ S.D range of average figure and dress form suggested by 'the 5th human body measurement' of Size Korea were selected as the test group. The evaluators are 8 clothing construction majors, and the evaluation items included total 22 questions related to torso and total 10 questions related to sleeves. The evaluation was made using 5 Likert point scale. 4 prototypes for basic dress pattern were selected through the literature search. After compare analyzing design methods of prototypes, the real wedding dresses were made in the average size of women in their 20s and the dresses were tried on for the assessment. The data was analyzed using SPSS 18.0 Program to examine average, standard deviation and significant differences between basic patterns. Based on the results of the first and the second try-on assessments, a new wedding dress basic pattern with maximized strengths of compared prototypes was completed. The details of result follows. As for dress torso basic pattern, A pattern, which had the highest overall silhouette satisfaction and scores in basic pattern analysis and try-on assessments, was selected as the prototype, and a research basic pattern reflecting strengths of each basic pattern was developed. As for dress sleeve basic pattern, B pattern, which had the highest overall silhouette satisfaction and scores in basic pattern analysis and try-on assessments, was selected as the prototype, and a research basic pattern reflecting strengths of each basic pattern was developed. In this study, a wedding dress basic pattern considering good fit and aesthetic for figures of Korean brides in their 20s was suggested. It is expected that the basic pattern will be used by continuously developing dress market and ready-made wedding dress manufacturers as well as in educational institutes.