The paper develops a model of traffic flow near an intersection, where drivers seeking to enter a congested road wait in a buffer of limited capacity. Initial data comprise the vehicle density on each road, together with the percentage of drivers approaching the intersection who wish to turn into each of the outgoing roads. If the queue sizes within the buffer are known, then the initial-bounda...

The internal mechanism used for a dependence test constrains its accuracy and determines its speed. The internal mechanism used for our Access Region Test (ART) is fundamentally different from that used in any other dependence test, and therefore its constraints and characteristics are likewise different. In this paper, we briefly describe our novel descriptor for representing memory accesses, ...

We consider the problem of identifying one of a set of polygonal models in the plane using point probes and nger probes. In particular, we give strategies for using a minimum number of nger probes to determine a nite number of possible locations of an unknown interior point p in one of the models. A nger probe takes as input an interior point p of a polygon P and a direction , and it outputs th...

INTRODUCTION Traffi c circles have been a part of the U.S. transportation system since the early 1900s. However, traffi c circles faded away from the transportation scenario because of high accident and congestion rates due to the priority given to vehicles entering the intersection. It was not until the adoption of the “modern roundabout” in the United Kingdom during the 1950s that new meaning...

The paper presents a new robust method for finding points of intersection of line segments in the plane. In this method the subdivision of the plane based on the Delaunay triangulation plays the main role. First, the Delaunay triangulation spanning the end points of line segments is constructed. Next, for line segments that are not realized by Delaunay edges, midpoints are inserted recursively ...

In CAD/CAM modeling, objects are represented using the Boundary Representation (ANSI Brep) model. Detection of possible intersection between objects can be based on the objects’ boundaries (i.e., triangulated surfaces), and computed using triangle-triangle intersection. Usually only a cross intersection algorithm is needed; however, it is beneficial to have a single robust and fast intersection...

This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the th...

The sphericity sph(G) of a graph G is the minimum dimension d for which G is the intersection graph of a family of congruent spheres in Rd . The edge clique cover number (G) is the minimum cardinality of a set of cliques (complete subgraphs) that covers all edges of G. We prove that if G has at least one edge, then sph(G) (G). Our upper bound remains valid for intersection graphs defined by bal...

In distributed and decentralized state estimation systems, fusion methods are employed to systematically combine multiple estimates of the state into a single, more accurate estimate. An often encountered problem in the fusion process relates to unknown common information that is shared by the estimates to be fused and is responsible for correlations. If the correlation structure is unknown to ...

By providing explicit definitions, we show that in both affine and projective geometry of dimension ≥ 3, considered as first-order theories axiomatized in terms of lines as the only variables, and the binary line-intersection predicate as primitive notion, non-intersection of two lines can be positively defined in terms of line-intersection. Mathematics Subject Classification (2000): 51A05, 51A...