• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

• Science of Emotion and Sensibility
• /
• v.13 no.4
• /
• pp.711-720
• /
• 2010

This study is aimed to compare choices on interaction problems, and to consider the reason of the choices. It was expected that the interaction problems are influenced from national culture, age, gender and so on. The first interaction problem in this study is default answer button when user operates to delete all messages on SMS in-box. Second one is action when pop-p window warning dangerousness of install showed on web browsing. The third one is type(analog/digital) and information expression of control panel on soup maker. 639 Korean data and 784 data from China, Japan and the Netherlands are analyzed through cross-tabulation and chi-square test. In the results, many Japanese choose 'No' answer at SMS delete problem, while many Dutch choose 'Yes'. The result suggests that uncertainty avoidance effect on interaction problems. On warning pop-up, Younger generation and men choose actively 'install' than older one and women. On type of control panel, Dutch subjects preferred analog type than other countries' subjects. On expression of control panel, older generation and individualistic subjects relatively preferred text style than other style.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.12
• /
• pp.1772-1781
• /
• 2017

In this study, the design methodology for alleviating the overfitting problem of Polynomial Neural Networks(PNN) is realized with the aid of two kinds techniques such as L2 regularization and Sum of Squared Coefficients (SSC). The PNN is widely used as a kind of mathematical modeling methods such as the identification of linear system by input/output data and the regression analysis modeling method for prediction problem. PNN is an algorithm that obtains preferred network structure by generating consecutive layers as well as nodes by using a multivariate polynomial subexpression. It has much fewer nodes and more flexible adaptability than existing neural network algorithms. However, such algorithms lead to overfitting problems due to noise sensitivity as well as excessive trainning while generation of successive network layers. To alleviate such overfitting problem and also effectively design its ensuing deep network structure, two techniques are introduced. That is we use the two techniques of both SSC(Sum of Squared Coefficients) and $L_2$ regularization for consecutive generation of each layer's nodes as well as each layer in order to construct the deep PNN structure. The technique of $L_2$ regularization is used for the minimum coefficient estimation by adding penalty term to cost function. $L_2$ regularization is a kind of representative methods of reducing the influence of noise by flattening the solution space and also lessening coefficient size. The technique for the SSC is implemented for the minimization of Sum of Squared Coefficients of polynomial instead of using the square of errors. In the sequel, the overfitting problem of the deep PNN structure is stabilized by the proposed method. This study leads to the possibility of deep network structure design as well as big data processing and also the superiority of the network performance through experiments is shown.

• Journal of Korea Multimedia Society
• /
• v.23 no.7
• /
• pp.850-861
• /
• 2020

Hangul is a language that is composed of initial, medial, and final syllables. It has 11,172 characters. For this reason, the current method of designing all the characters by hand is very expensive and time-consuming. In order to solve the problem, this paper proposes an automatic Hangul font generation system and evaluates the standards for mapping Hangul characters to produce an effective automated Hangul font generation system. The system was implemented using character generation engine based on deep learning CycleGAN. In order to evaluate the criteria when mapping characters in pairs, each criterion was designed based on Hangul structure and character shape, and the quality of the generated characters was evaluated. As a result of the evaluation, the standards designed based on the Hangul structure did not affect the quality of the automated Hangul font generation system. On the other hand, when tried with similar characters, the standards made based on the shape of Hangul characters produced better quality characters than when tried with less similar characters. As a result, it is better to generate automated Hangul font by designing a learning method based on mapping characters in pairs that have similar character shapes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.513-518
• /
• 2016

This paper presents a fast 3D mesh generation method using projection for line laser-based 3D scanners. The well-known method for 3D mesh generation utilizes convex hulls for 4D vertices that is converted from the input 3D vertices. This 3D mesh generation for a large set of vertices requires a lot of time. To overcome this problem, the proposed method takes (${\theta}-y$) 2D depth map into account. The 2D depth map is a projection version of 3D data with a form of (${\theta}$, y, z) which are intermediately acquired by line laser-based 3D scanners. Thus, our 2D-based method is a very fast 3D mesh generation method. To evaluate our method, we conduct experiments with intermediate 3D vertex data from line-laser scanners. Experimental results show that the proposed method is superior to the existing method in terms of mesh generation speed.

• Journal of the military operations research society of Korea
• /
• v.12 no.2
• /
• pp.1-21
• /
• 1986

Data Security in computer communication is becoming serious problem with developing computer network. This paper intended to design an encryption system to improve processing speed and to get higher degree of security by combining random number generation method, substitution method and Vernam's encryption method.

• Proceedings of the KIEE Conference
• /
• 2008.11b
• /
• pp.98-99
• /
• 2008

The first swing instability is the very important problem in power system operation. In this paper, the effective countermeasures to the instability. We studied the reinforcement of the transmission lines, generation tripping and reactive compensation are considered as alternative to improve transient stability.

• Proceedings of the KIEE Conference
• /
• 2006.07c
• /
• pp.1735-1736
• /
• 2006

As developing the information society, Lighting Emitted diode(LED) which is light source for illumination of next generation is attracted public attention. LED have many problem as narrow light view angle, high price, drift phenomenon of color coordinate, high heating problem for lower power, lower weight and small size. So, many researches have continued in a illumination as LED module type. in this problem, heating problem is very important and difficult and that is caused in decreasing phenomenon of brightness and drift phenomenon of color coordinate. so the problem of heating is urgent question for illumination of LED. In this paper, structural design of PCB changed as two type for solving the heating problem. also the properties of heating is analysed and optical properties is measured with heating image camera and spectrometer according to change in this design.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.423-432
• /
• 2014

Non-dominated Sorting Genetic Algorithm-II (NSGA-II) is applied for solving Combined Economic Emission Dispatch (CEED) problem with valve-point loading of thermal generators. This CEED problem with valve-point loading is a nonlinear, constrained multi-objective optimization problem, with power balance and generator capacity constraints. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED problem as a nonsmooth optimization problem. To validate its effectiveness of NSGA-II, two benchmark test systems, IEEE 30-bus and IEEE 118-bus systems are considered. To compare the Pareto-front obtained using NSGA-II, reference Pareto-front is generated using multiple runs of Real Coded Genetic Algorithm (RCGA) with weighted sum of objectives. Comparison with other optimization techniques showed the superiority of the NSGA-II approach and confirmed its potential for solving the CEED problem. Numerical results show that NSGA-II algorithm can provide Pareto-front in a single run with good diversity and convergence. An approach based on Technique for Ordering Preferences by Similarity to Ideal Solution (TOPSIS) is applied on non-dominated solutions obtained to determine Best Compromise Solution (BCS).

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.175-182
• /
• 2021

Deadlock is a situation in which two or more processes competing for resources are waiting for the others to finish, and neither ever does. There are two different forms of systems, multi-unit and single-unit resource systems. The difference is the number of instances (or units) of each type of resource. Deadlock problem can be modeled as a constrained combinatorial problem that seeks to find a possible scheduling for the processes through which the system can avoid entering a deadlock state. To solve deadlock problem, several algorithms and techniques have been introduced, but the use of metaheuristics is one of the powerful methods to solve it. Genetic algorithms have been effective in solving many optimization issues, including deadlock Problem. In this paper, an improved parallel framework of the genetic algorithm is introduced and adapted effectively and efficiently to deadlock problem. The proposed modified method is implemented in java and tested on a specific dataset. The experiment shows that proposed approach can produce optimal solutions in terms of burst time and the number of feasible solutions in each advanced generation. Further, the proposed approach enables all types of crossovers to work with high performance.