The detection of small targets poses a significant challenge for infrared search and tracking (IRST) systems,as they must strike a delicate balance between accuracy and speed.In this paper,we propose a detection algor...The detection of small targets poses a significant challenge for infrared search and tracking (IRST) systems,as they must strike a delicate balance between accuracy and speed.In this paper,we propose a detection algorithm based on spatial attention density peaks searching (SADPS) and an adaptive window selection scheme.First,the difference-of-Gaussians (DoG) filter is introduced for preprocessing raw infrared images.Second,the image is processed by SADPS.Third,an adaptive window selection scheme is applied to obtain window templates for the target scale size.Then,the small target feature is used to enhance the target and suppress the background.Finally,the true targets are segmented through a threshold.The experimental results show that compared with the seven state-of-the-art small targets detection baseline algorithms,the proposed method not only has better detection accuracy,but also has reasonable time consumption.展开更多
To address the issues of unknown target size,blurred edges,background interference and low contrast in infrared small target detection,this paper proposes a method based on density peaks searching and weighted multi-f...To address the issues of unknown target size,blurred edges,background interference and low contrast in infrared small target detection,this paper proposes a method based on density peaks searching and weighted multi-feature local difference.Firstly,an improved high-boost filter is used for preprocessing to eliminate background clutter and high-brightness interference,thereby increasing the probability of capturing real targets in the density peak search.Secondly,a triple-layer window is used to extract features from the area surrounding candidate targets,addressing the uncertainty of small target sizes.By calculating multi-feature local differences between the triple-layer windows,the problems of blurred target edges and low contrast are resolved.To balance the contribution of different features,intra-class distance is used to calculate weights,achieving weighted fusion of multi-feature local differences to obtain the weighted multi-feature local differences of candidate targets.The real targets are then extracted using the interquartile range.Experiments on datasets such as SIRST and IRSTD-IK show that the proposed method is suitable for various complex types and demonstrates good robustness and detection performance.展开更多
Terrestrial laser scanning(TLS)accurately captures tree structural information and provides prerequisites for treescale estimations of forest biophysical attributes.Quantifying tree-scale attributes from TLS point clo...Terrestrial laser scanning(TLS)accurately captures tree structural information and provides prerequisites for treescale estimations of forest biophysical attributes.Quantifying tree-scale attributes from TLS point clouds requires segmentation,yet the occlusion effects severely affect the accuracy of automated individual tree segmentation.In this study,we proposed a novel method using ellipsoid directional searching and point compensation algorithms to alleviate occlusion effects.Firstly,region growing and point compensation algorithms are used to determine the location of tree roots.Secondly,the neighbor points are extracted within an ellipsoid neighborhood to mitigate occlusion effects compared with k-nearest neighbor(KNN).Thirdly,neighbor points are uniformly subsampled by the directional searching algorithm based on the Fibonacci principle in multiple spatial directions to reduce memory consumption.Finally,a graph describing connectivity between a point and its neighbors is constructed,and it is utilized to complete individual tree segmentation based on the shortest path algorithm.The proposed method was evaluated on a public TLS dataset comprising six forest plots with three complexity categories in Evo,Finland,and it reached the highest mean accuracy of 77.5%,higher than previous studies on tree detection.We also extracted and validated the tree structure attributes using manual segmentation reference values.The RMSE,RMSE%,bias,and bias%of tree height,crown base height,crown projection area,crown surface area,and crown volume were used to evaluate the segmentation accuracy,respectively.Overall,the proposed method avoids many inherent limitations of current methods and can accurately map canopy structures in occluded complex forest stands.展开更多
In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers＇ organization. A novel P2P （peer-to-peer） searching model, SSP2P, was put forward. The ...In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers＇ organization. A novel P2P （peer-to-peer） searching model, SSP2P, was put forward. The peers in the model were organized in a natural area autonomy system （AAS） based on the smallworld theory. A super-peer was selected in each AAS based on power law; and all the super-peers formed different super-peer semantic networks. Thus, a hierarchical super-peer overlay network was formed. The results show that the model reduces the communication cost and enhances the search efficiency while ensuring the system expansibility. It proves that the introduction of semantic information in the construction of a super-peer overlay is favorable to P2P system capability.展开更多
Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network （SSON） is proposed for sharing and searching their d...Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network （SSON） is proposed for sharing and searching their data objects. In SSON, peers are dynamically clustered into many semantic clusters based on the semantics of their data objects and organized in the semantic clusters into a semantic overlay network. Each semantic cluster consists of a super-peer and more peers, and is only responsible for answering queries in its semantic subspace. A query is first routed to the appropriate semantic clusters by an efficient searching algorithm, and then it is forwarded to the specific peers that hold the relevant data objects. Experimental results indicate that SSON has good scalability and achieves a competitive trade-off between search efficiency and costs.展开更多
For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversio...For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversion parameters and subdivision scheme can, not only improve the inversion process efficiency, but also ensure inversion result accuracy. The gravity inversion method based on correlation searching and the golden section algorithm is an effective potential field inversion method. It can be used to invert 2D and 3D physical properties with potential data observed on flat or rough surfaces. In this paper, we introduce in detail the density inversion principles based on correlation searching and the golden section algorithm. Considering that the gold section algorithm is not globally optimized. we present a heuristic method to ensure the inversion result is globally optimized. With a series of model tests, we systematically compare and analyze the inversion result efficiency and accuracy with different parameters. Based on the model test results, we conclude the selection principles for each inversion parameter with which the inversion accuracy can be obviously improved.展开更多
Information searching competence is now playing an increasingly indispensable role in the translation process with the booming information technology in the big data era. Resorting to information tools such as E-dicti...Information searching competence is now playing an increasingly indispensable role in the translation process with the booming information technology in the big data era. Resorting to information tools such as E-dictionaries, search engines, online encyclopedia and corpus, translators can pinpoint the exact meaning of unfamiliar words or expressions, terminologies and jargons, become acquainted with relevant background knowledge and result in the most appropriate translation versions by searching and comparing corpus available. In this way errors and inaccuracies will be controlled and to some extent avoided. This paper mainly discusses how to develop during the translation process such a competence in searching specific and to-the-point information as is a vital component in the package of translation competences.展开更多
We present the design and performance of a home-built scanning tunneling microscope （STM）, which is compact （66 mm tall and 25 mm in diameter）, yet equipped with a 3D atomic precision piezoelectric motor in which ...We present the design and performance of a home-built scanning tunneling microscope （STM）, which is compact （66 mm tall and 25 mm in diameter）, yet equipped with a 3D atomic precision piezoelectric motor in which the Z coarse approach relies on a high simplic-ity friction-type walker （of our own invention） driven by an axially cut piezoelectric tube. The walker is vertically inserted in a piezoelectric scanner tube （PST） with its brim laying at on the PST end as the inertial slider （driven by the PST） for the XZ （sample plane） motion. The STM is designed to be capable of searching rare microscopic targets （defects, dopants, boundaries, nano-devices, etc.） in a macroscopic sample area （square millimeters） under extreme conditions （low temperatures, strong magnetic elds, etc.） in which it ts. It gives good atomic resolution images after scanning a highly oriented pyrolytic graphite sample in air at room temperature.展开更多
A hybrid carrier（HC） scheme based on weighted-type fractional Fourier transform（WFRFT） has been proposed recently.While most of the works focus on HC scheme＇s inherent characteristics, little attention is paid to...A hybrid carrier（HC） scheme based on weighted-type fractional Fourier transform（WFRFT） has been proposed recently.While most of the works focus on HC scheme＇s inherent characteristics, little attention is paid to the WFRFT modulation recognition.In this paper, a new theory is provided to recognize the WFRFT modulation based on higher order cumulants（HOC）. First, it is deduced that the optimal WFRFT received order can be obtained through the minimization of 4 th-order cumulants, C_（42）. Then, a combinatorial searching algorithm is designed to minimize C_（42）.Finally, simulation results show that the designed scheme has a high recognition rate and the combinatorial searching algorithm is effective and reliable.展开更多
In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated wit...In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.展开更多
Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the proces...Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the process of searching optimal goal by searching swarm with set rules. This work selects complicated and highn dimension functions to deeply analyse the performance for unconstrained and constrained optimization problems and the results produced by ASSA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Fish-Swarm Algorithm (AFSA) have been compared. The main factors which influence the performance of ASSA are also discussed. The results demonstrate the effectiveness of the proposed ASSA optimization algorithm.展开更多
To evaluate the credit risk of customers in power market precisely, the new chaotic searching and fuzzy neural network (FNN) hybrid algorithm were proposed. By combining with the chaotic searching, the learning abilit...To evaluate the credit risk of customers in power market precisely, the new chaotic searching and fuzzy neural network (FNN) hybrid algorithm were proposed. By combining with the chaotic searching, the learning ability of the FNN was markedly enhanced. Customers’ actual credit flaw data of power supply enterprises were collected to carry on the real evaluation, which can be treated as example for the model. The result shows that the proposed method surpasses the traditional statistical models in regard to the precision of forecasting and has a practical value. Compared with the results of ordinary FNN and ANN, the precision of the proposed algorithm can be enhanced by 2.2% and 4.5%, respectively.展开更多
Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and globa...Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and global map cannot be previously known. As a result, ICP algorithm will take much amount of iterations to reach convergence. On the other hand,establishment of correspondence is done by global searching, which requires enormous computational time. To overcome the two problems,a fast ICP-SLAM with rough alignment and narrowing-scale nearby searching is proposed. As for the decrease of iterative times,rough alignment based on initial pose matrix is proposed. In detail,initial pose matrix is obtained by micro-electro-mechanical system( MEMS) magnetometer and global landmarks. Then rough alignment will be applied between current scan frame and global map at the beginning of ICP algorithm with initial pose matrix. As for accelerating the establishment of correspondence, narrowingscale nearby searching with dynamic threshold is proposed,where match-points are found within a progressively constrictive range.Compared to traditional ICP-SLAM,the experimental results show that the amount of iteration for ICP algorithm to reach convergence reduces to 92. 34% and ICP algorithm runtime reduces to 98. 86% on average. In addition,computational cost is kept in a stable level due to the eliminating of the accumulation of computational consumption. Moreover,great improvement can also been achieved in SLAM quality and robustness.展开更多
An independently developed mobile welding robot system is introduced. Kinematics model is the base of robot planning. With the Denavit-Hartenberg method, robot kinematics equation can be gotten. The robot welding torc...An independently developed mobile welding robot system is introduced. Kinematics model is the base of robot planning. With the Denavit-Hartenberg method, robot kinematics equation can be gotten. The robot welding torch inclination angle consists of the working and moving angles. According to the kinematics model,both the two angles and torch position can be calculated. Under special moving angle, a two-step algorithm is used to obtain the optimal manipulator posture. The calculation result shows that the algorithm has high precision.展开更多
To overcome imperfection of exhaustive based beam searching scheme in IEEE 802.15.3c and IEEE 802.11 ad and accelerate the beam training process, combined with the fast beam searching algorithm previously proposed, th...To overcome imperfection of exhaustive based beam searching scheme in IEEE 802.15.3c and IEEE 802.11 ad and accelerate the beam training process, combined with the fast beam searching algorithm previously proposed, this paper proposed a beam codebook design scheme for phased array to not only satisfy the fast beam searching algorithm's demand, but also make good use of the advantage of the searching algorithm. The simulation results prove that the proposed scheme not only performs well on flexibility and searching time complexity, but also has high success ratio.展开更多
The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal...The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.展开更多
A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard g...A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard gate combined with m + 1 quantum measurement operations. To validate the proposed method, a simulation experiment is used where the image with the highest similarity value of 0.93 to the particular test image is retrieved as the search result from 4 × 4 binary image database. The proposal provides a basic step for designing a search engine on quantum computing devices where the image in the database is retrieved based on its similarity to the test image.展开更多
A novel idea,called the optimal shape subspace （OSS） is first proposed for optimizing active shape model （ASM） search.It is constructed from the principal shape subspace and the principal shape variance subspace.I...A novel idea,called the optimal shape subspace （OSS） is first proposed for optimizing active shape model （ASM） search.It is constructed from the principal shape subspace and the principal shape variance subspace.It allows the reconstructed shape to vary more than that reconstructed in the standard ASM shape space,hence it is more expressive in representing shapes in real life.Then a cost function is developed,based on a study on the search process.An optimal searching method using the feedback information provided by the evaluation cost is proposed to improve the performance of ASM alignment.Experimental results show that the proposed OSS can offer the maximum shape variation with reserving the principal information and a unique local optimal shape is acquired after optimal searching.The combination of OSS and optimal searching can improve the ASM performance greatly.展开更多
Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric Approximation Searching Algorithm (GASA). According to t...Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric Approximation Searching Algorithm (GASA). According to the minimum condition principle of form error evaluation, the mathematic model and optimization objective of the GASA are given. The algorithm avoids the optimization and linearization, and can be fulfilled in three steps. First construct two parallel quadrates based on the preset two reference points of the spatial line respectively;second construct centerlines by connecting one quadrate each vertices to another quadrate each vertices;after that, calculate the distances between measured points and the constructed centerlines. The minimum zone straightness error is obtained by repeating comparing and reconstructing quadrates. The principle and steps of the algorithm to evaluate spatial straightness error is described in detail, and the mathematical formula and program flowchart are given also. Results show that this algorithm can evaluate spatial straightness error more effectively and exactly.展开更多
This paper discusses the approaches for automatical searching of control points in the NOAA AVHRR image on the basis of data rearrangement in the form of latitude and longitude grid. The vegetation index transformatio...This paper discusses the approaches for automatical searching of control points in the NOAA AVHRR image on the basis of data rearrangement in the form of latitude and longitude grid. The vegetation index transformation and multi-level matching strategies have been proven effective and successful as the experiments show while the control point database is established.展开更多
基金supported by the National 14th Five-Year Plan Preliminary Research Project (No.514010405-207)。
文摘The detection of small targets poses a significant challenge for infrared search and tracking (IRST) systems,as they must strike a delicate balance between accuracy and speed.In this paper,we propose a detection algorithm based on spatial attention density peaks searching (SADPS) and an adaptive window selection scheme.First,the difference-of-Gaussians (DoG) filter is introduced for preprocessing raw infrared images.Second,the image is processed by SADPS.Third,an adaptive window selection scheme is applied to obtain window templates for the target scale size.Then,the small target feature is used to enhance the target and suppress the background.Finally,the true targets are segmented through a threshold.The experimental results show that compared with the seven state-of-the-art small targets detection baseline algorithms,the proposed method not only has better detection accuracy,but also has reasonable time consumption.
基金supported by the National Natural Science Foundation of China (No.52205548)。
文摘To address the issues of unknown target size,blurred edges,background interference and low contrast in infrared small target detection,this paper proposes a method based on density peaks searching and weighted multi-feature local difference.Firstly,an improved high-boost filter is used for preprocessing to eliminate background clutter and high-brightness interference,thereby increasing the probability of capturing real targets in the density peak search.Secondly,a triple-layer window is used to extract features from the area surrounding candidate targets,addressing the uncertainty of small target sizes.By calculating multi-feature local differences between the triple-layer windows,the problems of blurred target edges and low contrast are resolved.To balance the contribution of different features,intra-class distance is used to calculate weights,achieving weighted fusion of multi-feature local differences to obtain the weighted multi-feature local differences of candidate targets.The real targets are then extracted using the interquartile range.Experiments on datasets such as SIRST and IRSTD-IK show that the proposed method is suitable for various complex types and demonstrates good robustness and detection performance.
基金supported by the National Natural Science Foundation of China(Nos.32171789,32211530031,12411530088)the National Key Research and Development Program of China(No.2023YFF1303901)+2 种基金the Joint Open Funded Project of State Key Laboratory of Geo-Information Engineering and Key Laboratory of the Ministry of Natural Resources for Surveying and Mapping Science and Geo-spatial Information Technology(2022-02-02)Background Resources Survey in Shennongjia National Park(SNJNP2022001)the Open Project Fund of Hubei Provincial Key Laboratory for Conservation Biology of Shennongjia Snub-nosed Monkeys(SNJGKL2022001).
文摘Terrestrial laser scanning(TLS)accurately captures tree structural information and provides prerequisites for treescale estimations of forest biophysical attributes.Quantifying tree-scale attributes from TLS point clouds requires segmentation,yet the occlusion effects severely affect the accuracy of automated individual tree segmentation.In this study,we proposed a novel method using ellipsoid directional searching and point compensation algorithms to alleviate occlusion effects.Firstly,region growing and point compensation algorithms are used to determine the location of tree roots.Secondly,the neighbor points are extracted within an ellipsoid neighborhood to mitigate occlusion effects compared with k-nearest neighbor(KNN).Thirdly,neighbor points are uniformly subsampled by the directional searching algorithm based on the Fibonacci principle in multiple spatial directions to reduce memory consumption.Finally,a graph describing connectivity between a point and its neighbors is constructed,and it is utilized to complete individual tree segmentation based on the shortest path algorithm.The proposed method was evaluated on a public TLS dataset comprising six forest plots with three complexity categories in Evo,Finland,and it reached the highest mean accuracy of 77.5%,higher than previous studies on tree detection.We also extracted and validated the tree structure attributes using manual segmentation reference values.The RMSE,RMSE%,bias,and bias%of tree height,crown base height,crown projection area,crown surface area,and crown volume were used to evaluate the segmentation accuracy,respectively.Overall,the proposed method avoids many inherent limitations of current methods and can accurately map canopy structures in occluded complex forest stands.
基金The National Natural Science Foundation of China(No.60573127), Specialized Research Fund for the Doctoral Program of Higher Education (No.20040533036).
文摘In consideration of the limitation of super-peer overlay network, the semantic information was introduced into the super-peers＇ organization. A novel P2P （peer-to-peer） searching model, SSP2P, was put forward. The peers in the model were organized in a natural area autonomy system （AAS） based on the smallworld theory. A super-peer was selected in each AAS based on power law; and all the super-peers formed different super-peer semantic networks. Thus, a hierarchical super-peer overlay network was formed. The results show that the model reduces the communication cost and enhances the search efficiency while ensuring the system expansibility. It proves that the introduction of semantic information in the construction of a super-peer overlay is favorable to P2P system capability.
基金The National Natural Science Foundation of China(No60573089)the Natural Science Foundation of Liaoning Province(No20052031)the National High Technology Research and Develop-ment Program of China (863Program)(No2006AA09Z139)
文摘Distributed data sources which employ taxonomy hierarchy to describe the contents of their objects are considered, and a super-peer-based semantic overlay network （SSON） is proposed for sharing and searching their data objects. In SSON, peers are dynamically clustered into many semantic clusters based on the semantics of their data objects and organized in the semantic clusters into a semantic overlay network. Each semantic cluster consists of a super-peer and more peers, and is only responsible for answering queries in its semantic subspace. A query is first routed to the appropriate semantic clusters by an efficient searching algorithm, and then it is forwarded to the specific peers that hold the relevant data objects. Experimental results indicate that SSON has good scalability and achieves a competitive trade-off between search efficiency and costs.
基金supported by Specialized Research Fund for the Doctoral Program of Higher Education of China(20110022120004)the Fundamental Research Funds for the Central Universities
文摘For density inversion of gravity anomaly data, once the inversion method is determined, the main factors affecting the inversion result are the inversion parameters and subdivision scheme. A set of reasonable inversion parameters and subdivision scheme can, not only improve the inversion process efficiency, but also ensure inversion result accuracy. The gravity inversion method based on correlation searching and the golden section algorithm is an effective potential field inversion method. It can be used to invert 2D and 3D physical properties with potential data observed on flat or rough surfaces. In this paper, we introduce in detail the density inversion principles based on correlation searching and the golden section algorithm. Considering that the gold section algorithm is not globally optimized. we present a heuristic method to ensure the inversion result is globally optimized. With a series of model tests, we systematically compare and analyze the inversion result efficiency and accuracy with different parameters. Based on the model test results, we conclude the selection principles for each inversion parameter with which the inversion accuracy can be obviously improved.
文摘Information searching competence is now playing an increasingly indispensable role in the translation process with the booming information technology in the big data era. Resorting to information tools such as E-dictionaries, search engines, online encyclopedia and corpus, translators can pinpoint the exact meaning of unfamiliar words or expressions, terminologies and jargons, become acquainted with relevant background knowledge and result in the most appropriate translation versions by searching and comparing corpus available. In this way errors and inaccuracies will be controlled and to some extent avoided. This paper mainly discusses how to develop during the translation process such a competence in searching specific and to-the-point information as is a vital component in the package of translation competences.
文摘We present the design and performance of a home-built scanning tunneling microscope （STM）, which is compact （66 mm tall and 25 mm in diameter）, yet equipped with a 3D atomic precision piezoelectric motor in which the Z coarse approach relies on a high simplic-ity friction-type walker （of our own invention） driven by an axially cut piezoelectric tube. The walker is vertically inserted in a piezoelectric scanner tube （PST） with its brim laying at on the PST end as the inertial slider （driven by the PST） for the XZ （sample plane） motion. The STM is designed to be capable of searching rare microscopic targets （defects, dopants, boundaries, nano-devices, etc.） in a macroscopic sample area （square millimeters） under extreme conditions （low temperatures, strong magnetic elds, etc.） in which it ts. It gives good atomic resolution images after scanning a highly oriented pyrolytic graphite sample in air at room temperature.
基金supported by the National Natural Science Foundation of China(6127125061571460)
文摘A hybrid carrier（HC） scheme based on weighted-type fractional Fourier transform（WFRFT） has been proposed recently.While most of the works focus on HC scheme＇s inherent characteristics, little attention is paid to the WFRFT modulation recognition.In this paper, a new theory is provided to recognize the WFRFT modulation based on higher order cumulants（HOC）. First, it is deduced that the optimal WFRFT received order can be obtained through the minimization of 4 th-order cumulants, C_（42）. Then, a combinatorial searching algorithm is designed to minimize C_（42）.Finally, simulation results show that the designed scheme has a high recognition rate and the combinatorial searching algorithm is effective and reliable.
基金supported by Zhejiang Provincial Key Laboratory of Communication Networks and Applications and National Natural Science Foundation of China under Grant No.60872020
文摘In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.
文摘Artificial Searching Swarm Algorithm (ASSA) is a new optimization algorithm. ASSA simulates the soldiers to search an enemy’s important goal, and transforms the process of solving optimization problem into the process of searching optimal goal by searching swarm with set rules. This work selects complicated and highn dimension functions to deeply analyse the performance for unconstrained and constrained optimization problems and the results produced by ASSA, Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Fish-Swarm Algorithm (AFSA) have been compared. The main factors which influence the performance of ASSA are also discussed. The results demonstrate the effectiveness of the proposed ASSA optimization algorithm.
基金Project(50579101) supported by the National Natural Science Foundation of China
文摘To evaluate the credit risk of customers in power market precisely, the new chaotic searching and fuzzy neural network (FNN) hybrid algorithm were proposed. By combining with the chaotic searching, the learning ability of the FNN was markedly enhanced. Customers’ actual credit flaw data of power supply enterprises were collected to carry on the real evaluation, which can be treated as example for the model. The result shows that the proposed method surpasses the traditional statistical models in regard to the precision of forecasting and has a practical value. Compared with the results of ordinary FNN and ANN, the precision of the proposed algorithm can be enhanced by 2.2% and 4.5%, respectively.
文摘Two deficiencies in traditional iterative closest pointsimultaneous localization and mapping( ICP-SLAM) usually result in poor real-time performance. On one hand, relative position between current scan frame and global map cannot be previously known. As a result, ICP algorithm will take much amount of iterations to reach convergence. On the other hand,establishment of correspondence is done by global searching, which requires enormous computational time. To overcome the two problems,a fast ICP-SLAM with rough alignment and narrowing-scale nearby searching is proposed. As for the decrease of iterative times,rough alignment based on initial pose matrix is proposed. In detail,initial pose matrix is obtained by micro-electro-mechanical system( MEMS) magnetometer and global landmarks. Then rough alignment will be applied between current scan frame and global map at the beginning of ICP algorithm with initial pose matrix. As for accelerating the establishment of correspondence, narrowingscale nearby searching with dynamic threshold is proposed,where match-points are found within a progressively constrictive range.Compared to traditional ICP-SLAM,the experimental results show that the amount of iteration for ICP algorithm to reach convergence reduces to 92. 34% and ICP algorithm runtime reduces to 98. 86% on average. In addition,computational cost is kept in a stable level due to the eliminating of the accumulation of computational consumption. Moreover,great improvement can also been achieved in SLAM quality and robustness.
基金the National High Technology Research and Development Program(863) of China(No.2009AAA042221)Shanghai Sciences&Technology Committee(No.11111100302)
文摘An independently developed mobile welding robot system is introduced. Kinematics model is the base of robot planning. With the Denavit-Hartenberg method, robot kinematics equation can be gotten. The robot welding torch inclination angle consists of the working and moving angles. According to the kinematics model,both the two angles and torch position can be calculated. Under special moving angle, a two-step algorithm is used to obtain the optimal manipulator posture. The calculation result shows that the algorithm has high precision.
基金supported by National Natural Science Foundation of China under Grants No.61171104
文摘To overcome imperfection of exhaustive based beam searching scheme in IEEE 802.15.3c and IEEE 802.11 ad and accelerate the beam training process, combined with the fast beam searching algorithm previously proposed, this paper proposed a beam codebook design scheme for phased array to not only satisfy the fast beam searching algorithm's demand, but also make good use of the advantage of the searching algorithm. The simulation results prove that the proposed scheme not only performs well on flexibility and searching time complexity, but also has high success ratio.
基金the National Natural Science Foundation of China (60773065).
文摘The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.
文摘A quantum image searching method is proposed based on the probability distributions of the readouts from the quantum measurements. It is achieved by using low computational resources which are only a single Hadamard gate combined with m + 1 quantum measurement operations. To validate the proposed method, a simulation experiment is used where the image with the highest similarity value of 0.93 to the particular test image is retrieved as the search result from 4 × 4 binary image database. The proposal provides a basic step for designing a search engine on quantum computing devices where the image in the database is retrieved based on its similarity to the test image.
基金21st Century Education Revitalization Project (No.301703201).
文摘A novel idea,called the optimal shape subspace （OSS） is first proposed for optimizing active shape model （ASM） search.It is constructed from the principal shape subspace and the principal shape variance subspace.It allows the reconstructed shape to vary more than that reconstructed in the standard ASM shape space,hence it is more expressive in representing shapes in real life.Then a cost function is developed,based on a study on the search process.An optimal searching method using the feedback information provided by the evaluation cost is proposed to improve the performance of ASM alignment.Experimental results show that the proposed OSS can offer the maximum shape variation with reserving the principal information and a unique local optimal shape is acquired after optimal searching.The combination of OSS and optimal searching can improve the ASM performance greatly.
文摘Considering the characteristics of spatial straightness error, this paper puts forward a kind of evaluation method of spatial straightness error using Geometric Approximation Searching Algorithm (GASA). According to the minimum condition principle of form error evaluation, the mathematic model and optimization objective of the GASA are given. The algorithm avoids the optimization and linearization, and can be fulfilled in three steps. First construct two parallel quadrates based on the preset two reference points of the spatial line respectively;second construct centerlines by connecting one quadrate each vertices to another quadrate each vertices;after that, calculate the distances between measured points and the constructed centerlines. The minimum zone straightness error is obtained by repeating comparing and reconstructing quadrates. The principle and steps of the algorithm to evaluate spatial straightness error is described in detail, and the mathematical formula and program flowchart are given also. Results show that this algorithm can evaluate spatial straightness error more effectively and exactly.
基金Project supported by the National Oommission of Defense Science and Technotocjy(No.Y96-10)
文摘This paper discusses the approaches for automatical searching of control points in the NOAA AVHRR image on the basis of data rearrangement in the form of latitude and longitude grid. The vegetation index transformation and multi-level matching strategies have been proven effective and successful as the experiments show while the control point database is established.
