• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.12
• /
• pp.1272-1277
• /
• 2014

This article describes a path planning algorithm for fixed-wing UAVs when a real terrain should be considered. Nowadays, many UAVs are required to perform mission flights near given terrain for surveillance, reconnaissance, and infiltration, as well as flight altitude of many UAVs are relatively lower than typical manned aerial vehicles. Therefore, real terrain should be considered in path planning algorithms of fixed-wing UAVs. In this research, we have extended a spline-$RRT^*$ algorithm to three-dimensional planner. The spline-$RRT^*$ algorithm is a $RRT^*$ based algorithm, and it takes spline method to extend the tree structure over the workspace to generate smooth paths without any post-processing. Direction continuity of the resulting path is guaranteed via this spline technique, and it is essential factor for the paths of fixed-wing UAVs. The proposed algorithm confirm collision check during the tree structure extension, so that generated path is both geometrically and dynamically feasible in addition to direction continuity. To decrease degrees of freedom of a random configuration, we designed a function assigning directions to nodes of the graph. As a result, it increases the execution speed of the algorithm efficiently. In order to investigate the performance of the proposed planning algorithm, several simulations are performed under real terrain environment. Simulation results show that this proposed algorithm can be utilized effectively to path planning applications considering real terrain.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.5
• /
• pp.1281-1291
• /
• 2015

Compared to the past, people can control end devices via open channel. Although this open channel provides convenience to users, it frequently turns into a security hole. In this paper, we propose a new human-centered security risk analysis method that puts weight on the relationship between end devices. The measure derives from the concept of entropy rate, which is known as the uncertainty per a node in a network. As there are some limitations to use entropy rate as a measure in comparing different size of networks, we divide the entropy rate of a network by the maximum entropy rate of the network. Also, we show how to avoid the violation of irreducible, which is a precondition of the entropy rate of a random walk on a graph.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.32 no.4
• /
• pp.356-362
• /
• 1996

In order to suggest the useful information of fishing ground, a data base system on 32bit personal computer was developed and handled by using the catch data of Korean tuna long -line. This data base system was programmed using Quick Basic, and consisted of three kinds of programs, one for displaying the catch rate on the fishing ground by fishing area and year ranges, another for indicating the catch rate or number on table or graph, and the other for estimating the fishing ground in economical points, mainly targeting total tunas, yellowfin and bigeye tuna respectively. When this system was started, the map of oceans such as the Pacific, the Indian and the Atlantic, is drawn on the monitor. And then the catch rates of all species and each one are indicated by the figured symbols on the sea divisions of$5^{\circ}$ space of latitute and longitude.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2002-2019
• /
• 2017

RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.5
• /
• pp.1-11
• /
• 2022

With the development of deep learning technology, various research and development are underway to estimate preference rankings through learning, and it is used in various fields such as web search, gene classification, recommendation system, and image search. Approximation algorithms are used to estimate deep learning-based preference ranking, which builds more than k comparison sets on all comparison targets to ensure proper accuracy, and how to build comparison sets affects learning. In this paper, we propose a k-disjoint comparison set generation algorithm and a k-chain comparison set generation algorithm, a novel algorithm for generating paired comparison sets for crowd-sourcing-based deep learning affinity measurements. In particular, the experiment confirmed that the k-chaining algorithm, like the conventional circular generation algorithm, also has a random nature that can support stable preference evaluation while ensuring connectivity between data.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.2
• /
• pp.61-66
• /
• 2024

This paper aims to design a simulation for path-finding of objects in a simulation or game environment using reinforcement learning techniques. The main feature of this study is that the objects in the simulation are trained to avoid obstacles at random locations generated on a given track and to automatically explore path to get items. To implement the simulation, ML Agents provided by Unity Game Engine were used, and a learning policy based on PPO (Proximal Policy Optimization) was established to form a reinforcement learning environment. Through the reinforcement learning-based simulation designed in this study, we were able to confirm that the object moves on the track by avoiding obstacles and exploring path to acquire items as it learns, by analyzing the simulation results and learning result graph.

• Asia pacific journal of information systems
• /
• v.18 no.3
• /
• pp.67-90
• /
• 2008

Prior to making choices among online products and services, consumers often search online product reviews written by other consumers. Online product reviews have great influences on consumer behavior because they are believed to be more reliable than information provided by sellers. However, ever-increasing lists of product reviews make it difficult for consumers to find the right information efficiently. A customized search mechanism is a method to provide personalized information which fits the user's requirements. This study examines effects of a customized search mechanism and perceived similarity between consumers and product reviewers on consumer behaviors. More specifically, we address the following research questions: (1) Can a customized search mechanism increase perceived similarity between product review authors and readers? (2) Are product reviews perceived as more credible when product reviews were written by the authors perceived similar to them? (3) Does credibility of product reviews have a positive impact on acceptance of product reviews? (4) Does acceptance of product reviews have an influence on purchase intention of the readers? To examine these research questions, a lab experiment with a between-subject factor (whether a customized search mechanism is provided or not) design was employed. In order to enhance mundane realism and increase generalizability of the findings, the experiment sites were built based on a real online store, cherrya.com (http://www.cherrya.com/). Sixty participants were drawn from a pool that consisted of undergraduate and graduate students in a large university. Participation was voluntary; all the participants received 5,000 won to encourage their motivation and involvement in the experiment tasks. In addition, 15 participants, who selected by a random draw, received 30,000 won to actually purchase the product that he or she decided to buy during the experiment. Of the 60 participants, 25 were male and 35 were female. In examining the homogeneity between the two groups, the results of t-tests revealed no significant difference in gender, age, academic years, online shopping experience, and Internet usage. To test our research model, we completed tests of the measurement models and the structural models using PLS Graph version 3.00. The analysis confirmed individual item reliability, internal consistency, and discriminant validity of measurements. The results show that participants feel more credible when product reviews were written by the authors perceived similar to them, credibility of product reviews have a positive impact on acceptance of product reviews, and acceptance of product reviews have an influence on purchase intention of the readers. However, a customized search mechanism did not increase perceived similarity between product review authors and readers. The results imply that there is an urgent need to develop a better customized search tool in order to increase perceived similarity between product review authors and readers.

• The Korean Journal of Applied Statistics
• /
• v.27 no.4
• /
• pp.645-653
• /
• 2014

P-value is the probability of observing a current sample and possibly other samples departing equally or more extremely from the null hypothesis toward postulated alternative hypothesis. When p-value is less than a certain level called ${\alpha}$(= 0:05), researchers claim that the alternative hypothesis is supported empirically. Unfortunately, some findings discovered in that way are not reproducible, partly because the p-value itself is a statistic vulnerable to random variation. Boos and Stefanski (2011) suggests calculating the upper limit of p-value in hypothesis testing, using a bootstrap predictive distribution. To determine the sample size of a replication study, this study proposes thought experiments by simulating boosted bootstrap samples of different sizes from given observations. The method is illustrated for the cases of two-group comparison and multiple linear regression. This study also addresses the reproducibility of the points in the given 95% confidence interval. Numerical examples show that the center point is covered by 95% confidence intervals generated from bootstrap resamples. However, end points are covered with a 50% chance. Hence this study draws the graph of the reproducibility rate for each parameter in the confidence interval.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.2
• /
• pp.335-344
• /
• 2020

This study compared the structures and changes of help network between pre-service secondary teachers and pre-journalists who participated in the class related to network analysis to seek ways to activate a professional learning community. For this study, we used Exponential Random Graph Models (ERGM) based on ties as being interdependent and not conventional regression models requiring assumptions of independence between observations. The analysis subjects were 43 pre-service secondary teachers and 29 pre-journalists who responded both early and late in the help network survey. The main results were as follows. First, full models with network structural terms were better than simple models with no structural terms. Second, the effect of transitivity was not statistically significant in the pre-service secondary teachers' network. However, it was statistically significant in the pre-journalists' network. Third, there were effects of reciprocity, indegree popularity, and outdegree activity in the early help network of pre-service secondary teachers. On the contrary, there were only the positive effects of reciprocity and the negative effect of outdegree activity in the late network. Finally, this study demonstrated the possibility in educational fields' application of network structural effects and provided limitations and directions for future research.

• Journal of Internet Computing and Services
• /
• v.23 no.3
• /
• pp.47-56
• /
• 2022

The safe driving reward system aims to reduce the loss of life and property by reducing the occurrence of accidents by motivating safe driving and encouraging active participation by providing direct reward to vehicle drivers who have performed safe driving. In the case of the existing digital tachograph, the goal is to limit dangerous driving by recording the driving status of the vehicle whereas the safe driving reward system is a support measure to increase the effect of accident prevention and induces safe driving with financial reward when safe driving is performed. In other words, in an area where accidents due to speeding are high, direct reward is provided to motivate safe driving to prevent traffic accidents when safe driving instructions such as speed compliance, maintaining distance between vehicles, and driving in designated lanes are performed. Since these safe operation data and reward histories must be managed transparently and safely, the reward evidences and histories were constructed using the closed blockchain Hyperledger Fabric. However, while transparency and safety are guaranteed in the blockchain system, low data processing speed is a problem. In this study, the sequential block generation speed was as low as 10 TPS(transaction per second), and as a result of applying the acceleration function a high-performance network of 1,000 TPS or more was implemented.