Taking experimental path on disordering AuCuI（AAuCu8A4）composed of A Au8 and ACu4 stem alloy genes as an example, three discoveries and a method were presented. The ability of Au Cu I（AAu Cu8 A4）to keep structure ...Taking experimental path on disordering AuCuI（AAuCu8A4）composed of A Au8 and ACu4 stem alloy genes as an example, three discoveries and a method were presented. The ability of Au Cu I（AAu Cu8 A4）to keep structure stabilization against changing temperature is attributed to the fact that the AAu8 and ACu4 potential well depths greatly surpass their vibration energies, which leads to the subequilibrium of experimental path. A new atom movement mechanism of AuCuI（AAuACu84）to change structure for suiting variation in temperature is the resonance activating-synchro alternating of alloy genes, which leads to heterogeneous and successive subequilibrium transitions. There exists jumping order degree, which leads to the existence of jumping Tj-temperature and an unexpected so-called ＂retro-effect＂ about jumping temperature retrograde shift to lower temperatures upon the increasing heating rate. A set of subequilibrium holographic network path charts were obtained by the experimental mixed enthalpy path method.展开更多
In most network analysis tools the computation of the shortest paths between all pairs of nodes is a fundamental step to the discovery of other properties. Among other properties is the computation of closeness centra...In most network analysis tools the computation of the shortest paths between all pairs of nodes is a fundamental step to the discovery of other properties. Among other properties is the computation of closeness centrality, a measure of the nodes that shows how central a vertex is on a given network. In this paper, the authors present a method to compute the All Pairs Shortest Paths on graphs that present two characteristics： abundance of nodes with degree value one, and existence of articulation points along the graph. These characteristics are present in many real life networks especially in networks that show a power law degree distribution as is the case of biological networks. The authors＇ method compacts the single nodes to their source, and then by using the network articulation points it disconnects the network and computes the shortest paths in the biconnected components. At the final step the authors proposed methods merges the results to provide the whole network shortest paths. The authors＇ method achieves remarkable speedup compared to state of the art methods to compute the shortest paths, as much as 7 fold speed up in artificial graphs and 3.25 fold speed up in real application graphs. The authors＇ performance improvement is unlike previous research as it does not involve elaborated setups since the authors algorithm can process significant instances on a popular workstation.展开更多
The paper proposes an economical and fast algorithm for deriving trajectories from sporadic tracking points collected in location-based services (LBS). Although many traffic studies or applications can benefit from th...The paper proposes an economical and fast algorithm for deriving trajectories from sporadic tracking points collected in location-based services (LBS). Although many traffic studies or applications can benefit from the derived trajectories, the sporadic tracking points are always implicitly overlooked by most of existing map-matching algorithms. The algorithm proposed in this paper finds network paths or trajectories traveled by vehicles through augmenting GPS data with odometer data. An odometer can provide data of traveled distance which are compared with the lengths of candidate network paths in order to find the most approximate network path approaching the trajectory of a vehicle. Tracking points are classified into anchor points and non-anchor points. The former are used to divide trajectories, and the latter screen candidate network paths. An elliptic selection zone and a reduction process are applied to the selection of possible road segments composing candidate network paths. A brute-force searching algorithm is developed to find candidate network paths and calculate their lengths. A two-step screening process is designed to select the final result from candidate network paths. Finally, a series of experiments are conducted to validate the proposed algorithm.展开更多
基金Project(51071181)supported by the National Natural Science Foundation of ChinaProject(2013FJ4043)supported by the Natural Science Foundation of Hunan Province,China
文摘Taking experimental path on disordering AuCuI（AAuCu8A4）composed of A Au8 and ACu4 stem alloy genes as an example, three discoveries and a method were presented. The ability of Au Cu I（AAu Cu8 A4）to keep structure stabilization against changing temperature is attributed to the fact that the AAu8 and ACu4 potential well depths greatly surpass their vibration energies, which leads to the subequilibrium of experimental path. A new atom movement mechanism of AuCuI（AAuACu84）to change structure for suiting variation in temperature is the resonance activating-synchro alternating of alloy genes, which leads to heterogeneous and successive subequilibrium transitions. There exists jumping order degree, which leads to the existence of jumping Tj-temperature and an unexpected so-called ＂retro-effect＂ about jumping temperature retrograde shift to lower temperatures upon the increasing heating rate. A set of subequilibrium holographic network path charts were obtained by the experimental mixed enthalpy path method.
文摘In most network analysis tools the computation of the shortest paths between all pairs of nodes is a fundamental step to the discovery of other properties. Among other properties is the computation of closeness centrality, a measure of the nodes that shows how central a vertex is on a given network. In this paper, the authors present a method to compute the All Pairs Shortest Paths on graphs that present two characteristics： abundance of nodes with degree value one, and existence of articulation points along the graph. These characteristics are present in many real life networks especially in networks that show a power law degree distribution as is the case of biological networks. The authors＇ method compacts the single nodes to their source, and then by using the network articulation points it disconnects the network and computes the shortest paths in the biconnected components. At the final step the authors proposed methods merges the results to provide the whole network shortest paths. The authors＇ method achieves remarkable speedup compared to state of the art methods to compute the shortest paths, as much as 7 fold speed up in artificial graphs and 3.25 fold speed up in real application graphs. The authors＇ performance improvement is unlike previous research as it does not involve elaborated setups since the authors algorithm can process significant instances on a popular workstation.
基金Supported by the National Natural Science Foundation of China (No40701142)the Scientific Research Starting Foundation for Returned Overseas Chinese Scholars, Ministry of Education, China
文摘The paper proposes an economical and fast algorithm for deriving trajectories from sporadic tracking points collected in location-based services (LBS). Although many traffic studies or applications can benefit from the derived trajectories, the sporadic tracking points are always implicitly overlooked by most of existing map-matching algorithms. The algorithm proposed in this paper finds network paths or trajectories traveled by vehicles through augmenting GPS data with odometer data. An odometer can provide data of traveled distance which are compared with the lengths of candidate network paths in order to find the most approximate network path approaching the trajectory of a vehicle. Tracking points are classified into anchor points and non-anchor points. The former are used to divide trajectories, and the latter screen candidate network paths. An elliptic selection zone and a reduction process are applied to the selection of possible road segments composing candidate network paths. A brute-force searching algorithm is developed to find candidate network paths and calculate their lengths. A two-step screening process is designed to select the final result from candidate network paths. Finally, a series of experiments are conducted to validate the proposed algorithm.
