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

• Structural Engineering and Mechanics
• /
• v.60 no.4
• /
• pp.729-747
• /
• 2016

This study aims to present a novel optimization algorithm known as gravitational search algorithm (GSA) for structural damage detection. An objective function for damage detection is established based on structural vibration data in frequency domain, i.e., natural frequencies and mode shapes. The feasibility and efficiency of the GSA are testified on three different structures, i.e., a beam, a truss and a plate. Results show that the proposed strategy is efficient for determining the locations and the extents of structural damages using the first several modal data of the structure. Multiple damages cases in different types of structures are studied and good identification results can be obtained. The effect of measurement noise on the identification results is investigated.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.6
• /
• pp.35-48
• /
• 1993

In this paper, a hierarchical motion vector estimation algorithm using pyramidal structure is proposed. Using a smaller measurement window at each level of a pyramid than that of the conventional scheme, the proposed algorithm, based on the TSS(three step search), reduces the computational complexity greatly with its performance comparable to that of the TSS. By increasing the number of cnadidate motion vectors which are to be used as the initial search points for motion vector estimation at the next level, the performance improves further. Then the computational complexity of the proposed hierarchical algorithm depends on the number of candidate motion vectors, with its PSNR (peak signal to noise ratio) ranging between those of the TSS and the full search method. The simulation results with two different block sizes and various test sequences are given and its hardware implementation is also sketched.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.4
• /
• pp.93-102
• /
• 1995

This paper introduces a general purpose Associative Processor(AP) which is very efficient for search-oriented applications. The proposed architecture consists of three main functional blocks: Content-Addressable Memory(CAM) arry, row logic, and control section. The proposed AP is a Single-Instruction, Multiple-Data(SIMD) device based on a CAM core and an array of high speed processors. As an application for the proposed hardware, we present a parallel algorithm to solve a global routing problem in the layout process utilizing the processing capabilities of a rudimentary logic and the selective matching and writing capability of CAMs, along with basic algorithms such a minimum(maximum) search, less(greater) than search and parallel arithmetic. We have focused on the simultaneous minimization of the desity of the channels and the wire length by sedking a less crowded channel with shorter wire distance. We present an efficient mapping technique of the problem into the CAM structure. Experimental results on difficult examples, on randomly generated data, and on benchmark problems from MCNC are included.

• Journal of the Korean Institute of Navigation
• /
• v.13 no.2
• /
• pp.75-95
• /
• 1989

The study presents the optimum design of B/C midship structure based on the classification society's Rule. The SUMT (Sequential Unconstrained Minimization Technique), using the Direct Search Methods (Hooke and Jeeves, Simplex) is applied to the solution of this nonlinear optimum design problem with constraints. Through the optimum designs of existing ships(60k, 186k, 220k), the amount 0.45-6.18% in weight of their midship structures are obtained on the viewpoint of minimum weight design.

• KIISE Transactions on Computing Practices
• /
• v.22 no.2
• /
• pp.83-88
• /
• 2016

Subtopic mining is the extraction and ranking of possible subtopics, which disambiguate and specify the search intentions of an input query in terms of relevance, popularity, and diversity. This paper describes the limitations of previous studies on the utilization of web resources, and proposes a subtopic mining method with a two-level hierarchy based on hierarchical search intentions and web resources, in order to overcome these limitations. Considering the characteristics of resources provided by the official subtopic mining task, we extract various second-level subtopics reflecting hierarchical search intentions from web documents, and expand and re-rank them using other provided resources. Terms in subtopics with wider search intentions are used to generate first-level subtopics. Our method performed better than state-of-the-art methods in almost every aspect.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.5
• /
• pp.527-547
• /
• 2009

Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

• Journal of the Korean Society for Library and Information Science
• /
• v.49 no.4
• /
• pp.99-124
• /
• 2015

As the improvement of digital technologies increases the use of images from various fields, the domain of image retrieval has evolved and become a growing topic of research in the Library and Information Science field. The purpose of this study is to identify the knowledge structure of the image retrieval domain by using the author co-citation analysis and author bibliographic coupling as analytical tools in order to understand the domain's past and present. The data set for this study is 245 articles with 8,031 cited articles in the field of image retrieval from 1998 to 2013, from the Web of Science citation database. According to the results of author co-citation analysis for the past of the image retrieval domain, our findings demonstrate that the intellectual structure of image retrieval in the LIS field consists of predominantly user-oriented approaches, but also includes some areas influenced by the CBIR area. More specifically, the user-oriented approach contains six specific areas which include image needs, information seeking, image needs and search behavior, image indexing and access, indexing of image collection, and web image search. On the other hand, for CBIR approaches, it contains feature-based image indexing, shape-based indexing, and IR & CBIR. The recent trends of image retrieval based on the results from author bibliographic coupling analysis show that the domain is expanding to emerging areas of medical images, multimedia, ontology- and tag-based indexing which thus reflects a new paradigm of information environment.

• Nuclear Engineering and Technology
• /
• v.49 no.6
• /
• pp.1250-1258
• /
• 2017

The multigroup transport theory is the basis for many neutronics modules. A significant point of the cross-section (XS) generation procedure is the choice of the energy groups' boundaries in the XS libraries, which must be carefully selected as an unsuitable energy meshing can easily lead to inaccurate results. This decision can require considerable effort and is particularly difficult for the common user, especially if not well-versed in reactor physics. This work investigates a genetic algorithm-based tool which selects an appropriate XS energy structure (ES) specific for the considered problem, to be used for the condensation of a fine multigroup library. The procedure is accelerated by results storage and fitness calculation speedup and can be easily parallelized. The extension is applied to the coupled code SIMMER and tested on the European Sustainable Nuclear Industrial Initiative (ESNII+) Advanced Sodium Technological Reactor for Industrial Demonstration (ASTRID)-like reactor system with different fitness functions. The results show that, when the libraries are condensed based on the ESs suggested by the algorithm, the code actually returns the correct multiplication factor, in both reference and voided conditions. The computational effort reduction obtained by using the condensed library rather than the fine one is assessed and is much higher than the time required for the ES search.

• Earthquakes and Structures
• /
• v.10 no.5
• /
• pp.1067-1087
• /
• 2016

In this paper, a decoupled proportional-integral-derivative (PID) control approach for seismic control of smart structures is presented. First, the state space equation of a structure is transformed into modal coordinates and parameters of the modal PID control are separately designed in a reduced modal space. Then, the feedback gain matrix of the controller is obtained based on the contribution of modal responses to the structural responses. The performance of the controller is investigated to adjust control force of piezoelectric friction dampers (PFDs) in a benchmark base isolated building. In order to tune the modal feedback gain of the controller, a suitable trade-off among the conflicting objectives, i.e., the reduction of maximum modal base displacement and the maximum modal floor acceleration of the smart base isolated structure, as well as the maximum modal control force, is created using a multi-objective cuckoo search (MOCS) algorithm. In terms of reduction of maximum base displacement and story acceleration, numerical simulations show that the proposed method performs better than other reported controllers in the literature. Moreover, simulation results show that the PFDs are able to efficiently dissipate the input excitation energy and reduce the damage energy of the structure. Overall, the proposed control strategy provides a simple strategy to tune the control forces and reduces the number of sensors of the control system to the number of controlled stories.