• Journal of Radiation Industry
• /
• v.7 no.2_3
• /
• pp.121-126
• /
• 2013

The new algorithm technique is necessary to incorporate for analyzing and evaluating extreme condition like a nuclear accident. In this study, the combined methodology for measuring the three-dimensional space was compared with SIFT (Scale Invariant Feature Transform) and SURF (Speeded-Up Robust Feature) algorithm. The suggested method can be used for the acquisition of spatial information using the robot vision in the districted area of the nuclear facilities. As a result, these data would be helpful for identify the damaged part, degree of damage and determination of recovery sequences.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.343-354
• /
• 2003

This paper describes algorithm that minimizes recovery time of packet loss resulting from handoff in multicast environments and guarantees reliability through interaction of FN(Foreign Network) with PMTP(Predictable Multicast Tree Protocol). To solve the problems that inefficient routing and handoff delay taking plate when using hi-directional tunneling and remote subscription independently in multicast environments, proposed algorithm uses tunneling and rejoining multicast group according to the status of an arriving FA in a foreign network. Furthermore, proposed algorithm sends packet loss information and register message to previous FA or current FA at the same time. so, MH is able to recovery packet loss in handoff delay as soon as possible. As a result of performance analysis, proposed algorithm is more efficient than previous researches and is applicable to existing handoff method without requiring additional procedures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7B
• /
• pp.650-659
• /
• 2004

Domestic wireless network environment is changing rapidly while adapting to meet service requirements of users and growth of market. As a result, reliable data transmission using TCP is also expected to increase. Since TCP assumes that it is used in wired networt TCP suffers significant performance degradation over wireless network where packet losses are not always result of network congestion. Especially RTO imposes a great performance degradation of TCP. In this paper, we propose DAC$^{＋}$ and EFR in order to prevent performance degradation by quickly detecting and recovering loss without RTO during fast recovery. Compared with TCP NewReno, proposed scheme shows improvements in steady-state in terms of higher fast recovery Probability and reduced response time.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.29-39
• /
• 2008

Greedy routing which is easy to apply to geographic wireless sensor networks is frequently used. Greedy routing works well in dense networks whereas in sparse networks it may fail. When greedy routing fails, it needs a recovery algorithm to get out of the communication void. However, additional recovery algorithm causes problems that increase both the amount of packet transmission and energy consumption. Communication void is a condition where all neighbor nodes are further away from the destination than the node currently holding a packet and it therefore cannot forward a packet using greedy forwarding. Therefore we propose a VODUA(Virtually Ordered Distance Upgrade Algorithm) as a novel idea to improve and solve the problem of void. In VODUA, nodes exchange routing graphs that indicate information of connection among the nodes and if there exist a stuck node that cannot forward packets, it is terminated using Distance Cost(DC). In this study, we indicate that packets reach successfully their destination while avoiding void through upgrading of DC. We designed the VODUA algorithm to find valid routes through faster delivery and less energy consumption without requirement for an additional recovery algorithm. Moreover, by using VODUA, a network can be adapted rapidly to node's failure or topological change. This is because the algorithm utilizes information of single hop instead of topological information of entire network. Simulation results show that VODUA can deliver packets from source node to destination with shorter time and less hops than other pre-existing algorithms like GPSR and DUA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6B
• /
• pp.616-624
• /
• 2002

In satellite communication, which use the satellite, the protection of TT&C channel which controls the position, performance, and operation is required. In this thesis, we analyzed the weakness of authentication algorithm which is used for protection of TT&C generation and operation. Also, we proposed the authentication algorithm which complements key recovery attack structurely without increasing additional computational amount and verified its performance. The proposed authentication algorithm can satisfy Rivest's recommendation by increasing the computational complexity from $2^{55}$ operations to $2^{111}$ operations. In addition, it can be applied to the existing satellite system because the length of TT&C data and message authentication codes used for the input of authentication algorithm are unchanged.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2087-2093
• /
• 2014

In this paper, an orthogonal matching pursuit (OMP) method combined with genetic algorithm (GA), named GAOMP, is proposed for sparse signal recovery. Some recent greedy algorithms such as SP, CoSaMP, and gOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. However they still often fail to converge to the solution because the support set could not avoid the local minimum during the iterations. Mutating the candidate support set chosen by the OMP algorithm, GAOMP is able to escape from the local minimum and hence recovers the sparse signal. Experimental results show that GAOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• Journal of the Korean Society of Safety
• /
• v.38 no.2
• /
• pp.8-14
• /
• 2023

In various industrial sites, piping systems play an essential role in stable fluid supply and pressure maintenance. However, these systems are constantly exposed to risks of earthquakes, explosions, fires, and leaks, which can result in casualties or serious economic losses. With rapid advancements in the industry, different-sized piping systems have been launched; however, there are not enough maintenance personnel for troubleshooting and responding to situations where damages occur to piping systems. This increases the need for introducing autonomous damage management systems. In this study, a lab-based piping system was designed and manufactured by referring to the piping system of a naval ship to analyze the effectiveness of autonomous damage management systems. By using this testbed, a representative algorithm, the hydraulic resistance control algorithm, was realized and examinedIn addition, the difference between the averaged pressure and normalized pressure was introduced to improve the performance of the existing algorithm, which faces some limitations with regard to sensor noise and back pressure from the rupture-simulated pipeline part.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10C
• /
• pp.1036-1043
• /
• 2005

In this paper, we propose a sequential motion vector recovery algorithm for H.264 video coding standard. Motion vectors of H.264 video coding standard cover relatively smaller areas than other standard, since motion estimation of H.264 takes place in the fashion of variable block size. Therefore, the correlation of motion vectors between neighboring blocks increases as the block size of motion estimation is lowered. Under the framework of sequential recovery, we introduce a motion vector recovery using $\alpha$-trimed mean filter. Experimental results show that proposed algorithm is useful in real time video delivery .with nearly comparable or better visual quality than previous approaches such as macro block boundary matching and Lagrage interpolation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.369-380
• /
• 2003

In the CDMA wireless link, frame errors are correlated and burst because of fading. The implementation ability of RLP error recovery is dependent on the correlated frame errors. The (1,2,3) retransmission scheme, which is recommended as default in IS-707, is not adapted in high frame loss regime with strong correlations. By using the modified error recovery method, where the total number of retransmission attempts is the same and the retransmission is increased, the proposed retransmission scheme can efficiently recover frame errors than the (1,2,3) retransmission scheme. Since the modified scheme has longer transmission delay due to the increase of retransmission round, we propose the algorithm of retransmission failure prediction to improve the modified error recovery scheme. We simulate the modified error recovery scheme applying our algorithm and compare two schemes. (i.e. default scheme by IS-707 and modified scheme) not applying our algorithm. In the result, we show TCP performance improvement is better than default scheme by IS-707.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.3
• /
• pp.649-658
• /
• 1997

Database management systems(DMBS)using bolatile memory shluld have a recovery function to protect data against system failutes.Recovery requires much overhead in transaction proessing and is one of the great factors that deteriorate the system performance.Recently, there have been a lot of studies on database systems with nonbolatile memory to enhance the performance.A nonbolatile memory called DFeRAM is one of the promising memory devices of the future technology, but this device does not support fine-franularity licking.In this paper, we present a dual plane FeRAM(DFeRAM)architecture to support the fine-granularity locking.We also propose a recovery algorithm for the database system with the DFeRAM based on a shadow paging methed.In order to analze the performance of the proposed algorithm, we present an analytical model and analyze the performance using the moedl.