• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.118-123
• /
• 2021

Recently, digital crime is becoming more intelligent, and efficient digital forensic techniques are required to collect evidence for this. In the case of important files related to crime, a specific person may intentionally delete the file. In such a situation, data recovery is a very important procedure that can prove criminal charges. Although there are various methods to recover deleted files, we focuses on the recovery technique using HxD editor. When recovering a deleted file using the HxD editor, check the file structure and access the file data area through calculation. However, there is a possibility that errors such as arithmetic errors may occur when a file approach through calculation is used. Therefore, in this paper, we propose an algorithm that automatically calculates the header and footer of a file after checking the file signature in the root directory for efficient file recovery. If the algorithm proposed in this paper is used, it is expected that the error rate of arithmetic errors in the file recovery process can be reduced.

• Journal of Navigation and Port Research
• /
• v.36 no.5
• /
• pp.371-378
• /
• 2012

This paper presents a timing recovery method using Gardner TED (Timing Error Detector) with a Peak Detector using Parabola Peak Interpolation in underwater acoustic communication. This method will have an eye to improve phase converge speed of timing recovery and reduced amount of Tx data. The OQPSK(Offset Quadrature Phase Shift Keying) modulation technique was considered. The proposed algorithm has faster recovery speed and more accurate than Gardner TED because the sampling values in the proposed algorithm are moved persistingly to maximum or minimum point using parabolic peak interpolation. when simulation performed using Preposed method, it improved BER (Bit Error Rate) performance about 23% And to evaluate the performances of the proposed algorithm the sea trial was performed in the Korean East Sea. And distance of a transmitter-receiver is 3 km each other. As a result, the proposed algorithm outperforms better BER performance about 20% of timing recovery than the Gardner method. Also Proposed method improved converge speed of timing recovery about 1.4 times better than Gardner method.

• ETRI Journal
• /
• v.28 no.4
• /
• pp.435-443
• /
• 2006

This paper presents an efficient carrier recovery algorithm combined with a turbo-coding technique in a mobile communication system. By using a block turbo code made up of independently decodable block codes, we can efficiently recover the fast time-varying carrier phase as well as correct channel errors. Our simulation results reveal that the proposed scheme can accommodate mobiles with high speed, and at the same time can reduce the number of iterations to lock the phase.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1995.10a
• /
• pp.223-229
• /
• 1995

Loose Par Monitoring System(LPMS) is one of the fundamental diagnostic tools installed in the nuclear power plants. In this paper, recovery process algorithm and model for the corrupted impact signal generated by loose parts is presented. The characteristics of this algorithm can obtain a proper burst signal even though background noise is considerably high level comparing with actual impact signal. To verify performance of the proposed algorithm, we evaluate mathematically signal-to-noise ratio of primary output and noise. The performance of this recovery process algorithm is shown through computer simulation.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.1-4
• /
• 2004

We proposed a new type of timing recovery scheme to work with a system that uses BCJR (Bahl-Cocke-Jelinek-Raviv) decoding algorithm and BPSK modulation. The unknown timing offset is estimated by the modified Mueller and $M\ddot{u}ller$ estimator with the aid of the decoder. Timing offset can be acquired as soon as the symbols are received and be updated symbol by symbol. The simulation results for turbo codes whose decoder uses BCJR algorithm show a satisfactory performance even in case of severe timing jitter.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.5103-5115
• /
• 2015

In radar imaging, a target is usually consisted of a few strong scatterers which are sparsely distributed. In this paper, an improved sparse signal recovery algorithm based on smoothed l₀ (SL0) norm method is proposed to achieve high resolution ISAR imaging with limited pulse numbers. Firstly, one new smoothed function is proposed to approximate the l₀ norm to measure the sparsity. Then a single loop step is used instead of two loop layers in SL0 method which increases the searching density of variable parameter to ensure the recovery accuracy without increasing computation amount, the cost function is undated in every loop for the next loop until the termination is satisfied. Finally, the new set of solution is projected into the feasible set. Simulation results show that the proposed algorithm is superior to the several popular methods both in terms of the reconstruction performance and computation time. Real data ISAR imaging obtained by the proposed algorithm is competitive to several other methods.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.45 no.2
• /
• pp.335-345
• /
• 2021

The purpose of this study was to examine the effect of fabric movement on wrinkle recovery in a clothing care system and to propose an algorithm to improve wrinkle removal performance by adjusting fabric movements. With an increase in the reciprocating speed of the movement system, the number and amplitude of curves on the fabric also increased. This allowed the fabric to be applied to a larger tension, resulting in better wrinkle removal performance at higher speeds. However, even at high reciprocating speeds, wrinkles could not be removed effectively because of nodes at a few specific locations. Based on the results of fabric movement and wrinkle recovery, a complex movement algorithm was proposed with a mixture of various reciprocation speeds. It showed a 41%p (24%→65%) improvement of wrinkle recovery when compared with the conventional algorithm that showed simple fabric movement at 180 rpm. This was because the positions of nodes and antinodes changed continuously and the force by the reciprocating motion could be applied evenly to the fabric.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.589-596
• /
• 2002

Tn the data transmission service of the mobile host, it is needed to reduce the bandwidth and to make a reliable error recovery. there are two appropriate methods in that. One is FEC which retransmits the parity of error recovery, in case of happening of the loss after forming the parity of error recovery by grouping original data. The other is local recovery based on server which can block the implosion of transmission. The use of FEC and local recovery based on server at the same time enables the reliable multicast. This paper suggests algorithm that recovers the loss by FEC and local recovery based on server through the solution of the problems about triangle routing, tunnel convergence by dividing mobile host into two parts-the sender and the receiver. This model about the loss of algorithm tested the efficiency of performance by the homogeneous independent loss, the heterogeneous independent loss, the shared source link loss model. The suggested algorithm confirms effectiveness in the environment where there are much data and many receivers in mobile host.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.314-326
• /
• 2004

Bluetooth has been reputed as a wireless ad-hoc networking technology supplying scalable and extensible networks between digital devices. For that kind of networks, scatternet is a most essential part in bluetooth. But past researches on bluetooth scatternet has proposed only possibilities of scatternet algorithm based on simulation results. And many of the researches failed in guaranteeing extensibility and flexibility and had many difficulties in real hardware implementation. In this paper, we proposed node ring scatternet(NRS) algorithm guaranteeing extensible and flexible networks. NRS algorithm is designed for hardware implementation using real commercial bluetooth module. That algorithm is divided into initial formation and reformation. For initial formation, we proposed limited SEEK/SCAN algorithm. For reformation, we proposed DIAC algorithm and Reserved Recovery Node algorithm. And we proposed SFMP(Scatternet Formation ＆ Management Protocol) in protocol stack for real implementation. NRS algorithm is operated in SFMP. Finally, we performed real hardware experiments and evaluated the proposed algorithm. In that experiments, we succeeded in forming scatternet up to 20 nodes. In comparison with other similar algorithm, proposed algorithm have the improvement in scatternet formation delay and success rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.976-995
• /
• 2016

Workflow scheduling is one of the challenging problems in cloud computing, especially when service reliability is considered. To improve cloud service reliability, fault tolerance techniques such as fault recovery can be employed. Practically, fault recovery has impact on the performance of workflow scheduling. Such impact deserves detailed research. Only few research works on workflow scheduling consider fault recovery and its impact. In this paper, we investigate the problem of workflow scheduling in clouds, considering the probability that cloud resources may fail during execution. We formulate this problem as a multi-objective optimization model. The first optimization objective is to minimize the overall completion time and the second one is to minimize the overall execution cost. Based on the proposed optimization model, we develop a heuristic-based algorithm called Min-min based time and cost tradeoff (MTCT). We perform extensive simulations with four different real world scientific workflows to verify the validity of the proposed model and evaluate the performance of our algorithm. The results show that, as expected, fault recovery has significant impact on the two performance criteria, and the proposed MTCT algorithm is useful for real life workflow scheduling when both of the two optimization objectives are considered.