• Journal of Practical Engineering Education
• /
• v.13 no.2
• /
• pp.233-242
• /
• 2021

In this paper, as a liberal arts course for non-majors, we proposed a supervised learning artificial neural network parameter optimization method and a basic education method for activation function to design a basic artificial neural network subject curriculum. For this, a method of finding a parameter optimization solution in a spreadsheet without programming was applied. Through this training method, you can focus on the basic principles of artificial neural network operation and implementation. And, it is possible to increase the interest and educational effect of non-majors through the visualized data of the spreadsheet. The proposed contents consisted of artificial neurons with sigmoid and ReLU activation functions, supervised learning data generation, supervised learning artificial neural network configuration and parameter optimization, supervised learning artificial neural network implementation and performance analysis using spreadsheets, and education satisfaction analysis. In this paper, considering the optimization of negative parameters for the sigmoid neural network and the ReLU neuron artificial neural network, we propose a training method for the four performance analysis results on the parameter optimization of the artificial neural network, and conduct a training satisfaction analysis.

• Journal of Mechanical Science and Technology
• /
• v.16 no.8
• /
• pp.1033-1038
• /
• 2002

Genetic alsorithm (GA) , compared to the gradient-based optimization, has advantages of convergence to a global optimized solution. The genetic algorithm requires so many number of analyses that may cause high computational cost for genetic search. This paper proposes a personal computer network programming based on TCP/IP protocol and client-server model using socket, to improve processing speed of the genetic algorithm for optimization of composite laminated structures. By distributed processing for the generated population, improvement in processing speed has been obtained. Consequently, usage of network-based genetic algorithm with the faster network communication speed will be a very valuable tool for the discrete optimization of large scale and complex structures requiring high computational cost.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.7
• /
• pp.1802-1814
• /
• 2012

In order to guide users to select the most optimal access network in heterogeneous wireless networks, a network selection algorithm is proposed which is designed based on multi-objective discrete particle swarm optimization (Multi-Objective Discrete Particle Swarm Optimization, MODPSO). The proposed algorithm keeps fast convergence speed and strong adaptability features of the particle swarm optimization. In addition, it updates an elite set to achieve multi-objective decision-making. Meanwhile, a mutation operator is adopted to make the algorithm converge to the global optimal. Simulation results show that compared to the single-objective algorithm, the proposed algorithm can obtain the optimal combination performance and take into account both the network state and the user preferences.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.961-967
• /
• 2008

Congestion control is one of major mechanisms to avoid dropped packets. Many researchers use optimization theories to find an efficient way to reduce congestion in networks, but they do not consider robustness that may lead to unstable network utilities. This paper proposes a new methodology in order to solve a congestion control problem for wired networks by using a robust design principle. In our particular numerical example, the proposed method provides robust solutions that guarantee high and stable network utilities.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.327-338
• /
• 2011

With the incitation to reduce power consumption and the aggressive reuse of spectral resources, there is an inevitable trend towards the deployment of small-cell networks by decomposing a traditional single-tier network into a multi-tier network with very high throughput per network area. However, this cell size reduction increases the complexity of network operation and the severity of cross-tier interference. In this paper, we consider a downlink two-tier network comprising of a multiple-antenna macrocell base station and a single femtocell access point, each serving multiples users with a single antenna. In this scenario, we treat the following beamforming optimization problems: i) Total transmit power minimization problem; ii) mean-square error balancing problem; and iii) interference power minimization problem. In the presence of perfect channel state information (CSI), we formulate the optimization algorithms in a centralized manner and determine the optimal beamformers using standard convex optimization techniques. In addition, we propose semi-decentralized algorithms to overcome the drawback of centralized design by introducing the signal-to-leakage plus noise ratio criteria. Taking into account imperfect CSI for both centralized and semi-decentralized approaches, we also propose robust algorithms tailored by the worst-case design to mitigate the effect of channel uncertainty. Finally, numerical results are presented to validate our proposed algorithms.

• The KIPS Transactions:PartB
• /
• v.14B no.5
• /
• pp.377-382
• /
• 2007

This paper proposes a training algorithm for global optimization of the parameters of radial basis function networks. Since conventional training algorithms usually perform only local optimization, the performance of the network is limited and the final network significantly depends on the initial network parameters. The proposed hybrid simulated annealing algorithm performs global optimization of the network parameters by combining global search capability of simulated annealing and local optimization capability of gradient-based algorithms. Via experiments for function approximation problems, we demonstrate that the proposed algorithm can find networks showing better training and test performance and reduce effects of the initial network parameters on the final results.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.11
• /
• pp.2108-2116
• /
• 2008

The paper concerns Fuzzy C-Means clustering based Radial Basis Function neural networks (FCM-RBFNN) and the optimization of the network is carried out by means of Particle Swarm Optimization(PSO). FCM-RBFNN is the extended architecture of Radial Basis Function Neural Network(RBFNN). In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values directly rely on the computation of the relevant distance between data points by means of FCM. Also, as the consequent part of fuzzy rules extracted by the FCM - RBFNN model, the order of four types of polynomials can be considered such as constant, linear, quadratic and modified quadratic. Weighted Least Square Estimator(WLSE) are used to estimates the coefficients of polynomial. Since the performance of FCM-RBFNN is affected by some parameters of FCM-RBFNN such as a specific subset of input variables, fuzzification coefficient of FCM, the number of rules and the order of polynomials of consequent part of fuzzy rule, we need the structural as well as parametric optimization of the network. In this study, the PSO is exploited to carry out the structural as well as parametric optimization of FCM-RBFNN. Moreover The proposed model is demonstrated with the use of numerical example and gas furnace data set.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.131-138
• /
• 2022

A Mobile Ad-hoc Network (MANET) is a collection of moving nodes that communicate and collaborate without relying on a pre-existing infrastructure. In this type of network, nodes can freely move in any direction. Routing in this sort of network has always been problematic because of the mobility of nodes. Most existing protocols use simple routing algorithms and criteria, while another important criterion is path selection. The existing protocols should be optimized to resolve these deficiencies. 'Particle Swarm Optimization (PSO)' is an influenced method as it resembles the social behavior of a flock of birds. Genetic algorithms (GA) are search algorithms that use natural selection and genetic principles. This paper applies these optimization models to the OLSR routing protocol and compares their performances across different metrics and varying node sizes. The experimental analysis shows that the Genetic Algorithm is better compared to PSO. The comparison was carried out with the help of the simulation tool NS2, NAM (Network Animator), and xgraph, which was used to create the graphs from the trace files.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.377-382
• /
• 2004

This paper presents a novel optimization method for the air- and gas-supplying network comprised of several air compression systems and air and gas streams in an industrial chemical plant. The optimization is based on the hybrid model developed by Han and $Han^1$ for predicting the power consumption of a compression system. A constrained optimization problem was formulated to minimize the total electric power consumption of all the compression systems in the air- and gas-supplying network under various operating constraints and was solved using a successive quadratic optimization algorithm. The optimization approach was applied to an industrial terephthalic acid manufacturing plant to achieve about 10% reduction in the total electric power consumption under varying ambient conditions.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.175-178
• /
• 2003

In recent years, several researchers have presented the extensive research reports on network optimization problems. In our real life applications, many important network problems are typically formulated as a Maximum flow model (MXF) or a Minimum Cost flow model (MCF). In this paper, we propose a Genetic Algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including MXF and MCF models(MXF/MCF).