Structural failure analysis with CMS-based ground motion selection using innovative cost function and weight factors

The selection and scaling of ground motion records is considered a primary and essential task in performing structural analysis and design.Conventional methods involve using ground motion models and a conditional spectrum to select ground motion records based on the target spectrum.This research demonstrates the influence of adopting different weighted factors for various period ranges during matching selected ground motions with the target hazard spectrum.The event data from the Next Generation Attenuation West 2(NGA-West 2)database is used as the basis for ground motion selection,and hazard de-aggregation is conducted to estimate the event parameters of interest,which are then used to construct the target intensity measure(IM).The target IMs are then used to select ground motion records with different weighted vector-valued objective functions.The weights are altered to account for the relative importance of IM in accordance with the structural analysis application of steel moment resisting frame(SMRF)buildings.Instead of an ordinary objective function for the matching spectrum,a novel model is introduced and compared with the conventional cost function.The results indicate that when applying the new cost function for ground motion selection,it places higher demands on structures compared to the conventional cost function.Moreover,submitting more weights to the first-mode period of structures increases engineering demand parameters.Findings demonstrate that weight factors allocated to different period ranges can successfully account for period elongation and higher mode effects.

Detecting the core of a network by the centralities of the nodes

Many networks exhibit the core/periphery structure.Core/periphery structure is a type of meso-scale structure that consists of densely connected core nodes and sparsely connected peripheral nodes.Core nodes tend to be well-connected,both among themselves and to peripheral nodes,which tend not to be well-connected to other nodes.In this brief report,we propose a new method to detect the core of a network by the centrality of each node.It is discovered that such nodes with non-negative centralities often consist in the core of the networks.The simulation is carried out on different real networks.The results are checked by the objective function.The checked results may show the effectiveness of the simulation results by the centralities of the nodes on the real networks.Furthermore,we discuss the characters of networks with the single core/periphery structure and point out the scope of the application of our method at the end of this paper.

Adaptive Resource Allocation Algorithm for 5G Vehicular Cloud Communication

The current resource allocation in 5G vehicular networks for mobile cloud communication faces several challenges,such as low user utilization,unbalanced resource allocation,and extended adaptive allocation time.We propose an adaptive allocation algorithm for mobile cloud communication resources in 5G vehicular networks to address these issues.This study analyzes the components of the 5G vehicular network architecture to determine the performance of different components.It is ascertained that the communication modes in 5G vehicular networks for mobile cloud communication include in-band and out-of-band modes.Furthermore,this study analyzes the single-hop and multi-hop modes in mobile cloud communication and calculates the resource transmission rate and bandwidth in different communication modes.The study also determines the scenario of one-way and two-way vehicle lane cloud communication network connectivity,calculates the probability of vehicle network connectivity under different mobile cloud communication radii,and determines the amount of cloud communication resources required by vehicles in different lane scenarios.Based on the communication status of users in 5G vehicular networks,this study calculates the bandwidth and transmission rate of the allocated channels using Shannon’s formula.It determines the adaptive allocation of cloud communication resources,introduces an objective function to obtain the optimal solution after allocation,and completes the adaptive allocation process.The experimental results demonstrate that,with the application of the proposed method,the maximum utilization of user communication resources reaches approximately 99%.The balance coefficient curve approaches 1,and the allocation time remains under 2 s.This indicates that the proposed method has higher adaptive allocation efficiency.

Distributed Stochastic Optimization with Compression for Non-Strongly Convex Objectives

We are investigating the distributed optimization problem,where a network of nodes works together to minimize a global objective that is a finite sum of their stored local functions.Since nodes exchange optimization parameters through the wireless network,large-scale training models can create communication bottlenecks,resulting in slower training times.To address this issue,CHOCO-SGD was proposed,which allows compressing information with arbitrary precision without reducing the convergence rate for strongly convex objective functions.Nevertheless,most convex functions are not strongly convex(such as logistic regression or Lasso),which raises the question of whether this algorithm can be applied to non-strongly convex functions.In this paper,we provide the first theoretical analysis of the convergence rate of CHOCO-SGD on non-strongly convex objectives.We derive a sufficient condition,which limits the fidelity of compression,to guarantee convergence.Moreover,our analysis demonstrates that within the fidelity threshold,this algorithm can significantly reduce transmission burden while maintaining the same convergence rate order as its no-compression equivalent.Numerical experiments further validate the theoretical findings by demonstrating that CHOCO-SGD improves communication efficiency and keeps the same convergence rate order simultaneously.And experiments also show that the algorithm fails to converge with low compression fidelity and in time-varying topologies.Overall,our study offers valuable insights into the potential applicability of CHOCO-SGD for non-strongly convex objectives.Additionally,we provide practical guidelines for researchers seeking to utilize this algorithm in real-world scenarios.

Ingredients-based Methodology and Fuzzy Logic Combined Short-Duration Heavy Rainfall Short-Range Forecasting:An Improved Scheme

Short-duration heavy rainfall(SHR),as delineated by the National Meteorological Center of the China Me-teorological Administration,is characterized by hourly rainfall amounts no less than 20.0 mm.SHR is one of the most common convective weather phenomena that can cause severe damage.Short-range forecasting of SHR is an important part of operational severe weather prediction.In the present study,an improved objective SHR forecasting scheme was developed by adopting the ingredients-based methodology and using the fuzzy logic approach.The 1.0°×1.0°National Centers for Environmental Prediction(NCEP)final analysis data and the ordinary rainfall(0.1-19.9 mm h-1)and SHR observational data from 411 stations were used in the improved scheme.The best lifted index,the total precipitable water,the 925 hPa specific humidity(Q 925),and the 925 hPa divergence(DIV 925)were selected as predictors based on objective analysis.Continuously distributed membership functions of predictors were obtained based on relative frequency analysis.The weights of predictors were also objectively determined.Experiments with a typhoon SHR case and a spring SHR case show that the main possible areas could be captured by the improved scheme.Verification of SHR forecasts within 96 hours with NCEP global forecasts 1.0°×1.0°data initiated at 08:00 Beijing Time during the warm seasons in 2015 show the results were improved from both deterministic and probabilistic perspectives.This study provides an objectively feasible choice for short-range guidance forecasts of SHR.The scheme can be applied to other convective phenomena.

An Improved RPL Algorithm for Low-Power and Lossy Networks

The routing protocol for low-power and lossy networks(RPL),standardized by Internet Engineering Task Force(IETF),is mainly designed to use for Low-power and Lossy Networks(LLNs).To solve the problems of several important routing metrics are not evaluated,the optimal path may contain long single hop links,lack of scientific multi-routing metrics evaluation method and mechanism to balance the parent child number(especially the parent with one hop away from root),this paper proposes an improved RPL algorithm for LLN(I-RPL).First of all,we propose the evaluated routing metrics:child number of parent,candidate parent number,hop count,ETX and energy consumption index.Meanwhile,we improve the path ETX calculation method to avoid selecting optimal path containing long single hop links.Then we design a novel lexical method to synthetically evaluate candidate parents.Meanwhile,based on the evaluation results of candidate parents,we design a novel objective function and a new calculation node rank method which can also be used for selecting the optimal path.Finally,evaluation results show that I-RPL outperforms ETXOF and several other improvements in terms of packet delivery ratio,latency,etc.

Enhanced history matching process by incorporation of saturation logs as model selection criteria

This paper proposes a methodology for an alternative history matching process enhanced by the incorporation of a simplified binary interpretation of reservoir saturation logs(RST) as objective function. Incorporating fluids saturation logs during the history matching phase unlocks the possibility to adjust or select models that better represent the near wellbore waterfront movement, which is particularly important for uncertainty mitigation during future well interference assessments in water driven reservoirs. For the purposes of this study, a semi-synthetic open-source reservoir model was used as base case to evaluate the proposed methodology. The reservoir model represents a water driven, highly heterogenous sandstone reservoir from Namorado field in Brazil. To effectively compare the proposed methodology against the conventional methods, a commercial reservoir simulator was used in combination with a state-of-the-art benchmarking workflow based on the Big LoopTMapproach. A well-known group of binary metrics were evaluated to be used as the objective function, and the Matthew correlation coefficient(MCC) has been proved to offer the best results when using binary data from water saturation logs. History matching results obtained with the proposed methodology allowed the selection of a more reliable group of reservoir models,especially for cases with high heterogeneity. The methodology also offers additional information and understanding of sweep behaviour behind the well casing at specific production zones, thus revealing full model potential to define new wells and reservoir development opportunities.

Sea Turtle Foraging Optimization-Based Controller Placement with Blockchain-Assisted Intrusion Detection in Software-Defined Networks

Software-defined networking(SDN)algorithms are gaining increas-ing interest and are making networks flexible and agile.The basic idea of SDN is to move the control planes to more than one server’s named controllers and limit the data planes to numerous sending network components,enabling flexible and dynamic network management.A distinctive characteristic of SDN is that it can logically centralize the control plane by utilizing many physical controllers.The deployment of the controller—that is,the controller placement problem(CPP)—becomes a vital model challenge.Through the advancements of blockchain technology,data integrity between nodes can be enhanced with no requirement for a trusted third party.Using the lat-est developments in blockchain technology,this article designs a novel sea turtle foraging optimization algorithm for the controller placement problem(STFOA-CPP)with blockchain-based intrusion detection in an SDN environ-ment.The major intention of the STFOA-CPP technique is the maximization of lifetime,network connectivity,and load balancing with the minimization of latency.In addition,the STFOA-CPP technique is based on the sea turtles’food-searching characteristics of tracking the odour path of dimethyl sulphide(DMS)released from food sources.Moreover,the presented STFOA-CPP technique can adapt with the controller’s count mandated and the shift to controller mapping to variable network traffic.Finally,the blockchain can inspect the data integrity,determine significantly malicious input,and improve the robust nature of developing a trust relationship between sev-eral nodes in the SDN.To demonstrate the improved performance of the STFOA-CPP algorithm,a wide-ranging experimental analysis was carried out.The extensive comparison study highlighted the improved outcomes of the STFOA-CPP technique over other recent approaches.

Deep Learning-Based FOPID Controller for Cascaded DC-DC Converters

Smart grids and their technologies transform the traditional electric grids to assure safe,secure,cost-effective,and reliable power transmission.Non-linear phenomena in power systems,such as voltage collapse and oscillatory phenomena,can be investigated by chaos theory.Recently,renewable energy resources,such as wind turbines,and solar photovoltaic(PV)arrays,have been widely used for electric power generation.The design of the controller for the direct Current(DC)converter in a PV system is performed based on the linearized model at an appropriate operating point.However,these operating points are everchanging in a PV system,and the design of the controller is usually accomplished based on a low irradiance level.This study designs a fractional-order proportional-integrated-derivative(FOPID)controller using deep learning(DL)with quasi-oppositional Archimedes Optimization algorithm(FOPID-QOAOA)for cascaded DC-DC converters in micro-grid applications.The presented FOPIDQOAOA model is designed to enhance the overall efficiency of the cascaded DC-DC boost converter.In addition,the proposed model develops a FOPID controller using a stacked sparse autoencoder(SSAE)model to regulate the converter output voltage.To tune the hyper-parameters related to the SSAE model,the QOAOA is derived by the including of the quasi-oppositional based learning(QOBL)with traditional AOA.Moreover,an objective function with the including of the integral of time multiplied by squared error(ITSE)is considered in this study.For validating the efficiency of the FOPID-QOAOA method,a sequence of simulations was performed under distinct aspects.A comparative study on cascaded buck and boost converters is carried out to authenticate the effectiveness and performance of the designed techniques.

Honey Badger Algorithm Based Clustering with Routing Protocol for Wireless Sensor Networks

Wireless sensor network(WSN)includes a set of self-organizing and homogenous nodes employed for data collection and tracking applications.It comprises a massive set of nodes with restricted energy and processing abilities.Energy dissipation is a major concern involved in the design of WSN.Clustering and routing protocols are considered effective ways to reduce the quantity of energy dissipation using metaheuristic algorithms.In order to design an energy aware cluster-based route planning scheme,this study introduces a novel Honey Badger Based Clustering with African Vulture Optimization based Routing(HBAC-AVOR)protocol for WSN.The presented HBAC-AVOR model mainly aims to cluster the nodes in WSN effectually and organize the routes in an energy-efficient way.The presented HBAC-AVOR model follows a two stage process.At the initial stage,the HBAC technique is exploited to choose an opti-mal set of cluster heads(CHs)utilizing afitness function involving many input parameters.Next,the AVOR approach was executed for determining the optimal routes to BS and thereby lengthens the lifetime of WSN.A detailed simulation analysis was executed to highlight the increased outcomes of the HBAC-AVOR protocol.On comparing with existing techniques,the HBAC-AVOR model has outperformed existing techniques with maximum lifetime.

Enhanced Water Quality Control Based on Predictive Optimization for Smart Fish Farming

The requirement for high-quality seafood is a global challenge in today’s world due to climate change and natural resource limitations.Internet of Things(IoT)based Modern fish farming systems can significantly optimize seafood production by minimizing resource utilization and improving healthy fish production.This objective requires intensive monitoring,prediction,and control by optimizing leading factors that impact fish growth,including temperature,the potential of hydrogen(pH),water level,and feeding rate.This paper proposes the IoT based predictive optimization approach for efficient control and energy utilization in smart fish farming.The proposed fish farm control mechanism has a predictive optimization to deal with water quality control and efficient energy consumption problems.Fish farm indoor and outdoor values are applied to predict the water quality parameters,whereas a novel objective function is proposed to achieve an optimal fish growth environment based on predicted parameters.Fuzzy logic control is utilized to calculate control parameters for IoT actuators based on predictive optimal water quality parameters by minimizing energy consumption.To evaluate the efficiency of the proposed system,the overall approach has been deployed to the fish tank as a case study,and a number of experiments have been carried out.The results show that the predictive optimization module allowed the water quality parameters to be maintained at the optimal level with nearly 30%of energy efficiency at the maximum actuator control rate compared with other control levels.

A Sensor Network Coverage Planning Based on Adjusted Single Candidate Optimizer

Wireless sensor networks(WSNs)are widely used for various practical applications due to their simplicity and versatility.The quality of service in WSNs is greatly influenced by the coverage,which directly affects the monitoring capacity of the target region.However,low WSN coverage and uneven distribution of nodes in random deployments pose significant challenges.This study proposes an optimal node planning strategy for net-work coverage based on an adjusted single candidate optimizer(ASCO)to address these issues.The single candidate optimizer(SCO)is a metaheuristic algorithm with stable implementation procedures.However,it has limitations in avoiding local optimum traps in complex node coverage optimization scenarios.The ASCO overcomes these limitations by incorporating reverse learning and multi-direction strategies,resulting in updated equations.The performance of the ASCO algorithm is compared with other algorithms in the literature for optimal WSN node coverage.The results demonstrate that the ASCO algorithm offers efficient performance,rapid convergence,and expanded coverage capabilities.Notably,the ASCO achieves an archival coverage rate of 88%,while other approaches achieve coverage rates below or equal to 85%under the same conditions.

Optimization Model: Resource Distribution for Risk Factors of Type 2 Diabetes Prevention

Type 2 Diabetes, a lifestyle disease, can be prevented/delayed by adopting a healthy lifestyle. Awareness of the same amongst the citizens can be one of the best ways to initiate a decline in the positive census of the disease. We use this paper to illustrate an optimization model where the budget can be distributed based on the census data of the risk factors involved. It uses a non-linear programming model and can easily be modified into a linear one. The alternative options and constraints too, are mentioned in the paper. The results show that the mid-western states need more share of the allocation based on risk factors. The model distributes the percentage of the budget allocated to different states based on a fixed risk factor constraint.

A review on reflection-waveform inversion

Full-waveform inversion(FWI)utilizes optimization methods to recover an optimal Earth model to best fit the observed seismic record in a sense of a predefined norm.Since FWI combines mathematic inversion and full-wave equations,it has been recognized as one of the key methods for seismic data imaging and Earth model building in the fields of global/regional and exploration seismology.Unfortunately,conventional FWI fixes background velocity mainly relying on refraction and turning waves that are commonly rich in large offsets.By contrast,reflections in the short offsets mainly contribute to the reconstruction of the high-resolution interfaces.Restricted by acquisition geometries,refractions and turning waves in the record usually have limited penetration depth,which may not reach oil/gas reservoirs.Thus,reflections in the record are the only source that carries the information of these reservoirs.Consequently,it is meaningful to develop reflection-waveform inversion(RWI)that utilizes reflections to recover background velocity including the deep part of the model.This review paper includes:analyzing the weaknesses of FWI when inverting reflections;overviewing the principles of RWI,including separation of the tomography and migration components,the objective functions,constraints;summarizing the current status of the technique of RWI;outlooking the future of RWI.

Two optimization algorithms for solving robotics inverse kinematics with redundancy

The kinematic redundancy in a robot leads to an infinite number of solutions for inverse kinematics, which implies the possibility to select a 'best' solution according to an optimization criterion. In this paper, two optimization objective functions are proposed, aiming at either minimizing extra degrees of freedom (DOFs) or minimizing the total potential energy of a multilink redundant robot. Physical constraints of either equality or inequality types are taken into consideration in the objective functions. Since the closed-form solutions do not exist in general for highly nonlinear and constrained optimization problems, we adopt and develop two numerical methods, which are verified to be effective and precise in solving the two optimization problems associated with the redundant inverse kinematics. We first verify that the well established trajectory following method can precisely solve the two optimization problems, but is computation intensive. To reduce the computation time, a sequential approach that combines the sequential quadratic programming and iterative Newton-Raphson algorithm is developed. A 4-DOF Fujitsu Hoap-1 humanoid robot arm is used as a prototype to validate the effectiveness of the proposed optimization solutions.

Dynamic finite element model updating of prestressed concrete continuous box-girder bridge

The dynamic finite element model （FEM） of a prestressed concrete continuous box-girder bridge, called the Tongyang Canal Bridge, is built and updated based on the results of ambient vibration testing （AVT） using a real-coded accelerating genetic algorithm （RAGA）. The objective functions are defined based on natural frequency and modal assurance criterion （MAC） metrics to evaluate the updated FEM. Two objective functions are defined to fully account for the relative errors and standard deviations of the natural frequencies and MAC between the AVT results and the updated FEM predictions. The dynamically updated FEM of the bridge can better represent its structural dynamics and serve as a baseline in long-term health monitoring, condition assessment and damage identification over the service life of the bridge .

A compound objective reconfiguration of distribution networks using hierarchical encoded particle swarm optimization

With the development of automation in smart grids,network reconfiguration is becoming a feasible approach for improving the operation of distribution systems.A novel reconfiguration strategy was presented to get the optimal configuration of improving economy of the system,and then identifying the important nodes.In this strategy,the objectives increase the node importance degree and decrease the active power loss subjected to operational constraints.A compound objective function with weight coefficients is formulated to balance the conflict of the objectives.Then a novel quantum particle swarm optimization based on loop switches hierarchical encoded was employed to address the compound objective reconfiguration problem.Its main contribution is the presentation of the hierarchical encoded scheme which is used to generate the population swarm particles of representing only radial connected solutions.Because the candidate solutions are feasible,the search efficiency would improve dramatically during the optimization process without tedious topology verification.To validate the proposed strategy,simulations are carried out on the test systems.The results are compared with other techniques in order to evaluate the performance of the proposed method.

RPL Based on Triangle Module Operator for AMI Networks

the routing protocol for low-power and lossy networks(RPL) has been used in advanced metering infrastructure(AMI)which could provide two-way communication between smart meters and city utilities.To improve the network performance of AMI networks, this paper proposed an improved algorithm of RPL based on triangle module operator(IAR-TMO). IAR-TMO proposes membership functions of the following five typical routing metrics: end-to-end delay, number of hops, expected transmission count(ETX),node remaining energy, and child node count.Moreover, IAR-TMO uses triangle module operator to fuse membership functions of these routing metrics. Then, IAR-TMO selects preferred parents(the next hop) based on the triangle module operator. Theoretical analysis and simulation results show that IAR-TMO has a great improvement when compared with two recent representative algorithms: ETXOF(ETX Objective Function) and OF-FL(Objective Function based on Fuzzy Logic), in terms of network lifetime, average end-to-end delay,etc. Consequently, the network performances of AMI networks can be improved effectively.

OPTIMALITY CONDITIONS AND DUALITY RESULTS FOR NONSMOOTH VECTOR OPTIMIZATION PROBLEMS WITH THE MULTIPLE INTERVAL-VALUED OBJECTIVE FUNCTION

In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a （weakly） LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a （weakly） LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.

MLA:A New Mutated Leader Algorithm for Solving Optimization Problems

Optimization plays an effective role in various disciplines of science and engineering.Optimization problems should either be optimized using the appropriate method(i.e.,minimization or maximization).Optimization algorithms are one of the efficient and effective methods in providing quasioptimal solutions for these type of problems.In this study,a new algorithm called the Mutated Leader Algorithm(MLA)is presented.The main idea in the proposed MLA is to update the members of the algorithm population in the search space based on the guidance of a mutated leader.In addition to information about the best member of the population,themutated leader also contains information about the worst member of the population,as well as other normal members of the population.The proposed MLA is mathematically modeled for implementation on optimization problems.A standard set consisting of twenty-three objective functions of different types of unimodal,fixed-dimensional multimodal,and high-dimensional multimodal is used to evaluate the ability of the proposed algorithm in optimization.Also,the results obtained from theMLA are compared with eight well-known algorithms.The results of optimization of objective functions show that the proposed MLA has a high ability to solve various optimization problems.Also,the analysis and comparison of the performance of the proposed MLA against the eight compared algorithms indicates the superiority of the proposed algorithm and ability to provide more suitable quasi-optimal solutions.