• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.624-640
• /
• 2004

Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.1-11
• /
• 2006

It is possible to track the moving vehicle as well as to develop the location based services actively according to the progress of wireless telecommunication and GPS, to the spread of network, and to the miniaturization of cellular phone. To provide these location based services, it is necessary for an index technique to store and search too much moving object data rapidly. However the existing indices require a lot of costs to insert the data because they store every position data into the index directly. To solve this problem in this paper, we propose a buffer node operation and design a GU-tree(Group Update tree). The proposed buffer node method reduces the input cost effectively since the operation stores the moving object location data in a group, the buffer node as the unit of a non-leaf node. hnd then we confirm the effect of the buffer node operation which reduces the insert cost and increase the search performance in a time slice query from the experiment to compare the operation with some existing indices. The proposed tufter node operation would be useful in the environment to update locations frequently such as a transportation vehicle management and a tour-guide system.

• Journal of the Korean Geographical Society
• /
• v.42 no.4
• /
• pp.469-487
• /
• 2007

Grain-Size Trend Analysis is the methodology to identify net sediment transport pathways, based on the assumption that the movement of sediment from the source to deposit leaves the identifiable spatial pattern of mean, sorting, and skewness of grain size. It can easily be implemented with low cost, so it has great potentials to contribute to geomorphological research, whereas it can also be used inadequately without recognition of its limitations. This research aims to compare three established methods of grain-size trend analysis to search for the adequate way of application, and also suggest the research tasks needed in improving this methodology 1D pathway method can corporate the field experience into analyzing the pathway, provide the useful information of depositional environments through X-distribution, and identify the long-term trend effectively. However, it has disadvantage of the dependence on subjective interpretation, and a relatively coarse temporal scale. Gao-Collins's 2D transport vector method has the objective procedure, has the capability to visualize the transport pattern in 2D format, and to identify the pattern at a finer temporal scale, whereas characteristic distance and semiquantitative filtering are controversial. Le Roux's alternative 2D transport vector method has two improvement of Gao-Collins's in that it expands the empirical rules, considers the gradient of each parameters as well as the order, and has the ability to identify the pattern at a finer temporal scale, while the basic concepts are arbitrary and complicated. The application of grain sire trend analysis requires the selection of adequate method and the design of proper sampling scheme, based on the field knowledge of researcher, the temporal scale of sediment transport pattern targeted, and information needed. Besides, the relationship between the depth of sample and representative temporal scale should be systematically investigated in improving this methodology.

• Journal of Hospice and Palliative Care
• /
• v.21 no.1
• /
• pp.23-32
• /
• 2018

Purpose: Little is known regarding the extent to which dying patients with chronic obstructive pulmonary disease (COPD) receive life-sustaining procedures and palliative care in U.S. hospitals. We examine hospital cost trends and the impact of palliative care utilization on the use of life-sustaining procedures in this population. Methods: Retrospective nationwide cohort analysis was performed using National Inpatient Sample (NIS) data from 2005 and 2014. We examined the receipt of both palliative care and intensive medical procedures, defined as systemic procedures, pulmonary procedures, or surgeries using the International Classification of Diseases, 9th revision (ICD-9-CM). Results: We used compound annual growth rates (CAGR) to determine temporal trends and multilevel multivariate regressions to identify factors associated with hospital cost. Among 77,394,755 hospitalizations, 79,314 patients were examined. The CAGR of hospital cost was 5.83% (P<0.001). The CAGRs of systemic procedures and palliative care were 5.98% and 19.89% respectively (each P<0.001). Systemic procedures, pulmonary procedures, and surgeries were associated with increased hospital cost by 59.04%, 72.00%, 55.26%, respectively (each P<0.001). Palliative care was associated with decreased hospital cost by 28.71% (P<0.001). Conclusion: The volume of systemic procedures is the biggest driver of cost increase although there is a cost-saving effect from greater palliative care utilization.

• Journal of international Conference on Electrical Machines and Systems
• /
• v.3 no.2
• /
• pp.190-199
• /
• 2014

In the last years, fault problem in power electronics has been more and more investigated both from theoretical and practical point of view. The fault problem can cause equipment failure, data and economical losses. And the analyze system require to ensure fault problem and also rectify failures. The current errors on these faults are applied for identified type of faults. This paper presents technique to detection and identification faults in three-phase voltage source inverter (VSI) by using time-frequency distribution (TFD). TFD capable represent time frequency representation (TFR) in temporal and spectral information. Based on TFR, signal parameters are calculated such as instantaneous average current, instantaneous root mean square current, instantaneous fundamental root mean square current and, instantaneous total current waveform distortion. From on results, the detection of VSI faults could be determined based on characteristic of parameter estimation. And also concluded that the fault detection is capable of identifying the type of inverter fault and can reduce cost maintenance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2851-2865
• /
• 2014

To improve the rate-distortion performance of distributed video compressive sensing (DVCS), the adaptive sparse basis and nonlocal similarity of video are proposed to jointly reconstruct the video signal in this paper. Due to the lack of motion information between frames and the appearance of some noises in the reference frames, the sparse dictionary, which is constructed using the examples directly extracted from the reference frames, has already not better obtained the sparse representation of the interpolated block. This paper proposes a method to construct the sparse dictionary. Firstly, the example-based data matrix is constructed by using the motion information between frames, and then the principle components analysis (PCA) is used to compute some significant principle components of data matrix. Finally, the sparse dictionary is constructed by these significant principle components. The merit of the proposed sparse dictionary is that it can not only adaptively change in terms of the spatial-temporal characteristics, but also has ability to suppress noises. Besides, considering that the sparse priors cannot preserve the edges and textures of video frames well, the nonlocal similarity regularization term has also been introduced into reconstruction model. Experimental results show that the proposed algorithm can improve the objective and subjective quality of video frame, and achieve the better rate-distortion performance of DVCS system at the cost of a certain computational complexity.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1269-1273
• /
• 2010

Typically users prefer to manage and access personal photo collections taken from a cell phone based on events. In this paper we propose an event clustering algorithm that requires low computation cost with high accuracy supporting incremental operation. The proposed method is based on the statistical analysis of the elapsed interval of intra-event photos on the real sample data for the decision of an event boundary. We then incorporate both location and visual information for the ambiguous range to split with only temporal cue. According to test results, we show higher performance compared to existing general clustering approaches.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.3
• /
• pp.32-41
• /
• 2003

In this paper, we implemented a looms management system which supports remote monitoring and scientific management of the looms. In the implemented system, the layout of the looms is placed in the user interface, and each loom's operating state and rate are automatically represented there. The implemented system has aggregate query processing functions for the looms existing in the selected area by the louse and it also has high level query processing functions to support the chart and pivot table; it can be used as a decision support system. The proposed system can detect temporal or persistent problems of the looms. Therefore, it can be used to raise the productivity and to reduce the cost in textile companies by coping with the situation properly.

• Journal of the Korea Convergence Society
• /
• v.11 no.8
• /
• pp.1-6
• /
• 2020

There are various approaches to evaluate a watermelon sweetness. However, there are some limitations to evaluating cost, watermelon damage, and subjective issue. In this study, we developed a novel approach to predict a watermelon sweetness using reflected sound and the machine learning algorithm. It was observed that higher brix watermelon produced higher spectral power is reflected sound. Based on the spectral-temporal features of reflected sound, the machine learning algorithms could accurately predict the sweetness group at a rate of 83.2 and 59.6 % in 2-groups and 3-groups classification, respectively.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.348-351
• /
• 2011

가변적인 블록을 이용하는 H.264/AVC 인터 화면에서의 모드 결정 방법은 $16{\times}16$부터 $P8{\times}8$ 모드까지 인터 모드에 대해 비트율 왜곡값을 계산 한 뒤 공간적 상관도를 고려하기 위해 인트라 $4{\times}4$와 인트라 $16{\times}16$ 모드까지 비트율 왜곡값을 계산하고, 계산된 비트율 왜곡값 중 가장 작은 값을 갖는 모드를 최종 모드로 선택한다. 하지만 이러한 과정으로 부호기의 복잡도는 증가한다. 복잡도를 감소시키기 위해 본 논문에서는 IPPP구조에서의 인터 모드와 인트라 모드의 특징을 이용하여 고속 부호화를 제안한다. 제안하는 알고리즘은 인터 모드에 대해서 최적 모드를 결정하기 위한 비트율 왜곡값의 상관도와 시간 상관도를 이용하고, 인트라 모드에 대해서는 인트라 화면 내에서의 각 인트라 모드에 대한 최대 최소 임계값을 이용하여, 발생확률이 낮은 인터와 인트라 모드의 활성화 여부를 결정한다. 본 알고리즘의 적용 범위는 상대적으로 인터 화면에서 발생 빈도가 낮은 $16{\times}8$, $8{\times}16$, $P8{\times}8$와, 인트라 $4{\times}4$, 인트라 $16{\times}16$ 모드이다. 제안하는 알고리즘은 기존의 H.264/AVC에 비해 1.36% 비트가 증가 했고, PSNR은 0.06dB 감소했다. 즉, 부호화 효율의 큰 감소 없이 평균 42.58%의 부호화 시간을 감소시켰다.