• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.3
• /
• pp.145-153
• /
• 2009

Trajectory data are ubiquitous in the real world. Recent progress on satellite, sensor, RFID, video, and wireless technologies has made it possible to systematically track object movements and collect huge amounts of trajectory data. Accordingly, there is an ever-increasing interest in performing data analysis over trajectory data. In this paper, we develop a data mining tool for massive trajectory data. This mining tool supports three operations, clustering, classification, and outlier detection, which are the most widely used ones. Trajectory clustering discovers common movement patterns, trajectory classification predicts the class labels of moving objects based on their trajectories, and trajectory outlier detection finds trajectories that are grossly different from or inconsistent with the remaining set of trajectories. The primary advantage of the mining tool is to take advantage of the information of partial trajectories in the process of data mining. The effectiveness of the mining tool is shown using various real trajectory data sets. We believe that we have provided practical software for trajectory data mining which can be used in many real applications.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.6
• /
• pp.106-109
• /
• 1997

For the practical isolated word recognition system, the ability to reject the out-of -vocabulary(OOV) is required. In this paper, we present a rejection method which uses the clustered phoneme modeling combined with postprocessing by likelihood ratio scoring. Our baseline speech recognition system was based on the whole-word continuous HMM. And 6 clustered phoneme models were generated using statistical method from the 45 context independent phoneme models, which were trained using the phonetically balanced speech database. The test of the rejection performance for speaker independent isolated words recogntion task on the 22 section names shows that our method is superior to the conventional postprocessing method, performing the rejection according to the likelihood difference between the first and second candidates. Furthermore, this clustered phoneme models do not require retraining for the other isolated word recognition system with different vocabulary sets.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.923-930
• /
• 2004

Wireless sensor networks is a core technology of ubiquitous computing which enables the network to aware the different kind of context by integrating exiting wired/wireless infranet with various sensor devices and connecting collected environmental data with applications. However it needs an energy-efficient approach in network layer to maintain the dynamic ad hoc network and to maximize the network lifetime by using energy constrained node. Cluster-based data aggregation and routing are energy-efficient solution judging from architecture of sensor networks and characteristics of data. In this paper. we propose a new distributed clustering algorithm in using distance from the sink. This algorithm shows that it can balance energy dissipation among nodes while minimizing the overhead. We verify that our clustering is more en-ergy-efficient and thus prolongs the network lifetime in comparing our proposed clustering to existing probabilistic clustering for sensor network via simulation.

• The Magazine for Energy Service Companies
• /
• s.79
• /
• pp.12-19
• /
• 2012

본고에서는 ESCO 시장이 성장하기 위하여 건물부문 대상을 1만$m^2$이상 대형건물, 에너지다소비건물, 소규모 건물로 설정하여 정책 및 제도 개선방안을 모색한다. 이를 위해 각각의 개별적인 건물에너지 효율개선사업이 아닌, 유형별, 공간별로 집단화하여 ESCO사업으로 추진하고, ESCO에 대한 홍보와 관심을 유도하기 위한 시범사례를 구축 및 확산하기 위하여 해외사례와 시사점을 제시한다.

• Journal of the Speleological Society of Korea
• /
• no.50
• /
• pp.17-34
• /
• 1997

자연학습원은 공공의 시설로서 도심에 묻혀 있는 청소년들을 대자연속에 끌어들여 집단화된 생활과 훈련을 통하여 자연에 대한 올바른 지식을 전달하고 심신을 연마하여 질서, 우애, 협동, 봉사의 정신을 체득시키는 등, 학교나 가정에서 기대하기 어려운 체험을 얻을 수 있도록 하는 시설이다.(중략)

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.3
• /
• pp.35-42
• /
• 1999

In this paper, a modified clustering algorithm is proposed to improve the discrimination of discrete HMM(Hidden Markov Model), so that it has increased recognition rate of 2.16% in comparison with the original HMM using the K-means or LBG algorithm. And, for preventing the decrease of recognition rate because of insufficient training data at the training scheme of HMM, a modified probabilistic smoothing method is proposed, which has increased recognition rate of 3.07% for the speaker-independent case. In the experiment applied the two proposed algorithms, the average rate of recognition has increased 4.66% for the speaker-independent case in comparison with that of original VQ/HMM.

• Korean Journal of Cognitive Science
• /
• v.12 no.4
• /
• pp.41-47
• /
• 2001

Palmer and Rock (1994) proposed that a connected region of uniform visual properties (uniform connectedness) strongly tends to be organized as a single perceptual unit To test this hypothesis using briefly presented forms three experiments were executed. In Experiment 1 and 2 participants were asked to report the identity of a post-cued target. and there was no difference between connected and disconnected displays. In Experiment 3 participants were asked to report the predesignated name of each whole display and the accuracy rate was higher in the connected displays than in the disconnected ones. However negative repetition effects were observed consistently in all the experiments. This indicates uniform connectedness does not have a strong effect in perceiving briefly presented forms.

• The Journal of the Acoustical Society of Korea
• /
• v.6 no.4
• /
• pp.31-43
• /
• 1987

As a study on Speaker-Independent Isolated Word Recognition, a Modified ISODATA clustering method is proposed. This method simplifies the outlier processing and the splitting procedure in conventional ISODATA algorithm, and eliminates the lumping procedure. Through this method, we could find cluster centers precisely and automatically. When this method applied to 11 digits by 10 males and 4 females, its recognition rates of $84.42\%$ for K=4 were better than those of the latest Modified K-means, $82.5\%$. Judging from these results, we proved this method the best method in finding cluster centers precisely.

• Korean Journal of Social Welfare
• /
• v.49
• /
• pp.296-318
• /
• 2002

The purpose of this study is to empirically analyze whether or not, if a community social service center was affiliated with a governing body running other community social service centers, the center would have better organizational performance in comparing to an independently running center. Data was collected from a nationwide mailed and self-administered survey, which 237 centers out of 343 community social service centers responded. Even if, the response rate was 72%, 218 centers were finally analyzed due to the weakness of reliability and incompleteness. By the way, measurement of organizational performance as the dependent variable has been substituted of the results of nationwide organizational evaluation project as the secondary data. One of findings is that 68% of 218 responding centers appeared to be affiliated with a governing body which running more than three other centers, while 41% being affiliated with a body which running more than five other centers. However, a logistic regression analysis which using organizational performance as the dependent variable, has failed to verify the hypothesis that a center which affiliated with a governing body running other centers has better organizational performance when comparing to an independent center. The researcher assumes that a part of governing bodies has better performance and improves competitiveness while the other larger part of them pursues simple organizational growth. Thus, this situation made that the overall evaluation of being affiliated with a large governing body was not positive.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.655-671
• /
• 1996

Using object relationship table, this study proposes an efficient indexing technique for accessing both aggregation and inheritance hierarchies in object- oriented databases. This indexing technique uses the information on the aggregation and inheritance relationship between classes and the information on referencing instances as meta data. As a result, the technique makes it possible to effectively evaluates various queries navigating between tables. The study compares the proposed technique with the existing indexing techniques and discusses its useful- ness. It also provides the result of simulating its performance in terms of storage and retrieval cost.