• Title/Summary/Keyword: 2-D Coding

Search Result 564, Processing Time 0.025 seconds

Molecular Cloning, Characterization, and Application of Organic Solvent-Stable and Detergent-Compatible Thermostable Alkaline Protease from Geobacillus thermoglucosidasius SKF4

  • Suleiman D Allison;Nur AdeelaYasid;Fairolniza Mohd Shariff; Nor'Aini Abdul Rahman
    • Journal of Microbiology and Biotechnology
    • /
    • v.34 no.2
    • /
    • pp.436-456
    • /
    • 2024
  • Several thermostable proteases have been identified, yet only a handful have undergone the processes of cloning, comprehensive characterization, and full exploitation in various industrial applications. Our primary aim in this study was to clone a thermostable alkaline protease from a thermophilic bacterium and assess its potential for use in various industries. The research involved the amplification of the SpSKF4 protease gene, a thermostable alkaline serine protease obtained from the Geobacillus thermoglucosidasius SKF4 bacterium through polymerase chain reaction (PCR). The purified recombinant SpSKF4 protease was characterized, followed by evaluation of its possible industrial applications. The analysis of the gene sequence revealed an open reading frame (ORF) consisting of 1,206 bp, coding for a protein containing 401 amino acids. The cloned gene was expressed in Escherichia coli. The molecular weight of the enzyme was measured at 28 kDa using sodium dodecyl sulfate polyacrylamide gel electrophoresis (SDS-PAGE). The partially purified enzyme has its highest activity at a pH of 10 and a temperature of 80℃. In addition, the enzyme showed a half-life of 15 h at 80℃, and there was a 60% increase in its activity at 10 mM Ca2+ concentration. The activity of the protease was completely inhibited (100%) by phenylmethylsulfonyl fluoride (PMSF); however, the addition of sodium dodecyl sulfate (SDS) resulted in a 20% increase in activity. The enzyme was also stable in various organic solvents and in certain commercial detergents. Furthermore, the enzyme exhibited strong potential for industrial use, particularly as a detergent additive and for facilitating the recovery of silver from X-ray film.

A Macroblock-Layer Rate Control for H.264/AVC Using Quadratic Rate-Distortion Model (2차원 비트율-왜곡 모델을 이용한 매크로블록 단위 비트율 제어)

  • Son, Nam-Rae;Lee, Guee-Sang;Yim, Chang-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.849-860
    • /
    • 2007
  • Because the H.264/AVC standard adopts the variable length coding algorithm, the rate of encoded video bitstream fluctuates a lot as time flows, though its compression efficiency is superior to that of existing standards. When a video is transmitted in real-time over networks with fixed low-bandwidth, it is necessary to control the bit rate which is generated from encoder. Many existing rate control algorithms have been adopting the quadratic rate-distortion model which determines the target bits for each frame. We propose a new rate control algorithm for H.264/AVC video transmission over networks with fixed bandwidth. The proposed algorithm predicts quantization parameter adaptively to reduce video distortion using the quadratic rate-distortion model, which uses the target bit rate and the mean absolute difference for current frame considering pixel difference between macroblocks in the previous and the current frame. On video samples with high motion and scene change cases, experimental results show that (1) the proposed algorithm adapts the encoded bitstream to limited channel capacity, while existing algorithms abruptly excess the limit bit rate; (2) the proposed algorithm improves picture quality with $0.4{\sim}0.9dB$ in average.

Modulation Scheme for Network-coded Bi-directional Relaying over an Asymmetric Channel (양방향 비대칭 채널에서 네트워크 부호화를 위한 변조 방식)

  • Ryu, Hyun-Seok;Kang, Chung-G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.2B
    • /
    • pp.97-109
    • /
    • 2012
  • In this paper, we propose a modulation scheme for a network-coded bi-directional relaying (NBR) system over an asymmetric channel, which means that the qualities of the relay channel (the link between the BS and RS) and access channel (the link between the RS and MS) are not identical. The proposed scheme employs a dual constellation in such a way that the RS broadcasts the network-coded symbols modulated by two different constellations to the MS and BS over two consecutive transmission intervals. We derive an upper bound on the average bit error rate (BER) of the proposed scheme, and compare it with the hybrid constellation-based modulation scheme proposed for the asymmetric bi-directional link. Furthermore, we investigate the channel utilization of the existing bi-directional relaying schemes as well as the NBR system with the proposed dual constellation diversity-based modulation (DCD). From our simulation results, we show that the DCD gives better average BER performance about 3.5~4dB when $E_b/N_0$ is equal to $10^{-2}$, while maintaining the same spectral efficiency as the existing NBR schemes over the asymmetric bi-directional relaying channel.

Cloning and Characterization of endo-β-1,4-glucanase genes from the Midgut of the Earthworm, Eisenia andrei (지렁이 중장에서 발현되는 endo-β-1,4-glucanase 유전자들의 클로닝과 특성에 관한 연구)

  • Lee, Myung-Sik;Park, Sang-Kil;Tak, Eun-Sik;Ahn, Chi-Hyun;Kim, Hye-Ryung;Park, Soon-Cheol
    • Journal of the Korea Organic Resources Recycling Association
    • /
    • v.15 no.3
    • /
    • pp.80-89
    • /
    • 2007
  • Two endogenous endo-${\beta}$-1,4-D-glucanase (EGase, EC 3.2.1.4) cDNAs were cloned from the midgut of the earthworm Eisenia anderi, and named EaEG2 and EaEG3, respectively. A sequence of 1,368 bp was determined and the coding region is composed of 456 amino acid residues including the initiation methionine. The N-terminal region of 20 residues in the deduced sequence was regarded as the signal peptide. These EGases belong to glycosyl hydrolase family 9 (GHF9) and showed high levels of identity(51-55%) with selected termite, cockroache, crayfish and mollusc EGases. The EGases of earthworm consist of three consensus catalytic domains found in most microbial cellulases. A phylogenetic tree was constructed using the deduced amino acid sequence data matched through the BLASTX program and showed that GHF9 families could be divided into five groups of arthropoda, bacteria, plant, annelida and mollusc.

  • PDF

Low-complexity Local Illuminance Compensation for Bi-prediction mode (양방향 예측 모드를 위한 저복잡도 LIC 방법 연구)

  • Choi, Han Sol;Byeon, Joo Hyung;Bang, Gun;Sim, Dong Gyu
    • Journal of Broadcast Engineering
    • /
    • v.24 no.3
    • /
    • pp.463-471
    • /
    • 2019
  • This paper proposes a method for reducing the complexity of LIC (Local Illuminance Compensation) for bi-directional inter prediction. The LIC performs local illumination compensation using neighboring reconstruction samples of the current block and the reference block to improve the accuracy of the inter prediction. Since the weight and offset required for local illumination compensation are calculated at both sides of the encoder and decoder using the reconstructed samples, there is an advantage that the coding efficiency is improved without signaling any information. Since the weight and the offset are obtained in the encoding prediction step and the decoding step, encoder and decoder complexity are increased. This paper proposes two methods for low complexity LIC. The first method is a method of applying illumination compensation with offset only in bi-directional prediction, and the second is a method of applying LIC after weighted average step of reference block obtained by bidirectional prediction. To evaluate the performance of the proposed method, BD-rate is compared with BMS-2.0.1 using B, C, and D classes of MPEG standard experimental image under RA (Random Access) condition. Experimental results show that the proposed method reduces the average of 0.29%, 0.23%, 0.04% for Y, U, and V in terms of BD-rate performance compared to BMS-2.0.1 and encoding/decoding time is almost same. Although the BD-rate was lost, the calculation complexity of the LIC was greatly reduced as the multiplication operation was removed and the addition operation was halved in the LIC parameter derivation process.

A Fast Motion Estimation Algorithm Based on Multi-Resolution Frame Structure (다 해상도 프레임 구조에 기반한 고속 움직임 추정 기법)

  • Song, Byung-Cheol;Ra, Jong-Beom
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.5
    • /
    • pp.54-63
    • /
    • 2000
  • We present a multi-resolution block matching algorithm (BMA) for fast motion estimation At the coarsest level, a motion vector (MV) having minimum matching error is chosen via a full search, and a MV with minimum matching error is concurrently found among the MVs of the spatially adjacent blocks Here, to examine the spatial MVs accurately, we propose an efficient method for searching full resolution MV s without MV quantization even at the coarsest level The chosen two MV s are used as the initial search centers at the middle level At the middle level, the local search is performed within much smaller search area around each search center If the method used at the coarsest level is adopted here, the local searches can be done at integer-pel accuracy A MV having minimum matching error is selected within the local search areas, and then the final level search is performed around this initial search center Since the local searches are performed at integer-pel accuracy at the middle level, the local search at the finest level does not take an effect on the overall performance So we can skip the final level search without performance degradation, thereby the search speed increases Simulation results show that in comparison with full search BMA, the proposed BMA without the final level search achieves a speed-up factor over 200 with minor PSNR degradation of 02dB at most, under a normal MPEG2 coding environment Furthermore, our scheme IS also suitable for hardware implementation due to regular data-flow.

  • PDF

Implementing RPA for Digital to Intelligent(D2I) (디지털에서 인텔리전트(D2I)달성을 위한 RPA의 구현)

  • Dong-Jin Choi
    • Information Systems Review
    • /
    • v.21 no.4
    • /
    • pp.143-156
    • /
    • 2019
  • Types of innovation can be categorized into simplification, information, automation, and intelligence. Intelligence is the highest level of innovation, and RPA can be seen as one of intelligence. Robotic Process Automation(RPA), a software robot with artificial intelligence, is an example of intelligence that is suited for simple, repetitive, large-scale transaction processing tasks. The RPA, which is already in operation in many companies in Korea, shows what needs to be done to naturally focus on the core tasks in a situation where the need for a strong organizational culture is increasing and the emphasis is on voluntary leadership, strong teamwork and execution, and a professional working culture. The introduction was considered naturally according to the need to find. Robotic Process Automation, or RPA, is a technology that replaces human tasks with the goal of quickly and efficiently handling structural tasks. RPA is implemented through software robots that mimic humans using software such as ERP systems or productivity tools. RPA robots are software installed on a computer and are called robots by the principle of operation. RPA is integrated throughout the IT system through the front end, unlike traditional software that communicates with other IT systems through the back end. In practice, this means that software robots use IT systems in the same way as humans, repeat the correct steps, and respond to events on the computer screen instead of communicating with the system's application programming interface(API). Designing software that mimics humans to communicate with other software can be less intuitive, but there are many advantages to this approach. First, you can integrate RPA with virtually any software you use, regardless of your openness to third-party applications. Many enterprise IT systems are proprietary because they do not have many common APIs, and their ability to communicate with other systems is severely limited, but RPA solves this problem. Second, RPA can be implemented in a very short time. Traditional software development methods, such as enterprise software integration, are relatively time consuming, but RPAs can be implemented in a relatively short period of two to four weeks. Third, automated processes through software robots can be easily modified by system users. While traditional approaches require advanced coding techniques to drastically modify how they work, RPA can be instructed by modifying relatively simple logical statements, or by modifying screen captures or graphical process charts of human-run processes. This makes RPA very versatile and flexible. This RPA is a good example of the application of digital to intelligence(D2I).

Fast Matching Pursuit based on Vector Length Comparison (벡터길이 비교를 이용한 고속 Matching Pursuit)

  • O, Seok-Byeong;Jeon, Byeong-U
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.2
    • /
    • pp.129-137
    • /
    • 2001
  • Matching pursuit algorithm was successfully demonstrated useful in low bit-rate video coding, However, one of the practical concerns related to applying the matching pursuit algorithm to application is its massive computation required for finding bases whose weighted sum best approximates the given input image. The main contribution of this paper is that we provide a new method that can drastically reduce the computational load without any degradation of image quality. Its main idea is based on reducing the number of inner product calculation required for finding best bases because the complexity of matching pursuit algorithm is due to the exhaustive local inner product calculation. As the first step, we compute a matrix which is the 1-D inner product of the given motion-compensated error input image with the 1-D vertical Gabor functions using the separable property of Gabor bases. In the second step, we calculate length of each vector in the matrix that corresponds to 1-D horizontal Gabor function, and compare the length with the current maximum absolute inner product value so far. According to the result of this comparison, one can decide whether or not to calculate the inner product. Since most of them do not need to calculate the inner product value, one can significantly reduce the computational load. Experimental results show that proposed method reduces about 70% of inner product calculation compared to the Neff's fast algorithm without any degradation of image quality.

  • PDF

Modulation of Stress Protein Gene Expression by Environmental Stress and pH in the Mouse Fibroblasts and SCK Tumor Cells (생쥐의 纖維芽細胞와 SCK 腫瘍細胞에서 Stress와 pH에 의한 Stress Protein 遺傳子發見의 調節)

  • Kang, Man-Sik;Lee, Chung-Choo;Lee, Bonggeun;Suh, Mi-Young
    • The Korean Journal of Zoology
    • /
    • v.28 no.2
    • /
    • pp.108-119
    • /
    • 1985
  • Aimed at elucidating the modulation of stress protein gene expression, the effect of environmental stress and pH on the induction of stress protein synthesis has been analyzed using SDS-polyacrylamide gel electrophoresis. Although the general patterns of protein synthesis in MEF and SCK cells are different, stress protein patterns are identical in both cells. Among three stress proteins, the $SP_70$ exhibits an interesting kinetics of induction and decay. The kinetics of $SP_70$ under acidic or normal pH appears to be similar, but the degree of hyperthermia and duration of treatment required for maximum induction are found to be different, being lower temperatures and shorter durations under acidic pH compared to those under normal pH. Inducation of stress protein and the accumulation of mRNA coding for stress proteins are blocked with actinomycin D, indicating the new RNA transcription is required for stress blocked with actinomycin D, indicating that new RNA transcription is required for stress protein induction. Treatment of cycloheximide during the after hyperthermia indicates that no specific protein is required for the induction of stress protein synthesis. Based on our preliminary data, we postulate that induction of stress protein synthesis in MEF and SCK cells is regulated primarily at the level of transcription and that $SP_70$ autoregulates its synthesis and levels of this protein are correlated with the stresseed state of a cell.

  • PDF

Cloning and Characterization of Bovine Titin-cap (TCAP) Gene

  • Yu, S.L.;Chung, H.J.;Jung, K.C.;Sang, B.C.;Yoon, D.H.;Lee, S.H.;Kata, S.R.;Womack, J.E.;Lee, J.H.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.17 no.10
    • /
    • pp.1344-1349
    • /
    • 2004
  • Titin-cap (TCAP), one of the abundant transcripts in skeletal muscles, was nvestigated in this study in cattle because of its role in regulating the proliferation and differentiation of myoblasts by interacting with the myostatin gene. From the 5, and 3, RACE experiments, full-length TCAP coding sequence was identified, comprising 166 amino acids. The amino acid comparison showed high sequence similarities with previously identified human (95.8%) and mouse (95.2%) TCAP genes. The TCAP expression, addressed by northern blot, is limited in muscle tissues as indicated by Valle et al. (1997). The radiation hybrid analysis localized the gene on BTA19, where the comparative human and porcine counterparts are on HSA17 and SSC12. A few muscle-related genetic disorders were mapped on HSA17 and some growth-related QTLs were identified on SSC12. The bovine TCAP gene found in this study opens up new possibilities for the investigation of muscle-related genetic diseases as well as meat yield traits in cattle.