• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.4
• /
• pp.322-331
• /
• 1988

In this thesis, an active RC filter using high order inverse chebyshev function is designed and the design method for cascading blocks with low sensitivity and maximum dynamic range is discussed. To have maximum dynamic range, we have proposed the simple algorithm with a pole-zero pairing, the cascading sequence by flatness matrix and optimum gain distribution for a given transfer function. And 2nd order Block is designed with negative feedback to improve the sensitivity problem which had a defect at active RC circuits. Using the suggested method, we have designed the active RC low pass filter of the normalized 7th order inverse chebyshev function, as a results, we have shown that this accord with the given specification.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.7
• /
• pp.99-108
• /
• 2010

For effective maintenance for web applications, it is necessary to improve the readability of the source pages. Though CSS(Cascading Style Sheet) belongs to pure presentation layer in various web constituent entities, CSS codes are often used by inlning and they are sometimes automatically generated by web development tools. The existing studies on CSS optimization have only focused on reducing the size of codes and they did not incorporate the readability or the reusability. In this paper, CSS codes are structured and several criteria for readability are defined to improve the readabilty and reusability. Based on them, the algorithm to improve the readability are proposed. Finally, case study are presented to show the applicability of the proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.278_279
• /
• 2009

Nowaday, many people study about Black-Out. In this paper, I introduce how to calculate the Dangerous Index against Black-Out, and prediction of Distance relay error action on Zone 3. we consider the real data by I-PIU which will be set on the system. The dangerous Index is calculated three index about Cascading. The prediction of Distance relay is considered by other facilities of power system. This two algorithm can be used on the center system, when the system is on danger, also on the normal states for security.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.87-91
• /
• 2005

The cascade-correlation (CC) learning algorithm of Fahlman and Lebiere is one of the most influential constructive algorithm in a neural network. Cascading the hidden neurons results in a network that can represent very strong nonlinearities. Although this power is in principle useful, it can be a disadvantage if such strong nonlinearity is not required to solve the problem. 3 models are presented and compared empirically. All of them are based on valiants of the cascade architecture and output neurons weights training of the CC algorithm. Empirical results indicate the followings： (1) In the pattern classification, the model that train only new hidden neuron to output layer connection weights shows the best predictive ability; (2) In the function approximation, the model that removed input-output connection and used sigmoid-linear activation function is better predictability than CasCor algorithm.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.9
• /
• pp.591-599
• /
• 1988

After the short-term dynamics due to the major disturbance are over, the power system may lead to viability crisis state wherein there is possibility of cascading damage. This paper presents an emergency control algorithm to alleviate the obstacles of system frequency or bus voltage during the viability crisis state. The algorithm considers the effects of controlling reactive power sources for load shedding and generation reallocation in order to alleviate the obstacles. The problem is decomposed into a subproblem I and a subproblem II. The former minimizes system frequency deviation from nominal value and the latter voltage violation of load buses. The optimization problem is solved by a reduced gradient technique which can handle a great number of inequality constraints more easily. It has been verified that the use of the proposed algorithm for IEEE 14 bus system alleviates the obstacles efficiently during the viability crisis.

• The Journal of Natural Sciences
• /
• v.7
• /
• pp.27-35
• /
• 1995

This paper introduces a VLSI (Very Large Scale Integrated Circuit) implementation of the 2-D Discrete Cosine Transform (DCT) with an application to image and video coding. This implementation, which is based upon a state space model, uses both algorithm and data partitioning to achieve high efficiency. With this implementation, the amount of data transfers between the processing elements (PEs) are reduced and all the data transfers are limitted to be local. This system accepts the input as a progressively scanned data stream which reduces the hardware required for the input data control module. With proper ordering of computations, a matrix transposition between two matrix by matrix multiplications, which is required in many 2-D DCT systems based upon a row-column decomposition, can be also removed. The new implementation scheme makes it feasible to implement a single 2-D DCT VLSI chip which can be easily expanded for a larger 2-D DCT by cascading these chips.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.503-510
• /
• 2005

With the increasing importance of network protection from cyber threats, it is requested to develop a multi-gigabit rate pattern matching method for protecting against malicious attacks in high-speed network. This paper devises a high-speed pattern matching algorithm with TCAM by using an m-byte jumping window pattern matching scheme. The proposed algorithm significantly reduces the number of TCAM lookups per payload by m times with the marginally enlarged TCAM size which can be implemented by cascading multiple TCAMs. Due to the reduced number of TCAM lookups, we can easily achieve multi-gigabit rate for scanning the packet payload. It is shown by simulation that for the Snort nile with 2,247 patterns, our proposed algorithm supports more than 10 Gbps rate with a 9Mbit TCAM.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.123-134
• /
• 2000

This paper addresses a new triangulation method for constructing surface model from a set of wire-frame contours. The most important problem of contour triangulation is the branching problem, and we provide a new solution for the double branching problem, which occurs frequently in real data. The multiple branching problem is treated as a set of double branchings and an algorithm based on contour merging is developed. Our double branching algorithm is based on partitioning of root contour by Toussiant's polygon triangulation algorithml[14]. Our double branching algorithm produces quite natural surface model even if the branch contours are very complicate in shape. We treat the multiple branching problem as a problem of coarse section sampling in z-direction, and provide a new multiple branching algorithm which iteratively merge a pair of branch contours using imaginary interpolating contours. Our method is a natural and systematic solution for the general branching problem of contour triangulation. The result shows that our method works well even though there are many complicated branches in the object.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.35 no.3
• /
• pp.175-182
• /
• 2022

In many engineering problems, the dynamic substructuring can be useful to analyze complex structures which made with many substructures, such as aircrafts and automotive vehicles. It was originally intended as a method to simplify the engineering problem. The powerful advantage to this is that computational efficiency dramatically increases with eliminating unnecessary degrees-of-freedom of the system and the system targets are concurrently satisfied. Craig-Bampton method has been widely used for the linear system reduction. Recently, multi-level optimization (such as target cascading), which propagates the system-level targets to the subsystem-level targets, has been widely utilized. To this concept, the genetic algorithm which one of the global optimization technique has been utilized to the substructure optimization. The number of internal modes for each substructure can be obtained by the genetic algorithm. Simultaneously, the reduced system meets the top-level targets. In this paper, various numerical examples are tested to verify this concept.