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.

Predictive control for greenhouse temperature and humidity and energy optimization by improved NMPC objective function algorithm

Persistent low temperatures in autumn and winter have a huge impact on crops,and greenhouses rely on solar radiation and heating equipment to meet the required indoor temperature.But the energy cost of frequent operation of the actuators is exceptionally high.The relationship between greenhouse environmental control accuracy and energy consumption is one of the key issues faced in greenhouse research.In this study,a non-linear model predictive control method with an improved objective function was proposed.The improved objective function used tolerance intervals and boundary constraints to optimize the objective evaluation.The nonlinear model predictive control(NMPC)controller design was based on the wavelet neural network(WNN)data-driven model and applied the interior point method to solve the optimal solution of the objective function control,thus balancing the contradiction between energy consumption and control precision.The simulation results showed that the improved NMPC method reduced energy consumption by 21.02%and 9.54%compared with the model predictive control and regular NMPC,which proved the method achieved good results in a low-temperature environment.This research can provide an important reference for the field as it offers a more efficient approach to managing greenhouse climates,potentially leading to substantial energy savings and enhanced sustainability in agricultural practices.

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.

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.

Well production optimization using streamline features-based objective function and Bayesian adaptive direct search algorithm

Well production optimization is a complex and time-consuming task in the oilfield development.The combination of reservoir numerical simulator with optimization algorithms is usually used to optimize well production.This method spends most of computing time in objective function evaluation by reservoir numerical simulator which limits its optimization efficiency.To improve optimization efficiency,a well production optimization method using streamline features-based objective function and Bayesian adaptive direct search optimization(BADS)algorithm is established.This new objective function,which represents the water flooding potential,is extracted from streamline features.It only needs to call the streamline simulator to run one time step,instead of calling the simulator to calculate the target value at the end of development,which greatly reduces the running time of the simulator.Then the well production optimization model is established and solved by the BADS algorithm.The feasibility of the new objective function and the efficiency of this optimization method are verified by three examples.Results demonstrate that the new objective function is positively correlated with the cumulative oil production.And the BADS algorithm is superior to other common algorithms in convergence speed,solution stability and optimization accuracy.Besides,this method can significantly accelerate the speed of well production optimization process compared with the objective function calculated by other conventional methods.It can provide a more effective basis for determining the optimal well production for actual oilfield development.

Reactor Network Synthesis Based on Instantaneous Objective Function Characteristic Curves

It is believed that whether the instantaneous objective function curves of plug-flow-reactor (PFR) and continuous-stirred-tank-reactor (CSTR) overlap or not, they have a consistent changing trend for complex reactions (steady state, isothermal and constant volume). As a result of the relation of the objective functions (selectivity or yield) to the instantaneous objective functions (instantaneous selectivity or instantaneous reaction rate), the optimal reactor network configuration can be determined according to the changing trend of the instantaneous objective function curves. Further, a recent partition strategy for the reactor network synthesis based on the instantaneous objective function characteristic curves is proposed by extending the attainable region partition strategy from the concentration space to the instantaneous objective function-unreacted fraction of key reactant space. In this paper, the instantaneous objective function is closed to be the instantaneous selectivity and several samples are examined to illustrate the proposed method. The comparison with the previous work indicates it is a very convenient and practical systematic tool of the reactor network synthesis and seems also promising for overcoming the dimension limit of the attainable region partition strategy in the concentration space.

SELECTION OF OBJECTIVE FUNCTIONS AND APPLICATION OF GENETIC ALGORITHMS IN DAMPING DESIGN OF PIPE SYSTEM

The vibration failure of pipe system of aeroengine seriously influences the safety of aircraft.Its damping design is determined by the selection of the design target,method and their feasibility.Five objective functions for the vibration design of a pipeline or pipe system are introduced,namely,the frequency,amplitude,transfer ratio,curvature and deformation energy as options for the optimization process.The genetic algorithms(GA)are adopted as the opti- mization method,in which the selection of the adaptive genetic operators and the method of implementation of the GA process are crucial.The optimization procedure for all the above ob- jective functions is carried out using GA on the basis of finite element software-MSC/NASTRAN. The optimal solutions of these functions and the stress distribution on the structure are calculated and compared through an example,and their characteristics are analyzed.Finally we put forward two new objective functions,curvature and deformation energy for pipe system optimization.The calculations show that using the curvature as the objective function can reflect the case of minimal stress,and the optimization results using the deformation energy represent lesser and more uni- form stress distribution.The calculation results and process showed that the genetic algorithms can effectively implement damping design of engine pipelines and satisfy the efficient engineering design requirement.

FUZZY IDENTIFICATION METHOD BASED ON A NEW OBJECTIVE FUNCTION

A method of fuzzy identification based on a new objective function is proposed. The method could deal with the issue that input variables of a system have an effect on the input space while output variables of the system do not exert an influence on the input space in the proposed objective functions of fuzzy clustering. The method could simultaneously solve the problems about structure identification and parameter estimation; thus it makes the fuzzy model become optimal. Simulation example demonstrates that the method could identify non linear systems and obviously improve modeling accuracy.

Experimental Evaluation of Objective Functions for Well-balanced Mapping

High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among them. Mapping is the technology to partition the problem domain wellbalanced into multiple distinct execution tasks based on some measures. In mapping, a good objective function is the criterion to guarantce the distinct execution tasks equitable. In this paper, we evaluate five categories of those existed objective functions with three different problem subjects using experiments and find an objective function is much suitable for all kinds of problems.

Randomized Objective Function Linear Programming in Risk Management

The traditional linear programming model is deterministic. The way that uncertainty is handled is to compute the range of optimality. After the optimal solution is obtained, typically by the simplex method, one considers the effect of varying each objective function coefficient, one at a time. This yields the range of optimality within which the decision variables remain constant. This sensitivity analysis is useful for helping the analyst get a sense for the problem. However, it is unrealistic because objective function coefficients tend not to stand still. They are typically profit contributions from products sold and are subject to randomly varying selling prices. In this paper, a realistic linear program is created for simultaneously randomizing the coefficients from any probability distribution. Furthermore, we present a novel approach for designing a copula of random objective function coefficients according to a specified rank correlation. The corresponding distribution of objective function values is created. This distribution is examined directly for central tendency, spread, skewness and extreme values for the purpose of risk analysis. This enables risk analysis and business analytics, emerging topics in education and preparation for the knowledge economy.

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.

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.

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

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.