Conventional Tree Research Articles

Transgenic poplar for resistance against pest and pathogen attack in forests: an overview

Forests are potential habitats for immense terrestrial ecosystems and aquatic biodiversity, performing an essential role in ecological preservation and regulation of climate. The anthropogenic pressures on the forests lead to forest loss, fragmentation and degradation. Requirements for sustainable methodologies for forest protection are of utmost priority under the climate change regime. Among forest trees, poplar trees (Populus L.) have attracted attention in global forestry as a promising material for improving the quality and quantity of urban landscapes. These plants provide wood, which can be utilized as raw resources for the paper industry and as a potential source of biofuel. However, several biotic stresses, such as attacks by pests and pathogens, severely affect poplar production and productivity. The improvement of Populus trees through conventional tree breeding methods is restricted due to their long-life cycles and the lack of suitable donors with resistance genes. Populus has been utilized as a model plant for studying gene functions due to its highly efficient genetic transformation capabilities. The present review will provide a comprehensive overview of pest and pathogen attacks on poplar, focusing on their infection mechanisms, transmission routes, and control strategies. Additionally, it will examine the most widely used genetic transformation methods (gene gun-mediated, Agrobacterium tumefaciens-mediated, protoplast transformation, micro-RNA mediated and micro-RNA clustered regularly interspaced short palindromic repeats (CRISPR)-associated (CRISPR-Cas) systems methods and RNA interference) for improving tolerance in poplar trees against pest and pathogens attack. Furthermore, it will delve into prospects, challenges, and recent advances in molecular biology tools and their safe application for genetic transformation to improve insect and pest resistance in poplar trees. Finally, the regeneration of transgenic poplar trees with enhanced resistance, developed through various genetic engineering techniques, is discussed.

Random Polynomial Neural Networks: Analysis and Design.

In this article, we propose the concept of random polynomial neural networks (RPNNs) realized based on the architecture of polynomial neural networks (PNNs) with random polynomial neurons (RPNs). RPNs exhibit generalized polynomial neurons (PNs) based on random forest (RF) architecture. In the design of RPNs, the target variables are no longer directly used in conventional decision trees, and the polynomial of these target variables is exploited here to determine the average prediction. Unlike the conventional performance index used in the selection of PNs, the correlation coefficient is adopted here to select the RPNs of each layer. When compared with the conventional PNs used in PNNs, the proposed RPNs exhibit the following advantages: first, RPNs are insensitive to outliers; second, RPNs can obtain the importance of each input variable after training; third, RPNs can alleviate the overfitting problem with the use of an RF structure. The overall nonlinearity of a complex system is captured by means of PNNs. Moreover, particle swarm optimization (PSO) is exploited to optimize the parameters when constructing RPNNs. The RPNNs take advantage of both RF and PNNs: it exhibits high accuracy based on ensemble learning used in the RF and is beneficial to describe high-order nonlinear relations between input and output variables stemming from PNNs. Experimental results based on a series of well-known modeling benchmarks illustrate that the proposed RPNNs outperform other state-of-the-art models reported in the literature.

Urban tree health assessment using multifaceted remote sensing datasets: A case study in Hong Kong

Although climate change is impacting various aspects of our environment, it is important to note that the overall risk to trees remains low, especially in urban areas like Hong Kong where the benefits of trees to society are significant. The trees planted in an urban setting are isolated and have several limiting factors including, excessive run-off, urban pollution, physical damage and limited root growth, which sometimes lead for tree failure incidents. The conventional on-site tree health assessment method is time consuming thus, requiring a remote sensing based method to effectively and routinely monitor the health status of urban trees. In this study several types of remote sensing datasets have been exploited to assess the health status of more than 700 Old and Valuable Trees (OVTs) and Stone Wall Trees (SWTs) around Hong Kong. These datasets include the data from Terrestrial LiDAR (Light Detection and Ranging) Surveys (TLS), Handheld Laser Scanner (HLS), Airborne LiDAR Surveys (ALS) and airborne multispectral data. For validation purpose, the in situ tree parameters data was also obtained from the Tree Management Office (TMO) of the Greening, Landscape & Tree Management Section (GLTMS) under the Development Bureau of the Hong Kong SAR Government. The results have indicated that over the period of four years (2017–2020) there has been a decline in the health of some target trees which can be attributed to the increased infestation rate in trees and severe weather conditions. The usage of LiDAR data has supported the fact that different tree structural forms can effectively be extracted and can help making informed decisions on the precise health conditions of urban trees.

Computationally efficient Complete-Sampling-based fault tree analyses for seismic probabilistic safety assessment of nuclear facilities

The seismic risk of nuclear power plants (NPPs) can be assessed through seismic probabilistic safety assessment (PSA) based on fault tree analyses (FT). The conventional FT-based approach has limitations for handling the correlated relation of basic events and utilizing the sampling-based FT analysis for addressing such issues demands considerable computational cost. In particular, accurate consideration of the partial dependences between the failure probabilities of NPP components in seismic hazard events can further increase the computational cost of risk quantification. Therefore, this paper presents an improved complete-sampling-based seismic PSA risk quantification method. The novelty of this method is that it increases the efficiency of the risk quantification by introducing sequential sampling and truncation to the conventional fault tree analysis. In addition, as sub-concepts, we eliminate unrequired sampling extraction steps via integrated multivariate response distribution-based sampling for components and continual evaluation of the convergence of system failure probabilities. On three considered examples, including an actual NPP, the proposed method requires 91%–96% fewer samples than the conventional method, without sacrificing accuracy. These results indicate the efficiency of the proposed method, which is expected to become a useful tool in the future.

Integration of prediction and optimization for smart stock portfolio selection

Machine learning (ML) algorithms pose significant challenges in predicting unknown parameters for optimization models in decision-making scenarios. Conventionally, prediction models are optimized independently in decision-making processes, whereas ML algorithms primarily focus on minimizing prediction errors, neglecting the role of decision-making in downstream optimization tasks. The pursuit of high prediction accuracy may not always align with the goal of reducing decision errors. The idea of reducing decision errors has been proposed to address this limitation. This paper introduces an optimization process that integrates predictive regression models within a mean–variance optimization setting. This innovative technique introduces a general loss function to capture decision errors. Consequently, the predictive model not only focuses on forecasting unknown optimization parameters but also emphasizes the predicted values that minimize decision errors. This approach prioritizes decision accuracy over the potential accuracy of unknown parameter prediction. In contrast to traditional ML approaches that minimize standard loss functions such as mean squared error, our proposed model seeks to minimize the objective value derived directly from the decision-making problem. Furthermore, this strategy is validated by developing an optimization-based regression tree model for predicting stock returns and reducing decision errors. Empirical evaluations of our framework reveal its superiority over conventional regression tree methods, demonstrating enhanced decision quality. The computational experiments are conducted on a stock market dataset to compare the effectiveness of the proposed framework with the conventional regression tree-based approach. Remarkably, the results confirm the strengths inherent in this holistic approach.

A Consumer-Centric Approach for a Sustainable Honey Supply Chain: The Case of Strawberry Tree Honey

The consumption of honey has gained significant attention in recent years due to its numerous health benefits. It is important to understand the role of consumers in the honey supply chain, as their preferences have a substantial impact on industry practices. Consumer demand for high-quality, safe, and sustainable honey encourages producers to improve transparency and sustainability in their operations. This consumer-centric approach is essential for creating strong connections between supply chain stakeholders and end-users, promoting a more sustainable food system. This study centres on strawberry tree honey, which is rich in antioxidants, anti-inflammatory properties, and antimicrobial activities. It explores the key factors driving consumer choices in strawberry tree honey and evaluates their impact across the entire supply chain. A survey examined consumer preferences for conventional honey and organic strawberry tree honey, revealing a clear trend toward sustainable options. The findings highlighted the significant impact of consumer behaviour on driving sustainable practices within the honey supply chain. This study also shed light on consumers’ perceptions of organic strawberry tree honey and their connection to the entire supply chain. These findings support previous studies on organic products, demonstrating the crucial link between consumer choices for organic honey and the sustainability of the supply chain.

PPB-MCTS: A novel distributed-memory parallel partial-backpropagation Monte Carlo tree search algorithm

Monte-Carlo Tree Search (MCTS) is an adaptive and heuristic tree-search algorithm designed to uncover sub-optimal actions at each decision-making point. This method progressively constructs a search tree by gathering samples throughout its execution. Predominantly applied within the realm of gaming, MCTS has exhibited exceptional achievements. Additionally, it has displayed promising outcomes when employed to solve NP-hard combinatorial optimization problems. MCTS has been adapted for distributed-memory parallel platforms. The primary challenges associated with distributed-memory parallel MCTS are the substantial communication overhead and the necessity to balance the computational load among various processes. In this work, we introduce a novel distributed-memory parallel MCTS algorithm with partial backpropagations, referred to as Parallel Partial-Backpropagation MCTS (PPB-MCTS). Our design approach aims to significantly reduce the communication overhead while maintaining, or even slightly improving, the performance in the context of combinatorial optimization problems. To address the communication overhead challenge, we propose a strategy involving transmitting an additional backpropagation message. This strategy avoids attaching an information table to the communication messages exchanged by the processes, thus reducing the communication overhead. Furthermore, this approach contributes to enhancing the decision-making accuracy during the selection phase. The load balancing issue is also effectively addressed by implementing a shared transposition table among the parallel processes. Furthermore, we introduce two primary methods for managing duplicate states within distributed-memory parallel MCTS, drawing upon techniques utilized in addressing duplicate states within sequential MCTS. Duplicate states can transform the conventional search tree into a Directed Acyclic Graph (DAG). To evaluate the performance of our proposed parallel algorithm, we conduct an extensive series of experiments on solving instances of the Job-Shop Scheduling Problem (JSSP) and the Weighted Set-Cover Problem (WSCP). These problems are recognized for their complexity and classified as NP-hard combinatorial optimization problems with considerable relevance within industrial applications. The experiments are performed on a cluster of computers with many cores. The empirical results highlight the enhanced scalability of our algorithm compared to that of the existing distributed-memory parallel MCTS algorithms. As the number of processes increases, our algorithm demonstrates increased rollout efficiency while maintaining an improved load balance across processes.

P‐249: Late‐News Poster: A Low Power Digital Logic Structure for High Resolution and High Frame Rate OLEDoS Micro Displays

This paper proposes a digital logic circuit in the source driver for OLEDoS micro display which uses a novel data signal tree structure with clock gating logic to reduce power consumption. The proposed structure for 4096×4096 (4K) 144 Hz micro displays was verified using a CMOS 110 nm process. The power consumption was reduced by 69.6 % compared to the conventional data signal tree structure, enabling a low‐power design.

Asynchronous verifiable information dispersal protocol of achieving optimal communication

The evolution of distributed systems necessitates robust protocols to facilitate secure and efficient data storage and retrieval amid challenges like asynchronous communication and adversarial threats. However, achieving the theoretical lower bounds of communication cost in Asynchronous Verifiable Information Dispersal (AVID) protocols remains an unresolved issue, prompting the need for innovation in this domain.In this paper, we propose a new AVID protocol designed to optimize communication cost. In contrast to previous approaches, we leverage vector commitment (VC) technology combined with erasure codes, replacing conventional hash tree structures or error correction codes. This approach results in significant O(logn) communication savings. Additionally, our research reveals that while ensuring simultaneous output from all honest nodes is desirable to satisfy Totality, it is not necessary for all nodes to receive corresponding shares or proofs during the Dispersal phase. This insight allows us to circumvent the common O(n2κ) communication overhead.Our AVID protocol achieves an optimal dispersal cost of O(|M|+n2) compared to the prior best of O(|M|+κn2). Furthermore, each node in our protocol incurs a storage cost of O(|M|/n+κ) bits, while the retrieval cost per client is O(|M|+nκ).

An Alternative Method for Upgrading the Conventional Decision Tree Algorithm

An Alternative Method for Upgrading the Conventional Decision Tree Algorithm

Global mapping of fractional tree cover for forest cover change analysis

Fractional tree cover facilitates the characterization of forest cover changes using satellite data. However, there are still substantial challenges in generating fractional tree cover datasets that satisfy the requirements of interannual stability for forest cover change monitoring. In this study, a global annual fractional tree cover dataset, named as GLOBMAP Fractional Tree Cover, was generated from MODIS observations with a resolution of 250 m during the period of 2000–2022. The tree cover estimation was improved relative to conventional global tree cover mapping methods by developing highly discriminative input features and near global sampling training data. MODIS annual observations were realigned at the pixel level to eliminate phenological differences among regions. The realigned annual series were condensed into twelve features showing high separability between trees and herbaceous vegetation to reduce the dimension of features. A global covering training dataset, comprising 465.88 million sample points, was extracted across the globe through the aggregation and combination of forest/land cover maps from ESA WorldCover, GlobeLand30, PALSAR FNF, and ESRI Land Cover to improve the representativeness of training data. A feed-forward neural network was calibrated to predict fractional tree cover from MODIS data. The spatial pattern of the estimation results was generally consistent with the CGLS-LC100 product at global scale, with the average MAE in global vegetated areas of 12.50 %, while our dataset provided extended temporal coverage. The interannual stability of the estimated tree cover series was improved compared to MODIS vegetation continuous fields products for deciduous broadleaf forests, evergreen broadleaf forests, and mixed forests, with the global average value of mean absolute deviation (MAD) in tree cover series reduced by 5.8 %, 46.9 %, and 18.3 %, respectively. The estimation results were assessed using globally distributed validation data around BELMANIP 2.1 sites and those derived from the USGS circa 2010 global land cover reference dataset, leading to the R2 values of 0.93 and 0.73, MAE of 4.24 % and 10.55 %, and RMSE of 11.45 % and 17.98 %, respectively. This dataset could enhance the capability to monitor forest cover changes, particularly gradual changes such as forest recovery.

Synchronous Driving Method for Stitching Pixel Arrays Based on an Adaptive Correction Technique.

With the application of stitching technology in large-pixel-array CMOS image sensors, the problem of non-synchronized output signals from pixel array bilateral driver circuits has become progressively more serious and has led to the DC perforation of bilateral driver circuits, while conventional clock tree synchronization design methodology does not apply to stitching technology. Therefore, this paper analyses reasons for the inconsistency in the output signals of bilateral driving circuits and proposes a synchronous driving method applicable to stitching pixel arrays based on the idea of on-chip output signal delay detection and calibration. This method detects and corrects the non-synchrony of the row driver output signals on both sides according to changes in the operating environment of the chip. This method is characterized by a simple structure and high reliability. Finally, based on the 55 nm stitching process, simulations are carried out in a CMOS image sensor with a chip area of 77 mm × 84 mm to verify that this method is feasible. This large image sensor with a 150 M pixel array has a frame rate of over 10 FPS.

Feature adaptation for landslide susceptibility assessment in “no sample” areas

Given the time-consuming nature of compiling landslide inventories, it is increasingly important to develop transferable landslide susceptibility models that can be applied to regions without existing data. In this study, we propose a feature-based domain adaptation method to improve the transferability of landslide susceptibility models, especially in “no sample” areas. Two typical landslide-prone areas in Fujian province, southeastern China, were chosen as research cases to test the practicality of the transfer effect. Five conventional machine learning algorithms (Support vector machines (SVM), Random Forest (RF), Logistic Regression (LOG), K-nearest neighbor (KNN), and Decision tree (C4.5)) are used to model landslide susceptibility in sampled areas (source domain), and a feature transfer-based landslide susceptibility evaluation model is constructed under coupled feature transfer methods to evaluate the susceptibility of landslide in un-sampled areas (target domain). The results showed that feature transfer can effectively improve the transferability of different machine learning models for cross-regional prediction (The indicators have improved overall by 8.49%), with SVM (increased by 13.68%) and LOG (increased by 10.19%) models showing the most significant improvements. The feature-based domain adaptive method can alleviate the burden of collecting and labeling new data, and effectively improve the assessment performance of machine learning-based landslide susceptibility models in un-sampled areas. This is a new solution for landslide susceptibility assessment in completely “no sample” areas.

Discrete Event Systems Theory for Fast Stochastic Simulation via Tree Expansion

Discrete Event Systems Theory for Fast Stochastic Simulation via Tree Expansion

Optimization of layout for embedding half hypercube into conventional tree architectures

SummaryEmbedding a graph into another graph can be utilized for structural simulation, processor allocation, and algorithm porting in the field of parallel architecture. This has the potential to enhance the physical layout of network‐on‐chip (NoC) devices as well as to investigate their virtualization possibilities. Layout is one of the many indicators of graph embedding. An optimal layout in NoC design can result in a decreased wiring area and cost, as well as the reduction in communication delay between parallel processing components. In this work, the guest graph is the half hypercube, which possess efficient routing, fault tolerance, and Hamiltonian features. The edge isoperimetric problems is solved for the half hypercube using a novel technique called the isochronal ordering. The host graphs considered in our work are complete binary trees, ‐rooted complete binary trees, and other few predominantly investigated tree based architectures.

High performance Legionella pneumophila source attribution using genomics-based machine learning classification.

Fundamental to effective Legionnaires' disease outbreak control is the ability to rapidly identify the environmental source(s) of the causative agent, Legionella pneumophila. Genomics has revolutionized pathogen surveillance, but L. pneumophila has a complex ecology and population structure that can limit source inference based on standard core genome phylogenetics. Here, we present a powerful machine learning approach that assigns the geographical source of Legionnaires' disease outbreaks more accurately than current core genome comparisons. Models were developed upon 534 L. pneumophila genome sequences, including 149 genomes linked to 20 previously reported Legionnaires' disease outbreaks through detailed case investigations. Our classification models were developed in a cross-validation framework using only environmental L. pneumophila genomes. Assignments of clinical isolate geographic origins demonstrated high predictive sensitivity and specificity of the models, with no false positives or false negatives for 13 out of 20 outbreak groups, despite the presence of within-outbreak polyclonal population structure. Analysis of the same 534-genome panel with a conventional phylogenomic tree and a core genome multi-locus sequence type allelic distance-based classification approach revealed that our machine learning method had the highest overall classification performance-agreement with epidemiological information. Our multivariate statistical learning approach maximizes the use of genomic variation data and is thus well-suited for supporting Legionnaires' disease outbreak investigations.IMPORTANCEIdentifying the sources of Legionnaires' disease outbreaks is crucial for effective control. Current genomic methods, while useful, often fall short due to the complex ecology and population structure of Legionella pneumophila, the causative agent. Our study introduces a high-performing machine learning approach for more accurate geographical source attribution of Legionnaires' disease outbreaks. Developed using cross-validation on environmental L. pneumophila genomes, our models demonstrate excellent predictive sensitivity and specificity. Importantly, this new approach outperforms traditional methods like phylogenomic trees and core genome multi-locus sequence typing, proving more efficient at leveraging genomic variation data to infer outbreak sources. Our machine learning algorithms, harnessing both core and accessory genomic variation, offer significant promise in public health settings. By enabling rapid and precise source identification in Legionnaires' disease outbreaks, such approaches have the potential to expedite intervention efforts and curtail disease transmission.

Maximizing efficiency in solar ammonia–water absorption refrigeration cycles: Exergy analysis, concentration impact, and advanced optimization with GBRT machine learning and FHO optimizer

A detailed analysis of energy and exergy is conducted on a single-effect solar ammonia–water (NH3–H2O) absorption refrigeration cycle (ARC) using TRNSYS and EES software. Considering the physical and chemical exergies, the exergy destruction rate (ĖD) in each component of the system is calculated, highlighting its contribution to the overall ĖD. The study explores the effects of varying refrigerant mass flow rate (ṁᵣ) and ammonia concentration in strong and weak solutions (Xs and Xw) on key performance parameters, including coefficient of performance (COP), exergy efficiency (ĖD), and overall ĖD across a range of generator temperatures (Tg). In this study, a gradient boosting regression tree (GBRT) is employed as a supervised machine-learning technique for classification and regression problems, utilizing boosting to enhance conventional decision tree predictions. The Fire Hawk Optimizer (FHO) approach is also utilized to optimize performance parameters, maximizing COP and ηηEwhile minimizing Tg and ĖD. The GBRT models are developed using available experimental and simulation data, revealing relationships between variables (ṁᵣ, Xs, Xw, and Tg) and outcomes (COP, ĖD, and overall ĖD). The results revealed that the generator exhibits considerable ĖD regardless of operating conditions, underscoring its pivotal role in the ARC. It emerges as the primary ĖD contributor (50 %), followed by the evaporator (17 %) and the absorber (15 %). However, ĖD associated with the recooler, pump, and expansion valves is negligible in comparison. Optimization results reveal that, when minimizing Tg and ĖD, the highest COP and ĖD at Tg of 373.15 K reach 0.8081 and 0.46, respectively.

Revisiting the Geochemical Classification of Zircon Source Rocks Using a Machine Learning Approach

Trace element fingerprints preserved in zircons offer clues to their origin and crystallization conditions. Numerous geochemical indicators have been established to evaluate the source rock characteristics from a geochemical perspective; however, multivariate trace element data have not been sufficiently investigated statistically. As substantial amounts of zircon data from a wide range of rock types have become accessible over the past few decades, it is now essential to reassess the utility of trace elements in discriminating source rock types. We employed a new zircon trace element dataset and established classification models to distinguish eight types of source rocks: igneous (acidic, intermediate, basic, kimberlite, carbonatite, and nepheline syenite), metamorphic, and hydrothermal. Whereas a conventional decision tree analysis was unable to correctly classify the new dataset, the random forest and support vector machine algorithms achieved high-precision classifications (> 80% precision, recall, and F1 score). This work confirms that trace element composition is a helpful tool for province studies and mineral exploration using detrital zircons. However, the compiled dataset with many missing values leaves room for improving the models. Trace elements, such as P and Sc, which cannot be measured by quadrupole inductively coupled plasma mass spectrometry, are vital for more accurate classification.

Razvoj modela mašinskog učenja zasnovanog na algoritmu slučajnih šuma za detekciju promena u tkivu jetre nakon izlaganja česticama oksida gvožđa

Introduction/Aim: The aim of our study was to create a machine learning model, specifically a random forest model, which uses textural data from liver micrographs to differentiate between normal hepatic tissue and damaged tissue exposed to iron oxide nanoparticles. Material and Methods: Regions of interest in micrographs of hepatic tissue, obtained from mice treated with iron oxide nanoparticles and controls, were analyzed using the gray-level co-occurrence matrix (GLCM) method. The resulting GLCM features were employed as input data for the training and testing of the random forest model using the "Scikit-learn" library in the Python programming language. Additionally, a conventional decision tree model was developed, based on the classification and regression tree (CART) algorithm. Results: The random forest model outperformed the alternative CART decision tree approach in terms of classification accuracy, correctly predicting the class for 73.67% of the instances in the validation ROI dataset. The area under the receiver operating characteristic curve was 0.81, indicating relatively good discriminatory power. The F1 score for the model was 0.74, showcasing fairly good precision and recall, though not perfect. Conclusion: The data obtained from this study may be utilized for further development of artificial intelligence computation systems to identify physiological and pathophysiological changes in hepatic tissue. The results also serve as a starting point for additional research on the automation of histopathological analysis of liver tissue exposed to external toxic agents.

Data structure and privacy protection analysis in big data environment based on blockchain technology

In today's digital world, the rapid advancement of Information Technology (IT) has made it crucial to prioritize the protection and management of data storage and retrieval. It is vital to challenge the difficulties related to dispersed and decentralized data to build strong mechanisms for access control and provide effective authorization and authentication in data processing. In the contemporary context of IT, the imperative to secure data storage and retrieval has become distinctly observed. The challenges posed by distributed and decentralized data demand the development of robust mechanisms for access control, demanding a focus on proper authorization and authentication in transaction processing. This research addresses the existing gap by comprehensively adapting data structures effectively to the evolving needs of secure access and storage control. It uses the Enhanced Merkle Tree (EMT) as a novel data structure. This article initially modifies the conventional Merkle Tree (MT) structure used in Blockchain technology to suit e-healthcare Systems (e-HS) requirements. The EMT enhances data security in access and storage and significantly improves data integrity management. Its constant three-degree MT with multiple leaves, branches, and a single root node enables updated data authentication, verification, and validation procedures. The proposed method is applied to the e-HS scenario, and the proposed EMT outperforms existing state-of-the-art techniques, achieving a minimal verification time of 14.26 m for 100 transactions. This research, therefore, contributes to the discourse on data security by presenting an innovative and efficient solution tailored to the unique challenges of e-health systems.