• Honam Mathematical Journal
• /
• v.29 no.2
• /
• pp.245-257
• /
• 2007

We showed in [2] that if $r\leq2$, then the average error between simple Trapezoidal rule and the composite Trapezoidal rule on two consecutive subintervals is proportional to $h^{2r+3}$ using zero mean Gaussian distribution under the assumption that we have subintervals (for simplicity equal length) partitioning and that each subinterval has the length. In this paper, if $r\geq3$, we show that zero mean Gaussian distribution of average error between simple Trapezoidal rule and the composite Trapezoidal rule on two consecutive subintervals is bounded by $Ch^8$.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.4
• /
• pp.356-362
• /
• 2002

In this paper, well-known Takagi-Sugeno fuzzy model is used as the nonlinear plant model and uncertainty is assumed to be included in the model structure with known bounds. Based on the fuzzy models, a numerical robust stability analysis for the fuzzy feedback linearization regulator is presented using Linear Matrix Inequalities (LMI) Theory. For these structured uncertainty, the closed system can be cast into Lur'e system by simple transformation. From the LMI stability condition for Lur'e system, we can derive the robust stability condition for the fuzzy feedback linearization regulator based on Takagi-Sugeno fuzzy model. The effectiveness of the proposed analysis is illustrated by a simple example.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.19 no.2
• /
• pp.13-18
• /
• 1982

The method of Rankine source distribution is emerging as a powerful yet simple alternative for the solution of complicated free surface problems. But it has been uncertain whether the radiation condition could be satisfied exactly by distributing the simple sources on the free surface only. In this paper, it is proved rigorously that the Rankine sources, whose intensities are varying sinusoidally along the axis satisfying the free surface boundary condition, generate the radiation waves both in the infinite and finite-depth flows. A formula is derived to give the upper and lower bounds of the errors in the induced velocity computation that will be introduced by truncating the extent of source distribution on the free surface. Since the truncation is inevitable in the numerical analysis, this formula may be used as a criterion to limit the position of the field points, where velocity computation is made, away from the truncation boundary. A typical analysis shows that the maximum error will be 3.4 percent of the exact induced velocity when the field point is on the free surface two wave lengths away from the truncation boundary.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.46-49
• /
• 1998

In this paper, we introduce the notion of intelligent communication by introducing a novel intelligent receiver model. This receiver is continually evolving and learns and improves in performance as it compiles its experience over time. In digital communication context, in a typical training mode, it jearns the concept of "1" as is deteriorated by arbitrary (not necessarily additive as is typically assumed) disturbance and /or modulation. After learning "1", in test mode, it classifies the received signal "1" and "0" almost completely. The intelligent receiver as implemented is grounded on the recently introduced Stochastic Morphological Sampling Theorem(SMST), a distribution-free result which gives theoretical bounds on the sample complexity(training size) needed for the required performance parameters such as accuracy($\varepsilon$) and confidence($\delta$). Based on this theorem, we demonstrate --almost irrespective of channel and modulation model-- the number of samples needed to learn the concept of "1" is not too "large" and the resulting universal receiver structure, that corresponding to classical Nearest Neighbor rule in Pattern Recognition Theory, is trivial. We check the surprising efficiency and validity of this model through some simple simulations. and validity of this model through some simple simulations.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1324-1342
• /
• 2020

Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.227-245
• /
• 2014

Suppose G is a simple graph. The ${\ell}$-eigenvalues ${\delta}_1$, ${\delta}_2$,..., ${\delta}_n$ of G are the eigenvalues of its normalized Laplacian ${\ell}$. The normalized Laplacian Estrada index of the graph G is dened as ${\ell}EE$ = ${\ell}EE$(G) = ${\sum}^n_{i=1}e^{{\delta}_i}$. In this paper the basic properties of ${\ell}EE$ are investigated. Moreover, some lower and upper bounds for the normalized Laplacian Estrada index in terms of the number of vertices, edges and the Randic index are obtained. In addition, some relations between ${\ell}EE$ and graph energy $E_{\ell}$(G) are presented.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.518-524
• /
• 2009

Single parity check (SPC) product codes are simple yet powerful codes that are used to correct errors and/or recover erasures. The focus of this paper is to evaluate the performance of such codes under erasure scenarios and to develop a closed-form tight upper bound for the post-decoding erasure rate. Closed-form exact expressions are derived for up to seven erasures. Previously published closed-form bounds assumed that all unrecoverable patterns should contain four erasures in a square. Additional non-square patterns are accounted for in the proposed expressions. The derived expressions are verified using exhaustive search. Eight or more erasures are accounted for by using a bound. The developed expressions improve the evaluation of the recoverability of SPC product codes without the need for simulation or search algorithms, whether exhaustive or novel.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.501-506
• /
• 1993

An efficient solution algorithm of the optimal load distribution problem with joint torque constraints is presented. Multiple robot system where each robot is rigidly grasping a common object is considered. The optimality criteria used is the sum of weighted norm of the joint torque vectors. The maximum and minimum bounds of each joint torque in arbitrary form are considered as constraints, and the solution that reduces the internal force to zero is obtained. The optimal load distribution problem is formulated as a quadratic optimization problem in R, where I is the number of robots. The general solution can be obtained using any efficient numerial method for quadratic programming, and for dual robot case, the optimal solution is given in a simple analytical form.

• Journal of applied mathematics & informatics
• /
• v.38 no.1_2
• /
• pp.189-200
• /
• 2020

Let G be a simple connected graph with n vertices and m edges. Denote by d₁ ≥ d₂ ≥ ⋯ ≥ d_n > 0 and d(e₁) ≥ d(e₂) ≥ ⋯ ≥ d(e_m) sequences of vertex and edge degrees, respectively. If vertices v_i and v_j are adjacent, we write i ~ j. The general sum-connectivity index is defined as 𝒳_α(G) = ∑_i~j(d_i + d_j)^α, where α is an arbitrary real number. Firstly, we determine a relation between 𝒳_α(G) and 𝒳_α-1(G). Then we use it to obtain some new bounds for 𝒳_α(G).

• Proceedings of the KSME Conference
• /
• 2004.11a
• /
• pp.37-42
• /
• 2004

This paper presents a simple method to estimate fully plastic crack tip stresses of unequally notched specimen based on the equilibrium condition of the least upper bounds for plane strain deformation fields. The method is applied to unequally notched specimens under bending and tension. For various notch angle the limit loads and crack tip stresses are estimated from the present method and compared with results from finite element limit analyses.