• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.3
• /
• pp.13-21
• /
• 2011

In mobile environment supporting mobility technologies, user requirements have been increased with respect to utilization of location information. In particular, moving object DBMS has consistently posed in order to efficiently maintain traffic information related to location of vehicle which tents to tremendously change over time. Despite the fact that these sorts of researches must be taken into consideration, empirical studies on moving object in terms of map database for lbs service, spatial attribute of which is continuously changed over time, have rarely performed. Therefore, aim of this paper is to suggest efficient spatial index scheme, which is capable of supporting query processing algorithm and location of moving object over time, by developing new empirical model. As a result, we can come to the conclusion that moving object model based on multi-fixed grid index makes it possible to cut down on the number of entity for retrieving. What's more, this model enables hierarchical data to be accessed through efficient spatial filtering on large-scale lbs data and constraints in accordance with level in order to display map.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.546-553
• /
• 2007

As ontologies are used widely, interest for semantic similarity search is also increasing. In this paper, we suggest a query evaluation scheme for k-nearest neighbor query, which retrieves k most similar objects to the query object. We use the best match method to calculate the semantic similarity between objects and use the signature tree to index annotation information of objects in database. The signature tree is usually used for the set similarity search. When we use the signature tree in similarity search, we are required to predict the upper-bound of similarity for a node; the highest similarity value which can be found when we traverse into the node. So we suggest a prediction function for the best match similarity function and prove the correctness of the prediction. And we modify the original signature tree structure for same signatures not to be stored redundantly. This improved structure of signature tree not only reduces the size of signature tree but also increases the efficiency of query evaluation. We use the Gene Ontology(GO) for our experiments, which provides large ontologies and large amount of annotation data. Using GO, we show that proposed method improves query efficiency and present several experimental results varying the page size and using several node-splitting methods.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.1
• /
• pp.19-29
• /
• 2003

This paper presents a novel hybrid classifier for face recognition with artificially generated virtual training samples. We utilize both the nearest neighbor approach in feature angle space and a connectionist model to obtain a synergy effect by combining the results of two heterogeneous classifiers. First, a classifier called the nearest feature angle (NFA), based on angular information, finds the most similar feature to the query from a given training set. Second, a classifier has been developed based on the recall of stored frontal projection of the query feature. It uses a frontal recall network (FRN) that finds the most similar frontal one among the stored frontal feature set. For FRN, we used an ensemble neural network consisting of multiple multiplayer perceptrons (MLPs), each of which is trained independently to enhance generalization capability. Further, both classifiers used the virtual training set generated adaptively, according to the spatial distribution of each person's training samples. Finally, the results of the two classifiers are combined to comprise the best matching class, and a corresponding similarit measure is used to make the final decision. The proposed classifier achieved an average classification rate of 96.33% against a large group of different test sets of images, and its average error rate is 61.5% that of the nearest feature line (NFL) method, and achieves a more robust classification performance.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.305-312
• /
• 2001

Recently, high-dimensional index structures have been required for similarity search in such database applications s multimedia database and data warehousing. In this paper, we propose a new cell-based signature tree, called CS-tree, which supports efficient storage and retrieval on high-dimensional feature vectors. The proposed CS-tree partitions a high-dimensional feature space into a group of cells and represents a feature vector as its corresponding cell signature. By using cell signatures rather than real feature vectors, it is possible to reduce the height of our CS-tree, leading to efficient retrieval performance. In addition, we present a similarity search algorithm for efficiently pruning the search space based on cells. Finally, we compare the performance of our CS-tree with that of the X-tree being considered as an efficient high-dimensional index structure, in terms of insertion time, retrieval time for a k-nearest neighbor query, and storage overhead. It is shown from experimental results that our CS-tree is better on retrieval performance than the X-tree.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.463-476
• /
• 2006

R-trees have been traditionally optimized for the I/O performance with the disk page as the tree node. Recently, researchers have proposed cache-conscious variations of R-trees optimized for the CPU cache performance in main memory environments, where the node size is several cache lines wide and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-trees, disk-optimized R-trees show poor cache performance while cache-optimized R-trees exhibit poor disk performance. In this paper, we propose a cache and disk optimized R-tree, called the PR-tree (Prefetching R-tree). For the cache performance, the node size of the PR-tree is wider than a cache line, and the prefetch instruction is used to reduce the number of cache misses. For the I/O performance, the nodes of the PR-tree are fitted into one disk page. We represent the detailed analysis of cache misses for range queries, and enumerate all the reasonable in-page leaf and nonleaf node sizes, and heights of in-page trees to figure out tree parameters for best cache and I/O performance. The PR-tree that we propose achieves better cache performance than the disk-optimized R-tree: a factor of 3.5-15.1 improvement for one-by-one insertions, 6.5-15.1 improvement for deletions, 1.3-1.9 improvement for range queries, and 2.7-9.7 improvement for k-nearest neighbor queries. All experimental results do not show notable declines of the I/O performance.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.459-470
• /
• 2003

It is required to research on high-dimensional index structures for efficiently retrieving high-dimensional data because an attribute vector in data warehousing and a feature vector in multimedia database have a characteristic of high-dimensional data. For this, many high-dimensional index structures have been proposed, but they have so called ‘dimensional curse’ problem that retrieval performance is extremely decreased as the dimensionality is increased. To solve the problem, the cell-based filtering (CBF) scheme has been proposed. But the CBF scheme show a linear decreasing on performance as the dimensionality. To cope with the problem, it is necessary to make use of parallel processing techniques. In this paper, we propose a parallel CBF scheme which uses a horizontally-partitioned technique as declustering. In order to maximize the retrieval performance of the proposed parallel CBF scheme, we construct our parallel CBF scheme under a SN (Shared Nothing) cluster architecture. In addition, we present a data insertion algorithm, a rage query processing one, and a k-NN query processing one which are suitable for the SN cluster architecture. Finally, we show that our parallel CBF scheme achieves better retrieval performance in proportion to the number of servers in the SN cluster architecture, compared with the conventional CBF scheme.

• Journal of Korean Society of Environmental Engineers
• /
• v.22 no.12
• /
• pp.2205-2213
• /
• 2000

To investigate removal efficiency of dissolved matter by NF and RO, a pilot plant was operated for six months using groundwater treated by UF membrane. After the pilot plant operation, we performed autopsy test to identify characteristics of foulant attached on the membrane surface applying the used NF and RO in the pilot plant test. In autopsy test, we measured permeate flux and recovery rate of flux by chemical cleaning in each membrane. We also analyzed chemical cleaning disposal to examine component of foulant. Permeate flux of NF and RO1 showed rapid decline after 100 days of operation. Especially, reduction of specific flux in RO1 was more serious than in NF. Specific flux of RO2 with a low recovery rate resulted in gradual flux decline. Removal efficiencies of dissolved inorganic matters as a conductivity were 76.3%, 88.2% and 95.3% respectively for NF, RO1 and RO2, and RO2 presented the highest removal efficiency. And those of dissolved organic matters as TOC were about 80% for both NF and RO. The specific flux of membranes declined gradually from the feed water inlet to outlet of the membrane module and it showed that membrane fouling increased along the feed flow direction. Namely, concentration of pollutants became higher and volume of feed water was less as the feed flow approached to the outlet. It seemed that major foul ants were Ca consolidated into inorganic material and Si consolidated into organic material on the membrane surface. Fe was a great contribution to irreversible fouling. The SEM results indicated that the organic matter was attached to the first layer, closer to the membrane, and then inorganic matter with tetragonal shape layered over them. We could not observe biofouling because microorganism, which was cause of biofouling, was almost pretreated in UF membrane.

• Tuberculosis and Respiratory Diseases
• /
• v.44 no.1
• /
• pp.124-135
• /
• 1997

Background : Diffuse panbronchiolitis(DPB) is a disease characterized clinically by chronic cough, expectoration and dyspnea; and histologically by chronic inflammation localized mainly in the region of the respiratory bronchiole. It is prevalent in Japanese, but is known to be rare in Americans and Europians. Only a few cases in Chinese, Italians, North Americans and Koreans have been reported. It is diagnosed by characteristic clinical, radiological and pathologic features. High-resolution CT(HRCT) is known to be valuable in the study of the disease process and response to therapy in DPB. To our knowledge, there has been no correlation of its appearance on HRCT with the severity of the disease process, and radioaerosol scan(RAS) of the lung has not previously been used for the diagnosis of DPB. Method : During recent two years we have found 12 cases of DPB in Kangnam St. Mary's Hospital, Catholic University Medical College. We analysed the clinical characteristics, compared HRCT classifications with clinical stages of DPB, and determined characteristic RAS manifestations of DPB. Results : 1. The ages ranged from 31 to 83 years old(mean 54.5 years old), and male female ratio was 4:8. 75%(9/12) of patients had paranasal sinusitis, and only one patient was a smoker. 2. The patients were assigned to one of three clinical stages of DPB on the basis of clinical findings, sputum bacterology and arterial blood gas analysis. of 12 cases, 5 were in the first stage, 4 were in the second stage, and 3 were in the third stage. In most of the patients, pulmonary function tests showed marked obstructive and slight restrictive impairments. Sputum culture yielded P.aeruginosa in 3 cases of our 12 cases, K.pneumoniae in 2 cases, H.influenzae in 2 cases, and S.aureus in 2 cases. 3. Of 12 patients, none had stage I characteristics as classified on HRCT scans, 4 had slage II findings, 5 had stage III findings, and 3 had stage IV characteristics. 4. We peformed RAS in 7 of 12 patients With DPB. In 71.4% (5/7) of the patients, RAS showed mottled aerosol deposits characteristically in the transitional and intermediary airways with peripheral airspace defects, which contrasted sharply with central aerosol deposition of COPD. 5. There were significant correlations between HRCT stages and clinical stages(r= 0.614, P < 0.05), between HRCT types and Pa02(r= -0.614, P < 0.05), and between HRCT types and ESR(r= 0.618, P < 0.01). Conclusion : The HRCT classifications correspond well to the clinical stage. Therfore in the examination of patients with DPB, HRCT is useful in the evaluation of both the location and severity of the lesions. Also, RAS apears to be a convenient, noninvasive and useful diagnostic method of DPB.