Fe-N compounds with excellent electrocatalytic oxygen reduction activity are considered to be one of the most promising non-precious metal materials for fuel cells.Fe-N compounds with excellent electrocatalytic oxygen...Fe-N compounds with excellent electrocatalytic oxygen reduction activity are considered to be one of the most promising non-precious metal materials for fuel cells.Fe-N compounds with excellent electrocatalytic oxygen reduction activity are considered to be one of the most promising non-precious metal materials for fuel cells,which focuses on the Fe-N4 single-atom catalysts and the iron nitride materials(such as Fe2N and Fe3N).A hybridized catalyst having a hierarchical porous structure with regular macropores could enable the desired mass transfer efficiency in the catalytic process.In this study,we have constructed a new type of hybrid catalyst having iron and iron-nitrogen alloy nanoparticles(Fe-N austenite,termed as Fe-NA)embedded in the three-dimensional ordered macroporous N-doped carbon(3DOM Fe/Fe-NA@NC)by direct pyrolysis of single-source dicyandiamide-based iron metal-organic frameworks.The as-synthesized composites preserve the hierarchical porous carbon framework with ordered macropores and high specific surface area,incorporating the uniformly dispersed iron/iron-nitrogen austenite nanoparticles.Thereby,the striking architectural configuration embedded with highly active catalytic species delivers a superior oxygen reduction activity with a half-wave potential of 0.88 V and a subsequent superior Zn-air battery performance with high open-circuit voltage and continuous stability as compared to those using a commercial 20%Pt/C catalyst.展开更多
This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linea...This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.展开更多
The present paper predicted the function of unknow genes by analyzing the co-expression data of Arabidopsis thaliana from biological pathway based on the shortest-path algorithm. This paper proposed that transitive co...The present paper predicted the function of unknow genes by analyzing the co-expression data of Arabidopsis thaliana from biological pathway based on the shortest-path algorithm. This paper proposed that transitive co-expression among genes can be used as an important attribute to link genes of the same biological pathway. The genes from the same biological pathway with similar functions are strongly correlated in expression. Moreover,the function of unknown genes can be predicted by the known genes where they are strongly correlated in expression lying on the same shortest-path from the biological pathway. Analyzing the Arabidopsis thaliana from the biological pathway,this study showed that this method can reliably reveal function of the unknown Arabidopsis thaliana genes and the approach of predicting gene function by transitiving co-expression in shortest-path is feasible and effective.展开更多
Fast identifying the amount of information that can be gained by measuring a network via shortest-paths is one of the fundamental problem for networks exploration and monitoring.However,the existing methods are time-c...Fast identifying the amount of information that can be gained by measuring a network via shortest-paths is one of the fundamental problem for networks exploration and monitoring.However,the existing methods are time-consuming for even moderate-scale networks.In this paper,we present a method for fast shortest-path cover identification in both exact and approximate scenarios based on the relationship between the identification and the shortest distance queries.The effectiveness of the proposed method is validated through synthetic and real-world networks.The experimental results show that our method is 105 times faster than the existing methods and can solve the shortest-path cover identification in a few seconds for large-scale networks with millions of nodes and edges.展开更多
Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering. This paper presents a link analysis technique that uses a modified shortest-path algorithms to id...Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering. This paper presents a link analysis technique that uses a modified shortest-path algorithms to identify the strongest association paths between entities in a money laundering network. Based on two-tree Dijkstra and Priority＇First-Search （PFS） algorithm, a modified algorithm is presented. To apply the algorithm, a network representation transformation is made first.展开更多
For the first time, ZrC-ZrB_2-SiC ceramic nanocomposites were successfully prepared by a single-source-precursor route, with allylhydridopolycarbosilane(AHPCS),triethylamine borane(TEAB),and bis(cyclopentadienyl) zirc...For the first time, ZrC-ZrB_2-SiC ceramic nanocomposites were successfully prepared by a single-source-precursor route, with allylhydridopolycarbosilane(AHPCS),triethylamine borane(TEAB),and bis(cyclopentadienyl) zirconium dichloride(Cp_2 ZrCl_2) as starting materials. The polymer-to-ceramic transformation and thermal behavior of obtained single-source precursor were characterized by means of Fourier transform infrared spectroscopy(FT-IR) and thermal gravimetric analysis(TGA). The results show that the precursor possesses a high ceramic yield about 85% at 1000 ℃.The phase composition and microstructure of formed ZrC-ZrB_2-SiC ceramics were investigated by means of X-ray diffraction(XRD) and high resolution transmission electron microscopy(HRTEM).Meanwhile, the weight loss and chemical composition of the resultant ZrC-ZrB_2-SiC nanocomposites were investigated after annealing at high temperature up to 1800 ℃. High temperature behavior with respect to decomposition as well as crystallization shows a promising high temperature stability of the formed ZrC-ZrB_2-SiC nanocomposites.展开更多
L10-FePt nan oparticles(NPs)with high chemical ordering represent effective electrocatalysts to reduce the cost and enhance theircatalytic performanee in fuel cells.A molecular strategy of preparing highly ordered FeP...L10-FePt nan oparticles(NPs)with high chemical ordering represent effective electrocatalysts to reduce the cost and enhance theircatalytic performanee in fuel cells.A molecular strategy of preparing highly ordered FePt NPs was used by direct pyrolysis of a Fe,Pt-containing bimetallic complex.The resultant L10-FePt NPs had very high crystallinity as reflected by the obvious diffractionpatterns,clear lattice fringes and characteristic X-ray diffraction peaks,etc.Besides,the strong ferromagnetism with room temperaturecoercivity of 27 kOe further confirmed the face-centered tetrag on al(fet)phase in good agreement with the ordered nano structures.TheFePt NPs can be used as electrocatalysts to catalyze oxygen reduction reaction(ORR)in an O2·saturated 0.1 M HClO4 solution andhydrogen evolution reaction(HER)in the 0.5 M H2SO4 electrolyte with much better performance than commercial Pt/C,and showedquite high stability after 10,000 cycles.The strategy utilizing orga no metallic precursors to prepare metal alloy NPs was dem on strated tobe a reliable approach for improving the catalytic efficiency in fuel cells.展开更多
Increasing demands for improvement in power quality and power capacity have contributed to development of switched-capacitor multilevel inverters(SCMLIs).Recently developed SCMLIs enable single-stage voltage boosting,...Increasing demands for improvement in power quality and power capacity have contributed to development of switched-capacitor multilevel inverters(SCMLIs).Recently developed SCMLIs enable single-stage voltage boosting,as well as inversion resulting in step-up ac output.Towards reduction in number of components,this paper introduces a boost type singlesource nine-level(9-level)SCMLI employing two capacitors and three diodes.Owing to the series-parallel connection process,capacitor voltages are inherently balanced and assist in quadruple voltage boosting from a single-source.Maximum voltage stress across semiconductor devices is limited to twice input voltage only.Using a minimum number of components,the proposed SCMLI can be extended to increase voltage levels without additional dc input.Each extension module adds two additional voltage steps in the output while maintaining maximum voltage stress the same as 9-level circuit.Followed by in-depth analysis of circuit operation and power losses,a thorough comparison of recently developed single-phase 9-level MLIs is carried out,which verifies design superiority.Extensive simulation and experimental results are presented to verify the prominent features of the 9-level SCMLI under dynamic operating conditions.展开更多
Patterning of L10 FePt nanoparticles(NPs) with high coercivity offers a promising route to develop bit-patterned media(BPM) for the next generation magnetic data recording system, but the synthesis of monodisperse FeP...Patterning of L10 FePt nanoparticles(NPs) with high coercivity offers a promising route to develop bit-patterned media(BPM) for the next generation magnetic data recording system, but the synthesis of monodisperse FePt NPs and mass production of their nanopatterns has been a longstanding challenge. Here, highly efficient nanoimprint lithography was applied for large-scale universal patterning, which was achieved by imprinting the solution of a single-source bimetallic precursor. The rigid coplanar metallic cores and the surrounding flexible tails in the bimetallic complex permit the spontaneous molecular arrangements to form the highly ordered negative morphology replicated from the soft template.In-situ pyrolysis study was then investigated by one-pot pyrolysis of the precursor under an Ar/H2 atmosphere, and the resultant NPs were fully characterized to identify the phase,morphology and magnetic properties. Finally, highly-ordered patterns on certain substrates were preserved perfectly after pyrolysis and could be potentially utilized in magnetic data recording media.展开更多
Abstract： The shortest path problem in a network G is to find shortest paths between some specified source vertices and terminal vertices when the lengths of edges are given. The structure of the optimal solutions se...Abstract： The shortest path problem in a network G is to find shortest paths between some specified source vertices and terminal vertices when the lengths of edges are given. The structure of the optimal solutions set on the shortest paths is studied in this paper. First, the conditions of having unique shortest path between two distinguished vertices 8 and t in a network G are discussed; Second, the structural properties of 2-transformation ^-G graph G on the shortest-paths for G are presented heavily.展开更多
To accelerate the scan speed and improve the image quality, a new type of CT configuration, "double-source double-multislice spiral CT" (DSDMS-CT), which is based on two sets of single-source multislice spir...To accelerate the scan speed and improve the image quality, a new type of CT configuration, "double-source double-multislice spiral CT" (DSDMS-CT), which is based on two sets of single-source multislice spiral CT was proposed with a special reconstruction algorithm. Simulation results using the fan-beam filtered backprojection algorithm with a special interpolation method were presented for both single-source multislice spiral CT and DSDMS-CT. The results of new CT model show that it scans faster than the traditional spiral CT and has a better slice sensitivity profile (SSP) with larger pitch value.展开更多
Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with s...Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.展开更多
It is now common practice to perform simultaneous traveltime inversion for the velocity field and the reflector geometry in reflection/refraction tomography, or the velocity field and the hypocenter locations in regio...It is now common practice to perform simultaneous traveltime inversion for the velocity field and the reflector geometry in reflection/refraction tomography, or the velocity field and the hypocenter locations in regional earthquake tomography, but seldom are all three classes of model parameters updated simultaneously. This is mainly due to the trade-off between the different types of model parameters and the lack of different seismic phases to constrain the model parameters. Using a spherical-coordinate ray tracing algorithm for first and later（primary reflected） arrival tracing algorithm in combination with a popular linearized inversion solver, it is possible to simultaneously recover the three classes of model parameters in regional or global tomographic studies. In this paper we incorporate the multistage irregular shortest-path ray tracing algorithm（in a spherical coordinate system） with a subspace inversion solver to formulate a simultaneous inversion algorithm for triple model parameters updating using direct and later arrival time information.Comparison tests for two sets of data（noise free and added noise） indicate that the new triple-class parameter inversion algorithm is capable of obtaining nearly the same results as the double-class parameter inversion scheme. Furthermore,the proposed multi-parameter type inversion method is not sensitive to a modest level of picking error in the traveltime data, and also performs well with a relatively large uncertainty in earthquake hypocentral locations. This shows it to be a feasible and promising approach in regional or global tomographic applications.展开更多
In the research of service composition,it demands efficient algorithms that not only retrieve correct service compositions automatically from thousands of services but also satisfy the quality requirements of differen...In the research of service composition,it demands efficient algorithms that not only retrieve correct service compositions automatically from thousands of services but also satisfy the quality requirements of different service users.However,most approaches treat these two aspects as two separate problems,automatic service composition and service selection.Although the latest researches realize the restriction of this separate view and some specific methods are proposed,they still suffer from serious limitations in scalability and accuracy when addressing both requirements simultaneously.In order to cope with these limitations and efficiently solve the combined problem which is known as QoS-aware or QoS-driven automatic service composition problem,we propose a new graph search problem,single-source optimal directed acyclic graphs （DAGs）,for the first time.This novel single-source optimal DAGs （SSOD） problem is similar to,but more general than the classical single-source shortest paths （SSSP） problem.In this paper,a new graph model of SSOD problem is proposed and a Sim-Dijkstra algorithm is presented to address the SSOD problem with the time complexity of O（n log n ＋ m） （n and m are the number of nodes and edges in the graph respectively）,and the proofs of its soundness.It is also directly applied to solve the QoS-aware automatic service composition problem,and a service composition tool named QSynth is implemented.Evaluations show that Sim-Dijkstra algorithm achieves superior scalability and efficiency with respect to a large variety of composition scenarios,even more efficient than our worklist algorithm that won the performance championship of Web Services Challenge 2009.展开更多
In the age of real-time online traffic information and GPS-enabled devices,fastest-path computations between two points in a road network modeled as a directed graph,where each directed edge is weighted by a“travel t...In the age of real-time online traffic information and GPS-enabled devices,fastest-path computations between two points in a road network modeled as a directed graph,where each directed edge is weighted by a“travel time”value,are becoming a standard feature of many navigation-related applications.To support this,very efficient computation of these paths in very large road networks is critical.Fastest paths may be computed as minimal-cost paths in a weighted directed graph,but traditional minimal-cost path algorithms based on variants of the classical Dijkstra algorithm do not scale well,as in the worst case they may traverse the entire graph.A common improvement,which can dramatically reduce the number of graph vertices traversed,is the A*algorithm,which requires a good heuristic lower bound on the minimal cost.We introduce a simple,but very effective,heuristic function based on a small number of values assigned to each graph vertex.The values are based on graph separators and are computed efficiently in a preprocessing stage.We present experimental results demonstrating that our heuristic provides estimates of the minimal cost superior to those of other heuristics.Our experiments show that when used in the A*algorithm,this heuristic can reduce the number of vertices traversed by an order of magnitude compared to other heuristics.展开更多
Based on observation of the growing mechanism in Twitter-like online social networks, an online social network （OSN） evolution model was proposed, a renewal mechanism for the old nodes and an accelerated growth mech...Based on observation of the growing mechanism in Twitter-like online social networks, an online social network （OSN） evolution model was proposed, a renewal mechanism for the old nodes and an accelerated growth mechanism was introduced for the new nodes, comparing with the native copying model. Topological characteristics of the generated networks, such as degree distribution, average shortest-path length and clustering coefficient, are analyzed and numerized. These properties are validated with some crawled datasets of real online social networks.展开更多
文摘Fe-N compounds with excellent electrocatalytic oxygen reduction activity are considered to be one of the most promising non-precious metal materials for fuel cells.Fe-N compounds with excellent electrocatalytic oxygen reduction activity are considered to be one of the most promising non-precious metal materials for fuel cells,which focuses on the Fe-N4 single-atom catalysts and the iron nitride materials(such as Fe2N and Fe3N).A hybridized catalyst having a hierarchical porous structure with regular macropores could enable the desired mass transfer efficiency in the catalytic process.In this study,we have constructed a new type of hybrid catalyst having iron and iron-nitrogen alloy nanoparticles(Fe-N austenite,termed as Fe-NA)embedded in the three-dimensional ordered macroporous N-doped carbon(3DOM Fe/Fe-NA@NC)by direct pyrolysis of single-source dicyandiamide-based iron metal-organic frameworks.The as-synthesized composites preserve the hierarchical porous carbon framework with ordered macropores and high specific surface area,incorporating the uniformly dispersed iron/iron-nitrogen austenite nanoparticles.Thereby,the striking architectural configuration embedded with highly active catalytic species delivers a superior oxygen reduction activity with a half-wave potential of 0.88 V and a subsequent superior Zn-air battery performance with high open-circuit voltage and continuous stability as compared to those using a commercial 20%Pt/C catalyst.
文摘This paper presents an efficient parallel algorithm for the shortest-path problem in interval graph for computing shortest-paths in a weighted interval graph that runs in O(n) time with n intervals in a graph. A linear processor CRCW algorithm for determining the shortest-paths in an interval graphs is given.
基金Supported by Shanghai Municipal Education Committee Educationand Scientific Research (Grant No. 07ZZ60)~~
文摘The present paper predicted the function of unknow genes by analyzing the co-expression data of Arabidopsis thaliana from biological pathway based on the shortest-path algorithm. This paper proposed that transitive co-expression among genes can be used as an important attribute to link genes of the same biological pathway. The genes from the same biological pathway with similar functions are strongly correlated in expression. Moreover,the function of unknown genes can be predicted by the known genes where they are strongly correlated in expression lying on the same shortest-path from the biological pathway. Analyzing the Arabidopsis thaliana from the biological pathway,this study showed that this method can reliably reveal function of the unknown Arabidopsis thaliana genes and the approach of predicting gene function by transitiving co-expression in shortest-path is feasible and effective.
基金This work was supported in part by the National Natural Science Foundation of China(61471101)the National Natural Science Foundation of China(U1736205).
文摘Fast identifying the amount of information that can be gained by measuring a network via shortest-paths is one of the fundamental problem for networks exploration and monitoring.However,the existing methods are time-consuming for even moderate-scale networks.In this paper,we present a method for fast shortest-path cover identification in both exact and approximate scenarios based on the relationship between the identification and the shortest distance queries.The effectiveness of the proposed method is validated through synthetic and real-world networks.The experimental results show that our method is 105 times faster than the existing methods and can solve the shortest-path cover identification in a few seconds for large-scale networks with millions of nodes and edges.
基金Supported bythe National Tenth Five-Year PlanforScientific and Technological Development of China (2001BA102A06-11)
文摘Effective link analysis techniques are needed to help law enforcement and intelligence agencies fight money laundering. This paper presents a link analysis technique that uses a modified shortest-path algorithms to identify the strongest association paths between entities in a money laundering network. Based on two-tree Dijkstra and Priority＇First-Search （PFS） algorithm, a modified algorithm is presented. To apply the algorithm, a network representation transformation is made first.
基金National Natural Science Foundation of China (No. 51872246)Alexander von Humboldt Foundation, and Creative Research Foundation of Science and Technology on Thermo Structural Composite Materials Laboratory (No. 6142911040114) for financial supportthe National Key R&D Program of China (No. 2017YFB0703200)
文摘For the first time, ZrC-ZrB_2-SiC ceramic nanocomposites were successfully prepared by a single-source-precursor route, with allylhydridopolycarbosilane(AHPCS),triethylamine borane(TEAB),and bis(cyclopentadienyl) zirconium dichloride(Cp_2 ZrCl_2) as starting materials. The polymer-to-ceramic transformation and thermal behavior of obtained single-source precursor were characterized by means of Fourier transform infrared spectroscopy(FT-IR) and thermal gravimetric analysis(TGA). The results show that the precursor possesses a high ceramic yield about 85% at 1000 ℃.The phase composition and microstructure of formed ZrC-ZrB_2-SiC ceramics were investigated by means of X-ray diffraction(XRD) and high resolution transmission electron microscopy(HRTEM).Meanwhile, the weight loss and chemical composition of the resultant ZrC-ZrB_2-SiC nanocomposites were investigated after annealing at high temperature up to 1800 ℃. High temperature behavior with respect to decomposition as well as crystallization shows a promising high temperature stability of the formed ZrC-ZrB_2-SiC nanocomposites.
基金This work was supported by the National Natural Science Foundation of China(No.21701112)Science,Technology and Innovation Committee of Shenzhen Municipality(No.JCYJ20170303160036674)+2 种基金Hong Kong Research Grants Council(PolyU153062/18R C4006-17G and HKUST16304117)the Hong Kong Polytechnic University(1-ZE1C)Ms Clarea Au(847S)for the Endowed Professorship in Energy.Special thanks were also given to Instrumental Analysis Center of Shenzhen University(Xili Campus).
文摘L10-FePt nan oparticles(NPs)with high chemical ordering represent effective electrocatalysts to reduce the cost and enhance theircatalytic performanee in fuel cells.A molecular strategy of preparing highly ordered FePt NPs was used by direct pyrolysis of a Fe,Pt-containing bimetallic complex.The resultant L10-FePt NPs had very high crystallinity as reflected by the obvious diffractionpatterns,clear lattice fringes and characteristic X-ray diffraction peaks,etc.Besides,the strong ferromagnetism with room temperaturecoercivity of 27 kOe further confirmed the face-centered tetrag on al(fet)phase in good agreement with the ordered nano structures.TheFePt NPs can be used as electrocatalysts to catalyze oxygen reduction reaction(ORR)in an O2·saturated 0.1 M HClO4 solution andhydrogen evolution reaction(HER)in the 0.5 M H2SO4 electrolyte with much better performance than commercial Pt/C,and showedquite high stability after 10,000 cycles.The strategy utilizing orga no metallic precursors to prepare metal alloy NPs was dem on strated tobe a reliable approach for improving the catalytic efficiency in fuel cells.
文摘Increasing demands for improvement in power quality and power capacity have contributed to development of switched-capacitor multilevel inverters(SCMLIs).Recently developed SCMLIs enable single-stage voltage boosting,as well as inversion resulting in step-up ac output.Towards reduction in number of components,this paper introduces a boost type singlesource nine-level(9-level)SCMLI employing two capacitors and three diodes.Owing to the series-parallel connection process,capacitor voltages are inherently balanced and assist in quadruple voltage boosting from a single-source.Maximum voltage stress across semiconductor devices is limited to twice input voltage only.Using a minimum number of components,the proposed SCMLI can be extended to increase voltage levels without additional dc input.Each extension module adds two additional voltage steps in the output while maintaining maximum voltage stress the same as 9-level circuit.Followed by in-depth analysis of circuit operation and power losses,a thorough comparison of recently developed single-phase 9-level MLIs is carried out,which verifies design superiority.Extensive simulation and experimental results are presented to verify the prominent features of the 9-level SCMLI under dynamic operating conditions.
基金supported by the National Natural Science Foundation of China (21701112, 21504074 and 51573151)Hong Kong Research Grants Council (HKBU12317216, Poly U153062/18P and Poly U153015/14P)+2 种基金Areas of Excellence Scheme, University Grants Committee of HKSAR (Ao E/P-03/08)the Hong Kong Polytechnic University (1-ZE1C and 1-ZE25)the Science, Technology and Innovation Committee of Shenzhen Municipality (JCYJ20160531193836532)
文摘Patterning of L10 FePt nanoparticles(NPs) with high coercivity offers a promising route to develop bit-patterned media(BPM) for the next generation magnetic data recording system, but the synthesis of monodisperse FePt NPs and mass production of their nanopatterns has been a longstanding challenge. Here, highly efficient nanoimprint lithography was applied for large-scale universal patterning, which was achieved by imprinting the solution of a single-source bimetallic precursor. The rigid coplanar metallic cores and the surrounding flexible tails in the bimetallic complex permit the spontaneous molecular arrangements to form the highly ordered negative morphology replicated from the soft template.In-situ pyrolysis study was then investigated by one-pot pyrolysis of the precursor under an Ar/H2 atmosphere, and the resultant NPs were fully characterized to identify the phase,morphology and magnetic properties. Finally, highly-ordered patterns on certain substrates were preserved perfectly after pyrolysis and could be potentially utilized in magnetic data recording media.
文摘Abstract： The shortest path problem in a network G is to find shortest paths between some specified source vertices and terminal vertices when the lengths of edges are given. The structure of the optimal solutions set on the shortest paths is studied in this paper. First, the conditions of having unique shortest path between two distinguished vertices 8 and t in a network G are discussed; Second, the structural properties of 2-transformation ^-G graph G on the shortest-paths for G are presented heavily.
基金The National Natural Science Foundation ofChina (No30570511)
文摘To accelerate the scan speed and improve the image quality, a new type of CT configuration, "double-source double-multislice spiral CT" (DSDMS-CT), which is based on two sets of single-source multislice spiral CT was proposed with a special reconstruction algorithm. Simulation results using the fan-beam filtered backprojection algorithm with a special interpolation method were presented for both single-source multislice spiral CT and DSDMS-CT. The results of new CT model show that it scans faster than the traditional spiral CT and has a better slice sensitivity profile (SSP) with larger pitch value.
基金This work was supported by the Serbian Ministry of Science and Education(project TR-32022)by companies Telekom Srbija and Informatika.
文摘Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.
基金partially supported by the Doctoral Programming Research Fund of Higher Education, Chinese Ministry of Education (No. 20110205110010)
文摘It is now common practice to perform simultaneous traveltime inversion for the velocity field and the reflector geometry in reflection/refraction tomography, or the velocity field and the hypocenter locations in regional earthquake tomography, but seldom are all three classes of model parameters updated simultaneously. This is mainly due to the trade-off between the different types of model parameters and the lack of different seismic phases to constrain the model parameters. Using a spherical-coordinate ray tracing algorithm for first and later（primary reflected） arrival tracing algorithm in combination with a popular linearized inversion solver, it is possible to simultaneously recover the three classes of model parameters in regional or global tomographic studies. In this paper we incorporate the multistage irregular shortest-path ray tracing algorithm（in a spherical coordinate system） with a subspace inversion solver to formulate a simultaneous inversion algorithm for triple model parameters updating using direct and later arrival time information.Comparison tests for two sets of data（noise free and added noise） indicate that the new triple-class parameter inversion algorithm is capable of obtaining nearly the same results as the double-class parameter inversion scheme. Furthermore,the proposed multi-parameter type inversion method is not sensitive to a modest level of picking error in the traveltime data, and also performs well with a relatively large uncertainty in earthquake hypocentral locations. This shows it to be a feasible and promising approach in regional or global tomographic applications.
基金Supported by the National Basic Research 973 Program of China under Grant No.2007CB-310805the National Natural Science Foundation of China under Grant No.61070027+2 种基金the Beijing Natural Science Foundation project under Grant No.4092043the Scienceand Technology Project of State Grid Information&Telecommunication Company Ltd.under Grant No.SGIT[2010]449the Planned Science and Technology Project of Guangdong Province,China under Grant No.2010B050100009
文摘In the research of service composition,it demands efficient algorithms that not only retrieve correct service compositions automatically from thousands of services but also satisfy the quality requirements of different service users.However,most approaches treat these two aspects as two separate problems,automatic service composition and service selection.Although the latest researches realize the restriction of this separate view and some specific methods are proposed,they still suffer from serious limitations in scalability and accuracy when addressing both requirements simultaneously.In order to cope with these limitations and efficiently solve the combined problem which is known as QoS-aware or QoS-driven automatic service composition problem,we propose a new graph search problem,single-source optimal directed acyclic graphs （DAGs）,for the first time.This novel single-source optimal DAGs （SSOD） problem is similar to,but more general than the classical single-source shortest paths （SSSP） problem.In this paper,a new graph model of SSOD problem is proposed and a Sim-Dijkstra algorithm is presented to address the SSOD problem with the time complexity of O（n log n ＋ m） （n and m are the number of nodes and edges in the graph respectively）,and the proofs of its soundness.It is also directly applied to solve the QoS-aware automatic service composition problem,and a service composition tool named QSynth is implemented.Evaluations show that Sim-Dijkstra algorithm achieves superior scalability and efficiency with respect to a large variety of composition scenarios,even more efficient than our worklist algorithm that won the performance championship of Web Services Challenge 2009.
基金supported by the Anhui Provincial Natural Science Foundation(2008085MF195)the National Natural Science Foundation of China(62072422)Zhejiang Lab(2019NB0AB03).
文摘In the age of real-time online traffic information and GPS-enabled devices,fastest-path computations between two points in a road network modeled as a directed graph,where each directed edge is weighted by a“travel time”value,are becoming a standard feature of many navigation-related applications.To support this,very efficient computation of these paths in very large road networks is critical.Fastest paths may be computed as minimal-cost paths in a weighted directed graph,but traditional minimal-cost path algorithms based on variants of the classical Dijkstra algorithm do not scale well,as in the worst case they may traverse the entire graph.A common improvement,which can dramatically reduce the number of graph vertices traversed,is the A*algorithm,which requires a good heuristic lower bound on the minimal cost.We introduce a simple,but very effective,heuristic function based on a small number of values assigned to each graph vertex.The values are based on graph separators and are computed efficiently in a preprocessing stage.We present experimental results demonstrating that our heuristic provides estimates of the minimal cost superior to those of other heuristics.Our experiments show that when used in the A*algorithm,this heuristic can reduce the number of vertices traversed by an order of magnitude compared to other heuristics.
基金supported by the National Natural Science Foundation of China (61271199)
文摘Based on observation of the growing mechanism in Twitter-like online social networks, an online social network （OSN） evolution model was proposed, a renewal mechanism for the old nodes and an accelerated growth mechanism was introduced for the new nodes, comparing with the native copying model. Topological characteristics of the generated networks, such as degree distribution, average shortest-path length and clustering coefficient, are analyzed and numerized. These properties are validated with some crawled datasets of real online social networks.
