• The Journal of the Korea Contents Association
• /
• v.14 no.8
• /
• pp.365-373
• /
• 2014

The assignment of exploration on individuals provides challenging work environments, while it generates high levels of complexity. On the other hand, the assignment of exploitation on individuals offers less challenging work environments, while it makes low levels of complexity. Give the characteristics of exploration and exploitation, I argue that the assignments of both exploration and exploitation create the favorable work environments to individuals. Developed hypotheses were tested using a logit regression from a sample of 168 project managers in a R&D center. I found that a manager who experienced exploitation project(s) is positively related to higher performance in exploitation project(s). In addition, a manager who experienced both exploitation and exploration projects are found to be positively associated with higher project performance.

• Fire Science and Engineering
• /
• v.33 no.1
• /
• pp.164-170
• /
• 2019

This paper discusses the characteristics of the fire service organization structure in the Republic of Korea. The subjects of the study were selected by the fire service organization consisting of public firefighters in the Republic of Korea. The characteristics of the fire service organization structure (complexity, centrality, and officiality) were confirmed by various articles and previous references. The fire service organization showed a mechanical structure and bureaucratic organization. The levels of complexity, centrality, and officiality in the characteristics of fire service organization structure were higher than those of a general administration organization or company organization. In conclusion, this paper contributes to the development of fire service organization theory by confirming the characteristics of fire service organization structure.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.339-345
• /
• 2015

In this paper, we present an iterative reliability-based modified majority-logic decoding algorithm for two classes of structured low-density parity-check codes. Different from the conventional modified one-step majority-logic decoding algorithms, we design a turbo-like iterative strategy to recover the performance degradation caused by the simply flipping operation. The main computational loads of the presented algorithm include only binary logic and integer operations, resulting in low decoding complexity. Furthermore, by introducing the iterative set, a very small proportion (less than 6%) of variable nodes are involved in the reliability updating process, which can further reduce the computational complexity. Simulation results show that, combined with the factor correction technique and a well-designed non-uniform quantization scheme, the presented algorithm can achieve a significant performance improvement and a fast decoding speed, even with very small quantization levels (3-4 bits resolution). The presented algorithm provides a candidate for trade-offs between performance and complexity.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.213-220
• /
• 2015

In this paper, we present a reliability-based iterative proportionality-logic decoding algorithm for two classes of structured low-density parity-check (LDPC) codes. The main contributions of this paper include: 1) Syndrome messages instead of extrinsic messages are processed and exchanged between variable nodes and check nodes, which can reduce the decoding complexity; 2) a more flexible decision mechanism is developed in which the decision threshold can be self-adjusted during the iterative process. Such decision mechanism is particularly effective for decoding the majority-logic decodable codes; 3) only part of the variable nodes satisfying the pre-designed criterion are involved for the presented algorithm, which is in the proportionality-logic sense and can further reduce the computational complexity. Simulation results show that, when combined with factor correction techniques and appropriate proportionality parameter, the presented algorithm performs well and can achieve fast decoding convergence rate while maintaining relative low decoding complexity, especially for small quantized levels (3-4 bits). The presented algorithm provides a candidate for those application scenarios where the memory load and the energy consumption are extremely constrained.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.407-417
• /
• 2014

A new-generation video coding standard, named High Efficiency Video Coding (HEVC), has recently been developed by JCT-VC. This new standard provides a significant improvement in picture quality, especially for high-resolution videos. However, one the most important challenges in HEVC is time complexity. A quadtree-based structure is created for the encoding and decoding processes and the rate-distortion (RD) cost is calculated for all possible dimensions of coding units in the quadtree. This provides a high encoding quality, but also causes computational complexity. We focus on a reduction scheme of the computational complexity and propose a new approach that can terminate the quadtree-based structure early, based on the RD costs of the parent and current levels. Our proposed algorithm is compared with HEVC Test Model version 10.0 software and a previously proposed algorithm. Experimental results show that our algorithm provides a significant time reduction for encoding, with only a small loss in video quality.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.42
• /
• pp.39-47
• /
• 1997

There are four parameters (i.e. overall density, local density, grouping, layout complexity) to consider in designing screen of a visual display terminal. Among these, only the optimum level of overall density is known to be about 25~30% by some studies. Therefore, the present experiment is conducted to define the optimum levels of the other parameters to achieve the user's best performance in visual search task. The results are as follows; (1) The function related to the levels of local density and user's search times is shown to be U -shaped. When the level of local density is about 40%, the search time is shorter than those of any other levels. (2) In the experiment of grouping, user's performance is best when the number of group is 5, and the size of group does not exceed visual angle $5^{\circ}$ (0,088rad). (3) The user performance is improved as the layout becomes less complex.

• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.141-150
• /
• 2021

The article assesses the level of navigation safety, in theoretical terms, defines the complexity of managing navigational risks in practice. The issues of assessing the navigational safety have been studied due to the importance and relevance of the issue in question, however, due to the great complexity of the problem under consideration, the article considers and indicates the directions for the development of the solution of the given direction, where, first of all, it became necessary to analyze the issue of assessing the levels of navigation risks when navigating vessels of various types in difficult navigation conditions.

• Journal of Aerospace System Engineering
• /
• v.7 no.2
• /
• pp.29-34
• /
• 2013

Safety requirements for aircraft and system functions include minimum performance constraints for both availability and integrity of the function. These safety requirements should be determined by conducting a safety assessment. The depths and contents of aircraft system safety assessment vary depending on factors such as the complexity of the system, how critical the system is to flight safety, what volume of experience is available on the type of system and the novelty and complexity of the technologies being used. Requirements that are defined to prevent failure conditions or to provide safety related functions should be uniquely identified and traceable through the levels of development. This will ensure visibility of the safety requirements at the software and electronic hardware design level. This paper has prepared to study on promoting the efficiency of establishing hierarchical safety requirements from aircraft level function to item level through system safety processes.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.3
• /
• pp.396-401
• /
• 1998

An optimal algorithm is presented for feasibility test and scheduling of real-time tasks where tasks are preemptable and created dynamically. Each task has an arbitrary creation time, ready time, maximum execution time, and deadline. Feasibility test and scheduling are conducted via the same algorithm. Time complexity of the algorithm is O(n) for each newly created task where n is the number of tasks. This result improves the previous result of O(n log n). It is shown that the algorithm can be used for scheduling tasks with different levels of importance. Time complexity of the algorithm for the problem is O(n\ulcorner) which improves the previous results of O(n\ulcorner log n).

• Journal of the Korea Institute of Military Science and Technology
• /
• v.8 no.4 s.23
• /
• pp.14-23
• /
• 2005

In this paper we propose a sensor fusion method for the navigation algorithm which can be used to estimate state vectors such as position and velocity for its motion control using multi-sensor output measurements. The output measurement we will use in estimating the state is a series of known multi-sensor asynchronous outputs with measurement noise. This paper investigates the Extended Kalman Filtering method to merge asynchronous heading, heading rate, velocity of DVL, and SSBL information to produce a single state vector. Different complexity of Kalman Filter, with. biases and measurement noise, are investigated with theoretically data from MOERI's SAUV. All levels of complexity of the Kalman Filters are shown to be much more close and smooth to real trajectories then the basic underwater acoustic navigation system commonly used aboard underwater vehicle.