• Title/Summary/Keyword: OPTIMAL RANGE

Search Result 2,688, Processing Time 0.026 seconds

Effect of Culture Conditions on Cathepsin B Inhibitor Production by a Marine Bacterium, Pseudomonas sp. Strain PB01

  • Hoang, Le Thu Van;Kim, Moon-Moo;Kim, Se-Kwon
    • Journal of Microbiology and Biotechnology
    • /
    • v.18 no.6
    • /
    • pp.1115-1120
    • /
    • 2008
  • A novel cathepsin B inhibitor-producing bacterium was isolated from marine sediments and identified based on its 16S rDNA sequence as Pseudomonas sp. strain PB01 (Accession No. EU126129). The growth and enzyme inhibitor production were investigated under various culture conditions. A mixture of organic nitrogen source was required for the optimal production, whereas both glucose and maltose proved to be the effective carbon sources for cathepsin B inhibitor production. Other optimal culture conditions included temperature range between 25 and $28^{\circ}C$, initial medium pH of 6.6, and shaking speed of 200 rpm. Under these optimal conditions, the maximum inhibitory activity from culture broth was approximately 50% after 30 h of cultivation. Additionally, kinetic study revealed that inhibitor production paralleled with cell growth, which suggested that the inhibitor may be a primary metabolite of that bacterium.

An Efficient Multicast Routing Algorithm for Packet-Switched Networks

  • Chung, Sung-Jin;Hong, Sung-Pil;Park, Bum-Hwan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.397-400
    • /
    • 1998
  • This paper has a dual purpose. First, we consider a relaxation algorithm which seems to be particularly suitable for multicasting routing problems. We show that the algorithm has polynomial complexity. Second, to measure the quality of solutions in comparison to the optimal solutions over a wide range of network sizes for which the computation of the optimal costs is too excessive, we also propose a random graph generation scheme in which an asymptotic lower bound on the expected optimal cost can be computed as a function of network node size.

  • PDF

Finite-Horizon Online Transmission Scheduling on an Energy Harvesting Communication Link with a Discrete Set of Rates

  • Bacinoglu, Baran Tan;Uysal-Biyikoglu, Elif
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.293-300
    • /
    • 2014
  • As energy harvesting communication systems emerge, there is a need for transmission schemes that dynamically adapt to the energy harvesting process. In this paper, after exhibiting a finite-horizon online throughput-maximizing scheduling problem formulation and the structure of its optimal solution within a dynamic programming formulation, a low complexity online scheduling policy is proposed. The policy exploits the existence of thresholds for choosing rate and power levels as a function of stored energy, harvest state and time until the end of the horizon. The policy, which is based on computing an expected threshold, performs close to optimal on a wide range of example energy harvest patterns. Moreover, it achieves higher throughput values for a given delay, than throughput-optimal online policies developed based on infinite-horizon formulations in recent literature. The solution is extended to include ergodic time-varying (fading) channels, and a corresponding low complexity policy is proposed and evaluated for this case as well.

A Study on Base Isolation Performance of MR Dampers Using Clipped-Optimal Control (Clipped-Optimal Control을 사용한 MR 감쇠기의 면진성능에 관한 연구)

  • 고봉준;이종세
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2003.04a
    • /
    • pp.529-536
    • /
    • 2003
  • As large structures such as high-rise buildings and cable-stayed bridges become lighter and more flexible, the necessity of structural control for reducing excessive displacement and acceleration due to seismic excitation is increased. As a method to minimize seismic damages, various base isolation systems are adopted or considered for adoption. In this study, the seismic performance of MR dampers are studied and compared with that of the NZ system as a base isolation system. As the control algorithm of the MR damper, the clipped-optimal control(applied LQR method) is employed. A five-story building is modeled and the seismic performance of the two systems subjected to three different earthquakes is compared. The results show that the MR damper system can provide superior protection than the NZ system for a wide range of ground motions.

  • PDF

Simultaneous Determination of Polycyclic Aromatic Hydrocarbons by Synchronous Spectrofluorimetry (형광분광법에 의한 방향족 탄화수소의 동시정량)

  • 이상학;손범목
    • Journal of Environmental Science International
    • /
    • v.12 no.1
    • /
    • pp.87-92
    • /
    • 2003
  • Synchronous spectrofluorimetry was carried out for the simultaneous determination of various polycyclic aromatic hydrocarbons(PAHs) in aqueous solution by fluorescence spectrometry have been studied. The optimal wavelength interval(${\triangle}{\lambda}$) for synchronous spectra of acenaphthene, anthracene, benzo[a]anthracene, fluorene and pyrene were investigated in the presence of surfactants. The great enhancement of the fluorescence of these PAHs in Triton X-100 was obtained and optimal wavelength was 50 nm. The calibration curves in synthetic mixture solution of 5 PAHs were linear over the range from $1.0{\times}10^{-8}M$ to $1.0{\tiems}10^{-4}M$. Under the optimal experimental conditions, the detection limits were $4.9{\tiems}10^{-9}M$,\;7.0{\times}10^{-9}M,\;4.7{\tiems}10^{-9}M,\;1.6{\tiems}10^{-9}M$ and $3.2{\tiems}10^{-9}M$ for acenaphthene, anthracene, benzo[a]anthracene, fluorene and pyrene, respectively.

AN APPROACH FOR SOLVING OF A MOVING BOUNDARY PROBLEM

  • Basirzadeh, H.;Kamyad, A.V.
    • Journal of applied mathematics & informatics
    • /
    • v.14 no.1_2
    • /
    • pp.97-113
    • /
    • 2004
  • In this paper we shall study moving boundary problems, and we introduce an approach for solving a wide range of them by using calculus of variations and optimization. First, we transform the problem equivalently into an optimal control problem by defining an objective function and artificial control functions. By using measure theory, the new problem is modified into one consisting of the minimization of a linear functional over a set of Radon measures; then we obtain an optimal measure which is then approximated by a finite combination of atomic measures and the problem converted to an infinite-dimensional linear programming. We approximate the infinite linear programming to a finite-dimensional linear programming. Then by using the solution of the latter problem we obtain an approximate solution for moving boundary function on specific time. Furthermore, we show the path of moving boundary from initial state to final state.

Digital Receding Time Horizon LQ Optimal Contour Control System (디지털 후퇴 유한시간 구간 LQ 최적 윤곽제어시스템)

  • Sim, Young-Bok;Lee, Gun-Bok
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.15 no.6
    • /
    • pp.105-113
    • /
    • 2006
  • This work is concerned with the development of digital contouring controller for multi-axial servosystems. Digital optimal contouring controller is proposed to coordinate each of the controllers of multiple feed drives and specifically improve the contouring performance. The optimal control formation includes the contour error explicitly in the performance index to be minimized. The contouring control is exercised for straight line and circular contours. Substantial improvement in contouring performance is obtained for a range of contouring conditions. Both steady state and transient error measures have been considered. The simulation study presented has established the potential of the proposed controller to improve contouring performance.

Stochastic convexity in markov additive processes (마코프 누적 프로세스에서의 확률적 콘벡스성)

  • 윤복식
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1991.10a
    • /
    • pp.147-159
    • /
    • 1991
  • Stochastic convexity(concvity) of a stochastic process is a very useful concept for various stochastic optimization problems. In this study we first establish stochastic convexity of a certain class of Markov additive processes through the probabilistic construction based on the sample path approach. A Markov additive process is obtained by integrating a functional of the underlying Markov process with respect to time, and its stochastic convexity can be utilized to provide efficient methods for optimal design or for optimal operation schedule of a wide range of stochastic systems. We also clarify the conditions for stochatic monotonicity of the Markov process, which is required for stochatic convexity of the Markov additive process. This result shows that stochastic convexity can be used for the analysis of probabilistic models based on birth and death processes, which have very wide application area. Finally we demonstrate the validity and usefulness of the theoretical results by developing efficient methods for the optimal replacement scheduling based on the stochastic convexity property.

  • PDF

Design of VLSI Array Architecture with Optimal Pipeline Period for Fast Fractal Image Compression (고속 프랙탈 영상압축을 위한 최적의 파이프라인 주기를 갖는 VLSI 어레이 구조 설계)

  • 성길영;우종호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5A
    • /
    • pp.702-708
    • /
    • 2000
  • In this paper, we designed one-dimensional VLSI array with optimal pipeline period for high speed processing fractal image compression. The algorithm is derived which is suitable for VLSI array from axed block partition algorithm. Also the algorithm satisfies high quality of image and high compression-ratio. The designed VLSI array has optimal pipeline relied because the required processing time of PEs is distributed as same as possible. As this result, we can improve the processing speed up to about 3 times. The number of input/output pins can be reduced by sharing the input/output and arithmetic unit of the domain blocks and the range blocks.

  • PDF

Energy Efficiency Resource Allocation for MIMO Cognitive Radio with Multiple Antenna Spectrum Sensing

  • Ning, Bing;Yang, Shouyi;Mu, Xiaomin;Lu, Yanhui;Hao, Wanming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4387-4404
    • /
    • 2015
  • The energy-efficient design of sensing-based spectrum sharing of a multi-input and multi-output (MIMO) cognitive radio (CR) system with imperfect multiple antenna spectrum sensing is investigated in this study. Optimal resource allocation strategies, including sensing time and power allocation schemes, are studied to maximize the energy efficiency (EE) of the secondary base station under the transmit power and interference power constraints. EE problem is formulated as a nonlinear stochastic fractional programming of a nonconvex optimal problem. The EE problem is transformed into its equivalent nonlinear parametric programming and solved by one-dimension search algorithm. To reduce searching complexity, the search range was founded by demonstration. Furthermore, simulation results confirms that an optimal sensing time exists to maximize EE, and shows that EE is affected by the spectrum detection factors and corresponding constraints.