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.

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.

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.

Machine Learning Enabled Novel Real-Time IoT Targeted DoS/DDoS Cyber Attack Detection System

The increasing prevalence of Internet of Things(IoT)devices has introduced a new phase of connectivity in recent years and,concurrently,has opened the floodgates for growing cyber threats.Among the myriad of potential attacks,Denial of Service(DoS)attacks and Distributed Denial of Service(DDoS)attacks remain a dominant concern due to their capability to render services inoperable by overwhelming systems with an influx of traffic.As IoT devices often lack the inherent security measures found in more mature computing platforms,the need for robust DoS/DDoS detection systems tailored to IoT is paramount for the sustainable development of every domain that IoT serves.In this study,we investigate the effectiveness of three machine learning(ML)algorithms:extreme gradient boosting(XGB),multilayer perceptron(MLP)and random forest(RF),for the detection of IoTtargeted DoS/DDoS attacks and three feature engineering methods that have not been used in the existing stateof-the-art,and then employed the best performing algorithm to design a prototype of a novel real-time system towards detection of such DoS/DDoS attacks.The CICIoT2023 dataset was derived from the latest real-world IoT traffic,incorporates both benign and malicious network traffic patterns and after data preprocessing and feature engineering,the data was fed into our models for both training and validation,where findings suggest that while all threemodels exhibit commendable accuracy in detectingDoS/DDoS attacks,the use of particle swarmoptimization(PSO)for feature selection has made great improvements in the performance(accuracy,precsion recall and F1-score of 99.93%for XGB)of the ML models and their execution time(491.023 sceonds for XGB)compared to recursive feature elimination(RFE)and randomforest feature importance(RFI)methods.The proposed real-time system for DoS/DDoS attack detection entails the implementation of an platform capable of effectively processing and analyzing network traffic in real-time.This involvesemploying the best-performing ML algorithmfor detection and the integration of warning mechanisms.We believe this approach will significantly enhance the field of security research and continue to refine it based on future insights and developments.

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.

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.

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.

A New Hybrid Method for Constrained Global Optimization

By combining properly the simulated annealing algorithm and the nonlinear programming neural network, a new hybrid method for comtrained global optimization is proposed in this paper. To maintain the applicability of the simulated annealing algorithm used in the hybrid method as general as possible, the nonlinear programming neural network is employed at each iteration to find only a feasible solution to the original constrained problem rather than a local optimal solution. Such a feasible solution is obtained by solving an auxiliary optimization problem with a new objective function. The computational results for two numerical examples indicate that the proposed hybrid method for constrained global optimization is not only highly reliable but also much more effcient than the simulated annealing algorithm using the penalty function method to deal with the constraints.

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

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

Node deployment strategy optimization for wireless sensor network with mobile base station

The optimization of network performance in a movement-assisted data gathering scheme was studied by analyzing the energy consumption of wireless sensor network with node uniform distribution. A theoretically analytical method for avoiding energy hole was proposed. It is proved that if the densities of sensor nodes working at the same time are alternate between dormancy and work with non-uniform node distribution. The efficiency of network can increase by several times and the residual energy of network is nearly zero when the network lifetime ends.

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%.

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.

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.

Energy optimal routing for long chain-type wireless sensor networks in underground mines

Wireless sensor networks are useful complements to existing monitoring systems in underground mines. They play an important role of enhancing and improving coverage and flexibility of safety monitoring systems.Regions prone to danger and environments after disasters in underground mines require saving and balancing energy consumption of nodes to prolong the lifespan of networks.Based on the structure of a tunnel,we present a Long Chain-type Wireless Sensor Network（LC-WSN）to monitor the safety of underground mine tunnels.We define the optimal transmission distance and the range of the key region and present an Energy Optimal Routing（EOR）algorithm for LC-WSN to balance the energy consumption of nodes and maximize the lifespan of networks.EOR constructs routing paths based on an optimal transmission distance and uses an energy balancing strategy in the key region.Simulation results show that the EOR algorithm extends the lifespan of a network,balances the energy consumption of nodes in the key region and effectively limits the length of routing paths,compared with similar algorithms.

Decision Model of Knowledge Transfer in Big Data Environment

A decision model of knowledge transfer is presented on the basis of the characteristics of knowledge transfer in a big data environment.This model can determine the weight of knowledge transferred from another enterprise or from a big data provider.Numerous simulation experiments are implemented to test the efficiency of the optimization model.Simulation experiment results show that when increasing the weight of knowledge from big data knowledge provider,the total discount expectation of profits will increase,and the transfer cost will be reduced.The calculated results are in accordance with the actual economic situation.The optimization model can provide useful decision support for enterprises in a big data environment.

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.

Research and Implementation of Decreasing the Acetic Acid Consumption in Purified Terephthalic Acid Solvent System

Decreasing the acetic acid consumption in purified terephthalic acid （PTA） solvent system has become a hot issue with common concern. In accordance with the technical features, the electrical conductivity is in direct proportion to the acetic acid content. General regression neural network （GRNN） is used to establish the model of electrical conductivity on the basis of mechanism analysis, and then particle swarm optimization （PSO） algorithm with the improvement of inertia weight and population diversity is proposed to regulate the operating conditions. Thus, the method of decreasing the acid loss is derived and applied to PTA solvent system in a chemical plant. Cases studies show that the precision of modeling and optimization are higher. The results also provide the optimal operating conditions, which decrease the cost and improve the profit.

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.

Using Extension Theory and Fuzzy Analytic Hierarchy Process on Heterogeneous Wireless Network Selection Algorithm

In order to solve the problem that determining decision factors weights is of subjectivity in heterogeneous wireless network selection algorithm, a network selection algorithm based on extension theory and fuzzy analytic hierarchy process （FAHP） is proposed in this paper. In addition, user and operator codetermine the optimal network using the proposed algorithm, which can give consideration to user and operator benefits. The fuzzy judgment matrix is coustructed by membership degree of decision factors which is calculated according to extension theory. The comprehensive weight of each decision factor is obtained using FAHP. Finally, the optimal network is selected through total property value ranldng of each candidate network under user preference and operator preference. The simulation results show that the proposed algorithm can select the optimal network efficiently and accurately, satisfy user preference, and implement load balance between networks.