• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.208-213
• /
• 1992

In this paper we are concerned with optimal control problems whose costs am quadratic and whose states are governed by linear delay equations and general boundary conditions. The basic new idea of this paper is to Introduce a new class of linear operators in such a way that the state equation subject to a starting function can be viewed as an inhomogeneous boundary value problem in the new linear operator equation. In this way we avoid the usual semigroup theory treatment to the problem and use only linear operator theory.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.1469-1484
• /
• 2014

In this paper we are concerned with a class of stochastic partial functional differential equations with infinite delay. Supposing that the linear part is a Hille-Yosida operator but not necessarily densely defined and employing the integrated semigroup and random dynamics theory, we present some appropriate conditions to guarantee the existence of a random attractor.

• Journal of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.61-88
• /
• 2020

In this paper, we investigate the existence of mild solutions for a class of fractional impulsive evolution equation with periodic boundary condition by means of the method of upper and lower solutions and monotone iterative method. Using the theory of Kuratowski measure of noncompactness, a series of results about mild solutions are obtained. Finally, two examples are given to illustrate our results.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.16 no.2
• /
• pp.93-105
• /
• 2012

In this paper, we consider the controllability of a certain class of impulsive neutral evolution differential equations in Banach spaces. Sufficient conditions for controllability are obtained by using the Hausdorff measure of noncompactness and Monch fixed point theorem under the assumption of noncompactness of the evolution system.

• Journal of the Chungcheong Mathematical Society
• /
• v.7 no.1
• /
• pp.123-139
• /
• 1994

In this paper we are concerned with optimal control problems whose costs are quadratic and whose states are governed by linear delay differential equations and general boundary conditions. The basic new idea of this paper is to introduce a new class of linear operators in such a way that the state equation subject to a starting function can be viewed as an inhomogeneous boundary value problem in the new linear operator equation. In this way we avoid the usual semigroup theory treatment to the problem and use only linear operator theory.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.3_4
• /
• pp.129-164
• /
• 2023

The aim of this work is to present some interesting results on weighted ergodic functions and prove the existence and uniqueness of Stepanov-like pseudo almost automorphic solutions using the spectral decomposition of the phase space developed by Adimy and co-authors. We also give the next challenge of this work.

• Communications of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.1153-1162
• /
• 2023

In this paper, for the bounded solution of the non-densely defined non-autonomous evolution equation, we present the condition for asymptotic periodicity by using the circular spectral theory of functions on the half line and the extrapolation theory of non-densely defined evolution equation.

• Nonlinear Functional Analysis and Applications
• /
• v.28 no.4
• /
• pp.865-876
• /
• 2023

This paper presents properties of the cocycle equations via cochains on a semigroup. And then we offer hyperstability results of related functional equations using the properties of cocycle equations via cochains. These results generalize hyperstability results of a class of linear functional equation by Maksa and Páles. The obtained results can be applied to obtain hyperstability of various functional equations such as Euler-Lagrange type quadratic equations.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.737-744
• /
• 2018

The RSA cryptosystem is a one of the first public-key cryptosystems and is widely used for secure data transmission and electric signature. The security of the RSA cryptosystem is based on the difficulty of factoring large numbers.. Though many studies on finding methods for factoring large numbers are going on, the results of that are all experimental or probabilistic. We, in this paper, construct an algorithm for finding large prime factors of integers without factoring integers using properties of the structure of semigroup of imaginary quadratic order and non-invertible ideal, then propose our methods foe deterministic attack against RSA cryptosystem.

• Journal of Information Technology Services
• /
• v.9 no.4
• /
• pp.219-229
• /
• 2010

The Green's equivalence relations have played a fundamental role in the development of semigroup theory. They are concerned with mutual divisibility of various kinds, and all of them reduce to the universal equivalence in a group. Boolean matrices have been successfully used in various areas, and many researches have been performed on them. Studying Green's relations on a monoid of boolean matrices will reveal important characteristics about boolean matrices, which may be useful in diverse applications. Although there are known algorithms that can compute Green relations, most of them are concerned with finding one equivalence class in a specific Green's relation and only a few algorithms have been appeared quite recently to deal with the problem of finding the whole D or J equivalence relations on the monoid of all $n{\times}n$ Boolean matrices. However, their results are far from satisfaction since their computational complexity is exponential-their computation requires multiplication of three Boolean matrices for each of all possible triples of $n{\times}n$ Boolean matrices and the size of the monoid of all $n{\times}n$ Boolean matrices grows exponentially as n increases. As an effort to reduce the execution time, this paper shows an isomorphism between the R relation and L relation on the monoid of all $n{\times}n$ Boolean matrices in terms of transposition. introduces theorems based on it discusses an improved algorithm for the J relation computation whose design reflects those theorems and gives its execution results.