This paper studies the parameter estimation problems of the nonlinear systems described by the bilinear state space models in the presence of disturbances.A bilinear state observer is designed for deriving identificat...This paper studies the parameter estimation problems of the nonlinear systems described by the bilinear state space models in the presence of disturbances.A bilinear state observer is designed for deriving identification algorithms to estimate the state variables using the input-output data.Based on the bilinear state observer,a novel gradient iterative algorithm is derived for estimating the parameters of the bilinear systems by means of the continuous mixed p-norm cost function.The gain at each iterative step adapts to the data quality so that the algorithm has good robustness to the noise disturbance.Furthermore,to improve the performance of the proposed algorithm,a dynamicmoving window is designed which can update the dynamical data by removing the oldest data and adding the newestmeasurement data.A numerical example of identification of bilinear systems is presented to validate the theoretical analysis.展开更多
An integrated framework is presented to represent and classify process data for on-line identifying abnormal operating conditions. It is based on pattern recognition principles and consists of a feature extraction ste...An integrated framework is presented to represent and classify process data for on-line identifying abnormal operating conditions. It is based on pattern recognition principles and consists of a feature extraction step, by which wavelet transform and principal component analysis are used to capture the inherent characteristics from process measurements, followed by a similarity assessment step using hidden Markov model (HMM) for pattern comparison. In most previous cases, a fixed-length moving window was employed to track dynamic data, and often failed to capture enough information for each fault and sometimes even deteriorated the diagnostic performance. A variable moving window, the length of which is modified with time, is introduced in this paper and case studies on the Tennessee Eastman process illustrate the potential of the proposed method.展开更多
Online monitoring of chemical process performance is extremely important to ensure the safety of a chemical plant and consistently high quality of products. Multivariate statistical process control has found wide appl...Online monitoring of chemical process performance is extremely important to ensure the safety of a chemical plant and consistently high quality of products. Multivariate statistical process control has found wide applications in process performance analysis, monitoring and fault diagnosis using existing rich historical database.In this paper, we propose a simple and straight forward multivariate statistical modeling based on a moving window MPCA (multiway principal component analysis) model along the time and batch axis for adaptive monitoring the progress of batch processes in real-time. It is an extension to minimum window MPCA and traditional MPCA.The moving window MPCA along the batch axis can copy seamlessly with variable run length and does not need to estimate any deviations of the ongoing batch from the average trajectories. It replaces an invariant fixed-model monitoring approach with adaptive updating model data structure within batch-to-batch, which overcomes the changing operation condition and slows time-varying behaviors of industrial processes. The software based on moving window MPCA has been successfully applied to the industrial polymerization reactor of polyvinyl chloride (PVC) process in the Jinxi Chemical Company of China since 1999.展开更多
In order to improve the adaptability of the quadruped robot in complex environments,a path planning method based on sliding window and variant A* algorithm for quadruped robot is presented. To improve the path plannin...In order to improve the adaptability of the quadruped robot in complex environments,a path planning method based on sliding window and variant A* algorithm for quadruped robot is presented. To improve the path planning efficiency and robot security,an incremental A* search algorithm( IA*) and the A* algorithm having obstacle grids extending( EA*) are proposed respectively. The IA* algorithm firstly searches an optimal path based on A* algorithm,then a new route from the current path to the new goal projection is added to generate a suboptimum route incrementally. In comparison with traditional method solving path planning problem from scratch,the IA* enables the robot to plan path more efficiently. EA* extends the obstacle by means of increasing grid g-value,which makes the route far away from the obstacle and avoids blocking the narrow passage. To navigate the robot running smoothly,a quadratic B-spline interpolation is applied to smooth the path.Simulation results illustrate that the IA* algorithm can increase the re-planning efficiency more than 5 times and demonstrate the effectiveness of the EA* algorithm.展开更多
Frequency modulated continuous wave(FMCW)radar is an advantageous sensor scheme for target estimation and environmental perception.However,existing algorithms based on discrete Fourier transform(DFT),multiple signal c...Frequency modulated continuous wave(FMCW)radar is an advantageous sensor scheme for target estimation and environmental perception.However,existing algorithms based on discrete Fourier transform(DFT),multiple signal classification(MUSIC)and compressed sensing,etc.,cannot achieve both low complexity and high resolution simultaneously.This paper proposes an efficient 2-D MUSIC algorithm for super-resolution target estimation/tracking based on FMCW radar.Firstly,we enhance the efficiency of 2-D MUSIC azimuth-range spectrum estimation by incorporating 2-D DFT and multi-level resolution searching strategy.Secondly,we apply the gradient descent method to tightly integrate the spatial continuity of object motion into spectrum estimation when processing multi-epoch radar data,which improves the efficiency of continuous target tracking.These two approaches have improved the algorithm efficiency by nearly 2-4 orders of magnitude without losing accuracy and resolution.Simulation experiments are conducted to validate the effectiveness of the algorithm in both single-epoch estimation and multi-epoch tracking scenarios.展开更多
Transition zone or ecotone is a unique community sandwiched between two communities/ecosystems/biomes.These ecotones in Himalaya remained unexplored for many ecological aspects like biodiversity,phyto-sociology,bounda...Transition zone or ecotone is a unique community sandwiched between two communities/ecosystems/biomes.These ecotones in Himalaya remained unexplored for many ecological aspects like biodiversity,phyto-sociology,boundary detection and even impact of change in land use pattern(anthropogenic activity).The most accepted and widespread technique called as Moving Split Window(MSW) technique is used for detection of vegetation and environmental boundaries at four different sites in the lesser stratum of north-west Himalaya.All the four sites were at different distances from the nearest human inhabited area.Anthropogenic activities like grazing,herb collection,wood collection etc.were common at proximal sites.Such activities have led to the change in land use pattern.In this study,we have tried to work out the impact of the change in land use pattern(human interference) on the vegetation and basic environmental parameters like soil pH,electrical conductivity and moisture on forestgrassland ecotone in north-west Himalaya.Data on mountain steepness was also collected and analyzed.The dissimilarity profile using the statistical tool Squared Euclidian Distance(SED) indicated that species turnover locations increase with the increase in distance of ecotones from human settlements.The ecotones at distant locations from human villages are characterized with blunt as well as sharp peaks for vegetation data,however,conditions are reverse in case of the proximal sites.The study also reveals that as the distance between the ecotone and human settlements increases,the complex conditions like multiple vegetation boundaries prevails on the transitions.In this regard,land use induced blurring of forest-grassland transition in north-west Himalaya is summed up in the study.展开更多
Cloud detection and classification form a basis in weather analysis. Split window algorithm (SWA) is one of the simple and matured algorithms used to detect and classify water and ice clouds in the atmosphere using sa...Cloud detection and classification form a basis in weather analysis. Split window algorithm (SWA) is one of the simple and matured algorithms used to detect and classify water and ice clouds in the atmosphere using satellite data. The recent availability of Himawari-8 data has considerably strengthened the possibility of better cloud classification owing to its enhanced multi-band configuration as well as high temporal resolution. In SWA, cloud classification is attained by considering the spatial distributions of the brightness temperature (BT) and brightness temperature difference (BTD) of thermal infrared bands. In this study, we compare unsupervised classification results of SWA using the band pair of band 13 and 15 (SWA13-15, 10 and 12 μm bands), versus that of band 15 and 16 (SWA15-16, 12 and 13 μm bands) over the Japan area. Different threshold values of BT and BTD are chosen in winter and summer seasons to categorize cloud regions into nine different types. The accuracy of classification is verified by using the cloud-top height information derived from the data of Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO). For this purpose, six different paths of the space-borne lidar are selected in both summer and winter seasons, on the condition that the time span of overpass falls within the time ranges between 01:00 and 05:00 UTC, which corresponds to the local time around noon. The result of verification indicates that the classification based on SWA13-15 can detect more cloud types as compared with that based on SWA15-16 in both summer and winter seasons, though the latter combination is useful for delineating cumulonimbus underneath dense cirrus展开更多
In order to improve measurement accuracy of moving target signals, an automatic target recognition model of moving target signals was established based on empirical mode decomposition(EMD) and support vector machine(S...In order to improve measurement accuracy of moving target signals, an automatic target recognition model of moving target signals was established based on empirical mode decomposition(EMD) and support vector machine(SVM). Automatic target recognition process on the nonlinear and non-stationary of Doppler signals of military target by using automatic target recognition model can be expressed as follows. Firstly, the nonlinearity and non-stationary of Doppler signals were decomposed into a set of intrinsic mode functions(IMFs) using EMD. After the Hilbert transform of IMF, the energy ratio of each IMF to the total IMFs can be extracted as the features of military target. Then, the SVM was trained through using the energy ratio to classify the military targets, and genetic algorithm(GA) was used to optimize SVM parameters in the solution space. The experimental results show that this algorithm can achieve the recognition accuracies of 86.15%, 87.93%, and 82.28% for tank, vehicle and soldier, respectively.展开更多
This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the leng...This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the length of the pattern, allowing multiple alignments in the searching process. The text is divided into two parts;each part is scanned from both sides simultaneously using two sliding windows. The four windows slide in parallel in both parts of the text. The comparisons done between the text and the pattern are done from both of the pattern sides in parallel. The conducted experiments show that FSW achieves the best overall results in the number of attempts and the number of character comparisons compared to the pattern matching algorithms: Two Sliding Windows (TSW), Enhanced Two Sliding Windows algorithm (ETSW) and Berry-Ravindran algorithm (BR). The best time case is calculated and found to be??while the average case time complexity is??.展开更多
The path planning problem of complex wild environment with multiple elements still poses challenges.This paper designs an algorithm that integrates global and local planning to apply to the wild environmental path pla...The path planning problem of complex wild environment with multiple elements still poses challenges.This paper designs an algorithm that integrates global and local planning to apply to the wild environmental path planning.The modeling process of wild environment map is designed.Three optimization strategies are designed to improve the A-Star in overcoming the problems of touching the edge of obstacles,redundant nodes and twisting paths.A new weighted cost function is designed to achieve different planning modes.Furthermore,the improved dynamic window approach(DWA)is designed to avoid local optimality and improve time efficiency compared to traditional DWA.For the necessary path re-planning of wild environment,the improved A-Star is integrated with the improved DWA to solve re-planning problem of unknown and moving obstacles in wild environment with multiple elements.The improved fusion algorithm effectively solves problems and consumes less time,and the simulation results verify the effectiveness of improved algorithms above.展开更多
The urban-rural integrated area in Sanshui District of Foshan City was selected for research, and the impact of landscape pattern around the No.269 provincial highway was analyzed based on the land-use data in 2014 us...The urban-rural integrated area in Sanshui District of Foshan City was selected for research, and the impact of landscape pattern around the No.269 provincial highway was analyzed based on the land-use data in 2014 using the spatial analysis in GIS and the moving window method. The results showed that:(1) within the scope of a 2 km-range buffer zone, with a low degree of heterogeneity, land for construction use and water area were the dominant land-use types, while with a high degree of fragmentation, cultivated land, wooded land, grassland, garden land, land for other farm uses, and land unused were scattered;(2) the 250-m square moving window could well detect the change characteristics of landscape pattern on both sides of the road;(3) the gradient analysis of landscape pattern in urban-rural integrated area, which was conducted with the aid of a 750-m transect on both sides of the road, indicated that there were significant differences between landscape indexes both in the urban-rural integrated area and on both sides of the road;(4) the road that had an obvious cutting and fragmentation impact on the landscape was an important factor leading to the increasing fragmentation and heterogeneity to regional landscapes.展开更多
This study attempts to solve vehicle routing problem with time window (VRPTW). The study first identifies the real problems and suggests some recommendations on the issues. The technique used in this study is Genetic ...This study attempts to solve vehicle routing problem with time window (VRPTW). The study first identifies the real problems and suggests some recommendations on the issues. The technique used in this study is Genetic Algorithm (GA) and initialization applied is random population method. The objective of the study is to assign a number of vehicles to routes that connect customers and depot such that the overall distance travelled is minimized and the delivery operations are completed within the time windows requested by the customers. The analysis reveals that the problems experienced in vehicle routing with time window can be solved by GA and retrieved for optimal solutions. After a thorough study on VRPTW, it is highly recommended that a company should implement the optimal routes derived from the study to increase the efficiency and accuracy of delivery with time insertion.展开更多
This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the ...This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.展开更多
Partial least squares discriminant analysis (PLS-DA) with integrated moving-window (MW) waveband screening was applied to the discriminant analysis of liquor brands with near-infrared (NIR) spectroscopy. Luzhou Laojia...Partial least squares discriminant analysis (PLS-DA) with integrated moving-window (MW) waveband screening was applied to the discriminant analysis of liquor brands with near-infrared (NIR) spectroscopy. Luzhou Laojiao, a popular liquor with strong fragrant flavor, was used as the identified liquor brand (160 samples, negative, 52 vol alcoholicity). Liquors of 10 other brands with strong fragrant flavor were used as the interferential brands (200 samples, positive, 52 vol alcoholicity). The Kennard-Stone algorithm was used for the division of modeling samples to achieve uniformity and representativeness. Based on the MW-PLS-DA, a simplified optimal model set with 157 wavebands was further proposed. This set contained five types of wavebands corresponding to the NIR absorption bands of water, ethanol, and other micronutrients (i.e., acids, aldehydes, phenols, and aromatic compounds) in liquor for practical choice. Using five selected simple models with 4775 - 4239, 7804 - 6569, 6264 - 5844, 9435 - 7896, and 12066 - 10373 cm-1, the validation recognition rates were obtained as 99.3% or higher. Results show good prediction performance and low model complexity, and also provided a valuable reference for designing small dedicated instruments. The proposed method is a promising tool for large-scale inspection of liquor food safety.展开更多
Aim to the manufacturing supply chain optimization problem with time windows,presents an improved orthogonal genetic algorithm to solve it. At first,we decompose this problem into two sub-problems (distribution and ro...Aim to the manufacturing supply chain optimization problem with time windows,presents an improved orthogonal genetic algorithm to solve it. At first,we decompose this problem into two sub-problems (distribution and routing) plus an interface mechanism to allow the two algorithms to collaborate in a master-slave fashion,with the distribution algorithm driving the routing algorithm. At second,we describe the proposed improved orthogonal genetic algorithm for solving giving problem detailedly. Finally,the examples suggest that this proposed approach is feasible,correct and valid.展开更多
In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function...In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function . For each node , a time window ?within which the node may be visited and ?, is non-negative of the service and leaving time of the node. A source node s, a destination node d and a departure time?t0, the time-dependent shortest path problem with time windows asks to find an s, d-path that leaves a source node s at a departure time t0;and minimizes the total arrival time at a destination node d. This formulation generalizes the classical shortest path problem in which ce are constants. Our algorithm of the time windows gave the generalization of the ALT algorithm and A* algorithm for the classical problem according to Goldberg and Harrelson [1], Dreyfus [2] and Hart et al. [3].展开更多
A novel genetic algorithm with multiple species in dynamic region is proposed,each of which occupies a dynamic region determined by the weight vector of a fuzzy adaptive Hamming neural network. Through learning and cl...A novel genetic algorithm with multiple species in dynamic region is proposed,each of which occupies a dynamic region determined by the weight vector of a fuzzy adaptive Hamming neural network. Through learning and classification of genetic individuals in the evolutionary procedure,the neural network distributes multiple species into different regions of the search space. Furthermore,the neural network dynamically expands each search region or establishes new region for good offspring individuals to continuously keep the diversification of the genetic population. As a result,the premature problem inherent in genetic algorithm is alleviated and better tradeoff between the ability of exploration and exploitation can be obtained. The experimental results on the vehicle routing problem with time windows also show the good performance of the proposed genetic algorithm.展开更多
The pricing of moving window Asian option with an early exercise feature is considered a challenging problem in option pricing. The computational challenge lies in the unknown optimal exercise strategy and in the high...The pricing of moving window Asian option with an early exercise feature is considered a challenging problem in option pricing. The computational challenge lies in the unknown optimal exercise strategy and in the high dimensionality required for approximating the early exercise boundary. We use sparse grid basis functions in the Least Squares Monte Carlo approach to solve this “curse of dimensionality” problem. The resulting algorithm provides a general and convergent method for pricing moving window Asian options. The sparse grid technique presented in this paper can be generalized to pricing other high-dimensional, early-exercisable derivatives.展开更多
A snake algorithm has been known that it has a strong point in extracting the exact contour of an object. But it is apt to be influenced by scattered edges around the control points. Since the shape of a moving object...A snake algorithm has been known that it has a strong point in extracting the exact contour of an object. But it is apt to be influenced by scattered edges around the control points. Since the shape of a moving object in 2D image changes a lot due to its rotation and translation in the 3D space, the conventional algorithm that takes into account slowly moving objects cannot provide an appropriate solution. To utilize the advantages of the snake algorithm while minimizing the drawbacks, this paper proposes the area variation based color snake algorithm for moving object tracking. The proposed algorithm includes a new energy term which is used for preserving the shape of an object between two consecutive images. The proposed one can also segment precisely interesting objects on complex image since it is based on color information. Experiment results show that the proposed algorithm is very effective in various environments.展开更多
基金funded by the National Natural Science Foundation of China(No.61773182)the 111 Project(B12018).
文摘This paper studies the parameter estimation problems of the nonlinear systems described by the bilinear state space models in the presence of disturbances.A bilinear state observer is designed for deriving identification algorithms to estimate the state variables using the input-output data.Based on the bilinear state observer,a novel gradient iterative algorithm is derived for estimating the parameters of the bilinear systems by means of the continuous mixed p-norm cost function.The gain at each iterative step adapts to the data quality so that the algorithm has good robustness to the noise disturbance.Furthermore,to improve the performance of the proposed algorithm,a dynamicmoving window is designed which can update the dynamical data by removing the oldest data and adding the newestmeasurement data.A numerical example of identification of bilinear systems is presented to validate the theoretical analysis.
基金Supported by National High-Tech Program of China (No. 2001AA413110).
文摘An integrated framework is presented to represent and classify process data for on-line identifying abnormal operating conditions. It is based on pattern recognition principles and consists of a feature extraction step, by which wavelet transform and principal component analysis are used to capture the inherent characteristics from process measurements, followed by a similarity assessment step using hidden Markov model (HMM) for pattern comparison. In most previous cases, a fixed-length moving window was employed to track dynamic data, and often failed to capture enough information for each fault and sometimes even deteriorated the diagnostic performance. A variable moving window, the length of which is modified with time, is introduced in this paper and case studies on the Tennessee Eastman process illustrate the potential of the proposed method.
基金国家重点基础研究发展计划(973计划)，国家自然科学基金，the National Natural Science Foundation of China
文摘Online monitoring of chemical process performance is extremely important to ensure the safety of a chemical plant and consistently high quality of products. Multivariate statistical process control has found wide applications in process performance analysis, monitoring and fault diagnosis using existing rich historical database.In this paper, we propose a simple and straight forward multivariate statistical modeling based on a moving window MPCA (multiway principal component analysis) model along the time and batch axis for adaptive monitoring the progress of batch processes in real-time. It is an extension to minimum window MPCA and traditional MPCA.The moving window MPCA along the batch axis can copy seamlessly with variable run length and does not need to estimate any deviations of the ongoing batch from the average trajectories. It replaces an invariant fixed-model monitoring approach with adaptive updating model data structure within batch-to-batch, which overcomes the changing operation condition and slows time-varying behaviors of industrial processes. The software based on moving window MPCA has been successfully applied to the industrial polymerization reactor of polyvinyl chloride (PVC) process in the Jinxi Chemical Company of China since 1999.
基金Supported by the National Natural Science Foundation of China(No.61233014,61305130,61503153)the National High Technology Research and Development Program of China(No.2015AA042201)+1 种基金the Shandong Provincial Natural Science Foundation(No.ZR2013FQ003,ZR2013EEM027)China Postdoctoral Science Foundation(No.2013M541912)
文摘In order to improve the adaptability of the quadruped robot in complex environments,a path planning method based on sliding window and variant A* algorithm for quadruped robot is presented. To improve the path planning efficiency and robot security,an incremental A* search algorithm( IA*) and the A* algorithm having obstacle grids extending( EA*) are proposed respectively. The IA* algorithm firstly searches an optimal path based on A* algorithm,then a new route from the current path to the new goal projection is added to generate a suboptimum route incrementally. In comparison with traditional method solving path planning problem from scratch,the IA* enables the robot to plan path more efficiently. EA* extends the obstacle by means of increasing grid g-value,which makes the route far away from the obstacle and avoids blocking the narrow passage. To navigate the robot running smoothly,a quadratic B-spline interpolation is applied to smooth the path.Simulation results illustrate that the IA* algorithm can increase the re-planning efficiency more than 5 times and demonstrate the effectiveness of the EA* algorithm.
基金funded by the National Natural Science Foundation of China,grant number 42074176,U1939204。
文摘Frequency modulated continuous wave(FMCW)radar is an advantageous sensor scheme for target estimation and environmental perception.However,existing algorithms based on discrete Fourier transform(DFT),multiple signal classification(MUSIC)and compressed sensing,etc.,cannot achieve both low complexity and high resolution simultaneously.This paper proposes an efficient 2-D MUSIC algorithm for super-resolution target estimation/tracking based on FMCW radar.Firstly,we enhance the efficiency of 2-D MUSIC azimuth-range spectrum estimation by incorporating 2-D DFT and multi-level resolution searching strategy.Secondly,we apply the gradient descent method to tightly integrate the spatial continuity of object motion into spectrum estimation when processing multi-epoch radar data,which improves the efficiency of continuous target tracking.These two approaches have improved the algorithm efficiency by nearly 2-4 orders of magnitude without losing accuracy and resolution.Simulation experiments are conducted to validate the effectiveness of the algorithm in both single-epoch estimation and multi-epoch tracking scenarios.
文摘Transition zone or ecotone is a unique community sandwiched between two communities/ecosystems/biomes.These ecotones in Himalaya remained unexplored for many ecological aspects like biodiversity,phyto-sociology,boundary detection and even impact of change in land use pattern(anthropogenic activity).The most accepted and widespread technique called as Moving Split Window(MSW) technique is used for detection of vegetation and environmental boundaries at four different sites in the lesser stratum of north-west Himalaya.All the four sites were at different distances from the nearest human inhabited area.Anthropogenic activities like grazing,herb collection,wood collection etc.were common at proximal sites.Such activities have led to the change in land use pattern.In this study,we have tried to work out the impact of the change in land use pattern(human interference) on the vegetation and basic environmental parameters like soil pH,electrical conductivity and moisture on forestgrassland ecotone in north-west Himalaya.Data on mountain steepness was also collected and analyzed.The dissimilarity profile using the statistical tool Squared Euclidian Distance(SED) indicated that species turnover locations increase with the increase in distance of ecotones from human settlements.The ecotones at distant locations from human villages are characterized with blunt as well as sharp peaks for vegetation data,however,conditions are reverse in case of the proximal sites.The study also reveals that as the distance between the ecotone and human settlements increases,the complex conditions like multiple vegetation boundaries prevails on the transitions.In this regard,land use induced blurring of forest-grassland transition in north-west Himalaya is summed up in the study.
文摘Cloud detection and classification form a basis in weather analysis. Split window algorithm (SWA) is one of the simple and matured algorithms used to detect and classify water and ice clouds in the atmosphere using satellite data. The recent availability of Himawari-8 data has considerably strengthened the possibility of better cloud classification owing to its enhanced multi-band configuration as well as high temporal resolution. In SWA, cloud classification is attained by considering the spatial distributions of the brightness temperature (BT) and brightness temperature difference (BTD) of thermal infrared bands. In this study, we compare unsupervised classification results of SWA using the band pair of band 13 and 15 (SWA13-15, 10 and 12 μm bands), versus that of band 15 and 16 (SWA15-16, 12 and 13 μm bands) over the Japan area. Different threshold values of BT and BTD are chosen in winter and summer seasons to categorize cloud regions into nine different types. The accuracy of classification is verified by using the cloud-top height information derived from the data of Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observations (CALIPSO). For this purpose, six different paths of the space-borne lidar are selected in both summer and winter seasons, on the condition that the time span of overpass falls within the time ranges between 01:00 and 05:00 UTC, which corresponds to the local time around noon. The result of verification indicates that the classification based on SWA13-15 can detect more cloud types as compared with that based on SWA15-16 in both summer and winter seasons, though the latter combination is useful for delineating cumulonimbus underneath dense cirrus
基金Projects(61471370,61401479)supported by the National Natural Science Foundation of China
文摘In order to improve measurement accuracy of moving target signals, an automatic target recognition model of moving target signals was established based on empirical mode decomposition(EMD) and support vector machine(SVM). Automatic target recognition process on the nonlinear and non-stationary of Doppler signals of military target by using automatic target recognition model can be expressed as follows. Firstly, the nonlinearity and non-stationary of Doppler signals were decomposed into a set of intrinsic mode functions(IMFs) using EMD. After the Hilbert transform of IMF, the energy ratio of each IMF to the total IMFs can be extracted as the features of military target. Then, the SVM was trained through using the energy ratio to classify the military targets, and genetic algorithm(GA) was used to optimize SVM parameters in the solution space. The experimental results show that this algorithm can achieve the recognition accuracies of 86.15%, 87.93%, and 82.28% for tank, vehicle and soldier, respectively.
文摘This paper presents an efficient pattern matching algorithm (FSW). FSW improves the searching process for a pattern in a text. It scans the text with the help of four sliding windows. The windows are equal to the length of the pattern, allowing multiple alignments in the searching process. The text is divided into two parts;each part is scanned from both sides simultaneously using two sliding windows. The four windows slide in parallel in both parts of the text. The comparisons done between the text and the pattern are done from both of the pattern sides in parallel. The conducted experiments show that FSW achieves the best overall results in the number of attempts and the number of character comparisons compared to the pattern matching algorithms: Two Sliding Windows (TSW), Enhanced Two Sliding Windows algorithm (ETSW) and Berry-Ravindran algorithm (BR). The best time case is calculated and found to be??while the average case time complexity is??.
基金Industry-University-Research Cooperation Fund Project of the Eighth Research Institute of China Aerospace Science and Technology Corporation(No.USCAST2022-11)。
文摘The path planning problem of complex wild environment with multiple elements still poses challenges.This paper designs an algorithm that integrates global and local planning to apply to the wild environmental path planning.The modeling process of wild environment map is designed.Three optimization strategies are designed to improve the A-Star in overcoming the problems of touching the edge of obstacles,redundant nodes and twisting paths.A new weighted cost function is designed to achieve different planning modes.Furthermore,the improved dynamic window approach(DWA)is designed to avoid local optimality and improve time efficiency compared to traditional DWA.For the necessary path re-planning of wild environment,the improved A-Star is integrated with the improved DWA to solve re-planning problem of unknown and moving obstacles in wild environment with multiple elements.The improved fusion algorithm effectively solves problems and consumes less time,and the simulation results verify the effectiveness of improved algorithms above.
基金Sponsored by National Natural Science Foundation of China(41671160)
文摘The urban-rural integrated area in Sanshui District of Foshan City was selected for research, and the impact of landscape pattern around the No.269 provincial highway was analyzed based on the land-use data in 2014 using the spatial analysis in GIS and the moving window method. The results showed that:(1) within the scope of a 2 km-range buffer zone, with a low degree of heterogeneity, land for construction use and water area were the dominant land-use types, while with a high degree of fragmentation, cultivated land, wooded land, grassland, garden land, land for other farm uses, and land unused were scattered;(2) the 250-m square moving window could well detect the change characteristics of landscape pattern on both sides of the road;(3) the gradient analysis of landscape pattern in urban-rural integrated area, which was conducted with the aid of a 750-m transect on both sides of the road, indicated that there were significant differences between landscape indexes both in the urban-rural integrated area and on both sides of the road;(4) the road that had an obvious cutting and fragmentation impact on the landscape was an important factor leading to the increasing fragmentation and heterogeneity to regional landscapes.
文摘This study attempts to solve vehicle routing problem with time window (VRPTW). The study first identifies the real problems and suggests some recommendations on the issues. The technique used in this study is Genetic Algorithm (GA) and initialization applied is random population method. The objective of the study is to assign a number of vehicles to routes that connect customers and depot such that the overall distance travelled is minimized and the delivery operations are completed within the time windows requested by the customers. The analysis reveals that the problems experienced in vehicle routing with time window can be solved by GA and retrieved for optimal solutions. After a thorough study on VRPTW, it is highly recommended that a company should implement the optimal routes derived from the study to increase the efficiency and accuracy of delivery with time insertion.
基金supported by the National Natural Science Foundation of China (61963022,51665025,61873328)。
文摘This paper addresses the open vehicle routing problem with time window(OVRPTW), where each vehicle does not need to return to the depot after completing the delivery task.The optimization objective is to minimize the total distance. This problem exists widely in real-life logistics distribution process.We propose a hybrid column generation algorithm(HCGA) for the OVRPTW, embedding both exact algorithm and metaheuristic. In HCGA, a label setting algorithm and an intelligent algorithm are designed to select columns from small and large subproblems, respectively. Moreover, a branch strategy is devised to generate the final feasible solution for the OVRPTW. The computational results show that the proposed algorithm has faster speed and can obtain the approximate optimal solution of the problem with 100 customers in a reasonable time.
文摘Partial least squares discriminant analysis (PLS-DA) with integrated moving-window (MW) waveband screening was applied to the discriminant analysis of liquor brands with near-infrared (NIR) spectroscopy. Luzhou Laojiao, a popular liquor with strong fragrant flavor, was used as the identified liquor brand (160 samples, negative, 52 vol alcoholicity). Liquors of 10 other brands with strong fragrant flavor were used as the interferential brands (200 samples, positive, 52 vol alcoholicity). The Kennard-Stone algorithm was used for the division of modeling samples to achieve uniformity and representativeness. Based on the MW-PLS-DA, a simplified optimal model set with 157 wavebands was further proposed. This set contained five types of wavebands corresponding to the NIR absorption bands of water, ethanol, and other micronutrients (i.e., acids, aldehydes, phenols, and aromatic compounds) in liquor for practical choice. Using five selected simple models with 4775 - 4239, 7804 - 6569, 6264 - 5844, 9435 - 7896, and 12066 - 10373 cm-1, the validation recognition rates were obtained as 99.3% or higher. Results show good prediction performance and low model complexity, and also provided a valuable reference for designing small dedicated instruments. The proposed method is a promising tool for large-scale inspection of liquor food safety.
文摘Aim to the manufacturing supply chain optimization problem with time windows,presents an improved orthogonal genetic algorithm to solve it. At first,we decompose this problem into two sub-problems (distribution and routing) plus an interface mechanism to allow the two algorithms to collaborate in a master-slave fashion,with the distribution algorithm driving the routing algorithm. At second,we describe the proposed improved orthogonal genetic algorithm for solving giving problem detailedly. Finally,the examples suggest that this proposed approach is feasible,correct and valid.
文摘In this paper, we present a new algorithm of the time-dependent shortest path problem with time windows. Give a directed graph , where V is a set of nodes, E is a set of edges with a non-negative transit-time function . For each node , a time window ?within which the node may be visited and ?, is non-negative of the service and leaving time of the node. A source node s, a destination node d and a departure time?t0, the time-dependent shortest path problem with time windows asks to find an s, d-path that leaves a source node s at a departure time t0;and minimizes the total arrival time at a destination node d. This formulation generalizes the classical shortest path problem in which ce are constants. Our algorithm of the time windows gave the generalization of the ALT algorithm and A* algorithm for the classical problem according to Goldberg and Harrelson [1], Dreyfus [2] and Hart et al. [3].
文摘A novel genetic algorithm with multiple species in dynamic region is proposed,each of which occupies a dynamic region determined by the weight vector of a fuzzy adaptive Hamming neural network. Through learning and classification of genetic individuals in the evolutionary procedure,the neural network distributes multiple species into different regions of the search space. Furthermore,the neural network dynamically expands each search region or establishes new region for good offspring individuals to continuously keep the diversification of the genetic population. As a result,the premature problem inherent in genetic algorithm is alleviated and better tradeoff between the ability of exploration and exploitation can be obtained. The experimental results on the vehicle routing problem with time windows also show the good performance of the proposed genetic algorithm.
文摘The pricing of moving window Asian option with an early exercise feature is considered a challenging problem in option pricing. The computational challenge lies in the unknown optimal exercise strategy and in the high dimensionality required for approximating the early exercise boundary. We use sparse grid basis functions in the Least Squares Monte Carlo approach to solve this “curse of dimensionality” problem. The resulting algorithm provides a general and convergent method for pricing moving window Asian options. The sparse grid technique presented in this paper can be generalized to pricing other high-dimensional, early-exercisable derivatives.
文摘A snake algorithm has been known that it has a strong point in extracting the exact contour of an object. But it is apt to be influenced by scattered edges around the control points. Since the shape of a moving object in 2D image changes a lot due to its rotation and translation in the 3D space, the conventional algorithm that takes into account slowly moving objects cannot provide an appropriate solution. To utilize the advantages of the snake algorithm while minimizing the drawbacks, this paper proposes the area variation based color snake algorithm for moving object tracking. The proposed algorithm includes a new energy term which is used for preserving the shape of an object between two consecutive images. The proposed one can also segment precisely interesting objects on complex image since it is based on color information. Experiment results show that the proposed algorithm is very effective in various environments.
