Search

Abstract  In this paper a model-driven decision support system related to paper making is introduced. The intention is to emphasize the necessity of coupling different modeling techniques, multiobjective optimization, and software engineering in order to make the end user application realistic, practical and usable. Firstly the paper making process and selected aspects concerning its mathematical modeling, numerical simulation, and multiobjective optimization are introduced, then the related computerized system, called a virtual paper making line, is described. In addition, the associated decision support system, which provides a suitable level of automation to improve the quality of decision making and support the user’s expertise is discussed. Finally, an example presents different ways of using such a software tool. [ABSTRACT FROM AUTHOR]

In this work, an improved moth-flame optimization algorithm is proposed to alleviate the problems of premature convergence and convergence to local minima. From the perspective of diversity, an inertia weight of diversity feedback control is introduced in the moth-flame optimization to balance the algorithm's exploitation and global search abilities. Furthermore, a small probability mutation after the position update stage is added to improve the optimization performance. The performance of the proposed algorithm is extensively evaluated on a suite of CEC'2014 series benchmark functions and four constrained engineering optimization problems. The results of the proposed algorithm are compared with the ones of other improved algorithms presented in literatures. It is observed that the proposed method has a superior performance to improve the convergence ability of the algorithm. In addition, the proposed algorithm assists in escaping the local minima. [ABSTRACT FROM AUTHOR]

In the context of integrated energy systems, the synergy between generalised energy storage systems and integrated energy systems has significant benefits in dealing with multi-energy coupling and improving the flexibility of energy market transactions, and the characteristics of the multi-principal game in the integrated energy market are becoming more and more obvious, but it is difficult to improve the flexibility of the transactions between "source-load-storage" in a one-way master–slave game structure, and the problem of how to establish an optimisation strategy for the coordination of integrated energy systems and energy storage systems is an urgent issue. How to establish a coordinated optimisation strategy of integrated energy system and energy storage system is an urgent problem. Therefore, this paper proposes a generalised shared energy storage and integrated energy system transaction optimisation method based on a two-stage game model, which improves the flexibility of the system transaction by constructing a two-stage game energy transaction model in which the subject acts as a leader and a gamer. Compared with the current one-way game model that does not consider the game on the energy storage side, the coordinated optimisation method proposed in this paper enables the energy storage side to participate more actively in the scheduling, which improves its revenue by 20.6%, the revenue on the energy-using side by 6.3%, and the overall revenue of the system by 5.4%, and at the same time, the load demand response regulation effect is more obvious, so the energy scheduling strategy proposed in this paper is able to weigh the interests of each subject and increase the overall economic benefits of the system. [ABSTRACT FROM AUTHOR]

An alternative energy source such as solar is one of the most important renewable resources. A reliable solar radiation prediction is essential for various applications in agriculture, industry, transport, and the environment because they reduce greenhouse gases and are environmentally friendly. Solar radiation data series have embedded fluctuations and noise signals due to complexity, stochasticity, non-stationarity, and nonlinearity with uncertain and time-varying nature. Aside from being highly nonlinear, solar radiation is highly influenced by the environment and environmental parameters such as air temperature, cloud cover, surface reflectivity, and aerosols. In addition, the spatial measurements of these variables are not readily available. To tackle these challenges, it is necessary to consider data preprocessing techniques and to develop and test precise solar radiation predicting models at different forecast horizons. There is, however, controversy regarding the performance of such models in various studies. Comparisons are not conducted systematically among the different studies. Using a critical literature review, the authors hope to answer these questions and believe that further investigation of solar radiation can benefit researchers and practitioners alike. This study presents a comprehensive evaluation of solar radiation modeling using artificial intelligence in the last 15 years and provides a novel detailed analysis of the available models. The studies conducted in different climates of the world that were published in distinguished journals were considered (i.e., 90 papers in total) for this purpose. Newly discovered procedures for optimizing forecasts, data cleaning, feature selection, classification methods, and stand-alone or hybrid data-driven models for solar radiation prediction and modeling were evaluated. The results strikingly showed that the most used artificial intelligence methods were artificial neural network, adaptive neuro-fuzzy inference system, and decision tree family of models. In addition, the extreme learning machine, support vector machine, and particle swarm optimization were the most used optimization techniques in solar radiation modeling. In terms of forecast horizons, the most common forecast horizon found in papers was on the daily scale (51% of studies), followed by the hourly scale (26%), and the least common was the monthly scale (18%). Based on the regional studies, the highest number of solar radiation papers originated from Asia, with Europe in second place and African countries in third place. An increasing trend in the number of papers from 2011 to 2015 was noted, and the second peak started from 2018 till the present. Under each section, a summary of findings is provided. The paper concludes with future thoughts and directions on solar radiation modeling. [ABSTRACT FROM AUTHOR]

This paper introduces three novel approaches to size geothermal energy piles in a MILP, offering fresh perspectives and potential solutions. The research overlooks MILP models that incorporate the sizing of a geothermal borefield. Therefore, this paper presents a new model utilizing a g-function model to regulate the power limits. Geothermal energy is an essential renewable source, particularly for heating and cooling. Complex energy systems, with their diverse sources of heating and cooling and intricate interactions, are crucial for a climate-neutral energy system. This work significantly contributes to the integration of geothermal energy as a vital energy source into the modelling of such complex systems. Borehole heat exchangers help generate heat in low-temperature energy systems. However, optimizing these exchangers using mixed-integer-linear programming (MILP), which only allows for linear equations, is complex. The current research only uses R-C, reservoir, or g-function models for pre-sized borefields. As a result, borehole heat exchangers are often represented by linear factors such as 50 W/m for extraction or injection limits. A breakthrough in the accuracy of borehole heat exchanger sizing has been achieved with the development of a new model, which has been rigorously compared to two simpler models. The geothermal system was configured for three energy systems with varying ground and bore field parameters. The results were then compared with existing geothermal system tools. The new model provides more accurate depth sizing with an error of less than 5 % compared to simpler models with an error higher than 50 %, although it requires more calculation time. The new model can lead to more accurate borefield sizing in MILP applications to optimize energy systems. This new model is especially beneficial for large-scale projects that are highly dependent on borefield size. [ABSTRACT FROM AUTHOR]

Over the last few decades, researches related to the impact of production and industrial manufacturing on environmental sustainability, coupled with multi-dimensional multi-criteria decision analysis and performance evaluation has consistently gained importance. However, no significant work in which an effort to optimize the total production process with the consideration of the positive and negative impacts of each input and output on Environmental sustainability has been noticed. The main aim of our paper is to address this gap. In this paper, an effort has been made to develop a realistic optimization model wherein a manufacturing firm has been considered to function with several decision-making units taking into account the effects of factors like profit, employment generation, social development, environmental pollution and sustainability. The various inputs employed and outputs produced by the firm are responsible for having negative impacts on the environment, besides creative value generation. With due consideration to both these values instead of mere profit, the model determines and explores the firm's decision considering different objectives. The optimization problem has been solved by a GA developed by us and demonstrated with numerical examples. The solutions of the numerical examples point towards some interesting revelations and indicate some prospective future research directions which contributes to this field of research. [ABSTRACT FROM AUTHOR]

Inspired by cloud computing, cloud manufacturing (CMfg) is a service-oriented manufacturing paradigm on an on-demand and pay-as-you-go business model through the internet. More specifically, new challenges for production planning and decision-making process have emerged in that resource scheduling and have gained the most attention, and there is an urgent need to determine the current status and identify issues and matters to be addressed in the future. This review paper is aiming to discuss aspects of the cloud-based resource scheduling problem through investigating the literature to date to identify the existing gaps and recommending the potential paths moving forward for researchers in this field. So far, literature reviews focused on a broad scope of cloud-based scheduling, as a new approach taking a "narrow scope" by focusing on resource scheduling and various steps of it in the cloud environment are considered. Using the data gathered from the popular databases, a comprehensive statistical analysis on the existing literatures is provided, and the rational sequences of the systematic literature review (SLR) are elaborated. The mathematical models in resource scheduling are thoroughly elucidated. Then, a comprehensive analysis of the main aspects of resource scheduling including the objective functions, constraints, and optimization algorithms is presented. Discussion of the findings of the review paper illustrates that time and cost gain more attention (almost 80%) among all objective functions, and the metaheuristic algorithms are the most widely used in the recent research papers. Finally, suggestions for potential future research to further consolidate this field have been enumerated. [ABSTRACT FROM AUTHOR]

Social desirability responding (SRD) on surveys administered on the World Wide Web (WWW) and on paper was examined using 178 graduate and undergraduate students randomly assigned to a 2 (World Wide Web and Paper) ×2 (Anonymous and Nonanonymous) true experimental design. The findings reveal no differences in SDR between the WWW and the paper-administered survey conditions, and no differences in SDR between the anonymous and nonanonymous conditions. These findings and potential explanations are examined for consideration by anyone interested in using the WWW to obtain accurate information from survey participants. [ABSTRACT FROM AUTHOR]

Bitcoin exchange security is crucial because of MEC's widespread use. Cryptojacking has compromised MEC app security and bitcoin exchange ecosystem functionality. This paper propose a cutting-edge neural network and AdaHessian optimization technique for cryptojacking prediction and defense. We provide a cutting-edge deep neural network (DNN) cryptojacking attack prediction approach employing pruning, post-training quantization, and AdaHessian optimization. To solve these problems, this paper apply pruning, post-training quantization, and AdaHessian optimization. A new framework for quick DNN training utilizing AdaHessian optimization can detect cryptojacking attempts with reduced computational cost. Pruning and post-training quantization improve the model for low-CPU on-edge devices. The proposed approach drastically decreases model parameters without affecting Cryptojacking attack prediction. The model has Recall 98.72%, Precision 98.91%, F1-Score 99.09%, MSE 0.0140, RMSE 0.0137, and MAE 0.0139. Our solution beats state-of-the-art approaches in precision, computational efficiency, and resource consumption, allowing more realistic, trustworthy, and cost-effective machine learning models. We address increasing cybersecurity issues holistically by completing the DNN optimization-security loop. Securing Crypto Exchange Operations delivers scalable and efficient Cryptojacking protection, improving machine learning, cybersecurity, and network management. [ABSTRACT FROM AUTHOR]

Learning label-specific features is an effective strategy for multi-label classification. Existing multi-label classification methods for learning label-specific features face two challenges. One is the incompleteness of the training label data, and the other is that existing techniques generate label-specific features and build multi-label classifiers independently, ignoring the decoupled nature of the two phases. In this paper, we propose an embedding packing method that combines the generation of label-specific features and subsequent model induction to deal with the multi-label classification problem of missing labels. The proposed method first recovers the missing labels using higher-order label correlation while completing the generation of label-specific features in the embedded feature space and finally completes the construction of a multi-label classifier by combining empirical loss minimization and learned label correlation. Moreover, this paper utilizes the kernel expansion technique to ensure that the model can handle linearly inseparable data. We use alternating optimization techniques to solve the potential optimization problem effectively. Comparative analysis experiments are conducted on ten benchmark multi-label datasets to verify that the proposed method is as competitive as other state-of-the-art methods in dealing with missing-label data. [ABSTRACT FROM AUTHOR]

This paper presents a comprehensive study on the implementation and analysis of PID controllers in an automated voltage regulator (AVR) system. A novel tuning technique, Virtual Time response-based iterative gain evaluation and re-design (V-Tiger), is introduced to iteratively adjust PID gains for optimal control performance. The study begins with the development of a mathematical model for the AVR system and initialization of PID gains using the Pessen Integral Rule. Virtual time-response analysis is then conducted to evaluate system performance, followed by iterative gain adjustments using Particle Swarm Optimization (PSO) within the V-Tiger framework. MATLAB simulations are employed to implement various controllers, including the V-Tiger PID controller, and their performance is compared in terms of transient response, stability, and control signal generation. Robustness analysis is conducted to assess the system's stability under uncertainties, and worst-case gain analysis is performed to quantify robustness. The transient response of the AVR with the proposed PID controller is compared with other heuristic controllers such as the Flower Pollination Algorithm, Teaching–Learning-based Optimization, Pessen Integral Rule, and Zeigler-Nichols methods. By measuring the peak closed-loop gain of the AVR with the controller and adding uncertainty to the AVR's field exciter and amplifier, the robustness of proposed controller is determined. Plotting the performance degradation curves yields robust stability margins and the accompanying maximum uncertainty that the AVR can withstand without compromising its stability or performance. Based on the degradation curves, robust stability margin of the V-Tiger PID controller is estimated at 3.5. The worst-case peak gains are also estimated using the performance degradation curves. Future research directions include exploring novel optimization techniques for further enhancing control performance in various industrial applications. [ABSTRACT FROM AUTHOR]

Rain is a common weather phenomenon, and the challenge of removing rain streaks from a single image is crucial due to its detrimental impact on image quality and the extraction of valuable background information. Existing methods commonly rely on specific assumptions regarding rain models, which restricts their ability to accommodate a wide range of real-world scenarios. To overcome this limitation, these methods often require complex optimization techniques or stepwise refinement strategies. In this paper, we propose a novel wide rectangular regional block and dual attention complementary enhancement deraining kernel prediction subnet to meet the challenge. The network called WRRDANet consists of a kernel prediction subnet and pixel-wise dilation filtering. In the kernel prediction subnet, we capture more specific contextual background information and complex pixel-wise kernels. Afterward, the learned pixel-wise multi-scale kernels from the kernel prediction subnet are used to perform dilation filtering on the original rainy image, effectively restoring richer background details by expanding the scope of deraining to a larger extent. We conducted a comprehensive evaluation using synthetic and real rainfall datasets to demonstrate the effectiveness of our approach. The results, both qualitatively and quantitatively, indicate that our approach outperforms other popular rain removal methods. [ABSTRACT FROM AUTHOR]

As one of the most popular techniques for performance evaluation, Data Envelopment Analysis (DEA) has been widely applied in many areas. However, the self-evaluation used in DEA leaves it open to much criticism. Moreover, most researchers have ignored the fact that reality abounds with uncertainty and have assumed that the data used for evaluation is deterministic and accurate. Both assumptions make it difficult to evaluate the efficiency of real-world production processes correctly and reasonably. In this paper, we propose a series of robust cross-efficiency (RCE) models based on robust optimization theory and cross-efficiency to deal with these problems. First of all, the proposed RCE models allow the conservatism level to be adjusted easily to suit the attitude of the decision-maker towards uncertainty. In addition, the RCE models have better discrimination power than the existing robust CCR models. We present two applications to demonstrate the effectiveness and stability of our models. [ABSTRACT FROM AUTHOR]

We present an improved analysis of the running time of a dynamic program for the routing flow shop problem with two machines on an asymmetric network. Our analysis is based on structural properties of optimal schedules and significantly improves the bound on the running time of the algorithm obtained in the conference version of our paper (Chernykh, Kononov, and Sevastyanov, in: Kononov, A. et al. (eds) Mathematical optimization theory and operations research. MOTOR 2020. Lecture notes in computer science, Springer, Switzerland, 2020). To the best of our knowledge, our polynomial-time algorithm (under the assumption that the number of network nodes is bounded by any constant) is the first positive result on the complexity of the routing flow shop problem with an arbitrary structure of the transportation network, even in the case of a symmetric network. This result contrasts with the complexity of the two-machine routing open shop problem, which is NP-hard even on the two-node network. [ABSTRACT FROM AUTHOR]

Quantum annealing emerges as a promising approach for tackling complex scheduling problems such as the resource-constrained project scheduling problem (RCPSP). This study represents the first application of quantum annealing to solve the RCPSP, analyzing 12 well-known mixed integer linear programming (MILP) formulations and converting the most qubit-efficient one into a quadratic unconstrained binary optimization (QUBO) model. We then solve this model using the D-wave advantage 6.3 quantum annealer, comparing its performance against classical computer solvers. Our results indicate significant potential, particularly for small to medium-sized instances. Further, we introduce time-to-target and Atos Q-score metrics to evaluate the effectiveness of quantum annealing and reverse quantum annealing. The paper also explores advanced quantum optimization techniques, such as customized anneal schedules, enhancing our understanding and application of quantum computing in operations research. [ABSTRACT FROM AUTHOR]

Handwritten Text Recognition (HTR) is a challenging task due to the complex structures and variations present in handwritten text. In recent years, the application of gated mechanisms, such as Long Short-Term Memory (LSTM) networks, has brought significant advancements to HTR systems. This paper presents an overview of HTR using a gated mechanism and highlights its novelty and advantages. The gated mechanism enables the model to capture long-term dependencies, retain relevant context, handle variable length sequences, mitigate error propagation, and adapt to contextual variations. The pipeline involves preprocessing the handwritten text images, extracting features, modeling the sequential dependencies using the gated mechanism, and decoding the output into readable text. The training process utilizes annotated datasets and optimization techniques to minimize transcription discrepancies. HTR using a gated mechanism has found applications in digitizing historical documents, automatic form processing, and real-time transcription. The results show improved accuracy and robustness compared to traditional HTR approaches. The advancements in HTR using a gated mechanism open up new possibilities for effectively recognizing and transcribing handwritten text in various domains. This research does a better job than the most recent iteration of the HTR system when compared to five different handwritten datasets (Washington, Saint Gall, RIMES, Bentham and IAM). Smartphones and robots are examples of low-cost computing devices that can benefit from this research. [ABSTRACT FROM AUTHOR]

In this paper, an efficient methodology that could be implemented within any analysis software is developed to automate the design process of post-tensioned slabs. Optimization techniques are used to compute the necessary number of strands. The present methodology is based on computing an innovative influence matrix that contains the effect of each strand on stresses at a set of control points (points of peak stresses). This matrix will be used in the optimization avoiding reanalysis in each optimization iteration. The sum of the squares of the difference between the allowable stress and the computed stresses at all control points is considered an objective function. The optimization is then carried out under the constraints that the stresses at each control point should not exceed the allowable limit and to ensure that the number of strands is an integer value. Alternatively, the proposed methodology could be used as a value-engineering tool. Practical examples are presented to demonstrate the efficiency of the developed methodology. Highlights: • Automated design tool of practical PT slabs independent of designer experience. • Ability to perform value engineering tasks to obtain optimum number of cables in practical PT slabs. • Practical use of optimization methods in structural design automation tool. [ABSTRACT FROM AUTHOR]

In contemporary particle swarm optimization (PSO) algorithms, to efficiently explore global optimum solutions, it is common practice to set the inertia weight to monotonically decrease over time for stability, while allowing the two acceleration coefficients, representing cognitive and social factors, to adopt decreasing or increasing functions over time, including random variations. However, there has been little discussion on a unified design approach for these time-varying acceleration coefficients. This paper presents a unified methodology for designing monotonic decreasing or increasing functions to construct nonlinear time-varying inertia weight and two acceleration coefficients in PSO, along with a control strategy for exploring global optimum solutions. We first construct time-varying coefficients by linearly amplifying well-posed monotonic functions that decrease or increase over normalized time. Here, well-posed functions ensure satisfaction of specified conditions at the initial and terminal points of the search process. However, many of the functions employed thus far only satisfy well-posedness at either the initial or terminal points of the search time, prompting the proposal of a method to adjust them to virtually meet specified initial or terminal points. Furthermore, we propose a crossing strategy where the developed cognitive and social acceleration coefficients intersect within the search time interval, effectively guiding the search process by pre-determining crossing values and times. The performance of our Nonlinear Crossing Strategy-based Particle Swarm Optimization (NCS-PSO) is evaluated using the CEC2014 (Congress on Evolutionary Computation in 2014) benchmark functions. Through comprehensive numerical comparisons and statistical analyses, we demonstrate the superiority of our approach over seven conventional algorithms. Additionally, we validate our approach, particularly in a drone navigation scenario, through an example of optimal 3D path planning. These contributions advance the field of PSO optimization techniques, providing a robust approach to addressing complex optimization problems. [ABSTRACT FROM AUTHOR]

Homomorphic evaluation of hash functions offers a solution to the challenge of data integrity authentication in the context of homomorphic encryption. The earliest attempt to achieve homomorphic evaluation of SHA-256 hash function was proposed by Mella and Susella (in: Cryptography and coding—14th IMA international conference, IMACC 2013. Lecture notes in computer science, vol 8308. Springer, Heidelberg, pp 28–44, 2013. https://doi.org/10.1007/978-3-642-45239-0%5f3.) based on the BGV scheme. Unfortunately, their implementation faced significant limitations due to the exceedingly high multiplicative depth, rendering it impractical. Recently, a homomorphic implementation of SHA-256 based on the TFHE scheme (Homomorphic evaluation of SHA-256. https://github.com/zama-ai/tfhe-rs/tree/main/tfhe/examples/sha256%5fbool) brings it from theory to reality, however, its current efficiency remains insufficient. In this paper, we revisit the homomorphic evaluation of the SHA-256 hash function in the context of TFHE, further reducing the reliance on gate bootstrapping and enhancing evaluation latency. Specifically, we primarily utilize ternary gates to reduce the number of gate bootstrappings required for logic functions in message expansion and addition of modulo 2 32 in iterative compression. Furthermore, we demonstrate that our optimization techniques are applicable to the Chinese commercial cryptographic hash SM3. Finally, we give specific comparative implementations based on the TFHE-rs library. Experiments demonstrate that our optimization techniques lead to an improvement of approximately 35–50% compared with the state-of-the-art result under different cores. [ABSTRACT FROM AUTHOR]

This paper provides a mathematical optimization strategy for optimal municipal solid waste management in the context of the COVID-19 epidemic. This strategy integrates two approaches: optimization and machine learning models. First, the optimization model determines the optimal supply chain for the municipal waste management system. Then, machine learning prediction models estimate the required parameters over time, which helps generate future projections for the proposed strategy. The optimization model was coded in the General Algebraic Modeling System, while the prediction model was coded in the Python programming environment. A case study of New York City was addressed to evaluate the proposed strategy, which includes extensive socioeconomic data sets to train the machine learning model. We found the predicted waste collection over time based on the socioeconomic data. The results show trade-offs between the economic (profit) and environmental (waste sent to landfill) objectives for future scenarios, which can be helpful for possible pandemic scenarios in the following years. [ABSTRACT FROM AUTHOR]

The author reflects on the winners of the 2012 Best Paper Award of the "Journal of Global Optimization (JOGO)." The author states that the winners of the award, which are selected by an award committee, will receive $1,000 and certificate. The author mentions the winners of the said award such as Paul I. Barton, Joseph K. Scott, and Matthew D. Stuber for their research paper entitled "Generalized McCormick Relaxations."

Abstract  In this paper, a filled function method for solving constrained global optimization problems is proposed. A filled function is proposed for escaping the current local minimizer of a constrained global optimization problem by combining the idea of filled function in unconstrained global optimization and the idea of penalty function in constrained optimization. Then a filled function method for obtaining a global minimizer or an approximate global minimizer of the constrained global optimization problem is presented. Some numerical results demonstrate the efficiency of this global optimization method for solving constrained global optimization problems. [ABSTRACT FROM AUTHOR]

As is well known that the global optimization ability of the Fruit fly Optimization Algorithm (FOA)is weak because it is easy to fall into local optimum. In this paper, a Fruit Fly Optimization Algorithm based on Locality Sensitive Hashing-aware (LSHFOA)was proposed. The locality sensitive hashing mechanism to optimize the generation mechanism for swarm population individuals was used, which can improve the individual diversity of the population. Meanwhile, when the fruit fly population falls into the local optimum, the locality sensitive hashing mechanism was adopted to change the population location, which is used for jumping out of local optimal limits. To verify the performance of LSHFOA, it was compared with FOA and its improvement algorithms CFOA, and IFFO with 8 representative benchmark functions. A large number of experimental results showed that LSHFOA has a faster convergence speed and higher precision of optimization for function optimization, especially in high-dimensional multi-peak functions. In addition to the theoretical evaluation, we also evaluate its performance in a real-world scenario. Generally, an edge computing environment, as an extension of cloud computing, can allow the users to access the network in a low-latency manner. In this way, to capture the high-speed convergence advantage, this paper makes the first attempt to tackle a classic research problem in the edge computing environment, i.e., the edge server placement problem. The experimental results show that the new algorithm has an excellent application effect. [ABSTRACT FROM AUTHOR]

Background: MathWorks has provided an invaluable tool for designing and implementing FPGAs. MATLAB HDL coder serves a dual purpose, providing a quick proof of concept on the one hand and providing the g an easy-to-use platform for testing and verification on the other. It has main drawbacks over these advantages; it generates a code that is not optimized for both area and frequency. Results: In this paper, we provide a technique for optimizing both area and frequency without losing the main advantages. The most affecting problem we found is loops. This paper classifies loop writing purposes into two types. The first one is preferable and introduces ease of writing a few lines instead of repeating the code. The second type is the problem that we intended to solve. Type II loop is appearing when the algorithm should perform these lines for several clock cycles. Writing it traditionally, force the synthesizer to implement all the repetitive clock cycles as repetitive hardware to be done in one clock cycle. This clock cycle is wide in time and is slow in frequency. This paper introduces an optimization technique for this problem. We compare before and after the implementation of our proposed technique. Conclusions: We used Xilinx Spartan 6 XC6SLX4-2CPG196 FPGA. Our proposed technique improves the number of slice LUTs (Look Up Tables) requirement from 366 to 72%. The frequency improved from: 26.574 to 185.355 MHz. Based on that, we now recommend using MATLAB HDL coder in FPGA Design. [ABSTRACT FROM AUTHOR]

In intelligent transportation systems, real-time video streaming via vehicle networks has been seen as a vital difficulty. The goal of this paper is to decrease the computational complexity of the versatile video coding (VVC) encoder for VANETs. In this paper, a low-complexity enhancement VVC encoder is designed for vehicular communication. First, a fast coding unit (CU) partitioning scheme based on CU texture features is proposed in VVC, which aims to decide the final type of CU partition by calculating CU texture complexity and gray-level co-occurrence matrix (GLCM). Second, to reduce the number of candidate prediction mode types in advance, a fast chroma intra-prediction mode optimization technique based on CU texture complexity aims to combine intra-prediction mode features. Moreover, the simulation outcomes demonstrate that the overall approach may substantially reduce encoding time, while the loss of coding efficiency is reasonably low. The encoding time can be reduced by up to 53.29% when compared to the VVC reference model, although the average BD rate is only raised by 1.26%. The suggested VVC encoder is also hardware-friendly and has a minimal level of complexity for video encoders used in connected vehicle applications. [ABSTRACT FROM AUTHOR]

In the field of electronics thermal management (TM), there has already been a lot of work done to create cooling options that guarantee steady-state performance. However, electronic devices (EDs) are progressively utilized in applications that involve time-varying workloads. Therefore, the TM systems could dissipate the heat generated by EDs; however, there seemed to be a necessity for a design that would contain temperature rise within an acceptable range for limiting hot spots and managing thermal transients induced by higher-frequency operating cycles. Heat dissipation issues become more significant when miniaturization in electronics increases. More effective TM often results in enhanced reliability as well as a longer life expectancy for devices. Hence, this paper explicates the TM of EDs, the comparison of cooling methods, the comparison of convections for TM on EDs, the heat source (HS) mounted on the substrate board, and optimization techniques to optimize the size and position of HSs mounted on the substrate board. This paper also analyzes the TM technologies on different EDs from 2014 to 2023 and the comparison of the thermal conductance of EDs with two types of phase change materials (PCMs) and pin-fin heat pipes (HPs). [ABSTRACT FROM AUTHOR]

An introduction is presented in which the editor discusses reports within the issue on topics including the standard simplex for global optimization, the direct-type global optimization algorithms for expensive global optimization, and the multivariate McCormick relaxations.

This paper presents a prototype filter design using the orthant optimization technique to assist a filter bank multicarrier (FBMC) modulation scheme of a NextG smart e-healthcare network framework. Low latency and very high reliability are one of the main requirements of a real-time e-healthcare system. In recent times, FBMC modulation has gotten more attention due to its spectral efficiency. The characteristics of a filter bank are determined by t's, prototype filter. A prototype filter cannot be designed to achieve an arbitrary time localization (for low latency) and frequency localization (spectral efficiency), as time and frequency spreading are conflicting goals. Hence, an optimum design needed to be achieved. In this paper, a constraint for perfect or nearly perfect reconstruction is formulated for prototype filter design and an orthant-based enriched sparse ℓ1-optimization method is applied to achieve the optimum performance in terms of higher availability of subcarrier spacing for the given requirement of signal-to-interference ratio. Larger subcarrier spacing ensures lower latency and better performance in real-time applications. The proposed FBMC system, based on an optimum design of the prototype filter, also supports a higher data rate as compared to traditional FBMC and OFDM systems, which is another requirement of real-time communication. In this paper, the solution for the different technical issues of physical layer design is provided. The presented modulation scheme through the proposed prototype filter-based FBMC can suppress the side lobe energy of the constituted filters up to large extent without compromising the recovery of the signal at the receiver end. The proposed system provides very high spectral efficiency; it can sacrifice large guard band frequencies to increase the subcarrier spacing to provide low-latency communication to support the real-time e-healthcare network. [ABSTRACT FROM AUTHOR]

In order to efficiently and automatically identify the faults of rotating machinery, so as to avoid the dangers and losses caused by them, this paper proposes a new fault feature extraction method for rotating machinery named Hierarchical Multi-variate Amplitude-aware Permutation Entropy (HmvAAPE), which has integrated the advantages of Amplitude-aware Permutation Entropy (AAPE), multi-channel analysis method and hierarchical decomposition method. Therefore, the features extracted by this feature extraction method can contain more complete fault information. The t-SNE algorithm is chosen to conduct dimensional reduction of features and the Kernel Extreme Learning Machine optimized by Von Neumann Topology Whale Optimization Algorithm (VNWOA-KELM) is proposed to learn fault characteristics and classify faults automatically. By designing bearing and gearbox fault experiments and collecting their fault data to verify the effectiveness of the proposed method, it can be obtained that the average classification accuracy of this method can reach 98.9%. Through comparative experiments, conclusions can be made that this method can get both higher accuracy and higher stability at the same time. [ABSTRACT FROM AUTHOR]

Space heating applications account for a high share of global greenhouse gas emissions. To increase the renewable share of heat generation, seasonal thermal energy storage (STES) can be used to make thermal energy from fluctuating renewable sources available in times of high demand. A popular STES technology is pit thermal energy storage (PTES), where heat is stored underground, using water as a storage medium. To evaluate the use of PTES in an energy system, easily adaptable, publicly accessible and tool independent models are needed. In this paper, we improve an existing PTES model developed in the Modelica modeling language. The model is cross-compared with a more detailed and previously validated COMSOL model, considering different amounts of insulation, showing a deviation of 2–13% in the observed annual charged and discharged amount of heat. The results indicate that the presented model is well suited for early design stage and an exemplary case study is performed to demonstrate its applicability in a system context. Dimensions of system components are optimized for the levelized cost of heat (LCOH), both with and without subsidies, highlighting the importance of subsidies for the transition towards climate friendly heating solutions, as the gas boiler use is reduced from 47.6% to 2.7%. [ABSTRACT FROM AUTHOR]

This paper provides six metaheuristic algorithms, namely Fast Cuckoo Search (FCS), Salp Swarm Algorithm (SSA), Dynamic control Cuckoo search (DCCS), Gradient-Based Optimizer (GBO), Northern Goshawk Optimization (NGO), Opposition Flow Direction Algorithm (OFDA) to efficiently solve the optimal power flow (OPF) issue. Under standard and conservative operating settings, the OPF problem is modeled utilizing a range of objectives, constraints, and formulations. Five case studies have been conducted using IEEE 30-bus and IEEE 118-bus standard test systems to evaluate the effectiveness and robustness of the proposed algorithms. A performance evaluation procedure is suggested to compare the optimization techniques' strength and resilience. A fresh comparison methodology is created to compare the proposed methodologies with other well-known methodologies. Compared to previously reported optimization algorithms in the literature, the obtained results show the potential of GBO to solve various OPF problems efficiently. [ABSTRACT FROM AUTHOR]

Finding the optimum conductor's pattern for unequally spaced grounding grids can be achieved by using empirical formulas or optimization techniques. Empirical formulas give an approximate solution depending on human experience and never cover the entire search space. On the other hand, the optimization techniques generally require a significant effort and time. To overcome the previous issues, this paper presents a closed-form solution based on optimized results. The main motivation behind this formula is the comprehensive study carried out by the authors to find optimum location of grounding grid conductors over different areas. In that work, particle swarm optimization technique (PSO) has been adapted with combined integration matrix method (CIMM) to facilitate the study. In this paper, the results obtained previously were summarized in the proposed formula. The proposed formula gives the optimum design of unequally grounding grids by specifying the conductor's locations as percentage of the side length for square and rectangular shapes. As long as the side length and the number of conductors are given, the location of each conductor as a percentage of the side length can be obtained. The effect of adding driven rods and the stratified soil conditions on the results of the optimized design were investigated. The validity of the proposed closed-form solution was verified experimentally. [ABSTRACT FROM AUTHOR]

With remarkable learning capabilities and swift operational speeds, artificial intelligence (AI) can assist researchers in swiftly extracting valuable patterns, trends, and associations from subjective information. Tribological behaviors are characterized by dependence on systems, evolution with time, and multidisciplinary coupling. The friction process involves a variety of phenomena, including mechanics, thermology, electricity, optics, magnetics, and so on. Hence, tribological information possesses the distinct characteristics of being multidisciplinary, multilevel, and multiscale, so that the application of AI in tribology is highly extensive. To delineate the scope, classification, and recent trends of AI implementation in tribology, this review embarks on exploration of the tribology research domain. It comprehensively outlines the utilization of AI in basic theory of tribology, intelligent tribology, component tribology, extreme tribology, bio-tribology, green tribology, and other fields. Finally, considering the emergence of "tribo-informatics" as a novel interdisciplinary field, which combines tribology with informatics, this review elucidates the future directions and research framework of "AI for tribology". In this paper, tribo-system information is divided into 5 categories: input information (I), system intrinsic information (S), output information (O), tribological state information (Ts), and derived state information (Ds). Then, a fusion method among 5 types of tribo-system information and different AI technologies (regression, classification, clustering, and dimension reduction) has been proposed, which enables tribo-informatics methods to solve common problems such as tribological behavior state monitoring, behavior prediction, and system optimization. The purpose of this review is to offer a systematic comprehension of tribo-informatics and to inspire new research ideas of tribo-informatics. Ultimately, it aspires to enhance the efficiency of problem-solving in tribology. [ABSTRACT FROM AUTHOR]

Due to growing network data dissemination in cloud, the elasticity, pay as you go options, globally accessible facilities, and security of networks have become increasingly important in today's world. Cloud service providers, including AWS, Azure, GCP, and others, facilitate worldwide expansion within minutes by offering decentralized communication network functions, hence providing security to cloud is still remains a challenging task. This paper aims to introduce and evaluate the Biz-SCOP model, a novel intrusion detection system developed for cloud security. The research addresses the pressing need for effective intrusion detection in cloud environments by combining hybrid optimization techniques and advanced deep learning methodologies. The study employs prominent intrusion datasets, including CSE-CIC-IDS 2018, CIC-IDS 2017, and a cloud intrusion dataset, to assess the proposed model's performance. The study's design involves implementing the Biz-SCOP model using Matlab 2019 software on a Windows 10 OS platform, utilizing 8 GB RAM and an Intel core i3 processor. The hybrid optimization approach, termed HyPSM, is employed for feature selection, enhancing the model's efficiency. Additionally, an intelligent deep learning model, C2AE, is introduced to discern friendly and hostile communication, contributing to accurate intrusion detection. Key findings indicate that the Biz-SCOP model outperforms existing intrusion detection systems, achieving notable accuracy (99.8%), precision (99.7%), F1-score (99.8%), and GEO (99.9%). The model excels in identifying various attack types, as demonstrated by robust ROC analysis. Interpretations and conclusions emphasize the significance of hybrid optimization and advanced deep learning techniques in enhancing intrusion detection system performance. The proposed model exhibits lower computational load, reduced false positives, ease of implementation, and improved accuracy, positioning it as a promising solution for cloud security. [ABSTRACT FROM AUTHOR]

This paper focuses on enhancing the energy extraction efficiency of photovoltaic (PV) modules through the use of a straightforward power converter and control algorithm. This research delves into the electrical characteristics of PV modules, explaining the concepts of global maximum power point, and local maximum power points. By integrating maximum power point tracking algorithms and differential power processing technology, an innovative scheme for power equalization and optimization of PV modules is introduced. The scheme is based on a single-switch multi-winding forward-flyback converter. Using the STP-340-72-Vfh-type PV module as a case study, a simulation model is developed with PLECS simulation software. The simulations cover 30 different irradiance scenarios. The findings illustrate the effectiveness of the proposed PV module power optimization system in achieving maximum power output under different irradiance conditions, achieving an average efficiency of 94.61%. This efficiency rate is 13.95% greater than that of existing global maximum power tracking schemes. [ABSTRACT FROM AUTHOR]

System design is a challenging and time-consuming task which often requires close collaboration between several multidisciplinary design teams to account for complex interactions between components and sub-systems. As such, there is a growing demand in industry to create better performing, efficient, and cost-effective development tools to assist in the system design process. Additionally, the ever-increasing complexity of systems today often necessitates a shift away from manual expertise and a movement towards computer-aided design tools. This work narrows the scope of the system design process by focusing on one critical design aspect: the packaging of system components. The algorithm presented in this paper was developed to optimize the packaging of system components with consideration of practical, system-level functionalities and constraints. Using a dynamic acceleration methodology, the algorithm packages components from an initial position to a final packed position inside of a constrained volume. The motion of components from initial to final positions is driven by several acceleration forces imposed on each component. These accelerations are based on physical interactions between components and their surrounding environment. Various system-level performance metrics such as center of mass alignment and rotational inertia reduction are also considered throughout optimization. Results of several numerical case studies are also presented to demonstrate the functionality and capability of the proposed packaging algorithm. These studies include packaging problems with known optimal solutions to verify the efficacy of the algorithm. Finally, the proposed algorithm was used in a more practical study for the packaging of an urban air mobility nacelle to demonstrate the algorithm's prospective capabilities in solving real-world packaging problems. [ABSTRACT FROM AUTHOR]

With the continuous increase in the number of vehicles and people on urban roads, various traffic problems have become increasingly serious and intelligent transportation has gradually gained widespread attention. As a computing paradigm that could effectively reduce the task processing time consumption of user device and the cost of cloud server, edge computing has become an indispensable part of intelligent transportation system. However, how to reduce the load imbalance of edge computing server while ensuring that the task processing of intelligent transportation device takes less time consumption and energy consumption has become a challenge. In order to tackle this challenge, the computation offloading decision-making problem in the intelligent transportation edge computing scenario was modeled as a multi-objective optimization problem in this paper, and an adaptive multi-objective optimization algorithm (E-NSGA-III) based on NSGA-III was used to solve this problem, and comparative experiment with other methods was made. Experimental results show that compared with NSGA-II, MOEA/D and NSGA-III, proposed algorithm (E-NSGA-III) in this paper can mostly reduce time consumption by 14.28%, 18.42% and 9.82%, energy consumption by 5.59%, 6.79% and 4.83%, and load balancing variances by 21.73%, 33.46% and 18.25%. [ABSTRACT FROM AUTHOR]

There is a trend to deploy neural network on edge devices in recent years. While the mainstream of research often concerns with single edge device processing and edge-cloud two-layer neural network collaborative computing, in this paper, we propose partitioning multi-layer edge network for neural network collaborative computing. With the proposed method, sub-models of neural network are deployed on multi-layer edge devices along the communication path from end users to cloud. Firstly, we propose an optimal path selection method to form a neural network collaborative computing path with lowest communication overhead. Secondly, we establish a time-delay optimization mathematical model to evaluate the effects of different partitioning solutions. To find the optimal partition solution, an ordered elitist genetic algorithm (OEGA) is proposed. The experimental results show that, compared with traditional cloud computing, single-device edge computing and edge-cloud collaborative computing, the proposed multi-layer edge network collaborative computing has a smaller runtime delay with limited bandwidth resources, and because of the pipeline computing characteristics, the proposed method has a better response speed when processing large number of requests. Meanwhile, the OEGA algorithm has better performance than conventional methods, and the optimized partitioning method outperforms other methods like random and evenly partition. [ABSTRACT FROM AUTHOR]

Safety concerns on the deep neural networks (DNNs) have been raised when they are applied to critical sectors. In this paper, we define safety risks by requesting the alignment of network's decision with human perception. To enable a general methodology for quantifying safety risks, we define a generic safety property and instantiate it to express various safety risks. For the quantification of risks, we take the maximum radius of safe norm balls, in which no safety risk exists. The computation of the maximum safe radius is reduced to the computation of their respective Lipschitz metrics—the quantities to be computed. In addition to the known adversarial example, reachability example, and invariant example, in this paper, we identify a new class of risk—uncertainty example—on which humans can tell easily, but the network is unsure. We develop an algorithm, inspired by derivative-free optimization techniques and accelerated by tensor-based parallelization on GPUs, to support an efficient computation of the metrics. We perform evaluations on several benchmark neural networks, including ACSC-Xu, MNIST, CIFAR-10, and ImageNet networks. The experiments show that our method can achieve competitive performance on safety quantification in terms of the tightness and the efficiency of computation. Importantly, as a generic approach, our method can work with a broad class of safety risks and without restrictions on the structure of neural networks. [ABSTRACT FROM AUTHOR]

In recent years, combinatorial optimization has been widely studied. The existing optimization solutions are prone to fall into local optimal solutions and have a lower probability of obtaining global optimal solutions. Quantum approximate optimization algorithm (QAOA) is an effective algorithm that can obtain the optimal solution with high probability. In this paper, the problem Hamiltonian is obtained by summing the problem function and the deformed constraints. Through theoretical formula derivation, the problem Hamiltonian is transformed into the Ising model. The performance of the experimental result under different optimizers and asynchronous lengths is verified on pyQPanda. The experimental results show that when using the problem Hamiltonian method set in this paper, the probability of obtaining the optimal solution is 99.59%. Compared with other methods, the proposed method can alleviate the risk of falling into local optimal solutions and obtain the global optimal solution with a higher probability. [ABSTRACT FROM AUTHOR]

Biophysical models contain a large number of parameters, while the spiking characteristics of neurons are related to a few key parameters. For thalamic neurons, relay reliability is an important characteristic that affects Parkinson's state. This paper proposes a method to fit key parameters of the model based on the spiking characteristics of neurons, and improves the traditional particle swarm optimization algorithm. That is, a nonlinear concave function and a Logistic chaotic mapping are combined to adjust the inertia weight of particles to avoid the particle falling into a local optimum in the search process or appearing premature convergence. In this paper, three parameters that play an important role in Parkinson's state of the thalamic cell model are selected and fitted by the improved particle swarm optimization algorithm. Using the fitted parameters to reconstruct the neuron model can predict the spiking trajectories well, which verifies the effectiveness of the fitting method. By comparing the fitting results with other particle swarm optimization algorithms, it is shown that the proposed particle swarm optimization algorithm can better avoid local optima and converge to the optimal values quickly. [ABSTRACT FROM AUTHOR]

Deep learning has been diffusely used in bearing fault diagnosis. In view of the increasing complexity of the model and the exponential growth of the hyperparameters, the adjustment becomes increasingly difficult. In this paper, a Bayesian optimization-Deep convolution gate recurring unit (Bayes-DCGRU) based on Bayesian optimization is proposed. It adopts Bayesian optimization algorithm to automatically adjust the hyperparameters of the model, and convolutional neural network (CNN) adaptively extracts the spatial characteristics of bearing signals. Combined with the Gate recurring unit (GRU) to learn the time series characteristics of signals, and then achieve high precision bearing fault identification. This method overcomes the shortcomings of the traditional hyperparameter adjustment method based on experience and feeling. It provides a solution for the hyperparameter adjustment of bearing fault diagnosis model under multi-hyperparameter coupling. The experimental results show that the model obtained by this method converges quickly and the fault identification accuracy is higher. [ABSTRACT FROM AUTHOR]

Based on a selection of 101 articles published from 2013 to 2022, this study systematically reviews the application of intelligent techniques and optimization algorithms in textile colour management. Specifically, the study explores how these techniques have been applied to four subfields within textile colour management: colour matching and prediction, colour difference detection and assessment, colour recognition and segmentation, and dye solution concentration and decolourization. Following an introduction to intelligent techniques and optimization algorithms in textile colour management, the study describes the specific applications of these techniques in the field over the past decade. Descriptive statistics are used to analyse trends in the use of these techniques and optimization algorithms, and comparative performances indicate the effectiveness of the techniques and algorithms. The study finds that the primary intelligent techniques used in the field of textile colour management include artificial neural networks (ANN), support vector machines (SVM) such as SVM, LSSVM, LSSVR, SLSSVR, FWSVR, fuzzy logic (FL) and adaptive neuro-fuzzy inference systems (ANFIS), clustering algorithms (e.g., K-means, FCM, X-means algorithms), and extreme learning machines (ELM) such as ELM, OSLEM, KELM, RELM. The main optimization algorithms used include response surface methodology (RSM), genetic algorithms (GA), particle swarm optimization (PSO), and differential evolution (DE). Finally, the study proposes a comparison of the performance of intelligent techniques and optimization algorithms, summarizes the relevant research trends, and suggests future research opportunities and directions, besides stating the limitations of this paper. [ABSTRACT FROM AUTHOR]

This paper focuses on exploring the application possibilities and optimization problems of Generative Adversarial Networks (GANs) in spatial computing to improve design efficiency and creativity and achieve a more intelligent design process. A method for icon generation is proposed, and a basic architecture for icon generation is constructed. A system with generation and optimization capabilities is constructed to meet various requirements in spatial design by introducing the concept of interactive design and the characteristics of requirement conditions. Next, the generated icons can effectively maintain diversity and innovation while meeting the conditional features by integrating multi-feature recognition modules into the discriminator and optimizing the structure of conditional features. The experiment uses publicly available icon datasets, including LLD-Icon and Icons-50. The icon shape generated by the model proposed here is more prominent, and the color of colored icons can be more finely controlled. The Inception Score (IS) values under different models are compared, and it is found that the IS value of the proposed model is 7.05, which is higher than that of other GAN models. The multi-feature icon generation model based on Auxiliary Classifier GANs performs well in presenting multiple feature representations of icons. After introducing multi-feature recognition modules into the network model, the peak error of the recognition network is only 2.000 in the initial stage, while the initial error of the ordinary GAN without multi-feature recognition modules is as high as 5.000. It indicates that the improved model effectively helps the discriminative network recognize the core information of icon images more quickly. The research results provide a reference basis for achieving more efficient and innovative interactive space design. [ABSTRACT FROM AUTHOR]

In electrical power systems, FACTS devices effectively control power flow and change bus voltages, leading to lower system losses and excellent system stability. The article discusses the research from the last decade that evaluated various methods for placing FACTS devices using the meta-heuristic approach to address the positioning of FACTS devices to maintain proper bus voltages and control line flow and improve the overall system efficiency. The need for more efficient electricity systems management has given rise to innovative technologies in power generation and transmission. The combined cycle power station is a good example of a new development in power generation and flexible AC transmission systems, generally known as FACTS, are controllers that improve transmission systems. Worldwide transmission systems are undergoing continuous changes and restructuring. They are becoming more heavily loaded and are being operated in ways not originally envisioned. Transmission systems must be flexible to react to more diverse generation and load patterns. In addition, the economical utilization of transmission system assets is of vital importance to enable utilities in industrialized countries to remain competitive and to survive. In developing countries, the optimized use of transmission systems investments is also important to support industry, create employment and utilize efficiently scarce economic resources. FACTS controller is a technology that responds to these needs. It significantly alters the way transmission systems are developed and controlled together with improvements in asset utilization, system flexibility and system performance. Several models and techniques suggest that devices can be placed in a particular location with different parameter settings. Finally, the optimization problem improved system performance by decreasing power loss, improving the voltage profile and power angle at each bus, raising the L-index, and minimizing generating costs. FACTS devices can increase the transmission line's capacity for transferring power by increasing the voltage at its terminals at both ends and reducing line reactance. The FACTS controller must be installed in the distribution and transmission lines to maximize the power flow. Various techniques are used for the best placement of FACTS controllers, including analytical methods, arithmetic programming approaches, meta-heuristic optimization approaches, and hybrid approaches—this paper analyses numerous analytical and meta-heuristic optimization techniques to place FACTS controllers in the most advantageous locations. The fundamental problems in intelligent power systems, such as improving stability, power quality, and managing congestion, are discussed in this study, along with several applications of FACTS devices. The cutting-edge power systems of today provide users with constant, high-quality power through smart grids and smart meters. [ABSTRACT FROM AUTHOR]

As the core technology of Transformers, the attention mechanism is almost indispensable. However, many experimental findings show that the models developed based on the attention mechanism are not as perfect as imagined, and there are pitfalls in their ability to capture effective information, especially in some multi-modal tasks. In this paper, we continue to delve into this issue and try to uncover the mysterious nature of the attention mechanism through powerful explainable causal inference techniques. At the theoretical level, we rigorously characterize the capacity bottleneck of the attention mechanism in multi-modal tasks and demonstrate the shortcomings of the attention model in its ability to weed out invalid features. Further, we obtain results consistent with the theoretical analysis in the experimental session. In particular, the model optimized under the guidance of our theoretical analysis achieves superiority over state-of-the-art methods in visual question-answering tasks. Excitingly, we find that the attention mechanism's defects can be repaired, and the repair method has strong generalization properties. This distinct advantage will provide a clear interpretable optimization technique for the attention-based framework. [ABSTRACT FROM AUTHOR]

The utilization of recycled aggregates (RA) for concrete production has the potential to offer substantial environmental and economic advantages. However, RA concrete is plagued with considerable durability concerns, particularly carbonation. To advance the application of RA concrete, the establishment of a reliable model for predicting the carbonation is needed. On the one hand, concrete carbonation is a long and slow process and thus consumes a lot of time and energy to monitor. On the other hand, carbonation is influenced by many factors and is hard to predict. Regarding this, this paper proposes the use of machine learning techniques to establish accurate prediction models for the carbonation depth (CD) of RA concrete. Three types of regression techniques and meta-heuristic algorithms were employed to provide more alternative predictive tools. It was found that the best prediction performance was obtained from extreme gradient boosting-multi-universe optimizer (XGB-MVO) with R2 value of 0.9949 and 0.9398 for training and testing sets, respectively. XGB-MVO was used for evaluating physical laws of carbonation and it was found that the developed XGB-MVO model could provide reasonable predictions when new data were investigated. It also showed better generalization capabilities when compared with different models in the literature. Overall, this paper emphasizes the need for sustainable solutions in the construction industry to reduce its environmental impact and contribute to sustainable and low-carbon economies. [ABSTRACT FROM AUTHOR]

In recent years, wireless sensor network (WSN) has been widely used in many fields. Network coverage is the basis of providing perception services and collecting location information and has become one of the hot topics. For node deployment, this paper proposes two algorithms. One is an improved virtual force (VF) algorithm. The virtual forces of nodes include repulsive force between nodes and repulsive force at the boundary. The improved VF algorithm sets the virtual force threshold. The other is the resampling particle swarm optimization algorithm embedded with virtual force (RPSO-DV). The algorithm combines the advantages of three algorithms, including resampling particle swarm optimization (RPSO) algorithm, particle swarm optimization algorithm based on coefficient adjustment (PSO-D) and improved VF algorithm. In this paper, the two proposed algorithms and reference algorithms in the pieces of literature and are simulated and compared. Firstly, this paper compares the impact of different node numbers and deployment modes on coverage performance in the improved VF algorithm. The simulation shows that the improved VF algorithm can make the network reach a stable state quickly and achieve a high coverage rate. Secondly, this paper lists the confidence intervals for the coverage rate of multiple algorithms at the significance level of 0.05. At the same time, we analyze the specific coverage rate curves and deployment diagrams. The simulation results show that our proposed RPSO-DV algorithm improves the diversity of the population and speeds up the convergence speed. Compared with other reference algorithms, the RPSO-DV algorithm has the highest coverage rate. Finally, this paper analyzes the sensitivity of the parameters of the proposed RPSO-DV algorithm. According to the orthogonal experiment design method, we design 64 sets of experiments. The simulation results show that the algorithm has a certain tolerance and robustness to parameter values. [ABSTRACT FROM AUTHOR]

In this paper, production system (PS) of shale oil is optimized according to production data and indoor experiments, including core and fluid tests. Results showed that: ① Pressure drop rate at wellhead is a reasonable reference for the determination of post-fracture shut-in duration (PFSID). When pressure at a wellhead of horizontal well is relatively stable and the pressure drop less than 0.1 MPa per day for three consecutive days, PFSID ends; ② Flowback intensity of fracturing fluid affects the effectiveness of proppant underground, thus flowback intensity can be determined by the critical flow rate and safety factor of each proppant; ③ Flowback intensity should be varied during different development stages, which could be divided into four according to production gas and oil ratio(GOR) of a shale oil horizontal well: low, medium–high, high and high-low production GOR. During the stage of low production GOR, ratio of flow pressure and saturation pressure should be maintained greater than 1.0, and the initial daily liquid productivity for a hundred-meter oil-bearing lateral length in a horizontal well is 2.4 ~ 2.9 m3/d; and during the medium–high production GOR, high production GOR and high-low production GOR stages, the responding initial daily liquid productivity should be maintained between 0.8 ~ 1.0 or less than 0.8 respectively. [ABSTRACT FROM AUTHOR]