• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.696-698
• /
• 2004

In this paper we design $H_{\infty}$ infinity controller for Induction motor with low speed operation. $H_{\infty}$ controller is applied in order to design a state feedback static controller for field oriented control of an induction motor. $H_{\infty}$ controller are linear plant can be set up using the same assumptions that are at the basis of field oriented control. Thus, $H_{\infty}$ control theory can be successfully used to set up a state feedback controller for field oriented control of an induction motor. The performances of the $H_{\infty}$ controller is numerically analysed and experimentally verified to prove the validity of the design procedure. In this paper show that performances with high robustness to variations of system parameter.

• Korean Journal of English Language and Linguistics
• /
• v.2 no.3
• /
• pp.403-430
• /
• 2002

With a view to providing a unitary interpretation of a lexical item, even, this paper proposes that even be understood as a quantifier. To countenance this idea, the quantifier theories will be evaluated against the implicature accounts on the basis of conceptual and empirical evidence. With the help of Bach (1999), the quantifier theories of even are regarded as most viable and plausible. On the other hand, from among different quantifier approaches even will be viewed as a quasi-universal quantifier, which means that even is similar to the universal quantifier but still it is different from it. That is, even introduces a comparison set that is context-dependent and only the salient members of this comparison set will be taken into account when an even-sentence is to be uttered. This observation is based on the formal representation for a universal quantifier in general on the one hand and the truth-conditional contribution of even to the sentence containing it.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.1-14
• /
• 2000

The methods of sensitivity analysis for linear programming can be classified in two types: sensitivity analysis using an optimal solution, and sensitivity analysis using an approximate optimal solution. As the methods of sensitivity analysis using an optimal solution, there are three sensitivity analysis methods: sensitivity analysis using an optimal basis, positive sensitivity analysis, and optimal partition sensitivity analysis. Since they may provide different characteristic regions under degeneracy, it is not easy to understand and apply the results of the three methods. In this paper, we propose a generalized sensitivity analysis that can integrate the three existing methods of sensitivity analysis. When a right-hand side or a cost coefficient is perturbed, the generalized sensitivity analysis gives different characteristic regions according to the controlling index set that denotes the set of variables allowed to have positive values in optimal solutions to the perturbed problem. We show that the three existing sensitivity analysis methods are special cases of the generalized sensitivity analysis, and present some properties of the generalized sensitivity analysis.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.23-25
• /
• 1998

Many of the currently used PN code acquisition algorithms detect the phase of the incoming PN signal on the basis of ML estimation principle and utilize statistics grounded in taking inner products. By showing that any set of 2n-1 PN sequences arising in SSRG or MSRG (those typically used in IS'95 implementations) configuration constitutes a linearly independent set and that the number of candidate PN sequences has to equal the dimension of the span of the candidate PN sequences, we prove that the lowerbounding computational complexity involved in any PN code acquistion, utilizing (only) inner product computations at each stage of acquisition, corresponds precisely to those, such as double dwell acquistion circuitries, currently used.

• Journal of the Korean Data and Information Science Society
• /
• v.6 no.2
• /
• pp.17-27
• /
• 1995

We propose a framework for representing and processing uncertain knowledge on the basis of constraint satisfaction. A system of equations and/or inequalities can be considered as a set of constraints that should be solved, and each constraint in the set is transformed into a corresponding logical formula which can be solved through a constraint solving program. Most of rule-based systems, for instance, use a simple probabilistic theory in order to maintain uncertain knowledge, therefore uncertain knowledge can be represented and processed in the constraint satisfaction program quite efficiently.

• ETRI Journal
• /
• v.14 no.4
• /
• pp.19-27
• /
• 1992

Since. as is well known, direct computation of the reliability for a large-scaled and complex net work generally requires exponential time, a variety of alternative methods to estimate the network reliability using simulation have been proposed. Monte Carlo sampling is the major approach to estimate the network reliability using simulation. In the paper, a dynamic Monte Carlo sampling method, called conditional minimal cut set (CMCS) algorithm, is suggested. The CMCS algorithm simulates a minimal cut set composed of arcs originated from the (conditional) source node until s-t connectedness is confirmed, then reduces the network on the basis of the states of simulated arcs. We develop the importance sampling estimator and the total hazard estimator and compare the performance of these simulation estimators. It is found that the CMCS algorithm is useful in reducing variance of network reliability estimator.

• Animal cells and systems
• /
• v.2 no.4
• /
• pp.435-438
• /
• 1998

In the present study, we have examined the crossability of four species in the A. jaluense complex to provide additional information on their delimitation and levels of differentiation. Crosses between diploid A. chiisanense and the tetraploid species including A. jaluense s. str., A. triphyllum, and A. pseudoproliferum yielded no fruit- or seed-set, indicating that the former species is reproductively completely isolated from the latter three species. In interspecific crosses between the tetraploid species, combinations involving A. jaluense s. str. resulted in much reduced fruit- and seed-set, indicating that A. jaluense s. str. is more or less reproductively isolated from the other tetraploid species. However, crossing data revealed the absence of reproductive isolation between A. triphyllum and A. pseudoproliferum These results strongly support the relationships that have been previously suggested for the A. jaluense complex on the basis of morphology, chromosome number, and flavonoid chemistry.

• Journal of The Korean Astronomical Society
• /
• v.15 no.2
• /
• pp.59-70
• /
• 1982

We have observed 85 UBV standard stars(V<6) with SNU photoelectric photometer system and 24" Cassegrain reflector at Sobaeksan Observing Station during the period between January and May, 1980 in order to examine the photometer system and to determine atmospheric extinction coefficients. From five night observations, the following results were obtained: (1) The set of filters(V=2mm GG 495, B=2mm GG 385+1mm BG 12, U=2mm UG 2) is better than the other filter set used in our tests on the basis of linear instrumental calibrations for V and B filters. (2) The SNU detecting system is very stable within ${\sigma}=0.002$ in magnitude in a night but the variation in its stability from night to night is not negligible. (3) The extinction coefficients were derived from two different methods and we have found no systematic seasonal variation in the extinction coefficients although the mean dispersion is considerable.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.12
• /
• pp.65-73
• /
• 1995

In this paper, new algorithm which calculates transmission coefficient of electromagnetic wave by numerical analysis of scattered field by conductors with arbitrary cross-sections in parallel-plate waveguide is proposed. Proposed algorithm assumes magnetic current distribution on the boundary of scattering conductors, and applies Image theorem to perfect conductor surfaces of parallel-plate waveguide. Integral equations for fictitious magnetic currents on conducting boundary are set up. Magnetic current distributions on conducting boundary are expanded as exponential basis function, and using Galerkin method matrix equations are set wp. To compute matrix elements this method utilizes Fourier transform which is faster than numerical integration. Finally, frequency and incidence-angle characteristic of transmission coefficient are calculated and compared with experimental results.

• Bulletin of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.595-601
• /
• 1997

Let $C_d$ be the rational curve of degree d in $P_k ^3$ given parametrically by $x_0 = u^d, X_1 = u^{d - 1}t, X_2 = ut^{d - 1}, X_3 = t^d (d \geq 4)$. Then the defining ideal of $C_d$ can be minimally generated by d polynomials $F_1, F_2, \ldots, F_d$ such that $degF_1 = 2, degF_2 = \cdots = degF_d = d - 1$ and $C_d$ is a set-theoretically complete intersection on $F_2 = X_1^{d-1} - X_2X_0^{d-2}$ for every field k of characteristic p > 0. For the proofs we will use the notion of Grobner basis.