Dynamic Settings and Interactions between Basin Subsidence and Orogeny in Zhoukou Depression and Dabie Orogenic Belt

This paper presents a study of the geo dynamic setting and the relation between orogenic uplift and basin subsidence in the inland Zhoukou depression and Dabie orogenic belt. Since the Mesozoic the evolution of Zhoukou depression can be divided into three stages: (1) foreland basin, (2) transitional stage, (3) fault depression. Formation and variations of basin were not only related to the orogenesis, but also consistent with the orogenic uplift.

New method in information processing for maintaining an efficient dynamic ordered set

This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is required to support 5 essential operations including search, insertion, deletion, max-value retrieval and next-larger-value retrieval. Based on previous research fruits, we present an advanced data structure named rich binary tree （RBT）, which follows both the binary-search-tree property and the digital-search-tree property. Also, every key K keeps the most significant difference bit （MSDB） between itself and the next larger value among K＇s ancestors, as well as that between itself and the next smaller one among its ancestors. With the new data structure, we can maintain a dynamic ordered set in O（L） time. Since computers represent objects in binary mode, our method has a big potential in application. In fact, RBT can be viewed as a general-purpose data structure for problems concerning order, such as search, sorting and maintaining a priority queue. For example, when RBT is applied in sorting, we get a linear-time algorithm with regard to the key number and its performance is far better than quick-sort. What is more powerful than quick-sort is that RBT supports constant-time dynamic insertion/deletion.

TWO FEEDBACK PROBLEMS FOR GRAPHS WITH BOUNDED TREE-WIDTH

Many difficult (often NP-complete) optimization problems can be solved efficiently on graphs of small tree-width with a given tree-decomposition.In this paper,it is discussed how to solve the minimum feedback vertex set problem and the minimum vertex feedback edge set problem efficiently by using dynamic programming on a tree-decomposition.

Crustal deformation and dynamics of Early Cretaceous in the North China Craton

The Early Cretaceous represents a peak period of the North China Craton(NCC)destruction.A comprehensive analysis of crustal deformation during this period can reveal processes and dynamics of the destruction.The peak destruction of the NCC was associated with intense extension whose representative deformation products are metamorphic core complexes(MCCs),extensional domes and rifted basins.These MCCs occurred along both northern and southern margins of the NCC,and resulted from synchronous extension and magmatism,showing difference from the typical orogen-type MCCs in many aspects.The MCCs of the Early Cretaceous were replaced by extensional domes under relatively weak extension and uplift.In contrast to a major depression-type basin of the Early Cretaceous in the western NCC,rifted basins of the same age in the eastern NCC appeared as medium-to small-scale ones extensively.In the eastern NCC,the rifted basins north of the Bohai Bay are characterized by a feature similar to an active rift whereas those south of the Bohai present similarity to a passive rift.Various sorts of extensional structures developed during the peak destruction indicate a stable stress state of NE-SE extension over the entire central to eastern NCC,consistent with the plate margin-driven stress field.Spatial distribution of the extensional structures presents an 1800 km wide back-arc extension region in the central to eastern NCC,consistent with the Paleo-Pacific slab rollback model following flat subduction.Temporal-spatial variation of initial extension and volcanic activity during the peak period also supports the rollback model right after the flat oceanic slab.The crustal deformation evolution demonstrates that the peak destruction of the NCC took place after the B-episode compression of the Yanshan Movement of the earliest Early Cretaceous and terminated with onset of the C-episode compression of the earliest Late Cretaceous.

Reachable set modeling and engagement analysis of exoatmospheric interceptor

A novel reachable set（RS） model is developed within a framework of exoatmospheric interceptor engagement analysis. The boost phase steering scheme and trajectory distortion mechanism of the interceptor are firstly explored. A mathematical model of the distorted RS is then formulated through a dimension–reduction analysis. By treating the outer boundary of the RS on sphere surface as a spherical convex hull, two relevant theorems are proposed and the RS envelope is depicted by the computational geometry theory. Based on RS model, the algorithms of intercept window analysis and launch parameters determination are proposed, and numerical simulations are carried out for interceptors with different energy or launch points. Results show that the proposed method can avoid intensive on-line computation and provide an accurate and effective approach for interceptor engagement analysis. The suggested RS model also serves as a ready reference to other related problems such as interceptor effectiveness evaluation and platform disposition.

A novel variable-lag probability hypothesis density smoother for multi-target tracking

It is understood that the forward-backward probability hypothesis density （PHD） smoothing algorithms proposed recently can significantly improve state estimation of targets. However, our analyses in this paper show that they cannot give a good cardinality （i.e., the number of targets） estimate. This is because backward smoothing ignores the effect of temporary track drop- ping caused by forward filtering and/or anomalous smoothing resulted from deaths of targets. To cope with such a problem, a novel PHD smoothing algorithm, called the variable-lag PHD smoother, in which a detection process used to identify whether the filtered cardinality varies within the smooth lag is added before backward smoothing, is developed here. The analytical results show that the proposed smoother can almost eliminate the influences of temporary track dropping and anomalous smoothing, while both the cardinality and the state estimations can significantly be improved. Simulation results on two multi-target tracking scenarios verify the effectiveness of the proposed smoother.