• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.9
• /
• pp.377-384
• /
• 2015

In this paper we propose a visualization tool for distortion-free time-series matching. Supporting distortion-free is a very important factor in time-series matching to get more accurate matching results. In this paper, we visualize the result of time-series matching, which removes various time-series distortions such as noise, offset translation, amplitude scaling, and linear trend by using moving average, normalization, linear detrending transformations, respectively. The proposed visualization tool works as a client-server model. The client sends a user-selected time-series, of which distortions are removed, to the server and visualizes the matching results. The server efficiently performs the distortion-free time-series matching on the multi-dimensional R*-tree index. By visualizing the matching result as five different charts, we can more easily and more intuitively understand the matching result.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.77-89
• /
• 2005

Recently, application area on the Location Based System(LBS) is increasing because of development of mobile-communication and GPS technique. Previous studies on the index of moving objects are classified as either index for past trajectories or current/future positions. It is necessary to develop a unified index because many applications need to process queries about both past trajectories and current/future positions at the same time. In this paper, the past trajectories of moving objects are represented as line segments and the current and future positions are represented as the function of time. We propose a new index called PCR-tree(Past, Current R-tree) for unification of past, current and future positions. Nodes of the index have bounding boxes that enclose all position data and entries in the nodes are accessed with only one interface. We implement the proposed index and show a feasibility of processing the queries about temporal-spatial domain with the query tool which we develop.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.4
• /
• pp.1-10
• /
• 2008

In wireless internet, the location information of the user is one of the important resources for many applications. One of these applications is Location-Based Services (LBSs) which are being popular. Because, in the LBS system, users request a location-based query to LBS servers by sending their exact location, the location information of the users can be misused by adversaries. In this regard, there must be a mechanism which can deal with privacy protection of the users. In this paper, we propose a cloaking method considering both features of K-anonymity and L-diversity. Our cloaking method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finding number of users (K-anonymity). To support this, we use a R*-tree based index structure and use filtering methods especially for the m inimum cloaking region. Finally, we show from a performance analysis that our method outperforms the existing grid based cloaking method.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.733-744
• /
• 1996

Content-based image retrieval(CBIR) is an image data retrieval methodology using characteristic values of image data those are generated by system automatically without any caption or text information. In this paper, we propose a content-based image data retrieval method using shape and color features of image data as characteristic values. For this, we present some image processing techniques used for feature extraction and indexing techniques based on trie and R tree for fast image data retrieval. In our approach, image query result is more reliable because both shape and color features are considered. Also, we how an image database which implemented according to our approaches and sample retrieval results which are selected by our system from 200 sample images, and an analysis about the result by considering the effect of characteristic values of shape and color.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.8
• /
• pp.1155-1160
• /
• 2013

The rapid growth of smart phones has made location-based services (LBSs) widely available. However, the use of LBS can raise privacy issues, as LBS can allow adversaries to violate the location privacy of users. There has been a considerable amount of research on preserving user location privacy. Most of these studies try to preserve location privacy by achieving what is known as location K-anonymity. In this paper, we propose a hierarchical clustering-based spatial cloaking algorithm for LBSs. The proposed algorithm constructs a tree using a modified version of agglomerative hierarchical clustering. The experimental results show, in terms of the ASR size, that the proposed algorithm is better than Hilbert Cloak and comparable to RC-AR (R-tree Cloak implementation of Reciprocal with an Asymmetric R-tree split). In terms of the ASR generation time, the proposed algorithm is much better in its performance than RC-AR and similar in performance to Hilbert Cloak.

• Journal of Korean Society of Occupational and Environmental Hygiene
• /
• v.3 no.1
• /
• pp.3-13
• /
• 1993

This study was conducted at seven degreasing processes in plating plants located in Seoul, Incheon, Ansan, and Taejeon areas from July 21 to august 27, 1992. This study was performed to assess the TWA exposures to trichloroethylene (TCE) and evaluate factors affecting TCE concentrations in degreasing process. Two-Point Eddy Diffusional Model suggested by Wadden et al. was employed to calculalte emission factors according to degreaser type. Results are summarized as follows. 1. The TWA exposures of the degreasing operators ranged from 1.4 ppm to 123 ppm, and those of three plants out of seven were exceeding 50 ppm of both the Korean and U.S. OSHA standards. Degreasing assistant of Plant B, was exposed to 59 ppm. 2. The average concentrations at the distance 0, 1.5, 3.0 m from the degreasers were 1.014, 24, and 18 ppm, respectively, and showed a signifficant difference by distance (p<0.01). 3. The emission of TCE was reduced by installing local exhaust systems, condensers, and refrigeration lines at the degreasers (p<0.01). 4. The major factors related to exposure of operators were workload (r=.9621. p<0.01) and dimensions of degreansing room(r=-.8667, p<0.05). 5. If the air in degreasing room is mixed violently by other factors in addition to diffusion, the emission factors can not be evaluated because the important hypothesis of the Two-Point Eddy Diffusional Model can not be accepted. 6. The ultrasonic degreaser without the local exhaust ststem, condenser, and refrigeration lines emitted TCE three times greater than the ultrasonic degreaser with condenser and refrigeration 1ines only.

• Journal of KIISE:Software and Applications
• /
• v.26 no.9
• /
• pp.1039-1051
• /
• 1999

시공간 데이타베이스는 현실세계의 객체에 대하여 효율적인 공간 관리와 이력 관리를 지원한다. 이러한 시공간 데이타베이스는 시간차원과 공간차원이라는 이질적 데이타 공간을 관리하여야 하는 대단히 복잡한 시스템이다. 따라서 데이타에 대한 효율적 접근 방법에 대한 연구가 필수적이며, 이는 효율적 색인 기법의 개발을 통하여 이룰 수 있다. 그러나 시공간 데이타에 대한 접근방법 연구는 거의 이루어지지 않고 있으며 극소수의 사례들마저도 공간 객체의 이력 개념을 지원하는 것이 아니라 멀티미디어 객체의 상대적 시간만을 지원하고 있다. 따라서 이 논문에서는 공간 데이타의 이력을 표현하는 시공간 데이타에 대하여 효율적으로 색인하기 위한 방안으로서 시간과 공간을 단일화된 색인 영역으로 통합하는 단일화된 시공간 색인 모델을 제시하고, 이를 기존의 R-트리를 기반으로 확장한 색인을 설계 및 구현하였으며, 아울러 다양한 유형의 시공간 연산에 대한 색인의 성능을 평가하였다.Abstract Spatiotemporal databases are able to support an efficient spatial management as well as historical management for an object in the real world. It is very complex to manage these two dimensions why there exists on difference of inborn property of temporal and spatial dimensions. Therefore an efficient access method should be studied, and it can be done by means of development of efficient indexing technology.However, there is a few related work in the research of access methods of spatiotemporal data. Also the previous works do not support the concept of history for spatial object, and only support the relative time among multimedia objects. Therefore, in this paper, we propose a unified Spatiotemporal index model as an efficient index for Spatiotemporal data. And we not only design Spatiotemporal index that has been extended to historical management facility on the basis of conventional R-tree, but also implement it. Finally we have evaluated performance of index for the various kinds of Spatiotemporal operations.

• Magazine of the Korea Concrete Institute
• /
• v.11 no.1
• /
• pp.255-266
• /
• 1999

The objective of this experiment is to observe the elastic and inelastic behaviors of high-rise reinforced concrete frames having non-seismic details. To do this, a building frame designed according to Korean seismic code and detailed in the Korean conventional practice was selected. A 1:12 scale plane frame model was manufactured according to similitude law. A reversed lateral load test and a monotonic pushover test were performed under the displacement control. To simulate the earthquake effects, the lateral force distribution was maintained to be an inverse triangle by using a whiffle tree. From the tests, base shears, crack pattern, local rotations in the ends of critical members and the relations between interstory drift versus story shear are obtained. Based on test results, conclusions are drawn on the implications of the elastic and inelastic behaviors of a high-rise reinforced concrete frame having non-seismic details.

• Journal of Pharmaceutical Investigation
• /
• v.38 no.1
• /
• pp.73-78
• /
• 2008

To evaluate the bioequivalence of two ramipril formulations, a standard 2-way randomized cross-over study was conducted in twenty-six healthy male Korean volunteers. A single oral dose of 10 mg of test formulation $Ramiprin^{(R)}$ (tablet) or reference formulation Tritace $Protect^{(R)}$ (tablet) was administered with one-week washout period. Plasma concentrations of ramipril were assayed over a period of 12 hr with a well validated method using liquid chromatography coupled to tandem mass spectrometry (LC-MS/MS). The values of area under the plasma concentration-time curve, from time zero to last sampling time $(AUC_t)$ and from time zero to time infinity $(AUC_{inf})$ were $77.45{\pm}44.78\;and\;78.96{\pm}45.64$ for test, and $70.30{\pm}42.27\;and\;71.99{\pm}43.55ng\;hr/mL$ for reference formulation, respectively. Similarly, maximum concentration $(C_{max})$ and elimination half-life $(t_{1/2})$ were $65.61{\pm}19.96ng/mL$ and $2.15{\pm}0.75hr$ for test, and $63.63{\pm}25.50ng/mL$ and $2.16{\pm}0.73hr$ for reference formulations, respectively. Time to reach maximum concentration $(T_{max})$ for the test and the reference, were $0.51{\pm}0.22hr\;and\;0.52{\pm}0.18hr$, respectively. The parametric 90% confidence intervals on the mean of the differences between the two formulations (test-reference) of the log-transformed values of $AUC_t\;and\;C_{max}$ were 1.03 to 1.19 and 0.98 to 1.17, respectively. The overall results indicate that the two formulations are bioequivalent and can be prescribed interchangeably.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.2
• /
• pp.113-118
• /
• 2010

Recently, 3D-reconstruction for geographic information and study of geospatial information is progressing in various fields through national policy such as R&D business and pilot project. LiDAR system has a advantage of acquisition the 3D information data easily and densely so that is used in many different fields. Considering to characterist of the point data formed with 3D, it need a high specification CPU because it requires a number of processing operation for 2D form expressed by monitor. In contrast, 2D grid structure, like DEM, has a advantage on costs because of simple structure and processing speed. Therefore, purpose of this study is to solve the problem of requirement of more storage space, when LiDAR data stored in forms of 3D is used for 3D-geographic and 3D-buliding representation. Additionally, This study reconstitutes 2D-gird data to supply the representation data of 3D-geographic and presents the storage method which is available for detailed representation applying tree-structure and reduces the storage space.