For indoor location estimation based on received signal strength( RSS) in wireless local area networks( WLAN),in order to reduce the influence of noise on the positioning accuracy,a large number of RSS should be colle...For indoor location estimation based on received signal strength( RSS) in wireless local area networks( WLAN),in order to reduce the influence of noise on the positioning accuracy,a large number of RSS should be collected in offline phase. Therefore,collecting training data with positioning information is time consuming which becomes the bottleneck of WLAN indoor localization. In this paper,the traditional semisupervised learning method based on k-NN and ε-NN graph for reducing collection workload of offline phase are analyzed,and the result shows that the k-NN or ε-NN graph are sensitive to data noise,which limit the performance of semi-supervised learning WLAN indoor localization system. Aiming at the above problem,it proposes a l1-graph-algorithm-based semi-supervised learning( LG-SSL) indoor localization method in which the graph is built by l1-norm algorithm. In our system,it firstly labels the unlabeled data using LG-SSL and labeled data to build the Radio Map in offline training phase,and then uses LG-SSL to estimate user's location in online phase. Extensive experimental results show that,benefit from the robustness to noise and sparsity ofl1-graph,LG-SSL exhibits superior performance by effectively reducing the collection workload in offline phase and improving localization accuracy in online phase.展开更多
After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algo...After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced.展开更多
Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,tra...Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,transaction performance and scalability has become the main challenges hindering the widespread adoption of blockchain.Due to its inability to meet the demands of high-frequency trading,blockchain cannot be adopted in many scenarios.To improve the transaction capacity,researchers have proposed some on-chain scaling technologies,including lightning networks,directed acyclic graph technology,state channels,and shardingmechanisms,inwhich sharding emerges as a potential scaling technology.Nevertheless,excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected aim.This paper proposes a graphbased sharding scheme for public blockchain to efficiently balance the transaction distribution.Bymitigating crossshard transactions and evening-out workloads among shards,the scheme reduces transaction confirmation latency and enhances the transaction capacity of the blockchain.Therefore,the scheme can achieve a high-frequency transaction as well as a better blockchain scalability.Experiments results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%-56%and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards.展开更多
This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study ...This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations.展开更多
Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investme...Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investments required to deploy these networks, particularly related to the cost of equipment (optical fibers, transponders and multiplexers), the optimization of bandwidth and dynamic allocation of resources is essential to control operating costs and ensure continuity of service. Automatic switching technology for optical networks brings intelligence to the control plane to fully facilitate bandwidth utilization, traffic redirection, and automatic configuration of end-to-end services. This paper considers a local network operator’s WDM network without the implementation of the automatic switching technology, develops a network modeling software platform called Graphic Networks and using graph theory integrates a particularity of the automatic switching technology, which is the automatic rerouting of traffic in case of incident in the network. The incidents considered here are those links or route failures and node failures.展开更多
电力系统的安全稳定运行是保障国家能源安全和经济发展的关键,而这在很大程度上依赖于对电力物联设备故障的准确预测。当前,随着电力物联网技术的发展,大量的数据被采集,但这些数据的潜在价值尚未得到充分挖掘,这在一定程度上限制了故...电力系统的安全稳定运行是保障国家能源安全和经济发展的关键,而这在很大程度上依赖于对电力物联设备故障的准确预测。当前,随着电力物联网技术的发展,大量的数据被采集,但这些数据的潜在价值尚未得到充分挖掘,这在一定程度上限制了故障预测的准确性,影响了电力系统的可靠运行。针对这一问题,该文提出了一种创新的基于GraphSAGE(Graph Sample and Aggregate)算法的电力物联设备故障预测。该方法通过PowerGraph数据集,将电力物联设备故障场景细分为四类,利用GraphSAGE模型的特性,深入学习和分析节点特征与边特征,从而实现对物联设备故障的有效预测。实验结果表明,该方法准确率达到97.5%,相较于其它传统方法,准确率提高了0.39%~6.21%,同时GraphSAGE模型实现了快速训练。该方法为电力物联设备安全稳定运行提供重要决策支持,能够对动态和相互联系的复杂系统进行更精细的分析,并增强电力系统运营部门对潜在干扰的预见和应对能力。展开更多
In this paper, we derive, by presenting some suitable notations, three typical graph aLgorithms and corresponding programs using a unified approach, partition-and-recur. We putemphasis on the derivation rather than th...In this paper, we derive, by presenting some suitable notations, three typical graph aLgorithms and corresponding programs using a unified approach, partition-and-recur. We putemphasis on the derivation rather than the algorithms themselves. The main ideas and lugesnutty of these algorithms are revealed by formula deduction. Success in these examples givesus more evidence that partition-and-recur is a simple and practical approach and developingenough suitable notations is the key in designing and deriving efficient and correct algorithmicprograms.展开更多
Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with p...Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy.展开更多
In this paper, graph drawing algorithms based on genetic algorithms are designed for general undirected graphs and directed graphs. As being shown, graph drawing algorithms designed by genetic algorithms have the foll...In this paper, graph drawing algorithms based on genetic algorithms are designed for general undirected graphs and directed graphs. As being shown, graph drawing algorithms designed by genetic algorithms have the following advantages: the frames of the algorithms are unified, the method is simple, different algorithms may be attained by designing different objective functions, therefore enhance the reuse of the algorithms. Also, aesthetics or constrains may be added to satisfy different requirements.展开更多
We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following a...We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following advantages: the frame of the algorithms is unified, the method is simple, and its implementation and revision are easy.展开更多
Partitioning is a fundamental problem with applications to many areas including data mining, parellel processing and Very-large-scale integration （VLSI） design. An effective multi-level algorithm for bisecting graph...Partitioning is a fundamental problem with applications to many areas including data mining, parellel processing and Very-large-scale integration （VLSI） design. An effective multi-level algorithm for bisecting graph is proposed. During its coarsening phase, an improved matching approach based on the global information of the graph core is developed with its guidance function. During the refinement phase, the vertex gain is exploited as ant＇s heuristic information and a positive feedback method based on pheromone trails is used to find the global approximate bipartitioning. It is implemented with American National Standards Institute （ANSI） C and compared to MeTiS. The experimental evaluation shows that it performs well and produces encouraging solutions on 18 different graphs benchmarks.展开更多
Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annea...Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.展开更多
Femtocell is a promising technology for improving indoor coverage and offloading the macrocell.Femtocells tend to be densely deployed in populated areas such as the dormitories.However,the inter-tier interference seri...Femtocell is a promising technology for improving indoor coverage and offloading the macrocell.Femtocells tend to be densely deployed in populated areas such as the dormitories.However,the inter-tier interference seriously exists in the co-channel Densely Deployed Femtocell Network(DDFN).Since the Femtocell Access Points(FAPs) are randomly deployed by their customers,the interference cannot be predicted in advance.Meanwhile,new characteristics such as the short radius of femtocell and the small number of users lead to the inefficiency of the traditional frequency reuse algorithms such as Fractional Frequency Reuse(FFR).Aiming for the downlink interference coordination in the DDFN,in this paper,we propose a User-oriented Graph based Frequency Allocation(UGFA)algorithm.Firstly,we construct the interference graph for users in the network.Secondly,we study the conventional graph based resources allocation algorithm.Then an improved two steps graph based frequency allocation mechanism is proposed.Simulation results show that UGFA has a high frequency reuse ratio mean while guarantees a better throughput.展开更多
The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method,...The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method, we provide an O（m） time algorithm to solve the 2-step domination problem on block graphs, a superclass of trees.展开更多
In this paper we discuss the convergence of the directed graph-algorithm for solving a kind of optimization problems where the objective and subjective functions are all separable, and the parallel implementation proc...In this paper we discuss the convergence of the directed graph-algorithm for solving a kind of optimization problems where the objective and subjective functions are all separable, and the parallel implementation process for the directed graph -algorithm is introduced.展开更多
In this paper, a new approach for visualizing multivariate categorical data is presented. The approach uses a graph to represent multivariate categorical data and draws the graph in such a way that we can identify pat...In this paper, a new approach for visualizing multivariate categorical data is presented. The approach uses a graph to represent multivariate categorical data and draws the graph in such a way that we can identify patterns, trends and relationship within the data. A mathematical model for the graph layout problem is deduced and a spectral graph drawing algorithm for visualizing multivariate categorical data is proposed. The experiments show that the drawings by the algorithm well capture the structures of multivariate categorical data and the computing speed is fast.展开更多
The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decis...The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic algorithms give improved results for large-scale combinatorial optimization problems by searching nodes and edges implicitly. We present novel symbolic ADD formulation and algorithm for maximum weighted matching in bipartite graphs. The symbolic algorithm implements the Hungarian algorithm in the context of ADD and OBDD formulation and manipulations. It begins by setting feasible labelings of nodes and then iterates through a sequence of phases. Each phase is divided into two stages. The first stage is building equality bipartite graphs, and the second one is finding maximum cardinality matching in equality bipartite graph. The second stage iterates through the following steps: greedily searching initial matching, building layered network, backward traversing node-disjoint augmenting paths, updating cardinality matching and building residual network. The symbolic algorithm does not require explicit enumeration of the nodes and edges, and therefore can handle many complex executions in each step. Simulation experiments indicate that symbolic algorithm is competitive with traditional algorithms.展开更多
It is a common practice to simulate some historical or test systems to validate the efficiency of new methods or concepts. However, there are only a small number of existing power system test cases, and validation and...It is a common practice to simulate some historical or test systems to validate the efficiency of new methods or concepts. However, there are only a small number of existing power system test cases, and validation and evaluation results, obtained using such a limited number of test cases, may not be deemed sufficient or convincing. In order to provide more available test cases, a new random graph generation algorithm, named ‘‘dualstage constructed random graph’’ algorithm, is proposed to effectively model the power grid topology. The algorithm generates a spanning tree to guarantee the connectivity of random graphs and is capable of controlling the number of lines precisely. No matter how much the average degree is,whether sparse or not, random graphs can be quickly formed to satisfy the requirements. An approach is developed to generate random graphs with prescribed numbers of connected components, in order to simulate the power grid topology under fault conditions. Our experimental study on several realistic power grid topologies proves that the proposed algorithm can quickly generate a large number of random graphs with the topology characteristics of real-world power grid.展开更多
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. ...For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.展开更多
基金Sponsored by the National Natural Science Foundation of China(Grant No.61101122)the National High Technology Research and Development Program of China(Grant No.2012AA120802)the National Science and Technology Major Project of the Ministry of Science and Technology of China(Grant No.2012ZX03004-003)
文摘For indoor location estimation based on received signal strength( RSS) in wireless local area networks( WLAN),in order to reduce the influence of noise on the positioning accuracy,a large number of RSS should be collected in offline phase. Therefore,collecting training data with positioning information is time consuming which becomes the bottleneck of WLAN indoor localization. In this paper,the traditional semisupervised learning method based on k-NN and ε-NN graph for reducing collection workload of offline phase are analyzed,and the result shows that the k-NN or ε-NN graph are sensitive to data noise,which limit the performance of semi-supervised learning WLAN indoor localization system. Aiming at the above problem,it proposes a l1-graph-algorithm-based semi-supervised learning( LG-SSL) indoor localization method in which the graph is built by l1-norm algorithm. In our system,it firstly labels the unlabeled data using LG-SSL and labeled data to build the Radio Map in offline training phase,and then uses LG-SSL to estimate user's location in online phase. Extensive experimental results show that,benefit from the robustness to noise and sparsity ofl1-graph,LG-SSL exhibits superior performance by effectively reducing the collection workload in offline phase and improving localization accuracy in online phase.
文摘After a code-table has been established by means of node association information from signal flow graph, the totally coded method (TCM) is applied merely in the domain of code operation beyond any figure-earching algorithm. The code-series (CS) have the holo-information nature, so that both the content and the sign of each gain-term can be determined via the coded method. The principle of this method is simple and it is suited for computer programming. The capability of the computer-aided analysis for switched current network (SIN) can be enhanced.
基金supported by Shandong Provincial Key Research and Development Program of China(2021CXGC010107,2020CXGC010107)the Shandong Provincial Natural Science Foundation of China(ZR2020KF035)the New 20 Project of Higher Education of Jinan,China(202228017).
文摘Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business processes.However,transaction performance and scalability has become the main challenges hindering the widespread adoption of blockchain.Due to its inability to meet the demands of high-frequency trading,blockchain cannot be adopted in many scenarios.To improve the transaction capacity,researchers have proposed some on-chain scaling technologies,including lightning networks,directed acyclic graph technology,state channels,and shardingmechanisms,inwhich sharding emerges as a potential scaling technology.Nevertheless,excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected aim.This paper proposes a graphbased sharding scheme for public blockchain to efficiently balance the transaction distribution.Bymitigating crossshard transactions and evening-out workloads among shards,the scheme reduces transaction confirmation latency and enhances the transaction capacity of the blockchain.Therefore,the scheme can achieve a high-frequency transaction as well as a better blockchain scalability.Experiments results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%-56%and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards.
文摘This research investigates the comparative efficacy of generating zero divisor graphs (ZDGs) of the ring of integers ℤ<sub>n</sub> modulo n using MAPLE algorithm. Zero divisor graphs, pivotal in the study of ring theory, depict relationships between elements of a ring that multiply to zero. The paper explores the development and implementation of algorithms in MAPLE for constructing these ZDGs. The comparative study aims to discern the strengths, limitations, and computational efficiency of different MAPLE algorithms for creating zero divisor graphs offering insights for mathematicians, researchers, and computational enthusiasts involved in ring theory and mathematical computations.
文摘Optical transport networks are now the basic infrastructure of modern communications systems, including the SDH and WDM backbone network of local network operators, in the case of Cameroon. Given the colossal investments required to deploy these networks, particularly related to the cost of equipment (optical fibers, transponders and multiplexers), the optimization of bandwidth and dynamic allocation of resources is essential to control operating costs and ensure continuity of service. Automatic switching technology for optical networks brings intelligence to the control plane to fully facilitate bandwidth utilization, traffic redirection, and automatic configuration of end-to-end services. This paper considers a local network operator’s WDM network without the implementation of the automatic switching technology, develops a network modeling software platform called Graphic Networks and using graph theory integrates a particularity of the automatic switching technology, which is the automatic rerouting of traffic in case of incident in the network. The incidents considered here are those links or route failures and node failures.
文摘电力系统的安全稳定运行是保障国家能源安全和经济发展的关键,而这在很大程度上依赖于对电力物联设备故障的准确预测。当前,随着电力物联网技术的发展,大量的数据被采集,但这些数据的潜在价值尚未得到充分挖掘,这在一定程度上限制了故障预测的准确性,影响了电力系统的可靠运行。针对这一问题,该文提出了一种创新的基于GraphSAGE(Graph Sample and Aggregate)算法的电力物联设备故障预测。该方法通过PowerGraph数据集,将电力物联设备故障场景细分为四类,利用GraphSAGE模型的特性,深入学习和分析节点特征与边特征,从而实现对物联设备故障的有效预测。实验结果表明,该方法准确率达到97.5%,相较于其它传统方法,准确率提高了0.39%~6.21%,同时GraphSAGE模型实现了快速训练。该方法为电力物联设备安全稳定运行提供重要决策支持,能够对动态和相互联系的复杂系统进行更精细的分析,并增强电力系统运营部门对潜在干扰的预见和应对能力。
文摘In this paper, we derive, by presenting some suitable notations, three typical graph aLgorithms and corresponding programs using a unified approach, partition-and-recur. We putemphasis on the derivation rather than the algorithms themselves. The main ideas and lugesnutty of these algorithms are revealed by formula deduction. Success in these examples givesus more evidence that partition-and-recur is a simple and practical approach and developingenough suitable notations is the key in designing and deriving efficient and correct algorithmicprograms.
基金Supported by the National Natural Science Foundation of China (60970016,61173032)
文摘Hardware/software（HW/SW） partitioning is one of the key processes in an embedded system.It is used to determine which system components are assigned to hardware and which are processed by software.In contrast with previous research that focuses on developing efficient heuristic,we focus on the pre-process of the task graph before the HW/SW partitioning in this paper,that is,enumerating all the sub-graphs that meet the requirements.Experimental results showed that the original graph can be reduced to 67% in the worst-case scenario and 58% in the best-case scenario.In conclusion,the reduced task graph saved hardware area while improving partitioning speed and accuracy.
基金Supported by the National Natural Science Foundation of China(60133010,60073043,70071042)
文摘In this paper, graph drawing algorithms based on genetic algorithms are designed for general undirected graphs and directed graphs. As being shown, graph drawing algorithms designed by genetic algorithms have the following advantages: the frames of the algorithms are unified, the method is simple, different algorithms may be attained by designing different objective functions, therefore enhance the reuse of the algorithms. Also, aesthetics or constrains may be added to satisfy different requirements.
文摘We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following advantages: the frame of the algorithms is unified, the method is simple, and its implementation and revision are easy.
基金the International Cooperation Project of Ministry of Science and Technology of P. R. China (GrantNo.CB7-2-01)SEC E-Institute: Shanghai High Institutions Grid
文摘Partitioning is a fundamental problem with applications to many areas including data mining, parellel processing and Very-large-scale integration （VLSI） design. An effective multi-level algorithm for bisecting graph is proposed. During its coarsening phase, an improved matching approach based on the global information of the graph core is developed with its guidance function. During the refinement phase, the vertex gain is exploited as ant＇s heuristic information and a positive feedback method based on pheromone trails is used to find the global approximate bipartitioning. It is implemented with American National Standards Institute （ANSI） C and compared to MeTiS. The experimental evaluation shows that it performs well and produces encouraging solutions on 18 different graphs benchmarks.
基金the National Natural Science Foundation of China (60373089, 60674106, and 60533010)the National High Technology Research and Development "863" Program (2006AA01Z104)
文摘Evolutionary computation techniques have mostly been used to solve various optimization problems, and it is well known that graph isomorphism problem （GIP） is a nondeterministic polynomial problem. A simulated annealing （SA） algorithm for detecting graph isomorphism is proposed, and the proposed SA algorithm is well suited to deal with random graphs with large size. To verify the validity of the proposed SA algorithm, simulations are performed on three pairs of small graphs and four pairs of large random graphs with edge densities 0.5, 0.1, and 0.01, respectively. The simulation results show that the proposed SA algorithm can detect graph isomorphism with a high probability.
基金supported by the National Natural Science Foundation of China under Grant No.61372092the China National Science and Technology Major Projects on New Generation Broadband Wireless Mobile Communications Network under Grants No.2011ZX03005-004,No.2012ZX03001029-003,No.2012ZX03001008-003
文摘Femtocell is a promising technology for improving indoor coverage and offloading the macrocell.Femtocells tend to be densely deployed in populated areas such as the dormitories.However,the inter-tier interference seriously exists in the co-channel Densely Deployed Femtocell Network(DDFN).Since the Femtocell Access Points(FAPs) are randomly deployed by their customers,the interference cannot be predicted in advance.Meanwhile,new characteristics such as the short radius of femtocell and the small number of users lead to the inefficiency of the traditional frequency reuse algorithms such as Fractional Frequency Reuse(FFR).Aiming for the downlink interference coordination in the DDFN,in this paper,we propose a User-oriented Graph based Frequency Allocation(UGFA)algorithm.Firstly,we construct the interference graph for users in the network.Secondly,we study the conventional graph based resources allocation algorithm.Then an improved two steps graph based frequency allocation mechanism is proposed.Simulation results show that UGFA has a high frequency reuse ratio mean while guarantees a better throughput.
基金Supported by the National Natural Science Foundation of China(Grant No.11271365)the Domestic Senior Visiting Scholar Program in Higher Occupation Colleges in Jiangsu Province(Grant No.2014FX075)
文摘The 2-step domination problem is to find a minimum vertex set D of a graph such that every vertex of the graph is either in D or at distance two from some vertex of D. In the present paper, by using a labeling method, we provide an O（m） time algorithm to solve the 2-step domination problem on block graphs, a superclass of trees.
文摘In this paper we discuss the convergence of the directed graph-algorithm for solving a kind of optimization problems where the objective and subjective functions are all separable, and the parallel implementation process for the directed graph -algorithm is introduced.
基金Supported by the National Natural Science Foundation of China (601133010)
文摘In this paper, a new approach for visualizing multivariate categorical data is presented. The approach uses a graph to represent multivariate categorical data and draws the graph in such a way that we can identify patterns, trends and relationship within the data. A mathematical model for the graph layout problem is deduced and a spectral graph drawing algorithm for visualizing multivariate categorical data is proposed. The experiments show that the drawings by the algorithm well capture the structures of multivariate categorical data and the computing speed is fast.
文摘The maximum weighted matching problem in bipartite graphs is one of the classic combinatorial optimization problems, and arises in many different applications. Ordered binary decision diagram (OBDD) or algebraic decision diagram (ADD) or variants thereof provides canonical forms to represent and manipulate Boolean functions and pseudo-Boolean functions efficiently. ADD and OBDD-based symbolic algorithms give improved results for large-scale combinatorial optimization problems by searching nodes and edges implicitly. We present novel symbolic ADD formulation and algorithm for maximum weighted matching in bipartite graphs. The symbolic algorithm implements the Hungarian algorithm in the context of ADD and OBDD formulation and manipulations. It begins by setting feasible labelings of nodes and then iterates through a sequence of phases. Each phase is divided into two stages. The first stage is building equality bipartite graphs, and the second one is finding maximum cardinality matching in equality bipartite graph. The second stage iterates through the following steps: greedily searching initial matching, building layered network, backward traversing node-disjoint augmenting paths, updating cardinality matching and building residual network. The symbolic algorithm does not require explicit enumeration of the nodes and edges, and therefore can handle many complex executions in each step. Simulation experiments indicate that symbolic algorithm is competitive with traditional algorithms.
文摘It is a common practice to simulate some historical or test systems to validate the efficiency of new methods or concepts. However, there are only a small number of existing power system test cases, and validation and evaluation results, obtained using such a limited number of test cases, may not be deemed sufficient or convincing. In order to provide more available test cases, a new random graph generation algorithm, named ‘‘dualstage constructed random graph’’ algorithm, is proposed to effectively model the power grid topology. The algorithm generates a spanning tree to guarantee the connectivity of random graphs and is capable of controlling the number of lines precisely. No matter how much the average degree is,whether sparse or not, random graphs can be quickly formed to satisfy the requirements. An approach is developed to generate random graphs with prescribed numbers of connected components, in order to simulate the power grid topology under fault conditions. Our experimental study on several realistic power grid topologies proves that the proposed algorithm can quickly generate a large number of random graphs with the topology characteristics of real-world power grid.
基金Project supported by the National Natural Science Foundation of China(Grant No.60972046)Grant from the National Defense Pre-Research Foundation of China
文摘For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
