In spring 2002, the Center for Advanced Traffic System Simulation (CATSS), at the University of Central Florida, acquired a sophisticated reconfigurable driving simulator. This driving simulator is capable of supporting research in driving simulation, driver training, traffic engineering and human factors. However, it is crucial to assess the validation of the driving simulator since the credib...

The horizontal visibility algorithm was recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore...

A visibility representation of a graph maps vertices to horizontal segments and edges to vertical segments. For a weak-visibility representation, if the vertices of the original graph are adjacent, the corresponding segments will ’see’ each other. For a strong-visibility representation, the converse is true as well. Here we present a detailed step-by-step construction of a weak-visibility repre...

The ground observation data was used to analyze the variation of cloud amount and light precipitation over South China during 1960-2009. The total cloud cover (TCC) decreases in this period, whereas the low cloud cover (LCC) shows the obvious opposite change with increasing trends. LCP defined as low cloud cover/total cloud cover has increased, and small rainy days (< 10 mm day-1) decreased sig...

Let 〈Gr, Gb〉 be a pair of plane st-graphs with the same vertex set V . A simultaneous visibility representation with L-shapes of 〈Gr, Gb〉 is a pair of bar visibility representations 〈Γr, Γb〉 such that, for every vertex v ∈ V , Γr(v) and Γb(v) are a horizontal and a vertical segment, which share an end-point. In other words, every vertex is drawn as an L-shape, every edge of Gr is a vertical vis...