This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns m...This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gateways. The new algorithm can guarantee to find a feasible gateway placement satisfying Quality-of-Service (QoS) constraints, including delay constraint, relay load constraint and gateway capacity constraint. Experimental results show that its performance is as good as that of the best of existing algorithms for the gateway placement problem. But, the new algorithm can be used for BWMNs that do not form one connected component, and it is easy to implement and use.展开更多
Purpose:With the availability and utilization of Inter-Country Input-Output(ICIO)tables,it is possible to construct quantitative indices to assess its impact on the Global Value Chain(GVC).For the sake of visualizatio...Purpose:With the availability and utilization of Inter-Country Input-Output(ICIO)tables,it is possible to construct quantitative indices to assess its impact on the Global Value Chain(GVC).For the sake of visualization,ICIO networks with tremendous low-weight edges are too dense to show the substantial structure.These redundant edges,inevitably make the network data full of noise and eventually exert negative effects on Social Network Analysis(SNA).In this case,we need a method to filter such edges and obtain a sparser network with only the meaningful connections.Design/methodology/approach:In this paper,we propose two parameterless pruning algorithms from the global and local perspectives respectively,then the performance of them is examined using the ICIO table from different databases.Findings:The Searching Paths(SP)method extracts the strongest association paths from the global perspective,while Filtering Edges(FE)method captures the key links according to the local weight ratio.The results show that the FE method can basically include the SP method and become the best solution for the ICIO networks.Research limitations:There are still two limitations in this research.One is that the computational complexity may increase rapidly while processing the large-scale networks,so the proposed method should be further improved.The other is that much more empirical networks should be introduced to testify the scientificity and practicability of our methodology.Practical implications:The network pruning methods we proposed will promote the analysis of the ICIO network,in terms of community detection,link prediction,and spatial econometrics,etc.Also,they can be applied to many other complex networks with similar characteristics.Originality/value:This paper improves the existing research from two aspects,namely,considering the heterogeneity of weights and avoiding the interference of parameters.Therefore,it provides a new idea for the research of network backbone extraction.展开更多
The virtual backbone is an approach for solving routing problems in wireless ad hoc and sensor networks. A connected dominating set (CDS) was proposed as a virtual backbone to improve the performance of wireless netwo...The virtual backbone is an approach for solving routing problems in wireless ad hoc and sensor networks. A connected dominating set (CDS) was proposed as a virtual backbone to improve the performance of wireless networks. The quality of a virtual backbone is measured not only by approximation factor, which is the ratio of its size to that of minimum CDS, but also time complexity and message complexity. In this paper, a distributed algorithm is presented to construct a minimum CDS for ad hoc and sensor networks. By destroying triangular loops in the virtual backbone, the proposed algorithm can effectively construct a CDS with smaller size. Moreover, our algorithm, which is fully localized, has a constant approximation ratio, linear message and time complexity, and low implementation complexity. The simulation results and theoretical analysis show that our algorithm has better efficiency and performance than conventional approaches.展开更多
Configuration errors are proved to be the main reasons for network interruption and anomalies.Many researchers have paid their attention to configuration analysis and provisioning,but few works focus on understanding ...Configuration errors are proved to be the main reasons for network interruption and anomalies.Many researchers have paid their attention to configuration analysis and provisioning,but few works focus on understanding the configuration evolution.In this paper,we uncover the configuration evolution of an operational IP backbone based on the weekly reports gathered from January 2006 to January 2013.We find that rate limiting and launching routes for new customers are configured most frequently.In addition,we conduct an analysis of network failures and find that link failures are the main causes for network failures.We suggest that we should configure redundant links for the links which are easy to break down.At last,according to the analysis results,we illustrate how to provide semi-automated configuration for rate limiting and adding customers.展开更多
Under the background of the rapid development of ground mobile communication,the advantages of high coverage,survivability,and flexibility of satellite communication provide air support to the construction of space in...Under the background of the rapid development of ground mobile communication,the advantages of high coverage,survivability,and flexibility of satellite communication provide air support to the construction of space information network.According to the requirements of the future space information communication,a software-defined Space-Air-Ground Integrated network architecture was proposed.It consisted of layered structure satellite backbone network,deep space communication network,the stratosphere communication network and the ground network.The Space-Air-Ground Integrated network was supported by the satellite backbone network.It provided data relay for the missions such as deep space exploration and controlled the deep-space spacecraft when needed.In addition,it safeguarded the anti-destructibility of stratospheric communication and assisted the stratosphere to supplement ground network communication.In this paper,algorithm requirements of the congestion control and routing of satellite backbone protocols for heterogeneous users’services were proposed.The algorithm requirements of distinguishing different service objects for the deep space communication and stratospheric communication network protocols were described.Considering the realistic demand for the dynamic coverage of the satellite backbone network and node cost,the multi-layer satellite backbone network architecture was constructed.On this basis,the proposed Software-defined Space-Air-Ground Integrated network architecture could be built as a large,scalable and efficient communication network that could be integrated into space,air,and ground.展开更多
In wireless sensor network,virtual backbone is a cost effective broadcasting method.Connected dominating set formation is proposed to construct a virtual backbone.However,it is NP-Hard to find a minimum connected domi...In wireless sensor network,virtual backbone is a cost effective broadcasting method.Connected dominating set formation is proposed to construct a virtual backbone.However,it is NP-Hard to find a minimum connected dominating set in an arbitrary graph.In this paper,based on cross-entropy method,we present a novel backbone formulation algorithm(BFA-CE)in wireless sensor network.In BFA-CE,a maximal independent set is got at first and nodes in the independent set are required to get their action sets.Based on those action sets,a backbone is generated with the cross-entropy method.Simulation results show that our algorithm can effectively reduce the size of backbone network within a reasonable message overhead,and it has lower average node degree.This approach can be potentially used in designing efficient broadcasting strategy or working as a backup routing of wireless sensor network.展开更多
The modern telecommunication system is characterized by the rapid improvement of information and communication technologies, such as the improvement in the data rate, power consumption and Quality of Service (QoS). Ba...The modern telecommunication system is characterized by the rapid improvement of information and communication technologies, such as the improvement in the data rate, power consumption and Quality of Service (QoS). Based on this development, the next generation network (NGN) is shaped. The NGN is represented by a packet transport network demarcated functions and services. To provide transport functions in NGN, using Multi-Protocol Label Switching (MPLS) technology, there are two main problems, which are multipath routing and traffic distribution, which are what this paper works with. Accordingly, this paper proposes a solution to these two problems using optimization procedures to find the shortest path Dijkstra and Bellman-Ford, which is characterized by a high-speed-oriented selection of a single shortest path between the source and the destination, based on several selected criteria related to the optimal use of the network resources. Solving the information flow distribution problems in large number of nodes network applying salesman procedure or having NP-completeness, causes significant time delay, which means that the proposed solution is not suitable for real time applications. Accordingly, for real time applications, there is a need to move to other methods based on the use of several independent shortest paths.展开更多
Clustering or connected dominating set (CDS) both approaches can establish a virtual backbone (VB) in wireless sensor networks (WSNs) or wireless mesh networks (WMNs). Each cluster consisting of a cluster head (CH) an...Clustering or connected dominating set (CDS) both approaches can establish a virtual backbone (VB) in wireless sensor networks (WSNs) or wireless mesh networks (WMNs). Each cluster consisting of a cluster head (CH) and its neighboring nodes can form a dominating set. After some bridging nodes were selected, cluster heads (CHs) connected through these bridging nodes naturally formed a CDS. Although CDS provides obvious backbone architecture, however, the number of cluster heads and bridging nodes may be too large, this may cause the loss of advantages of virtual backbone. When we effectively reduce their numbers, more effectively WCDS (Weakly Connected Dominating Set) can be fining out. Some essential topics on constructing WCDS-based VB in WSN/WMN are discussed in this paper. From the point of view of three different protocol layers, including network (NWK) layer, MAC layer, and physical (PHY) layer, we explore their cross-layer research topics and design algorithms. For NWK layer, area-based WCDS algorithms and routing strategies including via VB and not via VB are discussed. For MAC layer, a WCDS-based energy-efficient MAC protocol is presented. For PHY layer, battery-aware alternative VB selections and sensor nodes with different transmission ranges are addressed.展开更多
Wireless Mesh Networks(WMNs) are envisioned to support the wired backbone with a wireless Backbone Networks(BNet) for providing internet connectivity to large-scale areas.With a wide range of internet-oriented applica...Wireless Mesh Networks(WMNs) are envisioned to support the wired backbone with a wireless Backbone Networks(BNet) for providing internet connectivity to large-scale areas.With a wide range of internet-oriented applications with different Quality of Service(QoS) requirement, the large-scale WMNs should have good scalability and large bandwidth.In this paper, a Load Aware Adaptive Backbone Synthesis(LAABS) algorithm is proposed to automatically balance the traffic flow in the WMNs.The BNet will dynamically split into smaller size or merge into bigger one according to statistic load information of Backbone Nodes(BNs).Simulation results show LAABS generates moderate BNet size and converges quickly, thus providing scalable and stable BNet to facilitate traffic flow.展开更多
1 Technical Features of ZTE’sDWDM SystemThe toll backbone wave division equipmentof ZXWM M900 backbone transmissionplatform is well designed forlarge-capacity optical transmission. It canfully satisfy the networking ...1 Technical Features of ZTE’sDWDM SystemThe toll backbone wave division equipmentof ZXWM M900 backbone transmissionplatform is well designed forlarge-capacity optical transmission. It canfully satisfy the networking and managementrequirements of diversified users and be fit forvarious toll backbone networks. The systemsupports up to 40 working wavelengths and up to400 Gb/s transmission capacity, and thewavelength selection and interval are in strictcompliance with ITU-T Recommendations. It展开更多
Aiming at the problem that the current traffic safety helmet detection model can't balance the accuracy of detection with the size of the model and the poor generalization of the model,a method based on improving ...Aiming at the problem that the current traffic safety helmet detection model can't balance the accuracy of detection with the size of the model and the poor generalization of the model,a method based on improving you only look once version 5(YOLOv5) is proposed.By incorporating the lightweight Ghost Net module into the YOLOv5 backbone network,we effectively reduce the model size.The addition of the receptive fields block(RFB) module enhances feature extraction and improves the feature acquisition capability of the lightweight model.Subsequently,the high-performance lightweight convolution,GSConv,is integrated into the neck structure for further model size compression.Moreover,the baseline model's loss function is substituted with efficient insertion over union(EIoU),accelerating network convergence and enhancing detection precision.Experimental results corroborate the effectiveness of this improved algorithm in real-world traffic scenarios.展开更多
Aiming at the problems of low detection accuracy and large model size of existing object detection algorithms applied to complex road scenes,an improved you only look once version 8(YOLOv8)object detection algorithm f...Aiming at the problems of low detection accuracy and large model size of existing object detection algorithms applied to complex road scenes,an improved you only look once version 8(YOLOv8)object detection algorithm for infrared images,F-YOLOv8,is proposed.First,a spatial-to-depth network replaces the traditional backbone network's strided convolution or pooling layer.At the same time,it combines with the channel attention mechanism so that the neural network focuses on the channels with large weight values to better extract low-resolution image feature information;then an improved feature pyramid network of lightweight bidirectional feature pyramid network(L-BiFPN)is proposed,which can efficiently fuse features of different scales.In addition,a loss function of insertion of union based on the minimum point distance(MPDIoU)is introduced for bounding box regression,which obtains faster convergence speed and more accurate regression results.Experimental results on the FLIR dataset show that the improved algorithm can accurately detect infrared road targets in real time with 3%and 2.2%enhancement in mean average precision at 50%IoU(mAP50)and mean average precision at 50%—95%IoU(mAP50-95),respectively,and 38.1%,37.3%and 16.9%reduction in the number of model parameters,the model weight,and floating-point operations per second(FLOPs),respectively.To further demonstrate the detection capability of the improved algorithm,it is tested on the public dataset PASCAL VOC,and the results show that F-YOLO has excellent generalized detection performance.展开更多
通过分析政企业务的特点,结合人工智能(AI)和量子加密等新兴技术,探讨了政企OTN(Optical Transport Network)省内骨干网三种组网模式:智能独立光层模式、动态共享波分光层模式和波道透传模式。研究表明,智能独立光层模式适用于业务需求...通过分析政企业务的特点,结合人工智能(AI)和量子加密等新兴技术,探讨了政企OTN(Optical Transport Network)省内骨干网三种组网模式:智能独立光层模式、动态共享波分光层模式和波道透传模式。研究表明,智能独立光层模式适用于业务需求量大、对网络安全性要求极高且配套资源充足的地区;动态共享波分光层模式适用于现网波分系统覆盖完善但光缆纤芯等基础资源紧张的地区;波道透传模式适用于初期业务不大、现网波道资源丰富的地区。此外,根据未来技术发展趋势,提出了政企OTN网络建设的演进方向,为运营商在政企业务领域的持续发展提供了参考。展开更多
In wireless artificial intelligent computing systems,the construction of backbone network,which determines the optimum network for a set of given terminal nodes like users,switches,and concentrators,can be naturally f...In wireless artificial intelligent computing systems,the construction of backbone network,which determines the optimum network for a set of given terminal nodes like users,switches,and concentrators,can be naturally formed as the Steiner tree problem.The Steiner tree problem asks for a minimum edge-weighted tree spanning a given set of terminal vertices from a given graph.As a well-known graph problem,many algorithms have been developed for solving this computationally challenging problem in the past decades.However,existing algorithms typically encounter difficulties for solving large instances,i.e.,graphs with a high number of vertices and terminals.In this paper,we present a novel partition-and-merge algorithm for effectively handle large-scale graphs.The algorithm breaks the input network into small subgraphs and then merges the subgraphs in a bottom-up manner.In the merging procedure,partial Steiner trees in the subgraphs are also created and optimized by an efficient local optimization.When the merging procedure ends,the algorithm terminates and reports the final solution for the input graph.We evaluated the algorithm on a wide range of benchmark instances,showing that the algorithm outperforms the best-known algorithms on large instances and competes favorably with them on small or middle-sized instances.展开更多
This paper proposes a simple and efficient distributed algorithm for calculating minimal dominating set in wireless sensor network. This method can avoid maintaining the connectivities between backbone hosts. Consider...This paper proposes a simple and efficient distributed algorithm for calculating minimal dominating set in wireless sensor network. This method can avoid maintaining the connectivities between backbone hosts. Considering that the hosts in mobile networks have different characteristics, this paper proposes a method of calculating minimal dominating set with weight. The nodes can be chosen to form a minimal dominating set when the network topology changes. For the host switch on/off operation, the updating algorithm was provided. The change in the status of a hostaffects only the status of hosts in the restricted vicinity. Simulation results show that the proposed method can ensure fewer dominators but with higher weight to form the minimal dominating set and the nodes can be adaptive to the changes of network topology.展开更多
文摘This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gateways. The new algorithm can guarantee to find a feasible gateway placement satisfying Quality-of-Service (QoS) constraints, including delay constraint, relay load constraint and gateway capacity constraint. Experimental results show that its performance is as good as that of the best of existing algorithms for the gateway placement problem. But, the new algorithm can be used for BWMNs that do not form one connected component, and it is easy to implement and use.
基金support from National Natural Science Foundation of China(Grant No.71971006)Humanities and Social Science Foundation of Ministry of Education of the People’s Republic of China(Grant No.19YJCGJW014).
文摘Purpose:With the availability and utilization of Inter-Country Input-Output(ICIO)tables,it is possible to construct quantitative indices to assess its impact on the Global Value Chain(GVC).For the sake of visualization,ICIO networks with tremendous low-weight edges are too dense to show the substantial structure.These redundant edges,inevitably make the network data full of noise and eventually exert negative effects on Social Network Analysis(SNA).In this case,we need a method to filter such edges and obtain a sparser network with only the meaningful connections.Design/methodology/approach:In this paper,we propose two parameterless pruning algorithms from the global and local perspectives respectively,then the performance of them is examined using the ICIO table from different databases.Findings:The Searching Paths(SP)method extracts the strongest association paths from the global perspective,while Filtering Edges(FE)method captures the key links according to the local weight ratio.The results show that the FE method can basically include the SP method and become the best solution for the ICIO networks.Research limitations:There are still two limitations in this research.One is that the computational complexity may increase rapidly while processing the large-scale networks,so the proposed method should be further improved.The other is that much more empirical networks should be introduced to testify the scientificity and practicability of our methodology.Practical implications:The network pruning methods we proposed will promote the analysis of the ICIO network,in terms of community detection,link prediction,and spatial econometrics,etc.Also,they can be applied to many other complex networks with similar characteristics.Originality/value:This paper improves the existing research from two aspects,namely,considering the heterogeneity of weights and avoiding the interference of parameters.Therefore,it provides a new idea for the research of network backbone extraction.
基金The National Natural Science Foundation ofChina(No.60272082)The Important Science and Technology Key Item of Shanghai(No.05dzl5004)
文摘The virtual backbone is an approach for solving routing problems in wireless ad hoc and sensor networks. A connected dominating set (CDS) was proposed as a virtual backbone to improve the performance of wireless networks. The quality of a virtual backbone is measured not only by approximation factor, which is the ratio of its size to that of minimum CDS, but also time complexity and message complexity. In this paper, a distributed algorithm is presented to construct a minimum CDS for ad hoc and sensor networks. By destroying triangular loops in the virtual backbone, the proposed algorithm can effectively construct a CDS with smaller size. Moreover, our algorithm, which is fully localized, has a constant approximation ratio, linear message and time complexity, and low implementation complexity. The simulation results and theoretical analysis show that our algorithm has better efficiency and performance than conventional approaches.
基金supported by the National Natural Science Foundation of China under Grant Nos.61602105 and 61572123China Postdoctoral Science Foundation under Grant Nos.2016M601323+1 种基金the Fundamental Research Funds for the Central Universities Project under Grant No.N150403007CERNET Innovation Project under Grant No.NGII20160126
文摘Configuration errors are proved to be the main reasons for network interruption and anomalies.Many researchers have paid their attention to configuration analysis and provisioning,but few works focus on understanding the configuration evolution.In this paper,we uncover the configuration evolution of an operational IP backbone based on the weekly reports gathered from January 2006 to January 2013.We find that rate limiting and launching routes for new customers are configured most frequently.In addition,we conduct an analysis of network failures and find that link failures are the main causes for network failures.We suggest that we should configure redundant links for the links which are easy to break down.At last,according to the analysis results,we illustrate how to provide semi-automated configuration for rate limiting and adding customers.
基金This work is supported by Fundamental Research Funds for the Central Universities of China(328201911)C.G.(Chao Guo),the Open Project Program of National Engineering Laboratory for Agri-product Quality Traceability,C.G.(Chao Guo)+2 种基金Beijing Technology and Business University(BTBU)No.AQT-2018Y-B4,C.G.(Chao Guo)Higher Education Department of the Ministry of Education Industry-university Cooperative Education Project,C.G.(Chao Guo)Education and Teaching Reform Project of Beijing Electronic and Technology Institute,C.G.(Chao Guo).
文摘Under the background of the rapid development of ground mobile communication,the advantages of high coverage,survivability,and flexibility of satellite communication provide air support to the construction of space information network.According to the requirements of the future space information communication,a software-defined Space-Air-Ground Integrated network architecture was proposed.It consisted of layered structure satellite backbone network,deep space communication network,the stratosphere communication network and the ground network.The Space-Air-Ground Integrated network was supported by the satellite backbone network.It provided data relay for the missions such as deep space exploration and controlled the deep-space spacecraft when needed.In addition,it safeguarded the anti-destructibility of stratospheric communication and assisted the stratosphere to supplement ground network communication.In this paper,algorithm requirements of the congestion control and routing of satellite backbone protocols for heterogeneous users’services were proposed.The algorithm requirements of distinguishing different service objects for the deep space communication and stratospheric communication network protocols were described.Considering the realistic demand for the dynamic coverage of the satellite backbone network and node cost,the multi-layer satellite backbone network architecture was constructed.On this basis,the proposed Software-defined Space-Air-Ground Integrated network architecture could be built as a large,scalable and efficient communication network that could be integrated into space,air,and ground.
基金supported partially by the science and technology project of CQ CSTC(No.cstc2012jjA40037)
文摘In wireless sensor network,virtual backbone is a cost effective broadcasting method.Connected dominating set formation is proposed to construct a virtual backbone.However,it is NP-Hard to find a minimum connected dominating set in an arbitrary graph.In this paper,based on cross-entropy method,we present a novel backbone formulation algorithm(BFA-CE)in wireless sensor network.In BFA-CE,a maximal independent set is got at first and nodes in the independent set are required to get their action sets.Based on those action sets,a backbone is generated with the cross-entropy method.Simulation results show that our algorithm can effectively reduce the size of backbone network within a reasonable message overhead,and it has lower average node degree.This approach can be potentially used in designing efficient broadcasting strategy or working as a backup routing of wireless sensor network.
文摘The modern telecommunication system is characterized by the rapid improvement of information and communication technologies, such as the improvement in the data rate, power consumption and Quality of Service (QoS). Based on this development, the next generation network (NGN) is shaped. The NGN is represented by a packet transport network demarcated functions and services. To provide transport functions in NGN, using Multi-Protocol Label Switching (MPLS) technology, there are two main problems, which are multipath routing and traffic distribution, which are what this paper works with. Accordingly, this paper proposes a solution to these two problems using optimization procedures to find the shortest path Dijkstra and Bellman-Ford, which is characterized by a high-speed-oriented selection of a single shortest path between the source and the destination, based on several selected criteria related to the optimal use of the network resources. Solving the information flow distribution problems in large number of nodes network applying salesman procedure or having NP-completeness, causes significant time delay, which means that the proposed solution is not suitable for real time applications. Accordingly, for real time applications, there is a need to move to other methods based on the use of several independent shortest paths.
文摘Clustering or connected dominating set (CDS) both approaches can establish a virtual backbone (VB) in wireless sensor networks (WSNs) or wireless mesh networks (WMNs). Each cluster consisting of a cluster head (CH) and its neighboring nodes can form a dominating set. After some bridging nodes were selected, cluster heads (CHs) connected through these bridging nodes naturally formed a CDS. Although CDS provides obvious backbone architecture, however, the number of cluster heads and bridging nodes may be too large, this may cause the loss of advantages of virtual backbone. When we effectively reduce their numbers, more effectively WCDS (Weakly Connected Dominating Set) can be fining out. Some essential topics on constructing WCDS-based VB in WSN/WMN are discussed in this paper. From the point of view of three different protocol layers, including network (NWK) layer, MAC layer, and physical (PHY) layer, we explore their cross-layer research topics and design algorithms. For NWK layer, area-based WCDS algorithms and routing strategies including via VB and not via VB are discussed. For MAC layer, a WCDS-based energy-efficient MAC protocol is presented. For PHY layer, battery-aware alternative VB selections and sensor nodes with different transmission ranges are addressed.
基金Supported in part by Natural Science Fundation of Jiangsu Province (No.06KJA51001)
文摘Wireless Mesh Networks(WMNs) are envisioned to support the wired backbone with a wireless Backbone Networks(BNet) for providing internet connectivity to large-scale areas.With a wide range of internet-oriented applications with different Quality of Service(QoS) requirement, the large-scale WMNs should have good scalability and large bandwidth.In this paper, a Load Aware Adaptive Backbone Synthesis(LAABS) algorithm is proposed to automatically balance the traffic flow in the WMNs.The BNet will dynamically split into smaller size or merge into bigger one according to statistic load information of Backbone Nodes(BNs).Simulation results show LAABS generates moderate BNet size and converges quickly, thus providing scalable and stable BNet to facilitate traffic flow.
文摘1 Technical Features of ZTE’sDWDM SystemThe toll backbone wave division equipmentof ZXWM M900 backbone transmissionplatform is well designed forlarge-capacity optical transmission. It canfully satisfy the networking and managementrequirements of diversified users and be fit forvarious toll backbone networks. The systemsupports up to 40 working wavelengths and up to400 Gb/s transmission capacity, and thewavelength selection and interval are in strictcompliance with ITU-T Recommendations. It
文摘Aiming at the problem that the current traffic safety helmet detection model can't balance the accuracy of detection with the size of the model and the poor generalization of the model,a method based on improving you only look once version 5(YOLOv5) is proposed.By incorporating the lightweight Ghost Net module into the YOLOv5 backbone network,we effectively reduce the model size.The addition of the receptive fields block(RFB) module enhances feature extraction and improves the feature acquisition capability of the lightweight model.Subsequently,the high-performance lightweight convolution,GSConv,is integrated into the neck structure for further model size compression.Moreover,the baseline model's loss function is substituted with efficient insertion over union(EIoU),accelerating network convergence and enhancing detection precision.Experimental results corroborate the effectiveness of this improved algorithm in real-world traffic scenarios.
基金supported by the National Natural Science Foundation of China(No.62103298)。
文摘Aiming at the problems of low detection accuracy and large model size of existing object detection algorithms applied to complex road scenes,an improved you only look once version 8(YOLOv8)object detection algorithm for infrared images,F-YOLOv8,is proposed.First,a spatial-to-depth network replaces the traditional backbone network's strided convolution or pooling layer.At the same time,it combines with the channel attention mechanism so that the neural network focuses on the channels with large weight values to better extract low-resolution image feature information;then an improved feature pyramid network of lightweight bidirectional feature pyramid network(L-BiFPN)is proposed,which can efficiently fuse features of different scales.In addition,a loss function of insertion of union based on the minimum point distance(MPDIoU)is introduced for bounding box regression,which obtains faster convergence speed and more accurate regression results.Experimental results on the FLIR dataset show that the improved algorithm can accurately detect infrared road targets in real time with 3%and 2.2%enhancement in mean average precision at 50%IoU(mAP50)and mean average precision at 50%—95%IoU(mAP50-95),respectively,and 38.1%,37.3%and 16.9%reduction in the number of model parameters,the model weight,and floating-point operations per second(FLOPs),respectively.To further demonstrate the detection capability of the improved algorithm,it is tested on the public dataset PASCAL VOC,and the results show that F-YOLO has excellent generalized detection performance.
文摘通过分析政企业务的特点,结合人工智能(AI)和量子加密等新兴技术,探讨了政企OTN(Optical Transport Network)省内骨干网三种组网模式:智能独立光层模式、动态共享波分光层模式和波道透传模式。研究表明,智能独立光层模式适用于业务需求量大、对网络安全性要求极高且配套资源充足的地区;动态共享波分光层模式适用于现网波分系统覆盖完善但光缆纤芯等基础资源紧张的地区;波道透传模式适用于初期业务不大、现网波道资源丰富的地区。此外,根据未来技术发展趋势,提出了政企OTN网络建设的演进方向,为运营商在政企业务领域的持续发展提供了参考。
基金funded by the Sichuan Province Science and Technology Program(No.2024NSFTD0033)the National Natural Science Foundation of China(Nos.62372093 and 62376055)+1 种基金the Natural Science Foundation of Sichuan Province of China(No.2023NSFSC1415)the Shenzhen Agency of Innovation(No.KJZD20240903095712016).
文摘In wireless artificial intelligent computing systems,the construction of backbone network,which determines the optimum network for a set of given terminal nodes like users,switches,and concentrators,can be naturally formed as the Steiner tree problem.The Steiner tree problem asks for a minimum edge-weighted tree spanning a given set of terminal vertices from a given graph.As a well-known graph problem,many algorithms have been developed for solving this computationally challenging problem in the past decades.However,existing algorithms typically encounter difficulties for solving large instances,i.e.,graphs with a high number of vertices and terminals.In this paper,we present a novel partition-and-merge algorithm for effectively handle large-scale graphs.The algorithm breaks the input network into small subgraphs and then merges the subgraphs in a bottom-up manner.In the merging procedure,partial Steiner trees in the subgraphs are also created and optimized by an efficient local optimization.When the merging procedure ends,the algorithm terminates and reports the final solution for the input graph.We evaluated the algorithm on a wide range of benchmark instances,showing that the algorithm outperforms the best-known algorithms on large instances and competes favorably with them on small or middle-sized instances.
基金Supported by National Natural Science Foundation of China (No.60973141)Natural Science Foundation of Tianjin (No.09JCYBJC00300)
文摘This paper proposes a simple and efficient distributed algorithm for calculating minimal dominating set in wireless sensor network. This method can avoid maintaining the connectivities between backbone hosts. Considering that the hosts in mobile networks have different characteristics, this paper proposes a method of calculating minimal dominating set with weight. The nodes can be chosen to form a minimal dominating set when the network topology changes. For the host switch on/off operation, the updating algorithm was provided. The change in the status of a hostaffects only the status of hosts in the restricted vicinity. Simulation results show that the proposed method can ensure fewer dominators but with higher weight to form the minimal dominating set and the nodes can be adaptive to the changes of network topology.
