• Journal of the Ergonomics Society of Korea
• /
• v.29 no.6
• /
• pp.925-932
• /
• 2010

Most of the research on three-dimensional interaction field have showed different accuracy in terms of sensing, mode and method. Furthermore, implementation of interaction has been a lack of consistency in application field. Therefore, this study is to suggest research trends of three-dimensional interaction using meta-analysis. Searching relative keyword in database provided with 153 domestic papers and 188 international papers covering three-dimensional interaction. Analytical coding tables determined 18 domestic papers and 28 international papers for analysis. Frequency analysis was carried out on method of action, element, number, accuracy and then verified accuracy by effect size of the meta-analysis. As the results, the effect size of sensor-based was higher than vision-based, but the effect size was extracted to small as 0.02. The effect size of vision-based using hand motion was higher than sensor-based using hand motion. Therefore, implementation of three-dimensional sensor-based interaction and vision-based using hand motions more efficient. This study was significant to comprehensive analysis of three-dimensional motion recognition for interaction and suggest to application directions of three-dimensional interaction.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.93-100
• /
• 2012

In this paper we have proposed a linear time algorithm for solving the minimum sharable-bandwidth tree construction problem. The public-shared network is a user generated infrastructure on which a user can access the Internet and transfer data from any place via access points with sharable bandwidth. Recently, the idea of constructing the SVC video streaming delivery system on public-shared network has been proposed. To send video stream from the stream server to clients on public-shared network, a tree structure is constructed. The problem of constructing a tree structure to serve the video streaming requests by using minimum amount of sharable bandwidth has been shown to be NP-hard. The previously published algorithms for solving this problem are either unable to find solutions frequently or less efficient. The experimental results showed that our algorithm is excellent both in the success rate of finding solutions and in the quality of solutions.

• Journal of IKEEE
• /
• v.21 no.1
• /
• pp.39-45
• /
• 2017

Image compression is now essential for applications such as transmission and storage in data bases. For video and digital image applications the use of long tap filters, while not providing any significant coding gain, may increase the hardware complexity. We use a wavelet transform in order to obtain a set of bi-orthogonal sub-classes of images; First, the design of short kernel symmetric analysis is presented in 1-dimensional case. Second, the original image is decomposed at different scales using a subband filter banks. Third, this paper is presented a technique for obtaining 2-dimensional bi-orthogonal filters using McClellan transform. It is shown that suggested wavelet bases is well used on wavelet transform for image compression. From performance comparison of bi-orthogonal filter, we actually use filters close to ortho-normal filters on application of wavelet bases to image analysis.

• Journal of Microbiology
• /
• v.39 no.2
• /
• pp.95-101
• /
• 2001

In an effort to develop an efficient expression and secretion system for heterologous proteins in Aspergilius nidulans, the PCR-amplified coding sequence for alkaline pretense (AlpA) of A. oryzae was cloned into a fungal expression vector downstream of A. nidulans aicA (alcohol dehydrogenase) promoter to yield pRAAlp. Transformation of A. nidulans with pRAAlp gave stable transformants harboring various copy numbers (3 to 10) of integrated alpA gene, from among which 6 representatives were selected. On a medium containing 0.8% ammonium sulfate that represses the expression of the host's own pretense, the alcA prumoter-controlled AlpA expression was strongly induced by threonine but repressed by glucose. The level of AlpA secretion was highest (approximately 666 mU/ml) in transformant ALP6 containing the largest copy number integrated alpA. However, the level of AlpA secretion was not necessarily proportional to the copy numbers of the integrated alpA genes. The N-terminal sequence or the secreted mature AlpA was determined to be Gly-Leu-Thr-Thr-Gln-Lys-Ser and its molecular mass to be approximately 34 kDa, indicating that AlpA is properly processed by the removal of 121 N-terminal amino acids.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.28 no.2
• /
• pp.137-155
• /
• 2017

Many university libraries, facing financial difficulties, have been forced to operate on a tighter budget. Such trend has created the need for an objective standard that will prioritize current library services. This study derives service quality factor via open coding from internet postings posted in the last five years on the Korean National Open University's library website, and also calculates the customer satisfaction quotient and dissatisfaction quotient using the Kano Model and Timko's Customer Satisfaction Coefficient. The result draws 25 service quality factors across 3 categories consisting of: (i) 8 attractive qualities, (ii) 15 one-dimensional qualities and (iii) 2 reverse qualities. The study, through the calculation of Timko's Customer Satisfaction Coefficient per service quality, proposes an intensive service that can prioritize the efficient use of library budget.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12C
• /
• pp.1669-1676
• /
• 2004

In H.264, 7 modes {16${\times}$16, 16${\times}$8, 8${\times}$16, 8${\times}$8, 8${\times}$4, 4${\times}$8, 4${\times}$4) are used to enhance the coding efficiency. The motion vector estimation with 7 modes may require huge computing time. In this paper, to speed up the motion vector estimation procedure while the high image quality remains, we propose a motion vector refinement scheme using the temporary motion vector generated with little computation. The proposed estimation process consists of three phases: Mode decision for a 16${\times}$16 macroblock, Composing a temporary motion vector, Refinement of the temporary motion vector. We demonstrate the effectiveness of the proposed method by computer simulation. In the results, the encoding time consumed by the proposed scheme has been reduced significantly while the encoded video quality remains unchanged.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5C
• /
• pp.384-392
• /
• 2012

Recently, much research on blind estimation of the interleaver parameters has been performed by using Gauss-Jordan elimination to find the linearity of the block channel code. When using Gauss-Jordan elimination, the input data to be calculated needs to run as long as the square multiple of the number of the interleaver period. Thus, it has a limit in estimating the interleaver parameters with insufficient input data. In this paper, we introduce and analyze an estimation algorithm which can estimate interleaver parameters by using only 15 percent of the input data length required in the above algorithm. The shorter length of input data to be calculated makes it possible to estimate the interleaver parameters even when limited data is received. In addition, a 80 percent reduction in the number of the interleaver period candidates increases the efficiency of analysis. It is also feasible to estimate both the type and size of the interleaver and the type of channel coding.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.1
• /
• pp.3-15
• /
• 2000

As an OLT in the central office controls up to 64 ONUs in the subscriber area via a passive optical splitter, the hU PON system can accomodate PTTx in a single platform with low cost. To operate the system, it is important to implement an efficient MAC protocol, however, the protocol is currently the further study area in the ITU-T 0.983.1. In this paper, we suggest the MAC protocol which is needed to send cells of ONU to upstream, and based on the ITU-T G.983.1. We survey conventional MAC protocols which are not based on G.983.1, and then formulate the minislot period and length for the grant request and determine the optimal value of each parameter. Also, we suggest a coding scheme for the grant field of the PLOAM cell and the procedure allocating optimal parameters to the ONU.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.365-372
• /
• 2000

he paper introduces evolutionary computing to Fractal Image Compression(FIC). In Fractal Image Compression(FIC) a partitioning of the image into ranges is required. As a solution to this problem there is a propose that evolution computation should be applied in image partitionings. Here ranges are connected sets of small square image blocks. Populations consist of $N_p$ configurations, each of which is a partitioning with a fractal code. In the evolution each configuration produces $\sigma$ children who inherit their parent partitionings except for two random neighboring ranges which are merged. From the offspring the best ones are selected for the next generation population based on a fitness criterion Collage Theorem. As the optimum image includes duplication in image data, it gets smaller in saving space more efficient in speed and more capable in image quality than any other technique in which other coding is used. Fractal Image Compression(FIC) using evolution computation in multimedia image processing applies to such fields as recovery of image and animation which needs a high-quality image and a high image-compression ratio.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1900-1906
• /
• 1997

In this paper, the efficient BILBO(named EBILBO) is designed for BIST that is able to batch the testing when circuit is designed on FPGA. The proposed algorithm of batch testing is able to test the normal operation speed with one-pin-count that can control all part of large and complex circuit. PRTPG is used for the test pattern and MISR is used for PSA. The proposed algorithm of batch testing is VHDL coding on behavioral description, so it is easily modified the model of test pattern generation, signature analysis and compression. The EBILBO's area and the performance of designed BIST are evaluated with ISCAS89 benchmark circuit on FPGA. In circuit with above 600 cells, it is shown that area is reduced below 30%, test pattern is flexibly generated about 500K and the fault coverage is from 88.3% to 100%. EBILBO for the proposed batch testing BIST is able to execute concurrently normal and test mode operation in real time to the number of $s+n+(2^s/2^p-1)$ clock(where, in CUT, # of PI;n, # of register, p is order # of polynomial). The proposed algorithm coded with VHDL is made of library, then it well be widely applied to DFT that satisfy the design and test field on sme time.