• Journal of radiological science and technology
• /
• v.10 no.1
• /
• pp.85-90
• /
• 1987

Preliminary studies on the measurement of the free thyroxine in the serum with Amerlex $FT_{4}$ RIA kit were investigated using a tracer as $^{125}I-T_{4}$ derivative which is not almostly bound to thyroxine binding globulin, etc. The results are followed: 1. Linearity was tested on standards at various concentrations, and reproducibility and accuracy was excellent. 2. The antibody specificity is also excellent, and standard calibration curve of total $T_{4}$ was similar that of adding the TBG inhibitor. 3. Each value of $T_{4}$ in serum (the normal group, the hypothyroidism patients the pregnant women and the TBG dificiency patients) was not significant. As mentioned above, this method is more simple and rapid, compared to the other method.

• Kyungpook Mathematical Journal
• /
• v.47 no.2
• /
• pp.283-294
• /
• 2007

By a near ${\lambda}$-lattice is meant an upper ${\lambda}$-semilattice where is defined a parti binary operation $x{\Lambda}y$ with respect to the induced order whenever $x$, $y$ has a common lower bound. Alternatively, a near ${\lambda}$-lattice can be described as an algebra with one ternary operation satisfying nine simple conditions. Hence, the class of near ${\lambda}$-lattices is a quasivariety. A ${\lambda}$-semilattice $\mathcal{A}=(A;{\vee})$ is said to have sectional (antitone) involutions if for each $a{\in}A$ there exists an (antitone) involution on [$a$, 1], where 1 is the greatest element of $\mathcal{A}$. If this antitone involution is a complementation, $\mathcal{A}$ is called an ortho ${\lambda}$-semilattice. We characterize these near ${\lambda}$-lattices by certain identities.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.81-84
• /
• 1996

We propose the robust nonlinear controller design methodology, the $H_{\infty}$ constrained quasi - linear quadratic Gaussian control (QLQG/ $H_{\infty}$), for the statistically-linearized multivariable system with hard nonlinearties such as Coulomb friction, deadzone, etc. The $H_{\infty}$ performance constraint is involved in the optimization process by replacing the covariance Lyapunov equation with the Riccati equation whose solution leads to an upper bound of the QLQG performance. Because of the system's nonlinearity, however, one equation among three Riccati equations contain the nonlinear correction terms that are very difficult to solve numerically. To treat this problem, we use simple algebraic techniques. With some analytic transformation for Riccati equations, the nonlinear correction terms can be so eliminated that the set of a linear controller to the different operating points are designed. Synthesizing these via inverse random input describing function (IRIDF) technique, the final nonlinear controller can be designed.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2319-2324
• /
• 2005

This paper proposes a intelligent gain and boundary layer based sliding mode control (SMC) method for robotic systems with unknown model uncertainties. For intelligent gain and boundary layer, we employ the self recurrent wavelet neural network (SRWNN) which has the properties such as a simple structure and fast convergence. In our control structure, the SRWNNs are used for estimating the width of boundary layer, uncertainty bound, and nonlinear terms of robotic systems. The adaptation laws for all parameters of SRWNNs and reconstruction error bounds are derived from the Lyapunov stability theorem, which are used for an on-line control of robotic systems with unknown uncertainties. Accordingly, the proposed method can overcome the chattering phenomena in the control effort and has the robustness regardless of unknown uncertainties. Finally, simulation results for the three-link manipulator, one of the robotic systems, are included to illustrate the effectiveness of the proposed method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.1-8
• /
• 1997

A wide class of networking application services, such as video teleconferencing, VOD, LAN bridging, and distributed data processing require multipoint communications. The essential component inteh network to achieve this is a multicast packet switch which is capable of packet replication and switching. In this paper, we propose an efficient mukticast addressing scheme using the smallest number of routing bits which is deterministic lower bound. The new scheme performs all point-to-multipoint connection in radix-2 tree ATM switch like banyan network. Also, we provide a simple radix-2 switch block diagram for achieving our algorithm. And we investigate several addressing schemes for implementing multicasting in radix-r tree ATM switch and evaluate several performance factors, such as complexity of the additional header bits, requirement of the internal speedup and complexity of the major hardware.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.349-352
• /
• 2004

In this literature, the selection of data set among the universe set is carried out with the fuzzy entropy function. By the definition of fuzzy entropy, we have proposed the fuzzy entropy function and the proposed fuzzy entropy function is proved through the definition. The proposed fuzzy entropy function calculate the certainty or uncertainty value of data set, hence we can choose the data set that satisfying certain bound or reference. Therefore the reliable data set can be obtained by the proposed fuzzy entropy function. With the simple example we verify that the proposed fuzzy entropy function select reliable data set.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.5
• /
• pp.655-659
• /
• 2004

In this literature, the selection of data set among the universe set is carried out with the fuzzy entropy function. By the definition of fuzzy entropy, the fuzzy entropy function is proposed and the proposed fuzzy entropy function is proved through the definition. The proposed fuzzy entropy function calculate the certainty or uncertainty value of data set, hence we can choose the data set that satisfying certain bound or reference. Therefore the reliable data set can be obtained by the proposed fuzzy entropy function. With the simple example we verify that the proposed fuzzy entropy function select reliable data set.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.385-393
• /
• 2005

In this paper, we propose a simple algorithm to adaptively adjust the value of dupthresh, the duplicate acknowledgement threshold that triggers the transmission control protocol (TCP) fast retransmission algorithm, to improve the TCP performance in a network environment with persistent packet reordering. Our algorithm uses an exponentially weighted moving average (EWMA) and the mean deviation of the lengths of the reordering events reported by a TCP receiver with the duplicate selective acknowledgement (DSACK) extension to estimate the value of dupthresh. We also apply an adaptive upper bound on dupthresh to avoid the retransmission timeout events. In addition, our algorithm includes a mechanism to exponentially reduce dupthresh when the retransmission timer expires. With these mechanisms, our algorithm is capable of converging to and staying at a near-optimal interval of dupthresh. The simulation results show that our algorithm improves the protocol performance significantly with minimal overheads, achieving a greater throughput and fewer false fast retransmissions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1124-1132
• /
• 2006

This paper considers a flow shop scheduling problem where a different WIP (work-in-process) state has different weight on the duration time. The objective is to minimize the sum of the weighted WIP. For the two machine flow shop case, the recognition version is unary NP-Complete. The three simple and intuitive heuristics H0, H1, and H2 are presented for the problem. For each heuristic, we find an upper bound on relative error which is tight in limit. For heuristic H2, we show that H2 dominates the other two heuristics.

• BMB Reports
• /
• v.30 no.4
• /
• pp.258-261
• /
• 1997

A simple quantitative assay method for ribonuclease activity has been developed. This method is based on the decrease of fluorescence intensity emitted by the ethidium bromide bound to RNA due to the degradation of RNA by ribonuclease. The substrate RNA was reacted with ribonuclease A and the fluorescence intensity was measured after the addition of ethidium bromide. The intensity difference was calculated using a blank reaction mixture containing no RNase. Whole cellular RNA substrate produced a significant error and was not suitable for this assay method possibly because of local microheterogeniety caused by high molecular weight rRNA. but satisfying results were obtained with tRNA substrate. The intensity difference increased linearly by raising enzyme concentration up to $2{\times}10^{-4}$ Kunitz Units of ribonuclease A. More refined and reliable results were obtained by use of initial reaction velocities which were calculated from the plots of intensity difference vs time. A linear relationship between initial velocities and enzyme concentrations was observed up to 0.01 Kunitz Units of enzyme.