Ground-based interferometric synthetic aperture radar(GB-InSAR)can take deformation measurement with a high accuracy.Partition of the GB-InSAR deformation map benefits analyzing the deformation state of the monitoring...Ground-based interferometric synthetic aperture radar(GB-InSAR)can take deformation measurement with a high accuracy.Partition of the GB-InSAR deformation map benefits analyzing the deformation state of the monitoring scene better.Existing partition methods rely on labelled datasets or single deformation feature,and they cannot be effectively utilized in GBInSAR applications.This paper proposes an improved partition method of the GB-InSAR deformation map based on dynamic time warping(DTW)and k-means.The DTW similarities between a reference point and all the measurement points are calculated based on their time-series deformations.Then the DTW similarity and cumulative deformation are taken as two partition features.With the k-means algorithm and the score based on multi evaluation indexes,a deformation map can be partitioned into an appropriate number of classes.Experimental datasets of West Copper Mine are processed to validate the effectiveness of the proposed method,whose measurement points are divided into seven classes with a score of 0.3151.展开更多
This paper provides a functional equation astisfied by the generating function for enumerating rooted loopless planar maps with vertex partition. A kind of applications in enumerating, by providing explicit formulae, ...This paper provides a functional equation astisfied by the generating function for enumerating rooted loopless planar maps with vertex partition. A kind of applications in enumerating, by providing explicit formulae, a type of rooted loopless planar maps with the maximum valency of vertices given are described. Meanwhile, the functional equation for enumerating rooted loopless planar maps (connected) with the edge number and the valency of root-vertex as the parameters is also derived directly.展开更多
The functional equation satisfied by the vertex partition function of rooted loopless Eulerianplanar maps is provided. As applications, the enumerating equations for general and regular casesof this kind of maps are a...The functional equation satisfied by the vertex partition function of rooted loopless Eulerianplanar maps is provided. As applications, the enumerating equations for general and regular casesof this kind of maps are also discussed.展开更多
We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same dest...We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same destination. Given n tasks with assigned consume-time and profit, it may also be viewed as a maximization of every processor＇s average profit. Further, we propose a new kind of partition problem in fractional form and analyze its computational complexity. By regarding fractional partition as a special case, we prove that the average profit maximization problem is NP-hard when the number of processors is fixed and it is strongly NP- hard in general. At last, a pseudo-polynomial time algorithm for the average profit maximization problem and the fractional partition problem is presented, using the idea of the pseudo-polynomial time algorithm for the classical partition problem.展开更多
基金supported by the National Natural Science Foundation of China(61971037,61960206009,61601031)the Natural Science Foundation of Chongqing,China(cstc2020jcyj-msxm X0608,cstc2020jcyj-jq X0008)。
文摘Ground-based interferometric synthetic aperture radar(GB-InSAR)can take deformation measurement with a high accuracy.Partition of the GB-InSAR deformation map benefits analyzing the deformation state of the monitoring scene better.Existing partition methods rely on labelled datasets or single deformation feature,and they cannot be effectively utilized in GBInSAR applications.This paper proposes an improved partition method of the GB-InSAR deformation map based on dynamic time warping(DTW)and k-means.The DTW similarities between a reference point and all the measurement points are calculated based on their time-series deformations.Then the DTW similarity and cumulative deformation are taken as two partition features.With the k-means algorithm and the score based on multi evaluation indexes,a deformation map can be partitioned into an appropriate number of classes.Experimental datasets of West Copper Mine are processed to validate the effectiveness of the proposed method,whose measurement points are divided into seven classes with a score of 0.3151.
基金This research was partially supported by the U. S. National Science Foundation under Grant Number ECS 85-03212 and by the National Natural Science Foundation of China as well. And, it was completed during the author's stay at RUTCOR, The State Univerity
文摘This paper provides a functional equation astisfied by the generating function for enumerating rooted loopless planar maps with vertex partition. A kind of applications in enumerating, by providing explicit formulae, a type of rooted loopless planar maps with the maximum valency of vertices given are described. Meanwhile, the functional equation for enumerating rooted loopless planar maps (connected) with the edge number and the valency of root-vertex as the parameters is also derived directly.
基金This project is supported partially by the National Natural Science Foundation of China Grant 18971061
文摘The functional equation satisfied by the vertex partition function of rooted loopless Eulerianplanar maps is provided. As applications, the enumerating equations for general and regular casesof this kind of maps are also discussed.
基金Supported by Daqing oilfield company Project of PetroCHINA under Grant (dqc-2010-xdgl-ky-002)Key Laboratory of Management, Decision and Information Systems, Chinese Academy of SciencesBeijing Research Center of Urban System Engineering
文摘We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same destination. Given n tasks with assigned consume-time and profit, it may also be viewed as a maximization of every processor＇s average profit. Further, we propose a new kind of partition problem in fractional form and analyze its computational complexity. By regarding fractional partition as a special case, we prove that the average profit maximization problem is NP-hard when the number of processors is fixed and it is strongly NP- hard in general. At last, a pseudo-polynomial time algorithm for the average profit maximization problem and the fractional partition problem is presented, using the idea of the pseudo-polynomial time algorithm for the classical partition problem.
