Interchanges and intersections are the most complex part of a roadway network very challenging for snow plowing operators. The objective study is to test if empirical best route clear diverging diamond interchange (DDI) recommended by Clear Roads also mathematically optimized. A discrete optimization method was employed find shortest route. In study, DDI represented as directed graph model. tas...

We consider the problem of sorting signed permutations by reversals, transpositions, transreversals, and block-interchanges. The problem arises in the study of species evolution via large-scale genome rearrangement operations. Recently, Hao et al. gave a 2-approximation scheme called genome sorting by bridges (GSB) for solving this problem. Their result extended and unified the results of (i) H...

There is a recent trend of building roundabouts on highspeed roads, often with the considerable presence of heavy vehicles. With the increased presence of trucks on roundabouts, the issue of overturning has become a concern. Although some geometric, vehicle, and loading factors have been connected to rollover, the safety performance of roundabouts built on high-speed roads is not well understoo...

We present algorithms for generating all permutations of a given bag so that successive permutations diier by the interchange of two elements. One version of the algorithm runs in time linear in the number of permutations.

By overcoming speed bottlenecks from electronic switching as well as optical/electronic conversions, all-optical logic gates can permit further exploitation of the nearly 40THz of bandwidth available from optical fibers. We focus on the use of optical solitons and alloptical logic gates to implement ultrafast "interchanges" or switching nodes on packet networks with speeds of 100Gbit/s or great...

In this paper we focus on the representation of Steiner trades of volume less than or equal to nine and identify those for which the associated partial latin square can be decomposed into six disjoint latin interchanges. 1 Background information In any combinatorial configuration it is possible to identify a subset which uniquely determines the structure of the configuration and in some cases i...

For symmetric indeenite tridiagonal matrices, block LDL T factorization without interchanges is shown to have excellent numerical stability when a pivoting strategy of Bunch is used to choose the dimension (1 or 2) of the pivots.

We use an interesting result of probabilistic flavor concerning the product of two permutations consisting of one cycle each to find an explicit formula for the average number of block interchanges needed to sort a permutation of length n.

We show that over an algebraically closed field of characteristic not equal to 2, homological projective duality for smooth quadric hypersurfaces and double covers spaces branched is a combination two operations: one interchanges hypersurface with its classical dual the other cover along it.