Tree Network Formation in Poisson Equation Models and the Implications for the Maximum Entropy Production Principle

This paper presents not only practical but also instructive mathematical models to simulate tree network formation using the Poisson equation and the Finite Difference Method (FDM). Then, the implications for entropic theories are discussed from the viewpoint of Maximum Entropy Production (MEP). According to the MEP principle, open systems existing in the state far from equilibrium are stabilized when entropy production is maximized, creating dissipative structures with low entropy such as the tree-shaped network. We prepare two simulation models: one is the Poisson equation model that simulates the state far from equilibrium, and the other is the Laplace equation model that simulates the isolated state or the state near thermodynamic equilibrium. The output of these equations is considered to be positively correlated to entropy production of the system. Setting the Poisson equation model so that entropy production is maximized, tree network formation is advanced. We suppose that this is due to the invocation of the MEP principle, that is, entropy of the system is lowered by emitting maximal entropy out of the system. On the other hand, tree network formation is not observed in the Laplace equation model. Our simulation results will offer the persuasive evidence that certifies the effect of the MEP principle.

Machine Learning Models for Heterogenous Network Security Anomaly Detection

The increasing amount and intricacy of network traffic in the modern digital era have worsened the difficulty of identifying abnormal behaviours that may indicate potential security breaches or operational interruptions. Conventional detection approaches face challenges in keeping up with the ever-changing strategies of cyber-attacks, resulting in heightened susceptibility and significant harm to network infrastructures. In order to tackle this urgent issue, this project focused on developing an effective anomaly detection system that utilizes Machine Learning technology. The suggested model utilizes contemporary machine learning algorithms and frameworks to autonomously detect deviations from typical network behaviour. It promptly identifies anomalous activities that may indicate security breaches or performance difficulties. The solution entails a multi-faceted approach encompassing data collection, preprocessing, feature engineering, model training, and evaluation. By utilizing machine learning methods, the model is trained on a wide range of datasets that include both regular and abnormal network traffic patterns. This training ensures that the model can adapt to numerous scenarios. The main priority is to ensure that the system is functional and efficient, with a particular emphasis on reducing false positives to avoid unwanted alerts. Additionally, efforts are directed on improving anomaly detection accuracy so that the model can consistently distinguish between potentially harmful and benign activity. This project aims to greatly strengthen network security by addressing emerging cyber threats and improving their resilience and reliability.

Immunizations on small worlds of tree-based wireless sensor networks

The sensor virus is a serious threat,as an attacker can simply send a single packet to compromise the entire sensor network.Epidemics become drastic with link additions among sensors when the small world phenomena occur.Two immunization strategies,uniform immunization and temporary immunization,are conducted on small worlds of tree-based wireless sensor networks to combat the sensor viruses.With the former strategy,the infection extends exponentially,although the immunization effectively reduces the contagion speed.With the latter strategy,recurrent contagion oscillations occur in the small world when the spatial-temporal dynamics of the epidemic are considered.The oscillations come from the small-world structure and the temporary immunization.Mathematical analyses on the small world of the Cayley tree are presented to reveal the epidemic dynamics with the two immunization strategies.

Fetal distress prediction using discriminant analysis, decision tree, and artificial neural network

Fetal distress is one of the main factors to cesarean section in obstetrics and gynecology. If the fetus lack of oxygen in uterus, threat to the fetal health and fetal death could happen. Cardiotocography (CTG) is the most widely used technique to monitor the fetal health and fetal heart rate (FHR) is an important index to identify occurs of fetal distress. This study is to propose discriminant analysis (DA), decision tree (DT), and artificial neural network (ANN) to evaluate fetal distress. The results show that the accuracies of DA, DT and ANN are 82.1%, 86.36% and 97.78%, respectively.

A NOVEL INTRUSION DETECTION MODE BASED ON UNDERSTANDABLE NEURAL NETWORK TREES

Several data mining techniques such as Hidden Markov Model (HMM), artificial neural network, statistical techniques and expert systems are used to model network packets in the field of intrusion detection. In this paper a novel intrusion detection mode based on understandable Neural Network Tree (NNTree) is pre-sented. NNTree is a modular neural network with the overall structure being a Decision Tree (DT), and each non-terminal node being an Expert Neural Network (ENN). One crucial advantage of using NNTrees is that they keep the non-symbolic model ENN’s capability of learning in changing environments. Another potential advantage of using NNTrees is that they are actually “gray boxes” as they can be interpreted easily if the num-ber of inputs for each ENN is limited. We showed through experiments that the trained NNTree achieved a simple ENN at each non-terminal node as well as a satisfying recognition rate of the network packets dataset. We also compared the performance with that of a three-layer backpropagation neural network. Experimental results indicated that the NNTree based intrusion detection model achieved better performance than the neural network based intrusion detection model.

INDUCTION OF DECISION TREES BASED ON A FUZZY NEURAL NETWORK

Based on a fuzzy neural network, the letter presents an approach for the induction of decision trees. The approach makes use of the weights of fuzzy mappings in the fuzzy neural network which has been trained. It can realize the optimization of fuzzy decision trees by branch cutting, and improve the ratio of correctness and efficiency of the induction of decision trees.

Assessing the performance of decision tree and neural network models in mapping soil properties

To build any spatial soil database, a set of environmental data including digital elevation model(DEM) and satellite images beside geomorphic landscape description are essentials. Such a database, integrates field observations and laboratory analyses data with the results obtained from qualitative and quantitative models. So far, various techniques have been developed for soil data processing. The performance of Artificial Neural Network(ANN) and Decision Tree(DT) models was compared to map out some soil attributes in Alborz Province, Iran. Terrain attributes derived from a DEM along with Landsat 8 ETM+, geomorphology map, and the routine laboratory analyses of the studied area were used as input data. The relationships between soil properties(including sand, silt, clay, electrical conductivity, organic carbon, and carbonates) and the environmental variables were assessed using the Pearson Correlation Coefficient and Principle Components Analysis. Slope, elevation, geomforms, carbonate index, stream network, wetness index, and the band’s number 2, 3, 4, and 5 were the most significantly correlated variables. ANN and DT did not show the same accuracy in predicting all parameters. The DT model showed higher performances in estimating sand(R^2=0.73), silt(R^2=0.70), clay(R^2=0.72), organic carbon(R^2=0.71), and carbonates(R^2=0.70). While the ANN model only showed higher performance in predicting soil electrical conductivity(R^2=0.95). The results showed that determination the best model to use, is dependent upon the relation between the considered soil properties with the environmental variables. However, the DT model showed more reasonable results than the ANN model in this study. The results showed that before using a certain model to predict variability of all soil parameters, it would be better to evaluate the efficiency of all possible models for choosing the best fitted model for each property. In other words, most of the developed models are sitespecific and may not be applicable to use for predicting other soil properties or other area.

A Study on Priority Based ZigBee Network Performance Analysis with Tree Routing Method

The Wireless Sensor Network (WSN) is spatially distributed autonomous sensor to sense special task. WSN like ZigBee network forms simple interconnecting, low power, and low processing capability wireless devices. The ZigBee devices facilitate numerous applications such as pervasive computing, security monitoring and control. ZigBee end devices collect sensing data and send them to ZigBee Coordinator. The Coordinator processes end device requests. The effect of a large number of random unsynchronized requests may degrade the overall network performance. An effective technique is particularly needed for synchronizing available node’s request processing to design a reliable ZigBee network. In this paper, region based priority mechanism is implemented to synchronize request with Tree Routing Method. Riverbed is used to simulate and analyze overall ZigBee network performance. The results show that the performance of the overall priority based ZigBee network model is better than without a priority based model. This research paves the way for further designing and modeling a large scale ZigBee network.

A NOTE ON THE NESTEDNESS PROPERTY FOR ORDERED MEDIAN PROBLEMS IN TREE NETWORKS

The nestedness property has become an increasingly important means for devising efficient algorithms for network location problems.There have been attempts to explore the nestedness property of network location problems with some special cases of the convex ordered median objectives.However,there is little research on the nestedness property for those problems with the concave ordered median objectives.This paper constructs a tree network T and shows that the nestedness property cannot hold for the concave ordered median problem,which fills a gap in the research on the nestedness property.Finally,the authors pose an open problem on identifying the nestedness property for the continuous strategic ordered median problem.

A Tree-Based Data Collecting Network Structure for Wireless Sensor Networks

In a sensor network with a large number of densely populated sensor nodes, a single target of interest may be detected by multiple sensor nodes simultaneously. Data collected from the sensor nodes are usually highly correlated, and hence energy saving using in-network data fusion becomes possible. A traditional data fusion scheme starts with dividing the network into clusters, followed by electing a sensor node as cluster head in each cluster. A cluster head is responsible for collecting data from all its cluster members, performing data fusion on these data and transmitting the fused data to the base station. Assuming that a sensor node is only capable of handling a single node-to-node transmission at a time and each transmission takes T time-slots, a cluster head with n cluster members will take at least nT time-slots to collect data from all its cluster members. In this paper, a tree-based network structure and its formation algorithms are proposed. Simulation results show that the proposed network structure can greatly reduce the delay in data collection.

Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.

Using junction trees for structural learning of Bayesian networks

The learning Bayesian network （BN） structure from data is an NP-hard problem and still one of the most exciting chal- lenges in the machine learning. In this work, a novel algorithm is presented which combines ideas from local learning, constraint- based, and search-and-score techniques in a principled and ef- fective way. It first reconstructs the junction tree of a BN and then performs a K2-scoring greedy search to orientate the local edges in the cliques of junction tree. Theoretical and experimental results show the proposed algorithm is capable of handling networks with a large number of variables. Its comparison with the well-known K2 algorithm is also presented.

Tree-Based Proactive Routing Protocol for Wireless Mesh Network

Wireless Mesh Network (WMN) is seen as an effective Internet access solution for dynamic wireless applications. For the low mobility of mesh routers in WMN, the backbone topography can be effectively maintained by proactive routing protocol. Pre-proposals like Tree Based Routing (TBR) protocol and Root Driven Routing (RDR) protocol are so centralized that they make the gateway become a bottleneck which severely restricts the network performance. We proposed an Optimized Tree-based Routing (OTR) protocol that logically separated the proactive tree into pieces. Route is partly computed by the branches instead of root. We also discussed the operation of multiple Internet gateways which is a main issue in WMN. The new proposal lightens the load in root, reduces the overhead and improves the throughput. Numerical analysis and simulation results confirm that the performance of WMN is improved and OTR is more suitable for large scale WMN.

Analysis of thermal conductivity in tree-like branched networks

Asymmetric tree-like branched networks are explored by geometric algorithms. Based on the network, an analysis of the thermal conductivity is presented. The relationship between effective thermal conductivity and geometric structures is obtained by using the thermal-electrical analogy technique. In all studied cases, a clear behaviour is observed, where angle （δ,θ） among parent branching extended lines, branches and parameter of the geometric structures have stronger effects on the effective thermal conductivity. When the angle δ is fixed, the optical diameter ratio β＋ is dependent on angle θ. Moreover, γand m are not related to β＊. The longer the branch is, the smaller the effective thermal conductivity will be. It is also found that when the angle θ〈δ2, the higher the iteration m is, the lower the thermal conductivity will be and it tends to zero, otherwise, it is bigger than zero. When the diameter ratio β1 〈 0.707 and angle δ is bigger, the optimal k of the perfect ratio increases with the increase of the angle δ; when β1 〉 0.707, the optimal k decreases. In addition, the effective thermal conductivity is always less than that of single channel material. The present results also show that the effective thermal conductivity of the asymmetric tree-like branched networks does not obey Murray＇s law.

FPGA-Based Network Traffic Security: Design and Implementation Using C5.0 Decision Tree Classifier

In this work, a hardware intrusion detection system （IDS） model and its implementation are introduced to perform online real-time traffic monitoring and analysis. The introduced system gathers some advantages of many IDSs： hardware based from implementation point of view, network based from system type point of view, and anomaly detection from detection approach point of view. In addition, it can detect most of network attacks, such as denial of services （DOS）, leakage, etc. from detection behavior point of view and can detect both internal and external intruders from intruder type point of view. Gathering these features in one IDS system gives lots of strengths and advantages of the work. The system is implemented by using field programmable gate array （FPGA）, giving a more advantages to the system. A C5.0 decision tree classifier is used as inference engine to the system and gives a high detection ratio of 99.93%.

Network security equipment evaluation based on attack tree with risk fusion

Network security equipment is crucial to information systems, and a proper evaluation model can ensure the quality of network security equipment. However, there is only a few models of comprehensive models nowadays. An index system for network security equipment was established and a model based on attack tree with risk fusion was proposed to obtain the score of qualitative indices. The proposed model implements attack tree model and controlled interval and memory(CIM) model to solve the problem of quantifying qualitative indices, and thus improves the accuracy of the evaluation.

Finite family trees of continuous time birth and death processes for evaluating the transmitting speed of information on communication networks

A finite random graph generated by continuous time birth and death processes with exponentially distributed waiting times was investigated, which is similar to a communication network in daily life. The vertices are the living particles, and directed edges go from mothers to daughters. The size of the communication network was studied. Furthermore, the probability of successfully connecting senders with receivers and the transmitting speed of information were obtained.

Complex tree: the basic framework of protein-protein interaction networks

In living cells, proteins are dynamically connec ted through biochemical reactions, so its functi onal features are properly encoded into protein protein interaction networks (PINs). Up to pres ent, many efforts have been devoted to exploring the basic feature of PINs. However, it is still a challenging problem to explore a universal pr operty of PINs. Here we employed the complex networks theory to analyze the proteinprotein interactions from Database of Interacting Prot ein. Complex tree: the unique framework of PINs was revealed by three topological properties of the giant component of PINs (GCOP), including rightskewed degree distributions, relatively sm all clustering coefficients and short characteristic path lengths. Furthermore, we proposed a no nlinearly growth model: complex tree model to reflect the tree framework, the simulation resu lts of this model showed that GCOPs were well represented by our model, which could be help ful for understanding the treestructure: basic framework of PINs. Source code and binaries freely available for download at http://cic.scu. edu.cn/bioinformatics/STM/STM_code.rar.