Enhanced asphalt dynamic modulus prediction: A detailed analysis of artificial hummingbird algorithm-optimised boosted trees

This study introduces and evaluates a novel artificial hummingbird algorithm-optimised boosted tree(AHAboosted)model for predicting the dynamic modulus(E*)of hot mix asphalt concrete.Using a substantial dataset from NCHRP Report-547,the model was trained and rigorously tested.Performance metrics,specifically RMSE,MAE,and R2,were employed to assess the model's predictive accuracy,robustness,and generalisability.When benchmarked against well-established models like support vector machines(SVM)and gaussian process regression(GPR),the AHA-boosted model demonstrated enhanced performance.It achieved R2 values of 0.997 in training and 0.974 in testing,using the traditional Witczak NCHRP 1-40D model inputs.Incorporating features such as test temperature,frequency,and asphalt content led to a 1.23%increase in the test R2,signifying an improvement in the model's accuracy.The study also explored feature importance and sensitivity through SHAP and permutation importance plots,highlighting binder complex modulus|G*|as a key predictor.Although the AHA-boosted model shows promise,a slight decrease in R2 from training to testing indicates a need for further validation.Overall,this study confirms the AHA-boosted model as a highly accurate and robust tool for predicting the dynamic modulus of hot mix asphalt concrete,making it a valuable asset for pavement engineering.

Storage dynamics of fallen trees in a mixed broadleaved and Korean pine forest

A study of the storage dynamics in the mixed broadleaved and Korean pine forests was carried out in the Changbai Mountains, Jilin Province, P. R. China. The modifying law of fallen trees was the storage dynamics of the existing fallen trees and the annual input in the mixed broadleaved and Korean pine forest. The current storage of fallen trees was 16.25 t昲m-2 in the initially, but after 100 years, 85% of the storage in dry weight was decomposed, and little material was left after 300 years. The average annual input of fallen trees was 0.6 t昲m-2and it increased with time to 31.0 t昲m-2after 200 years, which was maintained until the climax community ended. The total storage of fallen trees increased in the early stage. The decomposition of fallen trees eventually reached equilibrium with storage being identical with the annual input of fallen trees.

Dynamic load balancing based on restricted multicast tree in triplet-based hierarchical interconnection network

To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.

Vertical Distribution and Seasonal Dynamics of Fine Root Parameters for Apple Trees of Different Ages on the Loess Plateau of China

The vertical distribution pattern and seasonal dynamics of fine root parameters for the apple trees of different ages （3, 10, 15, and 20 years old） on the Loess Plateau of China were studied. Soil coring method was used to determine the vertical distribution and seasonal dynamics of fine roots at different root radial distances （1.0, 1.5, and 2.0 m from the main tree trunk）. The fine root biomass density （FRD）, fine root length density （RLD）, and specific root length （SRL）, as well as soil water content and soil temperature were also measured. The FRD and RLD for the 10, 15, and 20 years old trees reached peak values in the 20-30 cm soil layer. For the 3 years old tree, the highest FRD and RLD were observed in the 10-20 cm soil layer. The FRD and RLD decreased with increased soil depth from the 10-20 or 20-30 cm soil layer for all age apple trees. The SRL declined with the increase of tree age. The FRD at the 1.0 m radial distance from the main tree trunk was higher than that at other radial distances in the 3 and 10 years old orchard. However, in the 15 and 20 years old orchards, especially the 20 years old orchard, the FRD at the 2.0 m radial distance was nearly equal to or higher than that at the 1.0 and 1.5 m radial distances. For all the root radiuses or the tree ages, the FRD, RLD, and SRL were the highest in spring and the lowest in autumn. The age of an apple tree does not affect the vertical distribution pattern but the biomass of fine roots and the SRL. Radial distance affects the root horizontal distribution of 3 and 10 years old trees but the 15 and 20 years old trees. Additionally, effects of soil temperature and soil moisture on fine root distribution or seasonal dynamics are not significant.

Reliability Analysis of Electrical System of CNC Machine Tool Based on Dynamic Fault Tree Analysis Method

The electrical system of CNC machine tool is very complex which involves many uncertain factors and dynamic stochastic characteristics when failure occurs.Therefore,the traditional system reliability analysis method,fault tree analysis(FTA)method,based on static logic and static failure mechanism is no longer applicable for dynamic systems reliability analysis.Dynamic fault tree(DFT)analysis method can solve this problem effectively.In this method,DFT first should be pretreated to get a simplified fault tree(FT);then the FT was modularized to get the independent static subtrees and dynamic subtrees.Binary decision diagram(BDD)analysis method was used to analyze static subtrees,while an approximation algorithm was used to deal with dynamic subtrees.When the scale of each subtree is smaller than the system scale,the analysis efficiency can be improved significantly.At last,the usefulness of this DFT analysis method was proved by applying it to analyzing the reliability of electrical system.

A system dynamics model for billion trees tsunami afforestation project of Khyber Pakhtunkhwa in Pakistan:Model application to afforestation activities

As part of the global effort to plant billion trees,an afforestation project is launched in Pakistan in Khyber Pakhtunkhwa(KP)province to conserve existing forests and to increase area under forest cover.The present study is designed to build a Systems'model by incorporating major activities of the Billion Tree Tsunami Afforestation Project(BTTAP)with special focus on afforestation activities to estimate the growth in forest area of KP.Availability of complete dataset was a challenge.To fix the model,the raw data taken from the project office has been utilized.Planning Commission Form 1-Phase I&II helped us with additional information.We relied on the data available for one and half period of the project as rest of the data is subject to the completion of the project.Our results show that the project target to enhance area under forest differs from the target to afforest area under the project.The system dynamics'model projection shows that the forest area of KP would be 23.59 million hectares at the end of the BTTA project,thus having an increase of 3.29%instead of 2%that has been initially proposed.However,the results show that the progress to meet the target in some afforestation classes is slow as compared to other categories.Farm forestry,plantation on communal lands and owners'plantation need special focus of the authority.Deforestation would affect 0.02 million hectares area of the project.The model under study may be used as a reference model that can be replicated to other areas where billion tree campaigns are going on.

Dynamic Load Balancing Based on Restricted Multicast Tree in Homogeneous Multiprocessor Systems

To decrease the cost of exchanging load information among processors, a dynamic load-balancing （DLB） algorithm which adopts multieast tree technology is proposed. The muhieast tree construction rules are also proposed to avoid wrongly transferred or redundant DLB messages due to the overlapping of multicast trees. The proposed DLB algorithm is distributed controlled, sender initiated and can help heavily loaded processors with complete distribution of redundant loads with minimum number of executions. Experiments were executed to compare the effects of the proposed DLB algorithm and other three ones, the results prove the effectivity and practicability of the proposed algorithm in dealing with great scale compute-intensive tasks.

The Dynamic-to-Static Conversion of Dynamic Fault Trees Using Stochastic Dependency Graphs and Stochastic Activity Networks

In this paper a new modeling framework for the dependability analysis of complex systems is presented and related to dynamic fault trees (DFTs). The methodology is based on a modular approach: two separate models are used to handle, the fault logic and the stochastic dependencies of the system. Thus, the fault schema, free of any dependency logic, can be easily evaluated, while the dependency schema allows the modeler to design new kind of non-trivial dependencies not easily caught by the traditional holistic methodologies. Moreover, the use of a dependency schema allows building a pure behavioral model that can be used for various kinds of dependability studies. In the paper is shown how to build and integrate the two modular models and convert them in a Stochastic Activity Network. Furthermore, based on the construction of the schema that embeds the stochastic dependencies, the procedure to convert DFTs into static fault trees is shown, allowing the resolution of DFTs in a very efficient way.

Study on System Failure Probability Model Based on Dynamic Fault Tree

Aiming at the characteristics of complex logic relation and multiple dynamic gates in system,its failure probability model is established based on dynamic fault tree. For the multi-state dynamic fault tree,it can be transferred into Markov chain with continuous parameters. The state transfer diagram can be decomposed into several state transfer chains,and the failure probability models can be derived according to the lengths of the chains. Then,the failure probability of the dynamic fault tree analysis(DFTA) can be obtained by adding each chain's probability. The failure probability calculation of DFTA based on the continuous parameter Markov chain is proposed and proved. Given an example,the analytic method is compared with the conventional methods which have to solve the differential equation. It is known from the results that the analytic method can be applied to engineering easily.

CLUSTER OF WORKSTATIONS BASED ON DYNAMIC LOAD BALANCING FOR PARALLEL TREE COMPUTATION DEPTH-FIRST-SEARCH

The real problem in cluster of workstations is the changes in workstation power or number of workstations or dynmaic changes in the run time behavior of the application hamper the efficient use of resources. Dynamic load balancing is a technique for the parallel implementation of problems, which generate unpredictable workloads by migration work units from heavily loaded processor to lightly loaded processors at run time. This paper proposed an efficient load balancing method in which parallel tree computations depth first search (DFS) generates unpredictable, highly imbalance workloads and moves through different phases detectable at run time, where dynamic load balancing strategy is applicable in each phase running under the MPI(message passing interface) and Unix operating system on cluster of workstations parallel platform computing.

Dynamic Fault Tree Analysis for Explosive Logic Network with Two-Input-One-Output

The explosive logic network( ELN) with two-input-oneoutput was designed with three explosive logic gap null gates. The time window of the output of the ELN was given,after which the dynamic fault tree analysis was implemented. Two dynamic failure modes of the ELN were obtained,and then their own Markov transition processes were established. After that,the probability of failure was calculated from the corresponding state transition diagram. The reliability of the ELN which was in different length of time under the ambient incentive was then analyzed. Based on the above processing,the reliability of the ELN can be improved.

A Dynamic Programming Algorithm for the Ridersharing Problem Restricted with Unique Destination and Zero Detour on Trees

We deal with the problem of sharing vehicles by individuals with similar itineraries which is to find the minimum number of drivers, each of which has a vehicle capacity and a detour to realize all trips. Recently, Gu et al. showed that the problem is NP-hard even for star graphs restricted with unique destination, and gave a polynomial-time algorithm to solve the problem for paths restricted with unique destination and zero detour. In this paper we will give a dynamic programming algorithm to solve the problem in polynomial time for trees restricted with unique destination and zero detour. In our best knowledge it is a first polynomial-time algorithm for trees.

Implementation Study of Dynamic Load Balancing Algorithm of Parallel Tree Computation on Clusters of Heterogeneous Workstation

The rapid growth of interconnected high performance workstations has produced a new computing paradigm called clustered of workstations computing. In these systems load balance problem is a serious impediment to achieve good performance. The main concern of this paper is the implementation of dynamic load balancing algorithm, asynchronous Round Robin (ARR), for balancing workload of parallel tree computation depth-first-search algorithm on Cluster of Heterogeneous Workstations (COW) Many algorithms in artificial intelligence and other areas of computer science are based on depth first search in implicitty defined trees. For these algorithms a load-balancing scheme is required, which is able to evenly distribute parts of an irregularly shaped tree over the workstations with minimal interprocessor communication and without prior knowledge of the tree’s shape. For the (ARR) algorithm only minimal interprocessor communication is needed when necessary and it runs under the MPI (Message passing interface) that allows parallel execution on heterogeneous SUN cluster of workstation platform. The program code is written in C language and executed under UNIX operating system (Solaris version).

An Efficient Encrypted Speech Retrieval Based on Unsupervised Hashing and B+ Tree Dynamic Index

Existing speech retrieval systems are frequently confronted with expanding volumes of speech data.The dynamic updating strategy applied to construct the index can timely process to add or remove unnecessary speech data to meet users’real-time retrieval requirements.This study proposes an efficient method for retrieving encryption speech,using unsupervised deep hashing and B+ tree dynamic index,which avoid privacy leak-age of speech data and enhance the accuracy and efficiency of retrieval.The cloud’s encryption speech library is constructed by using the multi-threaded Dijk-Gentry-Halevi-Vaikuntanathan(DGHV)Fully Homomorphic Encryption(FHE)technique,which encrypts the original speech.In addition,this research employs Residual Neural Network18-Gated Recurrent Unit(ResNet18-GRU),which is used to learn the compact binary hash codes,store binary hash codes in the designed B+tree index table,and create a mapping relation of one to one between the binary hash codes and the corresponding encrypted speech.External B+tree index technology is applied to achieve dynamic index updating of the B+tree index table,thereby satisfying users’needs for real-time retrieval.The experimental results on THCHS-30 and TIMIT showed that the retrieval accuracy of the proposed method is more than 95.84%compared to the existing unsupervised hashing methods.The retrieval efficiency is greatly improved.Compared to the method of using hash index tables,and the speech data’s security is effectively guaranteed.

Modular solution of dynamic multiple-phased systems

A new modular solution to the state explosion problem caused by the Markov-based modular solution of dynamic multiple-phased systems is proposed. First, the solution makes full use of the static parts of dynamic multiple-phased systems and constructs cross-phase dynamic modules by combining the dynamic modules of phase fault trees. Secondly, the system binary decision diagram （BDD） from a modularized multiple- phased system （MPS）is generated by using variable ordering and BDD operations. The computational formulations of the BDD node event probability are derived for various node links and the system reliability results are figured out. Finally, a hypothetical multiple-phased system is given to demonstrate the advantages of the dynamic modular solution when the Markov state space and the size of the system BDD are reduced.

Optimization of a dynamic uncertain causality graph for fault diagnosis in nuclear power plant

Fault diagnostics is important for safe operation of nuclear power plants(NPPs). In recent years, data-driven approaches have been proposed and implemented to tackle the problem, e.g., neural networks, fuzzy and neurofuzzy approaches, support vector machine, K-nearest neighbor classifiers and inference methodologies. Among these methods, dynamic uncertain causality graph(DUCG)has been proved effective in many practical cases. However, the causal graph construction behind the DUCG is complicate and, in many cases, results redundant on the symptoms needed to correctly classify the fault. In this paper, we propose a method to simplify causal graph construction in an automatic way. The method consists in transforming the expert knowledge-based DCUG into a fuzzy decision tree(FDT) by extracting from the DUCG a fuzzy rule base that resumes the used symptoms at the basis of the FDT. Genetic algorithm(GA) is, then, used for the optimization of the FDT, by performing a wrapper search around the FDT: the set of symptoms selected during the iterative search are taken as the best set of symptoms for the diagnosis of the faults that can occur in the system. The effectiveness of the approach is shown with respect to a DUCG model initially built to diagnose 23 faults originally using 262 symptoms of Unit-1 in the Ningde NPP of the China Guangdong Nuclear Power Corporation. The results show that the FDT, with GA-optimized symptoms and diagnosis strategy, can drive the construction of DUCG and lower the computational burden without loss of accuracy in diagnosis.

Reliability Analysis for Complex Systems Based on Dynamic Evidential Network Considering Epistemic Uncertainty

Fault tolerant technology has greatly improved the reliability of modern systems on one hand and makes their failure mechanisms more complex on the other.The characteristics of dynamics of failure,diversity of distribution and epistemic uncertainty always exist in these systems,which increase the challenges in the reliability assessment of these systems significantly.This paper presents a novel reliability analysis framework for complex systems within which the failure rates of components are expressed in interval numbers.Specifically,it uses a dynamic fault tree(DFT)to model the dynamic fault behaviors and copes with the epistemic uncertainty using Dempster-Shafer(D-S)theory and interval numbers.Furthermore,an approach is presented to convert a DFT into a dynamic evidential network(DEN)to calculate the reliability parameters.Additionally,a sorting method based on the possibility degree is proposed to rank the importance of components represented by interval numbers in order to obtain the most critical components,which can be used to provide the guidance for system design,maintenance planning and fault diagnosis.Finally,a numerical example is provided to illustrate the availability and efficiency of the proposed method.

Time Delay Identification in Dynamical Systems Based on Interpretable Machine Learning

The existence of time delay in complex industrial processes or dynamical systems is a common phenomenon and is a difficult problem to deal with in industrial control systems,as well as in the textile field.Accurate identification of the time delay can greatly improve the efficiency of the design of industrial process control systems.The time delay identification methods based on mathematical modeling require prior knowledge of the structural information of the model,especially for nonlinear systems.The neural network-based identification method can predict the time delay of the system,but cannot accurately obtain the specific parameters of the time delay.Benefit from the interpretability of machine learning,a novel method for delay identification based on an interpretable regression decision tree is proposed.Utilizing the self-explanatory analysis of the decision tree model,the parameters with the highest feature importance are obtained to identify the time delay of the system.Excellent results are gained by the simulation data of linear and nonlinear control systems,and the time delay of the systems can be accurately identified.

Dynamic Time and Location Information in Ciphertext-Policy Attribute-Based Encryption with Multi-Authorization

Due to the mobility of users in an organization,inclusion of dynamic attributes such as time and location becomes the major challenge in Ciphertext-Policy Attribute-Based Encryption(CP-ABE).By considering this challenge;we focus to present dynamic time and location information in CP-ABE with mul-ti-authorization.Atfirst,along with the set of attributes of the users,their corre-sponding location is also embedded.Geohash is used to encode the latitude and longitude of the user’s position.Then,decrypt time period and access time period of users are defined using the new time tree(NTT)structure.The NTT sets the encrypted duration of the encrypted data and the valid access time of the private key on the data user’s private key.Besides,single authorization of attribute authority(AA)is extended as multi authorization for enhancing the effectiveness of key generation.Simulation results depict that the proposed CP-ABE achieves better encryption time,decryption time,security level and memory usage.Namely,encryption time and decryption time of the proposed CP-ABE are reduced to 19%and 16%than that of existing CP-ABE scheme.

Learning-Based Dynamic Connectivity Maintenance for UAV-Assisted D2D Multicast Communication

Unmanned aerial vehicles(UAVs) enable flexible networking functions in emergency scenarios.However,due to the movement characteristic of ground users(GUs),it is challenging to capture the interactions among GUs.Thus,we propose a learningbased dynamic connectivity maintenance architecture to reduce the delay for the UAV-assisted device-todevice(D2D) multicast communication.In this paper,each UAV transmits information to a selected GU,and then other GUs receive the information in a multi-hop manner.To minimize the total delay while ensuring that all GUs receive the information,we decouple it into three subproblems according to the time division on the topology:For the cluster-head selection,we adopt the Whale Optimization Algorithm(WOA) to imitate the hunting behavior of whales by abstracting the UAVs and cluster-heads into whales and preys,respectively;For the D2D multi-hop link establishment,we make the best of social relationships between GUs,and propose a node mapping algorithm based on the balanced spanning tree(BST) with reconfiguration to minimize the number of hops;For the dynamic connectivity maintenance,Restricted Q-learning(RQL) is utilized to learn the optimal multicast timeslot.Finally,the simulation results show that our proposed algorithms perfor better than other benchmark algorithms in the dynamic scenario.