Enhancing Renewable Energy Integration:A Gaussian-Bare-Bones Levy Cheetah Optimization Approach to Optimal Power Flow in Electrical Networks

In the contemporary era,the global expansion of electrical grids is propelled by various renewable energy sources(RESs).Efficient integration of stochastic RESs and optimal power flow(OPF)management are critical for network optimization.This study introduces an innovative solution,the Gaussian Bare-Bones Levy Cheetah Optimizer(GBBLCO),addressing OPF challenges in power generation systems with stochastic RESs.The primary objective is to minimize the total operating costs of RESs,considering four functions:overall operating costs,voltage deviation management,emissions reduction,voltage stability index(VSI)and power loss mitigation.Additionally,a carbon tax is included in the objective function to reduce carbon emissions.Thorough scrutiny,using modified IEEE 30-bus and IEEE 118-bus systems,validates GBBLCO’s superior performance in achieving optimal solutions.Simulation results demonstrate GBBLCO’s efficacy in six optimization scenarios:total cost with valve point effects,total cost with emission and carbon tax,total cost with prohibited operating zones,active power loss optimization,voltage deviation optimization and enhancing voltage stability index(VSI).GBBLCO outperforms conventional techniques in each scenario,showcasing rapid convergence and superior solution quality.Notably,GBBLCO navigates complexities introduced by valve point effects,adapts to environmental constraints,optimizes costs while considering prohibited operating zones,minimizes active power losses,and optimizes voltage deviation by enhancing the voltage stability index(VSI)effectively.This research significantly contributes to advancing OPF,emphasizing GBBLCO’s improved global search capabilities and ability to address challenges related to local minima.GBBLCO emerges as a versatile and robust optimization tool for diverse challenges in power systems,offering a promising solution for the evolving needs of renewable energy-integrated power grids.

Optimized Neural Network-Based Micro Strip Patch Antenna Design for Radar Application

Microstrip antennas are low-profile antennas that are utilized in wireless communication systems.In recent years,communication engineers have been increasingly interested in it.Because of downsizing,novelty,and cost reduction,the number of wireless standards has expanded in recent years.Wideband tech-nologies have evolved in addition to analog and digital services.Radars necessi-tate antenna subsystems that are low-profile and lightweight.Microstrip antennas have these qualities and are suited for radars as an alternative to the bulky and heavyweight reflector/slotted waveguide array antennas.A perforated corner single-line fed microstrip antenna is designed here.When compared to the basic square microstrip antenna,this antenna has better specifications.Because key issue is determining the best values for various antenna parameters when devel-oping the patch antenna.Optimized Neural Network(ONN)is one potential tech-nique utilized to solve this issue,and this work also uses Particle Swarm Optimization(PSO)to enhance the antenna performance.Return loss(S11)and Voltage Standing Wave Ratio(VSWR)parameters are considered in all situations,developed with Advanced Design System(ADS)applications.The transmitters are made to emit in the Ku-band,which covers a wide range of wavelengths.From 5–15 GHz,it is used in most current radars.The ADS suite is used to create the simulation design.

The Interplay between Artificial Intelligence and Fog Radio Access Networks

The interplay between artificial intelligence(AI) and fog radio access networks(F-RANs) is investigated in this work from two perspectives: how F-RANs enable hierarchical AI to be deployed in wireless networks and how AI makes F-RANs smarter to better serve mobile devices. Due to the heterogeneity of processing capability, the cloud, fog, and device layers in F-RANs provide hierarchical intelligence via centralized, distributed, and federated learning. In addition, cross-layer learning is also introduced to further reduce the demand for the memory size of the mobile devices. On the other hand, AI provides F-RANs with technologies and methods to deal with massive data and make smarter decisions. Specifically, machine learning tools such as deep neural networks are introduced for data processing, while reinforcement learning(RL) algorithms are adopted for network optimization and decisions. Then, two examples of AI-based applications in F-RANs, i.e., health monitoring and intelligent transportation systems, are presented, followed by a case study of an RL-based caching application in the presence of spatio-temporal unknown content popularity to showcase the potential of applying AI to F-RANs.

Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm

Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.

Self-Organized Optimization of Transport on Complex Networks

We propose a self-organized optimization mechanism to improve the transport capacity of complex gradient networks. We find that, regardless of network topology, the congestion pressure can be strongly reduced by the self-organized optimization mechanism. Furthermore, the random scale-free topology is more efficient to reduce congestion compared with the random Poisson topology under the optimization mechanism. The reason is that the optimization mechanism introduces the correlations between the gradient field and the local topology of the substrate network. Due to the correlations, the cutoff degree of the gradient network is strongly reduced and the number of the nodes exerting their maximal transport capacity consumedly increases. Our work presents evidence supporting the idea that scale-free networks can efficiently improve their transport capacity by self- organized mechanism under gradient-driven transport mode.

Optimal network structure to induce the maximal small-world effect

In this paper, the general efficiency, which is the average of the global efficiency and the local efficiency, is defined to measure the communication efficiency of a network. The increasing ratio of the general efficiency of a small-world network relative to that of the corresponding regular network is used to measure the small-world effect quantitatively. The more considerable the small-world effect, the higher the general efficiency of a network with a certain cost is. It is shown that the small-world effect increases monotonically with the increase of the vertex number. The optimal rewiring probability to induce the best small-world effect is approximately 0.02 and the optimal average connection probability decreases monotonically with the increase of the vertex number. Therefore, the optimal network structure to induce the maximal small-world effect is the structure with the large vertex number （〉 500）, the small rewiring probability （≈0.02） and the small average connection probability （〈 0.1）. Many previous research results support our results.

Preliminary Hydrogeologic Modeling and Optimal Monitoring Network Design for a Contaminated Abandoned Mine Site Area: Application of Developed Monitoring Network Design Software

In abandoned mine sites, i.e., mine sites where mining operations have ended, wide spread contaminations are often evident, but the potential sources and pathways of contamination especially through the subsurface, are difficult to identify due to inadequate and sparse geochemical measurements available. Therefore, it is essential to design and implement a planned monitoring net-work to obtain essential information required for establishing the potential contamination source locations, i.e., waste dumps, tailing dams, pits and possible pathways through the subsurface, and to design a remediation strategy for rehabilitation. This study presents an illustrative application of modeling the flow and transport processes and monitoring network design in a study area hydrogeologically resembling an abandoned mine site in Queensland, Australia. In this preliminary study, the contaminant transport process modeled does not incorporate the reactive geochemistry of the contaminants. The transport process is modeled considering a generic conservative contaminant for the illustrative purpose of showing the potential application of an optimal monitoring design methodology. This study aims to design optimal monitoring network to: 1) minimize the contaminant solute mass estimation error;2) locate the plume boundary;3) select the monitoring locations with (potentially) high concentrations. A linked simulation optimization based methodology is utilized for optimal monitoring network design. The methodology is applied utilizing a recently developed software package CARE-GWMND, developed at James Cook University for optimal monitoring network design. Given the complexity of the groundwater systems and the sparsity of pollutant concentration observation data from the field, this software is capable of simulating the groundwater flow and solute transport with spatial interpolation of data from a sparse set of available data, and it utilizes the optimization algorithm to determine optimum locations for implementing monitoring wells.

Optimizing control of coal flotation by neuro-immune algorithm

Coal flotation is widely used to separate commercially valuable coal from the fine ore slurry, and is an industrial process with nonlinear, multivariable, time-varying and long time-delay characteristics. The online detection of ash content of products as the operation performance evaluation in the flotation system is extraordinarily difficult because of the low solid content and numerous micro-bubbles in the slurry. Moreover, it is time-consuming by manual analysis. Consequently, the optimal separation is not usually maintained. A novel technique, called the neuro-immune algorithm (NIA) inspired by the biological nervous and immune systems, is presented in this paper for predicting the ash content of clean coal and performing the optimizing control to the coal flotation system. The proposed algorithm integrates the deeply-studied artificial neural network (ANN) and the developing artificial immune system (AIS). A two-layer back-propagation network was constructed offline based on the historical process data under the best system situation, using five parameters: the flow and the density of raw slurry, the input flows of water, the kerosene and the GF oil, as the inputs and the ash content of clean coal as the output. The immune cell of AIS is made up of six parameters above as the antigen. The cytokine based clone selection algorithm is used to produce the relative antibody. The detailed computation procedures about the hybrid neuro-immune algorithm are minutely discussed. The ash content of clean coal was predicted by NIA using the practical process data s: (308.6 174.7 146.1 43.6 4.0 9.4), and the absolute difference between the actual and computed ash content values was 0.0967%. The optimizing control on NIA was simulated considering two different situations where the ash content of clean coal was controlled downward from 10.00% or upward from 9.20% predicted by ANN to the target value 9.50%. The results indicate that the target ash content and the value of controlling parameters are obtained after several control cycles.

Learning Bayesian network structure with immune algorithm

Finding out reasonable structures from bulky data is one of the difficulties in modeling of Bayesian network （BN）, which is also necessary in promoting the application of BN. This pa- per proposes an immune algorithm based method （BN-IA） for the learning of the BN structure with the idea of vaccination. Further- more, the methods on how to extract the effective vaccines from local optimal structure and root nodes are also described in details. Finally, the simulation studies are implemented with the helicopter convertor BN model and the car start BN model. The comparison results show that the proposed vaccines and the BN-IA can learn the BN structure effectively and efficiently.

Workload-aware request routing in cloud data center using software-defined networking

Large latency of applications will bring revenue loss to cloud infrastructure providers in the cloud data center. The existing controllers of software-defined networking architecture can fetch and process traffic information in the network. Therefore, the controllers can only optimize the network latency of applications. However, the serving latency of applications is also an important factor in delivered user-experience for arrival requests. Unintelligent request routing will cause large serving latency if arrival requests are allocated to overloaded virtual machines. To deal with the request routing problem, this paper proposes the workload-aware software-defined networking controller architecture. Then, request routing algorithms are proposed to minimize the total round trip time for every type of request by considering the congestion in the network and the workload in virtual machines（VMs）. This paper finally provides the evaluation of the proposed algorithms in a simulated prototype. The simulation results show that the proposed methodology is efficient compared with the existing approaches.

Enhancing synchronizability by rewiring networks

According to different forms of synchronized region, complex networks are divided into type Ⅰ （unbounded synchronization region） and type Ⅱ （bounded synchronization region） networks. This paper presents a rewiring algorithm to enhance the synchronizability of type Ⅰ and type Ⅱ networks. By utilizing the algorithm for an unweighted and undirected network, a better synchronizability of network with the same number of nodes and edges can be obtained. Numerical simulations on several different network models are used to support the proposed procedure. The relationship between different topological properties of the networks and the number of rewirings are shown. It finds that the final optimized network is independent of the initial network, and becomes homogeneous. In addition the optimized networks have similar structural properties in the sense of degree, and node and edge betweenness centralities. However, they do not have similar cluster coefficients for type Ⅱ networks. The research may be useful for designing more synchronizable networks and understanding the synchronization behaviour of networks.

Optimization of PERT Network and Compression of Time

In the traditional methods of program evaluation and review technique （PERT） network optimization and compression of time limit for project, the uncertainty of free time difference and total time difference were not considered as well as its time risk. The authors of this paper use the theory of dependent-chance programming to establish a new model about compression of time for project and multi-objective network optimization, which can overcome the shortages of traditional methods and realize the optimization of PERT network directly. By calculating an example with genetic algorithms, the following conclusions are drawn： （ 1 ） compression of time is restricted by cost ratio and completion probability of project; （2） activities with maximal standard difference of duration and minimal cost will be compressed in order of precedence; （3） there is no optimal solutions but noninferior solutions between chance and cost, and the most optimal node time depends on decision-maker＇s preference.

DISTRIBUTED OPTIMAL LOCAL DOUBLE LOOP NETWORK

A distibuted optimal local double loop(DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter (d) and average hop distance (a) for this class of networks are [square-root 3N -2] less-than-or-equal-to d less-than-or-equal-to [square-root 3N+1] and (5N/9(N-1)) (square-root 3N-1.8) < a < (5N/9 (N-1)). (square-root 3N - 0.23), respectively (N is the number of nodes in the network. (3 less-than-or-equal-to N less-than-or-equal-to 10(4)). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed. The correctness of the algorithm has been also verified by simulating.

Integrated Sequential Groundwater Contaminant Source Characterization and Pareto-Optimal Monitoring Network Design Application for a Contaminated Aquifer Site

Accurate and reliable groundwater contaminant source characterization with limited contaminant concentration monitoring measurement data remains a challenging problem. This study presents an illustrative application of developed methodologies to a real-life contaminated aquifer. The source characterization and optimal monitoring network design methodologies are used sequentially for a contaminated aquifer site located in New South Wales, Australia. Performance of the integrated optimal source characterization methodology combining linked simulation-optimization, fractal singularity mapping technique (FSMT) and Pareto optimal solutions is evaluated. This study presents an integrated application of optimal source characterization with spatiotemporal concentration measurement data obtained from sequentially designed monitoring networks. The proposed sequential source characterization and monitoring network design methodology shows efficiency in identifying the unknown source characteristics. The designed monitoring network achieves comparable efficiency and accuracy utilizing much smaller number of monitoring locations as compared to a more ideal scenario where concentration measurements from a very large number of widespread monitoring wells are available. The proposed methodology is potentially useful for efficient characterization of unknown contaminant sources in a complex contaminated aquifer site, where very little initial concentration measurement data are available. The illustrative application of the methodology to a real-life contaminated aquifer site demonstrates the capability and efficiency of the proposed methodology.

3D Vehicle Detection Algorithm Based onMultimodal Decision-Level Fusion

3D vehicle detection based on LiDAR-camera fusion is becoming an emerging research topic in autonomous driving.The algorithm based on the Camera-LiDAR object candidate fusion method(CLOCs)is currently considered to be a more effective decision-level fusion algorithm,but it does not fully utilize the extracted features of 3D and 2D.Therefore,we proposed a 3D vehicle detection algorithm based onmultimodal decision-level fusion.First,project the anchor point of the 3D detection bounding box into the 2D image,calculate the distance between 2D and 3D anchor points,and use this distance as a new fusion feature to enhance the feature redundancy of the network.Subsequently,add an attention module:squeeze-and-excitation networks,weight each feature channel to enhance the important features of the network,and suppress useless features.The experimental results show that the mean average precision of the algorithm in the KITTI dataset is 82.96%,which outperforms previous state-ofthe-art multimodal fusion-based methods,and the average accuracy in the Easy,Moderate and Hard evaluation indicators reaches 88.96%,82.60%,and 77.31%,respectively,which are higher compared to the original CLOCs model by 1.02%,2.29%,and 0.41%,respectively.Compared with the original CLOCs algorithm,our algorithm has higher accuracy and better performance in 3D vehicle detection.

SNCDM: Spinal Tumor Detection from MRI Images Using Optimized Super-Pixel Segmentation

Conferring to the American Association of Neurological Surgeons(AANS)survey,85%to 99%of people are affected by spinal cord tumors.The symptoms are varied depending on the tumor’s location and size.Up-to-the-min-ute,back pain is one of the essential symptoms,but it does not have a specific symptom to recognize at the earlier stage.Numerous significant research studies have been conducted to improve spine tumor recognition accuracy.Nevertheless,the traditional systems are consuming high time to extract the specific region and features.Improper identification of the tumor region affects the predictive tumor rate and causes the maximum error-classification problem.Consequently,in this work,Super-pixel analytics Numerical Characteristics Disintegration Model(SNCDM)is used to segment the tumor affected region.Estimating the super-pix-els of the affected region by this method reduces the variance between the iden-tified pixels.Further,the super-pixels are selected according to the optimized convolution network that effectively extracts the vertebral super-pixels features.Derived super-pixels improve the network learning and training process,which minimizes the maximum error classification problem also the efficiency of the system was evaluated using experimental results and analysis.

Deep Learning Applied to Computational Mechanics:A Comprehensive Review,State of the Art,and the Classics

Three recent breakthroughs due to AI in arts and science serve as motivation:An award winning digital image,protein folding,fast matrix multiplication.Many recent developments in artificial neural networks,particularly deep learning(DL),applied and relevant to computational mechanics(solid,fluids,finite-element technology)are reviewed in detail.Both hybrid and pure machine learning(ML)methods are discussed.Hybrid methods combine traditional PDE discretizations with ML methods either(1)to help model complex nonlinear constitutive relations,(2)to nonlinearly reduce the model order for efficient simulation(turbulence),or(3)to accelerate the simulation by predicting certain components in the traditional integration methods.Here,methods(1)and(2)relied on Long-Short-Term Memory(LSTM)architecture,with method(3)relying on convolutional neural networks.Pure ML methods to solve(nonlinear)PDEs are represented by Physics-Informed Neural network(PINN)methods,which could be combined with attention mechanism to address discontinuous solutions.Both LSTM and attention architectures,together with modern and generalized classic optimizers to include stochasticity for DL networks,are extensively reviewed.Kernel machines,including Gaussian processes,are provided to sufficient depth for more advanced works such as shallow networks with infinite width.Not only addressing experts,readers are assumed familiar with computational mechanics,but not with DL,whose concepts and applications are built up from the basics,aiming at bringing first-time learners quickly to the forefront of research.History and limitations of AI are recounted and discussed,with particular attention at pointing out misstatements or misconceptions of the classics,even in well-known references.Positioning and pointing control of a large-deformable beam is given as an example.

水下传感网络的低复杂度APIT算法及OPNET仿真实现

由于水声传感网络具有能量的局限性,所以低复杂度的定位算法更适用于水声传感网络。传统的APIT算法能够以较少的控制开销获得较好的定位精度,有利于水下传感网络定位的实现,但其复杂度高,冗余误差较大。以点扫描的方式取代传统网格扫描法,提出一种低复杂度的APIT算法,并在OPNET平台上搭建水声传感网络环境,阐述该算法在水下传感网络节点定位的实现过程。仿真结果表明,待定位节点与锚节点密度的增加有助于改善算法的性能,且在同等条件下本文算法比传统APIT算法定位精度更高。

Optimization of clay material mixture ratio and filling process in gypsum mine goaf

Because there is neither waste rock nor mill tailings in the gypsum mine, and the buildings on the goaf of gypsum mine are needed to be protected, the research proposed the scheme of the clay filling technology. Gypsum, cement, lime and water glass were used as adhesive, and the strength of different material ratios were investigated in this study. The influence factors of clay strength were obtained in the order of cement, gypsum, water glass and lime. The results show that the cement content is the determinant influence factor, and gypsum has positive effects, while the water glass can enhance both clay strength and the fluidity of the filing slurry. Furthermore, combining chaotic optimization method with neural network, the optimal ratio of composite cementing agent was obtained. The results show that the optimal ratio of water glass, cement, lime and clay (in quality) is 1.17:6.74:4.17:87.92 in the process of bottom self-flow filling, while the optimal ratio is 1.78:9.58:4.71:83.93 for roof-contacted filling. A novel filling process to fill in gypsum mine goaf with clay is established. The engineering practice shows that the filling cost is low, thus, notable economic benefit is achieved.

Storage Assignment Optimization in a Multi-tier Shuttle Warehousing System

The current mathematical models for the storage assignment problem are generally established based on the traveling salesman problem（TSP）,which has been widely applied in the conventional automated storage and retrieval system（AS/RS）.However,the previous mathematical models in conventional AS/RS do not match multi-tier shuttle warehousing systems（MSWS） because the characteristics of parallel retrieval in multiple tiers and progressive vertical movement destroy the foundation of TSP.In this study,a two-stage open queuing network model in which shuttles and a lift are regarded as servers at different stages is proposed to analyze system performance in the terms of shuttle waiting period（SWP） and lift idle period（LIP） during transaction cycle time.A mean arrival time difference matrix for pairwise stock keeping units（SKUs） is presented to determine the mean waiting time and queue length to optimize the storage assignment problem on the basis of SKU correlation.The decomposition method is applied to analyze the interactions among outbound task time,SWP,and LIP.The ant colony clustering algorithm is designed to determine storage partitions using clustering items.In addition,goods are assigned for storage according to the rearranging permutation and the combination of storage partitions in a 2D plane.This combination is derived based on the analysis results of the queuing network model and on three basic principles.The storage assignment method and its entire optimization algorithm method as applied in a MSWS are verified through a practical engineering project conducted in the tobacco industry.The applying results show that the total SWP and LIP can be reduced effectively to improve the utilization rates of all devices and to increase the throughput of the distribution center.