• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.461-470
• /
• 2005

In leaner-controlled environment where learners can decide and restructure the contents, methods and order of learning by themselves, it is possible to apply individualized learning in consideration of each learner's characteristics. The present study analyzed learners' learning path pattern, which is one of learners' characteristics important in Web-based teaching-learning process, using the Apriori algorithm and grouped learners according to their learning path pattern. Based on the result, we designed and implemented a multi-dimensional learning path pattern analysis system to provide individual learners with teaming paths, learning contents, learning media, supplementary teaming contents, the pattern of material presentation, etc. multi-dimensionally. According to the result of surveying satisfaction with the developed system satisfaction with supplementary learning contents was highest (Highly satisfied '$24.5\%$, Satisfied'$35.7\%$). By learners' level, satisfaction was higher in low-level learners (Highly satisfied'$20.2\%$, Satisfied'$31.2\%$) than in high-level learners (Highly satisfied'$18.4\%$, 'Satisfied'$28.54\%$). The developed system is expected to provide learners with multi-dimensionally meaningful information from various angles using OLAP technologies such as drill-up and drill-down.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.1
• /
• pp.21-28
• /
• 2016

The performance of an English-Korean machine translation system depends heavily on its English parser. The parser in this paper is a part of the rule-based English-Korean MT system, which includes many syntactic rules and performs the chart-based parsing. The parser generates too many structures due to many syntactic rules, so much time and memory are required. The rule-based parser has difficulty in analyzing and translating the long sentences including the commas because they cause high parsing complexity. In this paper, we propose the 3-phase parsing method with sentence segmentation to efficiently translate the long sentences appearing in usual. Each phase of the syntactic analysis applies its own independent syntactic rules in order to reduce parsing complexity. For the purpose, we classify the syntactic rules into 3 classes and design the 3-phase parsing algorithm. Especially, the syntactic rules in the 3rd class are for the sentence structures composed with commas. We present the automatic rule acquisition method for 3rd class rules from the syntactic analysis of the corpus, with which we aim to continuously improve the coverage of the parsing. The experimental results shows that the proposed 3-phase parsing method is superior to the prior parsing method using only intra-sentence segmentation in terms of the parsing speed/memory efficiency with keeping the translation quality.

• The KIPS Transactions:PartB
• /
• v.11B no.2
• /
• pp.187-198
• /
• 2004

The World-Wide Web is the largest distributed Information space and has grown to encompass diverse information resources. However, although Web is growing exponentially, the individual's capacity to read and digest contents is essentially fixed. From the view point of Web users, they can be confused by explosion of Web information, by constantly changing Web environments, and by lack of understanding needs of Web users. In these Web environments, mining traversal patterns is an important problem in Web mining with a host of application domains including system design and Information services. Conventional traversal pattern mining systems use the inter-pages association in sessions with only a very restricted mechanism (based on vector or matrix) for generating frequent k-Pagesets. We develop a family of novel algorithms (termed WebPR - Web Page Recommend) for mining frequent traversal patterns and then pageset to recommend. Our algorithms provide Web users with new page views, which Include pagesets to recommend, so that users can effectively traverse its Web site. The main distinguishing factors are both a point consistently spanning schemes applying inter-pages association for mining frequent traversal patterns and a point proposing the most efficient tree model. Our experimentation with two real data sets, including Lady Asiana and KBS media server site, clearly validates that our method outperforms conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2293-2300
• /
• 2008

In ad-hoc sensor network, AODV routing information is disclosed to other nodes because AODV protocol doesn't have any security mechanisms. The problem of AODV is that an attacker can falsify the routing information in RREQ packet. If an attacker broadcasts the falsified packet, other nodes will update routing table based on the falsified one so that the path passing through the attacker itself can be considered as a shortest path. In this paper, we design the routing-information-spoofing attack such as falsifying source sequence number and hop count fields in RREQ packet. And we suggest an efficient scheme for detecting the attackers and isolating those nodes from the network without extra security modules. The proposed scheme doesn't employ cryptographic algorithm and authentication to reduce network overhead. We used NS-2 simulation to evaluate the network performance. And we analyzed the simulation results on three cases such as an existing normal AODV, AODV under the attack and proposed AODV. Simulation results using NS2 show that the AODV using proposed scheme can protect the routing-information-spoofing attack and the total n umber of received packets for destination node is almost same as the existing norm at AODV.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.4
• /
• pp.117-122
• /
• 2021

In recent years, human damage and loss of money due to various disasters such as typhoons, earthquakes, forest fires, landslides, and wars are steadily occurring, and a lot of manpower and funds are required to prevent and recover them. In this paper, we designed and developed a disaster drone system based on artificial intelligence in order to monitor these various disaster situations in advance and to quickly recognize and respond to disaster occurrence. In this study, multiple disaster drones are used in areas where it is difficult for humans to monitor, and each drone performs an efficient search with an optimal path by applying a deep learning-based optimal path algorithm. In addition, in order to solve the problem of insufficient battery capacity, which is a fundamental problem of drones, the optimal route of each drone is determined using Ant Colony Optimization (ACO) technology. In order to implement the proposed system, it was applied to a forest fire situation among various disaster situations, and a forest fire map was created based on the transmitted data, and a forest fire map was visually shown to the fire fighters dispatched by a drone equipped with a beam projector. In the proposed system, multiple drones can detect a disaster situation in a short time by simultaneously performing optimal path search and object recognition. Based on this research, it can be used to build disaster drone infrastructure, search for victims (sea, mountain, jungle), self-extinguishing fire using drones, and security drones.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.584-585
• /
• 2021

As the production of new and renewable energy such as solar and wind power has diversified, microgrid systems that can simultaneously produce and consume have been introduced. In general, a decrease in electricity prices through solar power is expected in summer, so producer protection is required. In this paper, we propose a transparent and safe gift power transaction system between users using blockchain in a microgrid environment. A futures is simply a contract in which the buyer is obligated to buy electricity or the seller is obliged to sell electricity at a fixed price and a predetermined futures price. This system proposes a futures trading algorithm that searches for futures prices and concludes power transactions with automated operations without user intervention by using a smart contract, a reliable executable code within the blockchain network. If a power producer thinks that the price during the peak production period is likely to decrease during production planning, it sells futures first in the futures market and buys back futures during the peak production period to make a profit in the spot market. losses can be compensated. In addition, if there is a risk that the price of electricity will rise when a sales contract is concluded, a broker can compensate for a loss in the spot market by first buying futures in the futures market and liquidating futures when the sales contract is fulfilled.

• The KIPS Transactions:PartD
• /
• v.10D no.3
• /
• pp.459-470
• /
• 2003

It is required to research on high-dimensional index structures for efficiently retrieving high-dimensional data because an attribute vector in data warehousing and a feature vector in multimedia database have a characteristic of high-dimensional data. For this, many high-dimensional index structures have been proposed, but they have so called ‘dimensional curse’ problem that retrieval performance is extremely decreased as the dimensionality is increased. To solve the problem, the cell-based filtering (CBF) scheme has been proposed. But the CBF scheme show a linear decreasing on performance as the dimensionality. To cope with the problem, it is necessary to make use of parallel processing techniques. In this paper, we propose a parallel CBF scheme which uses a horizontally-partitioned technique as declustering. In order to maximize the retrieval performance of the proposed parallel CBF scheme, we construct our parallel CBF scheme under a SN (Shared Nothing) cluster architecture. In addition, we present a data insertion algorithm, a rage query processing one, and a k-NN query processing one which are suitable for the SN cluster architecture. Finally, we show that our parallel CBF scheme achieves better retrieval performance in proportion to the number of servers in the SN cluster architecture, compared with the conventional CBF scheme.

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

Because we can usually get many information through analyzing trajectories of moving objects on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. Also, because FNR-tree and MON-tree store the segment unit of moving objects, they can't support the trajectory of whole moving objects. In this paper, we propose an efficient trajectory index structures based on signatures on a spatial network, named SigMO-Tree. For this, we divide moving object data into spatial and temporal attributes, and design an index structure which supports not only range query but trajectory query by preserving the whole trajectory of moving objects. In addition, we divide user queries into trajectory query based on spatio-temporal area and similar-tralectory query, and propose query processing algorithms to support them. The algorithm uses a signature file in order to retrieve candidate trajectories efficiently Finally, we show from our performance analysis that our trajectory index structure outperforms the existing index structures like FNR-Tree and MON-Tree.

• Journal of the Korea Society for Simulation
• /
• v.18 no.3
• /
• pp.47-59
• /
• 2009

Due to the application-specific nature of wireless sensor networks, the sensitivity to such a requirement as data reporting latency may vary depending on the type of applications, thus requiring application-specific algorithm and protocol design paradigms which help us to maximize energy conservation and thus the network lifetime. In this paper, we propose a novel delay-adaptive sensor scheduling scheme for energy-saving data gathering which is based on a two phase clustering (TPC). The ultimate goal is to extend the network lifetime by providing sensors with high adaptability to the application-dependent and time-varying delay requirements. The TPC requests sensors to construct two types of links: direct and relay links. The direct links are used for control and forwarding time critical sensed data. On the other hand, the relay links are used only for data forwarding based on the user delay constraints, thus allowing the sensors to opportunistically use the most energy-saving links and forming a multi-hop path. Simulation results demonstrate that cluster-based delay-adaptive data gathering strategy (CD-DGS) saves a significant amount of energy for dense sensor networks by adapting to the user delay constraints.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2000.04a
• /
• pp.357-364
• /
• 2000

기존의 웹 디자인은 웹이라는 매체의 특성 상 디자인적인 요소가 매우 중요함에도 불구하고 디자인은 위한 구체적인 방법론이 미약하다. 특히, 많은 소비자들을 유인하고 구매를 촉발시켜야 하는 인터넷 쇼핑몰의 경우에는 더욱 더 그럼하에도 불구하고 이를 위한 전략적인 방법론이 부족하다. 즉, 기존 연구들은 제품의 다양성, 서비스, 촉진, 항해량, 편리성, 사용자 인터페이스 등이 중요하다고 하였지만 실제 인터넷 쇼핑몰을 디자인하는 입장에서는 활용하기가 상당히 애매하다. 그 이유는 이들 요인들은 서로 영향관계를 가지고 있어서 사용자 인터페이스가 복잡하면 항해량이 늘어나 편리성이 감소하고, 제품이 늘어나더라도 검색엔진을 사용하면 상대적으로 항해량이 감소하게 되어 편리성이 증가한다. 따라서, 이들 요인을 활용하여 인터넷 쇼핑몰을 구축하려면 요인간의 영향관계를 면밀히 파악하고 이 영향요인이 소비자의 구매행동에 어떠한 영향을 주는지가 충분히 검토되어야 한다.이에 본 연구에서는 퍼지인식도를 이용하여 인터넷 쇼핑몰 상에서 소비자의 구매행동에 영향을 주는 요인을 추출하고 이들 요인간의 인과관계를 도출하여 보다 구체적이고 전략적으로 인터넷 쇼핑몰을 디자인할 수 있는 방법으로 web-Cogmulator를 제시한다. Web-Cogmulator는 소비자의 쇼핑몰에 대한 암묵지식 형태의 구매행동을 형태지식화하여 지식베이스 형태로 가지고 있기 때문에 인터넷 쇼핑몰의 다양한 요인의 변화에 따른 소비자의 구매행동을 추론 시뮬레이션하는 것이 가능하다. 이에 본 연구에서는 기본적인 인터넷 쇼핑몰 시나리오를 바탕으로 추론 시뮬레이션을 실시하여 Web-Cogmulator의 유용성을 검증하였다.를, 지지도(support), 신뢰도(confidence), 리프트(lift), 컨빅션(conviction)등의 관계를 통해 다양한 방법으로 모색해본다. 이 연구에서 제안하는 이러한 개념계층상의 흥미로운 부분의 탐색은, 전자 상거래에서의 CRM(Customer Relationship Management)나 틈새시장(niche market) 마케팅 등에 적용가능하리라 여겨진다.선의 효과가 나타났다. 표본기업들을 훈련과 시험용으로 구분하여 분석한 결과는 전체적으로 재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computati