• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.1
• /
• pp.35-44
• /
• 2020

The growing use of public blockchain-based virtual cryptocurrency calls for secure management of blockchain account information managed through cryptocurrency wallet programs. The previously proposed wallet program has high security in terms of managing an account's private key, but low security in managing an account's recovery phrase. Therefore, in this paper, we propose a safe management system of blockchain account recovery string based on the new user authentication method using the user's mobile device information and OTP technique to overcome the problem of the existing account recovery string management method. It also conducts an analysis of the proposed blockchain account recovery string management system based on the expected behavior scenario.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.11
• /
• pp.1281-1286
• /
• 2008

The PSK carrier signal recovery circuit using a six-port phase correlator was analyzed and the circuit structure is proposed in this paper. The proposed carrier signal recovery circuit that is made of reflection element and six-port phase correlator, which is comprised of a power divider and three hybrid branch line couplers, give a simple structure and can be fabricated without no difficulty. The circuit recovers the carrier signal of BPSK and QPSK modulation signal. The proposed scheme can be utilized as a basis structure for high-mode PSK carrier signal recovery. By simulation results, the recovered signal by the proposed circuit shows a good carrier signal characteristic with CW signal of a constant phase($23.4^{\circ}$) and ${\pm}0.8^{\circ}$ phase error due to glitch conditions.

• The KIPS Transactions:PartB
• /
• v.19B no.3
• /
• pp.195-200
• /
• 2012

In Korean, spelling change in various forms must be recovered into base forms in morphological analysis as well as part-of-speech (POS) tagging is difficult without morphological analysis because Korean is agglutinative. This is one of notorious problems in Korean morphological analysis and has been solved by morpheme recovery rules, which generate morphological ambiguity resolved by POS tagging. In this paper, we propose a morpheme recovery scheme based on machine learning methods like Na$\ddot{i}$ve Bayes models. Input features of the models are the surrounding context of the syllable which the spelling change is occurred and categories of the models are the recovered syllables. The POS tagging system with the proposed model has demonstrated the $F_1$-score of 97.5% for the ETRI tree-tagged corpus. Thus it can be decided that the proposed model is very useful to handle morpheme recovery in Korean.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.3
• /
• pp.73-80
• /
• 2020

In this paper, we propose a robust execution scheme for Ethereum blockchain application services which provide continuous services and support recovery even in the case of failures of those services. As of now, blockchain services are rapidly expanding to all industries and being combined with various infrastructure services of public institutions. But if these services fail in disastrous situations such as earthquakes, floods and terrors or various hacking attacks, the aftermath is very serious and its side effects are difficult to assess. To resolve this issue, we develop the service registry as a smart contract of the Ethereum blockchain, which provides useful information on the services to users even in disasters. With the help of the service registry, we also present a method of replicating services on the basis of the ETCD distributed storage system. The proposed scheme is confirmed by the test service developed by the proposed techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.137-145
• /
• 2006

In this paper, we propose a multicast P2Patching technique in the application layer. The P2Patching technique serves VOD stream effectively with Patching in P2P environment. The P2Patching provides multicast tree construction technique that reduces the server load and minimizes the start delay with extended multicast technique. And we provide a fast recovery technique by tree failure and dynamic buffering scheme that guarantees the continuous streaming by frequent tree disconnections. Comparing the method with that of $P2Cast^{[12]}$, we obtained the better performance by our scheme in terms of average join count, service rejection probability, tree recovery failure and buffer starvation. The average about 16$\%$ of the improvement is shown by the simulation. Most of all, the performance of buffer starvation and average join count shows a significant improvement than that of P2Cast.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.186-190
• /
• 2008

This paper analyzes previous work on publish/subscribe in mobile ad-hoc networks with respect to collaboration methods among distributed event brokers. Our experiments suggest that approaches building event delivery structures are suitable for a scenario where there are events of various types each of which is consumed by a few subscribers. However, these approaches based on independent periodic exchange of network topology information may fail to reflect the up-to-date information when building event delivery paths. For this reason they do not correctly recover a broken path caused by node mobility, which results in lower event delivery rates. This paper proposes a scheme for building and maintaining event delivery paths based on advertisements initiated by and hence propagated from the root node. This guarantees correct recovery of event delivery paths within each period. Our experiments show that, our proposed scheme gives a better event delivery ratio with lower overhead.

• Journal of KIISE:Information Networking
• /
• v.28 no.3
• /
• pp.389-405
• /
• 2001

In these days, we have increasing demands on the real-time services, especially for the multimedia data transmission in both of wired and wireless environments and thus efficient and stable ways of transmitting realtime data are needs. Although RTP is widely used for internet-based realtime applications, it cannot avoid packet losses, due to the use of UDP stack and its underlying layers. In the case of mobile computing applications, the packet losses are more frequent and consecutive because of the limited bandwidth. In this paper, we first statistically analyze the characteristics of packet losses in the wired and wireless communications, based on Gilbert model, and a new packet recovery scheme for realtime data transmission is presented. To reflect the transmission characteristics of the present network environment, our scheme makes the sender to dynamically adjust the amount of redundant information, using the current packet loss characteristic parameters reported by the receiver. Additionally, we use relatively large and discontinuous offset values, which enables us to recover from both of the random and consecutive packet losses. Due to these characteristics, our scheme is suitable for the mobile computing environment where packet loss rates are relatively high and varies rapidly in a wide range. Since our scheme is based on the analytic model form statistics, it can also be used for other network environments. We have implemented the scheme with Mobile IP and RTP/RTCP protocols to experimentally verify its efficiency.

• Journal of Communications and Networks
• /
• v.8 no.2
• /
• pp.228-233
• /
• 2006

Survivability is a very important requirement for the deployment of broadband networks because out of service links can affect volumes of traffic even if it is a very short time. And the data paths of broadband networks, which are critical for traffic engineering, are always necessary to be well protected. The procedure of protection or restoration for a path is initiated when failure is detected within the working path. In order to minimize the influence on transmission quality caused by the failure of links and to provide a definite time for the recovery from the failure, the protection switching time (PST) should be carefully considered in the path arrangement. Several researches have been devoted to construct the protection and restoration schemes of data paths over dense wavelength division multiplexing (DWDM) networks, however, there was rare research on the design of data paths with guaranteed protection switching time. In this paper, the PST-guaranteed scheme, which is based on the concept of short leap shared protection (SLSP), for the arrangement of data paths in DWDM networks is proposed. The proposed scheme provides an efficient procedure to determine a just-enough PST-guaranteed backup paths for a working path. In addition to selecting the PST-guaranteed path, the network cost is also considered in a heuristic manner. The experimental results demonstrate that the paths arranged by the proposed scheme can fully meet the desired PST and the required cost of the selected path is competitive with which of the shared path scheme.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.1 no.2
• /
• pp.90-103
• /
• 2006

There are many file systems in various operating systems. Those are usually designed for server environments, where the common cases are usually 'multiple active users', 'great many small files' And they assume a big main memory to be used as buffer cache. So the existing file systems are not suitable for resource hungry embedded systems that process multimedia data streams. In this study, we designed and implemented a new file system which efficiently stores and retrieves multimedia data steams. The proposed file system has a very simple disk layout, which guarantees a quick disk initialization and file system recovery. And we introduced a new indexing-scheme, called the time-based indexing scheme, with the file system. With the indexing scheme, the file system maintains the relation between time and the location for all the multimedia streams. The scheme is useful in searching and playing the compressed multimedia streams by locating exact frame position with given time, resulting in reduction of CPU processing and power consumption. The proposed file system and its APIs utilizing the time-based indexing schemes were implemented firstly on a Linux environment, though it is operating system independent. In the performance evaluation on a real DVR system, which measured the execution time of multi-threaded reading and writing, we found the proposed file system is maximum 38.7% faster than EXT2 file system.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.66 no.1
• /
• pp.21-26
• /
• 2017

Failure of high-voltage transmission line, which is responsible for large-scale power transmission, can be reason for system voltage instability. There are many methods to prevent voltage instability like adjustment of equipment, the generator voltage setting, and load shedding. Among them, the load shedding, have a problem of economic loss and cascading effect to power system. Therefore, the execution of load shedding, amount and timing is very important. Conventionally, the load shedding setting is decided by the preformed simulation. Now, it is possible to monitor the power system in real time by the appearance of PMU(Phasor Measurement Unit). By this reason, some of research is performed about decentralized load shedding. The characteristics of the load can impact to amount and timing of decentralized load shedding. Especially, it is necessary to consider the influence of the induction motor loads. This paper review recent topic about under voltage load shedding and compare with decentralized load shedding scheme with conventional load shedding scheme. And simulations show the effectiveness of proposed method in resolving the delayed voltage recovery in the Korean Power System.