• Title/Summary/Keyword: network optimization

Search Result 2,239, Processing Time 0.028 seconds

Finite element computer simulation of twinning caused by plastic deformation of sheet metal

  • Fuyuan Dong;Wang Xu;Zhengnan Wu;Junfeng Hou
    • Steel and Composite Structures
    • /
    • v.47 no.5
    • /
    • pp.601-613
    • /
    • 2023
  • Numerous methods have been proposed in predicting formability of sheet metals based on microstructural and macro-scale properties of sheets. However, there are limited number of papers on the optimization problem to increase formability of sheet metals. In the present study, we aim to use novel optimization algorithms in neural networks to maximize the formability of sheet metals based on tensile curve and texture of aluminum sheet metals. In this regard, experimental and numerical evaluations of effects of texture and tensile properties are conducted. The texture effects evaluation is performed using Taylor homogenization method. The data obtained from these evaluations are gathered and utilized to train and validate an artificial neural network (ANN) with different optimization methods. Several optimization method including grey wolf algorithm (GWA), chimp optimization algorithm (ChOA) and whale optimization algorithm (WOA) are engaged in the optimization problems. The results demonstrated that in aluminum alloys the most preferable texture is cube texture for the most formable sheets. On the other hand, slight differences in the tensile behavior of the aluminum sheets in other similar conditions impose no significant decreases in the forming limit diagram under stretch loading conditions.

Balancing Energy and Memory Consumption for Lifetime Increase of Wireless Sensor Network (무선 센서 네트워크의 수명 연장을 위한 에너지와 메모리의 균형 있는 소모 방법)

  • Kim, Tae-Rim
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.9 no.6
    • /
    • pp.361-367
    • /
    • 2014
  • This paper introduces balancing energy and memory consumption for lifetime increase of wireless sensor network. In cluster-based wireless sensor network, sensor nodes adjacent of cluster heads have a tendency to deplete their own battery energy and cluster heads occupy memory space significantly. If the nodes close to region where events occur frequently consume their energy and memory fully, network might be destroyed even though most of nodes are still alive. Therefore, it needs to balance network energy and memory with consideration of event occurrence probability so that network lifetime is increased. We show a method of balancing wireless sensor network energy and memory to organize cluster groups and elect cluster heads in terms of event occurrence probability.

Optimization of Cyber-Attack Detection Using the Deep Learning Network

  • Duong, Lai Van
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.7
    • /
    • pp.159-168
    • /
    • 2021
  • Detecting cyber-attacks using machine learning or deep learning is being studied and applied widely in network intrusion detection systems. We noticed that the application of deep learning algorithms yielded many good results. However, because each deep learning model has different architecture and characteristics with certain advantages and disadvantages, so those deep learning models are only suitable for specific datasets or features. In this paper, in order to optimize the process of detecting cyber-attacks, we propose the idea of building a new deep learning network model based on the association and combination of individual deep learning models. In particular, based on the architecture of 2 deep learning models: Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM), we combine them into a combined deep learning network for detecting cyber-attacks based on network traffic. The experimental results in Section IV.D have demonstrated that our proposal using the CNN-LSTM deep learning model for detecting cyber-attacks based on network traffic is completely correct because the results of this model are much better than some individual deep learning models on all measures.

Network traffic prediction model based on linear and nonlinear model combination

  • Lian Lian
    • ETRI Journal
    • /
    • v.46 no.3
    • /
    • pp.461-472
    • /
    • 2024
  • We propose a network traffic prediction model based on linear and nonlinear model combination. Network traffic is modeled by an autoregressive moving average model, and the error between the measured and predicted network traffic values is obtained. Then, an echo state network is used to fit the prediction error with nonlinear components. In addition, an improved slime mold algorithm is proposed for reservoir parameter optimization of the echo state network, further improving the regression performance. The predictions of the linear (autoregressive moving average) and nonlinear (echo state network) models are added to obtain the final prediction. Compared with other prediction models, test results on two network traffic datasets from mobile and fixed networks show that the proposed prediction model has a smaller error and difference measures. In addition, the coefficient of determination and index of agreement is close to 1, indicating a better data fitting performance. Although the proposed prediction model has a slight increase in time complexity for training and prediction compared with some models, it shows practical applicability.

QoS Constrained Optimization of Cell Association and Resource Allocation for Load Balancing in Downlink Heterogeneous Cellular Networks

  • Su, Gongchao;Chen, Bin;Lin, Xiaohui;Wang, Hui;Li, Lemin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1569-1586
    • /
    • 2015
  • This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem with cardinality constraints. A reweighted heuristic l1-norm regularization method is used to obtain a sparse solution to the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for users.

Design of Particle Swarm Optimization-based Polynomial Neural Networks (입자 군집 최적화 알고리즘 기반 다항식 신경회로망의 설계)

  • Park, Ho-Sung;Kim, Ki-Sang;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.2
    • /
    • pp.398-406
    • /
    • 2011
  • In this paper, we introduce a new architecture of PSO-based Polynomial Neural Networks (PNN) and discuss its comprehensive design methodology. The conventional PNN is based on a extended Group Method of Data Handling (GMDH) method, and utilized the polynomial order (viz. linear, quadratic, and modified quadratic) as well as the number of node inputs fixed (selected in advance by designer) at Polynomial Neurons located in each layer through a growth process of the network. Moreover it does not guarantee that the conventional PNN generated through learning results in the optimal network architecture. The PSO-based PNN results in a structurally optimized structure and comes with a higher level of flexibility that the one encountered in the conventional PNN. The PSO-based design procedure being applied at each layer of PNN leads to the selection of preferred PNs with specific local characteristics (such as the number of input variables, input variables, and the order of the polynomial) available within the PNN. In the sequel, two general optimization mechanisms of the PSO-based PNN are explored: the structural optimization is realized via PSO whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the PSO-based PNN, the model is experimented with using Gas furnace process data, and pH neutralization process data. For the characteristic analysis of the given entire data with non-linearity and the construction of efficient model, the given entire system data is partitioned into two type such as Division I(Training dataset and Testing dataset) and Division II(Training dataset, Validation dataset, and Testing dataset). A comparative analysis shows that the proposed PSO-based PNN is model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

Dynamic Analysis and Structural Optimization of a Fiber Optic Sensor Using Neural Networks

  • Kim Yong-Yook;Kapania Rakesh K.;Johnson Eric R.;Palmer Matthew E.;Kwon Tae-Kyu;Hong Chul-Un;Kim Nam-Gyun
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.2
    • /
    • pp.251-261
    • /
    • 2006
  • The objective of this work is to apply artificial neural networks for solving inverse problems in the structural optimization of a fiber optic pressure sensor. For the sensor under investigation to achieve a desired accuracy, the change in the distance between the tips of the two fibers due to the applied pressure should not interfere with the phase change due to the change in the density of the air between the two fibers. Therefore, accurate dynamic analysis and structural optimization of the sensor is essential to ensure the accuracy of the measurements provided by the sensor. To this end, a normal mode analysis and a transient response analysis of the sensor were performed by combining commercial finite element analysis package, MSC/NASTRAN, and MATLAB. Furthermore, a parametric study on the design of the sensor was performed to minimize the size of the sensor while fulfilling a number of constraints. In performing the parametric study, the need for a relationship between the design parameters and the response of the sensor was fulfilled by using a neural network. The whole process of the dynamic analysis using commercial finite element analysis package and the parameter optimization of the sensor were automated within the MATLAB environment.

Optimization Algorithm for Energy-aware Routing in Networks with Bundled Links (번들 링크를 가진 네트워크에서 에너지 인식 라우팅을 위한 최적화 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.4
    • /
    • pp.572-580
    • /
    • 2021
  • In order to reduce transmission delay and increase reliability in networks, mainly high-performance and high-power network equipment is used to guarantee network quality. In this paper, we propose an optimization algorithm to minimize the energy consumed when transmitting traffic in networks with a bundle link composed of multiple physical cables. The proposed optimization algorithm is a meta-heuristic method, which uses tabu search algorithm. In addition, it is designed to minimize transmission energy by minimizing the cables on the paths of the source and destination nodes for each traffic. In the proposed optimization algorithm, performance evaluation was performed in terms of the number of cables used in the transmission and the link utilization for all traffic on networks, and the performance evaluation result confirmed the superior performance than the previously proposed method.

Multi Area Power Dispatch using Black Widow Optimization Algorithm

  • Girishkumar, G.;Ganesan, S.;Jayakumar, N.;Subramanian, S.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.10
    • /
    • pp.113-130
    • /
    • 2022
  • Sophisticated automation-based electronics world, more electrical and electronic devices are being used by people from different regions across the universe. Different manufacturers and vendors develop and market a wide variety of power generation and utilization devices under different operating parameters and conditions. People use a variety of appliances which use electrical energy as power source. These appliances or gadgets utilize the generated energy in different ratios. Night time the utilization will be less when compared with day time utilization of power. In industrial areas especially mechanical industries or Heavy machinery usage regions power utilization will be a diverse at different time intervals and it vary dynamically. This always causes a fluctuation in the grid lines because of the random and intermittent use of these apparatus while the power generating apparatus is made to operate to provide a steady output. Hence it necessitates designing and developing a method to optimize the power generated and the power utilized. Lot of methodologies has been proposed in the recent years for effective optimization and economical load dispatch. One such technique based on intelligent and evolutionary based is Black Widow Optimization BWO. To enhance the optimization level BWO is hybridized. In this research BWO based optimize the load for multi area is proposed to optimize the cost function. A three type of system was compared for economic loads of 16, 40, and 120 units. In this research work, BWO is used to improve the convergence rate and is proven statistically best in comparison to other algorithms such as HSLSO, CGBABC, SFS, ISFS. Also, BWO algorithm best optimize the cost parameter so that dynamically the load and the cost can be controlled simultaneously and hence effectively the generated power is maximum utilized at different time intervals with different load capacity in different regions of utilization.

The Server Disconnection Problem on a Ring Network (링 네트워크에서의 서버 단절문제에 대한 해법)

  • Myung, Young-Soo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.1
    • /
    • pp.87-91
    • /
    • 2009
  • In the server disconnection problem, a network with m servers and their users is given and an attacker is to destroy a set of edges to maximize his net gain defined as the total disconnected utilities of the users minus the total edge-destruction cost. The problem is known to be NP-hard. In this paper, we study the server disconnection problem restricted to a ring network. We present an efficient combinatorial algorithm that generates an optimal solution in polynomial time.