• Journal of Power Electronics
• /
• v.9 no.1
• /
• pp.61-67
• /
• 2009

In this paper, a simple technique is presented for robust stability testing of perturbed DC-DC converters having multi-linear uncertainty structure. This technique provides a necessary and sufficient condition for testing robust stability. It is based on the corollary of Routh criterion and gridding of parameters. The previous work based on parametric control theory using Kharitonov's theorem and Hermite Biehler theorem gives conservative results and only the sufficient condition of stability, whereas the proposed method provides the necessary and sufficient condition for testing robust stability and it is computationally efficient. The superiority of the method is compared with the Edge theorem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.6
• /
• pp.388-395
• /
• 1986

Dispersion characteristics of shielded single, coupled and edge-offset microstrip structures are investigated by using hybrid mode analysis with Galerkin's method in the spectral domain. Two new basis functions for the longitudinal strip current are proposed and convergence rates of the solutions for the basis functions are compared. Current distribution of the coupled line is obtaind from that of the single line by using shift theorem of the Fourier transform. In addition, effects of off-centered inner strip conductor on dispersion are also discussed Numerical results include various structual parameters and are compared with other available data and good agreements are observed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.1
• /
• pp.63-73
• /
• 1988

In this paper, an algorithm is proposed to evaluate the source-to-terminal reliability, the probability that a source node can communicate with a terminal node, in a probabilistic derected graph. By using Satyanaratana's factoring $theorem^{(7)}$, the original graph can be partitioned into two reduced graphs obtained by contracting and deleting the edge connected to the source node in the probabilistic directed graph. The edge removal proposed in this paper and the general series-parallel reduction can then be applied to the reduced graph. This edge reduction can be applied recursively to the reduced graphs until a source node can be connected to a terminal node by one edge. A computer program which can be applied to evaluating the source-to-terminal reliability in a complex and large network has also been developed.

• Honam Mathematical Journal
• /
• v.36 no.4
• /
• pp.787-794
• /
• 2014

We prove three convex hull theorems on triangles and circles. Given a triangle ${\triangle}$ and a point p, let ${\triangle}^{\prime}$ be the triangle each of whose vertices is the intersection of the orthogonal line from p to an extended edge of ${\triangle}$. Let ${\triangle}^{{\prime}{\prime}}$ be the triangle whose vertices are the centers of three circles, each passing through p and two other vertices of ${\triangle}$. The first theorem characterizes when $p{\in}{\triangle}$ via a distance duality. The triangle algorithm in [1] utilizes a general version of this theorem to solve the convex hull membership problem in any dimension. The second theorem proves $p{\in}{\triangle}$ if and only if $p{\in}{\triangle}^{\prime}$. These are used to prove the third: Suppose p be does not lie on any extended edge of ${\triangle}$. Then $p{\in}{\triangle}$ if and only if $p{\in}{\triangle}^{{\prime{\prime}}$.

• East Asian mathematical journal
• /
• v.31 no.4
• /
• pp.459-481
• /
• 2015

In this study, we investigated whether the theorem is established even if we replace a 'square' element in the Euclidean proof of the Pythagorean theorem with different figures. At this time, we used different figures as equilateral, isosceles triangle, (mutant) a right triangle, a rectangle, a parallelogram, and any similar figures. Pythagorean theorem implies a relationship between the three sides of a right triangle. However, the procedure of Euclidean proof is discussed in relation between the areas of the square, which each edge is the length of each side of a right triangle. In this study, according to the attached figures, we found that the Pythagorean theorem appears in the following three cases, that is, the relationship between the sides, the relationship between the areas, and one case that do not appear in the previous two cases directly. In addition, we recognized the efficiency of Euclidean proof attached the square. This proving activity requires a mathematical process, and a generalization of this process is a good material that can experience the diversity and rigor at the same time.

• Bulletin of the Korean Mathematical Society
• /
• v.33 no.1
• /
• pp.119-126
• /
• 1996

In this paper we study the asymptotic behavior of the edge independence number of a random (n,n)-tree. The tools we use include the matrix-tree theorem, the probabilistic method and Hall's theorem. We begin with some definitions. An (n,n)_tree T is a connected, acyclic, bipartite graph with n light and n dark vertices (see [Pa92]). A subset M of edges of a graph is called independent(or matching) if no two edges of M are adfacent. A subset S of vertices of a graph is called independent if no two vertices of S are adjacent. The edge independence number of a graph T is the number $\beta_1(T)$ of edges in any largest independent subset of edges of T. Let $\Gamma(n,n)$ denote the set of all (n,n)-tree with n light vertices labeled 1, $\ldots$, n and n dark vertices labeled 1, $\ldots$, n. We give $\Gamma(n,n)$ the uniform probability distribution. Our aim in this paper is to find bounds on $\beta_1$(T) for a random (n,n)-tree T is $\Gamma(n,n)$.

• Journal of Information Processing Systems
• /
• v.19 no.4
• /
• pp.450-464
• /
• 2023

To address the problems of large system overhead and low timeliness when dealing with task scheduling in mobile edge cloud computing, a task scheduling and resource management strategy for edge cloud computing based on an improved genetic algorithm was proposed. First, a user task scheduling system model based on edge cloud computing was constructed using the Shannon theorem, including calculation, communication, and network models. In addition, a multi-objective optimization model, including delay and energy consumption, was constructed to minimize the sum of two weights. Finally, the selection, crossover, and mutation operations of the genetic algorithm were improved using the best reservation selection algorithm and normal distribution crossover operator. Furthermore, an improved legacy algorithm was selected to deal with the multi-objective problem and acquire the optimal solution, that is, the best computing task scheduling scheme. The experimental analysis of the proposed strategy based on the MATLAB simulation platform shows that its energy loss does not exceed 50 J, and the time delay is 23.2 ms, which are better than those of other comparison strategies.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1998.05b
• /
• pp.160-165
• /
• 1998

Under the heavy irradiation, when the production and the recombination of interstitials and vacancies are included, the diffusion equations become nonlinear. An effort has been made to arrange an appropriated transformation of these nonlinear differential equations to soluble Poisson's equations, so that analytical solutions for simultaneously calculating the concentrations of interstitials and vacancies in the angular dependent Cottrell's potential of the edge dislocation have been derived from the well-known Green's theorem and perturbation theory.

• Nuclear Engineering and Technology
• /
• v.31 no.2
• /
• pp.151-156
• /
• 1999

Under the heavy irradiation of crystalline materials when the production and the recombination of interstitials and vacancies are included, the diffusion equations become nonlinear. An effort has been made to arrange an appropriate transformation of these nonlinear differential equations to more solvable Poisson's equations, finally analytical solutions for simultaneously calculating the concentrations of interstitials and vacancies in the angular dependent Cottrell's potential of the edge dislocation have been derived from the well-known Green's theorem and perturbation theory.

• Proceeding of EDISON Challenge
• /
• 2017.03a
• /
• pp.376-382
• /
• 2017

Graphene nanoribbons with zigzag-shaped edge (zGNRs) are predicted to be magnetic insulator at the ground state, attracting significant interest in view of spintronic applications [1]. On the other hand, although they are energetically and thermodynamically more favored than zGNRs [2], graphene nanoribbons with armchair-shaped edge (aGNRs) have been less spotlighted than zGNRs due to the absence of magnetism. Herein, based on the combined density functional theory (DFT) and matrix Green's function (MGF) approach, we consider aGNRs functionalized with various molecular groups, and show that the spin polarizations develop for some of the considered aGNR edge functionalization cases. The origin of the induced magnetism will be discussed within the Lieb's theorem [3]. This work will provide a novel guidance for the development of graphene-based spintronic devices.