• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.664-674
• /
• 2004

The trajectory preservation property that stores only one trajectory in a leaf node is the most important feature of an index structure, such as the TB-tree for retrieving object's moving paths in the spatio-temporal space. It performs well in trajectory-related queries such as navigational queries and combined queries. But, the MBR of non-leaf nodes in the TB-tree have large amounts of dead space because trajectory preservation is achieved at the sacrifice of the spatial locality of trajectories. As dead space increases, the overlap between nodes also increases, and, thus, the classical range query cost increases. We present a new split policy and entry relocation policies, which have no deterioration of the performance for trajectory-related queries, for improving the performance of range queries. To maximally reduce the dead space of a non-leaf node's MBR, the Maximal Area Reduction (MAR) policy is used as a split policy for non-leaf nodes. The entry relocation policy induces entries in non-leaf nodes to exchange each other for the purpose of reducing dead spaces in these nodes. We propose two algorithms for the entry relocation policy, and evaluate the performance studies of new algorithms comparing to the TB-tree under a varying set of spatio-temporal queries.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.369-376
• /
• 2002

Although LRU is not adequate for database that has non-uniform reference pattern, it has been adopted in most database systems due to the absence of the proper alternative. We analyze database block reference pattern with the realistic database trace. Based on this analysis, we propose a new cache replacement policy. Trace analysis shows that extremely non-popular blocks take up about 70 % of the entire blocks. The influence of recency on blocks' re-reference likelihood is at first strong due to temporal locality, however, it rapidly decreases and eventually becomes negligible as stack distance increases. Based on this observation, RCB(Reference Characteristic Based) cache replacement policy, which we propose in this paper, classifies the entire blocks into four block groups by blocks' recency and re-reference likelihood, and operates different priority evaluation methods for each block group. RCB policy evicts non-popular blocks more quickly than the others and evaluates the priority of the block by frequency that has not been referenced for a long time. In a trace-driven simulation, RCB delivers a better performance than the existing polices(LRU, 2Q, LRU-K, LRFU). Especially compared to LRU. It reduces miss count by 5~l2.7%. Time complexity of RCB is O(1), which is the same with LRU and 2Q and superior to LRU-K(O(log$_2$N)) and LRFU(O(l) ~ O(log$_2$N)).

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.4
• /
• pp.105-111
• /
• 2010

This paper proposes the recursive algorithm for passive proximity detection system based on signal strength. The system is designed to be used in the smart medicine chest in order to provide location-based service for the senior personnel. Due to the system profile, single receiver and uni-direction communication are applied over the signal attenuation model for the determination of user existence within certain proximity. The performance of conventional methods is subjective to the sight between the transmitter and receiver unless the direction of target is known. To appreciate the temporal and spatial locality of human subjects, the authors present exponential moving average (EMA) to compensate the unexpected position error from the direction and/or environment. By using optimal parameter, the experiments with EMA algorithm demonstrates 32.26% (maximum 40.80%) reduction in average of the error probability with 50% of consecutive sight in time.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.82-92
• /
• 2007

This paper describes a novel global shape (GS) feature based on radial basis function network (RBFN) and the extraction method of the proposed feature for 3D face recognition. RBFN is the weighted sum of RBfs, it well present the non-linearity of a facial shape using the linear combination of RBFs. It is the proposed facial feature that the weights of RBFN learned by the horizontal profiles of a face. RBFN based feature expresses the locality of the facial shape even if it is GS feature, and it reduces the feature complexity like existing global methods. And it also get the smoothing effect of the facial shape. Through the experiments, we get 94.7% using the proposed feature and hidden markov model (HMM) to match the features for 100 gallery set with those for 300 test set.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.513-522
• /
• 2008

Efficient data dissemination is one of the important subjects for sensor networks. High accessibility of the sensed data can be kept by deploying the data centric storage approach in which data is stored over the nodes in the sensor network itself rather than external storages or systems. The advantage of this approach is its direct accessibility in a real-time without the severe burden on delay and power dissipation on the data path to the external storages or systems. However, if the queries from many users are concentrated to the few nodes with data, then the response time could be increased and it could lead to the reduction of network life time by rapid energy dissipation caused by concentrated network load. In this paper, we propose a adaptive data centric storage scheme based on proxy trajectory (APT) mechanism. We highlight the data centric storage mechanism by taking account of supporting large number of users, and make it feasible to provide high-performance accessibility when a non-uniform traffic pattern is offered. Storing data around the localized users by considering spatial data-access locality, the proxy trajectory of APT provides fast response for the users. The trajectory, furthermore, may help the mobile users to roams freely within the area they dwell.

• Journal of Environmental Science International
• /
• v.9 no.3
• /
• pp.201-208
• /
• 2000

PCBs and DDE were determined in the soil samples and the Korean striped field mice, Apodemus agrarius, collected at six localities in Changwon and one locality in Gaduck Island from August 1997 to May 1998. The residual level of PCBs in soils, in which the concentrations of high chlorinated compounds were much higher than those of low chlorinated ones, was highest in the industrial area(IA) in Changwon(60.7 ng/g in average), whereas those of DDE in soils was highest in Gaduck Island(331.9 ng/g in average). However, the levels of each compound detected from soils in the respective remaining places were relatively low. The similar tendency as in the soils was observed in the mice, indicating that the concentration of pollutants in the mice could denote the status of pollution in the terrestrial environment. The composition of PCB congeners in the mice, however, was different from that of soils, but similar to those of other mammals. Moreover, the residual levels of PCBs and DDE in pregnant females from which fetuses were removed were lower than those of males and non-pregnant females. It suggests that these compounds accumulated in pregnant females might have been transferred to the fetuses through placenta as in other mammals. Judging from the above facts, it is suggested that the striped field mouse can be an useful biological index to evaluate the contamination in mammals inhabiting terrestrial environment.

• Journal of the Mineralogical Society of Korea
• /
• v.32 no.2
• /
• pp.145-150
• /
• 2019

As the spirit of reconciliation between the two Koreas ripens, the integration of mineral names is required in preparing the reunification between the South and North Koreas. Currently, mineral names in Korean do not adopt the guideline for romanization of Korean that was proposed by the National Institute of the Korean Language (NIKL), and different names are often used for an identical mineral species. Here, for mineral names in Korean, we suggest using (1) the suffix, "$s{\breve{o}}k$", both for metallic and non-metallic minerals, (2) names in the NIKL example-list if available, (3) the suffix "$s{\breve{o}}k$" for minerals whose names are based on the names of persons or localities.

• Journal of KIISE:Software and Applications
• /
• v.33 no.5
• /
• pp.481-488
• /
• 2006

The performance of face recognition methods using subspace projection is directly related to the characteristics of their basis images, especially in the cases of local distortion or partial occlusion. In order for a subspace projection method to be robust to local distortion and partial occlusion, the basis images generated by the method should exhibit a part-based local representation. We propose an effective part-based local representation method named locally salient ICA (LS-ICA) method for face recognition that is robust to local distortion and partial occlusion. The LS-ICA method only employs locally salient information from important facial parts in order to maximize the benefit of applying the idea of 'recognition by parts.' It creates part-based local basis images by imposing additional localization constraint in the process of computing ICA architecture I basis images. We have contrasted the LS-ICA method with other part-based representations such as LNMF (Localized Non-negative Matrix Factorization) and LFA (Local Feature Analysis). Experimental results show that the LS-ICA method performs better than PCA, ICA architecture I, ICA architectureII, LFA, and LNMF methods, especially in the cases of partial occlusions and local distortions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1970-1982
• /
• 1993

This paper describes an efficient array algorithm for parallel computation of vector-radix two-dimensional (2-D) fast discrete cosine transform (VR-FCT), and its VLSI implementation. By mapping the 2-D VR-FCT onto a 2-D array of processing elements (PEs), the butterfly structure of the VR-FCT can be efficiently importanted with high concurrency and local communication geometry. The proposed array algorithm features architectural modularity, regularity and locality, so that it is very suitable for VLSI realization. Also, no transposition memory is required, which is invitable in the conventional row-column decomposition approach. It has the time complexity of O(N+Nnzp-log2N) for (N*N) 2-D DCT, where Nnzd is the number of non-zero digits in canonic-signed digit(CSD) code, By adopting the CSD arithmetic in circuit desine, the number of addition is reduced by about 30%, as compared to the 2`s complement arithmetic. The computational accuracy analysis for finite wordlength processing is presented. From simulation result, it is estimated that (8*8) 2-D DCT (with Nnzp=4) can be computed in about 0.88 sec at 50 MHz clock frequency, resulting in the throughput rate of about 72 Mega pixels per second.

• Journal of Korean Society for Geospatial Information Science
• /
• v.21 no.4
• /
• pp.73-81
• /
• 2013

Ordinary least squares (OLS) regression is the primary statistical method in previous studies for vegetation distribution patterns in relation to landform. However, this global regression lacks the ability to uncover some local-specific relationships and spatial autocorrelation in model residuals. This study employed geographically weighted regression (GWR) to examine the spatially varying relationships between NDVI (Normalized Difference Vegetation Index) patterns and changing trends of landform (elevation, slope) and solar intensity (insolation and duration of sunshine) in Mt Geum-gang of North-Korea. Results denoted that GWR was more powerful than OLS in interpreting relationships between NDVI patterns and landform/solar intensity, since GWR was characterized by higher adjusted R2, and reduced spatial autocorrelations in model residuals. Unlike OLS regression, GWR allowed the coefficients of explanatory variables to differ by locality by giving relatively more weight to NDVI patterns which are affected by local landform and solar factors. The strength of the regression relationships in the GWR increased significantly, by showing regression coefficient of higher than 70% (0.744) in the southern ridge of the experimental area. It is anticipated that this research output will serve to increase the scientific and objective vegetation monitoring in relation to landform and solar intensity by overcoming serious constraints suffered from the past non-GWR-based approach.