Conventional empirical equations for estimating undrained shear strength(s_(u))from piezocone penetration test(CPTu)data,without incorporating soil physical properties,often lack the accuracy and robustness required f...Conventional empirical equations for estimating undrained shear strength(s_(u))from piezocone penetration test(CPTu)data,without incorporating soil physical properties,often lack the accuracy and robustness required for geotechnical site investigations.This study introduces a hybrid virus colony search(VCS)algorithm that integrates the standard VCS algorithm with a mutation-based search mechanism to develop high-performance XGBoost learning models to address this limitation.A dataset of 372 seismic CPTu and corresponding soil physical properties data from 26 geotechnical projects in Jiangs_(u)Province,China,was collected for model development.Comparative evaluations demonstrate that the proposed hybrid VCS-XGBoost model exhibits s_(u)perior performance compared to standard meta-heuristic algorithm-based XGBoost models.The res_(u)lts highlight that the consideration of soil physical properties significantly improves the predictive accuracy of s_(u),emphasizing the importance of considering additional soil information beyond CPTu data for accurate s_(u)estimation.展开更多
To improve the performance of Saitou and Nei＇s algorithm （SN） and Studier and Keppler＇s improved algorithm （SK） for constructing neighbor-joining phylogenetic trees and reduce the time complexity of the computat...To improve the performance of Saitou and Nei＇s algorithm （SN） and Studier and Keppler＇s improved algorithm （SK） for constructing neighbor-joining phylogenetic trees and reduce the time complexity of the computation, a fast algorithm is proposed. The proposed algorithm includes three techniques. First, a linear array A[N] is introduced to store the sum of every row of the distance matrix （the same as SK）, which can eliminate many repeated computations. Secondly, the value of A [i] is computed only once at the beginning of the algorithm, and is updated by three elements in the iteration. Thirdly, a very compact formula for the sum of all the branch lengths of operational taxonomic units （OTUs） i and j is designed, and the correctness of the formula is proved. The experimental results show that the proposed algorithm is from tens to hundreds times faster than SN and roughly two times faster than SK when N increases, constructing a tree with 2 000 OTUs in 3 min on a current desktop computer. To earn the time with the cost of the space and reduce the computations in the innermost loop are the basic solutions for algorithms with many loops.展开更多
Content validity is an important part of language testing.In this paper,the content validity of the CET-4 fast reading test is analyzed in terms of expected response and text input.The result of final research shows t...Content validity is an important part of language testing.In this paper,the content validity of the CET-4 fast reading test is analyzed in terms of expected response and text input.The result of final research shows that the content validity of the fast reading test is high with some limitations proposed.展开更多
The method of establishing data structures plays an important role in the efficiency of parallel multilevel fast multipole algorithm（PMLFMA）.Considering the main complements of multilevel fast multipole algorithm（M...The method of establishing data structures plays an important role in the efficiency of parallel multilevel fast multipole algorithm（PMLFMA）.Considering the main complements of multilevel fast multipole algorithm（MLFMA） memory,a new parallelization strategy and a modified data octree construction scheme are proposed to further reduce communication in order to improve parallel efficiency.For far interaction,a new scheme called dynamic memory allocation is developed.To analyze the workload balancing performance of a parallel implementation,the original concept of workload balancing factor is introduced and verified by numerical examples.Numerical results show that the above measures improve the parallel efficiency and are suitable for the analysis of electrical large-scale scattering objects.展开更多
Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm,on ...Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved Dijkstra algorithm is got.Then apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.展开更多
Recently, a two-dimensional （2-D） Tsallis entropy thresholding method has been proposed as a new method for image segmentation. But the computation complexity of 2-D Tsallis entropy is very large and becomes an obst...Recently, a two-dimensional （2-D） Tsallis entropy thresholding method has been proposed as a new method for image segmentation. But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle to real time image processing systems. A fast recursive algorithm for 2-D Tsallis entropy thresholding is proposed. The key variables involved in calculating 2-D Tsallis entropy are written in recursive form. Thus, many repeating calculations are avoided and the computation complexity reduces to O（L2） from O（L4）. The effectiveness of the proposed algorithm is illustrated by experimental results.展开更多
Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the de...Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures.展开更多
A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm （FE-BI-MLFMA）. Among many algorithms of FE-BI-M...A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm （FE-BI-MLFMA）. Among many algorithms of FE-BI-MLFMA, the decomposition algorithm （DA） is chosen as a basis for the parallelization of FE-BI-MLFMA because of its distinct numerical characteristics suitable for parallelization. On the basis of the DA, the parallelization of FE-BI-MLFMA is carried out by employing the parallelized multi-frontal method for the matrix from the finiteelement method and the parallelized MLFMA for the matrix from the boundary integral method respectively. The programming and numerical experiments of the proposed parallel approach are carried out in the high perfor- mance computing platform CEMS-Liuhui. Numerical experiments demonstrate that FE-BI-MLFMA is efficiently parallelized and its computational capacity is greatly improved without losing accuracy, efficiency, and generality.展开更多
A fast algorithm is proposed to predict penetration trajectory in simulation of normal and oblique penetration of a rigid steel projectile into a limestone target. The algorithm is designed based on the idea of isolat...A fast algorithm is proposed to predict penetration trajectory in simulation of normal and oblique penetration of a rigid steel projectile into a limestone target. The algorithm is designed based on the idea of isolation between the projectile and the target. Corresponding factors of influence are considered, including analytical load model, cratering effect, free surface effect, and separation-reattachment phenomenon. Besides, a method of cavity ring is used to study the process of cavity expansion. Further, description of the projectile＇s three-dimensional gesture is coded for fast calculation, named PENE3D. A presented. As a result, the algorithm is series of cases with selected normal and oblique penetrations are simulated by the algorithm. The predictions agree with the results of tests, showing that the proposed algorithm is fast and effective in simulation of the penetration process and prediction of the penetration trajectory.展开更多
Clustering filtering is usually a practical method for light detection and ranging(LiDAR)point clouds filtering according to their characteristic attributes.However,the amount of point cloud data is extremely large in...Clustering filtering is usually a practical method for light detection and ranging(LiDAR)point clouds filtering according to their characteristic attributes.However,the amount of point cloud data is extremely large in practice,making it impossible to cluster point clouds data directly,and the filtering error is also too large.Moreover,many existing filtering algorithms have poor classification results in discontinuous terrain.This article proposes a new fast classification filtering algorithm based on density clustering,which can solve the problem of point clouds classification in discontinuous terrain.Based on the spatial density of LiDAR point clouds,also the features of the ground object point clouds and the terrain point clouds,the point clouds are clustered firstly by their elevations,and then the plane point clouds are selected.Thus the number of samples and feature dimensions of data are reduced.Using the DBSCAN clustering filtering method,the original point clouds are finally divided into noise point clouds,ground object point clouds,and terrain point clouds.The experiment uses 15 sets of data samples provided by the International Society for Photogrammetry and Remote Sensing(ISPRS),and the results of the proposed algorithm are compared with the other eight classical filtering algorithms.Quantitative and qualitative analysis shows that the proposed algorithm has good applicability in urban areas and rural areas,and is significantly better than other classic filtering algorithms in discontinuous terrain,with a total error of about 10%.The results show that the proposed method is feasible and can be used in different terrains.展开更多
To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit t...To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit to circuit. In this paper, the genetic algorithms are used to construct the models of existing test generation algorithms in making such choice more easily. Therefore, we may forecast the testability parameters of a circuit before using the real test generation algorithm. The results also can be used to evaluate the efficiency of the existing test generation algorithms. Experimental results are given to convince the readers of the truth and the usefulness of this approach.展开更多
To study the diagnostic problem of Wire-OR （W-O） interconnect fault of PCB （Printed Circuit Board）, five modified boundary scan adaptive algorithms for interconnect test are put forward. These algorithms apply Glo...To study the diagnostic problem of Wire-OR （W-O） interconnect fault of PCB （Printed Circuit Board）, five modified boundary scan adaptive algorithms for interconnect test are put forward. These algorithms apply Global-diagnosis sequence algorithm to replace the equal weight algorithm of primary test, and the test time is shortened without changing the fault diagnostic capability. The descriptions of five modified adaptive test algorithms are presented, and the capability comparison between the modified algorithm and the original algorithm is made to prove the validity of these algorithms.展开更多
A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the seg...A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.展开更多
In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then use...In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.展开更多
Software testing has been attracting a lot of attention for effective software development.In model driven approach,Unified Modelling Language(UML)is a conceptual modelling approach for obligations and other features ...Software testing has been attracting a lot of attention for effective software development.In model driven approach,Unified Modelling Language(UML)is a conceptual modelling approach for obligations and other features of the system in a model-driven methodology.Specialized tools interpret these models into other software artifacts such as code,test data and documentation.The generation of test cases permits the appropriate test data to be determined that have the aptitude to ascertain the requirements.This paper focuses on optimizing the test data obtained from UML activity and state chart diagrams by using Basic Genetic Algorithm(BGA).For generating the test cases,both diagrams were converted into their corresponding intermediate graphical forms namely,Activity Diagram Graph(ADG)and State Chart Diagram Graph(SCDG).Then both graphs will be combined to form a single graph called,Activity State Chart Diagram Graph(ASCDG).Both graphs were then joined to create a single graph known as the Activity State Chart Diagram Graph(ASCDG).Next,the ASCDG will be optimized using BGA to generate the test data.A case study involving a withdrawal from the automated teller machine(ATM)of a bank was employed to demonstrate the approach.The approach successfully identified defects in various ATM functions such as messaging and operation.展开更多
The main objective of software testing is to have the highest likelihood of finding the most faults with a minimum amount of time and effort. Genetic Algorithm (GA) has been successfully used by researchers in softwar...The main objective of software testing is to have the highest likelihood of finding the most faults with a minimum amount of time and effort. Genetic Algorithm (GA) has been successfully used by researchers in software testing to automatically generate test data. In this paper, a GA is applied using branch coverage criterion to generate the least possible set of test data to test JSC applications. Results show that applying GA achieves better performance in terms of average number of test data?generations, execution time, and percentage of branch coverage.展开更多
An acoustic vector sensor(AVS)can capture more information than a conventional acoustic pressure sensor(APS).As a result,more output channels are required when multiple AVS are formed into arrays,making processing the...An acoustic vector sensor(AVS)can capture more information than a conventional acoustic pressure sensor(APS).As a result,more output channels are required when multiple AVS are formed into arrays,making processing the data stream computationally intense.This paper proposes a new algorithm based on the propagator method for wideband coherent sources that eliminates eigen-decomposition in order to reduce the computational burden.Data from simulations and lake trials showed that the new algorithm is valid:it resolves coherent sources,breaks left/right ambiguity,and allows inter element spacing to exceed a half-wavelength.展开更多
An accurate period is important to recover the pulse profile from a recorded photon event series of an X-ray pulsar and to estimate the pulse time of arrival,which is the measurement of X-ray pulsar navigation.Epoch f...An accurate period is important to recover the pulse profile from a recorded photon event series of an X-ray pulsar and to estimate the pulse time of arrival,which is the measurement of X-ray pulsar navigation.Epoch folding is a classical period estimation method in the time domain;however,its computational complexity grows as the number of trail periods increases.In order to reduce the computational complexity,this paper improves the fast folding algorithm through segment correlation and amplitude accumulation,which is based on the post-order traversal of a binary tree.Compared with epoch folding,the improved fast folding algorithm can achieve a similar accuracy at the cost of a lower computational burden.Compared with the original fast folding algorithm,the improved algorithm can be applied to detectors with a much smaller effective area.The performance of the method is investigated by simulation data and observation data from the Neutron star Interior Composition Explorer(NICER).展开更多
Given the problem of the long time required for testing gas pressure, we propose a fast-test method in which we used a technique of fast borehole sealing and air replenishing. Based on the characteristics of gas emiss...Given the problem of the long time required for testing gas pressure, we propose a fast-test method in which we used a technique of fast borehole sealing and air replenishing. Based on the characteristics of gas emission from boreholes to be tested, we built a theoretical model for calculating parameters during the process of increasing natural pressure and aeration. Using this model, we investigated the effect of different aeration conditions on velocity of pressure tests. The result shows that: 1) aerating air into boreholes can speed up gas pressure tests and 2) the more similar the pressure of the aerated air to the original gas pressure, the smaller the gas volume absorbed by coal and the shorter the time needed in pressure test. A case study in the Lu’an mining area shows that the time needed for gas pressure test is only 4 h using our method of aeration and 29 h under conditions of increasing natural pressure, saving time by 86.2%. This case study also indicates that, by using the aeration method, only one hour is needed for gas pressure to reach a stable state, which breaks the record of the shortest time needed for gas pressure tests in China.展开更多
基金funded by the National Science Fund for Distinguished Young Scholars(Grant No.42225206)the National Key R&D Program of China(Grant No.2020YFC1807200)the National Natural Science Foundation of China(Grant No.42072299).
文摘Conventional empirical equations for estimating undrained shear strength(s_(u))from piezocone penetration test(CPTu)data,without incorporating soil physical properties,often lack the accuracy and robustness required for geotechnical site investigations.This study introduces a hybrid virus colony search(VCS)algorithm that integrates the standard VCS algorithm with a mutation-based search mechanism to develop high-performance XGBoost learning models to address this limitation.A dataset of 372 seismic CPTu and corresponding soil physical properties data from 26 geotechnical projects in Jiangs_(u)Province,China,was collected for model development.Comparative evaluations demonstrate that the proposed hybrid VCS-XGBoost model exhibits s_(u)perior performance compared to standard meta-heuristic algorithm-based XGBoost models.The res_(u)lts highlight that the consideration of soil physical properties significantly improves the predictive accuracy of s_(u),emphasizing the importance of considering additional soil information beyond CPTu data for accurate s_(u)estimation.
文摘To improve the performance of Saitou and Nei＇s algorithm （SN） and Studier and Keppler＇s improved algorithm （SK） for constructing neighbor-joining phylogenetic trees and reduce the time complexity of the computation, a fast algorithm is proposed. The proposed algorithm includes three techniques. First, a linear array A[N] is introduced to store the sum of every row of the distance matrix （the same as SK）, which can eliminate many repeated computations. Secondly, the value of A [i] is computed only once at the beginning of the algorithm, and is updated by three elements in the iteration. Thirdly, a very compact formula for the sum of all the branch lengths of operational taxonomic units （OTUs） i and j is designed, and the correctness of the formula is proved. The experimental results show that the proposed algorithm is from tens to hundreds times faster than SN and roughly two times faster than SK when N increases, constructing a tree with 2 000 OTUs in 3 min on a current desktop computer. To earn the time with the cost of the space and reduce the computations in the innermost loop are the basic solutions for algorithms with many loops.
文摘Content validity is an important part of language testing.In this paper,the content validity of the CET-4 fast reading test is analyzed in terms of expected response and text input.The result of final research shows that the content validity of the fast reading test is high with some limitations proposed.
基金supported by the National Basic Research Program of China (973 Program) (61320)
文摘The method of establishing data structures plays an important role in the efficiency of parallel multilevel fast multipole algorithm（PMLFMA）.Considering the main complements of multilevel fast multipole algorithm（MLFMA） memory,a new parallelization strategy and a modified data octree construction scheme are proposed to further reduce communication in order to improve parallel efficiency.For far interaction,a new scheme called dynamic memory allocation is developed.To analyze the workload balancing performance of a parallel implementation,the original concept of workload balancing factor is introduced and verified by numerical examples.Numerical results show that the above measures improve the parallel efficiency and are suitable for the analysis of electrical large-scale scattering objects.
基金supported by the "Taishan Scholarship" Construction Engineering and Shandong Province Graduate Innovative Project(SDYC08011).
文摘Dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional Dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved Dijkstra algorithm is got.Then apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.
基金supported by the National Natural Science Foundation of China for Distinguished Young Scholars(60525303)Doctoral Foundation of Yanshan University(B243).
文摘Recently, a two-dimensional （2-D） Tsallis entropy thresholding method has been proposed as a new method for image segmentation. But the computation complexity of 2-D Tsallis entropy is very large and becomes an obstacle to real time image processing systems. A fast recursive algorithm for 2-D Tsallis entropy thresholding is proposed. The key variables involved in calculating 2-D Tsallis entropy are written in recursive form. Thus, many repeating calculations are avoided and the computation complexity reduces to O（L2） from O（L4）. The effectiveness of the proposed algorithm is illustrated by experimental results.
基金supported by the National Natural Science Foundation of China(50975121)the Project 2009-2007 of the Graduate Innovation Fund of Jilin University
文摘Although the genetic algorithm （GA） for structural optimization is very robust, it is very computationally intensive and hence slower than optimality criteria and mathematical programming methods. To speed up the design process, the authors present an adaptive reanalysis method for GA and its applications in the optimal design of trusses. This reanalysis technique is primarily derived from the Kirsch＇s combined approximations method. An iteration scheme is adopted to adaptively determine the number of basis vectors at every generation. In order to illustrate this method, three classical examples of optimal truss design are used to validate the proposed reanalysis-based design procedure. The presented numerical results demonstrate that the adaptive reanalysis technique affects very slightly the accuracy of the optimal solutions and does accelerate the design process, especially for large-scale structures.
文摘A general and efficient parallel approach is proposed for the first time to parallelize the hybrid finiteelement-boundary-integral-multi-level fast multipole algorithm （FE-BI-MLFMA）. Among many algorithms of FE-BI-MLFMA, the decomposition algorithm （DA） is chosen as a basis for the parallelization of FE-BI-MLFMA because of its distinct numerical characteristics suitable for parallelization. On the basis of the DA, the parallelization of FE-BI-MLFMA is carried out by employing the parallelized multi-frontal method for the matrix from the finiteelement method and the parallelized MLFMA for the matrix from the boundary integral method respectively. The programming and numerical experiments of the proposed parallel approach are carried out in the high perfor- mance computing platform CEMS-Liuhui. Numerical experiments demonstrate that FE-BI-MLFMA is efficiently parallelized and its computational capacity is greatly improved without losing accuracy, efficiency, and generality.
基金Project supported by the National Natural Science Foundation of China(No.11202236)
文摘A fast algorithm is proposed to predict penetration trajectory in simulation of normal and oblique penetration of a rigid steel projectile into a limestone target. The algorithm is designed based on the idea of isolation between the projectile and the target. Corresponding factors of influence are considered, including analytical load model, cratering effect, free surface effect, and separation-reattachment phenomenon. Besides, a method of cavity ring is used to study the process of cavity expansion. Further, description of the projectile＇s three-dimensional gesture is coded for fast calculation, named PENE3D. A presented. As a result, the algorithm is series of cases with selected normal and oblique penetrations are simulated by the algorithm. The predictions agree with the results of tests, showing that the proposed algorithm is fast and effective in simulation of the penetration process and prediction of the penetration trajectory.
基金The Natural Science Foundation of Hunan Province,China(No.2020JJ4601)Open Fund of the Key Laboratory of Highway Engi-neering of Ministry of Education(No.kfj190203).
文摘Clustering filtering is usually a practical method for light detection and ranging(LiDAR)point clouds filtering according to their characteristic attributes.However,the amount of point cloud data is extremely large in practice,making it impossible to cluster point clouds data directly,and the filtering error is also too large.Moreover,many existing filtering algorithms have poor classification results in discontinuous terrain.This article proposes a new fast classification filtering algorithm based on density clustering,which can solve the problem of point clouds classification in discontinuous terrain.Based on the spatial density of LiDAR point clouds,also the features of the ground object point clouds and the terrain point clouds,the point clouds are clustered firstly by their elevations,and then the plane point clouds are selected.Thus the number of samples and feature dimensions of data are reduced.Using the DBSCAN clustering filtering method,the original point clouds are finally divided into noise point clouds,ground object point clouds,and terrain point clouds.The experiment uses 15 sets of data samples provided by the International Society for Photogrammetry and Remote Sensing(ISPRS),and the results of the proposed algorithm are compared with the other eight classical filtering algorithms.Quantitative and qualitative analysis shows that the proposed algorithm has good applicability in urban areas and rural areas,and is significantly better than other classic filtering algorithms in discontinuous terrain,with a total error of about 10%.The results show that the proposed method is feasible and can be used in different terrains.
基金This work was supported by National Natural Science Foundation of China (NSFC) under the grant !No. 69873030
文摘To generate a test set for a given circuit (including both combinational and sequential circuits), choice of an algorithm within a number of existing test generation algorithms to apply is bound to vary from circuit to circuit. In this paper, the genetic algorithms are used to construct the models of existing test generation algorithms in making such choice more easily. Therefore, we may forecast the testability parameters of a circuit before using the real test generation algorithm. The results also can be used to evaluate the efficiency of the existing test generation algorithms. Experimental results are given to convince the readers of the truth and the usefulness of this approach.
文摘To study the diagnostic problem of Wire-OR （W-O） interconnect fault of PCB （Printed Circuit Board）, five modified boundary scan adaptive algorithms for interconnect test are put forward. These algorithms apply Global-diagnosis sequence algorithm to replace the equal weight algorithm of primary test, and the test time is shortened without changing the fault diagnostic capability. The descriptions of five modified adaptive test algorithms are presented, and the capability comparison between the modified algorithm and the original algorithm is made to prove the validity of these algorithms.
文摘A fast interactive segmentation algorithm of image-sequences based on relative fuzzy connectedness is presented. In comparison with the original algorithm, the proposed one, with the same accuracy, accelerates the segmentation speed by three times for single image. Meanwhile, this fast segmentation algorithm is extended from single object to multiple objects and from single-image to image-sequences. Thus the segmentation of multiple objects from complex hackground and batch segmentation of image-sequences can be achieved. In addition, a post-processing scheme is incorporated in this algorithm, which extracts smooth edge with one-pixel-width for each segmented object. The experimental results illustrate that the proposed algorithm can obtain the object regions of interest from medical image or image-sequences as well as man-made images quickly and reliably with only a little interaction.
文摘In this paper,we propose a novel adjustable multiple cross-hexagonal search(AMCHS) algorithm for fast block motion estimation. It employs adjustable multiple cross search patterns(AMCSP) in the first step and then uses half-way-skip and half-way-stop technique to determine whether to employ two hexagonal search patterns(HSPs) subsequently. The AMCSP can be used to find small motion vectors efficiently while the HSPs can be used to find large ones accurately to ensure prediction quality. Simulation results showed that our proposed AMCHS achieves faster search speed,and provides better distortion performance than other popular fast search algorithms,such as CDS and CDHS.
基金support from the Deanship of Scientific Research,University of Hail,Saudi Arabia through the project Ref.(RG-191315).
文摘Software testing has been attracting a lot of attention for effective software development.In model driven approach,Unified Modelling Language(UML)is a conceptual modelling approach for obligations and other features of the system in a model-driven methodology.Specialized tools interpret these models into other software artifacts such as code,test data and documentation.The generation of test cases permits the appropriate test data to be determined that have the aptitude to ascertain the requirements.This paper focuses on optimizing the test data obtained from UML activity and state chart diagrams by using Basic Genetic Algorithm(BGA).For generating the test cases,both diagrams were converted into their corresponding intermediate graphical forms namely,Activity Diagram Graph(ADG)and State Chart Diagram Graph(SCDG).Then both graphs will be combined to form a single graph called,Activity State Chart Diagram Graph(ASCDG).Both graphs were then joined to create a single graph known as the Activity State Chart Diagram Graph(ASCDG).Next,the ASCDG will be optimized using BGA to generate the test data.A case study involving a withdrawal from the automated teller machine(ATM)of a bank was employed to demonstrate the approach.The approach successfully identified defects in various ATM functions such as messaging and operation.
文摘The main objective of software testing is to have the highest likelihood of finding the most faults with a minimum amount of time and effort. Genetic Algorithm (GA) has been successfully used by researchers in software testing to automatically generate test data. In this paper, a GA is applied using branch coverage criterion to generate the least possible set of test data to test JSC applications. Results show that applying GA achieves better performance in terms of average number of test data?generations, execution time, and percentage of branch coverage.
基金the National 863 Plan Project of Ministry of Science and Technology of China under Grant No.2006AA09Z234
文摘An acoustic vector sensor(AVS)can capture more information than a conventional acoustic pressure sensor(APS).As a result,more output channels are required when multiple AVS are formed into arrays,making processing the data stream computationally intense.This paper proposes a new algorithm based on the propagator method for wideband coherent sources that eliminates eigen-decomposition in order to reduce the computational burden.Data from simulations and lake trials showed that the new algorithm is valid:it resolves coherent sources,breaks left/right ambiguity,and allows inter element spacing to exceed a half-wavelength.
基金the National Natural Science Foundation of China(No.61703413).
文摘An accurate period is important to recover the pulse profile from a recorded photon event series of an X-ray pulsar and to estimate the pulse time of arrival,which is the measurement of X-ray pulsar navigation.Epoch folding is a classical period estimation method in the time domain;however,its computational complexity grows as the number of trail periods increases.In order to reduce the computational complexity,this paper improves the fast folding algorithm through segment correlation and amplitude accumulation,which is based on the post-order traversal of a binary tree.Compared with epoch folding,the improved fast folding algorithm can achieve a similar accuracy at the cost of a lower computational burden.Compared with the original fast folding algorithm,the improved algorithm can be applied to detectors with a much smaller effective area.The performance of the method is investigated by simulation data and observation data from the Neutron star Interior Composition Explorer(NICER).
基金Project 2006CB202204-3 supported by the National Basic Research Program of China
文摘Given the problem of the long time required for testing gas pressure, we propose a fast-test method in which we used a technique of fast borehole sealing and air replenishing. Based on the characteristics of gas emission from boreholes to be tested, we built a theoretical model for calculating parameters during the process of increasing natural pressure and aeration. Using this model, we investigated the effect of different aeration conditions on velocity of pressure tests. The result shows that: 1) aerating air into boreholes can speed up gas pressure tests and 2) the more similar the pressure of the aerated air to the original gas pressure, the smaller the gas volume absorbed by coal and the shorter the time needed in pressure test. A case study in the Lu’an mining area shows that the time needed for gas pressure test is only 4 h using our method of aeration and 29 h under conditions of increasing natural pressure, saving time by 86.2%. This case study also indicates that, by using the aeration method, only one hour is needed for gas pressure to reach a stable state, which breaks the record of the shortest time needed for gas pressure tests in China.
