Crossroads Dr. Ir. H. Soekarno - Jalan Mulyorejo is one of the signalized intersections in bustling city Surabaya. The problem at intersection length queue and delay due to number vehicles passing through intersection. reason for conducting research assess performance traffic Data was collected by means a direct survey site. data analyzed are that pass each approach, signal time, vehicle speed ...

Minimum delay (or service delay) is one of the most important performance measures for intersection analysis. It can be described as to a vehicle, which waiting at stop yield) line an unsignalized intersection. In this study, appropriate minimum equation derived multi-lane traffic circles in İzmir, Turkey. For purpose, observations are made six approaches five circles. Simple and multiple regre...

This study was carried out to analyze the variations of Benzene, Toluene, and para- Xylene (BTp-X) present in the urban air of Delhi. These pollutants can enter into the human body through various pathways like inhalation, oral and dermal exposure posing adverse effects on human health. Keeping in view of the above facts, six different locations of Delhi were selected for the study during summe...

This paper analyzes the potential effects of connected and automated vehicles on saturation headway capacity at signalized intersections. A intersection is created in Vissim as a testbed, where four vehicle types are modeled tested: (I) human-driven (HVs), (II) (CVs), (III) (AVs), (IV) (CAVs). Various scenarios defined based different market-penetration rates these types. AVs assumed to move mo...

A subspace-evasive set over a field F is a subset of F that has small intersection with any low-dimensional affine subspace of F. Interest in subspace evasive sets began in the work of Pudlák and Rödl (Quaderni di Matematica 2004). More recently, Guruswami (CCC 2011) showed that obtaining such sets over large fields can be used to construct capacity-achieving list-decodable codes with a constan...

This is the first in a series of papers that explores a class of polyhedra we call 2-lattice polyhedra. 2-Lattice polyhedra are a special class of lattice polyhedra that include network flow polyhedra, fractional matching polyhedra, matroid intersection polyhedra, the intersection of two polymatroids, etc. In this paper we show that the maximum sum of components of a vector in a 2-lattice polyh...

We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first polynomial time algorithm for computing balanced solutions for these games. In addition, we prove that an instance has a balanced solution if and only if it has a stable one. Our methods use a new idea of reducing an in...