This research explores the idea that weather conditions and driverand vehiclepopulation characteristics affect a homogenous roadway segment’s flow-versus-density relationship. Third-order-polynomial regressions of flow on powers of density interacted with a variety of explanatory variables suggest that driver, vehicle, and environmental attributes significantly influence the flow-density relati...

We use the recently established higher-level Bailey lemma and Bose–Fermi polynomial identities for the minimal models M(p, p) to demonstrate the existence of a Bailey flow from M(p, p) to the coset models (A (1) 1 )N ×(A (1) 1 )N ′/(A (1) 1 )N+N ′ where N is a positive integer and N ′ is fractional, and to obtain Bose–Fermi identities for these models. The fermionic side of these identities is ...

[1] Several domes indicative of non-mare volcanism, morphologically as well as spectrally distinct from surrounding mare and highland units, are located in the Gruithuisen region in northern Oceanus Procellarum. The determination of the nature and age of non-mare volcanism helps to put constraints on lunar crustal evolution. The ages of the domes were previously thought to be mid-Imbrian or pos...

Maximum Flow Network Interdiction Problem (MFNIP) is known to be strongly NP-hard problem. We solve a simple form of MFNIP in polynomial time. We review the reduction of MFNIP from the clique problem. We propose a polynomial time solution to the Clique Problem.

Figure 5: In-vivo background phase correction. (a) Magnitude image, (b) the original phase image, with the dashed blue line defining the area and (c) the red contour of stationary tissue for polynomial surface subtraction, (d) is ground truth, (e) 5th order polynomial subtraction, and (f) k-space filtering with a 64×64 pixel Gaussian kernel. Figure 1: phantom with steady-state flow. Red lines s...

In this paper we study algorithms for pricing of interest rate instruments using a lattice interest model. The price is defined as expected discounted cash flow. If the cash-flows generated by the instrument depend on the full or partial history of the interest rates (path dependent contracts), then the pricing algorithms are typically of exponential complexity. We show that for some models, in...

The integer equal flow problem is an NP-hard network flow problem, in which all arcs in given sets R1, . . . , R` must carry equal flow. We show that this problem is effectively inapproximable, even if the cardinality of each set Rk is two. When ` is fixed, it is solvable in polynomial time. © 2009 Elsevier B.V. All rights reserved.

Network flow problems are central problems in operations research, computer science, and engineering and they arise in many real world applications. Starting with early work in linear programming and spurred by the classic book of Ford and Fulkerson [26], the study of such problems has led to continuing improvements in the efficiency of network flow algorithms. In spite of the long history of t...

Among the models of quantum computation, the One-way Quantum Computer [10, 11] is one of the most promising proposals of physical realization [12], and opens new perspectives for parallelization by taking advantage of quantum entanglement [2]. Since a one-way quantum computation is based on quantum measurement, which is a fundamentally nondeterministic evolution, a sufficient condition of globa...

In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.