• 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.

• The Journal of the Korea Contents Association
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2015

2D-to-3D video conversion vests 3D effects in a 2D video by generating stereoscopic views using depth cues inherent in the 2D video. This technology would be a good solution to resolve the problem of 3D content shortage during the transition period to the full ripe 3D video era. In this paper, a low-complexity depth generation method for 2D-to-3D video conversion is presented. For temporal consistency in global depth, a pattern-based depth generation method is newly introduced. A low-complexity refinement algorithm for local depth is also provided to improve 3D perception in object regions. Experimental results show that the proposed method outperforms conventional methods in terms of complexity and subjective quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.933-939
• /
• 2012

In general, the three-dimensional(3D) coordinates of the manufactured ship blocks are measured using the laser measuring equipment by ship engineers. But, many deflections between the measured coordinates in manufactured step and the designed coordinates in the design step are occurred because of the measuring process of ship blocks manually. Thus, the ship engineer should conform the consistency between the measured coordinates and the designed coordinates step by step, and it largely causes the loss of manpower and time. In this paper, the automated pattern matching algorithm of 3D coordinates for quality control in ship blocks is suggested in order to solve this problem, and the performance of the algorithm is analyzed using the 3D coordinates simulation software developed by our research laboratory. The coordinates matching rate of the measured coordinates in the single/multi ship block(s) is about 90.2% under the tolerated distance error range is 20~25cm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.5
• /
• pp.1089-1097
• /
• 2016

It is well-known that, if additional information other than a plaintext-ciphertext pair is available, breaking the RSA cryptosystem may be much easier than factorizing the RSA modulus. For example, Coppersmith showed that, given the 1/2 fraction of the least or most significant bits of one of two RSA primes, the RSA modulus can be factorized in a polynomial time. More recently, Henecka et. al showed that the RSA private key of the form (p, q, d, $d_p$, $d_q$) can efficiently be recovered whenever the bits of the private key are erroneous with error rate less than 23.7%. It is notable that their algorithm is based on counting the matching bits between the candidate key bit string and the given decayed RSA private key bit string. And, extending the algorithm, this paper proposes a new RSA private key recovery algorithm using a generalized probabilistic measure for measuring the consistency between the candidate key bits and the given decayed RSA private key bits.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.4
• /
• pp.203-209
• /
• 2023

Harmony search(HS) does not use the evaluation of individual harmony when referring to HM when constructing a new harmony, but particle swarm optimization(PSO), on the contrary, uses the evaluation value of individual particles and the evaluation value of the population to find a solution. However, in this study, we tried to improve the performance of the algorithm by finding and identifying similarities between HS and PSO and applying the particle improvement process of PSO to HS. To apply the PSO algorithm, the local best of individual particles and the global best of the swam are required. In this study, the process of HS improving the worst harmony in harmony memory(HM) was viewed as a process very similar to that of PSO. Therefore, the worst harmony of HM was regarded as the local best of a particle, and the best harmony was regarded as the global best of swam. In this way, the performance of the HS was improved by introducing the particle improvement process of the PSO into the HS harmony improvement process. The results of this study were confirmed by comparing examples of optimization values for various functions. As a result, it was found that the suggested HS-PSO was much better than the existing HS in terms of accuracy and consistency.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.4 no.4
• /
• pp.277-286
• /
• 2002

Most of the problems in dealing with the tunnel construction are the uncertainties and complexities of the stress conditions and rock strengths in ahead of the tunnel excavation. The limitations on the investigation technology, inaccessibility of borehole test in mountain area and public hatred also restrict our knowledge on the geologic conditions on the mountainous tunneling area. Nevertheless an extensive and superior geophysical exploration data is possibly acquired deep within the mountain area, with up to the tunnel locations in the case of alternative design or turn-key base projects. An appealing claim in the use of artificial neural networks (ANN) is that they give a more trustworthy results on our data based on identifying relevant input variables such as a little geotechnical information and biological learning principles. In this study, error back-propagation algorithm that is one of the teaching techniques of ANN is applied to presupposition on Rock Mass Ratings (RMR) for unknown tunnel area. In order to verify the applicability of this model, a 4km railway tunnel's field data are verified and used as input parameters for the prediction of RMR, with the learned pattern by error back propagation logics. ANN is one of basic methods in solving the geotechnical uncertainties and helpful in solving the problems with data consistency, but needs some modification on the technical problems and we hope our study to be developed in the future design work.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.67-84
• /
• 2004

Real-time database systems (RTDBS) are database systems whose transactions are associated with timing constraints such as deadlines. Therefore transaction needs to be completed by a certain deadline. Besides meeting timing constraints, a RTDBS needs to observe data consistency constraints as well. That is to say, unlike a conventional database system, whose main objective is to provide fast average response time, RTDBS may be evaluated based on how often transactions miss their deadline, the average lateness or tardiness of late transactions, the cost incurred in transactions missing their deadlines. Therefore, in RTDBS, transactions should be scheduled according to their criticalness and tightness of their deadlines, even If this means sacrificing fairness and system throughput, And It always must guarantee preceding process of the transaction with the higher priority. In this paper, we propose an efficient real-time scheduling algorithm (Multi-level EFDF) that alleviates problems of the existing real-time scheduling algorithms, a real-time concurrency control algorithm(2PL-FT) for firm and soft real-time transactions. And we compare the proposed 2PL F[ with AVCC in terms of the restarting ratio and the deadline missing ratio of transactions. We show through experiments that our algorithms achieve good performance over the other existing methods proposed earlier.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.11-22
• /
• 2004

A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem(CSP) in which variables and constraints are distributed among multiple automated agents. ACSP 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 CAPs. In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static. In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static. In this algorithm, agents act asynchronously and concurrently based on their local knowledge without any global control, and have a flexible organization, in which the hierarchical order is changed dynamically, while the completeness of the algorithm is guaranteed. And we showed that the dynamic priority search algorithm can solve various problems, such as the distributed 200-queens problem, the distributed graph-coloring problem that common backtracking algorithm fails to solve within a reasonable amount of time. 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-making. 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.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.20 no.4
• /
• pp.337-347
• /
• 2018

Weather causes much of the risk of agricultural activity. For efficient farming, we need to use weather information. Modern agriculture has been developed to create high added value through convergence with state-of-the-art Information and Communication Technology (ICT). This study deals with the quality control algorithms of weather monitoring equipment through Ubiquitous Sensor Network (USN) observational equipment for efficient cultivation of cabbage. Accurate weather observations are important. To achieve this goal, the Korea Meteorological Administration, for example, developed various quality control algorithms to determine regularity of the observation. The research data of this study were obtained from five USN stations, which were installed in Anbandegi and Gwinemi from 2015 to 2017. Quality control algorithms were developed for flat line check, temporal outliers check, time series consistency check and spatial outliers check. Finally, the quality control algorithms proposed in this study can also identify potential abnormal observations taking into account the temporal and spatial characteristics of weather data. It is expected to be useful for efficient management of highland cabbage production by providing quality-controlled weather data.