• Journal of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.581-598
• /
• 1997

This paper is concerned with the impulsive control problem $$ \dot{x}(t) = f(t, x) + g(t, x)\dot{u}(t), t \in [0, T], x(0) = \overline{x}, $$ where u is a possibly discontinuous control function of bounded variation, $f : R \times R^n \mapsto R^n$ is a bounded and Lipschitz continuous function, and $g : R \times R^n \mapsto R^n$ is continuously differentiable w.r.t. the variable x and satisfies $\mid$g(t,\cdot) - g(s,\cdot)$\mid$ \leq \phi(t) - \phi(s)$, for some increasing function $\phi$ and every s < t. We show that the map $u \mapsto x_u$ is Lipschitz continuous when u ranges in the set of step functions whose total variations are uniformly bounded, where $x_u$ is the solution of the impulsive control system corresponding to u. We also define the generalized solution of the impulsive control system corresponding to a measurable control functin of bounded variation.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.1141-1142
• /
• 2008

For intelligent vehicles, recognizing the sounding is an important task. In this paper we propose an road area detection system. This system uses u-disparity and v-disparity map. v-disparity map is used to find the road area. u-disparity is used to cluster the area that is an object. The test results and overall system is discribed in this paper.

• Journal of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.251-264
• /
• 1995

Applications of the classical Knaster-Kuratowski-Mazurkiewicz (si-mply, KKM) theorem and the fixed point theory of multifunctions defined on convex subsets of topological vector spaces have been greatly improved by adopting the concept of convex spaces due to Lassonde [L1]. In this direction, the first author [P5] found that certain coincidence theorems on a large class of composites of upper semicontinuous multifunctions imply many fundamental results in the KKM theory.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.363-365
• /
• 2010

In this study, based on numerical map GIS-T Dataset build and by using ArcGIS Network Analysis emergency vehicle's reach time were analyzed. AutoCad using 1: 50,000 based on roads and hospitals of numerical map were creating a Polyline and Point and Network Dataset made using ArcCatalog. ArcGIS Analysis setting the interval for the period reached 3 minutes, 5 minutes, 15 minutes was set and then U-Turn was set to not allow because U-turn takes a long time to calculate and does not happen often on the real road. Intersection of the passage of time, considering that the emergency vehicles were set to 3 seconds. To expand by taking advantage of this facility on Vulnerable area will be used as base material. If we focus on analyzing the emergency activity to convert little data, To prepare for disaster and disaster will be able to use the materials.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.2
• /
• pp.248-253
• /
• 2009

In this paper, we have studied about the ubiquitous service map for the effective u-City service providing. Through the research, we are going to propose the fact that it can be implemented ubiquitous services according to city characteristics. The proposed research could make it possible to be an intelligent decision making system by city characteristics. Also, nation, local government, companies can be assigned their appropriate load according to the proposed system for the effective u-City services.

• Journal of Broadcast Engineering
• /
• v.27 no.1
• /
• pp.69-79
• /
• 2022

In this study, a method of generating and utilizing a normal map image used to represent the characteristics of the surface of an image material to improve the classification accuracy of the original material image is proposed. First of all, (1) to generate a normal map that reflects the surface properties of a material in an image, a U-Net with attention-R2 gate as a generator was used, and a Pix2Pix-based method using the generated normal map and the similarity with the original normal map as a reconstruction loss was used. Next, (2) we propose a network that can improve the accuracy of classification of the original material image by applying the previously created normal map image to the attention gate of the classification network. For normal maps generated using Pixar Dataset, the similarity between normal maps corresponding to ground truth is evaluated. In this case, the results of reconstruction loss function applied differently according to the similarity metrics are compared. In addition, for evaluation of material image classification, it was confirmed that the proposed method based on MINC-2500 and FMD datasets and comparative experiments in previous studies could be more accurately distinguished. The method proposed in this paper is expected to be the basis for various image processing and network construction that can identify substances within an image.

• Korea Information Processing Society Review
• /
• v.21 no.3
• /
• pp.8-16
• /
• 2014

• Honam Mathematical Journal
• /
• v.39 no.4
• /
• pp.677-688
• /
• 2017

Let P be a finitely generated projective module over a commutative ring R with identity. If P has finite rank, then it will be shown that the map ${\varphi}:Aut_R(P){\rightarrow}U(R)$ defined by ${\varphi}({\alpha})={\det}({\alpha})$ is locally surjective and $Ker({\varphi})=SL_R(P)$.

• Journal of the Korean Mathematical Society
• /
• v.34 no.3
• /
• pp.719-730
• /
• 1997

From a minimax inequality related to admissible multimaps, we deduce generalized versions of lopsided saddle point theorems, fixed point theorems, existence of maximizable linear functionals, the Walras excess demand theorem, and the Gale-Nikaido-Debreu theorem.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.1
• /
• pp.115-137
• /
• 2018

Let $R_{u{^2},v^2,w^2,p}$ be a finite non chain ring ${\mathbb{F}}_p[u,v,w]{\langle}u^2,\;v^2,\;w^2,\;uv-vu,\;vw-wv,\;uw-wu{\rangle}$, where p is a prime number. This ring is a part of family of Frobenius rings. In this paper, we explore the structures of cyclic codes over the ring $R_{u{^2},v^2,w^2,p}$ of arbitrary length. We obtain a unique set of generators for these codes and also characterize free cyclic codes. We show that Gray images of cyclic codes are 8-quasicyclic binary linear codes of length 8n over ${\mathbb{F}}_p$. We also determine the rank and the Hamming distance for these codes. At last, we have given some examples.