• The Journal of Korean Medical History
• /
• v.28 no.2
• /
• pp.73-85
• /
• 2015

This paper is the result of a research conducted for "Knowledge Resource Development by Excavation and preservation and DB Establishment of Traditional Home Remedy", a part of Korean Medicine knowledge infrastructure establishment and Korean Medicine therapy development project executed by Korea Institute of Oriental Medicine. This paper is a part of the plans to standardize Korean acupuncture and moxibustion and surgical techniques in order to make new techniques derived from Korean traditional medicine patentable, as presented in the Nagoya Protocol. By first reviewing traditional text sources and classifying them into index literature and index techniques, we can see a mutual relationship between these two categories. Based on current research papers, this study has established a total of 121 pieces of index literature as well as extracted 64 types of index techniques in acupuncture and surgery technique. Both index literature and index technique have been concurrently visualized in this paper in the "Korean Acupuncture & Moxibustion Technique and Surgical Manipulation Base Map".

• International Journal of Quality Innovation
• /
• v.4 no.1
• /
• pp.191-204
• /
• 2003

The target costing technique, mathematically discussed by Sauers, only uses the $C_p index along with Taguchi loss function and $\bar{X}$-P control charts to setup goal control limits. The new specification limits derived from Taguchi loss function is linked through the $C_p value to $\bar{X}$-P control charts to obtain goal control limits. Studies have shown that the point estimator of the $C_p index, $C_p, could vary from time to time due to the sampling error. The suggested approach is to use confidence intervals, especially the lower confidence intervals, to replace the point estimator. Therefore, an improvement on target costing technique is presented by applying the lower confidence interval of the $C_p index and using both Taguchi and Spiring's loss functions together with $\bar{X}$-P charts to make this technique more robust in practice. An example is also provided to illustrate how the improved target costing technique works.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.55-65
• /
• 2005

This paper presents a bulk insertion technique for efficiently inserting data items. Traditional moving object database focused on efficient query processing that happens mainly after index building. Traditional index structures rarely considered disk I/O overhead for index rebuilding by inserting data items. This paper, to solve this problem, describes a new bulk insertion technique which efficiently induces the current positions of moving objects and reduces update cost greatly. This technique uses buffering technique for bulk insertion in spatial index structures such as R-tree. To analyze split or merge node, we add a secondary index for information management on leaf node of primary index. And operations are classified to reduce unnecessary insertion and deletion. This technique decides processing order of moving objects, which minimize split and merge cost as a result of update operations. Experimental results show that this technique reduces insertion cost as compared with existing insertion techniques.

• International Journal of Quality Innovation
• /
• v.6 no.2
• /
• pp.31-45
• /
• 2005

The target costing technique, mathematically discussed by Sauers, only uses the $C_p$ index along with Taguchi loss function and ${\bar{X}}-R$ control charts to set up goal control limits. The new specification limits derived from Taguchi loss function is linked through the $C_p$ value to ${\bar{X}}-R$ control charts to obtain goal control limits. This study further considers the reflected normal loss function as well as the $C_{pk}$ index along with its lower confidence interval in forming goal control limits. With the use of lower confidence interval to replace the point estimator of the $C_{pk}$ index and reflected normal loss function proposed by Spiring to measure the loss to society, this modified and improved target costing technique would become more robust and applicable in practice. Finally, an example is provided to illustrate how this modified and improved target costing technique works.

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

• Journal of the Korean association of regional geographers
• /
• v.3 no.2
• /
• pp.105-120
• /
• 1997

One of the most important issues of object-oriented geographical database system is to develop an indexing technique which enables more efficient I/O processing within aggregation hierarchy or inheritance hierarchy. Up to present, several indexing schemes have been developed for this purpose. However, they have separately focused on aggregation hierarchy or inheritance hierarchy of object-oriented data model. A recent research is proposing a nested-inherited index which combines these two hierarchies simultaneously. However, this new index has some weak points. It has high storage costs related to its use of auxiliary index. Also, it cannot clearly represent the inheritance relationship among classes within its index structure. To solve these problems, this thesis proposes a pointer-chain index. Using pointer chain directory, this index composes a hierarchy-typed chain to show the hierarchical relationship among classes within inheritance hierarchy. By doing these, it could fetch the OID list of objects to be retrieved more easily than before. In addition, the pointer chain directory structure could accurately recognize target cases and subclasses and deal with "select-all" typed query without collection of schema semantic information. Also, it could avoid the redundant data storing, which usually happens in the process of using auxiliary index. This study evaluates the performance of pointer chain indexing technique by way of simulation method to compare nested-inherited index. According to this simulation, the pointer chain index is proved to be more efficient with regard to storage cost than nested-inherited index. Especially in terms of retrieval operation, it shows efficient performance to that of nested-inherited index.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2009.10a
• /
• pp.1069-1072
• /
• 2009

Field sequential display has some advantages but color breakup (CBU) is the significant problem. Many researches had introduced several methods to reduce CBU phenomenon, however there are no reliable methods to measure the degree of CBU. In this report, a novel CBU measurement technique which was based on the image processing method and subjective analysis results had proposed to evaluate the degree of CBU. Color Breakup Index (CBI) was presented to be a useful index to recognize the CBU phenomenon in the different field sequential technique displays.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.31-43
• /
• 2007

Sensor data have the characteristics such as numerous and continuous data. Therefore, it is required to develop an index which could retrieve a specific sensor data efficiently from numerous sensed data. The index should have an efficient delete operation for the past data to support the data archiving. In this paper, we have proposed and implemented an index splitting technique to support the sensor data archiving. These splitted indexes compose of a virtual index (that is, index management component), which is shown as single tree from outside. Experimental results show that in the case of 100,000 insert operations the splitted index performs 8% better than the traditional TB-tree maximumly. And the splitted index outperforms TB-tree with retrieving queries when the region of query is small and the size of time domain is large.

• ETRI Journal
• /
• v.25 no.6
• /
• pp.535-537
• /
• 2003

We propose a rigorous 2D approximation technique for the 3D waveguide structures; it can minimize the well-known approximation errors of the commonly used effective index method. The main concept of the proposed technique is to compensate for the effective cladding index in the equivalent slab model of the original channel waveguide from the modal effective index calculated by the nonuniform 2D finite difference method. With simulations, we used the proposed technique to calculate the coupling characteristics of a directional coupler by the 2D beam propagation method, and the results were almost exactly the same as the results calculated by the 3D beam propagation method.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.806-809
• /
• 2005

The main goal of this research is automatic video analysis using a face recognition technique. In this paper, an automatic video management system is introduced with a variety of functions enabled, such as index, edit, summarize, and retrieve multimedia data. The automatic management tool utilizes MPEG-7 visual descriptors to generate a video index for creating a summary. The resulting index generates a preview of a movie, and allows non-linear access with thumbnails. In addition, the index supports the searching of shots similar to a desired one within saved video sequences. Moreover, a face recognition technique is utilized to personalbased video summarization and indexing in stored video data.