This study examines the impact of chainsaw chain type and tree species on the concen-tration of inhalable wood dust generated during motor-manual harvesting in forested areas. The chainsaw chain is a critical component, contributing not only to productivity but also to the oper-ator's health and safety. Wood dust creation during harvesting operations poses significant risks and necessitates careful attention due to its potential health effects. We investigated the effects by conducting real-world measurements of inhalable dust within the operator's breathing zone during forestry work. Two different chain types were evaluated: the commonly used 3/8" pitch chain (conventional chain) and the 0.325" pitch chain. Additionally, measurements were taken for three tree species: beech, oak, and pine (including both live and standing dead trees after a fire). Results showed that, overall, using the conventional 3/8" chain type yielded the highest concentration of wood dust for all three tree species. Notably, the highest wood dust concentration was observed in the burned Pinus brutia cluster, also with the 3/8" chain pitch. These findings emphasize the im-portance of understanding how chain type and tree species contribute to wood dust levels and provide valuable insights for enhancing operator health and safety during motor-manual har-vesting operations

The lack of a generalizable machine learning model for predicting the safety of food for 1 human consumption is a significant challenge for policymakers and responsible authorities. This 2 study provides a step-by-step guide to predict the results of seafood product import inspections, 3 focusing on identifying and understanding the critical factors that influence these results. By compar- 4 ing the performances of an ensemble of machine learning models, this study combines the strengths 5 of multiple algorithms to improve the predictive accuracy and gain insights into the key factors 6 impacting them. The ensemble model based on the soft voting technique achieves superior perfor- 7 mance to that based on the hard voting technique in terms of the recall and area under the curve 8 (AUC) scores. The study discovered that various characteristics, such as the exporting country ratio, 9 major product category, overseas manufacturer ratio, importer ratio, and seasonal variation, had a 10 substantial influence on the models’ decisions. This research guide for predicting seafood product 11 import inspection results could pave the path for other items to follow.

The process of rainfall interception by tree organs is crucial in mitigating the impact of intense rainfall on urban drainage systems, particularly in the context of climate change. this study selected ten commonly found tree species in Shanghai. Main parts of trees, including leaves, branches, and bark, were collected to analyze their ability to intercept rainwater. The optimized Artificial Rainfall Simulation System (ARSS) was applied to simulate the rainfall. The time-changing process of rainwater interception in three organs was measured during a 180-minute rainfall event which under four different rainfall intensities (4, 8, 12, and 16 mm/h, respectively). Process models of rainwater interception in different organs were fitted with adsorption kinetic equations. The rainwater interception process of tree organs complied with the quasi 2nd-order adsorption kinetic equation. The rainwater interception capacity of leaves, branches, and bark of ten urban tree species ranged from 0.05 to 0.34 mm, 0.13 to 0.24 mm, and 0.29 to 1.22 mm, respectively. The rainwater interception capacity of three organs significantly differs (p<0.05). It reveals that bark exhibits the highest rainwater interception ability. Coniferous tree species have a greater ability to intercept rainwater than broad-leaved tree species. There are also differences in the rainwater interception ability of trees in urban and natural areas.

Machine learning has become more prevalent as a tool used for biogeochemical analysis in agricultural management. However, a common drawback of machine learning models is the lack of interpretability, as they are black boxes that provide little insight into agricultural management. To overcome this limitation, we compared three tree-based models (decision tree, random forest, and gradient boosting) to explain soil organic matter content through Shapley additive explanations (SHAP). Here, we used nationwide data on field crops, soil, terrain, and climate across South Korea (n = 9,584). Using the SHAP method, we identified common primary controls of the models, for example, regions with precipitation levels above 1400 mm and exchangeable potassium levels exceeding 1 cmol+ kg-1, which favor enhanced organic matter in the soil. Different models identified different impacts of nutrients on the organic matter level in the soil. The SHAP method is practical for assessing whether different machine learning models yield consistent findings in addressing these inquiries. Increasing the explainability of these models means determining essential variables related to soil organic matter management and understanding their associations for specific instances.

Hazelnut, pistachio and cashew are tree nuts with health benefits but also with allergenic properties being prevalent food allergens in Europe. The allergic characteristics of these tree nuts after processing combining heat, pressure and enzymatic digestion were analyzed through in vitro (Western blot and ELISA) and in vivo test (Prick-Prick). In the analyzed population, the patients sensitized to Cor a 8 (nsLTP) were predominant over those sensitized against hazelnut seed storage proteins (Sprot, Cor a 9 and 14), which displayed higher IgE reactivity. The protease E5 effectively hydrolyzed proteins from hazelnut and pistachio, while E7 was efficient for cashew protein hydrolysis. When combined with pressured heating (autoclave and Controlled Instantaneous Depressurization (DIC)), these proteases notably reduced the allergenic reactivity. The combination of DIC treatment before enzymatic digestion resulted in the most effective methodology to drastically reduce or indeed eliminate the allergenic capacity of tree nuts.

Badminton tactics refer to the techniques and strategies employed by players to win a match. Analyzing these tactics can help players improve their performance and outsmart their opponents. To study the tactics of top players, we use a gaming tree to analyze matches between two of the most powerful badminton players in history: Lin and Lee. By employing the Nash Equilibrium, we can discover the most beneficial strategies for both players, which reflect their most powerful techniques. Additionally, with the help of this gaming tree, we can precisely predict how players will implement their tactics. Empirical experimental results demonstrate that our proposed method not only evaluates and identifies each player's weaknesses and strengths but also has powerful capabilities to predict their tactics.

The outstanding occurrences of red wood ant nests (RWA; Formica rufa-group) at two study sites in the Oberpfalz, NE Bavaria, Germany, could be confirmed by the 2023 re-inventory (a total of 5,393 nests and an increase by ≈8 %). RWA nests preferred mature and medium mature pine-dominated forests. Standing and downed dead wood do not negatively influence nests. Nest counts with woodpecker cavities and the diversity of the herb layer increased. The highly clustered nests in NW-SE direction suggests a strong interaction between nests distributions and the tectonic environment. Our developed (re-)inventory approach in combination with the comprehensive photo database is a valuable tool for a) monitoring the entire forest habitat including woodpecker cavities and dead wood in, at and around nests, and b) identifying GeoBio-Interactions. Such a comprehensive approach leads to more accurate and realistic counts of RWA nests during (re-)inventories and provides scientific evidence of the status quo of RWA occurrence. Our results disproved the unfounded and scientifically unsubstantiated blanket statement by laymen of the ASW Landesverband Bayern e.V. that RWA nest numbers in the Oberpfalz or even in the entire Bavaria are in sharp decline. We suggest seven to eight years as a suitable time interval for re-inventories.

The aim of this research is to investigate and use a variety of immersive multisensory media techniques in order to create convincing digital models of fossilised tree trunks for use in XR. This is made possible via the use of geospatial data derived from sources such as aerial imaging using UAS, terrestrial material using cameras and also include both the visual and audio element for better immersion, accessible and explorable in 6 Degrees of Freedom (6DoF). Immersiveness is a key factor in order to result in output that is especially engaging to the user. Both conventional and alternative methods are explored and compared, emphasising in the advantages made possible via the help of Machine Learning Computational Photography. Material is collected using both UAS and terrestrial camera devices, including a 3D-360º camera with 6 sensors, using stitched panoramas as sources for photogrammetry processing. Difficulties such as capturing large free standing objects using terrestrial means were overcome using practical solutions involving mounts and remote streaming solutions. Conclusions indicated that superior fidelity can be achieved by the help of Machine Learning Computational Photography processes and higher resolutions and technical specs of equipment not necessarily translating to superior outputs.

The process of sexual reproduction in eukaryotes starts when gametes from two different sexes encounter each other. Paramecium, a unicellular eukaryote, undergoes conjugation and uses a gametic nucleus to enter the sexual reproductive process. The molecules responsible for recognizing mating partners, hypothetically called mating-type substances, are still unclear. We have identified an O3-type mating substance polypeptide and its gene sequence using protein chemistry, molecular genetics, immunofluorescence, RNA inter-ference, and microinjection. The O3-type substance is a polypeptide found in the ciliary membranes, located from the head to the ventral side of cells. The O3-type substance has a kinase-like domain in its N-terminal part located outside the cell and four EF-hand motifs that bind calcium ions in its C-terminal part located inside the cell. RNA interference and immunofluorescence revealed that this polypeptide positively correlated with the expression of mating reactivity. Microinjection of an expression vector incorporating the O3Pc-MSP gene induced additional O3 mating type in the recipient clones of different mating types or syngen. Phylogenetic analysis indicates this gene is widely present in eukaryotes and exhibits high homology among closely related species. The O3Pc-MSP gene had nine silent mutations compared to the complementary mating type of the E3 homologue gene.

This study explores the prediction of concrete compressive strength using machine learning models, aiming to overcome the time-consuming and complex nature of conventional methods. Four models—Artificial Neural Network, Multiple Linear Regression, Support Vector Machine, and Regression Tree—are employed and compared for performance. Evaluation metrics such as Mean Absolute Deviation, Root Mean Square Error, Coefficient of Correlation, and Mean Absolute Percentage Error are used. After preprocessing 1030 samples, the dataset is split into 70% for training and 30% for testing. The ANN model, further divided into training, validation (15%), and testing (15%), outperforms others in accuracy and efficiency. This outcome streamlines compressive strength determination in the construction industry, saving time and simplifying the process.

The development of reliable predictive algorithm for house price as the housing market is a stand-out among the most involved regarding valuing the price and continues to fluctuate, is constantly a need for socio-economic advancement and welfare of citizen. In this paper, we develop machine learning algorithms for forecasting UK housing Price, and find an optimal algorithm that forecasts housing price accurately on the premises of the presence of many features or covariates. After applying correlation analysis to remove correlated variables in order to avoid multicollinearity, thereby increasing the statistical power, a novel method of using regression analysis to first of all understand and select statistically significant features for the various regions in England based on North South divide is adopted. These features are then used in the machine learning algorithm to further increase the statistical power of the algorithm, increase the level of accuracy for each of them and ultimately increase the predictive values for the algorithms. The model construction involves 3 stages: 1- correlation analysis to identify and remove correlated variables thereby avoiding multicollinearity and increasing the statistical power of the linear regression, 2 - using linear regression to determine variables that are statistically significant and 3 - building the machine learning algorithms based on the variables that are statistically significant from the linear regression. A comprehensive dataset of UK Paid housing Price from 2010 to 2019 was linked to a number of other datasets to generate a total 21 variables or features used for the models. Catboost, Gradient Boosting, Bagging, Random Forest, Extra Tree all achieved the excellent models performance result in all the regions considered. The comparison of the seven models showed that Extra Tree algorithm consistently achieved the best performance in term of level of accuracy in all the regions. K-Nearest Neighbours (KNN) is the only algorithm with less than 50% level of accuracy. Noticeably, the regions considered had varying or differing insignificant variables, implying that although many variables are common (statistically significant) to all the regions, there are regional differences and impact when modelling or predicting housing prices. This study validates the practicability of developing a machine learning methodology for the prediction of housing price. This research offers a reference for future house price prediction based on machine learning.

Key elements of Blue-Green Infrastructure are vegetation and stormwater storage. A combination of a bioretention cell with an underlying trench (BC-T) serving as a tree pit is often used in dense urban environments. An adequate ratio of drained area to bioretention cell area is a crucial design parameter. The ratio is derived from the hydrological balance; however, input data are often difficult to obtain or uncertain. The goal is to study the sensitivity of such data (tree water uptake and water holding capacities of soil filter and trench substrate) in the BC-T design. Sensitivity analysis is performed for the setup of a BC-T used in Prague, Czech Republic. A 10-year rainfall series (1 hour resolution) is used as an input. Data that are subject to the sensitivity analysis are changed for different trench exfiltration rates, and the effect on the size of the drained area is studied. At low trench exfiltration rates (1.8 mm.h-1), both the water holding capacity of the trench substrate and potential tree water uptake have a significant influence (more than a 20% change in the size of the drained area) and cannot be neglected. At good exfiltration rates (more than 18 mm.h-1) or when the trench is equipped with an underdrain, all studied parameters can be neglected. However, it is recommended to reduce the size of the drained area by 10-20%.

This study examined the impact of differences in fruit load of olive trees on the rate of stem refilling. The experiment was conducted in a commercial olive orchard over the consecutive years of 2021 and 2022, during which the biennial bearing cycle of olive trees resulted in minimal fruit production in 2021 and maximal production in 2022. The rate of stem refilling was determined by quantifying the differences in water volume traversing the apex and base of the principal branches of experimental trees using sap flow sensors. Concurrent measurements of tree water status were also conducted using psychrometers, while soil moisture content dynamics were continuously recorded. Results indicate that alternate bearing significantly influences the stem refilling process, while soil moisture availability also plays a pivotal role. Water reserves were more intensively utilized during the year of full production (“ON” year) primarily to fulfill the water demands of developing fruits. This replenishment occurred in various periods during the day, including early morning, afternoon, and night, when stomatal conductance measurements indicated stomatal closure. The study suggests a more intense replenishment of reserves during the night in "ON" year trees, irrespective of soil moisture, water vapor pressure deficit, or phenological fruit development stage.

Parkland contributes economic, social, and ecological benefits worldwide. However, parklands degradation is an encounter to biodiversity loss needs generating information on woody species. This study was aimed to investigate woody species composition, diversity, structure, and management of parklands along Agroecology, and farmers’ wealth status. Multistage sampling technique was employed. Highland Bede Kebele, and midland Durgi Kebele were randomly selected. A total of 60 quadrats with size of 100m x 50m were used for inventory. A total of 276 respondents were used. Species richness, Shannon, Simpson, and evenness diversity indices were subjected to one-way ANOVA, and independent t-test for comparison STATA V. 17.0. Of 31 woody species, (16 families in 26 genera) observed, 26 woody species belonging to 13 families in 22 genera from midland while 18 woody species belonging to 12 families in 16 genera from highland parklands were observed. Species richness 6.8, 3.7; Shannon 1.82, 1.68; Simpson 0.85, 0.73; evenness 0.83, 0.7 were observed in midland, and highland parklands, respectively. Poorly regenerated stands were observed along Agroecology. Pruning, pollarding, coppicing, lopping, cutting, fertilizing, watering were common management practices. In conclusion, woody species diversity, and structure were affected by Agroecology, and socioeconomic factors needing intervention to enhancing woody species conservation.

High-precision ground point cloud data has a wide range of applications in various fields, and the separation of ground points from non-ground points is a crucial preprocessing step. Therefore, designing an efficient, accurate, and stable ground extraction algorithm is of great significance for improving the processing efficiency and analysis accuracy of point cloud data. The study area in this article was a Park in Guilin, Guangxi, China. The point cloud was obtained by utilizing the UAV platform. In order to improve the stability and accuracy of the Filter algorithm, this article proposed a triangular grid filter based on Slope Filter, found violation points by the spatial position relationship within each point in the triangulation network, improved KD-Tree-Based Euclidean Clustering, and applied it to the non-ground points extraction, this method has good accuracy, stability and achieves good results in separating ground points from non-ground points. At first, using Slope Filter to remove some non-ground points, to reduce the error of taking ground points as non-ground points; Secondly, established a triangular grid based on the triangular relationship between each point, the violation-triangle can determin through the grid, and then the corresponding violation points were found in the violation-triangle; Thirdly, according to the three-point collinear method to extract the regular points, used these points to extract the regular landmarks by KD-Tree-Based Euclidean Clustering and Convex Hull Algorithm; Finally, removed disperse points and irregular landmarks by Clustering Algorithm. In order to confirm the superiority of this algorithm, this article compared the filter effects of various algorithms on the study area and filtered the 15 sample data provided by ISPRS, and obtained an average error of 3. 46%. The results showed that the algorithm in this article have a high processing efficiency and accuracy, which can greatly improve the processing efficiency of point cloud data in practical applications.

Chi-squared automatic interaction detector (CHAID) algorithm is considered to be one of the mostly used supervised learning methods as it is adaptable to solving any kind of problem at hand. We have been starkly aware of CHAID maps non-linear relationships quite well, and it can empower predictive models with stability. But we don’t know how high its accuracy is precisely. To find out the perfect scope CHAID algorithm fits into, this paper presents the analysis of the accuracy of the CHAID algorithm. We introduce the causes, applicable conditions and application scope of CHAID algorithm at first, and then highlight the difference of branching principal between the CHAID algorithm and several other common decision tree algorithms, which is our first step towards basic analysis on CHAID algorithm. We next employee an actual branching case to help us understand CHAID algorithm better. Specifically, we use vehicle customer satisfaction data to compare multiple decision tree algorithms, and cite some factors that affecting the accuracy and some corresponding countermeasures which are more conducive to us to obtain accurate results. The results show that CHAID can analyze the data very well, and detect the significantly correlated factors surely. In this paper, we learn the clear information required to understand CHAID algorithm, thereby make better choices when we need to use decision tree algorithms.

In today’s competitive landscape, achieving customer-centricity is paramount for the sustainable growth and success of organisations. This research is dedicated to understanding customer preferences in the context of the Internet of Things (IoT) and employs a two-part modeling ap-proach tailored in this digital era. In the first phase, we leverage the power of the Self-Organizing Map (SOM) algorithm to segment IoT customers based on their connected device usage patterns. This segmentation approach reveals three distinct customer clusters, with the second cluster demonstrating the highest propensity for IoT device adoption and usage. In the second phase, we introduce a robust Decision Tree methodology designed to prioritize various factors influencing customer satisfaction in the IoT ecosystem. We employ the Classification and Regression Tree (CART) technique to analyze 17 key questions that assess the significance of factors impacting IoT device purchase decisions. By aligning these factors with the identified IoT customer clusters, we gain profound insights into customer behaviour and preferences in the rapidly evolving world of connected devices. This comprehensive analysis delves into the factors contributing to customer retention in the IoT space, with a strong emphasis on crafting logical marketing strategies, en-hancing customer satisfaction, and fostering customer loyalty in the digital realm. Our research methodology involves surveys and questionnaires distributed to 207 IoT users, categorizing them into three distinct IoT customer groups. Leveraging analytical statistical methods, regression analysis, and IoT-specific tools and software, this study rigorously evaluate the factors influencing IoT device purchases. Importantly, this approach not only effectively clusters the IoT Customer Relationship Management (IoT-CRM) dataset but also provides valuable visualizations that are essential for understanding the complex dynamics of the IoT customer landscape. Our findings underscore the critical role of logical marketing strategies, customer satisfaction, and customer loyalty in enhancing customer retention in the IoT era. This research makes a significant contri-bution to businesses seeking to optimize their IoT -CRM strategies and capitalize on the oppor-tunities presented by the IoT ecosystem.

The paradigm of leveraging code as a dataset has recently gained traction, offering innovative solutions in domains such as automated commit message generation, pull request description automation, and program repair mechanisms. Consider the challenge in generating commit messages: traditional methods treat source code as a mere token sequence, applying neural machine translation models. This approach, however, overlooks the critical syntactic structures inherent in programming languages, which could offer deeper insights and improved accuracy. Building upon prior research, specifically the Code2Seq framework, which utilized Abstract Syntax Tree (AST) structural data for source code representation to automate method name generation, this paper extends and refines this concept. We introduce "CSR", a novel methodology adapted to represent code edits effectively. This paper investigates the impact of employing syntactic structure, focusing on the classification of code edits. Drawing inspiration from Code2Seq, "CSR" utilizes AST's structural properties, particularly the paths connecting leaf nodes, to enhance the task of code edit classification. This approach is rigorously evaluated on two distinct datasets, comprising fine-grained syntactic edits. Our comprehensive experiments reveal that incorporating syntactic structures does not significantly outperform simpler methodologies. While methods like Code2Seq and our proposed "CSR" show potential, our findings highlight that there is considerable scope for improvement and refinement before such techniques can be universally applied for learning representations of code edits. We anticipate that our findings will spark further research in this field, paving the way for more effective use of syntactic structures in code representation.

Bitcoin has been launched for over a decade and made an increasing impact on the world’s financial order, which attracted extensive attention of researchers. Bitcoin system runs on a dynamic P2P network, containing tens of thousands of nodes including reachable nodes and unreachable nodes. In this article, a detection system BNS (Bitcoin Network Sniffer) was prososed, which could collect as many Bitcoin nodes as possible. For reachable nodes, the authors designed an algorithm BRF (Bitcoin Reachable-nodes Finding) based on node activity evaluation, which reduced the nodes to be detected and greatly shortened the detection time. For unreachable nodes, the authors trained a dicision tree model BUF(Bitcoin Unreachable-nodes Finding) to identify unreachable nodes based on attribute features from massive node addresses. Experiments showed that BNS performed better than the website "Bitnodes" in total number and efficiency. Based on the experimental results, the authors analyzed the real network size, node "churn" and geographical distribution.

The art of representing source code is pivotal in numerous programming analysis applications. Recent strides in neural networks have marked notable successes in this realm. However, the peculiar structural characteristics inherent in programming languages have not been fully exploited in existing models. While neural models based on abstract syntax trees (ASTs) adeptly manage the tree-like nature of source codes, they fall short in discerning the diverse substructural nuances within programs. This paper introduces the Dynamic Syntax Tree Model (DSTM), an innovative approach that fuses various neural network modules into tree architectures tailored to the specific AST of the input. Distinct from preceding tree-based neural models, DSTM adeptly discerns the semantic variances across different AST substructures. We validate DSTM through rigorous testing in program classification and code clone detection, outperforming contemporary methods and demonstrating the benefits of harnessing intricate source code structures.

The use of hyperthermia is one of the effective methods of treating cancer. In this case, the problem arises of constructing and predicting the distribution of the thermal field inside tissues depending on their type. This paper discusses the use of linear and polynomial regression methods, as well as regression algorithms based on decision tree, random forest and K nearest neighbors methods to recover missing temperature values. The influence of the size of the training sample when performing regression on the quality of the reconstructed values is investigated. Experimental recommendations on sample size are given for the selected decision tree and random forest methods. The possibility of a significant (10 times or more) reduction in the initial sample size, without leading to a decrease in the R² metric by more than 0.05 for various tissues, has been shown.

Human arteries show structural and functional peculiarities according to the nutrient and oxygen needs of a specific vascular district. This architectural heterogeneity is reflected in the pathological setting of cardiovascular diseases (CVDs). Indeed, the responsiveness to cardiovascular risk factors, the morphological and molecular patterns are discriminating factors among CVDs affecting different vascular beds. Micro-RNAs (miRNAs) are endogenous regulators of gene expression and fine tuners of vascular cell differentiation, thus these non-coding RNAs can modulate the arterial heterogeneity. The identification of a miRNA signature artery-specific would be promising in the therapy of CVDs, especially in frail elderly patients. In the present review we will provide a concise description of the arterial tree heterogeneity on structural and cellular basis, mainly in the pathological context. Secondly, we will address the miRNA potential as crucial mediators of arterial heterogeneity focusing on abdominal aorta and femoral artery, with the final goal of strengthening the search of more targeted therapies in CVDs and stratification approaches in frail elderly patients.

A signed graph is an undirected graph such that all of its edges are labeled positive or negative. Let D be an embedding of a signed graph G in the Euclidean line. If in D for all of the vertices their positive neighbors are closer than the negative neighbors, then D is called a valid drawing of G. In this paper we show that signed trees, unicyclic graphs, and ladder graphs have a valid drawing in the Euclidean line.

Reducing GHG emissions is a crucial challenge in urban areas, characterized by high energy consumption and reduced exposure to nature. In this context, the urban green system could play a pivotal role. In the literature, scholars analyzed both the ability of species-specific and layout-specific green infrastructures to increase carbon sequestration and the best location sites of new green infrastructures, to increase the provision of overall ecosystem services. There is a lack of studies helping green urban planners and designers choose where and which green infrastructure to implement, based on vegetation species-specific performance and local carbon emissions of city components. This paper uses tree inventory data from a medium-sized city in central Italy (Perugia) to develop a spatial analysis of the urban parks' performance in carbon sequestration. Then, the method evaluates the carbon emission of a public city building to generate a spatialized balance between buildings’ demand and trees’ supply, to support local decisions about the best locations for new green infrastructures and the choice between species. The paper contributes to GIS-based tools that vary the recommended location sites and species for new green infrastructures based on the demanded ecosystem service.

This study addresses the problem of accurately predicting azimuth and elevation angles of signals impinging on an antenna array employing Machine Learning (ML). Using the information obtained at a receiving system when a transmitter’s signal hits it, a Decision Tree (DT) model is trained to estimate azimuth and elevation angles simultaneously. Simulation results demonstrate the robustness of the proposed DT-based method, showcasing its ability to predict the Direction of Arrival (DOA) in diverse conditions beyond the ones present in the training dataset, i.e., the results display the model’s generalization capability. Additionally, the comparative analysis reveals that DT-based DOA estimation outperforms the state-of-the-art MUltiple SIgnal Classification (MUSIC) algorithm, establishing DTs as competitive alternatives for DOA estimation in signal reception systems.

Bipolar disorder is a severe mood disorder and is one of the top 20 reasons of disability in the world. It causes a huge burden on society. In this study, the prediction models of bipolar disorder were constructed based on the concept of knowledge distillation. The input data consisted of patients of bipolar disorder and matched controls, all of which were selected from the open database MIMIC. The method of kernel density estimation (KDE) was exploited to generate probability density functions (PDF) which identify distributions of input data. The PDF values referred to as the soft labels were combined with the input data to construct the prediction models of bipolar disorder using decision tree and artificial neural network respectively. According to the evaluation results, indicators for identifying positive samples of bipolar disorder were improved. Meanwhile, the indicators for identifying negative samples have also been advanced. In addition, the branching attributes selected by the decision trees can be mapped back to specific disease diagnoses, which are all associated with bipolar disorder. In conclusion, using KDE to generate the soft label information of the input data can make knowledge distillation work and has improved the performances of prediction models for bipolar disorder.

The socioeconomic sectors increasingly rely on prompt and affordable tools to predict climatic conditions. This study uses a decision tree classifier model to identify similar monthly ENSO 3.4 indices from March 2001 to February 2011 through monthly historical ENSO3.4 indices (December 1950 – February 2001). Historical monthly ENSO3.4 indices were used to extract available high-resolution monthly historical precipitation grids (1950-2001) for Mexico and constructed monthly ensembles (March 2001 – February 2011 hindcasts). Formerly, a precipitation categorization of monthly observed and simulated precipitation (2001-2011 hindcasts) was employed. Thereafter, global vector data and spatial map assessments were performed seasonally (winter, spring, summer, and fall). Global KSS and HSS metrics indicated the model approach has skill, especially in the spring and fall. Spatial metrics exposed large areas with hit rates > 0.60 in winter and spring, though in winter and spring (dry seasons), it was due to the precipitation categorization hindcast and observed were within the first classification. Lower hit rates, but still acceptable (> 0.40), were detected in summer and fall (during the rainy season and at the end, respectively) because more precipitation classifications were tested and prone to miss. Spatial Spearman correlations provided specific areas of significant model performances and found that high hit rates during the winter and spring are spurious. Meanwhile, it was also found that during the fall the model approach is reliable in most of Mexico, followed by the spring, and in constraint areas in summer and winter across the country. It also appears that dominant ENSO neutral events followed by balanced ENSO cooling and warming events do not prefer the model skill. Overall, the empirical method shows promise (low-cost human and computational resources if ENSO indices expose certainty in its Lead months to forecast) and has the potential to be used in other developing countries influenced by El Niño phenomena.

We introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ two linear probe sequences to find empty cells for the keys. Matching lower bounds on the maximum cluster size produced by any algorithm that uses two linear probe sequences are obtained as well.

The $k$-set tree connectivity, as a natural extension of classical connectivity, is a very important index to evaluate the fault-tolerance of interconnection networks. Let $G=(V, E)$ be a connected graph and a subset $S\subseteq V$, an $S$-tree of graph $G$ is a tree $T=(V',E')$ that contains all the vertices of $S$. Two $S$-trees $T$ and $T'$ are internally disjoint if and only if $E(T)\cap E(T')=\varnothing$ and $V(T)\cap V(T')=S$. The cardinality of maximum internally disjoint $S$-trees is defined as $\kappa_{G}(S)$, and the $k$-set tree connectivity is defined by $\kappa_{k}(G)=\min\{\kappa_{G}(S)|S\subseteq V(G)\ \text{and} \ |S|=k\}$. In this paper, we show that the $k$-set tree connectivity of hierarchical folded hypercube when $k=4$, that is, $\kappa_{4}(HFQ_{n})=n+1$, where $HFQ_{n}$ is hierarchical folded hypercube for $n\geq 7$.

The evolution of sentence representation learning, especially with parse tree encoders, has shown remarkable progress. Traditional approaches predominantly rely on recursive encoding of tree structures, which impedes parallel processing capabilities. Additionally, these methods often overlook the significance of dependency tree arc labels. To overcome these limitations, we introduce the Syntax-Enhanced Transformer (SET), incorporating a novel dual-attention mechanism that integrates relation-focused attention alongside traditional self-attention. This design effectively encodes both dependency and spatial positional relationships within sentence dependency trees. Our approach innovatively incorporates syntactic information into the Transformer framework without compromising its inherent parallelizability. The SET demonstrates superior or comparable performance to contemporary methods across various sentence representation tasks, significantly enhancing computational efficiency.

In the clock network design, the trade-off between power consumption and timing closure is an important and difficult issue. To achieve this target, a hybrid clock network architecture that combines both clock tree and clock mesh seems to be a promising solution. In this paper, we propose a novel clock mesh architecture – cross-mesh, with the average dispersion of the overall driving force, our methodology creates small non-zero skew clock trees. In addition, we integrate clock gating and register clustering techniques to further reduce dynamic power consumption. The proposed algorithms have four stages: cross-mesh planning, register clustering, mesh line connecting, and load balancing. Experimental results show that our methodology and algorithms get feasible solution effectively and improve both power consumption and clock skew simultaneously.

Background: Hurricanes and other wind events are significant disturbances that affect coastal urban forests around the world. Past research has led to the creation of wind resistance ratings for different tree species which can be used in urban forest management efforts to mitigate the effects of these storms. While useful, these ratings have been limited to species common to one global region (Florida, USA).Methods: Drawing on past ratings and data from a global literature review on tropical storm research, we created a machine learning model to broaden both the geographic coverage and the variety of species currently assessed for their resistance to wind.Results: We were able to assign wind resistance ratings to 281 new species based on the available data and our modelling efforts. The model accuracy and agreement with the original ratings when applied to the testing data set was high with 91% accuracy.Conclusions: The resulting list of wind resistance ratings has been adapted into a spreadsheet-based decision aid for managers, allowing them to assess the overall susceptibility of their urban forest to wind events like hurricanes.

This paper introduces a novel method for accurately calculating the upper biomass of single trees using Light Detection And Ranging (LiDAR) point cloud data. The proposed algorithm involves classifying the tree point cloud into two distinct ones: the trunk point cloud and the crown point cloud. Each part is then processed using specific techniques to create a 3D model and determine its volume. The trunk point cloud is segmented based on individual stems, with each stem further divided into slices that are modeled as cylinders. On the other hand, the crown point cloud is analyzed by calculating its footprint and gravity center. The footprint is further divided into angular sectors, with each being used to create a rotating surface around the vertical line passing through the gravity center. All models are represented in a matrix format, simplifying the process of minimizing and calculating the tree’s upper biomass, consisting of crown biomass and trunk biomass. To validate the proposed approach, both terrestrial and airborne datasets are utilized. A comparison with existing algorithms in the literature confirms the effectiveness of the new method. The study shows that the proposed algorithm achieves an average fit between 0.01 m and 0.49 m for individual trees.

The main objective is to offer a functionally coherent counter-narrative to the polarized views prevailing now about the complex ‘Eukaryogenesis problem’ versus the “primitive” nature ascribed to so-called “Prokaryotes” (termed Akaryotes herein). The paradigm shift presented aims at bridging the conceptual gap between the rudimentary beginnings of biomolecular cooperativity on a pristine Earth (the Origins of Life or OoL) and the beginnings of lineage-wise diversification toward Darwinean speciation in the Tree of Life (or ToL). Although the research field as a whole is not aware of a corresponding ‘Prokaryogenesis problem’, the evolutionary process resulting in the partly independent archaeal and bacterial cell types is not fully understood. The present paper provides an explanation for these problems based on coevolutionary complementarity at multiple levels. The unconventional model connects various stages from “neighborhood selection” in film-like layers of unbounded “surface protoplasm” based on short “statistical proteins”, via a closely knit “peptide/RNA partnership” in the “making of genes”, toward the “making of genomes” in several RNA-to-DNA transitions. Three virus-related plasmids carrying different DNA replicases may have initiated the vertical stability of hereditable lineages that led to the three “domains” of organismal life, with a fourth lineage ending in eukaryotic organelles. These partly independent transitions established DNA as a late-comer of fundamental biomolecules.

We propose a full binary directed tree to represent the set of natural numbers and further divide the set into three sets: pure odd, pure even, and mixed numbers. We utilize a binary string to represent a natural number and demonstrate the composite procedure of odd-number and even-number functions. We analyze the sequence of iteration (or composite) of the Collatz function and reduced Collatz function analog to the inverse function in order to test the Collatz conjecture. We do this by using the parity of a natural number. In order to prove the conjecture, we provide tabular and binary strings to the algebraic formula that states the Collatz sequence. Ultimately, we can convert discrete powers of 2 into continuous powers of 2, ultimately arrive at the smallest natural, 1. If any natural number is the beginning value, the sequence produced by the infinite iterations of the Collatz function becomes the eventually periodic sequence, proving an 87-year-old conjecture.

We use binary string to represent a natural number and show the composite procedure of odd-number and even-number functions, thus we propose full binary directed tree to represent the set of natural numbers and give another partition the natural number set to three sets: pure odd, pure even and mixed number. For the Collatz conjecture we make use of the parity of a natural number to analyse the sequence of iteration (or composite) of Collatz function and reduced Collatz function analog to the inverse function. We give tabular and binary strings to the algebra expression to state the sequence of Collatz, this is the key topic to proof the conjecture: the discrete powers of 2 can be changed to ultimately continuous powers of 2, finally get to pure even number and to the smallest number 1. The sequence created by the infinite iterations of the Collatz function becomes the ultimately periodic sequence if any natural number is the beginning value, proving the conjecture that has been held for 87 years.

During an interdisciplinary study of the mire “Pod Małym Śnieżnikiem”, a very old specimen of the Norway spruce (Picea abies L.) was encountered. The aim of the present work was to perform a detailed examination of this tree, to compare it to other spruce trees on the mire, and to provide support for establishing protection for this tree stand. Tree-ring cores were sampled at 1.3 m above ground using Pressler borer, in two field campaigns: in June and July 2023, the latter campaign aiming to find the oldest trees. A total of 46 trees were sampled, yielding 84 measuring radii. Tree ring widths were measured down to 0.01 mm under a stereomicroscope. The oldest sampled tree yielded a total of 370 tree rings in the two radii, representing the period 1653–2022. The average tree ring width for TM15 equals 0.33 mm/year, and shows low values (on average 0.19 mm/year) for the period 1742–1943, i.e., during the Little Ice Age cooling. TM15 does not stand out from other trees from the population with respect to height or trunk diameter. A comparison of the age of this tree to the oldest spruce trees in Poland indicates that it is one of the longest living specimens of this species. Considering the natural character of the stand, the remaining flora and the peat-forming processes taking place within the mire “Pod Małym Śnieżnikiem”, we argue that the mire should become protected by the law as soon as possible in order to preserve this valuable high-mountain habitat.

With recent advancements in network technology and spread of Internet, use of social network services and Internet of Things devices has flourished, leading to a continuous generation of large volumes of graph stream data, where changes, such as additions or deletions of vertices and edges occur over time. Additionally, owing to the need for efficient use of storage space and security requirements, graph stream data compression has become essential in various applications. Even though various studies on graph compression methods have been conducted, most of them do not fully reflect the dynamic characteristics of graph streams and complexity of large graphs. In this paper, we propose a compression scheme using provenance data to efficiently process and analyze large graph stream data. It obtains provenance data by analyzing graph stream data and builds a pattern dictionary based on this to perform dictionary-based compression. By improving the existing dictionary-based graph compression methods, it enables more efficient dictionary management through tracking pattern changes and evaluating their importance using provenance. Furthermore, it considers the relationships among sub-patterns using an FP-tree and performs pattern dictionary management that updates pattern scores based on time. Our experiments show that the proposed scheme outperforms existing graph compression methods in key performance metrics, such as compression rate and processing time.

Severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) is a positive sense single stranded RNA genome containing virus which has infected millions of people all over the world particularly China. The virus has been mutating rapidly enough resulting in the emergence of new variants and sub-variants which have reportedly been spread from Wuhan city of China, the epicenter of the virus, to the rest of China and all over the world. The occurrence of mutations in the viral genome especially in the viral spike protein region has resulted in the evolution of multiple variants and sub-variants which gives the virus benefit of host immune evasion and render the modern-day vaccines and therapeutics ineffective. Therefore, there is a continuous need to study the genetic characteristics and evolutionary dynamics of the SARS-CoV-2 variants. Hence, in this study, a total of 833 complete genomes of SARS-CoV-2 variants (including the wild-type or reference sequence) from Taiyuan and Wuhan cities of China were genetically characterized and studies their phylogenetic and evolutionary dynamics using phylogenetics, genetic similarity, and phylogenetic network analysis. Our results show a lot of useful information regarding the evolutionary dynamics of the viral variants, their genetic similarities/dissimilarities, and their phylogenetic relationships. It has been reported in this study that the SARS-CoV-2 variants have nine recombinant events which suggest very important information regarding the viral evolution. In addition, the phylogenetic network analysis shows the number of mutations resulting in emergence and clustering of the viral variants of both cities which reveal significant information regarding the phylodynamics of the virus. This study, to the best of our knowledge, is the first ever genetic comparative study of Taiyuan and Wuhan cities. This study will help better understand the virus, cope with the emergence, and spread of new variants at local level as well as at international level and inform the public health authorities to make better informed decisions in designing new viral vaccines and therapeutics.