• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.242-252
• /
• 2006

Data mining is the exploration and analysis of huge amounts of data to discover meaningful patterns. One of the most important data mining problems is association rule mining. Recent studies of mining association rules have proposed a closure mechanism. It is no longer necessary to mine the set of all of the frequent itemsets and their association rules. Rather, it is sufficient to mine the frequent closed itemsets and their corresponding rules. In the past, a number of algorithms for mining frequent closed itemsets have been based on items. In this paper, we use the transaction itself for mining frequent closed itemsets. An efficient algorithm is proposed that is based on a link structure between transactions. Our experimental results show that our algorithm is faster than previously proposed methods. Furthermore, our approach is significantly more efficient for dense databases.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.63-74
• /
• 1996

Ordering plays an important role in solving an LP problem with sparse matrix by the interior point method. Since ordering is NP-complete, we try to find an efficient method. The objective of this paper is to present an efficient heuristic ordering method for implementation of the minimum deficiency method. Both the ordering method and the data structure play important roles in implementation. First we define a new heuristic pseudo-deficiency ordering method and a data structure for the method-quotient graph and cliqued storage. Next we show an experimental result in terms of time and nonzero numbers by NETLIB problems.

• Journal of Information Display
• /
• v.10 no.2
• /
• pp.87-91
• /
• 2009

Highly efficient red phosphorescent OLEDs (PHOLEDs) with a simple, organic, triple-layer structure was developed using the narrow-bandgap fluorescent host material bis(10-hydroxybenzo[h] quinolinato)beryllium complex (Bebq2) and the deep-red dopant tris(1-phenylisoquinoline)iridium (Ir(piq)3). The maximum current and power efficiency values of 12.71 cd/A and 16.02 lm/W, respectively, with an extremely low doping technology of 1%, are demonstrated herein. The results reveal a practical, cost-saving host dopant system for the fabrication of highly efficient PHOLEDs involving the simple structure presented herein, with a reduction of expensive Ir dopants.

• Korean Journal of Geomatics
• /
• v.4 no.1
• /
• pp.17-22
• /
• 2004

It is very important to manage efficient data for safety and maintenance of those constructs. Estimation for structural safety can be evaluated by using data that surveys various structural durability and safety elements. so, it should be based on synthetic and efficient data that includes a variety of related safety elements obtained from a structure. It will subsequently be managed properly and economically. Accordingly, we will approach efficient maintenance management using a Geographic Information System (GIS) with data from structural-safety diagnosis and a Global Positioning System (GPS). In this study, we noted that by using the data that measures the factors (crack, incline, settlement etc.) of various structures as evaluate safety degree. And the horizontal coordinate variation/time of structure was monitored using the GPS easily.

• Bulletin of the Korean Chemical Society
• /
• v.29 no.5
• /
• pp.1003-1006
• /
• 2008

Highly efficient syntheses of cylindol A (1) and the proposed structure of cylindol B (2) have been accomplished using common synthetic transformations from symmetrical starting materials 7 and 11, respectively. The latter synthesis revealed that the proposed structure of the natural cylindol B was assigned incorrectly. Isomers of 2 such as 15 and 16 were synthesized as a possible candidate of the natural cylindol B. However, their spectral data also did not match that of the natural cylindol B. Therefore, the structure of the natural cylindol B is yet to be resolved.

• International Journal of Internet, Broadcasting and Communication
• /
• v.5 no.1
• /
• pp.14-17
• /
• 2013

RDF data is widely used for exchanging data nowadays to enable semantic web era. This leads to the need for storing and retrieving these data efficiently and effectively. Recently, the structure index in graph-based perspective is considered as a promising approach to deal with issues of complex query graphs. However, even though there are many researches based on structure indexing, there can be a better architectural approach instead of addressing the issue as a part. In this research, we propose architecture for storing, query processing and retrieving RDF data in efficient manner using structure indexing. Our research utilizes research results from iStore and 2 relation-based approaches and we focus on improving query processing to reduce the time of loading data and I/O cost.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.145-151
• /
• 2004

We present an efficient data structure to obtain the range minima in an away in constant time. Recently, suffix ways are extensively used to search DNA sequences fast in bioinformatics. In constructing suffix arrays, solving the range minima problem is necessary When we construct suffix arrays, we should solve the range minima problem not only in a time-efficient way but also in a space-efficient way. The reason is that DNA sequences consist of millions or billions of bases. Until now, the most efficient data structure to find the range minima in an way in constant time is based on the method that converts the range minima problem in an array into the LCA (Lowest Common Ancestor) problem in a Cartesian tree and then converts the LCA problem into the range minima problem in a specific array. This data structure occupies O( n) space and is constructed in O(n) time. However since this data structure includes intermediate data structures required to convert the range minima problem in an array into other problems, it requires large space (=13n) and much time. Our data structure is based on the method that directly solves the range minima problem. Thus, our data structure requires small space (=5n) and less time in practice. As a matter of course, our data structure requires O(n) time and space theoretically.

• Journal of Information Technology Applications and Management
• /
• v.11 no.4
• /
• pp.49-60
• /
• 2004

While the World-Wide Web offers an incredibly rich base of information, organized as a hypertext it does not provide a uniform and efficient way to retrieve specific information. Therefore, it is needed to develop an efficient web crawler for gathering useful information in acceptable amount of time. In this paper, we studied the order in which the web crawler visit URLs to rapidly obtain more important web pages. We also developed an internet agent for efficient web crawling using hyperlink structure and fitness of hypertext documents. As a result of experiment on a website. it is shown that proposed agent outperforms other web crawlers using BackLink and PageRank algorithm.

• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1729-1736
• /
• 2004

This paper proposes an efficient collision detection method in the dynamic spatial subdivisions for the MMORPG engine which requires realtime interactions. An octree is a suitable structure for static scenes or terrain processing. An octree spatial subdivision enhances rendering speed of scenes. Current spatial subdivisions tend to be highly optimized for efficient traversal, but are difficult to update quickly for a changing geometry. When an object moves to the outside extent for the spatial subdivisions, the acceleration structure would normally have to be rebuilt. The OSP based on a tree is used to divide dynamically wide outside which is the subject of 3D MMORPG. TBV does not reconstruct all tree nodes of OSP and has reduced rebuilding times by TBV information of a target node. A collision detection is restricted to those objects contained in the visibility range of sight by using the information established in TBV. We applied the HBV and ray tracing for an efficient collision detection.

• Journal of the Korean Ceramic Society
• /
• v.52 no.4
• /
• pp.248-252
• /
• 2015

Natural materials often have unique mechanical properties, such as the hierarchical structure of nacre formed through mineral bridges or asperities created between an inorganic particle and a natural-layer surface. As these asperities produce an exceptional shear resistance, in this study, we aimed to emulate the natural structure of nacre by synthesizing inorganic asperities and mineral bridges with different temperatures in the range of $1100-1300^{\circ}C$ and clay contents from 10 - 50 wt%. Following the infiltration of methyl methacrylate, we measured the mechanical properties to assess whether they were improved by the asperities. It was confirmed that the asperities improved the bending strength by 10%, and the anchoring effect was observed on the fracture surface.