This study tested an improved fiber tracking algorithm, which was based on fiber assignment using a continuous tracking algorithm and a two-tensor model. Different models and tracking decisions were used by judging th...This study tested an improved fiber tracking algorithm, which was based on fiber assignment using a continuous tracking algorithm and a two-tensor model. Different models and tracking decisions were used by judging the type of estimation of each voxel. Thismethod should solve the cross-track problem. This study included eight healthy subjects, two axonal injury patients and seven demyelinating disease patients. This new algorithm clearly exhibited a difference in nerve fiber direction between axonal injury and demyelinating disease patients and healthy control subjects. Compared with fiber assignment with a continuous tracking algorithm, our novel method can track more and longer nerve fibers, and also can solve the fiber crossing problem.展开更多
Considering the problem of multiple ballistic missiles tracking of boost-phase ballistic missile defense, a boost-phase tracking algorithm based on multiple hypotheses tracking (MHT) concept is proposed. This paper ...Considering the problem of multiple ballistic missiles tracking of boost-phase ballistic missile defense, a boost-phase tracking algorithm based on multiple hypotheses tracking (MHT) concept is proposed. This paper focuses on the tracking algo- rithm for hypothesis generation, hypothesis probability calculation, hypotheses reduction and pruning and other sectors. From an engineering point of view, a technique called the linear assignment problem (LAP) used in the implementation of M-best feasible hypotheses generation, the number of the hypotheses is relatively small compared with the total number that may exist in each scan, also the N-scan back pruning is used, the algorithm's efficiency and practicality have been improved. Monte Carlo simulation results show that the proposed algorithm can track the boost phase of multiple ballistic missiles and it has a good tracking performance compared with joint probability data association (JPDA).展开更多
Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algo...Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.展开更多
基金supported by Xiamen Technology Projects Grand (The study of chronic cerebrovascular insufficiently in Magnetic Resonance Imaging), No.3502Z20084028
文摘This study tested an improved fiber tracking algorithm, which was based on fiber assignment using a continuous tracking algorithm and a two-tensor model. Different models and tracking decisions were used by judging the type of estimation of each voxel. Thismethod should solve the cross-track problem. This study included eight healthy subjects, two axonal injury patients and seven demyelinating disease patients. This new algorithm clearly exhibited a difference in nerve fiber direction between axonal injury and demyelinating disease patients and healthy control subjects. Compared with fiber assignment with a continuous tracking algorithm, our novel method can track more and longer nerve fibers, and also can solve the fiber crossing problem.
文摘Considering the problem of multiple ballistic missiles tracking of boost-phase ballistic missile defense, a boost-phase tracking algorithm based on multiple hypotheses tracking (MHT) concept is proposed. This paper focuses on the tracking algo- rithm for hypothesis generation, hypothesis probability calculation, hypotheses reduction and pruning and other sectors. From an engineering point of view, a technique called the linear assignment problem (LAP) used in the implementation of M-best feasible hypotheses generation, the number of the hypotheses is relatively small compared with the total number that may exist in each scan, also the N-scan back pruning is used, the algorithm's efficiency and practicality have been improved. Monte Carlo simulation results show that the proposed algorithm can track the boost phase of multiple ballistic missiles and it has a good tracking performance compared with joint probability data association (JPDA).
文摘Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.