• Proceedings of the Korea Technical Association of the Pulp and Paper Industry Conference
• /
• 2001.11a
• /
• pp.45-45
• /
• 2001

종이 표변에 전분 사이징을 하는 목적은 종이가 액체에 대하여 침투저항성을 부여하 여 종이의 인쇄적성을 향상시키며 아울랴 종이의 표면적성과 종이강도 등의 물리적 특 성을 향상시키기 위해서 사용된다. 표면 사이징은 기본적으로 종이 표면에 전분을 이용 한 필름을 형성하여 종이 표면의 공극크기를 줄여 인쇄잉크 등과 같은 액체의 침투속 도를 늦여준다. 현재 국내에서 널리 사용되는 표면 사이징용 전분으로는 산화전분과 자 가변성용 일반전분이 있다. 자가변성용 전분은 효소나 APS로 전분의 chain 길이를 적 당한 점도로 잘라주는 것으로 전분 호액의 노화가 쉽게 일어나는 경향이 있다. 산화전 분은 전분회사에서 산화제를 이용하여 전분의 점도를 사용자의 요구에 따라 조절한 것 으로 water holdout이 개선되고 자가변성용 전분보다는 노화 안정성이 개선되지만 종 이 내부로의 칩투가 많이 일어나 전분 필름 강도가 약해지며 표면 강도 향상 효과가 적고 종이의 광학적 특성을 저하시키는 단점을 지니고 있다. 또한 약 10 ~ 20% 정도 사 용되는 파지의 재활용시 펄프 섬유에 흡착되지 않는 전분으로 인해 백수 내의 COD 및 B BOD를 증가시키는 원인이 된다.따라서 본 연구에서는 펄프 섬유와 친화력이 높아 지료 내첨용 지력증강제로 널리 사용되고 있는 양성 전분의 양이온 치환도 및 점도를 사이즈 프레스에 적합하게 조절 하여 백상지 제조업체의 라언에 적용하였다. 결과분석 항목으로는 파지 재활용에 따른 백수내 COD, 칼숨 이온함량 등의 백수 시스템의 변화와 종이의 물리적, 광학적 특성 및 ink jet 용지의 인쇄적성 등을 측정하여 산화전분과 비교하였다. 그 결과 약 20%의 C COD 감소 효과와 10%정도의 OPR 향상 효과를 얻을 수 있었다. 종이 물성의 경우 인 장강도와 뺏뺏이(stiffness) 및 지분 등을 측정한 결과 산화전분 보다 향상되었다. 특히 지분의 경우, 참여한 회사의 지분관련 complain이 약 80% 정도 감소하는 결과를 나타 내었다. 또한 백상지의 경우 ink jet 프린터에 많이 사용됨으로 ink jet 프린터의 인쇄 적성을 image analyzer로 측정한 결과 산화전분 보다 향상된 결과를 나타내었다.

• Journal of KIISE:Software and Applications
• /
• v.32 no.8
• /
• pp.819-833
• /
• 2005

Code size reduction is ever becoming more important for compilers targeting embedded processors because these processors are often severely limited by storage constraints and thus the reduced code size can have a positively significant Impact on their performance. Various code size reduction techniques have different motivations and a variety of application contexts utilizing special hardware features of their target processors. In this work, we propose a novel technique that fully utilizes a set of hardware instructions, called the multiple load/store (MLS), that are specially featured for reducing code size by minimizing the number of memory operations in the code. To take advantage of this feature, many microprocessors support the MLS instructions, whereas no existing compilers fully exploit the potential benefit of these instructions but only use them for some limited cases. This is mainly because optimizing memory accesses with MLS instructions for general cases is an NP-hard problem that necessitates complex assignments of registers and memory off-sets for variables in a stack frame. Our technique uses a couple of heuristics to efficiently handle this problem in a polynomial time bound.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.40-48
• /
• 1998

Linear size expanders have been studied in many fields for the practical use, which make it possible to connect large numbers of device chips in both parallel communication systems and parallel computers. One major limitation on the efficiency of parallel computer designs has been the highly cost of parallel communication between processors and memories. Linear order concentrators can be used to construct theoretically optimal interconnection network schemes. Existing explicitly defined constructions are based on expanders, which have large constant factors, thereby rendering them impractical for reasonable sized networks. For these objectives, we use the more detailed matching points in permutation functions, to find out the bigger expansion constant from an equation, $\mid\Gamma_x\mid\geq[1+d(1-\midX\mid/n)]\midX\mid$. This paper presents an improvement of expansion constant on constructing concentrators using expanders, which realizes the reduction of the size in a superconcentrator by a constant factor. As a result, this paper shows an explicit construction of (n, 5, $1-\sqrt{3/2}$) expander. Thus, superconcentrators with 209n edges can be obtained by applying to the expanders of Gabber and Galil's construction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.726-736
• /
• 2004

In this paper, we proposed a new scalar multiplier structure needed for an elliptic curve cryptosystem(ECC) over the standard basis in GF(2$^{163}$ ). It consists of a bit-serial multiplier and a divider with control logics, and the divider consumes most of the processing time. To speed up the division processing, we developed a new division algorithm based on the extended Euclid algorithm. Dynamic data dependency of the Euclid algorithm has been transformed to static and fixed data flow by a localization technique, to make it independent of the input and field polynomial. Compared to other existing scalar multipliers, the new scalar multiplier requires smaller gate counts with improved processor performance. It has been synthesized using Samsung 0.18 um CMOS technology, and the maximum operating frequency is estimated 250 MHz. The resulting performance is 148 kbps, that is, it takes 1.1 msec to process a 163-bit data frame. We assure that this performance is enough to be used for digital signature, encryption/decryption, and key exchanges in real time environments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1311-1319
• /
• 2009

Microscopic specimen was captured by an integral imaging microscope and displayed as a three-dimensional image by an integral imaging display system. We applied the generalized relationship between pickup and display using two different lens arrays to our integral imaging microscope and display system. In order to display three-dimensional microscopic image, scaling of the captured elemental images is required. We analyzed the effect of the scaling coefficient in terms of the distortion of the displayed three-dimensional image and the loss of the captured elemental images. In our experiment, microscopic specimen is picked up by an integral imaging microscope having $125{\mu}m$ elemental lens pitch and displayed as three-dimensional image by an integral imaging display system having 1mm elemental lens pitch. The scaling coefficient was chosen to minimize the elemental image loss.

• Journal of Digital Convergence
• /
• v.11 no.11
• /
• pp.421-427
• /
• 2013

Disk Cache Manager(DCM), a functional server of microkernel based, to improve the I/O power of shared disks is designed and implemented in this work. DCM interfaces other different servers with message passing through ports by serving as a system actor the multi-thread mode on the Minix3 micro-kernel. DCM proposed in this paper uses the shared disk logically as a Seven Disk and Sodd Disk to enable parallel I/O. DCM enables the efficient placement of disk data because it raises disk cache hit-ratio by increasing the cache size when the utilization of the particular disk is high. Through experimental results, we show that DCM is quite efficient for a shared disk with higher utilization.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.673-681
• /
• 2004

As the use of digital videos is getting popular, there is an increasing demand for efficient browsing and retrieval of video. To support such operations, effective video indexing should be incorporated. One of the most fundamental steps in video indexing is to parse video stream into shots and scenes. Generally, it takes long time to parse a video due to the huge amount of computation in a traditional single computing environment. Previous studies had widely used Round Robin scheduling which basically allocates tasks to each slave for a time interval of one quantum. This scheduling is difficult to adapt in a heterogeneous environment. In this paper, we propose two different parallel parsing algorithms which are Size-Adaptive Round Robin and Dynamic Size-Adaptive Round Robin for the heterogeneous distributed computing environments. In order to show their performance, we perform several experiments and show some of the results.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.4
• /
• pp.243-250
• /
• 2010

This paper proposes a spectral modeling of Korean traditional instrument, Haegeum, using cepstral analysis to naturally describe Haegeum sounds varying with time. To get a precise result of cepstral analysis, we set the frame size to 3 periods of input signal and more cepstral coefficients are used to extract formants. The performance is enhanced by flexibly controlling the cutoff frequency of bandpass filter depending on the resonances in the synthesis process of sinusoidal components and the deleting peaks remained in the residual signal. To detect the change of pitch, we divide the input frames into silence, attack, and sustain region and determine which region the current frame is involved in. Then, the proposed method readjusts the frame size according to the fundamental frequency in the case of the current frame is in attack region and corrects the extraction errors of the fundamental frequency for the frames in sustain region. With these processes, the synthesized sounds are much more similar to the originals. The evaluation result through the listening test by a Haegeum player says that the synthesized sounds are almost similar to originals (96~100 % similar to the original sounds).

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.2
• /
• pp.66-74
• /
• 2008

Since modem embedded systems need to access, manipulate or store sensitive information, it requires being equipped with cryptographic file systems. However, cryptographic file systems result in poor performance so that they have not been widely adapted to embedded systems. Most cryptographic file systems degrade the performance unnecessarily because of system architecture. This paper proposes ISEA (Indexed and Separated Encryption Approach) that supports for encryption/decryption in system architecture and removes redundant performance loss. ISEA carries out encryption and decryption at different layers according to page cache layer. Encryption is carried out at lower layer than page cache layer while decryption at upper layer. ISEA stores the decrypted data in page cache so that it can be reused in followed I/O request without decryption. ISEA provides page-indexing which divides page cache into cipher blocks and manages it by a block. It decrypts pages partially so that it can eliminate unnecessary decryption. In synthesized experiment of read/write with various cache hit rates, it gives results suggesting that ISEA has improved the performance of encryption file system efficiently.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.53-58
• /
• 2011

Recently, MIMO technology, which can improve data rate, link reliability and diversity order, has been widely studied. However, due to the limitation of size, cost and complexity, it is difficult to equip multiple antennas in mobile devices. To overcome this problem, the cooperative communication scheme has been proposed. In this scheme, each terminal shares its single antenna to form a virtual MIMO environment. However, in conventional cooperative scheme, e.g, decode-and-forward, amplify and forward, the spectral efficiency is decreased if there are many terminals taking part in the cooperation. Therefore, the incremental relaying scheme has been proposed to solve this problem. In this paper, we consider various models using incremental relaying technique. In addition, the position of relay is investigated in order to obtain optimal performance.