• Journal of Microbiology and Biotechnology
• /
• 제19권9호
• /
• pp.869-872
• /
• 2009

The cyclic undecapeptide cyclosporin A (CyA), one of the most valuable immunosuppressive drugs, is produced nonribosomally by a multifunctional cyclosporin synthetase enzyme complex by the filamentous fungus Tolypocladium niveum. To increase CyA productivity by wild-type T. niveum (ATCC 34921), random mutagenesis was first performed using an antifungal agar-plug colony assay (APCA) selection approach. This generated a mutant strain producing more than 9-fold greater CyA than the wild-type strain. Additionally, a foreign bacterial gene, Vitreoscilla hemoglobin gene (VHb), was transformed via protoplast regeneration and its transcription was confirmed by RT-PCR in the UV-irradiated mutant cell. This led to an additional 33.5% increase of CyA production. Although most protoplast-regenerated T. niveum transformants tend to lose CyA productivity, the optimized combination of random mutagenesis and protoplast transformation described here should be an efficient strategy to generate a commercially valuable, yet metabolite low-producing, fungal species, such as CyA-producing T. niveum.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.93-105
• /
• 2006

The domination of the Internet by TCP-based services has spawned many efforts to provide high network utilization with low loss and delay in a simple and scalable manner. Active queue management (AQM) algorithms attempt to achieve these goals by regulating queues at bottleneck links to provide useful feedback to TCP sources. While many AQM algorithms have been proposed, most suffer from instability, require careful configuration of nonintuitive control parameters, or are not practical because of slow response to dynamic traffic changes. In this paper, we propose a new AQM algorithm, hybrid random early detection (HRED), that combines the more effective elements of recent algorithms with a random early detection (RED) core. HRED maps instantaneous queue length to a drop probability, automatically adjusting the slope and intercept of the mapping function to account for changes in traffic load and to keep queue length within the desired operating range. We demonstrate that straightforward selection of HRED parameters results in stable operation under steady load and rapid adaptation to changes in load. Simulation and implementation tests confirm this stability, and indicate that overall performances of HRED are substantially better than those of earlier AQM algorithms. Finally, HRED control parameters provide several intuitive approaches to trading between required memory, queue stability, and response time.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.22-28
• /
• 2009

We consider facility layout problems, where mn facility units are assigned into mn cells. These cells are arranged into a rectangular pattern with m rows and n columns. In order to solve this cell type facility layout problem, many approximation algorithms with improved local search methods were studied because it was quite difficult to find exact optimum of such problem in case of large size problem. In this paper, new algorithms based on Simulated Annealing (SA) method with two neighborhood generation methods are proposed. The new neighborhood generation method adopts the exchanging operation of facility units in accordance with adjacent preference. For evaluating the performance of the neighborhood generation method, three algorithms, previous SA algorithm with random 2-opt neighborhood generation method, the SA-based algorithm with the new neighborhood generation method (SA1) and the SA-based algorithm with probabilistic selection of random 2-opt and the new neighborhood generation method (SA2), are developed and compared by experiment of solving same example problem. In case of numeric examples with problem type 1 (the optimum layout is given), SA1 algorithm could find excellent layout than other algorithms. However, in case of problem type 2 (random-prepared and optimum-unknown problem), SA2 was excellent more than other algorithms.

• Journal of Magnetics
• /
• 제7권3호
• /
• pp.101-105
• /
• 2002

MRAM (Magnetoresistive Random Access Memory) is a promising candidate for a universal memory that meets all application needs with non-volatile, fast operational speed, and low power consumption. The simplest architecture of MRAM cell is a series of MTJ (Magnetic Tunnel Junction) as a data storage part and MOS transistor as a data selection part. This paper is for testing the actual electrical parameters to adopt MRAM technology in the semiconductor based memory device. The discussed topics are an actual integration of MRAM core cell and its properties such as electrical tuning of MOS/MTJ for data sensing and control of magnetic switching for data writing. It will be also tested that limits of the MRAM technology for a high density memory.

• 한국인터넷방송통신학회논문지
• /
• 제8권3호
• /
• pp.57-70
• /
• 2008

This paper introduces a new paradigm of physical layer security through channel coding for wireless networks. The well known spread spectrum based physical layer security in wireless network is applicable when code division multiple access (CDMA) is used as wireless air link interface. In our proposal, we incorporate the proposed security protocol within channel coding as channel coding is an essential part of all kind of wireless communications. Channel coding has a built-in security in the sense of encoding and decoding algorithm. Decoding of a particular codeword is possible only when the encoding procedure is exactly known. This point is the key of our proposed security protocol. The common parameter that required for both encoder and decoder is generally a generator matrix. We proposed a random selection of generators according to a security key to ensure the secrecy of the networks against unauthorized access. Therefore, the conventional channel coding technique is used as a security controller of the network along with its error correcting purpose.

• Asian-Australasian Journal of Animal Sciences
• /
• 제14권7호
• /
• pp.905-909
• /
• 2001

Three groups of wethers viz. Jamunapari ♂$\times$Black Bengal ♀ (JBB), Selected Black Bengal ♂$\times$Selected Black Bengal ♀ (SBB) and Random Black Bengal ♂$\times$Random Black Bengal ♀ (RBB) of 1 year old were evaluated for pre-slaughter traits and carcass characteristics. The correlations between pre-slaughter traits and carcass traits were computed. It was found that the preslaughter weights of JBB and SBB were almost similar in yielding hot and chilled carcass as well as dressing percentage (DP). RBB wethers were lighter (p<0.05) than JBB and SBB in pre- and post-slaughter weights and also inferior (p<0.05) in DP. SBB wethers were found to produce more visceral fat compared to JBB and RBB. Other variety meats appeared erratic in yield.l. Correlations were compared by Z statistic among three genetic groups and the value of Z did not differ (p>0.05) between groups.

• Genomics & Informatics
• /
• 제15권4호
• /
• pp.162-169
• /
• 2017

Metal binding proteins or metallo-proteins are important for the stability of the protein and also serve as co-factors in various functions like controlling metabolism, regulating signal transport, and metal homeostasis. In structural genomics, prediction of metal binding proteins help in the selection of suitable growth medium for overexpression's studies and also help in obtaining the functional protein. Computational prediction using machine learning approach has been widely used in various fields of bioinformatics based on the fact all the information contains in amino acid sequence. In this study, random forest machine learning prediction systems were deployed with simplified amino acid for prediction of individual major metal ion binding sites like copper, calcium, cobalt, iron, magnesium, manganese, nickel, and zinc.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.520-522
• /
• 2004

In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. Sonar ranger is useful to get obstacle information and RAS may be a good solution for path planning.

• Journal of Life Science
• /
• 제12권1호
• /
• pp.14-18
• /
• 2002

Subpopulations of nucleotides that bind specifically to a variety of proteins have been isolated from a population of random sequence RNA/DNA molecules. Roughly one in $10^{13}$ random sequence RNA/DNA molecules folds in such a way as to create a specific binding site for small ligands. Since the development of in vitro selection procedure, more than 50 nucleic acid ligands (aptamers) have been isolated. These molecules are very useful for the study of molecular recognition between nucleic acid and protein/organic compound. In addition to these basic studies this method gives us a dream to produce new drugs against several diseases. We focused on several aptamers which specifically binds to trypsin-like serine proteases (thrombin, human neutrophil elastase, activated protein C and NS3 protease of human hepatitis C virus) and want to introduce their structural characteristics and some functions.

• 한국멀티미디어학회논문지
• /
• 제18권11호
• /
• pp.1261-1267
• /
• 2015

The problem of underwater target detection and classification has been attracted a substantial amount of attention and studied from many researchers for both military and non-military purposes. The difficulty is complicate due to various environmental conditions. In this paper, we study classifier ensemble methods for active sonar target classification to improve the classification performance. In general, classifier ensemble method is useful for classifiers whose variances relatively large such as decision trees and neural networks. Bagging, Random selection samples, Random subspace and Rotation forest are selected as classifier ensemble methods. Using the four ensemble methods based on 31 neural network classifiers, the classification tests were carried out and performances were compared.