• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.875-879
• /
• 1998

A fault on the transmission line results in the variation of reactance and parametric uncertainties in the power system dynamics. In this case, we need a robust control to cope with these uncertainties. A sliding mode control, a sort of robust control, is known to be robust to parametric or state-dependent uncertainties if the bounding function of uncertain terms is determined a priori. However, in general, we can not readily determine the bounding function for the complex systems. Hence, in this paper we introduce a fuzzy system which can estimate the bounding function in relatively simple way. By the use of the proposed fuzzy system, determination of bounding function is made easier. We applied the proposed scheme to the stabilization of power system under the sudden fault on the transmission lines. The simulation result verifies the effectiveness of the scheme.

• Geotechnical Engineering
• /
• v.12 no.2
• /
• pp.95-106
• /
• 1996

In this study, a constitutive model which can describe the anisotropic and plastic behaviors of natural cohesive soils, was developed based on anisotropic bounding surface theory. The model was fomulated by the concepts of the improved anisotropic bounding surface function, nonassociated flow rule with new plastic potential function, anisotropic hardening rule, and new mapping rule governing the plastic behavior inside bounding sutraface. Comparing with the results of Ku consolidation and triaxial shearing tests, the predictions by the proposed model agree quite well with real soil responses.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.7
• /
• pp.377-383
• /
• 2002

The TSP(Traveling Salesman Problem) has been known as NP-complete, there have been various studies to find the near optimal solution. The nearest neighbor heuristic is more simple than the other algorithms which are to find the optimal solution. This paper designs and implements a new distributed nearest neighbor heuristic with bounding function for the TSP using the master/slave model of PVM(Parallel Virtual Machine). Distributed genetic algorithm obtains a near optimal solution and distributed nearest neighbor heuristic finds an optimal solution for the TSP using the near optimal value obtained by distributed genetic algorithm as the initial bounding value. Especially, we get more speedup using a new genetic operator in the genetic algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.05a
• /
• pp.595-598
• /
• 2020

IoU (Intersection over Union) is the most commonly used index in target detection. The core requirement of target detection is what is in the image and where. Based on these two problems, classification training and positional regression training are needed. However, in the process of position regression, the most commonly used method is to obtain the IoU of the predicted bounding box and ground-truth bounding box. Calculating bounding box regression losses should take into account three important geometric measures, namely the overlap area, the distance, and the aspect ratio. Although GIoU (Generalized Intersection over Union) improves the calculation function of image overlap degree, it still can't represent the distance and aspect ratio of the graph well. As a result of technological progress, Bounding-Box is no longer represented by coordinates x,y,w and h of four positions. Therefore, the IoU can be further optimized with the center point and aspect ratio of Bounding-Box.

• Journal of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.133-147
• /
• 2021

Our aim in this paper is to derive several new monotonicity properties and functional inequalities of some functions involving the q-gamma, q-digamma and q-polygamma functions. More precisely, some classes of functions involving the q-gamma function are proved to be logarithmically completely monotonic and a class of functions involving the q-digamma function is showed to be completely monotonic. As applications of these, we offer upper and lower bounds for this special functions and new sharp upper and lower bounds for the q-analogue harmonic number harmonic are derived. Moreover, a number of two-sided exponential bounding inequalities are given for the q-digamma function and two-sided exponential bounding inequalities are then obtained for the q-tetragamma function.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.259-262
• /
• 2001

An improved robust hybrid control law is proposed. This law used the separated bounding function and the stiffness bound. It satisfied the performance though we don't know precise information of contact environments. It guarantees the practical stability in sense of Lyapunov. Simulation was performed to validate this law using a four-axis SCARA type robot manipulator.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.161-164
• /
• 2000

An improved robust hybrid control law is proposed This law uses the separated bounding function: so uncertainties of each axis does not affect the others. Also, this law uses the separated $\varepsilon$, so we can take different $\varepsilon$ for each axis This law guarantees the practical stability in sense of Lyapunov. Simulation was performed to validate this law using a four-axis SCARA type robot manipulator.

• Geomechanics and Engineering
• /
• v.11 no.3
• /
• pp.325-343
• /
• 2016

A total stress-based bounding surface model is developed to predict the undrained behaviour of saturated soft clays under cyclic loads based on the anisotropic hardening modulus field and bounding-surface theories. A new hardening rule is developed based on a new interpolation function of the hardening modulus that has simple mathematic expression and fewer model parameters. The evolution of hardening modulus field is described in the deviatoric stress space. It is assumed that the stress reverse points are the mapping centre points and the mapping centre moves with the variation of loading and unloading paths to describe the cyclic stress-strain hysteresis curve. In addition, by introducing a model parameter that reflects the accumulation rate and level of shear strain to the interpolation function, the cyclic shakedown and failure behaviour of soil elements with different combinations of initial and cyclic stresses can be captured. The methods to determine the model parameters using cyclic triaxial compression tests are also studied. Finally, the cyclic triaxial extension and torsional shear tests are performed. By comparing the predictions with the test results, the model can be used to describe undrained cyclic stress-strain responses of elements with different stress states for the tested clays.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.11-22
• /
• 1997

The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9B
• /
• pp.1350-1359
• /
• 2010

Recently many researchers have been proved that general RFID system for proximity authentication is vulnerable to various location-based relay attacks such as distance fraud, mafia fraud and terrorist fraud attacks. The distance-bounding protocol is used to prevent the relay attacks by measuring the round trip time of single challenge-response bit. In 2008, Munilla and Peinado proposed an improved distance-bounding protocol applying void-challenge technique based on Hancke-Kuhn's protocol. Compare with Hancke-Kuhn's protocol, Munilla and Peinado's protocol is more secure because the success probability of an adversary has (5/8)n. However, Munilla and Peinado's protocol is inefficient for low-cost passive RFID tags because it requires large storage space and many hash function computations. Thus, this paper proposes a new RFID distance-bounding protocol for low-cost passive RFID tags that can be reduced the storage space and hash function computations. As a result, the proposed distance-bounding protocol not only can provide both storage space efficiency and computational efficiency, but also can provide strong security against the relay attacks because the adversary's success probability can be reduced by $(5/8)^n$.