Acoustic waves in the pseudo-triaxial experiment system experience refraction phenomena.The conventional assumption that acoustic waves propagate along a straight line in traditional methods can lead to significant er...Acoustic waves in the pseudo-triaxial experiment system experience refraction phenomena.The conventional assumption that acoustic waves propagate along a straight line in traditional methods can lead to significant errors in localization results.To the end,this paper presents a method for locating acoustic emission(AE)sources in pseudo-triaxial experiments using shortest paths and orthogonal constraints.The approach consists of three main steps:(1)establishing control equations for refraction paths from AE sources to sensor locations;(2)calculating refraction point locations using the shortest travel principle and orthogonal constraints;(3)determining source coordinates using Taylor's first-order expansion.The results from laboratory AE experiments demonstrate that the average localization accuracy of the new method is only 6.5 mm,which is 66%more precise than the accuracy(19.4 mm)of the traditional method.Furthermore,simulation results indicate that the new method is not affected by the refraction ratio of the media and maintains the highest positioning accuracy across various arrival and velocity errors.展开更多
This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to del...This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.展开更多
The All-pairs shortest path problem(ALL-SPP)aims to find the shortest path joining all the vertices in a given graph.This study proposed a new optimal method,Dhouib-matrix-ALL-SPP(DM-ALL-SPP)to solve the ALL-SPP based...The All-pairs shortest path problem(ALL-SPP)aims to find the shortest path joining all the vertices in a given graph.This study proposed a new optimal method,Dhouib-matrix-ALL-SPP(DM-ALL-SPP)to solve the ALL-SPP based on column-row navigation through the adjacency matrix.DM-ALL-SPP is designed to generate in a single execution the shortest path with details among all-pairs of vertices for a graph with positive and negative weighted edges.Even for graphs with a negative cycle,DM-ALL-SPP reported a negative cycle.In addition,DM-ALL-SPP continues to work for directed,undirected and mixed graphs.Furthermore,it is characterized by two phases:the first phase consists of adding by column repeated(n)iterations(where n is the number of vertices),and the second phase resides in adding by row executed in the worst case(n∗log(n))iterations.The first phase,focused on improving the elements of each column by adding their values to each row and modifying them with the smallest value.The second phase is emphasized by rows only for the elements modified in the first phase.Different instances from the literature were used to test the performance of the proposed DM-ALL-SPP method,which was developed using the Python programming language and the results were compared to those obtained by the Floyd-Warshall algorithm.展开更多
This paper discusses the problem of finding a shortest path from a fixed origin s to a specified node t in a network with arcs represented as typical triangular fuzzy numbers (TFN). Because of the characterist...This paper discusses the problem of finding a shortest path from a fixed origin s to a specified node t in a network with arcs represented as typical triangular fuzzy numbers (TFN). Because of the characteristic of TFNs, the length of any path p from s to t , which equals the extended sum of all arcs belonging to p , is also TFN. Therefore, the fuzzy shortest path problem (FSPP) becomes to select the smallest among all those TFNs corresponding to different paths from s to t (specifically, the smallest TFN represents the shortest path). Based on Adamo's method for ranking fuzzy number, the pessimistic method and its extensions - optimistic method and λ combination method, are presented, and the FSPP is finally converted into the crisp shortest path problems.展开更多
Solving the shortest tool length quickly under a known tool trajectory in multi-axis machining of complex channel parts is an urgent problem in industrial production. To solve this problem, a novel and efficient metho...Solving the shortest tool length quickly under a known tool trajectory in multi-axis machining of complex channel parts is an urgent problem in industrial production. To solve this problem, a novel and efficient method is proposed which is featured by extracting only a few necessary curves from the check surface instead of sampling the entire surface. By rotating and compressing the 3 D check surface relative to all tool postures, the boundaries of the area occupied by the 2 D compressed surfaces are the essential elements for determining the shortest tool length. A tracking-based numerical algorithm is introduced to efficiently solve the silhouette curves which are formed in compressing. To define the multi-taper shaped tool holding system(THS) which is commonly used in production, a characterization model for THS profile is established. A model for solving the shortest tool length is finally constructed based on the critical interference relationship between the THS profile and all compressed boundary curves. For acceleration, the boundary splines are segmented according to their knot vectors. Then a new concept called the axis-aligned tool length box(AATB) is introduced,which can provide a conservative range of tool length for a spline segment. By scanning the AATBs of all spline segments, the very few effective spline segments that may ultimately determine the shortest tool length are filtered out. This acceleration method makes the solution for the shortest tool length more focused and efficient. The results of experimental examples are also reported to validate the efficiency and accuracy of the proposed algorithm.展开更多
Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved ...Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algo- rithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this pa- per. The encoding of the solution and the operators such as crossover, mutation and selection are developed. The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.展开更多
In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two...In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two steps in the method:the first step was that the shortest paths along streets between substation and load points were found by the basic ant colony algorithm to form a preliminary radial distribution network,and the second step was that the result of the shortest path was used to initialize pheromone concentration and pheromone updating rules to generate globally optimal distribution network.Cases studies show that the proposed method is effective and can meet the planning requirements.It is verified that the proposed method has better solution and utility than planning method based on the ant colony algorithm.展开更多
It’s necessary to forecast the shortest spontaneous combustion period for preventing and controlling the coal spontaneous combustion.During the experimental process,a calculating model of the SSCP is established on t...It’s necessary to forecast the shortest spontaneous combustion period for preventing and controlling the coal spontaneous combustion.During the experimental process,a calculating model of the SSCP is established on the basis of the oxidative heat release intensity and thermal capacity at different temperatures.According to the basic parameters of spontaneous combustion,heat of water evaporation and gas desorption,the SSCPs of different coals are further predicted.Finally,this study analyzed the relationships of the SSCP and the judging indexes of the self-ignite tendency.The result shows that the SSCP non-linearly increases with the decrease of dynamic oxygen adsorption and increase of activation energy.Compared with the practical fire situation of mine,this reliable method can meet the actual requirement of mine production.展开更多
This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is base...This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is based on the novel idea of a one-way separator, which has the property that any directed path can be crossed only once.展开更多
Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two point...Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.展开更多
Spinocerebellar ataxias （SCAs） are a group of genetic disorders characterized by slowly progressive incoordina- tion of gait and are often associated with poor coordination of the hands, speech, and eye movements. F...Spinocerebellar ataxias （SCAs） are a group of genetic disorders characterized by slowly progressive incoordina- tion of gait and are often associated with poor coordination of the hands, speech, and eye movements. Frequently, atrophy of the cerebellum occurs. The genetic forms of ataxia are diagnosed by family history, physical examina- tion, neuroimaging, and molecular genetic testing. At present, 36 SCA subtypes including 27 pathogenic genes have been identified [1]. Different subtypes of SCAs have clear distribution differences among ethnic populations, and SCA8 is an infrequent entity worldwide, which has mostly been reported in Japanese, but has never been reported in Chinese [2]. SCAB involves bidirectional expression based on the total number of both the （CTA）n and （CTG）n expansion transcripts in ATXN8OS. The pathogenesis of this disorder is complex and the spectrum of clinical presentations is broad. It is predominantly characterized by drawn-out slowness of speech and gait instability, followed by slowly progressive ataxia, with disease onset typically occurring in adulthood [3]. How- ever, the lowest full-penetrance allele for SCA8 onset remains elusive and the current understanding of the phenotypic and genotypic features of SCA8 is limited. Since SCA8 has not yet been reported in the Chinese population and is scantily reported in a small proportion of pedigrees so far, clinical knowledge is still developing. Moreover, the boundary between the normal and patho- genic alleles of SCA8 is uncertain. Here we report the clinical and molecular genetic characteristics of 3 Chinese SCA8 families and have identified 51 CTA/CTG repeats within ATXN8OS, probably the shortest pathogenic allele for SCA8.展开更多
The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transportation systems. In this paper, a Particle Swarm Optimization (PSO) algorithm with priority-based e...The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transportation systems. In this paper, a Particle Swarm Optimization (PSO) algorithm with priority-based encoding scheme based on fluid neural network (FNN) to search for the shortest path in stochastic traffic networks is introduced. The proposed algorithm overcomes the weight coefficient symmetry restrictions of the traditional FNN and disadvantage of easily getting into a local optimum for PSO. Simulation experiments have been carried out on different traffic network topologies consisting of 15-65 nodes and the results showed that the proposed approach can find the optimal path and closer sub-optimal paths with good success ratio. At the same time, the algorithms greatly improve the convergence efficiency of fluid neuron network.展开更多
In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2...In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2 n ＋ kw log 2 k）. If the request path does not contain the loop, the time complexity of the algorithm O（kn（w ＋ n log2 n）＋ kw log2 k）. The algorithm utilizes a simple extension of the Dijkstra algorithm determined the end of the length of the shortest path to the other vertices, and then, based on these data, branch and bound method to identify the required path. Experimental results show that the actual running time has relations with the structure of FIG.展开更多
Finding the shortest path （SP） in a large-scale network analysis between any two nodes is a tough but very significant task. The SP can help us to analyze the information spreading performance and research the laten...Finding the shortest path （SP） in a large-scale network analysis between any two nodes is a tough but very significant task. The SP can help us to analyze the information spreading performance and research the latent relationship in the weighted social network, and so on. As the size of the social network increases, the traditional SP algorithms have poor performance and there is not a suitable algorithm for weighted social network. Some features of the network analysis are beneficial to solve this problem, and community structure ignored by the traditional methods is one of the most important features. In this paper, we propose a shortest path algorithm based on community detection （SPCD） by integrating community detection algorithm with traditional search methods. SPCD constructs a community graph by using community structure to narrow the searching scope. The algorithm presented improves the time efficiency and maintains the accuracy scale of the SR Experimental results on five real-world networks demonstrate the effectiveness of the proposed methods for the SP problem.展开更多
The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our met...The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our method, the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks, including a regular network proposed by Ravasz and Barabasi which is called the RB network, a real network, a random network proposed by Ravasz and Barabasi which is called the ER network and a scale-free network, are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.展开更多
We consider the problem of detecting the community structure in a complex network, groups of nodes with a higher-than-average density of edges connecting them. In this paper we use the simulated annealing strategy to ...We consider the problem of detecting the community structure in a complex network, groups of nodes with a higher-than-average density of edges connecting them. In this paper we use the simulated annealing strategy to maximize the modularity, which has been indicated as a robust benefit function, associating with a shortest-path-based k-means iterative procedure for network partition. The proposed algorithm can not only find the communities, but also identify the nodes which occupy central positions under the metric of the shortest path within the communities to which they belong. The optimal number of communities can be automatically determined without any prior knowledge about the network structure. The applications to both artificial and real-world networks demonstrate the effectiveness of our algorithm.展开更多
A shortest path routing algorithm based on transient chaotic neural network is proposed in this paper. Gam-pared with previous models adopting Hopfield neural network, this algorithm has a higher ability to overcome t...A shortest path routing algorithm based on transient chaotic neural network is proposed in this paper. Gam-pared with previous models adopting Hopfield neural network, this algorithm has a higher ability to overcome the local minimum, and achieves a better performance. By introducing a special post-processing technique for the output matrixes, our algorithm can obtain an optimal solution with a high probability even for the paths that need more hops in large-size networks.展开更多
In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function...In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function . For each node , a time window ?within which the node may be visited and ?, is non-negative of the service and leaving time of the node. A source node s, a destination node d and a departure time?t0, the time-dependent shortest path problem with time windows asks to find an s, d-path that leaves a source node s at a departure time t0;and minimizes the total arrival time at a destination node d. This formulation generalizes the classical shortest path problem in which ce are constants. Our algorithm of the time windows gave the generalization of the ALT algorithm and A* algorithm for the classical problem according to Goldberg and Harrelson [1], Dreyfus [2] and Hart et al. [3].展开更多
To effectively solve the single-source shortest path(SSSP)problem for massive road networks in geographical information systems,a new synchronization method is proposed in the implementations of parallel SSSP algorith...To effectively solve the single-source shortest path(SSSP)problem for massive road networks in geographical information systems,a new synchronization method is proposed in the implementations of parallel SSSP algorithm.It applies spinlock by inline assembly language for the sake of small overheads of controlling the interaction of multiple threads.The performance of our method is compared with widely used Pthreads application programming interfaces and the powerful sequential solution given by DIMACS.The experimental platform is a shared address space workstation with two processors(i.e.eight cores)at a clock speed of 3 GHz.Problem instances for experiments contain a directed road networks of the USA with more than 23 million vertices and 57 million edges,and its 11 subnetworks of variant sizes.This method answers the SSSP of the USA road network in 1231 ms,while Pthreads costs 1808 ms and DIMACS sequential solution takes 4856 ms.It achieves a speedup of 3.95,which is 47%faster than Pthreads with the speedup of 2.69.When the size of instance is larger,our method achieves a better performance.展开更多
The shortest path is a widely studied network science problem and has attracted great attention.Nevertheless,it draws little attention in temporal networks,in which temporal edges determine information dissemination.I...The shortest path is a widely studied network science problem and has attracted great attention.Nevertheless,it draws little attention in temporal networks,in which temporal edges determine information dissemination.In this paper,we propose an information spreading-based method to calculate the shortest paths distribution in temporal networks.We verify our method on both artificial and real-world temporal networks and obtain a good agreement.We further generalize our method to identify influential nodes and found an effective method.Finally,we verify the influential nodes identifying method on four networks.展开更多
基金the financial support provided by the National Key Research and Development Program for Young Scientists(Grant No.2021YFC2900400)the National Natural Science Foundation of China(Grant No.52304123)the China Postdoctoral Science Foundation(Grant No.2023M730412).
文摘Acoustic waves in the pseudo-triaxial experiment system experience refraction phenomena.The conventional assumption that acoustic waves propagate along a straight line in traditional methods can lead to significant errors in localization results.To the end,this paper presents a method for locating acoustic emission(AE)sources in pseudo-triaxial experiments using shortest paths and orthogonal constraints.The approach consists of three main steps:(1)establishing control equations for refraction paths from AE sources to sensor locations;(2)calculating refraction point locations using the shortest travel principle and orthogonal constraints;(3)determining source coordinates using Taylor's first-order expansion.The results from laboratory AE experiments demonstrate that the average localization accuracy of the new method is only 6.5 mm,which is 66%more precise than the accuracy(19.4 mm)of the traditional method.Furthermore,simulation results indicate that the new method is not affected by the refraction ratio of the media and maintains the highest positioning accuracy across various arrival and velocity errors.
基金supported by Northern Border University,Arar,Kingdom of Saudi Arabia,through the Project Number“NBU-FFR-2024-2248-03”.
文摘This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.
文摘The All-pairs shortest path problem(ALL-SPP)aims to find the shortest path joining all the vertices in a given graph.This study proposed a new optimal method,Dhouib-matrix-ALL-SPP(DM-ALL-SPP)to solve the ALL-SPP based on column-row navigation through the adjacency matrix.DM-ALL-SPP is designed to generate in a single execution the shortest path with details among all-pairs of vertices for a graph with positive and negative weighted edges.Even for graphs with a negative cycle,DM-ALL-SPP reported a negative cycle.In addition,DM-ALL-SPP continues to work for directed,undirected and mixed graphs.Furthermore,it is characterized by two phases:the first phase consists of adding by column repeated(n)iterations(where n is the number of vertices),and the second phase resides in adding by row executed in the worst case(n∗log(n))iterations.The first phase,focused on improving the elements of each column by adding their values to each row and modifying them with the smallest value.The second phase is emphasized by rows only for the elements modified in the first phase.Different instances from the literature were used to test the performance of the proposed DM-ALL-SPP method,which was developed using the Python programming language and the results were compared to those obtained by the Floyd-Warshall algorithm.
文摘This paper discusses the problem of finding a shortest path from a fixed origin s to a specified node t in a network with arcs represented as typical triangular fuzzy numbers (TFN). Because of the characteristic of TFNs, the length of any path p from s to t , which equals the extended sum of all arcs belonging to p , is also TFN. Therefore, the fuzzy shortest path problem (FSPP) becomes to select the smallest among all those TFNs corresponding to different paths from s to t (specifically, the smallest TFN represents the shortest path). Based on Adamo's method for ranking fuzzy number, the pessimistic method and its extensions - optimistic method and λ combination method, are presented, and the FSPP is finally converted into the crisp shortest path problems.
基金support of National Science and Technology Major Project of China (No. JPPTKF2016)。
文摘Solving the shortest tool length quickly under a known tool trajectory in multi-axis machining of complex channel parts is an urgent problem in industrial production. To solve this problem, a novel and efficient method is proposed which is featured by extracting only a few necessary curves from the check surface instead of sampling the entire surface. By rotating and compressing the 3 D check surface relative to all tool postures, the boundaries of the area occupied by the 2 D compressed surfaces are the essential elements for determining the shortest tool length. A tracking-based numerical algorithm is introduced to efficiently solve the silhouette curves which are formed in compressing. To define the multi-taper shaped tool holding system(THS) which is commonly used in production, a characterization model for THS profile is established. A model for solving the shortest tool length is finally constructed based on the critical interference relationship between the THS profile and all compressed boundary curves. For acceleration, the boundary splines are segmented according to their knot vectors. Then a new concept called the axis-aligned tool length box(AATB) is introduced,which can provide a conservative range of tool length for a spline segment. By scanning the AATBs of all spline segments, the very few effective spline segments that may ultimately determine the shortest tool length are filtered out. This acceleration method makes the solution for the shortest tool length more focused and efficient. The results of experimental examples are also reported to validate the efficiency and accuracy of the proposed algorithm.
文摘Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the muhi-objective shortest path problem （ MSPP ） has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algo- rithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this pa- per. The encoding of the solution and the operators such as crossover, mutation and selection are developed. The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.
基金Project(2009CB219703) supported by the National Basic Research Program of ChinaProject(2011AA05A117) supported by the National High Technology Research and Development Program of China
文摘In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two steps in the method:the first step was that the shortest paths along streets between substation and load points were found by the basic ant colony algorithm to form a preliminary radial distribution network,and the second step was that the result of the shortest path was used to initialize pheromone concentration and pheromone updating rules to generate globally optimal distribution network.Cases studies show that the proposed method is effective and can meet the planning requirements.It is verified that the proposed method has better solution and utility than planning method based on the ant colony algorithm.
基金supported by China National Science Foundation of China (Nos.51074158 and 51304189)the Youth Science and Research Fund of China University of Mining and Technology of China (No.2009A006)
文摘It’s necessary to forecast the shortest spontaneous combustion period for preventing and controlling the coal spontaneous combustion.During the experimental process,a calculating model of the SSCP is established on the basis of the oxidative heat release intensity and thermal capacity at different temperatures.According to the basic parameters of spontaneous combustion,heat of water evaporation and gas desorption,the SSCPs of different coals are further predicted.Finally,this study analyzed the relationships of the SSCP and the judging indexes of the self-ignite tendency.The result shows that the SSCP non-linearly increases with the decrease of dynamic oxygen adsorption and increase of activation energy.Compared with the practical fire situation of mine,this reliable method can meet the actual requirement of mine production.
文摘This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log^3n) time with n processors. The algorithms uses a divide and conquer approach and is based on the novel idea of a one-way separator, which has the property that any directed path can be crossed only once.
基金Supported by Science Foundation of Heze University(XY14SK14)
文摘Rational planning of agricultural product transport route from initial node to destination node can effectively reduce the cost price of agricultural products,and the calculation of shortest path between any two points also affects people’s daily travel.Taking Heze Railway Station to Heze College for example,with remote sensing image data as the base map,we conduct vectorization and topological analysis on roads in the target area.With Dijkstra as theoretical basis of shortest path algorithm,we use ArcG IS network analysis method to build road network,and calculate the planning program of the shortest distance path,the shortest path by driving and the shortest path by walking.
基金supported by grants from the National Natural Science Foundation of China(81301486 and81672095)
文摘Spinocerebellar ataxias （SCAs） are a group of genetic disorders characterized by slowly progressive incoordina- tion of gait and are often associated with poor coordination of the hands, speech, and eye movements. Frequently, atrophy of the cerebellum occurs. The genetic forms of ataxia are diagnosed by family history, physical examina- tion, neuroimaging, and molecular genetic testing. At present, 36 SCA subtypes including 27 pathogenic genes have been identified [1]. Different subtypes of SCAs have clear distribution differences among ethnic populations, and SCA8 is an infrequent entity worldwide, which has mostly been reported in Japanese, but has never been reported in Chinese [2]. SCAB involves bidirectional expression based on the total number of both the （CTA）n and （CTG）n expansion transcripts in ATXN8OS. The pathogenesis of this disorder is complex and the spectrum of clinical presentations is broad. It is predominantly characterized by drawn-out slowness of speech and gait instability, followed by slowly progressive ataxia, with disease onset typically occurring in adulthood [3]. How- ever, the lowest full-penetrance allele for SCA8 onset remains elusive and the current understanding of the phenotypic and genotypic features of SCA8 is limited. Since SCA8 has not yet been reported in the Chinese population and is scantily reported in a small proportion of pedigrees so far, clinical knowledge is still developing. Moreover, the boundary between the normal and patho- genic alleles of SCA8 is uncertain. Here we report the clinical and molecular genetic characteristics of 3 Chinese SCA8 families and have identified 51 CTA/CTG repeats within ATXN8OS, probably the shortest pathogenic allele for SCA8.
文摘The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transportation systems. In this paper, a Particle Swarm Optimization (PSO) algorithm with priority-based encoding scheme based on fluid neural network (FNN) to search for the shortest path in stochastic traffic networks is introduced. The proposed algorithm overcomes the weight coefficient symmetry restrictions of the traditional FNN and disadvantage of easily getting into a local optimum for PSO. Simulation experiments have been carried out on different traffic network topologies consisting of 15-65 nodes and the results showed that the proposed approach can find the optimal path and closer sub-optimal paths with good success ratio. At the same time, the algorithms greatly improve the convergence efficiency of fluid neuron network.
文摘In this figure, it finds a vertex to another vertex k shortest path algorithm. Provided there are n vertices and edges in the diagram. If the path loops, the time complexity of the algorithm is allowed O（w ＋ n log 2 n ＋ kw log 2 k）. If the request path does not contain the loop, the time complexity of the algorithm O（kn（w ＋ n log2 n）＋ kw log2 k）. The algorithm utilizes a simple extension of the Dijkstra algorithm determined the end of the length of the shortest path to the other vertices, and then, based on these data, branch and bound method to identify the required path. Experimental results show that the actual running time has relations with the structure of FIG.
文摘Finding the shortest path （SP） in a large-scale network analysis between any two nodes is a tough but very significant task. The SP can help us to analyze the information spreading performance and research the latent relationship in the weighted social network, and so on. As the size of the social network increases, the traditional SP algorithms have poor performance and there is not a suitable algorithm for weighted social network. Some features of the network analysis are beneficial to solve this problem, and community structure ignored by the traditional methods is one of the most important features. In this paper, we propose a shortest path algorithm based on community detection （SPCD） by integrating community detection algorithm with traditional search methods. SPCD constructs a community graph by using community structure to narrow the searching scope. The algorithm presented improves the time efficiency and maintains the accuracy scale of the SR Experimental results on five real-world networks demonstrate the effectiveness of the proposed methods for the SP problem.
基金supported by the National Natural Science Foundation of China (Grant No 60672095)the National High-Tech Research and Development Program of China (Grant No 2007AA11Z210)+3 种基金the Doctoral Fund of Ministry of Education of China (Grant No 20070286004)the Natural Science Foundation of Jiangsu Province,China (Grant No BK2008281)the Science and Technology Program of Southeast University,China (Grant No KJ2009351)the Excellent Young Teachers Program of Southeast University,China (Grant No BG2007428)
文摘The shortcomings of traditional methods to find the shortest path are revealed, and a strategy of finding the self- organizing shortest path based on thermal flux diffusion on complex networks is presented. In our method, the shortest paths between the source node and the other nodes are found to be self-organized by comparing node temperatures. The computation complexity of the method scales linearly with the number of edges on underlying networks. The effects of the method on several networks, including a regular network proposed by Ravasz and Barabasi which is called the RB network, a real network, a random network proposed by Ravasz and Barabasi which is called the ER network and a scale-free network, are also demonstrated. Analytic and simulation results show that the method has a higher accuracy and lower computational complexity than the conventional methods.
基金Supported by the National Natural Science Foundation of China(Grant No.10771085)
文摘We consider the problem of detecting the community structure in a complex network, groups of nodes with a higher-than-average density of edges connecting them. In this paper we use the simulated annealing strategy to maximize the modularity, which has been indicated as a robust benefit function, associating with a shortest-path-based k-means iterative procedure for network partition. The proposed algorithm can not only find the communities, but also identify the nodes which occupy central positions under the metric of the shortest path within the communities to which they belong. The optimal number of communities can be automatically determined without any prior knowledge about the network structure. The applications to both artificial and real-world networks demonstrate the effectiveness of our algorithm.
文摘A shortest path routing algorithm based on transient chaotic neural network is proposed in this paper. Gam-pared with previous models adopting Hopfield neural network, this algorithm has a higher ability to overcome the local minimum, and achieves a better performance. By introducing a special post-processing technique for the output matrixes, our algorithm can obtain an optimal solution with a high probability even for the paths that need more hops in large-size networks.
文摘In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function . For each node , a time window ?within which the node may be visited and ?, is non-negative of the service and leaving time of the node. A source node s, a destination node d and a departure time?t0, the time-dependent shortest path problem with time windows asks to find an s, d-path that leaves a source node s at a departure time t0;and minimizes the total arrival time at a destination node d. This formulation generalizes the classical shortest path problem in which ce are constants. Our algorithm of the time windows gave the generalization of the ALT algorithm and A* algorithm for the classical problem according to Goldberg and Harrelson [1], Dreyfus [2] and Hart et al. [3].
文摘To effectively solve the single-source shortest path(SSSP)problem for massive road networks in geographical information systems,a new synchronization method is proposed in the implementations of parallel SSSP algorithm.It applies spinlock by inline assembly language for the sake of small overheads of controlling the interaction of multiple threads.The performance of our method is compared with widely used Pthreads application programming interfaces and the powerful sequential solution given by DIMACS.The experimental platform is a shared address space workstation with two processors(i.e.eight cores)at a clock speed of 3 GHz.Problem instances for experiments contain a directed road networks of the USA with more than 23 million vertices and 57 million edges,and its 11 subnetworks of variant sizes.This method answers the SSSP of the USA road network in 1231 ms,while Pthreads costs 1808 ms and DIMACS sequential solution takes 4856 ms.It achieves a speedup of 3.95,which is 47%faster than Pthreads with the speedup of 2.69.When the size of instance is larger,our method achieves a better performance.
基金Project supported by the National Natural Science Foundation of China(Grant No.61903266)China Postdoctoral Science Foundation(Grant No.2018M631073)+2 种基金China Postdoctoral Science Special Foundation(Grant No.2019T120829)the Fundamental Research Funds for the Central Universities,ChinaSichuan Science and Technology Program,China(Grant No.20YYJC4001)。
文摘The shortest path is a widely studied network science problem and has attracted great attention.Nevertheless,it draws little attention in temporal networks,in which temporal edges determine information dissemination.In this paper,we propose an information spreading-based method to calculate the shortest paths distribution in temporal networks.We verify our method on both artificial and real-world temporal networks and obtain a good agreement.We further generalize our method to identify influential nodes and found an effective method.Finally,we verify the influential nodes identifying method on four networks.
