• Communications of the Korean Mathematical Society
• /
• v.10 no.1
• /
• pp.207-213
• /
• 1995

Let $(\Omega, F, P)$ be a probability space with F a $\sigma$-algebra of subsets of the measure space $\Omega$ and P a probability measure on $\Omega$. Suppose $a > 0$ and let $(F_t)_{t \in [0,a]}$ be an increasing family of sub-$\sigma$-algebras of F. If $r > 0$, let $J = [-r,0]$ and $C(J, R^n)$ the Banach space of all continuous paths $\gamma : J \to R^n$ with the sup-norm $\Vert \gamma \Vert = sup_{s \in J}$\mid$\gamma(s)$\mid$$ where $$\mid$\cdot$\mid$$ denotes the Euclidean norm on $R^n$. Let E,F be separable real Banach spaces and L(E,F) be the Banach space of all continuous linear maps $T : E \to F$.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.443-454
• /
• 2017

We study a notion of q-frequent hypercyclicity of linear maps between the Banach algebras consisting of operators on a separable infinite dimensional Banach space. We derive a sufficient condition for a linear map to be q-frequently hypercyclic in the strong operator topology. Some properties are investigated regarding q-frequently hypercyclic subspaces as shown in [5], [6] and [7]. Finally, we study q-frequent hypercyclicity of tensor products and direct sums of operators.

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

A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.

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

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1173-1177
• /
• 1990

Cerebellar Model Linear Associator Net(CMLAN), a kind of neuro-net based adaptive control function generator, was applied to the problem of direct inverse calibration of three and six d.o.f. POMA 560 robot. Since CMLAN autonomously maps and generalizes a desired system function via learning on the sampled input/output pair nodes, CMLAN allows no knowledge in system modeling and other error sources. The CMLAN based direct inverse calibration avoids the complex procedure of identifying various system parameters such as geometric(kinematic) or nongeometric(dynamic) ones and generates the corresponding desired compensated joint commands directly to each joint for given target commands in the world coordinate. The generated net outputs automatically handles the effect of unknown system parameters and dynamic error sources. On-line sequential learning on the prespecified sampled nodes requires only the measurement of the corresponding tool tip locations for three d.o.f. manipulator but location and orientation for six d.o.f. manipulator. The proposed calibration procedure can be applied to any robot.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.11-13
• /
• 2008

This study proposes the method to use existing digital maps as one of the technologies to exclude individual differences that occur in the process of manually determining GCP for the geometric correction of KOMPSAT images and applying it to the images and to automate the generation of ortho-images. It is known that, in case high-resolution satellite images are corrected geometrically by using RPC, first order polynomials are generally applied as the correction formula in order to obtain good results. In this study, we matched the corresponding objects between 1:25,000 digital map and a KOMPSAT image to obtain the coefficients of the zero order polynomial and showed the differences in the pixel locations obtained through the matching. We performed proximity corrections using the Boolean operation between the point data of the surface linear objects and the point data of the edge objects of the image. The surface linear objects are road, water, building from topographic map.

• Journal of the Korean Mathematical Society
• /
• v.48 no.5
• /
• pp.969-984
• /
• 2011

This paper discusses the hypercyclicity of weighted composition operators acting on the space of holomorphic functions on the open unit ball $B_N$ of $\mathbb{C}^N$. Several analytic properties of linear fractional self-maps of $B_N$ are given. According to these properties, a few necessary conditions for a weighted composition operator to be hypercyclic in the space of holomorphic functions are proved. Besides, the hypercyclicity of adjoint of weighted composition operators are studied in this paper.

• Journal of Biomedical Engineering Research
• /
• v.5 no.2
• /
• pp.133-142
• /
• 1984

The EMG signal can be considered as a signal source that expresses the intention of man because it is a electrical signal generated when the man contracts muscles. For proportional control of prostheses, the control signal proportional to the mousle contraction level must be estimated. Typically a foul-wave rectifier and low-pass filter are used to estimate the proportional control signal from the EMG signal. In this paper, it is proposed to use a logarithmic transformation and a linear minimum mean square error estimator. A logarithmic transformation maps the myoelectric signal into an additive control signal-plus-noise domain and the Kalman filter is used to estimate the control signal as a linear minimum mean square error estimator. The performance of this estimator is verified by the computer simulation and the estimator is applied to the EMG obtained from the biceps brachii muscle of normal subjects.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.451-459
• /
• 2019

Let ${\mathcal{A}}$ and ${\mathcal{B}}$ be two operator ${\ast}$-rings such that ${\mathcal{A}}$ is prime. In this paper, we show that if the map ${\Phi}:{\mathcal{A}}{\rightarrow}{\mathcal{B}}$ is bijective and preserves Jordan or ${\ast}$-Jordan triple product, then it is additive. Moreover, if ${\Phi}$ preserves Jordan triple product, we prove the multiplicativity or anti-multiplicativity of ${\Phi}$. Finally, we show that if ${\mathcal{A}}$ and ${\mathcal{B}}$ are two prime operator ${\ast}$-algebras, ${\Psi}:{\mathcal{A}}{\rightarrow}{\mathcal{B}}$ is bijective and preserves ${\ast}$-Jordan triple product, then ${\Psi}$ is a ${\mathbb{C}}$-linear or conjugate ${\mathbb{C}}$-linear ${\ast}$-isomorphism.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.3
• /
• pp.175-185
• /
• 2020

Three-dimensional registration is a process of matching data with or without a coordinate system to a reference coordinate system, which is used in various fields such as the absolute orientation of photogrammetry and data combining for producing precise road maps. Three-dimensional registration is divided into a method using points and a method using linear features. In the case of using points, it is difficult to find the same conjugate point when having different spatial resolutions. On the other hand, the use of linear feature has the advantage that the three-dimensional registration is possible by using not only the case where the spatial resolution is different but also the conjugate linear feature that is not the same starting point and ending point in point cloud type data. In this study, we proposed a method to determine the scale and the three-dimensional translation after determining the three-dimensional rotation angle between two data using quaternion to perform three-dimensional registration using linear features. For the verification of the proposed method, three-dimensional registration was performed using the linear features constructed an indoor and the linear features acquired through the terrestrial mobile mapping system in an outdoor environment. The experimental results showed that the mean square root error was 0.001054m and 0.000936m, respectively, when the scale was fixed and if not fixed, using indoor data. The results of the three-dimensional transformation in the 500m section using outdoor data showed that the mean square root error was 0.09412m when the six linear features were used, and the accuracy for producing precision maps was satisfied. In addition, in the experiment where the number of linear features was changed, it was found that nine linear features were sufficient for high-precision 3D transformation through almost no change in the root mean square error even when nine linear features or more linear features were used.