An approach to estimate tree height using PolInSAR data constructed by the Sentinel-1 dual-pol SAR data and RVoG model

We estimate tree heights using polarimetric interferometric synthetic aperture radar(PolInSAR)data constructed by the dual-polarization(dual-pol)SAR data and random volume over the ground(RVoG)model.Considering the Sentinel-1 SAR dual-pol(SVV,vertically transmitted and vertically received and SVH,vertically transmitted and horizontally received)configuration,one notes that S_(HH),the horizontally transmitted and horizontally received scattering element,is unavailable.The S_(HH)data were constructed using the SVH data,and polarimetric SAR(PolSAR)data were obtained.The proposed approach was first verified in simulation with satisfactory results.It was next applied to construct PolInSAR data by a pair of dual-pol Sentinel-1A data at Duke Forest,North Carolina,USA.According to local observations and forest descriptions,the range of estimated tree heights was overall reasonable.Comparing the heights with the ICESat-2 tree heights at 23 sampling locations,relative errors of 5 points were within±30%.Errors of 8 points ranged from 30%to 40%,but errors of the remaining 10 points were>40%.The results should be encouraged as error reduction is possible.For instance,the construction of PolSAR data should not be limited to using SVH,and a combination of SVH and SVV should be explored.Also,an ensemble of tree heights derived from multiple PolInSAR data can be considered since tree heights do not vary much with time frame in months or one season.

Urban Big Data and the Development of City Intelligence

This study provides a definition for urban big data while exploring its features and applications of Chi- na＇s city intelligence. The differences between city intelligence in China and the ＂smart city＂ concept in other countries are compared to highlight and contrast the unique definition and model for China＇s city intelligence in this paper. Furthermore, this paper examines the role of urban big data in city intel- ligence by showing that it not only serves as the cornerstone of this trend as it also plays a core role in the diffusion of city intelligence technology and serves as an inexhaustible resource for the sustained development of city intelligence. This study also points out the challenges of shaping and developing of China＇s urban big data. Considering the supporting and core role that urban big data plays in city intel- ligence, the study then expounds on the key points of urban big data, including infrastructure support, urban governance, public services, and economic and industrial development. Finally, this study points out that the utility of city intelligence as an ideal policy tool for advancing the goals of China＇s urban de- velopment. In conclusion, it is imperative that China make full use of its unique advantages-including using the nation＇s current state of development and resources, geographical advantages, and good hu- man relations-in subjective and objective conditions to promote the development of city intelligence through the proper application of urban big data.

Realtime prediction of hard rock TBM advance rate using temporal convolutional network(TCN)with tunnel construction big data

Real-time dynamic adjustment of the tunnel bore machine(TBM)advance rate according to the rockmachine interaction parameters is of great significance to the adaptability of TBM and its efficiency in construction.This paper proposes a real-time predictive model of TBM advance rate using the temporal convolutional network(TCN),based on TBM construction big data.The prediction model was built using an experimental database,containing 235 data sets,established from the construction data from the Jilin Water-Diversion Tunnel Project in China.The TBM operating parameters,including total thrust,cutterhead rotation,cutterhead torque and penetration rate,are selected as the input parameters of the model.The TCN model is found outperforming the recurrent neural network(RNN)and long short-term memory(LSTM)model in predicting the TBM advance rate with much smaller values of mean absolute percentage error than the latter two.The penetration rate and cutterhead torque of the current moment have significant influence on the TBM advance rate of the next moment.On the contrary,the influence of the cutterhead rotation and total thrust is moderate.The work provides a new concept of real-time prediction of the TBM performance for highly efficient tunnel construction.

AOL4PS:A Large-scale Data Set for Personalized Search

Personalized search is a promising way to improve the quality of Websearch,and it has attracted much attention from both academic and industrial communities.Much of the current related research is based on commercial search engine data,which can not be released publicly for such reasons as privacy protection and information security.This leads to a serious lack of accessible public data sets in this field.The few publicly available data sets have not become widely used in academia because of the complexity of the processing process required to study personalized search methods.The lack of data sets together with the difficulties of data processing has brought obstacles to fair comparison and evaluation of personalized search models.In this paper,we constructed a large-scale data set AOL4 PS to evaluate personalized search methods,collected and processed from AOL query logs.We present the complete and detailed data processing and construction process.Specifically,to address the challenges of processing time and storage space demands brought by massive data volumes,we optimized the process of data set construction and proposed an improved BM25 algorithm.Experiments are performed on AOL4 PS with some classic and state-of-the-art personalized search methods,and the experiment results demonstrate that AOL4 PS can measure the effect of personalized search models.

MICkNN:Multi-Instance Covering kNN Algorithm

Mining from ambiguous data is very important in data mining. This paper discusses one of the tasks for mining from ambiguous data known as multi-instance problem. In multi-instance problem, each pattern is a labeled bag that consists of a number of unlabeled instances. A bag is negative if all instances in it are negative. A bag is positive if it has at least one positive instance. Because the instances in the positive bag are not labeled, each positive bag is an ambiguous. The mining aim is to classify unseen bags. The main idea of existing multi-instance algorithms is to find true positive instances in positive bags and convert the multi-instance problem to the supervised problem, and get the labels of test bags according to predict the labels of unknown instances. In this paper, we aim at mining the multi-instance data from another point of view, i.e., excluding the false positive instances in positive bags and predicting the label of an entire unknown bag. We propose an algorithm called Multi-Instance Covering kNN （MICkNN） for mining from multi-instance data. Briefly, constructive covering algorithm is utilized to restructure the structure of the original multi-instance data at first. Then, the kNN algorithm is applied to discriminate the false positive instances. In the test stage, we label the tested bag directly according to the similarity between the unseen bag and sphere neighbors obtained from last two steps. Experimental results demonstrate the proposed algorithm is competitive with most of the state-of-the-art multi-instance methods both in classification accuracy and running time.