• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.822-828
• /
• 2002

Optical flow estimation based on multi constraint approaches is frequently used for recognition of moving objects. However, the use have been confined because of OF estimation time as well as error problem. This paper shows a new method form effectively extracting movement information using the multi-constraint base approaches with sobel edge detection. The moving objects anr extraced in the input image sequence using edge detection and segmentation. Edge detection and difference of the two input image sequence gives us the moving objects in the images. The process of thresholding removes the moving objects detected due to noise. After thresholding the real moving objects, we applied the Combinatorial Hough Transform (CHT) and voting accumulation to find the optimal constraint lines for optical flow estimation. The moving objects found in the two consecutive images by using edge detection and segmentation greatly reduces the time for comutation of CHT. The voting based CHT avoids the errors associated with least squares methods. Calculation of a large number of points along the constraint line is also avoided by using the transformed slope-intercept parameter domain. The simulation results show that the proposed method is very effective for extracting optical flow vectors and hence recognizing moving objects in the images.

• Journal of Korean Society of Steel Construction
• /
• v.10 no.1 s.34
• /
• pp.37-45
• /
• 1998

The relational database system on fatigue strength was constructed, and the properties of fatigue life distribution were examined to analyze reliability and safety of metallic materials. Data manipulations were efficiently performed in relational fatigue strength database system using dependency diagram. Regardless of the distribution of fatigue strength, the proposed method, the Robust method and the complementary error function method using probability distribution, successfully estimated parameters of the 3-parameter Weibull distribution. The proposed criterion for estimating non-failure probability showed good results regardless of censoring time. The fatigue life distribution function described as a function of parameters of the Weibull distribution and applied stress ratio produced P-S-N characteristics reasonably.

• Journal of Korea Multimedia Society
• /
• v.10 no.2
• /
• pp.226-235
• /
• 2007

Recently, the lETF NEMO working group on network mobility is standardizing a basic support for moving networks. We need a handover scheme for achieving the performance of transparency during the movement of mobile routers in nested mobile networks. But existing handover schemes for a mobile host are not suitable for network mobility because the packet transmission delay and traffic increase during mobile router's handover in nested mobile networks. Therefore, we propose a new seamless handover scheme using the bi-casting based on Mobile IPv6 for nested mobile networks in this paper. Compared with the handover schemes using bi-directional edge tunneling for host mobility support on simulation. And, the results show that the proposed handover scheme reduces the packet delay during a mobile router changes the point of attachment in nested mobile networks.

• Journal of Navigation and Port Research
• /
• v.32 no.6
• /
• pp.465-471
• /
• 2008

As the excessive competition between container terminals has been deepening, not only productivity, but also cost economic of the terminals has been raised. With regard to this, the competitiveness of the terminals is limited because of inefficiency operation of transfer crane(T/C) which needs large amount of energy consumption. Therefore, it is possible that the improvement in the T/C operation leads to saving cost for resources and energy as well as increasing the productivity of the terminals. This study provides 'the K-Means Clustering based Optimized Decision Model for Transfer Crane Operation', referring to 'RFID & RTLS based Port Logistics Initiative' of Ministry of Land, Transportation and Maritime Affairs and estimates the efficiency through simulating.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.549-560
• /
• 2001

Cluster system provides attractive scalability in terms of compution power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive MPPs (massively parallel processors). Load balancing is very important issue since an inappropriate scheduling of tasks cannot exploit the true potential of the system and can offset the gain from parallelization. In parallel processing program, it is difficult to predict the load of each task before running the program. Furthermore, tasks are interdependent each other in many ways. The dynamic load balancing algorithm, which evaluates each processor's load in runtime, partitions each task into the appropriate granularity and assigns them to processors in proportion to their performance in cluster systems. However, if the communication cost between processing nodes is expensive, it is not efficient for all nodes to attend load balancing process. In this paper, we restrict a processor that attend load balancing by the communication cost and the deviation of its load from the average. We simulate various models of the cluster system with parameters such as communication cost, node number, and range of workload value to compare existing load balancing methods with the proposed dynamic algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.243-249
• /
• 2019

In this paper, we proposes a comprehensive analysis of the characteristics, selection procedures, and management perspectives of each university's financial support project, and derivation of a plan to integrate the information system of the university's financial support project. To this end, we analyze the current status of business operations before and after restructuring university financial support projects, and identified the characteristics, commonalities, and differences of each project. Individual projects are promoted segmentally, evaluation indicators and evaluation methods are different for each business, standardization is difficult, and in the absence of integrated governance, sympathy and will of the system integration of the government and the managing agency cannot be found. In order to integrate the system, the business management process must be integrated and standardized, and the system equipment such as budget category adjustment must be complemented, and a stable budget for system integration must be secured.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.11
• /
• pp.109-117
• /
• 2019

Recently, the invasion of privacy in medical information has been issued following the interest in the secondary use of mass medical information. The mass medical information is very useful information that can be used in various fields such as disease research and prevention. However, due to privacy laws such as the Privacy Act and Medical Law, this information, including patients' or health professionals' personal information, is difficult to utilize as a secondary use of mass information. To do these problem, various methods such as k-anonymity, l-diversity and differential-privacy that can be utilized while protecting privacy have been developed and utilized in this field. In this paper, we discuss the differential privacy processing of the various methods that have been studied so far, and discuss the problems of differential privacy using Laplace noise and the previously proposed differential privacy. Finally, we propose a new scheme to solve the existing problem by adding a 1-bit status field to the last column of a given data set to confirm the response to queries from analysts.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2019.05a
• /
• pp.7-7
• /
• 2019

중요한 사회기반시설물 중 하나인 상수관망시스템은 대부분의 시설물이 지중에 매설되어있기 때문에 지진에 취약하고 복구에 어려움이 크며, 지진 발생 시 대규모 피해로 이어질 우려가 있다. 따라서 상수관망시스템에 대한 지진피해를 최소화하고 재해로부터 신속하게 복구하기 위한 적절한 복구전략을 마련할 필요가 있다. 상수관로에 발생하는 지진피해는 크게 파손과 누수로 구분되며, 대구경 관로가 파손될 경우 대규모 단수 및 피해가 우려되므로 신속한 복구전략이 마련되어야한다. 일반적으로 파손 관로의 복구는 먼저 피해 관로 인근의 제수밸브의 차폐를 통해 통수를 차단한 후 교체 작업을 진행하는 것이 일반적이며, 해당 과정에서 밸브 차폐에 의한 단수구역의 발생이 불가피하다. 이러한 단수구역 발생은 해당 지역의 용수공급능력 저하로 이어지며, 단수구역의 범위 및 단수용량의 규모는 제수밸브의 위치 및 개수에 따라 결정된다. 본 연구에서는 기개발된 상수관망 지진피해복구 시뮬레이션 모형(Choi et al., 2018)을 개선하여 지진피해복구 시 시스템 내 제수밸브의 설치 위치와 개수에 따라 발생되는 단수구역과 단수상황이 상수관로의 용수공급능력(Serviceability)에 미치는 영향을 분석하였다. 개선된 모형은 피해복구에 따른 용수공급능력을 정량적으로 산정할 수 있으며, 피해 관로의 복구 시 제수밸브 차폐에 의해 발생되는 단수구역을 탐색한 후, 수리해석 모의에 적용함으로써 현실적인 용수공급 상황을 모의할 수 있도록 개선되었다. 또한, EPANET3.0의 Full-PDA(Pressure driven analysis)를 이용함으로써 지진과 같은 비정상상황(다수관의 파손에 따른 압력저하)에서 좀 더 현실적인 수리해석이 가능하도록 개선되었다. 본 연구에서는 해당모형을 실제관망에 적용하여 제수밸브 설치개수 및 위치가 지진피해복구에 미치는 영향을 비교 분석하였으며, 또한 효율적인 지진피해복구 방안을 제시하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.37-45
• /
• 2020

The development process of deep learning is an iterative task that requires a lot of manual work. Among the steps in the development process, pre-processing of learning data is a very costly task, and is a step that significantly affects the learning results. In the early days of AI's algorithm research, learning data in the form of public DB provided mainly by data scientists were used. The learning data collected in the real environment is mostly the operational data of the sensors and inevitably contains various noises. Accordingly, various data cleaning frameworks and methods for removing noises have been studied. In this paper, we proposed a method for detecting and removing noises from time-series data, such as sensor data, that can occur in the IoT environment. In this method, the linear regression method is used so that the system repeatedly finds noises and provides data that can replace them to clean the learning data. In order to verify the effectiveness of the proposed method, a simulation method was proposed, and a method of determining factors for obtaining optimal cleaning results was proposed.

• Journal of Korea Society of Industrial Information Systems
• /
• v.26 no.5
• /
• pp.11-19
• /
• 2021

In this paper, we proposed an asymmetric multi-core processor scheduling scheme which is based on the mileage of each core. We considered a big-LITTLE multi-core processor structure, which consists of low power consuming LITTLE cores with general performance and high power consuming big cores with high performance. If a task needs to be processed, the processor decides a core type (big or LITTLE) to handle the task, and then investigate the core with the shortest mileage among unoccupied cores. Then assigns the task to the core. We developed a mileage-based balancing algorithm for asymmetric multi-core assignment and showed that the proposed scheduling scheme is more cost-effective compared to the traditional scheme from a management perspective. Simulation is also conducted for the purpose of performance evaluation of our proposed algorithm.