• Communications of the Korean Mathematical Society
• /
• v.23 no.4
• /
• pp.541-548
• /
• 2008

For a completely bounded linear maps between operator spaces, we introduce numbers which measure the degree of injectivity and subjectivity. The number measuring the injectivity is an operator space analogue of the minimum modulus of a linear map in normed spaces.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.1-6
• /
• 2022

This paper deals with the maximum cardinality matching(MCM) problem. The augmenting path technique is well known in MCM. MCM is obtained by $O({\sqrt{n}}m)$ time complexity augmenting path algorithm for the general graph, and O(m log n) algorithm for the bipartite graph. On the other hand, this paper suggests O(n) linear time algorithm. The proposed algorithm based on the basic principle of as possible as largest selected inter-vertex edges in order to obtain the MCM. This paper simply selects edge {u,𝜐} that the minimum degree vertex u and minimum degree vertex 𝜐 in N_G(u) 𝜈(G)=k times iteration. For various general and bipartite graphs experimental data, this algorithm can be get the 𝜈(G) exactly.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.10-19
• /
• 2005

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.4
• /
• pp.189-197
• /
• 2003

The problem of designing a parallel feedforward compensator (PFC) is considered for a class of non-square linear systems such that the closed-loop system is strictly passive. If a given square system has (vector) relative degree one and is weakly minimum phase, the system can be rendered passive by a state feedback. However, when the system states are not always measurable and the given output is considered, passivation (i.e. rendering passive) of a non-minimum phase system or a system with high relative degree cannot be achieved by any other methodologies except by using a PFC. To passivate a non-square system we first determine a squaring gain matrix and design a PFC such that the composite system has relative degree one and is minimum phase. Then the system is rendered strictly passvie by a static output feedback law. Necessary and sufficient conditions for the existence of the PFC and the squaring gain matrix are given by the static output feedback formulation, which enables to utilize linear matrix inequality (LMI). As an application of the scheme, an alternative way of replacing the role of velocity measurements is provided for the PD-control law of a convey-crane system.

• Communications of the Korean Mathematical Society
• /
• v.27 no.1
• /
• pp.57-68
• /
• 2012

The commuting graph of an arbitrary ring R, denoted by ${\Gamma}(R)$, is a graph whose vertices are all non-central elements of R, and two distinct vertices a and b are adjacent if and only if ab = ba. In this paper, we investigate the connectivity, the diameter, the maximum degree and the minimum degree of the commuting graph of group ring $Z_nQ_8$. The main result is that $\Gamma(Z_nQ_8)$ is connected if and only if n is not a prime. If $\Gamma(Z_nQ_8)$ is connected, then diam($Z_nQ_8$)= 3, while $\Gamma(Z_nQ_8)$ is disconnected then every connected component of $\Gamma(Z_nQ_8)$ must be a complete graph with a same size. Further, we obtain the degree of every vertex in $\Gamma(Z_nQ_8)$, the maximum degree and the minimum degree of $\Gamma(Z_nQ_8)$.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.27 no.11
• /
• pp.574-580
• /
• 2015

Climatic zone in building code is an administrative district classification reflecting regional climatic characteristics. Use of Degree-Days is a fundamental method that can be used in various building design codes, analysis of building energy performance, and establishment of minimum thermal transmittance of building envelopes. Many foreign countries, such as the USA, the EU, Australia, Italy, India, China, etc., have already adapted climatic zone classification with degree-days, precipitation or amount of water vapor based on the characteristics of their own country's climate. In Korea, however, the minimum requirements for regional thermal transmittance are classified separately for the Jungbu area, Nambu area and Jeju Island with no definite criterion. In this study, degree-days of 255 Korean cities were used for climatic zone classification. Outdoor dry-bulb temperature data from the Korea Meteorological Administration for 1981~2010 was used to calculate degree-days. ArcGIS and the calculated degree-days were utilized to analyze and visualize climatic zone classification. As a result, depending on the distribution and distinctive differences in degree-days, four climatic zones were derived : 1) Central area, 2) Mountain area of Gyeonggi and Gangwon provinces, 3) Southern area, and 4) Jeju Island. The climatic zones were suggested per administrative district for easy public understanding and utilization.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.121-129
• /
• 2013

This paper proposes a linear-time algorithm that has been designed to obtain an accurate solution for Dominating Set (DS) problem, which is known to be NP-complete due to the deficiency of polynomial-time algorithms that successfully derive an accurate solution to it. The proposed algorithm does so by repeatedly assigning vertex v with maximum degree ${\Delta}(G)$among vertices adjacent to the vertex v with minimum degree ${\delta}(G)$ to Minimum Independent DS (MIDS) as its element and removing all the incident edges until no edges remain in the graph. This algorithm finally transforms MIDS into Minimum DS (MDS) and again into Minimum Connected DS (MCDS) so as to obtain the accurate solution to all DS-related problems. When applied to ten different graphs, it has successfully obtained accurate solutions with linear time complexity O(n). It has therefore proven that Dominating Set problem is rather a P-problem.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.7
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.36-40
• /
• 2013

The paper discusses the problem of how to allocate the fund to a large number of individuals in a higher school so as to bring a higher utility return based on the theory of uncertain set. Suppose that experts can assign each invested individual a corresponding nondecreasing membership function on a close interval I according to its actual level and developmental foreground. The membership degree at the fund $x{\in}I$ is called utility degree from fund x, and product (minimum) of utility degrees of distributed funds for all invested individuals is called united utility degree from the fund. Based on the above concepts, we present an uncertain optimization model, called Maximal United Utility Degree (or Maximal Membership Degree) model for fund distribution. Furthermore, we use nondecreasing polygonal functions defined on close intervals to structure a mathematical maximal united utility degree model. Finally, we design a genetic algorithm to solve these models.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.79-79
• /
• 2000

In this Paper, the PC input device using MEMS gyros and accelerometer is newly developed, so that it can measure rotation rate and linear acceleration of the human body in space. In General, the human motion has 6 degree of freedom but 2 degree of freedom is enough PC monitor with 2D display. Therefore the simple method is proposed to achieve minimum degree of freedom. It is also applied to the PC mouse. This method can be expanded to the input device for internet set-top box or internet TV.