• The Journal of the Korea Contents Association
• /
• v.2 no.4
• /
• pp.59-66
• /
• 2002

As for the software development, it is complicated, and size of software is growing larger. And contraction of a software development period is required acutely because it is short a period of software life cycle. Also, it becomes harder development and a maintenance because it is short a life cycle of developed software. According to this an effort is increased in order to reduce a development cost and time as using a component to have been implemented previously in development of software. A current component technology is developing into a very fast speed and is bringing a large change into development of a Web base system in addition to existing software development method. In this paper, we were handling a related technology for Web system development of a CBD base systematically and derived an issue to apply it to development of a Web system and presented an efficient practical use method of a component technology. First of all we looked into a component technology and a CBD methodology systematically and described a component technology in Web. Also, we proposed a method to increase development and efficiency of practical use of a Web system based on a component. The this study result can decrease a development cost of a Web system and a load of maintenance management through the re-use of a code.

• The Journal of the Acoustical Society of Korea
• /
• v.30 no.5
• /
• pp.265-272
• /
• 2011

In most of the ISF (or LSF) based real time speech codec, SVQ (split vector quantization) method is used to decrease the quantizer complexity and memory size of codebook. However, it produces drawback that the level of correlation between code vectors can not be used during vector splits. This paper presents a new method of adaptive ISF vector quantization, which compensates the drawbacks of SVQ structured quantizer for wideband speech codec. In each different frame, the proposed method makes use of the correlation between splitted vectors by adaptively changing codebook distribution according to ordering property of ISF. The algorithm is evaluated in AMR-WB, and shows about 1.5 bit per frame improvement.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.427-435
• /
• 2009

Users are able to search and read interesting items and hence click hyperlink linked to the item which is detailed content unit such as menu, login, news, video, etc. Small screen like mobile device is very difficult to viewing all web contents at once. Browsing and searching for interesting items by scrolling to left and right or up and down is discomfort to users in small screen. Searching and displaying directly the item preferred by users can reduces difficulty of interface manipulation of mobile device. To archive it, web contents based on desktop will be segmented on a per-item basis which component unit of web contents. Most segment algorithms are based on segment method through analysis of HTML code or mobile size. However, it is difficult to extract item blocks. Because present web content is getting more complicated and diversified in structure and content like web portal services. A web content segment algorithm suggested in this paper is based on extracting item blocks is component units of web contents.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.369-372
• /
• 2003

This paper describes a design of OFDM (Orthogoanl Frequency Division Multiplexing) based wireless LAN system receiver, defined in IEEE 802.11a standards. Because OFDM system uses several orthogonal sequence sets, it ran avoid selective fading of fast data transfer problem when it is used with error correction code. But if the receiver is not synchronized, the orthogonal of between sub-ralliers will be destroyed and the data interruption will be generated. So it makes error property get worse very murk. For improving the noise error, we use the relationship of phasor between sub-carriers and make system synchronization using one tab equalizer. The designed OFDM block is described by Verilog HDL for the efficient and small size hardware. And we preform the functional verification and evaluation using the vector of standards.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.1
• /
• pp.88-99
• /
• 1996

The explicit scheme for finite element analysis of sheet metal forming problems has been widely used for providing practical solutions since it improves the convergency problem, memory size and computational time especially for the case of complicated geometry and large element number. The explicit schemes in general use are based on the elastic-plastic modeling of material requiring large computataion time. In the present work, a basic formulation for rigid-plastic explicit finite element analysis of plain strain sheet metal forming problems has been proposed. The effect of some basic parameters involved in the dynamic analysis has been studied in detail. Thus, the effective ranges of parameters have been proposed for numerical simultion by the rigid-plastic explicit finite element method. A direct trial-and-error method is introduced to treat contact and friction. In computation, sheet material is assumed to possess normal anisotropy and rigid-plastic workhardening characteristics. In order to show the validity and effectiveness of the proposed explicit scheme, computations are carried out for cylindrical punch stretching and the computational results are compared with those by the implicit scheme as well as with a commercial code. The proposed rigid-plastic exlicit finite element method can be used as a robust and efficient computational method for analysis of sheet metal forming.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1502-1510
• /
• 1999

In adaptive job allocation method for multiprocessor systems a job is folded, or split in two halves, to fit for an available subcube in order to reduce the waiting time of jobs. In this method, however, since a job is folded whenever a subcube with the proper size is not found, the prolonged execution time caused by job split may override the savings in waiting time, in which case the total adaptive jobs may be increased. In this paper, an improved adaptive job allocation algorithm, called Estimate-fold allocation, Is presented and evaluated. The proposed algorithm estimates the costs and takes the better of two alternatives ; folding right away and waiting until a bigger subcube becomes available. The average total job execution cost of our algorithm is calculated and compared to those of the conventional adaptive, buddy, and gray-code algorithms through simulations. The results shows that our proposed algorithm performs better than others.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.652-660
• /
• 2008

Applications running under embedded systems require various device drivers designed for different types and versions of the OS to manage resources effectively. In this paper, an automated device driver generator system which can generate the device drivers to be used in newer versions the target OS is proposed. In the proposed system, the structures of device drivers of specific OS are designed in the templates and stored in a library, and the target device drivers are generated by adding codes to the stored templates. Once device drivers are generated, they are registered into the kernel. The experimental results show that data transfer time has been slightly increased when compared against manually created drivers for TFT-LCD driver, USB interface keyboard/mouse driver, and AC'97 controller drivers. The code size for the generated drivers after compilation has also been increased slightly when compared with manually designed device drivers.

• Journal of Microbiology and Biotechnology
• /
• v.18 no.12
• /
• pp.1938-1944
• /
• 2008

The procpb gene encoding human procarboxypeptidase B (proCPB, GeneBank access code AJ224866) was cloned and its Pichia expression plasmid, $pPIC9{\alpha}$/hproCPB (9.2 kb), was constructed, in which procpb was under the control of the AOXl promoter and connected to the downstream of the mating factor ${\alpha}$-1 ($MF{\alpha}1$) signal sequence. The plasmid was linearized by digestion with Sacl, and integrated into the genome of P. pastoris strain GS115. By culturing of Pichia transformant on methanol medium, the human proCPB was successfully expressed and secreted into the culture supernatant. Moreover, Western blot analysis of the extracellular proteins showed proCPB bands clearly at a molecular mass of 45 kDa, confirming the expression of proCPB with its right size. The CPB activity reached about 3.5 U/ml and 12.7 U/ml in the flask and fermentor batch cultures of Pichia transformant, respectively. No CPB enzyme activity was found in the intracellular fraction. When the fed-batch cultivation was performed with methanol and glycerol mixture as a feeding medium, the extracellular CPB activity was increased to 42.0 U/ml, which corresponds to a 3.3-fold higher level of CPB activity than that of batch culture. The $K_m$ and $k_{cat}$ values of recombinant human CPB enzyme for hippuryl-$_L$-Arg as a substrate were estimated to be 0.16 mM and $11.93\;sec^{-1}$, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.364-370
• /
• 2002

In this paper, we propose a VLSI array architecture for high speed processing of FBMA. First of all, the sequential FBMA is transformed into a single assignment code by using the index space expansion, and then the dependance graph is obtained from it. The two dimensional VLSI array is derived by projecting the dependance graph along the optimal direction. Since the candidate blocks in the search range are overlapped with columns as well as rows, the processing elements of the VLSI array are designed to reuse the overlapped data. As the results, the number of data inputs is reduced so that the processing performance is improved. The proposed VLSI array has (N$^2$+1)${\times}$(2p+1) processing elements and (N+2p) input ports where N is the block size and p is the maximum search range. The computation time of the rat reference block is (N$^2$+2(p+1)N+6p), and the block pipeline period is (3N+4p-1).