• Journal of Bio-Environment Control
• /
• v.27 no.2
• /
• pp.117-124
• /
• 2018

Recently, the interest and consumption of mini watermelon (Citrullus lunatus Thunb.) are increasing due to nuclear family and one person household. However, there's no research for mini watermelon. Therefore, the purpose of the study is to develop standard cultivation method of mini watermelon. The test cultivar is 'Minimi', which is a small-sized fruit, the rootstock is 'Bullojangsaeng', which is a cucurbit line. Grafted plants were transplanted on April 5, 2017, and harvested in early July. Cultivated types were 3 methods, which are ${\cap}-form$, arched, and runner type, and plant spacing were 40, 60, and 80 cm, respectively. The rowth and yield in ${\cap}-form$ was higher than that of the arched and runner types, and the sugar content was higher a bit. The yield per unit area was about 50% higher than ${\cap}-form$, which can be plant density cultivation than that of the runner type. The number of seeds per fruit of 'Minimi' was similar to that of 'Sambokggul', but seed weight was one third lower than that of 'Sambokggul'. The content of lycopene was 30% higher than that of 'Sambokggul' watermelon, and the main sugar content is similar to or slightly less. In conclusion, the ${\cap}-form$ staking cultivation was superior to the runner type or arched cultivation in terms of fruit setting ratio, yield and quality.

• Journal of information and communication convergence engineering
• /
• v.15 no.2
• /
• pp.97-103
• /
• 2017

Implementation of faster pairing calculation is the basis of efficient pairing-based cryptographic protocol implementation. Generally, pairing is a costly operation carried out over the extension field of degree $k{\geq}12$. But the twist property of the pairing friendly curve allows us to calculate pairing over the sub-field twisted curve, where the extension degree becomes k/d and twist degree d = 2, 3, 4, 6. The calculation cost is reduced substantially by twisting but it makes the discrete logarithm problem easier if the curve parameters are not carefully chosen. Therefore, this paper considers the most recent parameters setting presented by Barbulescu and Duquesne [1] for pairing-based cryptography; that are secure enough for 128-bit security level; to explicitly show the quartic twist (d = 4) and sextic twist (d = 6) mapping between the isomorphic rational point groups for KSS (Kachisa-Schaefer-Scott) curve of embedding degree k = 16 and k = 18, receptively. This paper also evaluates the performance enhancement of the obtained twisted mapping by comparing the elliptic curve scalar multiplications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2789-2800
• /
• 1996

Real time fractal coding for successive QCIF 144*176 luminance images has been implemented on a 50MHz IBM 486 personal computer. To satisfy the frame encoding speed and data compression ratio, following algorithms are adopted. In order to minimize encoding time, extension SAS being not searching of domain blocks is used. for reducing the bits per pixel, conventioal 4*4 range block is extended to 8*8 range block. and range block extension decrease quality of decoded image. For improvement quality of decoded image, the paper apply quad-tree partition mothod. In order to divide **8 range block, self-simiarity is compared 8*8 range block with spatial contractive transformed 8*8 domain block. According to self-simiarity, the block is partitioned and owing to block partition, increased encoding time is minimized. According to self-simiarity of 8*8 range block and spatial contractive transformed 8*8 domain block, number of fractal factor is varied. Simultaneously with minimizing the decrement of decoded image's quality, transmittion rate and encoding time is shorted. The results enable us to process the real-time fractal coding. For the claire test image, the average PSNR was 32.4dB, 0.12 bit rates and 33ms coding time per frame.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.126-133
• /
• 2003

The existing active routing Protocols assume that the active network topology is static or pre-configured. However a dynamic mechanism to route an active Packet according to the network condition is required due to the dynamic characteristic of the active network. As active routing protocols, SLRP and TCOM500 PLAN project have been proposed, but since both of them are based on the assumption of the static topology we can not say that they are dynamic routing protocols in their entirety. Therefore, in this paper, we propose a new active network routing protocol, called AOSPF (Active Open Shortest Path First), which is compatible with the existing IP routing protocol. AOSPF is an extension of OSPF by adding a new LSA (Link State Advertisement) to allow the active network routing. The newly introduced LSA is used to specify whether the corresponding router is an active router or not. and one bit in the OPTION field of an LSA packet is used as the active router indication bit. This way of extending OSPF is similar to the scheme used in the extension of OSPF for multicast, i.e., MOSPF. In this paper, we will present the operation of AOSPF and the way how an active packet is forwarded based on the active network topology information constructed by AOSPF.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.1
• /
• pp.48-55
• /
• 2010

It has a falling off in speech quality, especially when consecutive packet loss occurs, even if a vocoder implemented in the packet network has its own packet loss concealment (PLC) algorithm. PLC algorithm is divided into transmitter and receiver algorithm. Algorithm in the transmitter gives superior quality by additional information. however it is impossible to provide mutual compatibility and it occurs extra delay and transmission rate. The method applied in the receiver does not require additional delay. However, it sets limits to improve the speech quality. In this paper, we propose a new method that puts extra information for PLC in a part of Extension Header Data which is not used in RTP Header. It can solve the problem and obtain enhanced speech quality. There is no extra delay occurred by the proposed algorithm because there is a jitter buffer to adjust network delay in a receiver. Extra information, 16 bits each frame for G.729 PLC, is allocated for MA filter index in LP synthesis, excitation signal, excitation signal gain and residual gain reconstruction. It is because a transmitter sends speech data each 20 ms when it transfers RTP payload. As a result, the proposed method shows superior performance about 13.5%.

• Journal of IKEEE
• /
• v.9 no.1 s.16
• /
• pp.65-71
• /
• 2005

Physical signals generated in the real world are transformed into electrical signals through sensors and fed into electronic circuits. The electrical signals input to electronic circuits are in analog form, thus they must be converted to digital signals using an ADC(Analog-Digital Converter) for digital processing. Signal processing circuits and ADCs that are to be integrated on a single chip together with silicon micro sensors should be designed to have less silicon area and less power consumption. This paper proposed a charge redistribution ADC which reduces silicon area considerably. The proposed method achieves 8 bit conversion by performing 4-bit conversion twice. It reduced the area of capacitor array, which takes most of the ADC area, by 1/16 when compared to a conventional method. Though it uses twice the number of clocks as a conventional method, it would be appropriate to be integrated with a silicon pressure sensor on a single chip since it does not demand high conversion rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10C
• /
• pp.951-962
• /
• 2002

A DMT transceiver recovers the sampling time from reserved sub-carriers, the pilots. Since the pilots are available after the FFT, the symbol synchronization must be done before sample synchronization. In DMT VDSL system, symbol synchronization is handled separately from sample synchronization, although the two processes are intimately related. The DMT symbol itself contains sufficient information, the cyclic extension, for symbol synchronization. Using only the sign bit of received signal, the Maximum Likelihood Estimation solution is derived. The Tx windowing in the transmitter of DMT VDSL system results in the blurring of MLE peaks. We propose the weighted summing MLE method using the sign bit which produces the clearly sharp top of MLE peaks. The stability of symbol synchronization is improved significantly by averaging over a few symbols. This paper presents the study of the original MLE and the weighted summing MLE using sign bit. A clock difference between transmitter and receiver destroys the oahogonality of the carriers. Therefore, a receiver using asynchronous sampling must perform timing correction in the discrete-time domain. We introduce an efficient digital sample synchronization method which is based on temporal and frequency domain digital signal processing.

• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.224-237
• /
• 2015

In this paper, we introduce the fast decoding method with the SIMD (Single Instruction Multiple Data) instructions for HEVC RExt (High Efficiency Video Coding Range Extensions). Several tools of HEVC RExt such as intra prediction, interpolation, inverse-quantization, inverse-transform, and clipping modules can be classified as the proper modules for applying the SIMD instructions. In consideration of bit-depth increasement of RExt, intra prediction, interpolation, inverse-quantization, inverse-transform, and clipping modules are accelerated by SSE (Streaming SIMD Extension) instructions. In addition, we propose effective implementations for interpolation filter, inverse-quantization, and clipping modules by utilizing a set of AVX2 (Advanced Vector eXtension 2) instructions that can use 256 bits register. The evaluation of the proposed methods were performed on the private HEVC RExt decoder developed based on HM 16.0. The experimental results show that the developed RExt decoder reduces 12% average decoding time, compared with the conventional sequential method.

• The Journal of the Korean bone and joint tumor society
• /
• v.2 no.1
• /
• pp.8-17
• /
• 1996

The purpose of this study is a comparative evaluation of range motion, especially extension deficit between the group of total patellectomy and that of intact patella, after reconstruction of the patellar tendon in the prosthetic replacement of a proximal tibia. Between 1990 and 1994, 15 patients who had a primary malignancy on proximal tibia were operated on. All patients were evaluated clinically and radiographically. Two patients were excluded because one had a deep infection treated with arthrodesis of the knee and the other was a composite allograft. The mean follow-up of the 13 patients was 27 months(15-47), including 10 osteosarcomas, 1 chondrosarcoma, 1 malignant fibrous histiocytoma and 1 malignant giant cell tumor. Eleven patients had a resection of the proximal tibia and 2 had an extracapsular total knee resection with distal femur. Reconstruction of the defect was done in 8 cases with a custom-made Link Endo-Model Total Rotation Knee Joint Prosthesis, and in 5 with How Medica Modular Resection System (HMRS). We used two methods to reconstruct the ligamentum patellae. Fixation of the patellar tendon to the prosthesis only with suturing and/or stapling(group SS) was done in 7. Transposition of gastrocnemius muscle to enhance fixation and to cover the prosthesis(group TG) was done in 6. Regardless of fixation methods, total patellectomy was done in 5 either to lengthen the patellar tendon or to make primary skin closure easier or for both. In 8 cases, patella was left intact or resurfaced with polyethylene prosthesis. Active extension was measured while the patient was in a sitting position. There is no statistically meaningful difference in terms of extension deficit (Wilcoxon rank test, p=0.8800) between patellectomy group and intact patella group, and between group of fixation only with suturing and that of gastrocnemius transposition. Two cases of extension deficit over 30 degree were seen in group SS and in the group of intact patella. Conclusively, total patellectomy could be an option without increasing the risk of extension deficit when primary skin closure is difficult or patellar tendon is a little bit short to be fixed. There is no rating in the Enneking system of functional evaluation that this finding into consideration.

• Journal of information and communication convergence engineering
• /
• v.8 no.1
• /
• pp.71-76
• /
• 2010

Scalable video coding (SVC) has been standardized as an extension of the H.264/AVC standard. SVC allows straightforward adaptation of video streams by providing layered bit streams. In this paper, we propose a SVC video-based multicasting system preserving scalable security which is able to provide a SVC video service while maintaining information security. In order to maintain information security between a server and a client during all transmission time, the proposed system immediately performs a packet filtering process without decoding with respect to encrypted data received in a routing device, thereby reducing an amount of calculations and latency.