Constructing internally 4-connected binary matroids

This is the post-print version of the Article - Copyright @ 2013 ElsevierIn an earlier paper, we proved that an internally 4-connected binary matroid with at least seven elements contains an internally 4-connected proper minor that is at most six elements smaller. We refine this result, by giving detailed descriptions of the operations required to produce the internally 4-connected minor. Each of these operations is top-down, in that it produces a smaller minor from the original. We also describe each as a bottom-up operation, constructing a larger matroid from the original, and we give necessary and su fficient conditions for each of these bottom-up moves to produce an internally 4-connected binary matroid. From this, we derive a constructive method for generating all internally 4-connected binary matroids.This study is supported by NSF IRFP Grant 0967050, the Marsden Fund, and the National Security Agency

Study on Main Technique in Expansion Project of Expressway

Due to the constraints on the socio-economic, technology and knowledge during the construction time; the early construction of China’s expressway is focus on dual-way four lane, with lower standard. Recently, the rapid economic growth of China has catalyst the rapid growth on the demand of transportation facility, far exceeding than the forecasted traffic volume obtained through transportation planning project. This resulted the increasing of traffic volume on the transport facility built early years, the stuck of the traffic flow and the decreasing on the level of service. This article takes the expansion project of Guangxi Coastal Expressway as case study; investigate on how to optimize the expansion program. The article could be used as a reference in achieving convenience transport facilities, from both aspect of theoretical and practical

A Causal And-Or Graph Model for Visibility Fluent Reasoning in Tracking Interacting Objects

Tracking humans that are interacting with the other subjects or environment remains unsolved in visual tracking, because the visibility of the human of interests in videos is unknown and might vary over time. In particular, it is still difficult for state-of-the-art human trackers to recover complete human trajectories in crowded scenes with frequent human interactions. In this work, we consider the visibility status of a subject as a fluent variable, whose change is mostly attributed to the subject's interaction with the surrounding, e.g., crossing behind another object, entering a building, or getting into a vehicle, etc. We introduce a Causal And-Or Graph (C-AOG) to represent the causal-effect relations between an object's visibility fluent and its activities, and develop a probabilistic graph model to jointly reason the visibility fluent change (e.g., from visible to invisible) and track humans in videos. We formulate this joint task as an iterative search of a feasible causal graph structure that enables fast search algorithm, e.g., dynamic programming method. We apply the proposed method on challenging video sequences to evaluate its capabilities of estimating visibility fluent changes of subjects and tracking subjects of interests over time. Results with comparisons demonstrate that our method outperforms the alternative trackers and can recover complete trajectories of humans in complicated scenarios with frequent human interactions.Comment: accepted by CVPR 201