• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.22 no.4
• /
• pp.361-379
• /
• 2011

This paper aims to propose the most appropriate method for calculating the journal PageRank in a domestic citation database. Korean journals show relatively high journal self-citation ratios and have many outgoing citations to external journals which are not included in the domestic citation database. Because the PageRank algorithm requires recursive calculation to converge, those two characteristics of domestic citation databases must be accounted for in order to measure the citation impact of Korean journals. Therefore, two PageRank calculation methods and four formulas for self-citation adjustment have been examined and tested for KSCD journals. The results of the correlation analysis and regression analysis show that the SCImago Journal Rank formula with the cr2 type self-citation adjustment method seems to be a more appropriate way to measure the relative impact of domestic journals in the Korean Science Citation Database.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.9
• /
• pp.1023-1029
• /
• 2007

In this paper, we propose the method to solve the BLT equations using Laguerre polynomials in time domain. The solution of BLT equations is obtained by recursive, differential and integral properties of Laguerre polynomials. The verification of the proposed method is tested by applying it to the two-wired transmission line with resistors and capacitors, which is illuminated by the electromagnetic plane wave pulse. And the result is compared with the corresponding transient responses obtained from inverse fast Fourier transform(IFFT) of the frequency domain solutions of BLT equations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.9
• /
• pp.1635-1641
• /
• 2017

In this paper, a trellis-coded 3-dimensional (3-D) orthogonal frequency division multiplexing (OFDM) system is presented and its performance is analyzed. Here, a set-partitioning technique for trellis coding with respect to a 3-D signal constellation is also presented. We show theoretically that the proposed system, which exploits a trellis coding scheme with recursive systematic convolutional codes (RSC) of code rate R = 1/3 and 2/3, can improve symbol error rate (SER) up to 7.8 dB as compared with the uncoded OFDM system in an additive white Gaussian noise (AWGN) channel. Computer simulation confirms that the theoretical analysis of the proposed system is very accurate. It is, therefore, considered that the proposed trellis-coded 3-D OFDM system is well suited for the high quality digital transmission system without increase in the available bandwidth.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.677-690
• /
• 1995

In this paper, we propose the high efficiency data compression capable of error control using block-sorting, move to front(MTF) and arithmetic code with variable length in to fixed out. First, the substring with is parsed into length N is shifted one by one symbol. The cyclic shifted rows are sorted in lexicographical order. Second, the MTF technique is applied to get the reference of locality in the sorted substring. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one codeword. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation for symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy, compression ratio and coding times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1A
• /
• pp.58-65
• /
• 2002

This paper deals with a delay problem in the endpoint detection of double-talk detection algorithm using correlation coefficient in the acoustic echo canceller. In case that past power is much bigger than current power like at the end of double-talking period, the power, estimated using forgetting factor, decreases slowly to cause a delay problem in the endpoint detection. In this paper, two methods are proposed to solve this problem. One is that the current power is periodically replaced by a new average power and the other is that the past power in recursive equation is periodically removed or replaced by other values. The simulation results show that proposed methods outperform conventional method in the endpoint of double-talking periods without increasing the computational burden much more.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.6
• /
• pp.1369-1375
• /
• 2012

One of important problems in the theory of sequences is to determine the values and number of occurrences of each value taken on by the cross-correlation. In this paper, we find the values and the number of occurrences of each value of cross-correlation between an m-sequence u(t) of period $2^n-1$ and its decimation $u(dt)(0{\leq}t{\leq}2^n-2)$ where n=2m, 2s|m and $d=(2^{2m}+2^{2s+1}-2^{m+s+1}-1)/(2^s-1)$. Also we show that a family of decimations leads to a four-valued cross-correlation.

• Journal of Digital Contents Society
• /
• v.11 no.4
• /
• pp.597-606
• /
• 2010

This paper describes a real-time camera tracking framework specifically designed to track a monocular camera in an AR workspace. Typically, the Kalman filter is often employed for the camera tracking. In general, however, tracking performances of conventional methods are seriously affected by unpredictable situations such as ambiguity in feature detection, occlusion of features and rapid camera shake. In this paper, a recursive Bayesian sampling framework which is also known as the particle filter is adopted for the camera pose estimation. In our system, the camera state is estimated on the basis of the Gaussian distribution without employing additional uncertainty model and sample weight computation. In addition, the camera state is directly computed based on new sample particles which are distributed according to the true posterior of system state. In order to verify the proposed system, we conduct several experiments for unstable situations in the desktop AR environments.

• BMB Reports
• /
• v.28 no.6
• /
• pp.509-514
• /
• 1995

A putative secondary structure of the mRNA for the human hepatitis B virus (HBV) X gene is proposed based on not only chemical and enzymatic determination of its single- and double-stranded regions but also selection by the computer program MFOLD for energy minimum conformation under the constraints that the experimentally determined nucleotides were forced or prohibited to base pair. An RNA of 536 nucleotides including the 461-nucleotide HBV X mRNA sequence was synthesized in vitro by the phage T7 RNA polymerase transcription. The thermally renatured transcripts were subjected to chemical modifications with dimethylsulfate and kethoxal and enzymatic hydrolysis with single strand-specific RNase T1 and double strand-specific RNase V1, separately. The sites of modification and cleavage were detected by reverse transcriptase extension of 4 different primers. Many nucleotides could be assigned with high confidence, twenty in double-stranded and thirty-seven in Single-stranded regions. These nucleotides were forced and prohibited, respectively, to base pair in running the recursive RNA folding program MFOLD. The results suggest that 6 different regions (5 within X mRNA) of 14~23 nucleotides are Single-stranded. This putative structure provides a good working model and suggests potential target sites for antisense and ribozyme inhibitors and hybridization probes for the HBV X mRNA.

• Transactions of the KSME C: Technology and Education
• /
• v.3 no.1
• /
• pp.15-21
• /
• 2015

In this paper a prediction method of GHP performance is proposed for increasing design accuracy. Two compressors with different capacity and 2311cc gas engine are used for prediction and the target capacity of GHP is 25HP. For predicting GHP performance at first the operation points are randomly selected and then as compared with compressor performance date and heat exchanger characteristic, more accurate operating points are decided through recursive calculation. Lastly engine performance date is used for calculating gas consumption volume. Predicting heating mode performance of GHP, evaporator is separated to the two section of absorbing heat in outdoor air and in engine. From the experimental results, it was found that the simulation model is good for the predicting GHP efficiency and the difference of predicted and measured efficiency is less than 5%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.282-291
• /
• 2001

In this paper, an efficient VLSI architecture of Shape Adaptive Discrete Cosine Transform(SADCT) based on systolic array is proposed. Since transform size in SADCT is varied according to the shape of object in each block, it are dropped that both usability of processing elements(PE´s) and throughput rate in time-recursive SADCT structure. To overcome these disadvantages, it is proposed that the architecture based on a systolic way structure which doesn´t need memory. In the proposed architecture, throughput rate is improved by consecutive processing of one-dimensional SADCT without memory and PE´s in the first column are connected to that in the last one for improvement of usability of PE. And input data are put into each column of PE in parallel according to the maximum data number in each rearranged block. The proposed architecture is described by VHDL. Also, its function is evaluated by MentorTM. Even though the hardware complexity is somewhat increased, the throughput rate is improved about twofold.