• Title/Summary/Keyword: maximal condition

Search Result 312, Processing Time 0.022 seconds

연속배양에서 고핵산 효모 Saccharomyces cerevisiae MTY62 균주의 배양 ${\cdot}$ 생리학적 특성

  • Kim, Jae-Beom;Nam, Su-Wan
    • 한국생물공학회:학술대회논문집
    • /
    • 2000.11a
    • /
    • pp.346-349
    • /
    • 2000
  • In order to investigate the characteristics for RNA accumulation, continuous cultures of S. cerevisiae MTY62 under the carbon-limitation or carbon-phosphate-limitation were performed. In the carbon-limited chemostat, the highest RNA content of 144 mg-RNA/g-dry cell was observed at the dilution rate of $0.30\;hr^{-1}$. In the carbon and phosphate-limited chemostat, the culture condition with the dilution rate of $0.25\;hr^{-1}$ gave the maximal RNA content of 209 mg-RNA/g-dry cell. The accumulation rate of RNA $(mg-RNA/L\;{\cdot}\;hr)$ was decreased at higher dilution rate in the carbon and phosphate-limited chemostat.

  • PDF

상대 이음 좌표 방법을 이용한 링키지 메카니즘에 대한 동역학적 해석에 관한 연구

  • 이동찬;배대성;한창수
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1992.10a
    • /
    • pp.339-343
    • /
    • 1992
  • For the analysis of dynamic behavior of dynamic behavior of multibody systems by cartesian coordinate method, maximal sets of generalized coordinates and maximum numbers of differential equation and constraints must be considered. Therefore the inefficiency of the increase of CPU time is occurred. This paper is to analyze the dynamic system by using the relative coordinate method without violating the geometric condition of systems. The graph theory and system topology were used for this study. The dynamic systems could be analyzed by the automatic generation of the informations like equation of motion, constraints, and external forces etc. And the results were compared and verified with dynamic commercial package DADS.

Fundamental Condition for the Realization of Maximal Contrast and Brightness in Liquid Crystal Display Devices: I. Monochromatic Case (액정표지소자에서 화면의 명암대비와 밝기를 극대화하는 기본조건: I. 단색광의 경우)

  • 노봉규;김규석;김진승
    • Korean Journal of Optics and Photonics
    • /
    • v.5 no.3
    • /
    • pp.404-410
    • /
    • 1994
  • The contrast and the brightness of a liquid crystal display panel are expressed in terms of the characteristic parameters of the rotational transformation on the Poincare sphere of the liquid crystal (LC) cell, which is the geometric representation of the electro-optic polarization transmission characteristics of the cell. From these, we show that the contrast and the brightness of the displayed images can be maximized when the rotation angle becomes $180^{\circ}$ for the rotational transformation corresponding to the change of the state of the LC cell from non-select to select state. state.

  • PDF

Performance Enhancement by Interference Cancellation Scheme in Transmit Diversity using STBC over Time Selective Fading Channel (Time Selective Fading 채널 환경에서 STBC를 이용하는 송신 다이버시티에서 간섭제거기법에 의한 성능 개선)

  • Kim, Jang-Wook;Jin, Yang-Hee;Oh, Chang-Heon;Cho, Sung-Joon
    • Proceedings of the Korea Electromagnetic Engineering Society Conference
    • /
    • 2003.11a
    • /
    • pp.239-242
    • /
    • 2003
  • Transmit diversity using STBC(Space Time Block Code) provides the same diversity gain as MRRC(Maximal Ratio Receiver Combining), when the fading channel is constant across two consecutive symbols. But, when the channel condition is changed for the two consecutive symbols, the transmit diversity using STBC does not offer good performance due to the large doppler shift. In this paper, we have proposed a interference cancellation scheme for performance enhancement in transmit diversity using STBC over time selective fading channel. Simulation results for various doppler shift rates are presented for the transmit diversity using the proposed scheme.

  • PDF

THE UNIFORM CLT FOR MARTINGALE DIFFERENCE ARRAYS UNDER THE UNIFORMLY INTEGRABLE ENTROPY

  • Bae, Jong-Sig;Jun, Doo-Bae;Levental, Shlomo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.47 no.1
    • /
    • pp.39-51
    • /
    • 2010
  • In this paper we consider the uniform central limit theorem for a martingale-difference array of a function-indexed stochastic process under the uniformly integrable entropy condition. We prove a maximal inequality for martingale-difference arrays of process indexed by a class of measurable functions by a method as Ziegler [19] did for triangular arrays of row wise independent process. The main tools are the Freedman inequality for the martingale-difference and a sub-Gaussian inequality based on the restricted chaining. The results of present paper generalizes those of Ziegler [19] and other results of independent problems. The results also generalizes those of Bae and Choi [3] to martingale-difference array of a function-indexed stochastic process. Finally, an application to classes of functions changing with n is given.

HERMITIAN POSITIVE DEFINITE SOLUTIONS OF THE MATRIX EQUATION Xs + A*X-tA = Q

  • Masoudi, Mohsen;Moghadam, Mahmoud Mohseni;Salemi, Abbas
    • Journal of the Korean Mathematical Society
    • /
    • v.54 no.6
    • /
    • pp.1667-1682
    • /
    • 2017
  • In this paper, the Hermitian positive definite solutions of the matrix equation $X^s+A^*X-^tA=Q$, where Q is an $n{\times}n$ Hermitian positive definite matrix, A is an $n{\times}n$ nonsingular complex matrix and $s,t{\in}[1,{\infty})$ are discussed. We find a matrix interval which contains all the Hermitian positive definite solutions of this equation. Also, a necessary and sufficient condition for the existence of these solutions is presented. Iterative methods for obtaining the maximal and minimal Hermitian positive definite solutions are proposed. The theoretical results are illustrated by numerical examples.

FREE CYCLIC CODES OVER FINITE LOCAL RINGS

  • Woo, Sung-Sik
    • Bulletin of the Korean Mathematical Society
    • /
    • v.43 no.4
    • /
    • pp.723-735
    • /
    • 2006
  • In [2] it was shown that a 1-generator quasi-cyclic code C of length n = ml of index l over $\mathbb{Z}_4$ is free if C is generated by a polynomial which divides $X^m-1$. In this paper, we prove that a necessary and sufficient condition for a cyclic code over $\mathbb{Z}_pk$ of length m to be free is that it is generated by a polynomial which divides $X^m-1$. We also show that this can be extended to finite local rings with a principal maximal ideal.

Performance Analysis of 32-QAPM System with MRC Diversity in Rician Fading Channel

  • Chun, Jae Young;Kim, Eon Gon
    • Journal of information and communication convergence engineering
    • /
    • v.14 no.4
    • /
    • pp.227-232
    • /
    • 2016
  • In this study, the performance of a 32-quadrature amplitude position modulation (QAPM) system is analyzed under a Rician fading channel condition when the maximal ratio combining (MRC) diversity technique is used in the receiver. The fading channel is modeled as a frequency non-selective slow Rician fading channel corrupted by additive white Gaussian noise (AWGN). QAPM is available to improve BER performance without amplifying transmit power, and MRC diversity makes the performance improvement of QAPM system even bigger by intentionally maximizing SNR. Error performances are shown for the 32-QAPM system and a 32-phase silence shift keying (PSSK) system in order to examine the effects of fading severity, for various values of the Rician parameter, K. The dependence of error rates on MRC diversity is also analyzed. The simulation results show that the BER performance of the 32-QAPM system is better than that of the 32-PSSK system under the above mentioned conditions.

Distributed Power Control and Removal Algorithms for Multimedia CDMA Wireless Networks

  • Wang, Jui-Teng
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.197-201
    • /
    • 2003
  • We study in this paper both distributed power control and removal algorithms for multimedia CDMA wireless networks. In our study, users can have different data rates as well as different quality of service (QoS) requirements. We derive a necessary and sufficient condition for the fully distributed power control (FDPC) algorithm to find a feasible power set. We also prove that, if the maximal power level is used at the start, then the distributed constrained power control (DCPC) algorithm is equivalent to the FDPC algorithm. For the connection removal algorithm, we prove that the non-reinitialized removal algorithm finds a feasible power set faster and employs smaller power levels than the reinitialized one does. Performances of some connection removal criteria are also studied. Our simulation results reveal that the smallest normalized CIR (SNC) and largest CIR requirement (LCR) criteria result in smaller outage probability than the smallest CIR (SC) criterion in a multimedia environment.

ON THE ADMITTANCE OF A FIXED POINT FREE DEFORMATION OF THE SPACE WHICH π1(X) IS INFINITE

  • HAN, SANG-EON;LEE, SIK
    • Honam Mathematical Journal
    • /
    • v.20 no.1
    • /
    • pp.147-152
    • /
    • 1998
  • In this paper, we shall investigate the admittance of a fixed point free deformation(FPFD) on the locally nilpotent spaces when ${\pi}_1(X)$ is infinite. More precisely, for $X{\in}(S_{{\ast}{LN}})$ with ${\pi}_1(X)$ infinite, we prove the admittance of a FPFD where ${\pi}_1(X)$ has the maximal condition on normal subgroups, or ${\pi}_1(X)$ satisfies either the max-${\infty}$ or min-${\infty}$ for non-nilpotent subgroups where $S_{{\ast}{LN}}$ denotes the category of the locally nilpotent spaces and base point preserving continuous maps.

  • PDF