• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.217-229
• /
• 2007

In this paper, Genetic Algorithm (GA) is used to find the Maximum Weight Independent Set (MWIS) of a graph. First, MWIS problem is formulated as a 0-1 integer programming optimization problem with linear objective function and a single quadratic constraint. Then GA is implemented with the help of this formulation. Since GA is a heuristic search method, exact solution is not reached in every run. Though the suboptimal solution obtained is very near to the exact one. Computational result comprising an average performance is also presented here.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.4
• /
• pp.171-176
• /
• 2020

This paper proposes polynomial-time algorithm for maximum weighted independent set(MWIS) problem that is well known as NP-hard. The known algorithms for MWIS problem are polynomial-time to specialized in particular graph type, distributed, or clustering method. But there is no unified algorithm is suitable to all kinds of graph types. Therefore, this paper suggests unique polynomial-time algorithm that is suitable to all kinds of graph types. The proposed algorithm merges the maximum weighted vertex v_i and maximum weighted vertex v_j that is not adjacent to v_i. As a result of apply to undirected graphs and trees, this algorithm can be get the optimal solution. This algorithm improves previously known solution to new optimal solution.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.38 no.2
• /
• pp.145-153
• /
• 2001

As combinational ATPG algorithms achieve effectively 100% fault coverage, reducing the length of test set without loosing its fault coverage becomes a challenging work. The new approach is based on the independent and the compatible relationships between faults. For more compact test set, the size of compatible fault set must be maximized, thus this algorithm generates fault-pattern pairs, and a fault-pattern pair tree structure using the independent and the compatible relationships between faults. With the fault-pattern pair tree structure, a compact test set effectively generated. The experimental results for ISCAS 85 and 89 benchmark circuits demonstrate the effectiveness of the proposed method.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11
• /
• pp.3408-3416
• /
• 2000

This paper proposes an efficient method for improving the performance of a general regression neural network by using the feature to the independent variables as the center for partern-layer neurons. The adaptive principal component analysis is applied for extracting, efficiently the fcarures by reducing the dimension of given independent variables. In can acluevc a supertor property of the principal component analysis that converts input data into set of statistically independent features and the general regression neuralnetwork, espedtively. The proposed general regression neural network has been applied to regress the Solow's economy(2-independent variable set) and the wie elephone(1-independent vanable set). The simulation results show that the proposed meural networks have better performances of the regressionfor the lest data, in comparison with those using the means or the weighted means of independent variables. Also,it is affected less by the number of neurons and the scope of the smoothing factor.

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

Let N denote the set of positive integers. Fix $d_1, d_2 \in N with d = d_1 + d_2$. Let X and Y be real random variables and let ${X_i : i \in N^d_1} and {Y_j : j \in N^d_2}$ be independent families of independent identically distributed random variables with $L(X) = L(X_i) and L(Y) = L(Y_j)$, where $L(\cdot)$ denote the law of $\cdot$.

• Communications of the Korean Mathematical Society
• /
• v.32 no.4
• /
• pp.1077-1097
• /
• 2017

In this research article, we introduce certain concepts, including domination, total domination, strong domination, weak domination, edge domination and total edge domination in m-polar fuzzy graphs. We describe these concepts by several examples. We investigate some related properties of certain dominations in m-polar fuzzy graphs. We also present a decision making method based on domination in m-polar fuzzy graphs.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.16.1-16
• /
• 2003

A subset S of vertices of a graph G is independent if no two vertices of S are adjacent by an edge in G. Also we say that S is maximal independent if it is contained In no larger independent set in G. A planted plane tree is a tree that is embedded in the plane and rooted at an end-vertex. A (k＋1) -valent tree is a planted plane tree in which each vertex has degree one or (k＋1). We classify maximal independent sets of (k＋1) -valent trees into two groups, namely, type A and type B maximal independent sets and consider specific independent sets of these trees. We study relations among these three types of independent sets. Using the relations, we count the number of all maximal independent sets of (k＋1) -valent trees with n vertices of degree (k＋1).

• Structural Engineering and Mechanics
• /
• v.39 no.5
• /
• pp.703-716
• /
• 2011

The accurate dynamic analysis of structures is usually performed by a fine finite element discretization with very large number of degrees of freedom. Apart from modal analysis, one can reduce the number of final equations by assuming the deformed shape of the structure as a linear combination of independent Ritz vectors. The efficiency of this method relies heavily on the vectors selected. In this paper, a new set of Ritz vectors is proposed. It is primarily proved that these vectors are linearly independent. Subsequently, various two and three-dimensional examples are analyzed based on the proposed method. In each case, the results are compared with the ones obtained based on usual Ritz and modal analysis methods. It is finally concluded that the proposed method is very effective and efficient method for dynamic analysis of structures in frequency domain.

• Journal of Information Technology Applications and Management
• /
• v.27 no.5
• /
• pp.23-33
• /
• 2020

As the 4G and 5G Internet technologies become more common and developed, an environment for uploading and watching videos is created and spread, in addition to simply uploading posts. Watching and sharing daily life among media contents called Vlog, are very common more than ever. This means that individual users could access Vlog easily and the situation could be new trend. Additionally, academic research about Volg is increasing. We analyzed three independent variables affecting a perceived enjoyment we set up the dependent variable. Information search, self-expression, and social need are set as independent variables and social interaction is set as the control variable. Information search and self-expression are significant effect to perceived enjoyment except social need. In particular, social interaction as a control variable has effect to all relationships.

• Kyungpook Mathematical Journal
• /
• v.54 no.4
• /
• pp.545-554
• /
• 2014

We provide a new Ostrowski-type inequality involving functions of two independent variables, as well as some related results.