Due to the difficulties in obtaining large deformation mining subsidence using differential Interferometric Synthetic Aperture Radar （D-InSAR） alone, a new algorithm was proposed to extract large deformation mining ...Due to the difficulties in obtaining large deformation mining subsidence using differential Interferometric Synthetic Aperture Radar （D-InSAR） alone, a new algorithm was proposed to extract large deformation mining subsidence using D-InSAR technique and probability integral method. The details of the algorithm are as follows：the control points set, containing correct phase unwrapping points on the subsidence basin edge generated by D-InSAR and several observation points （near the maximum subsidence and inflection points）, was established at first; genetic algorithm （GA） was then used to optimize the parameters of probability integral method; at last, the surface subsidence was deduced according to the optimum parameters. The results of the experiment in Huaibei mining area, China, show that the presented method can generate the correct mining subsidence basin with a few surface observations, and the relative error of maximum subsidence point is about 8.3%, which is much better than that of conventional D-InSAR （relative error is 68.0%）.展开更多
In this paper,we investigate on the problem of energy-efficient traffic grooming under sliding scheduled traffic model for IP over WDM optical networks,so as to minimize the total energy consumption of the core networ...In this paper,we investigate on the problem of energy-efficient traffic grooming under sliding scheduled traffic model for IP over WDM optical networks,so as to minimize the total energy consumption of the core network.We present a two-layer auxiliary graph model and propose a new energyefficient traffic grooming heuristic named Two-Dimension Green Traffic Grooming(TDGTG) algorithm,which takes both space and time factors into consideration for network energy efficiency.We compare our proposed TDGTG algorithm with the previous traffic grooming algorithms for scheduled traffic model in terms of total energy consumption and blocking probability.The simulation results in three typical carrier topologies show the efficiency of our proposed TDGTD algorithm.展开更多
The Tetrahedral Network(TEN) is a powerful 3-D vector structure in GIS, which has a lot of advantages such as simple structure, fast topological relation processing and rapid visualization. The difficulty of TEN appli...The Tetrahedral Network(TEN) is a powerful 3-D vector structure in GIS, which has a lot of advantages such as simple structure, fast topological relation processing and rapid visualization. The difficulty of TEN application is automatic creating data structure. Although a raster algorithm has been introduced by some authors, the problems in accuracy, memory requirement, speed and integrity are still existent. In this paper, the raster algorithm is completed and a vector algorithm is presented after a 3-D data model and structure of TEN have been introducted. Finally, experiment, conclusion and future work are discussed.展开更多
基金Project (BK20130174) supported by the Basic Research Project of Jiangsu Province (Natural Science Foundation) Project (1101109C) supported by Jiangsu Planned Projects for Postdoctoral Research Funds,China+1 种基金Project (201325) supported by the Key Laboratory of Geo-informatics of State Bureau of Surveying and Mapping,ChinaProject (SZBF2011-6-B35) supported by the Priority Academic Program Development of Jiangsu Higher Education Institutions,China
文摘Due to the difficulties in obtaining large deformation mining subsidence using differential Interferometric Synthetic Aperture Radar （D-InSAR） alone, a new algorithm was proposed to extract large deformation mining subsidence using D-InSAR technique and probability integral method. The details of the algorithm are as follows：the control points set, containing correct phase unwrapping points on the subsidence basin edge generated by D-InSAR and several observation points （near the maximum subsidence and inflection points）, was established at first; genetic algorithm （GA） was then used to optimize the parameters of probability integral method; at last, the surface subsidence was deduced according to the optimum parameters. The results of the experiment in Huaibei mining area, China, show that the presented method can generate the correct mining subsidence basin with a few surface observations, and the relative error of maximum subsidence point is about 8.3%, which is much better than that of conventional D-InSAR （relative error is 68.0%）.
基金This work is supported by the National Basic Research Program of China （＂973 Program＂） under Grant 2013CB329103, National Natural Science Foundation of China （NSFC） undergrant No. 61201129 and Program for Changji- ang Scholars and Innovative Research Team in University.
文摘In this paper,we investigate on the problem of energy-efficient traffic grooming under sliding scheduled traffic model for IP over WDM optical networks,so as to minimize the total energy consumption of the core network.We present a two-layer auxiliary graph model and propose a new energyefficient traffic grooming heuristic named Two-Dimension Green Traffic Grooming(TDGTG) algorithm,which takes both space and time factors into consideration for network energy efficiency.We compare our proposed TDGTG algorithm with the previous traffic grooming algorithms for scheduled traffic model in terms of total energy consumption and blocking probability.The simulation results in three typical carrier topologies show the efficiency of our proposed TDGTD algorithm.
基金Project supported by the National Natural Science Foundation of China (No.69833010)
文摘The Tetrahedral Network(TEN) is a powerful 3-D vector structure in GIS, which has a lot of advantages such as simple structure, fast topological relation processing and rapid visualization. The difficulty of TEN application is automatic creating data structure. Although a raster algorithm has been introduced by some authors, the problems in accuracy, memory requirement, speed and integrity are still existent. In this paper, the raster algorithm is completed and a vector algorithm is presented after a 3-D data model and structure of TEN have been introducted. Finally, experiment, conclusion and future work are discussed.
