• Journal of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.835-845
• /
• 2017

The $GCF_{\epsilon}$ expansion is a new class of continued fractions induced by the transformation $T_{\epsilon}:(0, 1]{\rightarrow}(0, 1]$: $T_{\epsilon}(x)={\frac{-1+(k+1)x}{1+k-k{\epsilon}x}}$ for $x{\in}(1/(k+1),1/k]$. Under the algorithm $T_{\epsilon}$, every $x{\in}(0,1]$ corresponds to an increasing digits sequences $\{k_n,n{\geq}1\}$. Their basic properties, including the ergodic properties, law of large number and central limit theorem have been discussed in [4], [5] and [7]. In this paper, we study the large deviation for the $GCF_{\epsilon}$ expansion and show that: $\{{\frac{1}{n}}{\log}k_n,n{\geq}1\}$ satisfies the different large deviation principles when the parameter ${\epsilon}$ changes in [-1, 1], which generalizes a result of L. J. Zhu [9] who considered a case when ${\epsilon}(k){\equiv}0$ (i.e., Engel series).

• Journal of KIISE:Software and Applications
• /
• v.35 no.8
• /
• pp.501-511
• /
• 2008

Probe design is one of the essential tasks in successful DNA microarray experiments. The requirements for probes vary as the purpose or type of microarray experiments. In general, most previous works use the simple filtering approach with the fixed threshold value for each requirement. Here, we formulate the probe design as a multiobjective optimization problem with the two objectives and solve it using ${\epsilon}$-multiobjective evolutionary algorithm. The suggested approach was applied in designing probes for 19 types of Human Papillomavirus and 52 genes in Arabidopsis Calmodulin multigene family and successfully produced more target specific probes compared to well known probe design tools such as OligoArray and OligoWiz.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.63-70
• /
• 2017

This paper considers the problem of combining multiple strategies for solving sleeping bandit problems with stochastic rewards and stochastic availability. It also proposes an algorithm, called sleepComb(${\Phi}$), the idea of which is to select an appropriate strategy for each time step based on ${\epsilon}_t$-probabilistic switching. ${\epsilon}_t$-probabilistic switching is used in a well-known parameter-based heuristic ${\epsilon}_t$-greedy strategy. The algorithm also converges to the "best" strategy properly defined on the sleeping bandit problem. In the experimental results, it is shown that sleepComb(${\Phi}$) has convergence, and it converges to the "best" strategy rapidly compared to other combining algorithms. Also, we can see that it chooses the "best" strategy more frequently.

• Structural Engineering and Mechanics
• /
• v.37 no.5
• /
• pp.475-487
• /
• 2011

In a flexible multi-body dynamic system the typical topological optimization method for structures cannot be directly applied, as the stiffness varies with position. In this paper, the topological optimization of the flexible multi-body dynamic system is converted into structural optimization using the equivalent static load method. First, the actual boundary conditions of the control system and the approximate stiffness curve of the mechanism are obtained from a flexible multi-body dynamical simulation. Second, the finite element models are built using the absolute nodal coordination for different positions according to the stiffness curve. For efficiency, the static reanalysis method is utilized to solve these finite element equilibrium equations. Specifically, the finite element equilibrium equations of key points in the stiffness curve are fully solved as the initial solution, and the following equilibrium equations are solved using a reanalysis method with an error controlled epsilon algorithm. In order to identify the efficiency of the elements, a non-dimensional measurement is introduced. Finally, an improved evolutional structural optimization (ESO) method is used to solve the optimization problem. The presented method is applied to the optimal design of a die bonder. The numerical results show that the presented method is practical and efficient when optimizing the design of the mechanism.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.23 no.5
• /
• pp.610-620
• /
• 1999

Recently, numerous modifications of low Reynolds number $k-{\epsilon}$ model have boon carried out with the aid of DNS data. However, the previous models made in this way are too intricate to be used practically. To overcome this shortcoming, a new low Reynolds number $k-{\epsilon}$ model has boon developed by considering the distribution of turbulent properties near the wall. This study proposes the revised a turbulence model for prediction of turbulent flow with adverse pressure gradient and separation. Nondimensional distance $y^+$ in damping functions is changed to $y^*$ and some terms modeled for one dimensional flow in $\epsilon$ equations are expanded into two or three dimensional form. Predicted results by the revised model show an acceptable agreement with DNS data and experimental results. However, for a turbulent flow with severe adverse pressure gradient, an additive term reflecting an adverse pressure gradient effect will have to be considered.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.457-473
• /
• 2005

In each step of the quasi-minimal residual (QMR) method which uses a look-ahead variant of the nonsymmetric Lanczos process to generate basis vectors for the Krylov subspaces induced by A, it is necessary to decide whether to construct the Lanczos vectors $v_{n+l}\;and\;w{n+l}$ as regular or inner vectors. For a regular step it is necessary that $D_k\;=\;W^{T}_{k}V_{k}$ is nonsingular. Therefore, in the floating-point arithmetic, the smallest singular value of matrix $D_k$, ${\sigma}_min(D_k)$, is computed and an inner step is performed if $\sigma_{min}(D_k)<{\epsilon}$, where $\epsilon$ is a suitably chosen tolerance. In practice it is absolutely impossible to choose correctly the value of the tolerance $\epsilon$. The subject of this paper is to show how discrete stochastic arithmetic remedies the problem of this tolerance, as well as the problem of the other tolerances which are needed in the other checks of the QMR method with the estimation of the accuracy of some intermediate results. Numerical examples are used to show the good numerical properties.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.2083-2088
• /
• 2003

This study was performed to analyze the velocity and temperature distributions of the land aquaculture tank for fish breeding. In this study, we analyzed the velocity and temperature distributions in aquarium tank, and the finite volume method and standard ${\kappa}-{\epsilon}$ turbulence model with the SIMPLE computational algorithm are used to study the water flow in the aquarium. The main calculation parameters of the aquarium tank are the inlet flow rate with from 0.5 to 2.0L/M.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.10-13
• /
• 1995

This paper considers the linear-quadratic optimal regulator problem for nonstandard singularly perturbed systems making use of the recursive technique. We first derive a generalized Riccati differential equation by the Hamilton-Jacobi equation. In order to obtain the feedback gain, we must solve the generalized algebraic Riccati equation. Using the recursive technique, we show that the solution of the generalized algebraic Riccati equation converges with the rate of convergence of O(.epsilon.). The existence of a bounded solution of error term can be proved by the implicit function theorem. It is enough to show that the corresponding Jacobian matrix is nonsingular at .epsilon. = 0. As a result, the solution of optimal regulator problem for nonstandard singularly perturbed systems can be obtained with an accuracy of O(.epsilon.$^{k}$ ). The proposed technique represents a significant improvement since the existing method for the standard singularly perturbed systems can not be applied to the nonstandard singularly perturbed systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.82-84
• /
• 2006

최근의 생물학적인 연구에 DNA microarray가 널리 쓰이고 있기 때문에, 이러한 DNA microarray를 구성하는데 필요한 probe design 작업의 중요성이 점차 커져가고 있다. 이 논문에서는 probe design 문제를 thermodynamic fitness function이 2개인 multi-objective optimization 작업으로 변환한 뒤, ${\epsilon}$-multiobjective evolutionary algorithm을 이용하여 probe set을 찾는다. 또한, probe 탐색공간의 크기를 줄이기 위하여 각 DNA sequence의 primer 영역을 찾는 작업을 진행하며, 사용자가 직접 프로그램을 테스트할 수 있는 웹사이트를 제공한다. 실험 대상으로는 mycoides를 선택하였으며, 이 논문에서 제안된 방법을 사용하여 성공적으로 probe set을 발견할 수 있었다.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.43-46
• /
• 2003

In this paper, a novel rotor flux estimation method of an induction motor using support vector machine(SVM) is presented. Two veil-known different flux models with respect to voltage and current are necessary to estimate the rotor flux of an induction motor. The theory of the SVM algorithm is based on statistical teaming theory. Training of SVH leads to a quadratic programming(QP) problem. The proposed SVM rotor flux estimator guarantees the improvement of performance in the transient and steady state in spite of parameter variation circumstance. The validity and the usefulness of Proposed algorithm are throughly verified through numerical simulation.