• Journal of Practical Engineering Education
• /
• v.15 no.2
• /
• pp.509-517
• /
• 2023

The reactive web service provides a related word recommendation system using the TextRank algorithm and a word-based idea generation service selected by the user. In the related word recommendation system, the method of weighting each word using the TextRank algorithm and the probability output method using SoftMax are discussed. The idea generation service discusses the idea generation method and the artificial intelligence reinforce-learning method using mini-GPT. The reactive web discusses the linkage process between React, Spring Boot, and Flask, and describes the overall operation method. When the user enters the desired topic, it provides the associated word. The user constructs a mind map by selecting a related word or adding a desired word. When a user selects a word to combine from a constructed mind-map, it provides newly generated ideas and related patents. This web service can share generated ideas with other users, and improves artificial intelligence by receiving user feedback as a horoscope.

• Journal of Advanced Navigation Technology
• /
• v.21 no.1
• /
• pp.119-125
• /
• 2017

In this paper, we propose a method that merges and splits players in the MeanShift tracking framework. The MeanShift tracking moves the center of tracking window to the maximum probability location given the target probability distribution. This tracking method has been widely used for real-time tracking problems because of its fast processing speed. However, it hardly handles occlusions in multiple object tracking systems. Occlusions can be usually solved by applying data association methods. In this paper, we propose a method that can be applied before data association methods. The proposed method automatically merges and splits the overlapped players by adjusting the each player's tracking map. We have compared the tracking performance of the MeanSfhit tracking algorithm and the proposed method.

• Journal of Space Technology and Applications
• /
• v.3 no.2
• /
• pp.118-143
• /
• 2023

Space is becoming more commercialized. Despite of its delayed start-up, space activities in Korea are attracting more nation-wide supports from both investors and government. May 25, 2023, KSLV II, also called Nuri, successfully transported, and inserted seven satellites to a sun-synchronous orbit of 550 km altitude. However, Starlink has over 4,000 satellites around this altitude for its commercial activities. Hence, it is necessary for us to constantly monitor the collision risks of these satellites against resident space objects including Starlink. Here we report a quantitative research output regarding the conjunctions, particularly between the Nuri satellites and Starlink. Our calculation shows that, on average, three times everyday, the Nuri satellites encounter Starlink within 1 km distance with the probability of collision higher than 1.0E-5. A comparative study with KOMPSAT-5, also called Arirang-5, shows that its distance of closest approach distribution significantly differs from those of Nuri satellites. We also report a quantitative analysis of collision-avoiding maneuver cost of Starlink satellites and a strategy for Korea, being a delayed starter, to speed up to position itself in the space leading countries. We used the AstroOne program for analyses and compared its output with that of Socrates Plus of Celestrak. The two line element data was used for computation.

• The Journal of Korean Association of Computer Education
• /
• v.16 no.2
• /
• pp.29-37
• /
• 2013

In the environment of emphasizing creativity, computer application instruction model is in demand which is developed for the group discussion, enlarging the range of thinking, and creativity. The purpose of this study is to develop a PBL-based computer application instruction model concerning creativity after researching problems during the use of computer education by group. The theoretical background of class model is PBL, and the efficiency and creativity of class is considered while using web-mind map as the tool for the discussion and data sharing. As a result of applying the suggested model to the students enrolled in the production of presentation instruction, it made probabilistic meaningful outcome where complaint with communication, data sharing, role sharing, difference of contribution, excessive run-time and etc. were reduced.

• The Journal of Information Systems
• /
• v.16 no.3
• /
• pp.1-20
• /
• 2007

Most researches on the corporate credit rating are generally classified into the area of bankruptcy prediction and bond rating. The studies on bankruptcy prediction have focused on improving the performance in binary classification problem, since the criterion variable is categorical, bankrupt or non-bankrupt. The other studies on bond rating have predicted the credit ratings, which was already evaluated by bond rating experts. The financial institute, however, should perform effective loan evaluation and risk management by employing the corporate credit rating model, which is able to determine the credit of corporations. Therefore, this study presents a corporate credit rating method using business failure probability map(BFPM) and AHP(Analytic Hierarchy Process). The BFPM enables us to rate the credit of corporations according to business failure probability and data distribution or frequency on each credit rating level. Also, we developed AHP model for credit rating using non-financial information. For the purpose of completed credit rating model, we integrated the BFPM and the AHP model using both financial and non-financial information. Finally, the credit ratings of each firm are assigned by our proposed method. This method will be helpful for the loan evaluators of financial institutes to decide more objective and effective credit ratings.

• Journal of Auto-vehicle Safety Association
• /
• v.11 no.2
• /
• pp.29-34
• /
• 2019

This paper presents a new method for construction of a static obstacle map. A static obstacle is important since it is utilized to path planning and decision. Several established approaches generate static obstacle map by grid method and counting algorithm. However, these approaches are occasionally ineffective since the density of LiDAR layer is low. Our approach solved this problem by applying probability theory. First, we converted all LiDAR point to Gaussian distribution to considers an uncertainty of LiDAR point. This Gaussian distribution represents likelihood of obstacle. Second, we modeled dynamic transition of a static obstacle map by adopting the Hidden Markov Model. Due to the dynamic characteristics of the vehicle in relation to the conditions of the next stage only, a more accurate map of the obstacles can be obtained using the Hidden Markov Model. Experimental data obtained from test driving demonstrates that our approach is suitable for mapping static obstacles. In addition, this result shows that our algorithm has an advantage in estimating not only static obstacles but also dynamic characteristics of moving target such as driving vehicles.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.8
• /
• pp.331-338
• /
• 2022

Successor representation (SR) is a model of human reinforcement learning (RL) mimicking the underlying mechanism of hippocampal cells constructing cognitive maps. SR utilizes these learned features to adaptively respond to the frequent reward changes. In this paper, we evaluated the performance of SR under the context where changes in latent variables of environments trigger the reward structure changes. For a benchmark test, we adopted SR-Dyna, an integration of SR into goal-driven Dyna RL algorithm in the 2-stage Markov Decision Task (MDT) in which we can intentionally manipulate the latent variables - state transition uncertainty and goal-condition. To precisely investigate the characteristics of SR, we conducted the experiments while controlling each latent variable that affects the changes in reward structure. Evaluation results showed that SR-Dyna could learn to respond to the reward changes in relation to the changes in latent variables, but could not learn rapidly in that situation. This brings about the necessity to build more robust RL models that can rapidly learn to respond to the frequent changes in the environment in which latent variables and reward structure change at the same time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.44-50
• /
• 2014

Chaos communication system is one of the security algorithms that is applied to improve the security. Chaos signal is non-linear, and it is generated randomly according to the initial conditions. Also, chaos communication system has characteristics such as non-periodic, wide-band, non-predictability of signals and easy implementation. So, security of chaos communication system is superior, and it has low interception probability and good anti-jamming characteristic. However, BER performance is worse than digital communication system, because it has many self interference signal in case of CDSK system. To improve these disadvantages, we analyze the PDF trend which can improve the BER performance in existing study, and we proposed a chaos map. And, proposed chaos map was defined as the 'Boss map'. Generally, BER performance is changed according to initial values, parameters and spreading factors. Therefore, in this paper, we will introduce PDF trends which can improve the BER performance, and will describe about Boss map. Also, characteristics of Boss map is analyzed by evaluating the BER performance of Boss map according to initial values, parameters and spreading factors. As a result, while maintaining the similar BER performance, initial value of Boss map can be selected from 0 to 1.2, and BER performance is best when parameter alpha is 2.5. Also, BER performance is best when spreading factor is 50.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.5
• /
• pp.565-570
• /
• 2015

Spread spectrum communications have increased interest due to their immunity to channel fading and low probability of intercept. One of the limitations of the traditional digital spread spectrum systems is the need for spreading code synchronization. Chaotic communication is the analogue alternative of digital spread spectrum systems beside some extra features like simple transceiver structures. In this paper, This paper was used instead of the digital modulation and demodulation carriers for use in the chaotic signal in a digital communication system among the chaotic modulation schemes, the Differential Chaos Shift Keying(DCSK) is the most efficient one because its demodulator detects the data without the need to chaotic signal phase recovery. Also Implementation of Differential Chaos Shift Keying Communication System Using Matlab/Simulink and the receiver con decode the binary information sent by the transmitter, performance curves of DCSK are given in terms of bit-error probability versus signal to noise ratio with spreading factor as a parameter and we compare it to BPSK modulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.587-595
• /
• 2015

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.