• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.11a
• /
• pp.446-451
• /
• 2007

An Improved finite element model updating method to address the numerical difficulty associated with ill-conditioning and rank-deficiency. These difficulties frequently occur in model updating problems, when the identification of a larger number of physical parameters is attempted than that warranted by the information content of the experimental data. Based on the standard Bounded Variables Least-squares (BVLS) method, which incorporates the usual upper/lower-bound constraints, the proposed method is equipped with new constraints based on the correlation coefficients between the sensitivity vectors of updating parameters. The effectiveness of the proposed method is investigated through the numerical simulation of a simple framed structure by comparing the results of the proposed method with those obtained via pure BVLS and the regularization method. The comparison indicated that the proposed method and the regularization method yield approximate solutions with similar accuracy.

• ETRI Journal
• /
• v.45 no.4
• /
• pp.704-712
• /
• 2023

This paper presents a flexible finite-difference technique for analyzing the nonuniform guiding structures. Because the voltage and current variations along the nonuniform structure differ for each segment, this work considers the adaptable discretization steps. This technique increases the accuracy of the final response. Moreover, by applying the singular value decomposition and discarding the nonprincipal singular values, an optimal lower rank approximation of the discretization matrix is obtained. The computational cost of the introduced method is significantly reduced using the optimal discretization matrix. Also, the proposed method can be extended to the nonuniform waveguides. The technique is verified by analyzing several practical transmission lines and waveguides with nonuniform profiles.

• Honam Mathematical Journal
• /
• v.23 no.1
• /
• pp.51-57
• /
• 2001

Let $\mathcal{B}(H)$ and $\mathcal{B}(K)$ denote the algebras of all bounded linear operators on Hilbert spaces $\mathcal{H}$ and $\mathcal{K}$, respectively. We show that if ${\phi}:\mathcal{B}(H){\rightarrow}\mathcal{B}(K)$ is an additive mapping satisfying ${\phi}({\mid}A{\mid}^2)={\mid}{\phi}(A){\mid}^2$ for every $A{\in}\mathcal{B}(H)$, then there exists a mapping ${\psi}$ defined by ${\psi}(A)={\phi}(I){\phi}(A)$, ${\forall}A{\in}\mathcal{B}(H)$ such that ${\psi}$ is the sum of $two^*$-homomorphisms one of which C-linear and the othere C-antilinear. We will also study some conditions implying the injective and rank-preserving of ${\psi}$.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.337-342
• /
• 1995

A semiring is a binary system $(S, +, \times)$ such that (S, +) is an Abelian monoid (identity 0), (S,x) is a monoid (identity 1), $\times$ distributes over +, 0 $\times s s \times 0 = 0$ for all s in S, and $1 \neq 0$. Usually S denotes the system and $\times$ is denoted by juxtaposition. If $(S,\times)$ is Abelian, then S is commutative. Thus all rings are semirings. Some examples of semirings which occur in combinatorics are Boolean algebra of subsets of a finite set (with addition being union and multiplication being intersection) and the nonnegative integers (with usual arithmetic). The concepts of matrix theory are defined over a semiring as over a field. Recently a number of authors have studied various problems of semiring matrix theory. In particular, Minc [4] has written an encyclopedic work on nonnegative matrices.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.55 no.5
• /
• pp.226-228
• /
• 2006

This paper deals with a linear matrix inequality (LMI) approach to the design of a static output feedback controller that simultaneously stabilizes a finite collection of linear time-invariant plants. Simultaneous stabilization by static ouput feedback is represented in terms of LMIs with a rank condition. An iterative penalty method is proposed to solve the rank-constrained LMI problem. Numerical experiments show the effectiveness of the proposed algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.1
• /
• pp.70-76
• /
• 2010

In this paper, we propose a personalized Chinese character education system using RankBoost algorithm on a smartphone. In a typical Chinese character education scenario, a trainee is supplied with a finite number of Chinese characters as an input set in the beginning. And, as the training session repeats, the trainee will notice her/his difficult characters in the set which she/he hardly answers. Those characters reflect their personalized degrees of difficulty. Our proposed system constructs these personalized degrees of difficulty using RankBoost algorithm. In the beginning, the algorithm start with the set of Chinese characters, of which each is associated with the same weight values. As the training sessions are repeated, the algorithm increase the weights of Chinese characters that the trainee mistakes, thereby eventually constructs the personalized difficulty degrees of Chinese characters. The proposed algorithm maximizes the educational effects by having the trainee exposed to difficult characters more than easy ones.

• Journal of the Korean Mathematical Society
• /
• v.32 no.1
• /
• pp.33-40
• /
• 1995

A space Y is called finitely dominated if there is a finite complex K such that Y is a retract of K in the homotopy category, i.e., we require maps $i : Y \longrightarrow K and r : K \longrightarrow Y with r \circ i \simeq idy$. The following questions are very classical in topology.

• Journal of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.417-426
• /
• 2017

We explicitly determine fundamental units and regulators of an infinite family of cyclic quartic function fields $L_h$ of unit rank 3 with a parameter h in a polynomial ring $\mathbb{F}_q[t]$, where $\mathbb{F}_q$ is the finite field of order q with characteristic not equal to 2. This result resolves the second part of Lehmer's project for the function field case.

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

The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.195-206
• /
• 2020

The fundamental idea of this article is to present an effective way to obtain the large groups in terms of the split extension obtained by a finite cyclic group and a free abelian group rank 2. The proof of the main result on largeness property of this specific split extension groups will be given by using the connection of large groups with the groups having deficiency one presentations.