This paper presents a new proof of a charaterization of fractional (g, f)-factors of a graph in which multiple edges are allowed. From the proof a polynomial algorithm for finding the fractional (g, f)-factor can be i...This paper presents a new proof of a charaterization of fractional (g, f)-factors of a graph in which multiple edges are allowed. From the proof a polynomial algorithm for finding the fractional (g, f)-factor can be induced.展开更多
Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper present...Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.展开更多
The article presents an approach to the maximum flow problem in parametric networks with linear capacity functions of a single parameter, based on the concept of shortest conditional augmenting directed path. In order...The article presents an approach to the maximum flow problem in parametric networks with linear capacity functions of a single parameter, based on the concept of shortest conditional augmenting directed path. In order to avoid working with piecewise linear functions, our approach uses a series of parametric residual networks defined for successive subintervals of the parameter values where the parametric residual capacities of all arcs remain linear functions. Besides working with linear instead piecewise linear functions, another main advantage of our approach is that every directed path in such a parametric residual network is also a conditional augmenting directed path for the subinterval for which the parametric residual network was defined. The complexity of the partitioning algorithm is O (Kn2m) where K is the number of partitioning points of the parameter values interval, n and m being the number of nodes, respectively the number of arcs in the network.展开更多
Coal-gangue object detection has attracted substantial attention because it is the core of realizing vision-based intelligent and green coal separation. However, most existing studies have been focused on laboratory d...Coal-gangue object detection has attracted substantial attention because it is the core of realizing vision-based intelligent and green coal separation. However, most existing studies have been focused on laboratory datasets and prioritized model lightweight. This makes the coal-gangue object detection challenging to adapt to the complex and harsh scenes of real production environments. Therefore, our project collected and labeled image datasets of coal and gangue under real production conditions from a coal preparation plant. We then designed a one-stage object model, named STATNet, following the “backbone-neck-head” architecture with the aim of enhancing the detection accuracy under industrial coal preparation scenarios. The proposed model utilizes Swin Transformer as backbone module to extract multi-scale features, improved path augmentation feature pyramid network (iPAFPN) as neck module to enrich feature fusion, and task-aligned head (TAH) as head module to mitigate conflicts and misalignments between classification and localization tasks. Experimental results on a real-world industrial dataset demonstrate that the proposed STATNet model achieves an impressive AP50 of 89.27 %, significantly surpassing several state-of-the-art baseline models by 2.02 % to 5.58 %. Additionally, it exhibits stronger robustness in resisting image corruption and perturbation. These findings demonstrate its promising prospects in practical coal and gangue separation applications.展开更多
基金This work is supported by NNSF of ChinaRFDP of Higher Education
文摘This paper presents a new proof of a charaterization of fractional (g, f)-factors of a graph in which multiple edges are allowed. From the proof a polynomial algorithm for finding the fractional (g, f)-factor can be induced.
文摘Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.
文摘The article presents an approach to the maximum flow problem in parametric networks with linear capacity functions of a single parameter, based on the concept of shortest conditional augmenting directed path. In order to avoid working with piecewise linear functions, our approach uses a series of parametric residual networks defined for successive subintervals of the parameter values where the parametric residual capacities of all arcs remain linear functions. Besides working with linear instead piecewise linear functions, another main advantage of our approach is that every directed path in such a parametric residual network is also a conditional augmenting directed path for the subinterval for which the parametric residual network was defined. The complexity of the partitioning algorithm is O (Kn2m) where K is the number of partitioning points of the parameter values interval, n and m being the number of nodes, respectively the number of arcs in the network.
基金funded by the Fundamental Research Funds for the Central Universities(No.2020ZDPY0214).
文摘Coal-gangue object detection has attracted substantial attention because it is the core of realizing vision-based intelligent and green coal separation. However, most existing studies have been focused on laboratory datasets and prioritized model lightweight. This makes the coal-gangue object detection challenging to adapt to the complex and harsh scenes of real production environments. Therefore, our project collected and labeled image datasets of coal and gangue under real production conditions from a coal preparation plant. We then designed a one-stage object model, named STATNet, following the “backbone-neck-head” architecture with the aim of enhancing the detection accuracy under industrial coal preparation scenarios. The proposed model utilizes Swin Transformer as backbone module to extract multi-scale features, improved path augmentation feature pyramid network (iPAFPN) as neck module to enrich feature fusion, and task-aligned head (TAH) as head module to mitigate conflicts and misalignments between classification and localization tasks. Experimental results on a real-world industrial dataset demonstrate that the proposed STATNet model achieves an impressive AP50 of 89.27 %, significantly surpassing several state-of-the-art baseline models by 2.02 % to 5.58 %. Additionally, it exhibits stronger robustness in resisting image corruption and perturbation. These findings demonstrate its promising prospects in practical coal and gangue separation applications.
