• Water for future
• /
• v.18 no.4
• /
• pp.317-325
• /
• 1985

In the analysis, monthly streamflow records atthe gauging station in Nakdong, Han and Geum river were used. Also, the fitness of monthly streamflow to Gamma and Long-normal distribution was tested by Kolomogorv-Smirnov test. The results obtained in this study can be summarized as follws (1) The fitness of monthly streamflow to two-parameter Gamma distribution was tested by Kolomorov-Smirnov test, which fits well to this Gamma distribution (2) The Run-length and Run-sum were simulated by the Gamma model. In this result, run-length and Run-sum of monthly streamflow were fit for Gamma model (3) The mean decreases (increases) the expected surplus (deficit) Run-Sum of the monthly streamflow. The higher the truncation level of negative Run-length and Run-sum the larger is the effect of mean.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2817-2834
• /
• 2016

The existing reversible data hiding methods for block truncation coding (BTC) compressed images often utilize difference expansion or histogram shifting technique for data embedment. Although these methods effectively embed data into the compressed codes, the embedding operations may swap the numerical order of the higher and lower quantization levels. Since the numerical order of these two quantization levels can be exploited to carry additional data without destroying the quality of decoded image, the existing methods cannot take the advantages of this property to embed data more efficiently. In this paper, we embed data by shifting the higher and lower quantization levels in opposite direction. Because the embedment does not change numerical order of quantization levels, we exploit this property to carry additional data without further reducing the image quality. The proposed method performs no-distortion embedding if the payload is small, and performs reversible data embedding for large payload. The experimental results show that the proposed method offers better embedding performance over prior works in terms of payload and image quality.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.97-100
• /
• 2007

In order to overcome many defects in the current JPEG standard of still image compression, the new JPEG2000 standard has been development. The JPEG2000 standard is based on the principles of DWT and EBCOT Entropy Coding. EBCOT(Embedded block coding with optimized truncation) is the most important technology in the latest image-coding standard, JPEG2000. However, EBCOT occupies the highest computation time to operate bit-level processing. Therefore, many researches have achieved methods to minimize computation speed of EBCOT. Thus, this paper proposes the method of context-extraction that improves computational architecture. This paper proposes efficient context coding method. The proposed algorithm would apply to hard-wired JPEG2000 Encoder that is used for compression of high resolution image.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.2
• /
• pp.125-131
• /
• 2010

This paper presents the implementation of a EBCOT TIER-1 for JPEG2000 Encoder. JPEG2000 is new standard for the compression of still image for overcome the artifact of JPEG. JPEG2000 standard is based on DWT(Discrete Wavelet Transform) and EBCOT Entropy coding technology. EBCOT(Embedded block coding with optimized truncation) is the most important technology that is compressed the image data in the JPEG2000. However, EBCOT has the artifact because the operations are bit-level processing and occupy the harf of the computation time of JPEG2000 Compression. Therefore, in this paper, we present modified context extraction method for enhance EBCOT computational efficiency and implemented MQ- Coder as arithmetic coder. The proposed system is implemented by Verilog-HDL, under the condition of TSMC 0.25um ASIC library, gate counts are 30,511EA and satisfied the 50MHz operating condition.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.6
• /
• pp.114-121
• /
• 2013

BTC image compression is a simple and easy hardware implementation, is widely used in a video compression techniques required for LCD overdrive. In this paper, methods for reducing compression loss, a multi-level quantization BTC (MLQ-BTC) algorithm is proposed. The process of the MLQ-BTC algorithm is, a input image is compressed and decompressed by Quasi 8-level method and Advanced 2-level BTC method, and select the algorithm with the smallest compression loss. Simulation results show that the proposed algorithm is efficient as compared with PSNR and compression ratio of the existing BTC methods.

• Journal of Korea Water Resources Association
• /
• v.33 no.3
• /
• pp.307-314
• /
• 2000

This study is to investigate the recurrence characteristics of wet and dry years using over 200 year records of annual rainfall depth including Chosun Age in Korea. As well as analyzing the correlation structure of the raw data, recurrence trends of wet and dry year has been investigated based on several truncation levels (mean, $mean{\pm}0.25stdv.,\;mean{\pm}O.5stdv.,\;mean{\pm}O.75stdv.,\;mean{\pm}stdv.$). Also the transition probability among wet, dry and normal years has been derived for the same truncation levels. and finally the average return periods based on the steady-state probabilities were obtained. This analysis has been applied to not only the entire data but also partial data set of before- and after-the long dry period around 1900 in order to compare and detect the possible difference between the Chukwooki (an old raingauge invented in Chosun age) and the modem flip-bucket style. As a result, Similar pattern of dry and wet year recurrence has been found, but the return period of extremely dry years after the dry period shown longer than that before the dry period. Assuming that the dry and wet years can be defined as $mean{\pm}$ standard deviations, respectively, the return period of the wet years is shown to be about 5~6 years and that of the dry years about 6~7 years.

• Journal of the Korean Mathematical Society
• /
• v.43 no.4
• /
• pp.859-869
• /
• 2006

Let {$X,\;X_n;n\;{\geq}\;1$} be a sequence of ${\imath}.{\imath}.d.$ random variables which belong to the attraction of the normal law, and $X^{(1)}_n,...,X^{(n)}_n$ be an arrangement of $X_1,...,X_n$ in decreasing order of magnitude, i.e., $\|X^{(1)}_n\|{\geq}{\cdots}{\geq}\|X^{(n)}_n\|$. Suppose that {${\gamma}_n$} is a sequence of constants satisfying some mild conditions and d'($t_{nk}$) is an appropriate truncation level, where $n_k=[{\beta}^k]\;and\;{\beta}$ is any constant larger than one. Then we show that the conditionally trimmed sums obeys the self-normalized law of the iterated logarithm (LIL). Moreover, the self-normalized LIL for conditionally censored sums is also discussed.

• Earthquakes and Structures
• /
• v.17 no.1
• /
• pp.101-113
• /
• 2019

Earthquake-induced pounding is one of the major reasons for structural failure in earthquake prone cities. An accurate description of the pounding phenomenon of two buildings requires the consideration of systems with a large number of degrees of freedom including adequate contact impact formulations. In this paper, firstly, a node to surface formulation for the realization of state-of-the-art pounding models for structural beam elements is presented. Secondly, a hierarchical substructure technique is introduced, which is adapted to the structural pounding problem. The numerical accuracy and efficiency of the method, especially for the contact forces, are verified on an academic example, applying four different impact elements. Error estimations are carried out and compared with the classical modal truncation method. It is demonstrated that the hierarchical substructure method is indeed able to significantly speed up the numeric integration procedure by preserving a required level of accuracy.

• Journal of Microbiology and Biotechnology
• /
• v.12 no.2
• /
• pp.242-248
• /
• 2002

Previously, it was reported that the nonhomologous C-terminal regions of the D-hydantoinases are nonessential for catalysis, but affect the oligomeric structure of the enzyme [3]. In an effort to further confirm the above observation, the C-terminal region-inserted enzyme was constructed by attaching a peptide (22 residues) at the C-terminal of the D-hydantoinase from Bacillus thermocatenulatus GH2, and its structural and biochemical properties were compared with both the wild-type and C-terminal region-truncated enzymes. As a result, native tetrameric D-hydantoinase was dimerized as the truncated enzyme, and the inserted mutant with a new sequence was expressed as a catalytically active form in E. coli. Expression level of the inserted and truncated enzymes were found to be significantly increased compared to the level of the wild-type enzyme, and this appears to be due to the reduced toxic effect of the mutant enzymes on host cells. Dimerized enzymes exhibited increased thermo- and pH stabilities considerably when compared with the corresponding wild-type enzyme. Comparison of the substrate specificity between the mutant and wild-type enzymes suggests that the substrate specificity of the D-hydantoinase is closely linked with the oligomeric structure.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.601-616
• /
• 2021

Retrial queueing models have been studied extensively in the literature. These have many practical applications, especially in service sectors. However, retrial queueing models have their own limitations. Typically, analyzing such models involve level-dependent quasi-birth-and-death processes, and hence some form of a truncation or an approximate method or simulation approach is needed to study in steady-state. Secondly, in general, the customers are not served on a first-come-first-served basis. The latter is the case when a new arrival may find a free server while prior arrivals are waiting in the retrial orbit due to the servers being busy during their arrivals. In this paper, we take a different approach to the study of multi-server retrial queues in which the signals are generated in such a way to provide a reasonably fair treatment to all the customers seeking service. Further, this approach makes the study to be level-independent quasi-birth-and-death process. This approach is different from any considered in the literature. Using matrix-analytic methods we analyze MAP/M/c-type retrial queueing models along with Poisson signals in steady-state. Illustrative numerical examples including a comparison with previously published retrial queues are presented and they show marked improvements in providing a quality of service to the customers.