• The Journal of Pediatrics of Korean Medicine
• /
• v.31 no.1
• /
• pp.1-11
• /
• 2017

Objectives The purpose of this study is to investigate commonly-used-pattern-identifications and to understand herbal medicine treatment for psoriasis based on recent clinical studies. Methods Keyword 'psoriasis' was used to search articles in National Digital Science Library (NDSL), Korean Traditional Knowledge Portal (KTKP), Oriental Medicine Advanced Searching Integrated System (OASIS) and Research Information Sharing Service (RISS). 19 relevant articles were reported between 2006 - 2016, and were obtained and reviewed. Results Among the 19 articles, the most commonly-used-pattern-identifications were 'blood heat pattern'. 'Gunsun-bang', 'Bangpungtongsungsan-gami'. Also, based on the search results, 'Yangdokbaekho-tang' were more frequently prescribed than other herbal medicines, and ingredients such as, Glycyrrhizae Radix (甘草), Saposhnikoviae Radix (防風) and Rehmanniae Radix (生地黃) were used repeatedly in those prescriptions. Conclusions This study showed what pattern identifications there are, and what herbal medicines are often used in clinical treatments. Developing new form of herbal medicines are also going to be possible with further research.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.900-910
• /
• 2014

Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. The computational complexity of multi view video coding increases in proportion to the number of cameras. To reduce computational complexity and maintain the image quality, improved prediction structure and motion estimation method is proposed in this paper. The proposed prediction structure exploits an average distance between the current picture and its reference pictures. The proposed prediction structure divides every GOP into several groups to decide the maximum index of hierarchical B layer and the number of pictures of each B layer. And the proposed motion estimation method uses a hierarchical search strategy. This strategy method consists of modified diamond search pattern, progressive diamond search pattern and modified raster search pattern. Experiment results show that the complexity reduction of the proposed prediction structure and motion estimation method over JMVC (Joint Multiview Video Coding) reference model using hierarchical B pictures of Fraunhofer-HHI and TZ search method can be up to 40~70% while maintaining similar video quality and bit rates.

• Journal of Korea Multimedia Society
• /
• v.8 no.11
• /
• pp.1556-1564
• /
• 2005

Various optimization techniques are deployed in the compilation process of a source program for improving the program's execution speed and reducing the size of the source code. Of the optimization pattern matching techniques, the string pattern matching technique involves finding an optimal pattern that corresponds to the intermediate code. However, it is deemed inefficient due to excessive time required for optimized pattern search. The tree matching pattern technique can result in many redundant comparisons for pattern determination, and there is also the disadvantage of high cost involved in constructing a code tree. The objective of this paper is to propose a table-driven code optimizer using the DFA(Deterministic Finite Automata) optimization table to overcome the shortcomings of existing optimization techniques. Unlike other techniques, this is an efficient method of implementing an optimizer that is constructed with the deterministic automata, which determines the final pattern, refuting the pattern selection cost and expediting the pattern search process.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.991-999
• /
• 2010

In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.670-674
• /
• 1996

In automated search of a design database to support mechanical design, it is necessaryto recognize a shape pattern which represents a design object. This paper introduces the concept of a surface relation graph (SRG) for recognizing shape patterns from a 3D boundary representation scheme of a solid model(a B-rep model). In SRG, the nodes and arcs correspond to the faces and edges shared by two adjacent faces, respectively. An attribute assigned to an arc is given by an integer which discriminates the relationship between two adjacent faces. The + sign of the integer represents the geometric convexity of the solid, and the -sign the concivity at the shared edge. The input shape is recognized by comparison with the predefined features which are subgraphs of the SRG. A hierarchyof the database for upporting the design is presented. A search for the design database is also discussed. The usefulness of this method is illustrated by some application results.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2003

We introduce a efficient vertical mining algorithm that reduces searching complexity for frequent k-itemsets significantly. This method includes sorting items by their LSI(Least Support Itemsets) similarity and then searching frequent itemsets in tree-based manner. The search tree structure provides several useful heuristics and therefore, reduces search space significantly at early stages. Experimental results on various data sets shows that the proposed algorithm improves searching performance compared to other algorithms, especially for a database having long pattern.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.4
• /
• pp.405-414
• /
• 2016

IC-implementations provide high performance for solving the high computational cost of pattern matching but have relative low flexibility for satisfying different applications. In this paper, we report an associative memory architecture for k nearest neighbor (KNN) search, which is one of the most basic algorithms in pattern matching. The designed architecture features reconfigurable vector-component parallelism enabled by programmable switching circuits between vector components, and a dedicated majority vote circuit. In addition, the main time-consuming part of KNN is solved by a clock mapping concept based weighted frequency dividers that drastically reduce the in principle exponential increase of the worst-case search-clock number with the bit width of vector components to only a linear increase. A test chip in 180 nm CMOS technology, which has 32 rows, 8 parallel 8-bit vector-components in each row, consumes altogether in peak 61.4 mW and only 11.9 mW for nearest squared Euclidean distance search (at 45.58 MHz and 1.8 V).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.5
• /
• pp.1218-1224
• /
• 2008

Located on the upstream of a gene, the promoter region that plays a very important role in the control of gene expression as a signal part has various binding sites for transcription factors. These binding sites are present in various parts of the promoter region and assume an aspect of highly conserved consensus sequence pattern. This paper deals with the introductions of search methods for consensus pattern, including Wataru method, EM algorithm, MEME algorithm, Genetic algorithm and Phylogenetic Footprinting method, and intends to give future prospects of research on this field.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5671-5693
• /
• 2017

With the rapid development of cloud computing, more and more data owners are motivated to outsource their data to cloud for various benefits. Due to serious privacy concerns, sensitive data should be encrypted before being outsourced to the cloud. However, this results that effective data utilization becomes a very challenging task, such as keyword search over ciphertexts. Although many searchable encryption methods have been proposed, they only support exact keyword search. Thus, misspelled keywords in the query will result in wrong or no matching. Very recently, a few methods extends the search capability to fuzzy keyword search. Some of them may result in inaccurate search results. The other methods need very large indexes which inevitably lead to low search efficiency. Additionally, the above fuzzy keyword search methods do not support access control. In our paper, we propose a searchable encryption method which achieves fuzzy search and access control through algorithm design and Ciphertext-Policy Attribute-based Encryption (CP-ABE). In our method, the index is small and the search results are accurate. We present word pattern which can be used to balance the search efficiency and privacy. Finally, we conduct extensive experiments and analyze the security of the proposed method.

• Journal of the Korean Society for Library and Information Science
• /
• v.52 no.3
• /
• pp.289-334
• /
• 2018

Even though information in many languages other than English is quickly increasing, English is still playing the role of the lingua franca and being accounted for the largest proportion on the web. Therefore, it is necessary to investigate the key features and differences between "information searching behavior using mother tongue as a search language" and "information searching behavior using English as a search language" of users who are non-mother tongue speakers of English to acquire more diverse and abundant information. This study conducted the experiment on the web searching which is applied in concurrent think-aloud method to examine the information searching behavior and the cognitive process in Korean search and English search through the twenty-four undergraduate students at a private university in South Korea. Based on the qualitative data, this study applied the frequency analysis to web search pattern under search language. As a result, it is active, aggressive and independent information searching behavior in Korean search, while information searching behavior in English search is passive, submissive and dependent. In Korean search, the main features are the query formulation by extract and combine the terms from various sources such as users, tasks and system, the search range adjustment in diverse level, the smooth filtering of the item selection in search engine results pages, the exploration and comparison of many items and the browsing of the overall contents of web pages. Whereas, in English search, the main features are the query formulation by the terms principally extracted from task, the search range adjustment in limitative level, the item selection by rely on the relevance between the items such as categories or links, the repetitive exploring on same item, the browsing of partial contents of web pages and the frequent use of language support tools like dictionaries or translators.