• Journal of Internet Computing and Services
• /
• v.21 no.1
• /
• pp.79-85
• /
• 2020

Today, to block spam texts on smartphone, a simple string comparison between text messages and spam keywords or a blocking spam phone numbers is used. As results, spam text is sent in a gradually hanged way to prevent if from being automatically blocked. In particular, for words included in spam keywords, spam texts are sent to abnormal words using special characters, Chinese characters, and whitespace to prevent them from being detected by simple string match. There is a limit that traditional spam filtering methods can't block these spam texts well. Therefore, new technologies are needed to respond to changing spam text messages. In this paper, we propose a knowledge graph-based new words detection mechanism that can detect new words frequently used in spam texts and respond to changing spam texts. Also, we show experimental results of the performance when detected Korean new words are applied to the Naive Bayes algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.133-141
• /
• 2014

An efficient method for reducing power consumption in pipelined deep packet inspection systems is proposed. It is based on the observation that the number of memory accesses is dominant for the power consumption and the number of accesses drops drastically as the input goes through stages of the pipelined AC-DFA. A DPI system is implemented where the operating frequency of the stages that are not frequently used in the pipeline is reduced to eliminate the waste of power consumption. The power consumption of the proposed DPI system is measured upon various input character set and up to 25% of reduction of total power consumption is obtained, compared to those of the recent DPI systems. The method can be easily applied to other pipelined architecture and string searching applications.

• Journal of Trauma and Injury
• /
• v.20 no.2
• /
• pp.72-76
• /
• 2007

Purpose: The purpose of this clinical trial was to evaluate the fixation method for treating alveolar fractures in an emergency department. Methods: The efficiency of using the fixation method was judged on the basis of clinical criteria. Stability, occlusion state, bleeding amount after fixation, operation time, and difficulties during procedural operation were recorded. Results: Eight patients were enrolled in this study. In all instances, the fixation method was effective in bleeding control. Each patient had a noticeable decrement in bleeding. A wire was used for four of the eight patients, and nylon strings was used for the others. The average operation time was 6.3 minutes for the wire patients and 2.8 minutes for the Nylon string patients. No specific problem was identified during the procedural operation. However, the difference in the fixation material influenced the effectiveness of the procedure, the operation time, and the satisfaction of the doctor. Conclusion: In the emergency department, the fixation method using wire or nylon string in the treatment of alveolar fractures is effective in bleeding control

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.133-140
• /
• 2011

Recently, Web applications, such as Stock Image and Image Library, are developed to provide the integrated management for user's images. Image hash techniques are used for the image registration, management and retrieval as the identifier and many researches have been performed to raise the hash performance. This paper proposes GLOCAL image hashing method utilizing the hierarchical histogram which based on histogram bin population method. So far, many researches have proven that image hashing techniques based on histogram are robust image processing and geometrical attack. We modified existing image hashing method developed by our research team. The main idea is that it makes more fluent hash string if we have histogram bin of specific length as shown in the body of paper. Finally, we can raise the magnitude of hash string within same context or feature and strengthen the robustness of hash.

• KIISE Transactions on Computing Practices
• /
• v.21 no.2
• /
• pp.138-143
• /
• 2015

The Boyer-Moore algorithm is a single pattern string matching algorithm that is widely used in various applications such as computer and internet security, and bioinformatics. This algorithm is computationally demanding and requires high-performance parallel processing. In this paper, we propose a parallelization and performance optimization methodology for the BM algorithm on a GPU. Our methodology adopts an algorithmic cascading technique. This results in significant reductions in the mapping overheads for the threads participating in the parallel string matching. It also results in the efficient utilization of the multithreading capability of the GPU which improves the load balancing among threads. Our experimental results show that this approach achieves a 45-times speedup at maximum, in comparison with a serial execution.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.26 no.4
• /
• pp.387-396
• /
• 2008

An integration between construction CAD data and GIS data needs geo-referencing processes of construction CAD data whose coordinate systems are their own native or even unknown. Generally, these processes are based on manually detected conjugate-vertices. In this study, we proposed an semi-automated conjugate -vertices detection method for building features between construction CAD data and a digital map using a vertex attributed string matching algorithm. A geo-referencing function for construction CAD data based on the similarity transform could be derived with those conjugate-vertices. Using our proposed method, we overlaid geo-referenced CAD data to a digital map of the College of Engineering, Seoul National University and evaluated our method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.255-259
• /
• 2005

To search a pattern P in a text, such index data structures as suffix trees and suffix arrays are widely used in diverse applications of string processing and computational biology. It is well known that searching in suffix trees is faster than suffix ways in the aspect of time complexity, i.e., it takes O(${\mid}P{\mid}$) time to search P on a constant-size alphabet in a suffix tree while it takes O(${\mid}P{\mid}+logn$) time in a suffix way where n is the length of the text. In this paper we present a linear-tim8 search algorithm in suffix arrays for constant-size alphabets. For a gene.al alphabet $\Sigma$, it takes O(${\mid}P{\mid}log{\mid}{\Sigma}{\mid}$) time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7C
• /
• pp.627-636
• /
• 2012

Recently, XML is used to describe details of service and contents for various fields such as IPTV and digital broadcast services because of it's high readability and extensibility. TV-Anytime's schema and delivery protocol have been especially adopted as basic standards for them, and extended to include their own private functions. However, XML describes documents using text-based method, and this causes to create big documents rather than traditional methods. Therefore, many encoding algorithms have been proposed to reduce XML documents like EXI, BiM, GZIP and fast-info set etc. Although these algorithms shows efficient compression effects for XML documents, but they can't avoid fragmentation degradation during encapsulation steep. This paper proposes an efficient encapsulation scheme of TV-Anytime to avoid fragmentation degradation of encoding effect using common string tables.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.181-188
• /
• 2005

Chinese Postman Problem (CPP) is a problem that finds a shortest tour traversing all edges or arcs at least once in a given network. The Chinese Postman Problem on Mixed networks (MCPP) is a Practical generalization of the classical CPP and it has many real-world applications. The MCPP has been shown to be NP-complete. In this paper, we transform a mixed network into a symmetric network using virtual arcs that are shortest paths by Floyd's algorithm. With the transformed network, we propose a Genetic Algorithm (GA) that converges to a near optimal solution quickly by a multi-directional search technique. We study the chromosome structure used in the GA and it consists of a path string and an encoding string. An encoding method, a decoding method, and some genetic operators that are needed when the MCPP is solved using the Proposed GA are studied. . In addition, two scaling methods are used in proposed GA. We compare the performance of the GA with an existing Modified MDXED2 algorithm (Pearn et al. , 1995) In the simulation results, the proposed method is better than the existing methods in case the network has many edges, the Power Law scaling method is better than the Logarithmic scaling method.

• The Korean Journal of Malacology
• /
• v.31 no.2
• /
• pp.113-121
• /
• 2015

Gametogenesis, mating behaviour and spawning of Octopus ocellatus were investigated by histological study. This species is dioecious, and showed a protandry phenomenon. Ooogenesis (in females) and spermatogenesis (in males) can be classified into 3 stages, respectively. O. ocellatus copulates in one of two ways: a male may leap upon a female, mounting her mantle, or a male may sit near the female and extend the hectocotylized third right arm toward her. Spawning occurred between April and June in females, and between March and May in males of O. ocellatus. The spawning period was once a year and the peak took place between May and June. A number of flatened follicle cells, which were attached to an oocyte, were involved in vitellogenesis in the cytoplasm of the vitellogenic oocyte (maturing oocyte), and formation of chorion membrane (secondary egg membrane) of the ovarian eggs. Fecundity per female closely related to GSI was 294-660 eggs (average, 429 eggs). The diameters of the ovarian eggs surrounded by chorion membrane were approximately in the range of 10.10-2.50 mm. Each ovarian egg laid by a female was connected to an egg string. Each egg string was 1-5.5 cm (average 3.6 cm). The total number of eggs laid by a female of this species ranged 218-314, the egg sizes were independent to the size of female adult. this species has a life mode showing some special reproductive characteristics of an annual semelparity as shown in Octopodidae species because we have never seen a female spawning a second time.