• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.450-456
• /
• 2011

In this paper, idle channel search schemes based on spectrum sensing are proposed for cognitive radio systems with multiple channels. Specifically, we propose a scheme for determining the order of sensing for multiple channels, for which the probability of each channel being idle is estimated every search interval. By performing sensing in the descending order of the probabilities, the time required for searching idle channels is expected to decrease. In addition, we combine the proposed scheme with a user grouping scheme to further improve the sensing performance. Simulation results show that the user grouping reduces the search time, although it degrades the reliability of detection. The proposed search scheme based on probability estimation of channel idleness is found to reduce the search time significantly as compared to the conventional random search scheme. We apply both the proposed search scheme and user grouping scheme to a cognitive radio system to validate the overall performance.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.38 no.3
• /
• pp.221-227
• /
• 2010

Recent development in seeker technology explores a new seeker design in which, with larger field-of-view (FOV), optical parts are strapped down to a body (hence, called as a body-fixed seeker or a strapdown seeker). This design has several advantages such as comparatively easier maintenance and calibration by removing complex mechanical moving parts, increasing reliability, and cost savings. On the other hand, the strapdown seeker involves difficulties in implementing guidance laws since it does not directly provide inertial LOS rates. Instead, information for generating guidance commands should be extracted by estimating missile/target relative motion utilizing target images on the image plane of a strapdown seeker. In this research, a new framework based on an unscented Kalman filter is developed for estimating missile/target relative motion on the simplified assumption of a point source target. Performance of a terminal guidance algorithm, in which guidance command is generated based on the estimated relative motion, is demonstrated by a missile/target engagement simulation.

• Journal of IKEEE
• /
• v.25 no.3
• /
• pp.437-444
• /
• 2021

In this paper, we propose an autonomous driving algorithm that allows a robot to explore various terrains, and implement an application that can monitor the robot's movement path during terrain search. The implemented application consists of a status unit that indicates the position, direction, speed, and motion of the mobile robot, a map unit that displays terrain information obtained through terrain search, and a control unit that controls the movement of the mobile robot. In order to control the movement of the robot, only the start and stop of the search/return is commanded by the application, and all driving for the search is performed autonomously. The basic algorithm for terrain search uses an infrared sensor to check for obstacles in the order of left, front, right, and rear, and if there is no obstacle and the path traveled is a dead end, it returns to the previous position and moves in the other direction to continue the search. Repeat the process to explore the terrain.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.25 no.2
• /
• pp.169-177
• /
• 2019

It is very important to understand the intention of a target ship to prevent collisions in multiple-ship situations. However, considering the intentions of a large number of ships at the same time is a great burden for the officer who must establish a collision avoidance plan. With a distributed algorithm, a ship can exchange information with a large number of target ships and search for a safe course. In this paper, I have applied a Distributed Stochastic Search Algorithm (DSSA), a distributed algorithm, for ship collision avoidance. A ship chooses the course that offers the greatest cost reduction or keeps its current course according to probability and constraints. DSSA is divided into five types according to the probability and constraints mentioned. In this paper, the five types of DSSA are applied for ship collision avoidance, and the effects on ship collision avoidance are analyzed. In addition, I have investigated which DSSA type is most suitable for collision avoidance. The experimental results show that the DSSA-A and B schemes offered effective ship collision avoidance. This algorithm is expected to be applicable for ship collision avoidance in a distributed system.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.5
• /
• pp.245-253
• /
• 2023

The purpose of this study was to investigate the effect of pre-service early childhood teachers' reality shock and school burnout on career search self-efficacy. The study participants were 195 pre-service early childhood teachers. The results of the study were as follows: First, it was found that pre-service early childhood teachers had relatively high level of reality shock, school burnout, and career search self-efficacy. Second, there was a significant positive correlation between reality shock and school burnout and negative correlation between reality shock, school burnout, and career search self-efficacy of pre-service early childhood teachers. Third, pre-service early childhood teachers' reality shock and school burnout significantly influenced career search self-efficacy. The result of this study provides educational basic data on an early childhood teacher training program in improving career search self-efficacy.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.3
• /
• pp.155-164
• /
• 2010

This paper proposes a robust detection method for ship wake search using two wake sensors. A long trailing wake in the rear of a surface ship is generated along the track of surface ships. In this paper, we assume that the nearer the surface ship, the stronger wake strength is and a two-sensor based wake homing torpedo can sense for the wake strength. On this assumption we propose a simple wake detection and search method using information of wake strength. Experimental results using monte-carlo simulation demonstrate that the proposed method yields better performance in search time than previous method, which uses a single sensor. Our method is shown faster by about 45 seconds than previous method to achieve the same performance. Also, it can improve the detection performance of torpedo in the case of short wake length.

• Journal of Global Scholars of Marketing Science
• /
• v.14
• /
• pp.17-37
• /
• 2004

This research is speak that is tendencious in comprehension of external consumer information search behavior using on-line external information source to consumers who use on-line that is used as corporations' main strategic means. That is, classify consumer groups which was atomized according to type inflict consumer's information search knowledge level and shopping value study which use on-line, and decision factors of information search that these groups can influence a difference or each group which use information sources grasped what it is. Result that investigate information search knowledge level difference about study finding on-line information source utilization used mainly portal site, comparison site, auction site. And, utilization shopping pursuit value group used information source by portal site, auction site, niche shopping mall site and hedonic shopping pursuit value group used information source by portal site, auction site, shopping mall site. It confirmed that all variables(i.e. consumer-based variable and web site-based variable) are influencing variously in on-line external information search types. Finally, we proposed different way to erect strategic model about consumers that use on-line with study finding that see.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.566-576
• /
• 2017

Key-value stores proved its superiority by being applied to various NoSQL databases such as Redis, Memcached. Lookup performance is important because key-value store applications performs more lookup than insert operations in most environments. However, in traditional applications, lookup may be slow because hash tables are constructed out of linked-list. Therefore, cuckoo hashing has been getting attention from the academia for constant lookup time, and bucketized cuckoo hashing (BCH) has been proposed since it can achieve high load factor. In this paper, we introduce Sorting Cuckoo which inserts data using insertion sort in BCH structure. Sorting Cuckoo determines the existence of a key with a relatively small memory access because data are sorted in each buckets. In particular, the higher memory load factor, the better lookup performance than BCH's. Experimental results show that Sorting Cuckoo has smaller memory access than BCH's as many as about 19 million (25%) in 10 million negative lookup operations (key is not in the table), about 4 million times (10%) in 10 million positive lookup operations (where it is) with load factor 95%.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.6 s.38
• /
• pp.127-136
• /
• 2005

Recently, the damages occurring from the malware are increasing rapidly, regardless of continuous development of commercial vaccines . Generally, the vaccine detects well-known malware effectively, but it becomes helpless without any information against the unknown ones. Also, the malware generates its variations fast enough, so that the vaccine always gets behind in its updates. In this paper, we are describing a design and development of malware detection tool, which can detect such malware effectively. We first analyze the general functionality of the malware, and then extracts specific signatures. Such that, we can actively cope with a malware, which may come in previous type, a new type, and any of its mutations also.

• Journal of the Korean Institute of Gas
• /
• v.1 no.1
• /
• pp.33-40
• /
• 1997

An optimization system, APROGA II using genetic algorithm, was developed to solve multi-modal and multiobjective problems. To begin with, Multi-Niche Crowding(MNC) algorithm was used for multi-modal optimization problem. Secondly, a new algorithm was suggested for multiobjective optimization problem. Pareto dominance tournaments and Sharing on the non-dominated frontier was applied to it to obtain multiple objectives. APROGA II uses these two algorithms and the system has three search engines(previous APROGA search engine, multi-modal search engine and multiobjective search engine). Besides, this system can handle binary and discrete variables. And the validity of APROGA II was proved by solving several test functions and case study problems successfully.