• 대한수학회논문집
• /
• 제23권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.

• 한국인터넷방송통신학회논문지
• /
• 제22권5호
• /
• pp.1-6
• /
• 2022

본 논문은 최대 매칭 문제(MCM)를 다루었다. MCM은 일반적으로 증대경로 기법으로 구한다. 일반 그래프에 대한 MCM을 구하는 증대경로 알고리즘으로는 $O({\sqrt{n}}m)$ 복잡도, 이분 그래프에 대해서는 O(m log n) 복잡도를 갖고 있다. 반면에, 본 논문에서는 주어진 그래프가 일반 그래프나 이분그래프의 그래프 종류에 상관없이 항상 O(n) 복잡도로 MCM을 구하는 알고리즘을 제안하였다. 제안된 알고리즘은 "최대 매칭을 구하기 위해서는 가능한 많은 정점 쌍의 간선을 선택해야만 한다."는 기본 원리에 근거하여 최소차수 정점 u와 N_G(u)들 중 최소차수 정점 𝜐간 간선 {u,𝜐}를 𝜈(G)=k회 단순히 선택하는 간단한 방법이다. 제안된 알고리즘을 일반그래프와 이분그래프의 다양한 실험 데이터들에 적용한 결과 𝜈(G)를 정확하게 구할 수 있음을 보였다.

• 대한산업공학회지
• /
• 제31권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.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권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.

• 대한수학회논문집
• /
• 제27권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)$.

• 설비공학논문집
• /
• 제27권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.

• 한국컴퓨터정보학회논문지
• /
• 제18권9호
• /
• pp.121-129
• /
• 2013

본 논문은 아직까지 정확한 해를 다항시간으로 구하는 알고리즘이 존재하지 않아 NP-완전 문제로 알려진 지배집합 (DS) 문제의 정확한 해를 선형시간으로 구하는 알고리즘을 제안하였다. 제안된 알고리즘은 그래프의 간선이 존재하지 않을 때까지 최소차수 ${\delta}(G)$를 가진 정점 u의 인접정점들 중 최대차수 ${\Delta}(G)$를 가진 정점 v를 최소 독립지배집합(MIDS)의 원소로 포함시키고 v의 부속 간선을 삭제하는 방법을 반복적으로 수행하여 구하였다. MIDS로부터 최소 지배집합 (MDS)으로 변환시키고, MDS로부터 최소연결 DS (MCDS)로 변환시키는 방법으로 DS 관련 모든 문제의 정확한 해를 구할 수 있었다. 제안된 알고리즘을 10개의 다양한 그래프에 적용한 결과 정확한 해를 선형 시간복잡도 O(n)으로 구하는데 성공하였다. 결국, 제안된 지배집합 알고리즘은 지배집합 문제가 P-문제임을 증명하였다.

• 한국컴퓨터정보학회논문지
• /
• 제20권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
• /
• 제12권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년도 제15차 학술회의논문집
• /
• 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.