Recently, a class of innovative notions on quantum network nonlocality(QNN), called full quantum network nonlocality(FQNN), have been proposed in Phys. Rev. Lett. 128 010403(2022). As the generalization of full networ...Recently, a class of innovative notions on quantum network nonlocality(QNN), called full quantum network nonlocality(FQNN), have been proposed in Phys. Rev. Lett. 128 010403(2022). As the generalization of full network nonlocality(FNN), l-level quantum network nonlocality(l-QNN) was defined in arxiv. 2306.15717 quant-ph(2024). FQNN is a NN that can be generated only from a network with all sources being non-classical. This is beyond the existing standard network nonlocality, which may be generated from a network with only a non-classical source. One of the challenging tasks is to establish corresponding Bell-like inequalities to demonstrate the FQNN or l-QNN. Up to now, the inequality criteria for FQNN and l-QNN have only been established for star and chain networks. In this paper, we devote ourselves to establishing Bell-like inequalities for networks with more complex structures. Note that star and chain networks are special kinds of tree-shaped networks. We first establish the Bell-like inequalities for verifying l-QNN in k-forked tree-shaped networks. Such results generalize the existing inequalities for star and chain networks. Furthermore, we find the Bell-like inequality criteria for l-QNN for general acyclic and cyclic networks. Finally, we discuss the demonstration of l-QNN in the well-known butterfly networks.展开更多
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 pap...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.展开更多
Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Servi...Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Service) as it can benefit from its flexibility, programmability and centralized view. In this paper, we provide delay-guaranteed data transmission service instead of "best efforts" service for a topic-based publish/subscribe system by means of exploring these specific features of SDN. We attribute this routing problem in such conditions to Delay-Constraint Lowest Cost Steiner Tree(DCLCST) problem. To solve it, we compute the shortest delay paths from source node to every subscribe node and the shortest cost paths from every subscribe node to any other node using dijkstra algorithm. Then we construct a delay-constraint least cost steiner tree for per-topic based on these paths as multicast tree. We also present experimental results to demonstrate the effectiveness of the algorithms and methods we proposed.展开更多
In this paper an expert system for remote fault diagnosis in the ship lift was developed by analysis of the fault tree and combination with VPN. The fault tree was constructed based on the operation condition of the s...In this paper an expert system for remote fault diagnosis in the ship lift was developed by analysis of the fault tree and combination with VPN. The fault tree was constructed based on the operation condition of the ship lift. The diagnosis model was constructed by hierarchical classification of the fault tree structure, and the inference mechanism was given. Logical structure of the fault diagnosis in the ship lift was proposed. The implementation of the expert system for remote fault diagnosis in the ship lift was discussed, and the expert system developed was realized on the VPN virtual network. The system was applied to the Gaobaozhou ship lift project, and it ran successfully.展开更多
As IoT devices become more ubiquitous, the security of IoT-based networks becomes paramount. Machine Learning-based cybersecurity enables autonomous threat detection and prevention. However, one of the challenges of a...As IoT devices become more ubiquitous, the security of IoT-based networks becomes paramount. Machine Learning-based cybersecurity enables autonomous threat detection and prevention. However, one of the challenges of applying Machine Learning-based cybersecurity in IoT devices is feature selection as most IoT devices are resource-constrained. This paper studies two feature selection algorithms: Information Gain and PSO-based, to select a minimum number of attack features, and Decision Tree and SVM are utilized for performance comparison. The consistent use of the same metrics in feature selection and detection algorithms substantially enhances the classification accuracy compared to the non-consistent use in feature selection by Information Gain (entropy) and Tree detection algorithm by classification. Furthermore, the Tree with consistent feature selection is comparable to the ensemble that provides excellent performance at the cost of computation complexity.展开更多
Inferring network structures from available data has attracted much interest in network science;however,in many realistic networks,only some of the nodes are perceptible while others are hidden,making it a challenging...Inferring network structures from available data has attracted much interest in network science;however,in many realistic networks,only some of the nodes are perceptible while others are hidden,making it a challenging task.In this work,we develop a method for reconstructing the network with hidden nodes and links,taking account of fast-varying noise and time-delay interactions.By calculating the correlations of available data with different derivative orders for multiple pairs of accessible nodes,analyzing and integrating the relationships between different correlations,and defining diverse hidden-node-related reconstruction motifs,we can effectively identify the hidden nodes and hidden links in the network.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.12271394 and 12071336)the Key Research and Development Program of Shanxi Province(Grant No.202102010101004)。
文摘Recently, a class of innovative notions on quantum network nonlocality(QNN), called full quantum network nonlocality(FQNN), have been proposed in Phys. Rev. Lett. 128 010403(2022). As the generalization of full network nonlocality(FNN), l-level quantum network nonlocality(l-QNN) was defined in arxiv. 2306.15717 quant-ph(2024). FQNN is a NN that can be generated only from a network with all sources being non-classical. This is beyond the existing standard network nonlocality, which may be generated from a network with only a non-classical source. One of the challenging tasks is to establish corresponding Bell-like inequalities to demonstrate the FQNN or l-QNN. Up to now, the inequality criteria for FQNN and l-QNN have only been established for star and chain networks. In this paper, we devote ourselves to establishing Bell-like inequalities for networks with more complex structures. Note that star and chain networks are special kinds of tree-shaped networks. We first establish the Bell-like inequalities for verifying l-QNN in k-forked tree-shaped networks. Such results generalize the existing inequalities for star and chain networks. Furthermore, we find the Bell-like inequality criteria for l-QNN for general acyclic and cyclic networks. Finally, we discuss the demonstration of l-QNN in the well-known butterfly networks.
基金Supported in part by the National Natural Science Foundation of China (No.60272046, No.60102011), Na-tional High Technology Project of China (No.2002AA143010), Natural Science Foundation of Jiangsu Province (No.BK2001042), and the Foundation for Excellent Doctoral Dissertation of Southeast Univer-sity (No.YBJJ0412).
文摘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.
基金supported in part by the National Natural Science Foundation of China under Grants U1804164, 61902112 and U1404602in part by the Science and Technology Foundation of Henan Educational Committee under Grants 19A510015, 20A520019 and 20A520020the Doctoral Research Project of Henan Normal University under Grant 5101119170149
文摘Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Service) as it can benefit from its flexibility, programmability and centralized view. In this paper, we provide delay-guaranteed data transmission service instead of "best efforts" service for a topic-based publish/subscribe system by means of exploring these specific features of SDN. We attribute this routing problem in such conditions to Delay-Constraint Lowest Cost Steiner Tree(DCLCST) problem. To solve it, we compute the shortest delay paths from source node to every subscribe node and the shortest cost paths from every subscribe node to any other node using dijkstra algorithm. Then we construct a delay-constraint least cost steiner tree for per-topic based on these paths as multicast tree. We also present experimental results to demonstrate the effectiveness of the algorithms and methods we proposed.
文摘In this paper an expert system for remote fault diagnosis in the ship lift was developed by analysis of the fault tree and combination with VPN. The fault tree was constructed based on the operation condition of the ship lift. The diagnosis model was constructed by hierarchical classification of the fault tree structure, and the inference mechanism was given. Logical structure of the fault diagnosis in the ship lift was proposed. The implementation of the expert system for remote fault diagnosis in the ship lift was discussed, and the expert system developed was realized on the VPN virtual network. The system was applied to the Gaobaozhou ship lift project, and it ran successfully.
文摘As IoT devices become more ubiquitous, the security of IoT-based networks becomes paramount. Machine Learning-based cybersecurity enables autonomous threat detection and prevention. However, one of the challenges of applying Machine Learning-based cybersecurity in IoT devices is feature selection as most IoT devices are resource-constrained. This paper studies two feature selection algorithms: Information Gain and PSO-based, to select a minimum number of attack features, and Decision Tree and SVM are utilized for performance comparison. The consistent use of the same metrics in feature selection and detection algorithms substantially enhances the classification accuracy compared to the non-consistent use in feature selection by Information Gain (entropy) and Tree detection algorithm by classification. Furthermore, the Tree with consistent feature selection is comparable to the ensemble that provides excellent performance at the cost of computation complexity.
基金supported by the National Natural Science Foundation of China(Grant No.11835003)supported by the National Natural Science Foundation of China(Grant Nos.12375033,12235007,and 11975131)+7 种基金the Natural Science Foundation of Zhejiang(Grant No.LY23A050002)the K.C.Wong Magna Fund at Ningbo Universitysupported by the National Natural Science Foundation of China(Grant No.T2122016)the National Science and Technology Innovation 2030 Major Program(Grant Nos.2021ZD0203700,and 2021ZD0203705)the Fundamental Research Funds for the Central Universities(Grant No.2022CDJKYJH034)supported by the National Institutes of Health(Grant Nos.R01 HL134709,R01 HL139829,R01 HL157116,and P01 HL164311)supported by the National Natural Science Foundation of China(Grant No.11905291)CAS Project for Young Scientists in Basic Research(Grant No.YSBR-041)。
文摘Inferring network structures from available data has attracted much interest in network science;however,in many realistic networks,only some of the nodes are perceptible while others are hidden,making it a challenging task.In this work,we develop a method for reconstructing the network with hidden nodes and links,taking account of fast-varying noise and time-delay interactions.By calculating the correlations of available data with different derivative orders for multiple pairs of accessible nodes,analyzing and integrating the relationships between different correlations,and defining diverse hidden-node-related reconstruction motifs,we can effectively identify the hidden nodes and hidden links in the network.