• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.110-112
• /
• 2003

This paper presents an alleviant technique for solving ill-conditioned linear systems using spectral adaptive mapping, which is based on spectral mapping theorem. The conventional approaches to solve the ill-conditioned linear systems are divided into reformulation and alleviant technique. So far, the alleviant technique is evaluated the most effective one. In this paper, an adaptive mapping of spectrum is adopted to alleviate the condition number of ill-conditioned linear systems. A shift constant, which is a dominant factor of the spectral adaptive mapping that are proposed, is assessed by the system spectrum. The proposed spectral adaptive mapping technique is tested to demonstrated the validation on several size Hilbert matrices and small scale power systems, which are provide the promising results.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.1
• /
• pp.61-78
• /
• 1995

In this study the method of analysis for three-dimensional plane crack problem by fractional linear mapping is given. Using this method we can obtain the exact solutions of significantly different configurations of the crack. In the example image crack configurations by mapping of elliptic crack are illustrated. And the stress intensity factors along the image crack tips are calculated.

• The Pure and Applied Mathematics
• /
• v.10 no.3
• /
• pp.185-192
• /
• 2003

It is shown that every almost linear mapping $h{\;}:{\;}X{\;}{\rightarrow}{\;}Y$ of a complex normed space X to a complex normed space Y is a linen. mapping when h(rx) = rh(x) (r > 0,$r\;{\neq}\;1$$x{\;}{\in}{\;}X$, that every almost quadratic mapping $h{\;}:{\;}X{\;}{\rightarrow}{\;}Y$ of a complex normed space X to a complex normed space Y is a quadratic mapping when $h(rx){\;}={\;}r^2h(x){\;}(r{\;}>{\;}0,r\;{\neq}\;1)$ holds for all $x{\;}{\in}{\;}X$, and that every almost cubic mapping $h{\;}:{\;}X{\;}{\rightarrow}{\;}Y$ of a complex normed space X to a complex normed space Y is a cubic mapping when $h(rx){\;}={\;}r^3h(x){\;}(r{\;}>{\;}0,r\;{\neq}\;1)$ holds for all $x{\;}{\in}{\;}X$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.5
• /
• pp.1963-1969
• /
• 2017

In order to overcome the manufacturing difficulty of the transverse-flux permanent magnet linear motor (TFPMLM) and enhance its performance much better, a novel TFPMLM with E-core and 3 dimension (3D) magnetic structures is proposed in this paper. Firstly, its basic structure and operating principle are presented. Then the equivalent 2D configuration of the TFPMLM is transformed, so that the Schwarz-Christoffel (SC) mapping method can be used to analyze the motor. Furthermore, the air gap flux density distribution is solved by SC mapping method, based on which, the EMF waveform, no-load cogging force waveform and load force waveform are obtained. Finally, the prototyped TLPMLM is manufactured and the results are obtained from the experiment and 3D FEM, respectively, which are used to compare with those from SC mapping method.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.3
• /
• pp.435-441
• /
• 2001

We obtain a characterization of linear operators on vector spaces and homomorphisms on algebras applying the stability properties of functional equations.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.5
• /
• pp.1031-1040
• /
• 2009

It is shown that every almost positive linear mapping h : $\mathcal{A}\rightarrow\mathcal{B}$ of a Banach *-algebra $\mathcal{A}$ to a Banach *-algebra $\mathcal{B}$ is a positive linear operator when h(rx) = rh(x) (r > 1) holds for all $x\in\mathcal{A}$, and that every almost linear mapping h : $\mathcal{A}\rightarrow\mathcal{B}$ of a unital C*-algebra $\mathcal{A}$ to a unital C*-algebra $\mathcal{B}$ is a positive linear operator when h($2^nu*y$) = h($2^nu$)*h(y) holds for all unitaries $u\in \mathcal{A}$, all $y \in \mathcal{A}$, and all n = 0, 1, 2, ..., by using the Hyers-Ulam-Rassias stability of functional equations. Under a more weak condition than the condition as given above, we prove that every almost linear mapping h : $\mathcal{A}\rightarrow\mathcal{B}$ of a unital C*-algebra $\mathcal{A}$ A to a unital C*-algebra $\mathcal{B}$ is a positive linear operator. It is applied to investigate states, center states and center-valued traces.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.3962-3980
• /
• 2019

To deal with single sample face recognition, this paper presents a patch based semi-supervised linear regression (PSLR) algorithm, which draws facial variation information from unlabeled samples. Each facial image is divided into overlapped patches, and a regression model with mapping matrix will be constructed on each patch. Then, we adjust these matrices by mapping unlabeled patches to $[1,1,{\cdots},1]^T$. The solutions of all the mapping matrices are integrated into an overall objective function, which uses ${\ell}_{2,1}$-norm minimization constraints to improve discrimination ability of mapping matrices and reduce the impact of noise. After mapping matrices are computed, we adopt majority-voting strategy to classify the probe samples. To further learn the discrimination information between probe samples and obtain more robust mapping matrices, we also propose a multistage PSLR (MPSLR) algorithm, which iteratively updates the training dataset by adding those reliably labeled probe samples into it. The effectiveness of our approaches is evaluated using three public facial databases. Experimental results prove that our approaches are robust to illumination, expression and occlusion.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.387-389
• /
• 2003

Rational function model (RFM) is a universal sensor model for remote sensing image restitution. It is able to substitute for models of all known sensors. In this paper, RFM generation by CCD linear image models is described in detail. A principle of RFM-based 3D reconstruction and its implementation in JX4 DPW is also described. Experiments using IKONOS and SPOT5 images are carried out on JX4 DPW. Results show that RFM generated is feasible for photogrammetric restitution of CCD linear images.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.10a
• /
• pp.45-46
• /
• 2012