Analyzing the composition and robustness of flight conflicts is beneficial to find vulnerable sources dissipate conflicts, effectively improve safety operational efficiency air traffic. Therefore, this paper proposes a conflict network evaluation method based on degree correlation. Firstly, constructed by using velocity obstacle method, it classified into three types assortative, disassortative...

The article provides a set of algorithms for performing set operations on polygonal regions in the plane using standard oating point arithmetic. The algorithms are robust, guaranteeing both topological consistency and numerical accuracy. Each polygon edge is modeled as an implicit or explicit polygonal curve which stays within some distance of the original line segment. If the curve is implicit...

In Part I, we described an efficient and robust algorithm for computing a common refinement of two surface meshes. In this paper, we present a theoretical verification ofthe robustness of our algorithm by showing the topological preservation of the intersection principle, which we used to resolve topological inconsistencies caused by numerical errors. To enhance robustness in practice for compl...

Safety verification of hybrid systems is undecidable, except for very special cases. In this paper, we circumvent undecidability by providing a verification algorithm that provably terminates for all robust problem instances, but need not necessarily terminate for non-robust problem instances. A problem instance x is robust iff the given property holds not only for x itself, but also when x is ...

This paper proposes a general method for establishing pairwise correspondences, which is a fundamental problem in image analysis. The method consists of over-segmenting a pair of images into supervoxels. A forest classifier is then trained on one of the images, the source, by using supervoxel indices as voxelwise class labels. Applying the forest on the other image, the target, yields a supervo...

Gradient projection (GP) algorithm has been shown as an efficient algorithm for solving the traditional traffic equilibrium problem with additive route costs. Recently, GP has been extended to solve the nonadditive traffic equilibrium problem (NaTEP), in which the cost incurred on each route is not just a simple sum of the link costs on that route. However, choosing an appropriate stepsize, whi...

This paper proposes a method to compute finite abstractions that can be used for synthesizing robust hybrid control strategies for nonlinear systems. Most existing methods for computing finite abstractions utilize some global, analytical function to provide bounds on the reachable sets of nonlinear systems, which can be conservative and lead to spurious transitions in the abstract systems. This...

In this paper we propose a new implementation of EasyCluster, a robust software developed to generate reliable clusters by expressed sequence tags (EST). Such clusters can be used to infer and improve gene structures as well as discover potential alternative splicing events. The new version of EasyCluster software is able to manage genome scale transcriptome data produced by massive sequencing ...

A novel approach to fitting parabolas to scattered data is introduced by putting special emphasis on the robustness of the approach. The robust fit is achieved by not taking into account a proportion α of the “most outlying” observations, allowing the procedure to trim them off. The most outlying observations are self-determined by the data. Procrustes analysis techniques and a particular type ...

The blind separation of multiple co-channel binary digital signals using an antenna array involves finding a factorization of a data matrix X into X AS, where all entries of S are 1 or −1. It is shown that this problem can be solved exactly and non-iteratively, via a certain generalized eigenvalue decomposition. As indicated by simulations, the algorithm is robust in the presence of noise. An i...