We study a particular graded ring structure on the set of all loopfree matroids on a fixed labeled ground set, which occurs naturally in tropical geometry. The product is given by matroid intersection and the additive structure is defined by assigning to each matroid the indicator vector of its chains of flats. We show that this ring is generated in corank one, more precisely that any matroid c...

In this paper we study restrictions imposed on individual preferences, as opposed to preference profiles, and we introduce individual preference restrictions that characterize the existence and uniqueness of stable hedonic coalition structures on rich preference domains. We prove that if such a preference domain satisfies an individual preference restriction then it guarantees the existence of ...

We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph ofG. The condition is derived from a recent extension of the Matroid intersection theorem due to Aharoni and Berger. We apply the result to the problem of the existence of a (spanning) 2-walk in sufficiently tough graphs.

We examine the recently found point of intersection between the Z2 and Z4 orbifold subvarieties in the K3 moduli space more closely. First we give an explicit identification of the coordinates of the respective Z2 and Z4 orbifold theories at this point. Secondly we construct the explicit identification of conformal field theories at this point and show the orthogonality of the two subvarieties.

When the degree of saturation at intersection approaches one, Webster’s optimum cycle length equation becomes inapplicable, because the cycle length will becomes very big when the degree of saturation approaches one and will be fully unrealistic when the degree of saturation becomes greater than one. This is not a problem for HCM2000 method. But optimum cycle length calculation in this method h...

ITE JOURNAL / MARCH 2002 INTRODUCTION The determination of delay at signalized intersections is a relatively complicated task. With each subsequent release of the Highway Capacity Manual (HCM),1 the procedures generally get more accurate but also more complex. Consequently, transportation engineers typically rely on software implementations of the HCM procedures to perform signalized intersecti...

F. Richard Moore proposed a general model for spatial processing of sounds in 1982. [5] This model separates space in two nested areas. The outer room is an imagimary acoustic space within which the inner room (or the real performance space) is located. The inner room is denoted by the location of the speakers which simulate the sound heard in the inner room as if the speakers were “openings” c...

The ever-increasing travel demand outpacing available transportation capacity especially in the U.S. urban areas has led to more severe traffic congestion and delays. This study proposes a methodology for intersection signal timing optimisation an street network aimed minimise intersection-related delays by dynamically adjusting green splits of plans designed intersections each hour day respons...

The mission of the National Center for Digital Government: Integrating Information and Institutions is threefold: to build global research capacity, to advance practice, and to strengthen the network of researchers and practitioners engaged in building and using technology for governance. We seek to apply and extend the social sciences in research at the intersection of governance, institutions...