• The KIPS Transactions:PartD
• /
• v.18D no.6
• /
• pp.415-422
• /
• 2011

Finding similar strings is an important operation because textual data can have errors, duplications, and inconsistencies by nature. Many algorithms have been developed for string approximate searches and most of them make use of inverted lists to find similar strings. These algorithms basically perform merge operations on inverted lists. In this paper, we develop a bitmap representation of an inverted list and propose an efficient search algorithm that can skip unnecessary inverted lists without searching using bitmap filters. Experimental results show that the proposed technique consistently improve the performance of the search.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.3
• /
• pp.153-160
• /
• 2008

One of the most important features of the Mobile Manipulator is redundant freedom. Using it's redundant freedom, a Mobile Manipulator can move in various modes, and perform dexterous motions. In this paper, to improve robot job performance, two robots -mobile robot, task robot- are joined together to perform a job, we studied the optimal position and posture of a Mobile Manipulator to achieve a minimum of movement of each robot joint. Kinematics of mobile robot and task robot is solved. Using the mobility of a Mobile robot, the weight vector of robots is determined. Using the Gradient method, global motion trajectory is minimized, so the job which the Mobile Manipulator performs is optimized. The proposed algorithm is verified with PURL-II which is Mobile Manipulator combined Mobile robot and task robot, and the results are discussed.

• Journal of KIISE:Databases
• /
• v.29 no.4
• /
• pp.274-284
• /
• 2002

Queries on XML are based on paths in the data graph, which is represented as an edge labeled graph model. All proposed query languages for XML express queries using regular expressions to traverse arbitrary paths in the data graph. A meaningful query usually has several regular path expressions in it, but much of recent research is more concerned with optimizing a single path expression. In this paper, we present an efficient technique to process multiple path expressions in a query. We developed a data structure named as the path identifier(PID) to identify whether two given nodes lie on the fame path in the data graph or not, and utilized the PID for efficient processing of multiple path expressions. We implement our technique and present preliminary performance results.

• The KIPS Transactions:PartB
• /
• v.15B no.4
• /
• pp.355-364
• /
• 2008

In general, we can use an inverted index for retrieving element lists from structured documents. An inverted index can retrieve a list of elements that have the same tag name. In this approach, however, the cost of query processing is linear to the length of a path query because all the structural relationships (parent-child and ancestor-descendant) should be resolved by structural join operations. In this paper, we propose an inverted index technique and a novel structural join technique for accelerating XML path query evaluation. Our inverted index can retrieve element lists for path segments in a parent-child relationship. Our structural join technique can handle lists of element pairs while the existing techniques handle lists of elements. We show through experiments that these two proposed techniques are integrated to accelerate evaluation of XML path queries.

• Journal of KIISE
• /
• v.42 no.10
• /
• pp.1247-1253
• /
• 2015

An inverted index structure is widely used for efficient string similarity search. One of the main requirements of similarity search is a fast response time; to this end, most techniques use an in-memory index structure. Since the size of an inverted index structure usually very large, however, it is not practical to assume that an index structure will fit into the main memory. To alleviate this problem, we propose a novel technique that reduces the size of an inverted index. In order to reduce the size of an index, the proposed technique rearranges data strings so that the data strings containing the same q-grams can be placed close to one other. Then, the technique encodes those multiple strings into a range. Through an experimental study using real data sets, we show that our technique significantly reduces the size of an inverted index without sacrificing query processing time.

• Applied Biological Chemistry
• /
• v.23 no.1
• /
• pp.14-22
• /
• 1980

White and black sesame produced in Korea were defatted with ethyl ether or n-hexane. Defatted sesame meal was extracted with water and salt solution, and protein extraction was precipitated at various pH 1 through 12, with trichloro acetic acid (TCA), tannic acid and ammonium sulfate, respectively. Protein was purified by Sephadex A-25, G-75, G-100 and G-200, and identified its protein fraction by polyacrylamide gel electrophoresis. Amino acids composition of protein in white sesame was analyzed by automatic amino acid analyzer. Protein contents of white sesame, black sesame and sesame meal are 20.5%, 19.2%, and 44.7%, respectively. n-Hexane was the most suitable solvent for extraction of oil from sesame. Crude protein precipitation was better in higher pH. The protein extraction was more effective with the solution containing sodium chloride tinder the pH 8. Globulin in total protein was high and prolamin was less than in other cereal proteins. Glutamic acid contents of white sesame and sesame globulin were 17.1%, and 20%, respectively. Both proteins contained relatively high levels of essential amino acids. 12-13 bands were found in water soluble protein and 2 bands in salt soluble protein were detected by the disc gel electrophoresis, and were identified in both of white and black sesame. The salt soluble protein of white sesame could be purified by Sephadee G-100 and G-200.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.4
• /
• pp.922-934
• /
• 2013

The Amur Starfishes, known as give huge damages to shellfish farms, are being removed by only divers and fish net in the wide areas. Therefore, increasing recognition rates of starfishes are desperately required to remove high amounts of Amur Starfishes effectively. Meanwhile, current technology of obtaining the images of starfish distribution has limitation of obtaining color images due to using visible light in the darkness seabed area. In this research, we have used infrared ray, which is very penetrated, and strong against noise that comes from floating objects under the water, in order to solve current problems. As a result, we have acquired better images to analyze recognition rates of starfishes, and also able to received much satisfied recognition rate results for 88.7% of Amur Starfishes by adopting the most suitable adaptive filter method.

• Environmental and Resource Economics Review
• /
• v.23 no.2
• /
• pp.349-364
• /
• 2014

This study analyzed Granger causality between power consumption and production activity in manufacturing sector, by using error correction model. It found that there exists the connection between power consumption and production activity in manufacturing sector. By reflecting the industrial characteristics, it found not only the bilateral causality (power consumption ${\leftrightarrow}$ production activity) in power non-intensive industry, high value-added industry and low value-added industry, but also one-way causality (power consumption ${\rightarrow}$ production activity) in power-intensive industry. These results imply that power demand management policy focusing on efficiency improvement is necessary primarily to minimize negative impacts on production activity, and also stable power supply system is required to meet the increase of power demand.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.14 no.5
• /
• pp.37-51
• /
• 2011

Research and conservation of plant species for the nation arboretum, collection and securing of the plant species for both public and private arboreta and education for the arboreta which is affiliated to the university are overall management goal of the arboreta in Korea. Most of the arboreta in Korea run the programs and events for guide and interpretation of forest, but the programs and events are not well specified by the arboreta. Regarding the reasonable level of entrance fee should be discussed further as the lack of information and understanding. But the specified entrance fee between public and private arboreta should be considered. An eighty three percent of arboreta in Korea has been properly managed the species information. The reasonable management should be considered in case of unusual management of collected plant genetic resources. Although the overall impending difficulties for the management of arboreta in Korea is the lack of trained or qualified staffs, securing tasks independently for the public arboreta and relatively low salary for the private arboreta are main difficulties. Most of the difficulties are derived from the lack of its mission of the arboreta. The management of arboreta by the mission statement is one of the core targets including the characters such as climate or region should be considered. The securing qualified or trained staffs should be considered in the development of arboreta in Korea including the modification of relevant regulations or law.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.641-649
• /
• 2005

As XML is widely used with the development of internet, many researches on the XML storage and query processing have been done Several index techniques have been proposed to efficiently process XML path queries. Recently, structural join has received murk attention as a method to protest the path query. Structural join technique process a path query by identifying the containment relationship of elements. Especially, it has an advantage that we can get the result set by simply comparing related elements only instead of scanning whole document. However during the comparison process, unnecessary elements that are not included in the result set can be scanned. So we propose a new technique, the level structural join. In this technique, we use both the relationship and the level distribution of elements in the path query. Using this technique, we tao improve the performance of query processing only by comparing elements with specific level in the target inverted level.