• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2158-2170
• /
• 1999

It has been required more reliable communication on processes and improvement of system performance as distributed systems using multicast protocol became widespread. In distributed environment maintaining data consistency through asynchronous execution of processes and coordinating the activities of them would occurs. This paper proposes a total ordering algorithm, TORMP, in order to resolve these problems. TORMP takes advantage of multicast protocol and uses an effective token passing method. It reduces a process delaying time before transmitting its message by multicasting a token simultaneously to every process that initiates the request of the message. Moreover, the processes receiving the token start multicasting the message at the same time, which causes to cut down the overall transmission dely. In case that one process sends a message, TORMP hardly uses the procedure of controlling for ordering. It gives fairly the right of sending messages to all processes in a group with utilizing vector clock. In TORMP, unlike other algorithms, the number of packets generated during ordering process does not depend on the number of processes.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.40 no.2
• /
• pp.171-177
• /
• 2012

In this paper, we proposed a algorithm and an operation boundary for fault detection of a onboard GNSS receiver. After aircraft exchange corrections computed by an aircraft receiver, a faulty aircraft receiver is detected by checking consistency of correction. For this purpose, PRC residual is used as the test statistic for fault detection of the onboard GNSS receiver. And operation boundaries are set by using DGPS position error increase with respect to the distance from a reference station. If the fault detection is performed by using aircraft only in operation boundary, the more accurate fault detection can be possible.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.668-675
• /
• 2005

With the proliferation of wireless network and the advances of the embedded systems, the traditional distributed systems begin to include the wireless embedded systems. Clock synchronization in the distributed systems is one of the major issues that should be considered for diverse Purposes including synchronization, ordering, and consistency. Many clock synchronization algorithms have been proposed over the years. Since clock synchronization in wireless embedded systems should consider the low bandwidth of a network and the poor resources of a system, most traditional algorithms cannot be applied directly. We propose a clock synchronization algorithm in wireless embedded systems, extending IEEE 802.11 standard. The proposed algorithm can not only achieve high precision by loosening constraints and utilizing the characteristics of wireless broadcast but also provide continuous time synchronization by tolerating the message losses. In master/slave structure the master broadcasts the time information and the stave computes the clock skew and the drift to estimate the synchronized time of the master. The experiment results show that the achieved standard deviation by the Proposed scheme is within the bound of about 200 microseconds.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.1
• /
• pp.55-60
• /
• 2011

The most basic algorithm in SLAM(Simultaneous Localization And Mapping) technique of mobile robots is EKF(Extended Kalman Filter) SLAM. However, it requires prior information of characteristics of the system and the noise model which cannot be estimated in accurate. By this limit, Kalman Filter shows the following behaviors in a highly uncertain environment: becomes too sensitive to internal parameters, mathematical consistency is not kept, or yields a wrong estimation result. In contrast, $H_{\infty}$ filter does not requires a prior information in detail. Thus, based on a idea that $H_{\infty}$ filter based SLAM will be more robust than the EKF-SLAM, we propose a framework of $H_{\infty}$ filter based SLAM and show that suggested algorithm shows slightly better result man me EKF-SLAM in a highly uncertain environment.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.112-119
• /
• 2017

Selecting suppliers in the global supply chain is the very difficult and complicated decision making problem particularly due to the various types of supply risk in addition to the uncertain performance of the potential suppliers. This paper proposes a multi-phase decision making model for supplier selection under supply risks in global supply chains. In the first phase, the model suggests supplier selection solutions suitable to a given condition of decision making using a rule-based expert system. The expert system consists of a knowledge base of supplier selection solutions and an "if-then" rule-based inference engine. The knowledge base contains information about options and their consistency for seven characteristics of 20 supplier selection solutions chosen from articles published in SCIE journals since 2010. In the second phase, the model computes the potential suppliers' general performance indices using a technique for order preference by similarity to ideal solution (TOPSIS) based on their scores obtained by applying the suggested solutions. In the third phase, the model computes their risk indices using a TOPSIS based on their historical and predicted scores obtained by applying a risk evaluation algorithm. The evaluation algorithm deals with seven types of supply risk that significantly affect supplier's performance and eventually influence buyer's production plan. In the fourth phase, the model selects Pareto optimal suppliers based on their general performance and risk indices. An example demonstrates the implementation of the proposed model. The proposed model provides supply chain managers with a practical tool to effectively select best suppliers while considering supply risks as well as the general performance.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.215-223
• /
• 2000

The advancements in technology which have lead to higher and higher levels of integration have required advancements in the methods used in designing VLSI chip. A key to enable a complicated chip design is the use of hierarchy in the design process. Hierarchy organizes the function of a large number of transistors ito a particular, easy-to-manage function. For these reasons, hierarchy has been used in the design process of digital functions for many years. However, there exists differences in a design analysis phase, especially in timing analysis, due to multiple views for the same design. In timing analysis of the hierarchical design, every path is analyzed within partitioned modules independently and the global timing analysis is applied to the whole design considering each module as a single timing component. Therefore, timing results of the hierarchical design could not be same as those of non-hierarchical flat design. In this paper, we formulate the timing problem in the hierarchical design and analyze the possible source of timing differences. We define a new terminology of "consistent result" between different views for the same design. We also propose a new partitioning algorithm to obtain the consistent results. This algorithm helps to enhance the design cycle time.

• The Journal of Engineering Research
• /
• v.7 no.1
• /
• pp.17-28
• /
• 2005

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem (CSP) in which variables and constraints are distributed among multiple automated agents. A CSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs. Similarly, various application problems in DAI (Distributed AI) that are concerned with finding a consistent combination of agent actions can be formalized as distributed CPSs. The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-marking. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid. Furthermore, we describe that the agent can be available to hold multiple variables in the searching scheme.

• Journal of the Korean Society of Systems Engineering
• /
• v.14 no.2
• /
• pp.24-32
• /
• 2018

System Complexity one of the most common cause failure of the projects, it leads to a lack of understanding about the functions of the system. Hence, the model is developed for communication and furthermore modeling help analysis, design, and understanding of the system. On the other hand, the text-based specification is useful and easy to develop but is difficult to visualize the physical composition, structure, and behaviour or data exchange of the system. Therefore, it is necessary to transform system description into a diagram which clearly depicts the behaviour of the system as well as the interaction between components. According to the International Atomic Energy Agency (IAEA) Safety Glossary, The safety system is a system important to safety, provided to ensure the safe shutdown of the reactor or the residual heat removal from the reactor core, or to limit the consequences of anticipated operational occurrences and design basis accidents. Core Protection Calculator System (CPCS) in Advanced Power Reactor 1400 (APR 1400) Nuclear Power Plant is a safety critical system. CPCS was developed using systems engineering method focusing on Departure from Nuclear Boiling Ratio (DNBR) calculation. Due to the complexity of the system, many diagrams are needed to minimize the risk of ambiguities and lack of understanding. Using Model-Based Systems Engineering (MBSE) software for modeling the DNBR algorithm were used. These diagrams then serve as the baseline of the reverse engineering process and speeding up the development process. In addition, the use of MBSE ensures that any additional information obtained from auxiliary sources can then be input into the system model, ensuring data consistency.

• Journal of Broadcast Engineering
• /
• v.25 no.6
• /
• pp.1004-1012
• /
• 2020

We present a novel content-preserving seam estimation algorithm for real-time high-resolution video stitching. Seam estimation is one of the fundamental steps in image/video stitching. It is to minimize visual artifacts in the transition areas between images. Typical seam estimation algorithms are based on optimization methods that demand intensive computations and large memory. The algorithms, however, often fail to avoid objects and results in cropped or duplicated objects. They also lack temporal consistency and induce flickering between frames. Hence, we propose an efficient and temporarily-consistent seam estimation algorithm that utilizes a straight line. The proposed method also uses convolutional neural network-based instance segmentation to locate seam at out-of-objects. Experimental results demonstrate that the proposed method produces visually plausible stitched videos with minimal visual artifacts in real-time.

• Computers and Concrete
• /
• v.32 no.2
• /
• pp.217-232
• /
• 2023

Numerous studies have been performed on the behavior of pile foundations in cold regions. This study first attempted to employ artificial neural networks (ANN) to predict pile-bearing capacity focusing on pile data recorded primarily on cold regions. As the ANN technique has disadvantages such as finding global minima or slower convergence rates, this study in the second phase deals with the development of an ANN-based predictive model improved with an Elephant herding optimizer (EHO), Dragonfly Algorithm (DA), Genetic Algorithm (GA), and Evolution Strategy (ES) methods for predicting the piles' bearing capacity. The network inputs included the pile geometrical features, pile area (m²), pile length (m), internal friction angle along the pile body and pile tip (Ø°), and effective vertical stress. The MLP model pile's output was the ultimate bearing capacity. A sensitivity analysis was performed to determine the optimum parameters to select the best predictive model. A trial-and-error technique was also used to find the optimum network architecture and the number of hidden nodes. According to the results, there is a good consistency between the pile-bearing DA-MLP-predicted capacities and the measured bearing capacities. Based on the R2 and determination coefficient as 0.90364 and 0.8643 for testing and training datasets, respectively, it is suggested that the DA-MLP model can be effectively implemented with higher reliability, efficiency, and practicability to predict the bearing capacity of piles.