• KIISE Transactions on Computing Practices
• /
• v.22 no.1
• /
• pp.38-43
• /
• 2016

Recent developments regarding transportation technology have positioned travel as a major leisure activity; however, trip-itinerary planning remains a challenging task for tourists due to the need to select Points of Interest (POI) for visits to unfamiliar cities. Meanwhile, due to the GPS functions on mobile devices such as smartphones and tablet PCs, it is now possible to collect a user's position in real time. Based on these circumstances, our research on an automatic itinerary-planning system to simplify the trip-planning process was conducted briskly. The existing studies that include research on itinerary schedules focus on an identification of the shortest path in consideration of cost and time constraints, or a recommendation of the most-popular travel route in the destination area; therefore, we propose a personalized itinerary-recommendation system for which the stay-time preference of the individual user is considered as part of the personalized service.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.1
• /
• pp.29-37
• /
• 2005

This paper proposes an automatic genre classification system for Korean traditional music. The Proposed system accepts and classifies queried input music as one of the six musical genres such as Royal Shrine Music, Classcal Chamber Music, Folk Song, Folk Music, Buddhist Music, Shamanist Music based on music contents. In general, content-based music genre classification consists of two stages - music feature vector extraction and Pattern classification. For feature extraction. the system extracts 58 dimensional feature vectors including spectral centroid, spectral rolloff and spectral flux based on STFT and also the coefficient domain features such as LPC, MFCC, and then these features are further optimized using SFS method. For Pattern or genre classification, k-NN, Gaussian, GMM and SVM algorithms are considered. In addition, the proposed system adopts MFC method to settle down the uncertainty problem of the system performance due to the different query Patterns (or portions). From the experimental results. we verify the successful genre classification performance over $97{\%}$ for both the k-NN and SVM classifier, however SVM classifier provides almost three times faster classification performance than the k-NN.

• Journal of KIISE:Software and Applications
• /
• v.37 no.4
• /
• pp.282-296
• /
• 2010

OWL is an ontology language for the Semantic Web, and suited to modelling the knowledge of a specific domain in the real-world. Ontology also can infer new implicit knowledge from the explicit knowledge. However, the modeled knowledge cannot be complete as the whole of the common-sense of the human cannot be represented totally. Ontology do not concern handling nonmonotonic reasoning to detect incomplete modeling such as the integrity constraints and exceptions. A default rule can handle the exception about a specific class in ontology. Integrity constraint can be clear that restrictions on class define which and how many relationships the instances of that class must hold. In this paper, we propose a practical reasoning system for open and closed-world reasoning that supports a novel hybrid integration of ontology based on open world assumption (OWA) and non-monotonic rule based on closed-world assumption (CWA). The system utilizes a method to solve the problem which occurs when dealing with the incomplete knowledge under the OWA. The method uses the answer set programming (ASP) to find a solution. ASP is a logic-program, which can be seen as the computational embodiment of non-monotonic reasoning, and enables a query based on CWA to knowledge base (KB) of description logic. Our system not only finds practical cases from examples by the Protege, which require non-monotonic reasoning, but also estimates novel reasoning results for the cases based on KB which realizes a transparent integration of rules and ontologies supported by some well-known projects.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.247-258
• /
• 2004

Recently, there have been researches on storage and retrieval technique of moving objects, which are highly concerned by user in database application area such as video databases, spatio-temporal databases, and mobile databases. In this paper, we propose a new signature-based indexing scheme which supports similar sub-trajectory retrieval at well as good retrieval performance on moving objects trajectories. Our signature-based indexing scheme is classified into concatenated signature-based indexing scheme for similar sub-trajectory retrieval, entitled CISR scheme and superimposed signature-based indexing scheme for similar sub-trajectory retrieval, entitled SISR scheme according to generation method of trajectory signature based on trajectory data of moving object. Our indexing scheme can improve retrieval performance by reducing a large number of disk access on data file because it first scans all signatures and does filtering before accessing the data file. In addition, we can encourage retrieval efficiency by appling k-warping algorithm to measure the similarity between query trajectory and data trajectory. Final]y, we evaluate the performance on sequential scan method(SeqScan), CISR scheme, and SISR scheme in terms of data insertion time, retrieval time, and storage overhead. We show from our experimental results that both CISR scheme and SISR scheme are better than sequential scan in terms of retrieval performance and SISR scheme is especially superior to the CISR scheme.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.762-773
• /
• 2014

As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

• Proceedings of the Korean Vacuum Society Conference
• /
• 1999.07a
• /
• pp.53-53
• /
• 1999

전계방출을 이용한 평판 표시장치는 CRT가 가진 장점을 모두 갖는 동시에 얇고 가벼우며 낮은 전력소모로 완벽한 색을 구현할 수 있는 차세대 표시장치로서 이에 대한 여국가 활발히 이루어지고 있다. 여기에 사용되는 음극물질로서 실리콘이나 몰리 등을 팁모양으로 제작하여 사용해 왔다. 하지만 잔류가스에 의한 역스퍼터링이나 화학적 반응에 의해서 전계방출 성능이 점차 저하되는 등의 해결해야할 많은 문제가 있다. 이러한 문제들을 해결하기 위하여 탄소계 재료로서 다이아몬드, 다이아몬드상 카본 등을 이용하려는 노력이 진행되어 왔다. 이중 유리화 비정형 탄소는 다량의 결함을 가지고 있는 유리질의 고상 탄소 재로로서, 전기전도도가 우수하면서 outgassing이 적고 기계적 강도가 뛰어나며 고온에서도 화학적으로 안정하여 전계방출 소자의 음극재료로서 알맞은 것으로 생각된다. 유리화 비정형 탄소가루를 전기영동법으로 기판에 코팅하여 전계방출 소자를 제작하였다. 전기영동 용액으로 이소프로필알코올에 질산마그네슘과 소량의 증류수, 유리화 비정형 탄소분말을 섞어주었고 기판으로는 몰리(Mo)가 증착된 유리를 사용하였다. 균일한 증착을 위해서 증착후 역전압을 걸어 주는 방법과 증착 후 플라즈마 처리를 하는 등의 여러 가지 방법을 사용했다. 전계방출 전류는 1$\times$10-7Torr이사에서 측정하였다. 1회 제작된 용액으로 반복해서 증착한 횟수에 따라 표면의 거치기, 입자의 분포, 전계방출 측정 결과 등의 차이가 관찰되었다. 발광이미지는 전압에 따라 변화하였고, 균일한 발광을 관찰하기 위해서 오랜 시간동안 aging 과정을 거쳐야 했다. 그리고 구 모양의 양극을 사용해서 위치를 변화시키며 시동 전기장을 관찰하여 위치에 따른 전계방출의 차이를 조사하여 발광의 균일성을 알 수 있었다.on microscopy로 분석하였으며 구조 분석은 X-선 회절분석, X-ray photoelectron spectroscopy 그리고Auger electron spectroscope로 하였다. 증착된 산화바나듐 박막의 전기화학적 특성을 분석하기 위하여 리튬 메탈을 anode로 하고 EC:DMC=1:1, 1M LiPF6 액체 전해질을 사용한 Half-Cell를 구성하여 200회 이상의 정전류 충 방전 시험을 행하였다. Half-Cell test 결과 박막의 결정성과 표면상태에 따라 매우 다른 전지 특성을 나타내었다.도상승율을 갖는 경우가 다른 베이킹 시나리오 모델에 비해 효과적이라 생각되며 초대 필요 공급열량은 200kW 정도로 산출되었다. 실질적인 수치를 얻기 위해 보다 고차원 모델로의 해석이 필요하리라 생각된다. 끝으로 장기적인 관점에서 KSTAR 장치의 베이킹 계획도 살펴본다.습파라미터와 더불어, 본 연구에서 새롭게 제시된 주기분할층의 파라미터들이 모형의 학습성과를 높이기 위해 함께 고려된다. 한편, 이러한 학습과정에서 추가적으로 고려해야 할 파라미터 갯수가 증가함에 따라서, 본 모델의 학습성과가 local minimum에 빠지는 문제점이 발생될 수 있다. 즉, 웨이블릿분석과 인공신경망모형을 모두 전역적으로 최적화시켜야 하는 문제가 발생한다. 본 연구에서는 이 문제를 해결하기 위해서, 최근 local minimum의 가능성을 최소화하여 전역적인 학습성과를 높여 주는 인공지능기법으로서 유전자알고리즘기법을 본 연구이 통합모델에 반영하였다. 이에 대한 실증사례 분석결과는 일일 환율예측문제를 적용하였을 경우, 기존의 방법론보다 더 나운 예측성과를 타나내었다.pective" to workflow architectural discussions. The vocabulary suggested