• Journal of Korea Society of Industrial Information Systems
• /
• v.28 no.2
• /
• pp.31-45
• /
• 2023

This study deals with exploring qualitative steps and paths that appear as YouTube users' usage time increases quantitatively. For the study, I applied theories from psychology and neuroscience, subdivided the interval between the personalization algorithm of the recommendation system, and active use and analyzed the relationship between variables in this process. According to the theory behavioral model theory (FBM), variable reward, and dopamine addiction were applied. Personalization algorithms easy clicks as triggers according to associated content presentation functions in behavioral model theory (FBM). Variable rewards increase motivational effectiveness with unpredictability of the content you search, and dopamine nation is summarized as stimulating the dopaminergic nerve to continuously and actively consume content. This study is expected to make an academic and practical contribution in that it divides the purpose of use of content in the personalization algorithm and active use section into four stages from a psychological perspective: first use, reuse, continuous use, and active use, and analyzes the path.

• Journal of Intelligence and Information Systems
• /
• v.29 no.2
• /
• pp.101-114
• /
• 2023

In the wartime, aircraft carrying out a mission to strike the enemy deep in the depth are exposed to the risk of being shoot down. As a key combat force in mordern warfare, it takes a lot of time, effot and national budget to train military flight personnel who operate high-tech weapon systems. Therefore, this study studied the path problem of predicting the route of emergency escape from enemy territory to the target point to avoid obstacles, and through this, the possibility of safe recovery of emergency escape military flight personnel was increased. based problem, transforming the problem into a TSP, VRP, and Dijkstra algorithm, and approaching it with an optimization technique. However, if this problem is approached in a network problem, it is difficult to reflect the dynamic factors and uncertainties of the battlefield environment that military flight personnel in distress will face. So, MDP suitable for modeling dynamic environments was applied and studied. In addition, GIS was used to obtain topographic information data, and in the process of designing the reward structure of MDP, topographic information was reflected in more detail so that the model could be more realistic than previous studies. In this study, value iteration algorithms and deterministic methods were used to derive a path that allows the military flight personnel in distress to move to the shortest distance while making the most of the topographical advantages. In addition, it was intended to add the reality of the model by adding actual topographic information and obstacles that the military flight personnel in distress can meet in the process of escape and escape. Through this, it was possible to predict through which route the military flight personnel would escape and escape in the actual situation. The model presented in this study can be applied to various operational situations through redesign of the reward structure. In actual situations, decision support based on scientific techniques that reflect various factors in predicting the escape route of the military flight personnel in distress and conducting combat search and rescue operations will be possible.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.20 no.3
• /
• pp.67-79
• /
• 2017

Increasing transportation dependence on the metro system has lead to the convenience of passengers becoming as important as the transportation capacity. In this study, a pedestrian simulator has been developed that can quantitatively assess the pedestrian environment in terms of attributes such as speed and distance. The simulator consists of modules designed for 3D indoor map authoring and algorithmic pedestrian modeling. Module functions for 3D indoor map authoring include 3D spatial modeling, network generation, and evaluation of obtained results. The pedestrian modeling algorithm executes functions such as conducting a path search, allocation of users, and evaluation of level of service (LOS). The primary objective behind developing the said functions is to apply and analyze various scenarios repeatedly, such as before and after the improvement of the pedestrian environment, and to integrate the spatial information database with the dynamic information database. Furthermore, to demonstrate the practical applicability of the proposed simulator in the future, a test-bed was constructed for a currently operational metro station and the quantitative index of the proposed improvement effect was calculated by analyzing the walking speed of pedestrians before and after the improvement of the passage. The possibility of database extension for further analysis has also been discussed in this study.

• Journal of Gifted/Talented Education
• /
• v.21 no.4
• /
• pp.979-992
• /
• 2011

Gifted children cultivate their many talents through experience. For the purpose of revealing the talents or abilities of gifted children, it is necessary to provide them with various types of environment for their exploration from the early stage of their school age. In addition, knowing their concern, aptitude and interest from the early stage of their school age will be much helpful for them to grow, advance and search for their future career path. Accordingly, the purpose of this study is to examine the definitional and cognitive characteristics of gifted children through tests on the creative disposition, creative thinking power, multiple intelligences and morality of gifted children at the early stage of their school age in order to provide basic information on the gifted children studies. Accordingly, 90 gifted children were selected as the participants of this study through observation and recommendation. The result showed much difference between the second grade and the third grade in their creative disposition, creative thinking power, multiple intelligences and morality according to school year. As for the difference according to gender, the second grade female students showed meaningful differences in the sub-domain of creative disposition, multiple intelligences and morality and the third grade showed no differences. Such study result shows that students in upper school year clearly have their own sense of purpose.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.11-22
• /
• 2004

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. Consequently, reducing cache misses emerges as the most important issue in current main memory databases, in which CPU speeds have been increasing at 60% per year, compared to the memory speeds at 10% per you. In this paper, we design and implement a main-memory database system for real-time mobile GIS. Our system is composed of 5 modules： the interface manager provides the interface for PDA users； the memory data manager controls spatial and non-spatial data in main-memory using virtual memory techniques； the query manager processes spatial and non-spatial query : the index manager manages the MR-tree index for spatial data and the T-tree index for non-spatial index : the GIS server interface provides the interface with disk-based GIS. The MR-tree proposed propagates node splits upward only if one of the internal nodes on the insertion path has empty space. Thus, the internal nodes of the MR-tree are almost 100% full. Our experimental study shows that the two-dimensional MR-tree performs search up to 2.4 times faster than the ordinary R-tree. To use virtual memory techniques, the memory data manager uses page tables for spatial data, non- spatial data, T-tree and MR-tree. And, it uses indirect addressing techniques for fast reloading from disk.

• Journal of Korean Society of Transportation
• /
• v.23 no.7 s.85
• /
• pp.99-110
• /
• 2005

Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

• Journal of The Korean Association For Science Education
• /
• v.35 no.3
• /
• pp.383-393
• /
• 2015

This study analyzed the 6th grade elementary science textbook 'Science stories' reading process of students by utilizing eye movement tracking techniques. Participants read 3 articles in the new experimental science textbooks and solved 9 problems about each article. By understanding and academic achievement results, participants were divided into high-groups, middle-groups, and low-groups. The results of eye movement characteristics of the high-groups and low-groups had the following differences. Number of fixations and number of regressions were higher in high-groups. Average fixation duration and average regressive fixation duration were longer in low-groups. Fixation time for the key sentence of the article was longer in high-groups. Analysis of a scan path and post-interview, high-groups had frequent regression between sentences and they knew where the core of the article is and paid much attention there. In contrast low-groups are sequentially read most articles and some of them had a leap of abnormal range. Problem-solving approach is also different between groups. In conclusion reading style is associated with the science stories comprehension and students who had more regressions, much core search process, effective attention distribution, high concentration showed better understanding results. Also words or sentences used in textbooks are associated with science stories comprehension.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.129-139
• /
• 2012

Given digraph network $D=(N,A),n{\in}N,a=c(u,v){\in}A$ with source s and sink t, the maximum flow from s to t is determined by cut (S, T) that splits N to $s{\in}S$ and $t{\in}T$ disjoint sets with minimum cut value. The Ford-Fulkerson (F-F) algorithm with time complexity $O(NA^2)$ has been well known to this problem. The F-F algorithm finds all possible augmenting paths from s to t with residual capacity arcs and determines bottleneck arc that has a minimum residual capacity among the paths. After completion of algorithm, you should be determine the minimum cut by combination of bottleneck arcs. This paper suggests maximum adjacency merging and compute cut value method is called by MA-merging algorithm. We start the initial value to S={s}, T={t}, Then we select the maximum capacity $_{max}c(u,v)$ in the graph and merge to adjacent set S or T. Finally, we compute cut value of S or T. This algorithm runs n-1 times. We experiment Ford-Fulkerson and MA-merging algorithm for various 8 digraph. As a results, MA-merging algorithm can be finds minimum cut during the n-1 running times with time complexity O(N).

• Journal of Environmental Impact Assessment
• /
• v.24 no.5
• /
• pp.532-548
• /
• 2015

The winter ecology of individual yellow-throated martens(Martes flavigula) intemperate region of Korea were studied through snow-tracking. The study was performed across 3 winter seasons, from January 2011 to February 2013. Total distance of 49.8km was snow tracked (comprising 13 snow-tracking routes) to determine winter foraging habits, general behavior and movement paths of solitary and small groups (1-6 individuals; $mean=2.9{\pm}1.6$) of yellow-throated martens. The martens in the current study were omnivorous, with their winter diet including 9 animal and 5 plant species. Yellow-throated martens searched for food near and under the fallen logs and branches, root plates of fallen trees, around the roots of growing trees, and in small holes in the ground. They also climbed trees to search inside the tree holes and vacant bird nests. Foraging activity was estimated to occur at a frequency of 1.20 times/km, while territory marking occurred 1.42 times/km on average. Of the 60 documented foraging activities we observed, 17 were successful (28.3%). Moving activity and territory marking mainly occurred along ridges, whereas foraging activity was recorded in valleys, slopes, and forest edges. To protect the habitat of this species, the entire forest should be preserved, including the valleys, slopes, and even forest edges as well as main ridges.