• Journal of Korea Multimedia Society
• /
• v.17 no.9
• /
• pp.1070-1075
• /
• 2014

Due to a number of illegal copied videos, many video content markets have been threatened. Since this copied videos have intercepted the profits of the content holders, content developers lose the will to generate new contents. Therefore, video copy detection approaches have been developed to protect the copyrights of video contents. However, many illegal uploader who generate copied videos used video transformations to avoid video copy detection systems. Among of the video transformations, rotation and flipping did not distorted the quality of video contents. Thus, these two video transformations were adopt to generate copied video. In order to detect rotated or flipping copy videos, rotation and flipping robust region binary pattern (RFR) recently was proposed. But, this RFR has a weakness according to rotated angles. Therefore, in order to overcome this problem, multi region binary patterns are proposed in this paper. The proposed method has the similar performance with the original RFR. But, it showed much higher efficiency for memory spaces.

• Journal of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.967-986
• /
• 2017

We give the necessary condition for an operator defined on a cartesian product of $c_0(\mathcal{X})$ spaces to be summing or dominated and we show that for the multiplication operators this condition is also sufficient. By using these results, we show that ${\Pi}_s(c_0,{\ldots},c_0;c_0)$ contains a copy of $l_s(l^m_2{\mid}m{\in}\mathbb{N})$ for s > 2 or a copy of $1_s(l^m_1{\mid}{\in}\mathbb{N})$, for any $l{\leq}S$ < ${\infty}$. Also ${\Delta}_{s_1,{\ldots},s_n}(c_0,{\ldots},c_0;c_0)$ contains a copy of $l_{{\upsilon}_n(s_1,{\ldots},s_n)}$ if ${\upsilon}_n(s_1,{\ldots},s_n){\leq}2$ or a copy of $l_{{\upsilon}_n(s_1,{\ldots},s_n)}(l^m_2{\mid}m{\in}\mathbb{N})$ if 2 < ${\upsilon}_n(s_1,{\ldots},s_n)$, where ${\frac{1}{{\upsilon}_n(s_1,{\ldots},s_n})}={\frac{1}{s_1}}+{\cdots}+{\frac{1}{s_n}}$. We find also the necessary and sufficient conditions for bilinear operators induced by some method of summability to be 1-summing or 2-dominated.

• 한국생물공학회:학술대회논문집
• /
• 2001.11a
• /
• pp.99-102
• /
• 2001

Recombinant Saccharomyces cerevisiae strains harboring various copy numbers of hirudin gene were developed to study dependency of hirudin expression level on its gene copy number. A linear relationship between the copy number of hirudin expression cassette and hirudin expression level was observed up to 10 copies. A double <5-integration vector truncated wi 디 1 the unnecessary bacterial genes before yeast transformation showed a four-fold increase in transformation efficiency and a 1.3-fold enhancement in hirudin expression level compared with a single <5 system. Gratuitous hirudin expression strain was developed by disrupting the GALl gene of S. cerevisiae. Glucose that was fed in a limited manner effectively supported cell growth and hi겨din expression by the gratuitous strain. Effects of methanol concentrations on hirudin production in recombinant Hansenula polymorpha were investigated in continuous and fed-batch cultures. At a steady-state of continuous culture, an optimum methanol concentration of 1.7 g/L was determined at a dilution rate of 0.18 $h^{-1}$ with 1.8 mg/L ${\cdot}$ h hirudin productivity.

• Proceedings of the KIPE Conference
• /
• 2001.10a
• /
• pp.75-79
• /
• 2001

This paper presents a novel version of an active voltage clamped ZVS-PWM high frequency inverter using IGBTs for electromagnetic induction eddy current-based rolling drum heating in new generation copy and printing machines in consumer business use. The operating principle of this inverter circuit and unique features are described herein. Its constant frequency duty cycle (asymmetrical PWM) controlled voltage source quasi-resonant soft switching high frequency inverter employing IGBTs is proposed, which is capable of achieving stable and efficient zero voltage soft switching commutation over a widely specified power regulation range from full power to low power. The operating performances in a steady state of this inverter is discussed and evaluated on basis of simulation and experimental results as an induction heated roller in new generation copy machine.

• Microbiology and Biotechnology Letters
• /
• v.19 no.6
• /
• pp.568-574
• /
• 1991

The cloned glyceraldehyde-3-phosphate dehydrogenase (GAP) gene of Saccharomyces cereviszae (Holland et al., 1983) has been characterized. Based on the communication, we have also cloned 2.1 kb CAP DNA fragment and modified this fragment as a portable promoter. Two yeast expression vectors, one is YCp type vector being maintained at low copy number (1 or 2) and the other is YEp type vector at high copy number, have been constructed with the GAP promoter and the PH05' gene as a reporter. Our plasrnids were introduc,ed into S. cerevisiae HY-1, which has been improved. The $Trp^+$ transformants expressed APase activity efficiently and showed high level of PH05' transcripts.

• KIISE Transactions on Computing Practices
• /
• v.23 no.3
• /
• pp.165-170
• /
• 2017

Many studies have utilized GPGPU (General-Purpose Graphic Processing Unit) and its high computing power to compute complex tasks. The characteristics of GPGPU programs necessitate the operations of memory copy between the host and device. A high latency period can affect the performance of the program. Thus, it is required to significantly improve the performance of GPGPU programs by optimizations. By executing multiple GPGPU programs simultaneously, the latency hiding effect of memory copy is achieved by overlapping the memory copy and computing operations in GPGPU. This paper presents the results of analyzing the latency hiding effect for memory copy operations. Furthermore, we propose a performance anticipation model and an algorithm for the limitations of using pinned memory, and show that the use of the proposed algorithm results in a 41% performance increase.

• Proceedings of the Korea Technical Association of the Pulp and Paper Industry Conference
• /
• 1999.04b
• /
• pp.296-301
• /
• 1999

Different papers such as toilet and towel tissue, newsprint and copy paper made from reclaimed fibres were characterized using UV-VIS reflectance and fluorescence spectroscopy. The emission properties of the extracts of the papers were also evaluated. Photochemical irradiation at ambient temperatures, and thermal aging of the copy papers at 105$^{\circ}C$ and 150$^{\circ}C$ were performed. Post-colour numbers (PC) were calculated from the reflectance values measured from the corresponding UV-VIS reflectance spectra. Light absorption coefficient spectra were calculated before and after irradiation, and the changes in absorption coefficient were related to the content of chromophores in the papers. Photochemical and thermal discolouration of the copy papers, similar to that of virgin fibres, was readily observed. The influence of changes in the concentrations of fluorescent brightening agents and dyes on the spectral properties was also assessed. Photostabilization studies of the copy papers were performed with the use of polymer additives polyethylene glycol (PEG) and polytetrahydrofuran (PTHF).

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.1037-1046
• /
• 2009

Copy number variations(CNVs) are known as one of the most important factors in susceptibility to genetic disorders because they affect expression levels of genes. In previous studies, pyrosequencing, mini-sequencing real-time polymerase chain reaction(PCR), invader assays and other techniques have been used to detect CNVs. However, the higher the copy number in a genome, the more difficult it is to resolve the copies, so a more accurate method for measuring CNVs and assigning genotype is needed. PCR followed by a quantitative oligonucleotide ligation assay(qOLA) was developed for quantifying CNVs. The aim of this study was to compare the two methods for detecting and quantifying the CNVs of duplicated gene: the published pyrosequencing assay(pyro_CNV) and the newly developed qOLA_CNV. The accuracy and precision of the assay were evaluated for porcine KIT, which was selected as a model locus. Overall, the root mean squares(RMSs) of bias and standard deviation of qOLA_CNV were 2.09 and 0.45, respectively. These values are less than half of those of pyro CNV.

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.71-79
• /
• 2001

In Incremental attribute evaluation algorithm, a new input attribute is exact1y compared with a previous input attribute tree, and then determine which subtrees from the old should be used in constructing the new one. In this paper incremental attribute evaluation algorithm was used to make incremental evlauation of hierarchical attribute grammar more efficient1y, and reconstructing the incremental attribute evaluation algorithm by analyzing that of Carle and Pollock, finally the incremental attribute evaluation algorithm for optimalized attribute tree d' copy was constructed by applying element of attribute !ree dcopy to a new attribute tree d' copy. Also proving that how the reused nod and type of defined parameter in input program carried out the incremental attribute evaluation by using that algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.19-26
• /
• 2010

The Windows registry is a hierarchical database where the configuration data of a system or application programs is stored. In this paper, we presented and implemented a registry virtualization algorithm and measured its performance. The registry virtualization algorithm presented in the paper is called Copy-One-level On Write-Open(COOWO) that is a modified version of general Copy On Whte(COW) method to make it suitable for registry virtualization. In this paper, we implemented the proposed algorithm as a dynamically loadable library in Windows and applied it to many Windows application programs. This paper is meaningful since we described a registry virtualization algorithm in detail in situation where we can not find papers that describe the registry virtualization in detail, and we could find the performance of the algorithm can be used in the real applications.