• 대한산업공학회지
• /
• 제20권4호
• /
• pp.65-72
• /
• 1994

An independent set of nodes is a set of nodes no two of which are joined by an edge. An independent set is called maximal if no more nodes can be added to the set without destroying its independence. The greatest number of maximal independent set is the maximum possible number of maximal independent set of a graph. We consider the greatest number of maximal independent set in connected graphs with fixed numbers of edges and nodes. For arbitrary number of nodes with a certain class of number of edges, we present the connected graphs with the greatest number of maximal independent set. For a given class of number of edges, the structure of graphs with the greatest number of maximal independent set is that the two components are completely joined; one consists of disjoint triangles as many as possible and the other is the complete graph with remaining nodes.

• 호남수학학술지
• /
• 제43권1호
• /
• pp.17-25
• /
• 2021

A set D ⊆ V (G) is an independent transversal dominating set of G if D is a dominating set and also intersects every maximum independent set in G. The minimum cardinality of such a set is equal to the transversal domination number, denoted by ��it(G). This paper is devoted to the computation of the independent transversal domination number of some complementary prism.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집B
• /
• pp.488-494
• /
• 2001

Many literatures, so far, have concentrated on approaches employing dependent coordinates set resulting in computational burden of constraint forces, which is needless in many cases. Some researchers developed methods to remove or calculate it efficiently. But systematic generation of the motion equation using independent coordinates set by Kane's equation is possible for any closed loop system. Independent velocity transformation method builds the smallest size of motion equation, but needs practically more complicated code implementation. In this study, dependent velocity matrix is systematically transformed into independent one using dependent-independent transformation matrix of each body group, and then motion equation free of constraint force is constructed. This method is compared with the other approach by counting the number of multiplications for car model with 15 d.o.f..

• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.77-92
• /
• 2005

An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.

• 대한수학회논문집
• /
• 제18권1호
• /
• pp.181-192
• /
• 2003

We count the numbers of independent dominating sets of rooted labeled trees, ordinary labeled trees, and recursive trees, respectively.

• 한국인터넷방송통신학회논문지
• /
• 제19권5호
• /
• pp.73-78
• /
• 2019

본 논문은 NP-난제로 널리 알려진 최대 가중치 독립집합 문제에 대해 다항시간으로 풀 수 있는 규칙을 제시하였다. 기존에 알려진 분산형 알고리즘은 지역에서 최대 가중치 노드를 독립집합 원소로 결정하는 방법을 적용하였다. 그러나 지역에서 최대 가중치를 갖는 노드 단독이 아닌 보다 작은 가중치들을 갖는 노드들이 병합된 독립집합이 최대 가중치를 갖는 경우가 보다 빈번히 발생하여 기존에 알려진 방법으로는 최적 해를 구하지 못할 수도 있다. 이러한 문제점을 해결하기 위해, 본 논문에서는 지역에서 최대 가중치를 갖는 독립집합을 형성하는 방법을 제안하였다. 제안된 알고리즘을 다양한 망들에 적용한 결과, 기존에 알려진 알고리즘으로 구하지 못한 최적 해를 구할 수 있었다.

• 한국지열·수열에너지학회논문집
• /
• 제13권3호
• /
• pp.9-15
• /
• 2017

In this study, set values of PICV(Pressure Independent Control Valve) were simulated according to the pressure distribution and velocity. The higher the set value and the open rate, as the lower the pressure in the neck. On the contrary, the lower the set value and open rate, as the higher the pressure in the neck. When the set value was small, the pressure was distributed sufficiently and confirmed that the pressure was generated by the VOF, confirming that it could generate a vapor pressure. When the set value 100 %, the lower corn open rate of the differential pressure was 46 % to 29 %, set value 100 % was 29 % to 19 %, and set value 6 % was 12 % to 6 % for the lower corn open rate percentile, it was limited to within 50 %. Thus, the results of this study on the correlation between open rate and differential pressure of the set value of the PICV will be beneficial to improve performance of flow control valves and contribute to their efficient operation used for a hydronic system.

• 대한산업공학회지
• /
• 제33권4호
• /
• pp.447-456
• /
• 2007

The ant colony optimization (ACO) is a probabilistic Meta-heuristic algorithm which has been developed in recent years. Originally ACO was used for solving the well-known Traveling Salesperson Problem. More recently, ACO has been used to solve many difficult problems. In this paper, we develop an ant colony optimization method to solve the maximum independent set problem, which is known to be NP-hard. In this paper, we suggest a new method for local information of ACO. Parameters of the ACO algorithm are tuned by evolutionary operations which have been used in forecasting and time series analysis. To show the performance of the ACO algorithm, the set of instances from discrete mathematics and computer science (DIMACS)benchmark graphs are tested, and computational results are compared with a previously developed ACO algorithm and other heuristic algorithms.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.639-647
• /
• 2005

We count the number of maximal independent sets of binary trees and planted plane trees.

• The Journal of the Acoustical Society of Korea
• /
• 제20권2E호
• /
• pp.17-24
• /
• 2001

In this paper, we propose the bootstrap and aggregating (bagging) vector quantization (VQ) classifier to improve the performance of the text-independent speaker recognition system. This method generates multiple training data sets by resampling the original training data set, constructs the corresponding VQ classifiers, and then integrates the multiple VQ classifiers into a single classifier by voting. The bagging method has been proven to greatly improve the performance of unstable classifiers. Through two different experiments, this paper shows that the VQ classifier is unstable. In one of these experiments, the bias and variance of a VQ classifier are computed with a waveform database. The variance of the VQ classifier is compared with that of the classification and regression tree (CART) classifier[1]. The variance of the VQ classifier is shown to be as large as that of the CART classifier. The other experiment involves speaker recognition. The speaker recognition rates vary significantly by the minor changes in the training data set. The speaker recognition experiments involving a closed set, text-independent and speaker identification are performed with the TIMIT database to compare the performance of the bagging VQ classifier with that of the conventional VQ classifier. The bagging VQ classifier yields improved performance over the conventional VQ classifier. It also outperforms the conventional VQ classifier in small training data set problems.