• Korean Journal of Mathematics
• /
• 제18권4호
• /
• pp.465-472
• /
• 2010

In this paper, we investigate the extent of the set on which the modulus of a meromorphic function is lower bounded by a term related to some Nevanlinna Theory functionals. A. I. Shcherba estimate the size of the set on which the modulus of an entire function is lower bounded by 1. Our theorem in this paper shows that the same result holds in the case that the lower bound is replaced by$lT(r,f)$, $0{\leq}l$ < 1, which improves Shcherba's result. We also give a similar estimation for meromorphic functions.

• 대한수학회논문집
• /
• 제38권2호
• /
• pp.389-400
• /
• 2023

In this paper, some estimations will be given for the analytic functions belonging to the class 𝓡(α). In these estimations, an upper bound and a lower bound will be determined for the first coefficient of the expansion of the analytic function h(z) and the modulus of the angular derivative of the function ${\frac{zh^{\prime}(z)}{h(z)}}$, respectively. Also, the relationship between the coefficients of the analytical function h(z) and the derivative mentioned above will be shown.

• 대한산업공학회지
• /
• 제19권2호
• /
• pp.3-13
• /
• 1993

In this study, we develop a B & B type algorithm for the concave minimization problem with 0-1 knapsack constraint. Our algorithm reformulates the original problem into the singly linearly constrained concave minimization problem by relaxing 0-1 integer constraint in order to get a lower bound. But this relaxed problem is the concave minimization problem known as NP-hard. Thus the linear function that underestimates the concave objective function over the given domain set is introduced. The introduction of this function bears the following important meanings. Firstly, we can efficiently calculate the lower bound of the optimal object value using the conventional convex optimization methods. Secondly, the above linear function like the concave objective function generates the vertices of the relaxed solution set of the subproblem, which is used to update the upper bound. The fact that the linear underestimating function is uniquely determined over a given simplex enables us to fix underestimating function by considering the simplex containing the relaxed solution set. The initial containing simplex that is the intersection of the linear constraint and the nonnegative orthant is sequentially partitioned into the subsimplices which are related to subproblems.

• 한국경영과학회지
• /
• 제31권2호
• /
• pp.69-85
• /
• 2006

Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

• 한국CDE학회논문집
• /
• 제15권1호
• /
• pp.24-32
• /
• 2010

This paper introduces a B-spline based branch & bound algorithm for global optimization. The branch & bound is a well-known algorithm paradigm for global optimization, of which key components are the subdivision scheme and the bound calculation scheme. For this, we consider the B-spline hypervolume to approximate an objective function defined in a design space. This model enables us to subdivide the design space, and to compute the upper & lower bound of each subspace where the bound calculation is based on the LHS sampling points. We also describe a search tree to represent the searching process for optimal solution, and explain iteration steps and some conditions necessary to carry out the algorithm. Finally, the performance of the proposed algorithm is examined on some test problems which would cover most difficulties faced in global optimization area. It shows that the proposed algorithm is complete algorithm not using heuristics, provides an approximate global solution within prescribed tolerances, and has the good possibility for large scale NP-hard optimization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권10호
• /
• pp.3624-3637
• /
• 2014

At SAC 2004, Junod and Vaudenay designed the FOX family based on the Lai-Massey scheme. They noted that it was impossible to find any useful differential characteristic or linear trail after 8 rounds of FOX64 or FOX128. In this paper, we provide the lower bound of differentially active S-boxes in consecutive rounds of the Lai-Massey scheme that has SPS as its F-function, and we propose the necessary conditions for the reachability of the lower bound. We demonstrate that similar results can be obtained with respect to the lower bound of linearly active S-boxes by proving the duality in the Lai-Massey scheme. Finally, we apply these results to FOX64 and FOX128 and prove that it is impossible to find any useful differential characteristics or linear trail after 6 rounds of FOX64. We provide a more precise security bound for FOX128.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권7호
• /
• pp.418-423
• /
• 2003

In order to describe the upper bound of the uncertainties without any information of the structure, we assume that the upper bound is represented as a Fredholm integral equation of the first kind, that is, an integral of the product of a predefined kernel with an unknown influence function. Based on the improved Lyapunov function, we propose an adaptation law that is capable of estimating the upper bound and we design a sliding mode control, which controls effectively for uncertain dynamic systems.

• Journal of the Korean Statistical Society
• /
• 제22권1호
• /
• pp.1-12
• /
• 1993

An approach to make the information bound sharper in median-unbiased estimation, based on an analogue of the Cramer-Rao inequality developed by Sung et al. (1990), is introduced for continuous densities with a nuisance parameter by considering information quantities contained both in the parametric function of interest and in the nuisance parameter in a linear fashion. This approach is comparable to that of improving the information bound in mean-unbiased estimation for the case of two unknown parameters. Computation of an optimal weight corresponding to the nuisance parameter is also considered.

• 제어로봇시스템학회논문지
• /
• 제14권10호
• /
• pp.1014-1021
• /
• 2008

This paper proposes an intelligent sliding mode control method for robotic systems with the unknown bound of model uncertainties. In our control structure, the unknown bound of model uncertainties is used as the gain of the sliding controller. Then, we employ the function approximation technique to estimate the unknown nonlinear function including the width of boundary layer and the uncertainty bound of robotic systems. The adaptation laws for all parameters of the self-recurrent wavelet neural network and those for the reconstruction error compensator are derived from the Lyapunov stability theorem, which are used for an on-line control of robotic systems with model uncertainties and external disturbances. Accordingly, the proposed method can not only overcome the chattering phenomenon in the control effort but also have the robustness regardless of model uncertainties and external disturbances. Finally, simulation results for the five-link biped robot are included to illustrate the effectiveness of the proposed method.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1995년도 추계학술대회 논문집
• /
• pp.195-198
• /
• 1995

In Semi-Solid Forging, it is necessary to control the forming variables accurately in order to make near-net-shape products. Generally, the defects of products may occur due to liquid segregation which can be caused by the degree of deformation and condition of friction in Semi-Solid Forging, where the segregation is to be predicted by flow analysis. This paper presents the feasibility of theoretical analysis model using the new yield function which is proposed by Doraivelu et al. to the flow analysis of the semi-solid dendritic Sn-15%Pb alloys instead of adopting the yield criterion of Shima & Oyane which is used by Charreyron and usefulness of the adopted yield function. The distribution of the liquid fraction at various strains in radial direction and the influence of friction are estimated by Upper Bound Method.