Store-and-forward based methods for the signal control problem in large-scale congested urban road networks

The problem of designing network-wide traffic signal control strategies for large-scale congested urban road networks is considered. One known and two novel methodologies, all based on the store-and-forward modeling paradigm, are presented and compared. The known methodology is a linear multivariable feedback regulator derived through the formulation of a linear-quadratic optimal control problem. An alternative, novel methodology consists of an open-loop constrained quadratic optimal control problem, whose numerical solution is achieved via quadratic programming. Yet a different formulation leads to an open-loop constrained nonlinear optimal control problem, whose numerical solution is achieved by use of a feasible-direction algorithm. A preliminary simulation-based investigation of the signal control problem for a large-scale urban road network using these methodologies demonstrates the comparative efficiency and real-time feasibility of the developed signal control methods

Generalized iterated wreath products of cyclic groups and rooted trees correspondence

Consider the generalized iterated wreath product $\mathbb{Z}_{r_1}\wr \mathbb{Z}_{r_2}\wr \ldots \wr \mathbb{Z}_{r_k}$ where $r_i \in \mathbb{N}$. We prove that the irreducible representations for this class of groups are indexed by a certain type of rooted trees. This provides a Bratteli diagram for the generalized iterated wreath product, a simple recursion formula for the number of irreducible representations, and a strategy to calculate the dimension of each irreducible representation. We calculate explicitly fast Fourier transforms (FFT) for this class of groups, giving literature's fastest FFT upper bound estimate.Comment: 15 pages, to appear in Advances in the Mathematical Science

A rolling-horizon quadratic-programming approach to the signal control problem in large-scale congested urban road networks

The paper investigates the efficiency of a recently developed signal control methodology, which offers a computationally feasible technique for real-time network-wide signal control in large-scale urban traffic networks and is applicable also under congested traffic conditions. In this methodology, the traffic flow process is modeled by use of the store-and-forward modeling paradigm, and the problem of network-wide signal control (including all constraints) is formulated as a quadratic-programming problem that aims at minimizing and balancing the link queues so as to minimize the risk of queue spillback. For the application of the proposed methodology in real time, the corresponding optimization algorithm is embedded in a rolling-horizon (model-predictive) control scheme. The control strategy’s efficiency and real-time feasibility is demonstrated and compared with the Linear-Quadratic approach taken by the signal control strategy TUC (Traffic-responsive Urban Control) as well as with optimized fixed-control settings via their simulation-based application to the road network of the city centre of Chania, Greece, under a number of different demand scenarios. The comparative evaluation is based on various criteria and tools including the recently proposed fundamental diagram for urban network traffic

Axiomatic Characterization of the Mean Function on Trees

A mean of a sequence π = (x1, x2, . . . , xk) of elements of a finite metric space (X, d) is an element x for which is minimum. The function Mean whose domain is the set of all finite sequences on X and is defined by Mean(π) = { x | x is a mean of π } is called the mean function on X. In this paper the mean function on finite trees is characterized axiomatically

Generalized iterated wreath products of symmetric groups and generalized rooted trees correspondence

Consider the generalized iterated wreath product $S_{r_1}\wr \ldots \wr S_{r_k}$ of symmetric groups. We give a complete description of the traversal for the generalized iterated wreath product. We also prove an existence of a bijection between the equivalence classes of ordinary irreducible representations of the generalized iterated wreath product and orbits of labels on certain rooted trees. We find a recursion for the number of these labels and the degrees of irreducible representations of the generalized iterated wreath product. Finally, we give rough upper bound estimates for fast Fourier transforms.Comment: 18 pages, to appear in Advances in the Mathematical Sciences. arXiv admin note: text overlap with arXiv:1409.060

A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs

In this paper we generalize N-fold integer programs and two-stage integer programs with N scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable N and any convex separable objective function. We conclude with two sample applications, stochastic integer programs with second-order dominance constraints and stochastic integer multi-commodity flows, which (for fixed blocks) can be solved in polynomial time in the number of scenarios and commodities and in the binary encoding length of the input data. In the proof of our main theorem we combine several non-trivial constructions from the theory of Graver bases. We are confident that our approach paves the way for further extensions

Maximum gradient embeddings and monotone clustering

Let (X,d_X) be an n-point metric space. We show that there exists a distribution D over non-contractive embeddings into trees f:X-->T such that for every x in X, the expectation with respect to D of the maximum over y in X of the ratio d_T(f(x),f(y)) / d_X(x,y) is at most C (log n)^2, where C is a universal constant. Conversely we show that the above quadratic dependence on log n cannot be improved in general. Such embeddings, which we call maximum gradient embeddings, yield a framework for the design of approximation algorithms for a wide range of clustering problems with monotone costs, including fault-tolerant versions of k-median and facility location.Comment: 25 pages, 2 figures. Final version, minor revision of the previous one. To appear in "Combinatorica

Negotiating networks of self-employed work: strategies of minority ethnic contractors

Within the increased flexible, contracted work in cities, employment is negotiated through network arrangements characterised by multiplicity, mobility and fluidity. For black and minority ethnic group members, this network labour becomes fraught as they negotiate both their own communities, which can be complex systems of conflicting networks, as well as non-BME networks which can be exclusionary. This discussion explores the networking experiences of BME individuals who are self-employed in portfolio work arrangements in Canada. The analysis draws from a theoretical frame of ‘racialisation’ (Mirchandani and Chan, 2007) to examine the social processes of continually constructing and positioning the Other as well as the self through representations in these networks. These positions and concomitant identities enroll BME workers in particular modes of social production, which order their roles and movement in the changing dynamics of material production in networked employment

The Fanconi Anemia Core Complex Is Dispensable during Somatic Hypermutation and Class Switch Recombination

To generate high affinity antibodies during an immune response, B cells undergo somatic hypermutation (SHM) of their immunoglobulin genes. Error-prone translesion synthesis (TLS) DNA polymerases have been reported to be responsible for all mutations at template A/T and at least a fraction of G/C transversions. In contrast to A/T mutations which depend on PCNA ubiquitination, it remains unclear how G/C transversions are regulated during SHM. Several lines of evidence indicate a mechanistic link between the Fanconi Anemia (FA) pathway and TLS. To investigate the contribution of the FA pathway in SHM we analyzed FancG-deficient B cells. B cells deficient for FancG, an essential member of the FA core complex, were hypersensitive to treatment with cross-linking agents. However, the frequencies and nucleotide exchange spectra of SHM remained comparable between wild-type and FancG-deficient B cells. These data indicate that the FA pathway is not involved in regulating the outcome of SHM in mammals. In addition, the FA pathway appears dispensable for class switch recombination

IL4Rα signaling abrogates hypoxic neutrophil survival and limits acute lung injury responses <i>in vivo</i>

Rationale: Acute respiratory distress syndrome is defined by the presence of systemic hypoxia and consequent on disordered neutrophilic inflammation. Local mechanisms limiting the duration and magnitude of this neutrophilic response remain poorly understood.  Objectives: To test the hypothesis that during acute lung inflammation tissue production of proresolution type 2 cytokines (IL-4 and IL-13) dampens the proinflammatory effects of hypoxia through suppression of HIF-1a (hypoxia-inducible factor-1a)mediated neutrophil adaptation, resulting in resolution of lung injury.  Methods: Neutrophil activation of IL4Ra (IL-4 receptor a) signaling pathways was explored ex vivo in human acute respiratory distress syndrome patient samples, in vitro after the culture of human peripheral blood neutrophils with recombinant IL-4 under conditions of hypoxia, and in vivo through the study of IL4Ra-deficient neutrophils in competitive chimera models and wild-type mice treated with IL-4.  Measurements and Main Results: IL-4 was elevated in human BAL from patients with acute respiratory distress syndrome, and its receptor was identified on patient blood neutrophils. Treatment of human neutrophils with IL-4 suppressed HIF-1a-dependent hypoxic survival and limited proinflammatory transcriptional responses. Increased neutrophil apoptosis in hypoxia, also observed with IL-13, required active STAT signaling, and was dependent on expression of the oxygen-sensing prolyl hydroxylase PHD2. In vivo, IL-4Ra-deficient neutrophils had a survival advantage within a hypoxic inflamed niche; in contrast, inflamed lung treatment with IL-4 accelerated resolution through increased neutrophil apoptosis.  Conclusions: We describe an important interaction whereby IL4Ra-dependent type 2 cytokine signaling can directly inhibit hypoxic neutrophil survival in tissues and promote resolution of neutrophil-mediated acute lung injury