Aero engines are key power components that provide thrust for the aircraft.The cerme turbine disc allows the new-generation domestic fighter aircraft to increase the overall thrust of the aero engine.Quantifying coati...Aero engines are key power components that provide thrust for the aircraft.The cerme turbine disc allows the new-generation domestic fighter aircraft to increase the overall thrust of the aero engine.Quantifying coatings and analyzing the stress on the teeth play critical roles in improving the turbine disc’s performance,which are two issues must be solved urgently.First,this work pro poses a quantitative analysis algorithm to conduct the Three-Dimensional(3D)distribution informa tion mining of the extracted coatings.Then,it proposes an Industrial Computed Laminography(ICL)reconstruction algorithm for non-destructively reconstructing the turbine disc’s high-quality3D morphological actual feature.Finally,a Finite Element Analysis(FEA)under the ultimate thrus is conducted on ICL reconstruction to verify the working status of the new-generation aero-engine turbine disc.The results show that the proposed quantitative analysis algorithm digitizes the aggre gated conditions of the coating with a statistically normalized Z_(1)value of–2.15 and a confidence leve higher than 95%.Three image-quality quantitative indicators:Peak Signal-to-Noise Ratio(PSNR)Structural Similarity Index Measure(SSIM),and Normalized Mean Square Distance(NMSD)of the proposed ICL reconstruction algorithm on turbine disc laminographic image are 26.45,0.88,and 0.73respectively,which are better than other algorithms.The mechanical analysis of ICL more realisti cally reflects the stress and deformation than that of 3D modeling.This work provides new ideas for the iterative research of new-generation aero-engine turbine discs.展开更多
In order to mine production and security information from security supervising data and to ensure security and safety involved in production and decision-making,a clustering analysis algorithm for security supervising...In order to mine production and security information from security supervising data and to ensure security and safety involved in production and decision-making,a clustering analysis algorithm for security supervising data based on a semantic description in coal mines is studied.First,the semantic and numerical-based hybrid description method of security supervising data in coal mines is described.Secondly,the similarity measurement method of semantic and numerical data are separately given and a weight-based hybrid similarity measurement method for the security supervising data based on a semantic description in coal mines is presented.Thirdly,taking the hybrid similarity measurement method as the distance criteria and using a grid methodology for reference,an improved CURE clustering algorithm based on the grid is presented.Finally,the simulation results of a security supervising data set in coal mines validate the efficiency of the algorithm.展开更多
This paper provides a method of producing a minimum cost spanning tree(MCST)using set operations.It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and...This paper provides a method of producing a minimum cost spanning tree(MCST)using set operations.It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and proves the correctness and the complexity of the algorithm.This algorithm uses the FDG(formula to divide elements into groups)to sort(the FDG sorts a sequence of n elements in expected tir O(n))and uses the method of path compression to find and to unite.Therefore.n produces an MCST of an undirected network having n vertices and e edges in expected time O(eG(n)).展开更多
By studying the algorithms of single pattern matching, five factors that have effect on time complexity of the algorithm are analyzed. The five factors are： sorting the characters of pattern string in an increasing o...By studying the algorithms of single pattern matching, five factors that have effect on time complexity of the algorithm are analyzed. The five factors are： sorting the characters of pattern string in an increasing order of using frequency, utilizing already-matched pattern suffix information, utilizing already-matched pattern prefix information, utilizing the position factor which is absorbed from quick search algorithm, and utilizing the continue-skip idea which is originally proposed by this paper. Combining all the five factors, a new single pattern matching algorithm is implemented. It＇s proven by the experiment that the efficiency of new algorithm is the best of all algorithms.展开更多
This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to del...This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.展开更多
The scheduling of construction equipment is a means to realize network planning.With the large-scale and low-cost requirements of engineering construction,the cooperation among members of the engineering supply chain ...The scheduling of construction equipment is a means to realize network planning.With the large-scale and low-cost requirements of engineering construction,the cooperation among members of the engineering supply chain has become very important,and effective coordination of project plans at all levels to optimize the resource management and scheduling of a project is helpful to reduce project duration and cost.In this paper,under the milestone constraint conditions,the scheduling problems of multiple construction devices in the same sequence of operation were described and hypothesized mathematically,and the scheduling models of multiple equipment were established.The Palmer algorithm,CDS algorithm and Gupta algorithm were respectively used to solve the optimal scheduling of construction equipment to achieve the optimization of the construction period.The optimization scheduling of a single construction device and multiple construction devices was solved by using sequencing theory under milestone constraint,and these methods can obtain reasonable results,which has important guiding significance for the scheduling of construction equipment.展开更多
The theoretical positioning accuracy of multilateration(MLAT) with the time difference of arrival(TDOA) algorithm is very high. However, there are some problems in practical applications. Here we analyze the location ...The theoretical positioning accuracy of multilateration(MLAT) with the time difference of arrival(TDOA) algorithm is very high. However, there are some problems in practical applications. Here we analyze the location performance of the time sum of arrival(TSOA) algorithm from the root mean square error(RMSE) and geometric dilution of precision(GDOP) in additive white Gaussian noise(AWGN) environment. The TSOA localization model is constructed. Using it, the distribution of location ambiguity region is presented with 4-base stations. And then, the location performance analysis is started from the 4-base stations with calculating the RMSE and GDOP variation. Subsequently, when the location parameters are changed in number of base stations, base station layout and so on, the performance changing patterns of the TSOA location algorithm are shown. So, the TSOA location characteristics and performance are revealed. From the RMSE and GDOP state changing trend, the anti-noise performance and robustness of the TSOA localization algorithm are proved. The TSOA anti-noise performance will be used for reducing the blind-zone and the false location rate of MLAT systems.展开更多
Although computer architectures incorporate fast processing hardware resources, high performance real-time implementation of a complex control algorithm requires an efficient design and software coding of the algorith...Although computer architectures incorporate fast processing hardware resources, high performance real-time implementation of a complex control algorithm requires an efficient design and software coding of the algorithm so as to exploit special features of the hardware and avoid associated architecture shortcomings. This paper presents an investigation into the analysis and design mechanisms that will lead to reduction in the execution time in implementing real-time control algorithms. The proposed mechanisms are exemplified by means of one algorithm, which demonstrates their applicability to real-time applications. An active vibration control （AVC） algorithm for a flexible beam system simulated using the finite difference （FD） method is considered to demonstrate the effectiveness of the proposed methods. A comparative performance evaluation of the proposed design mechanisms is presented and discussed through a set of experiments.展开更多
In the classical multiprocessor scheduling problems, it is assumed that the problems are considered in off\|line or on\|line environment. But in practice, problems are often not really off\|line or on\|line but someh...In the classical multiprocessor scheduling problems, it is assumed that the problems are considered in off\|line or on\|line environment. But in practice, problems are often not really off\|line or on\|line but somehow in between. This means that, with respect to the on\|line problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi on\|line ones. The authors studied two semi on\|line multiprocessor scheduling problems, in which, the total processing time of all tasks is known in advance, or all processing times lie in a given interval. They proposed approximation algorithms for minimizing the makespan and analyzed their performance guarantee. The algorithms improve the known results for 3 or more processor cases in the literature.展开更多
There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of a dynamic block cipher was proposed.Firstly,the safety of ciphertext was enhanced based on confusion substitution o...There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of a dynamic block cipher was proposed.Firstly,the safety of ciphertext was enhanced based on confusion substitution of S-box,thus disordering the internal structure of data blocks by four steps of matrix transformation.Then,the diffusivity of ciphertext was obtained by cyclic displacement of bytes using column ambiguity function.The dynamic key was finally generated by using LFSR,which improved the stochastic characters of secret key in each of round of iteration.The safety performance of proposed algorithm was analyzed by simulation test.The results showed the proposed algorithm has a little effect on the speed of encryption and decryption while enhancing the security.Meanwhile,the proposed algorithm has highly scalability,the dimension of S-box and the number of register can be dynamically extended according to the security requirement.展开更多
There are various analytical, empirical and numerical methods to calculate groundwater inflow into tun- nels excavated in rocky media. Analytical methods have been widely applied in prediction of groundwa- ter inflow ...There are various analytical, empirical and numerical methods to calculate groundwater inflow into tun- nels excavated in rocky media. Analytical methods have been widely applied in prediction of groundwa- ter inflow to tunnels due to their simplicity and practical base theory. Investigations show that the real amount of water infiltrating into jointed tunnels is much less than calculated amount using analytical methods and obtained results are very dependent on tunnel＇s geometry and environmental situations. In this study, using multiple regression analysis, a new empirical model for estimation of groundwater seepage into circular tunnels was introduced. Our data was acquired from field surveys and laboratory analysis of core samples. New regression variables were defined after perusing single and two variables relationship between groundwater seepage and other variables. Finally, an appropriate model for estima- tion of leakage was obtained using the stepwise algorithm. Statistics like R, R2, R2e and the histogram of residual values in the model represent a good reputation and fitness for this model to estimate the groundwater seepage into tunnels. The new experimental model was used for the test data and results were satisfactory. Therefore, multiple regression analysis is an effective and efficient way to estimate the groundwater seeoage into tunnels.展开更多
Based on improved multi-objective particle swarm optimization（MOPSO） algorithm with principal component analysis（PCA） methodology, an efficient high-dimension multiobjective optimization method is proposed, which,...Based on improved multi-objective particle swarm optimization（MOPSO） algorithm with principal component analysis（PCA） methodology, an efficient high-dimension multiobjective optimization method is proposed, which, as the purpose of this paper, aims to improve the convergence of Pareto front in multi-objective optimization design. The mathematical efficiency,the physical reasonableness and the reliability in dealing with redundant objectives of PCA are verified by typical DTLZ5 test function and multi-objective correlation analysis of supercritical airfoil,and the proposed method is integrated into aircraft multi-disciplinary design（AMDEsign） platform, which contains aerodynamics, stealth and structure weight analysis and optimization module.Then the proposed method is used for the multi-point integrated aerodynamic optimization of a wide-body passenger aircraft, in which the redundant objectives identified by PCA are transformed to optimization constraints, and several design methods are compared. The design results illustrate that the strategy used in this paper is sufficient and multi-point design requirements of the passenger aircraft are reached. The visualization level of non-dominant Pareto set is improved by effectively reducing the dimension without losing the primary feature of the problem.展开更多
A bifurcation analysis approach is developed based on the process simulator gPROMS platform, which can automatically trace a solution path, detect and pass the bifurcation points and check the stability of solutions. ...A bifurcation analysis approach is developed based on the process simulator gPROMS platform, which can automatically trace a solution path, detect and pass the bifurcation points and check the stability of solutions. The arclength continuation algorithm is incorporated as a process entity in gPROMS to overcome the limit of turning points and get multiple solutions with respect to a user-defined parameter. The bifurcation points are detected through a bifurcation test function τ which is written in C ++ routine as a foreign object connected with gPROMS through Foreign Process Interface. The stability analysis is realized by evaluating eigenvalues of the Jacobian matrix of each steady state solution. Two reference cases of an adiabatic CSTR and a homogenous azeotropic distillation from literature are studied, which successfully validate the reliability of the proposed approach. Besides the multiple steady states and Hopf bifurcation points, a more complex homoclinic bifurcation behavior is found for the distillation case compared to literature.展开更多
In the K-means clustering algorithm, each data point is uniquely placed into one category. The clustering quality is heavily dependent on the initial cluster centroid. Different initializations can yield varied result...In the K-means clustering algorithm, each data point is uniquely placed into one category. The clustering quality is heavily dependent on the initial cluster centroid. Different initializations can yield varied results; local adjustment cannot save the clustering result from poor local optima. If there is an anomaly in a cluster, it will seriously affect the cluster mean value. The K-means clustering algorithm is only suitable for clusters with convex shapes. We therefore propose a novel clustering algorithm CARDBK—＂centroid all rank distance（CARD）＂ which means that all centroids are sorted by distance value from one point and ＂BK＂ are the initials of ＂batch K-means＂—in which one point not only modifies a cluster centroid nearest to this point but also modifies multiple clusters centroids adjacent to this point, and the degree of influence of a point on a cluster centroid depends on the distance value between this point and the other nearer cluster centroids. Experimental results showed that our CARDBK algorithm outperformed other algorithms when tested on a number of different data sets based on the following performance indexes： entropy, purity, F1 value, Rand index and normalized mutual information（NMI）. Our algorithm manifested to be more stable, linearly scalable and faster.展开更多
Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interco...Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interconnect architecture,we propose a time-multiplexed routing algorithm that can actively identify qualified nets and schedule them to multiplexable wires.We validate the algorithm by using the router to implement 20 benchmark circuits to time-multiplexed FPGAs.We achieve a 38%smaller minimum channel width and 3.8%smaller circuit critical path delay compared with the state-of-the-art architecture router when a wire can be time-multiplexed six times in a cycle.展开更多
Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic nois...Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic noise level of measuring instruments.This leads to the need for multiple measurements with subsequent statistical processing.In this paper,the digital algorithms are proposed for the automatic measurement of the JJ parameters by IVC.These algorithms make it possible to implement multiple measurements and check these JJ parameters in an automatic mode with the required accuracy.The complete sufficient statistics are used to minimize the root-mean-square error of parameter measurement.A sequence of current pulses with slow rising and falling edges is used to drive JJ,and synchronous current and voltage readings at JJ are used to realize measurement algorithms.The algorithm performance is estimated through computer simulations.The significant advantage of the proposed algorithms is the independence from current source noise and intrinsic noise of current and voltage meters,as well as the simple implementation in automatic digital measuring systems.The proposed algorithms can be used to control JJ parameters during mass production of superconducting integrated circuits,which will improve the production efficiency and product quality.展开更多
Chosen-message pair Simple Power Analysis (SPA) attacks were proposed by Boer, Yen and Homma, and are attack methods based on searches for collisions of modular multiplication. However, searching for collisions is dif...Chosen-message pair Simple Power Analysis (SPA) attacks were proposed by Boer, Yen and Homma, and are attack methods based on searches for collisions of modular multiplication. However, searching for collisions is difficult in real environments. To circumvent this problem, we propose the Simple Power Clustering Attack (SPCA), which can automatically identify the modular multiplication collision. The insignificant effects of collision attacks were validated in an Application Specific Integrated Circuit (ASIC) environment. After treatment with SPCA, the automatic secret key recognition rate increased to 99%.展开更多
Classification systems such as Slope Mass Rating(SMR) are currently being used to undertake slope stability analysis. In SMR classification system, data is allocated to certain classes based on linguistic and experien...Classification systems such as Slope Mass Rating(SMR) are currently being used to undertake slope stability analysis. In SMR classification system, data is allocated to certain classes based on linguistic and experience-based criteria. In order to eliminate linguistic criteria resulted from experience-based judgments and account for uncertainties in determining class boundaries developed by SMR system,the system classification results were corrected using two clustering algorithms, namely K-means and fuzzy c-means(FCM), for the ratings obtained via continuous and discrete functions. By applying clustering algorithms in SMR classification system, no in-advance experience-based judgment was made on the number of extracted classes in this system, and it was only after all steps of the clustering algorithms were accomplished that new classification scheme was proposed for SMR system under different failure modes based on the ratings obtained via continuous and discrete functions. The results of this study showed that, engineers can achieve more reliable and objective evaluations over slope stability by using SMR system based on the ratings calculated via continuous and discrete functions.展开更多
In the vehicle trajectory application system, it is often necessary to detect whether the vehicle deviates from the specified route. Trajectory planning in the traditional route deviation detection is defined by the d...In the vehicle trajectory application system, it is often necessary to detect whether the vehicle deviates from the specified route. Trajectory planning in the traditional route deviation detection is defined by the driver through the mobile phone navigation software, which plays a more auxiliary driving role. This paper presents a method of vehicle trajectory deviation detection. Firstly, the manager customizes the trajectory planning and then uses big data technologies to match the deviation between the trajectory planning and the vehicle trajectory. Finally, it achieves the supervisory function of the manager on the vehicle track route in real-time. The results show that this method could detect the vehicle trajectory deviation quickly and accurately, and has practical application value.展开更多
Global navigation satellite system（GNSS） can be employed as a transmitter to composite bistatic synthetic aperture radar（BiSAR）.As GNSS signal is quite different from the traditional radar signal,modified spectral...Global navigation satellite system（GNSS） can be employed as a transmitter to composite bistatic synthetic aperture radar（BiSAR）.As GNSS signal is quite different from the traditional radar signal,modified spectral analysis（SPECAN） algorithm is proposed and applied in the BiSAR system.The modifications include Doppler centroid compensation,range curve correction and azimuth processing method.The modified SPECAN algorithm solves the imaging problem under the condition of huge range migration,long synthetic aperture time and phase-coded signal.The proposed algorithm is verified by experiment results.展开更多
基金supported by the National Natural Science Foundation of China(No.51975026)。
文摘Aero engines are key power components that provide thrust for the aircraft.The cerme turbine disc allows the new-generation domestic fighter aircraft to increase the overall thrust of the aero engine.Quantifying coatings and analyzing the stress on the teeth play critical roles in improving the turbine disc’s performance,which are two issues must be solved urgently.First,this work pro poses a quantitative analysis algorithm to conduct the Three-Dimensional(3D)distribution informa tion mining of the extracted coatings.Then,it proposes an Industrial Computed Laminography(ICL)reconstruction algorithm for non-destructively reconstructing the turbine disc’s high-quality3D morphological actual feature.Finally,a Finite Element Analysis(FEA)under the ultimate thrus is conducted on ICL reconstruction to verify the working status of the new-generation aero-engine turbine disc.The results show that the proposed quantitative analysis algorithm digitizes the aggre gated conditions of the coating with a statistically normalized Z_(1)value of–2.15 and a confidence leve higher than 95%.Three image-quality quantitative indicators:Peak Signal-to-Noise Ratio(PSNR)Structural Similarity Index Measure(SSIM),and Normalized Mean Square Distance(NMSD)of the proposed ICL reconstruction algorithm on turbine disc laminographic image are 26.45,0.88,and 0.73respectively,which are better than other algorithms.The mechanical analysis of ICL more realisti cally reflects the stress and deformation than that of 3D modeling.This work provides new ideas for the iterative research of new-generation aero-engine turbine discs.
基金The National Natural Science Foundation of China(No.50674086)Specialized Research Fund for the Doctoral Program of Higher Education(No.20060290508)the Postdoctoral Scientific Program of Jiangsu Province(No.0701045B)
文摘In order to mine production and security information from security supervising data and to ensure security and safety involved in production and decision-making,a clustering analysis algorithm for security supervising data based on a semantic description in coal mines is studied.First,the semantic and numerical-based hybrid description method of security supervising data in coal mines is described.Secondly,the similarity measurement method of semantic and numerical data are separately given and a weight-based hybrid similarity measurement method for the security supervising data based on a semantic description in coal mines is presented.Thirdly,taking the hybrid similarity measurement method as the distance criteria and using a grid methodology for reference,an improved CURE clustering algorithm based on the grid is presented.Finally,the simulation results of a security supervising data set in coal mines validate the efficiency of the algorithm.
文摘This paper provides a method of producing a minimum cost spanning tree(MCST)using set operations.It studies the data structure for implementation of set operations and the algorithm to be applied to this structure and proves the correctness and the complexity of the algorithm.This algorithm uses the FDG(formula to divide elements into groups)to sort(the FDG sorts a sequence of n elements in expected tir O(n))and uses the method of path compression to find and to unite.Therefore.n produces an MCST of an undirected network having n vertices and e edges in expected time O(eG(n)).
基金the National Natural Science Foundation of China (Nos. 60502032 and 60672068)
文摘By studying the algorithms of single pattern matching, five factors that have effect on time complexity of the algorithm are analyzed. The five factors are： sorting the characters of pattern string in an increasing order of using frequency, utilizing already-matched pattern suffix information, utilizing already-matched pattern prefix information, utilizing the position factor which is absorbed from quick search algorithm, and utilizing the continue-skip idea which is originally proposed by this paper. Combining all the five factors, a new single pattern matching algorithm is implemented. It＇s proven by the experiment that the efficiency of new algorithm is the best of all algorithms.
基金supported by Northern Border University,Arar,Kingdom of Saudi Arabia,through the Project Number“NBU-FFR-2024-2248-03”.
文摘This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.
文摘The scheduling of construction equipment is a means to realize network planning.With the large-scale and low-cost requirements of engineering construction,the cooperation among members of the engineering supply chain has become very important,and effective coordination of project plans at all levels to optimize the resource management and scheduling of a project is helpful to reduce project duration and cost.In this paper,under the milestone constraint conditions,the scheduling problems of multiple construction devices in the same sequence of operation were described and hypothesized mathematically,and the scheduling models of multiple equipment were established.The Palmer algorithm,CDS algorithm and Gupta algorithm were respectively used to solve the optimal scheduling of construction equipment to achieve the optimization of the construction period.The optimization scheduling of a single construction device and multiple construction devices was solved by using sequencing theory under milestone constraint,and these methods can obtain reasonable results,which has important guiding significance for the scheduling of construction equipment.
基金supported by the Joint Civil Aviation Fund of National Natural Science Foundation of China(Nos.U1533108 and U1233112)
文摘The theoretical positioning accuracy of multilateration(MLAT) with the time difference of arrival(TDOA) algorithm is very high. However, there are some problems in practical applications. Here we analyze the location performance of the time sum of arrival(TSOA) algorithm from the root mean square error(RMSE) and geometric dilution of precision(GDOP) in additive white Gaussian noise(AWGN) environment. The TSOA localization model is constructed. Using it, the distribution of location ambiguity region is presented with 4-base stations. And then, the location performance analysis is started from the 4-base stations with calculating the RMSE and GDOP variation. Subsequently, when the location parameters are changed in number of base stations, base station layout and so on, the performance changing patterns of the TSOA location algorithm are shown. So, the TSOA location characteristics and performance are revealed. From the RMSE and GDOP state changing trend, the anti-noise performance and robustness of the TSOA localization algorithm are proved. The TSOA anti-noise performance will be used for reducing the blind-zone and the false location rate of MLAT systems.
文摘Although computer architectures incorporate fast processing hardware resources, high performance real-time implementation of a complex control algorithm requires an efficient design and software coding of the algorithm so as to exploit special features of the hardware and avoid associated architecture shortcomings. This paper presents an investigation into the analysis and design mechanisms that will lead to reduction in the execution time in implementing real-time control algorithms. The proposed mechanisms are exemplified by means of one algorithm, which demonstrates their applicability to real-time applications. An active vibration control （AVC） algorithm for a flexible beam system simulated using the finite difference （FD） method is considered to demonstrate the effectiveness of the proposed methods. A comparative performance evaluation of the proposed design mechanisms is presented and discussed through a set of experiments.
文摘In the classical multiprocessor scheduling problems, it is assumed that the problems are considered in off\|line or on\|line environment. But in practice, problems are often not really off\|line or on\|line but somehow in between. This means that, with respect to the on\|line problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi on\|line ones. The authors studied two semi on\|line multiprocessor scheduling problems, in which, the total processing time of all tasks is known in advance, or all processing times lie in a given interval. They proposed approximation algorithms for minimizing the makespan and analyzed their performance guarantee. The algorithms improve the known results for 3 or more processor cases in the literature.
基金supported in part by National Natural Science Fundation of China under Grant No.61202458,61403109
文摘There are a lot of security issues in block cipher algorithm.Security analysis and enhanced design of a dynamic block cipher was proposed.Firstly,the safety of ciphertext was enhanced based on confusion substitution of S-box,thus disordering the internal structure of data blocks by four steps of matrix transformation.Then,the diffusivity of ciphertext was obtained by cyclic displacement of bytes using column ambiguity function.The dynamic key was finally generated by using LFSR,which improved the stochastic characters of secret key in each of round of iteration.The safety performance of proposed algorithm was analyzed by simulation test.The results showed the proposed algorithm has a little effect on the speed of encryption and decryption while enhancing the security.Meanwhile,the proposed algorithm has highly scalability,the dimension of S-box and the number of register can be dynamically extended according to the security requirement.
文摘There are various analytical, empirical and numerical methods to calculate groundwater inflow into tun- nels excavated in rocky media. Analytical methods have been widely applied in prediction of groundwa- ter inflow to tunnels due to their simplicity and practical base theory. Investigations show that the real amount of water infiltrating into jointed tunnels is much less than calculated amount using analytical methods and obtained results are very dependent on tunnel＇s geometry and environmental situations. In this study, using multiple regression analysis, a new empirical model for estimation of groundwater seepage into circular tunnels was introduced. Our data was acquired from field surveys and laboratory analysis of core samples. New regression variables were defined after perusing single and two variables relationship between groundwater seepage and other variables. Finally, an appropriate model for estima- tion of leakage was obtained using the stepwise algorithm. Statistics like R, R2, R2e and the histogram of residual values in the model represent a good reputation and fitness for this model to estimate the groundwater seepage into tunnels. The new experimental model was used for the test data and results were satisfactory. Therefore, multiple regression analysis is an effective and efficient way to estimate the groundwater seeoage into tunnels.
基金supported by the National Natural Science Foundation of China (No.11402288)
文摘Based on improved multi-objective particle swarm optimization（MOPSO） algorithm with principal component analysis（PCA） methodology, an efficient high-dimension multiobjective optimization method is proposed, which, as the purpose of this paper, aims to improve the convergence of Pareto front in multi-objective optimization design. The mathematical efficiency,the physical reasonableness and the reliability in dealing with redundant objectives of PCA are verified by typical DTLZ5 test function and multi-objective correlation analysis of supercritical airfoil,and the proposed method is integrated into aircraft multi-disciplinary design（AMDEsign） platform, which contains aerodynamics, stealth and structure weight analysis and optimization module.Then the proposed method is used for the multi-point integrated aerodynamic optimization of a wide-body passenger aircraft, in which the redundant objectives identified by PCA are transformed to optimization constraints, and several design methods are compared. The design results illustrate that the strategy used in this paper is sufficient and multi-point design requirements of the passenger aircraft are reached. The visualization level of non-dominant Pareto set is improved by effectively reducing the dimension without losing the primary feature of the problem.
基金Supported by the National Natural Science Foundation of China(21576081)Major State Basic Research Development Program of China(2012CB720502)111 Project(B08021)
文摘A bifurcation analysis approach is developed based on the process simulator gPROMS platform, which can automatically trace a solution path, detect and pass the bifurcation points and check the stability of solutions. The arclength continuation algorithm is incorporated as a process entity in gPROMS to overcome the limit of turning points and get multiple solutions with respect to a user-defined parameter. The bifurcation points are detected through a bifurcation test function τ which is written in C ++ routine as a foreign object connected with gPROMS through Foreign Process Interface. The stability analysis is realized by evaluating eigenvalues of the Jacobian matrix of each steady state solution. Two reference cases of an adiabatic CSTR and a homogenous azeotropic distillation from literature are studied, which successfully validate the reliability of the proposed approach. Besides the multiple steady states and Hopf bifurcation points, a more complex homoclinic bifurcation behavior is found for the distillation case compared to literature.
基金Supported by the Social Science Foundation of Shaanxi Province of China(2018P03)the Humanities and Social Sciences Research Youth Fund Project of Ministry of Education of China(13YJCZH251)
文摘In the K-means clustering algorithm, each data point is uniquely placed into one category. The clustering quality is heavily dependent on the initial cluster centroid. Different initializations can yield varied results; local adjustment cannot save the clustering result from poor local optima. If there is an anomaly in a cluster, it will seriously affect the cluster mean value. The K-means clustering algorithm is only suitable for clusters with convex shapes. We therefore propose a novel clustering algorithm CARDBK—＂centroid all rank distance（CARD）＂ which means that all centroids are sorted by distance value from one point and ＂BK＂ are the initials of ＂batch K-means＂—in which one point not only modifies a cluster centroid nearest to this point but also modifies multiple clusters centroids adjacent to this point, and the degree of influence of a point on a cluster centroid depends on the distance value between this point and the other nearer cluster centroids. Experimental results showed that our CARDBK algorithm outperformed other algorithms when tested on a number of different data sets based on the following performance indexes： entropy, purity, F1 value, Rand index and normalized mutual information（NMI）. Our algorithm manifested to be more stable, linearly scalable and faster.
文摘Previous studies show that interconnects occupy a large portion of the timing budget and area in FPGAs.In this work,we propose a time-multiplexing technique on FPGA interconnects.In order to fully exploit this interconnect architecture,we propose a time-multiplexed routing algorithm that can actively identify qualified nets and schedule them to multiplexable wires.We validate the algorithm by using the router to implement 20 benchmark circuits to time-multiplexed FPGAs.We achieve a 38%smaller minimum channel width and 3.8%smaller circuit critical path delay compared with the state-of-the-art architecture router when a wire can be time-multiplexed six times in a cycle.
基金the Ministry of Science and Higher Education of the Russian Federation under Grant No.FSUN-2023-0007.
文摘Some electrical parameters of the SIS-type hysteretic underdamped Josephson junction(JJ)can be measured by its current-voltage characteristics(IVCs).Currents and voltages at JJ are commensurate with the intrinsic noise level of measuring instruments.This leads to the need for multiple measurements with subsequent statistical processing.In this paper,the digital algorithms are proposed for the automatic measurement of the JJ parameters by IVC.These algorithms make it possible to implement multiple measurements and check these JJ parameters in an automatic mode with the required accuracy.The complete sufficient statistics are used to minimize the root-mean-square error of parameter measurement.A sequence of current pulses with slow rising and falling edges is used to drive JJ,and synchronous current and voltage readings at JJ are used to realize measurement algorithms.The algorithm performance is estimated through computer simulations.The significant advantage of the proposed algorithms is the independence from current source noise and intrinsic noise of current and voltage meters,as well as the simple implementation in automatic digital measuring systems.The proposed algorithms can be used to control JJ parameters during mass production of superconducting integrated circuits,which will improve the production efficiency and product quality.
基金supported in part by the National Natural Science Foundation of China under Grant No. 60873216Scientific and Technological Research Priority Projects of Sichuan Province under Grant No. 2012GZ0017Basic Research of Application Fund Project of Sichuan Province under Grant No. 2011JY0100
文摘Chosen-message pair Simple Power Analysis (SPA) attacks were proposed by Boer, Yen and Homma, and are attack methods based on searches for collisions of modular multiplication. However, searching for collisions is difficult in real environments. To circumvent this problem, we propose the Simple Power Clustering Attack (SPCA), which can automatically identify the modular multiplication collision. The insignificant effects of collision attacks were validated in an Application Specific Integrated Circuit (ASIC) environment. After treatment with SPCA, the automatic secret key recognition rate increased to 99%.
文摘Classification systems such as Slope Mass Rating(SMR) are currently being used to undertake slope stability analysis. In SMR classification system, data is allocated to certain classes based on linguistic and experience-based criteria. In order to eliminate linguistic criteria resulted from experience-based judgments and account for uncertainties in determining class boundaries developed by SMR system,the system classification results were corrected using two clustering algorithms, namely K-means and fuzzy c-means(FCM), for the ratings obtained via continuous and discrete functions. By applying clustering algorithms in SMR classification system, no in-advance experience-based judgment was made on the number of extracted classes in this system, and it was only after all steps of the clustering algorithms were accomplished that new classification scheme was proposed for SMR system under different failure modes based on the ratings obtained via continuous and discrete functions. The results of this study showed that, engineers can achieve more reliable and objective evaluations over slope stability by using SMR system based on the ratings calculated via continuous and discrete functions.
文摘In the vehicle trajectory application system, it is often necessary to detect whether the vehicle deviates from the specified route. Trajectory planning in the traditional route deviation detection is defined by the driver through the mobile phone navigation software, which plays a more auxiliary driving role. This paper presents a method of vehicle trajectory deviation detection. Firstly, the manager customizes the trajectory planning and then uses big data technologies to match the deviation between the trajectory planning and the vehicle trajectory. Finally, it achieves the supervisory function of the manager on the vehicle track route in real-time. The results show that this method could detect the vehicle trajectory deviation quickly and accurately, and has practical application value.
基金Sponsored by the National Natural Science Foundation of China(60890071-1160890071-0760890073)
文摘Global navigation satellite system（GNSS） can be employed as a transmitter to composite bistatic synthetic aperture radar（BiSAR）.As GNSS signal is quite different from the traditional radar signal,modified spectral analysis（SPECAN） algorithm is proposed and applied in the BiSAR system.The modifications include Doppler centroid compensation,range curve correction and azimuth processing method.The modified SPECAN algorithm solves the imaging problem under the condition of huge range migration,long synthetic aperture time and phase-coded signal.The proposed algorithm is verified by experiment results.
