• Structural Engineering and Mechanics
• /
• v.8 no.5
• /
• pp.439-452
• /
• 1999

A simple numerical scheme suitable for tracing the fracture propagation path for structures idealized by means of Hillerborg's classical cohesive crack model is presented. A direct collocation, multidomain boundary element method is adopted for the required space discretization. The algorithm proposed is necessarily iterative in nature since the crack itinerary is a priori unknown. The fracture process is assumed to be governed by a path-dependent generally nonlinear softening law. The potentialities of the method are illustrated through two examples.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.96-104
• /
• 1990

In this paper, a novel method of jig-saw puzzle matching is proposed using a modifided boundary matching algorithm without a priori knowledge for the matched puzzle. Specifically, a boundary tracking algorithm is utilised to segment each puzzle from low-resolution image data. Segmented puzzle is described via corner point, angle and distance between two adjacent coner point, and convexity and/or concavity of corner point. Proposed algorithm is implemented and tested in IBM PC and PC version vision system, and applied successfully to real jig-saw puzzles.

• Nonlinear Functional Analysis and Applications
• /
• v.29 no.2
• /
• pp.545-558
• /
• 2024

In this study, a class of nonlinear boundary fractional Caputo Volterra-Fredholm integro-differential equations (CV-FIDEs) is taken into account. Under specific assumptions about the available data, we firstly demonstrate the existence and uniqueness features of the solution. The Gronwall's inequality, a adequate singular Hölder's inequality, and the fixed point theorem using an a priori estimate procedure. Finally, a case study is provided to highlight the findings.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.591-594
• /
• 2008

This paper explores how to characterise security properties of software components, and how to reason about their suitability for a trustworthy compositional contract. Our framework provides an explicit opportunity for software composers as well as software components to test a priori security properties of software components in a system composition. The proposed framework uses logic programming as a tool to represent security properties of atomic components and reason about their compositional matching with other components.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.366-370
• /
• 2003

This paper is on weighted model reduction using structurally balanced truncation. For a given weighted(single or double-sided) transfer function, a state space realization with the linear fractional transformation form is obtained. Then we prove that two block diagonal LMI(linear matrix inequality) solutions always exist, and it is possible to get a reduced order model with guaranteed stability and a priori error bound. Finally, two examples are used to show the validity of proposed weighted reduction method, and the method is compared with other existing methods.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1259-1262
• /
• 1998

This paper introduced a scheme for finding the relationships between the measurements and tracks in multi-target tracking (MTT). We considered the relationships between targets and measurements as MRF and assumed a priori as a Gibbs distribution. An energy function is defined over the measurement space, as accurately as possible so that it may incorporate most of the important natural constraints. To find the minimizer of the energy function, we derived a new equation of closed form.

• Journal of the Korean Mathematical Society
• /
• v.44 no.6
• /
• pp.1281-1290
• /
• 2007

We introduce three spectral regularization methods for solving a backward heat conduction problem (BHCP). For the three spectral regularization methods, we give the stability error estimates with optimal order under an a-priori and an a-posteriori regularization parameter choice rule. Numerical results show that our theoretical results are effective.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.944-947
• /
• 1996

Realization of autonomous agents that organize their own internal structure in order to behave adequately with respect to their goals and the world is the ultimate goal of AI and Robotics. Reinforcement learning gas recently been receiving increased attention as a method for robot learning with little or no a priori knowledge and higher capability of reactive and adaptive behaviors. In this paper, we present a method of reinforcement learning by which a multi robots learn to move to goal. The results of computer simulations are given.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.689-692
• /
• 1998

Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching is presented. A set of andidate parameters are hypthesized by mapping the angular difference and a new distance measure to the hough space and by detecting maximally consistent points. The proposed method is shown to be much faster than the conventinal one where the relaxation process is repeated until convergence, while providing robust matching performance, without a priori information on the geometrical transformation parameters.

• Journal of the Korean Mathematical Society
• /
• v.54 no.6
• /
• pp.1787-1799
• /
• 2017

In this paper, we prove basic a priori estimate for the ${\bar{\partial}}$-Neumann problem on an annulus between two pseudoconvex submanifolds of a Stein manifold. As a corollary of the result, we obtain the global regularity for the ${\bar{\partial}}$-problem on the annulus. This is a manifold version of the previous results on pseudoconvex domains.