• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.73-78
• /
• 2019

This paper proposes polynomial-time rule for maximum weighted independent set(MWIS) problem that is well known NP-hard. The well known distributed algorithm selects the maximum weighted node as a element of independent set in a local. But the merged independent nodes with less weighted nodes have more weights than maximum weighted node are frequently occur. In this case, existing algorithm fails to get the optimal solution. To deal with these problems, this paper constructs maximum weighted independent set in local area. Application result of proposed algorithm to various networks, this algorithm can be get the optimal solution that fail to existing algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.4
• /
• pp.1110-1127
• /
• 2022

To improve the training efficiency and generalization performance of a support vector machine (SVM) in a large-scale set, an optimal SVM learning method based on adaptive sparse sampling and the granularity shift factor is presented. The proposed method combines sampling optimization with learner optimization. First, an adaptive sparse sampling method based on the potential function density clustering is designed to adaptively obtain sparse sampling samples, which can achieve a reduction in the training sample set and effectively approximate the spatial structure distribution of the original sample set. A granularity shift factor method is then constructed to optimize the SVM decision hyperplane, which fully considers the neighborhood information of each granularity region in the sparse sampling set. Experiments on an artificial dataset and three benchmark datasets show that the proposed method can achieve a relatively higher training efficiency, as well as ensure a good generalization performance of the learner. Finally, the effectiveness of the proposed method is verified.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.18 no.4
• /
• pp.287-296
• /
• 2006

In this paper, optimal control strategy of the air-conditioning system with slab thermal storage was investigated based on the optimal control theory. An optimal heat output to the plenum chamber and the air-conditioned room was determined based on two kinds of criterion functions. The first one requires small deviation in room air temperature from a set-point value and low energy consumption. It is shown that the optimized control is to store heat through the whole storage time and to increase storage rate gradually with time. As the second case, a criterion that both a deviation of operative temperature from a set-point temperature and the energy consumption should be minimized was adopted. The room air temperature was a little high and the cooling load during storage time was reduced, compared with the results when a criterion function considering only the room air temperature is used.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.7
• /
• pp.1642-1653
• /
• 1996

This paper covers feature extraction for automatic handwritten signature verification. Several major feature selection techniques are investigated from a practical perspective to realise an optimal signature verification system, and customised feature set selection based on set-on-set distance measurement is presented. The experimental results have proved the proposed methods to be efficient, offering considerably improved verification performance compared to conventional methods. Also, they dramatically reduce the processing complexity in the verification system.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.46.4-46
• /
• 2002

This study was motivated how it might be possible to validate structured sampling with orthogonal array for optimal design of a pin. The Taguchi method by orthogonal array, one of the structured sampling methods, has much advantage that is row cost and time saving for experiments. But this method has been applied in limited areas especially for mechanical problems. In this study, we experimented whether the structured sampling is useful for applying optimal design of mechanical elements. For the experiment, we first set up a mechanical problem which was related to determining optimal parameters associated a pin's crack occurred inside a hole. We, then, calculated combination of...

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.578-583
• /
• 1992

In this paper, we show that various navigation constant values in PNG law can result in as optimal gains when we introduce proper time-varying weighting functions into the cost function of an optimal control problem. we then apply this idea to the guidance problem where we are required to achieve a given impact angle as well as the zero miss distance. As a result, we obtain a set of optimal guidance laws each of which could be related to a navigation constant in PNG. Some basic properties of these guidance laws are also presented.

• Journal of the Korean Society of Safety
• /
• v.8 no.4
• /
• pp.73-81
• /
• 1993

In recent years, mould industry in machining requires to increase machining productivity and to reduce costs, To adapt this trend it is necessary to optimize machine condition, Even though many researches in this area introduced various way to set the optimal condition, still there are not enough. Therefore this research was done to select the optimal cutting condition for industry, and to develop the computer program to select the optimal cutting condition automatically. The result of this research will contribute to increase machining productivity of various mould companies with the automatic selection of optimal cutting condition.

• Journal of KIISE:Software and Applications
• /
• v.29 no.6
• /
• pp.396-406
• /
• 2002

On the whole, the simple GAs with just one population set is effective in finding one optimal solution. However, many real world problems have a lot of optimal solutions, and often it is important to find all of them. In this paper, we propose a GA that has a population set containing multiple optimal solutions. In the proposed GA, each of the individuals in population set has its own geological neighbors, and they exchange their genes globally as well as compete with others locally. The paper then evaluates the proposed GA along with many multimodal problems including a 30bit, order-six bipolar-deceptive function. Finally, we present some improvement directions of the proposed GA.

• Journal of Power Electronics
• /
• v.12 no.1
• /
• pp.104-112
• /
• 2012

In this paper a new method for the design of a simple PI controller is presented and it has been applied in the control of a Boost based PFC rectifier. The Strength Pareto evolutionary algorithm, which is based on the Pareto Optimality concept, used in Game theory literature is implemented as a multi-objective optimization approach to gain a good transient response and a high quality input current. In the proposed method, the input current harmonics and the dynamic response have been assumed as objective functions, while the PI controller's gains of the PFC rectifier (Kpi, Tpi) are design variables. The proposed algorithm generates a set of optimal gains called a Pareto Set corresponding to a Pareto Front, which is a set of optimal results for the objective functions. All of the Pareto Front points are optimum, but according to the design priority objective function, each one can be selected. Simulation and experimental results are presented to prove the superiority of the proposed design methodology over other methods.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.237-242
• /
• 2002

The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. To cope with this problem, this paper deals with the development of an agent for selecting an optimal order set automatically. The main engine of selection agent is based on the typical job-shop scheduling model since our target domain is the injection molding company. To solve the problem, we have formulated it as IP (Integer Program) model, and it has been successfully implemented by ILOG and selection agent. And we have suggested an architecture of an agent for tackling web based order selection problems.