Freeway merge areas are recognized as the most common segment of recurrent freeway congestion as two separate traffic streams join to merge a single stream. Over the years, several studies have attempted to explain and analyze a merge capacity phenomenon, however relatively few analytical techniques have been developed to evaluate the traffic flow in these areas. This study described a new inte...

Hierarchical clustering is a popular method for analyzing data which associates a tree to a dataset. Hartigan consistency has been used extensively as a framework to analyze such clustering algorithms from a statistical point of view. Still, as we show in the paper, a tree which is Hartigan consistent with a given density can look very different than the correct limit tree. Specifically, Hartig...

The data driven 3D true azimuth Common Focusing Point (CFP) data regularization technique is a multi-dimensional data regularization tool. It can be used as a general tool to merge multiple surveys pre-stack, including, for example, orthogonal Wide Azimuth (WAZ) surveys, different Narrow Azimuth (NAZ) surveys, or a combination of the two. Some technical details that address how to improve outpu...

The expression for the dynamical spectral structure of density fluctuation near QCD critical point has been derived using linear response theory within purview Israel–Stewart relativistic viscous hydrodynamics. change in system as it approaches studied. effects have introduced through a realistic equation state and scaling behaviour various transport coefficients thermodynamic functions. We fou...

In this paper we propose a Learning algorithm for surface reconstruction. Our algorithm simulates an incrementally expanding neural network which learns a point cloud through a competitive learning process. The topology is learned through statistics based operators which create boundaries and merge them to create handles. We study the algorithm theoretically, analyzing statistically its main co...

Label reduction is a technique for simplifying families of labeled transition systems by dropping distinctions between certain transition labels. While label reduction is critical to the efficient computation of merge-and-shrink heuristics, current theory only permits reducing labels in a limited number of cases. We generalize this theory so that labels can be reduced in every intermediate abst...

This paper presents and defends the following hypothesis about language and tonal music: All formal differences between language and music are a consequence of differences in their fundamental building blocks. In all other respects, language and music are identical. Extending and adapting Lerdahl and Jackendoff's (1983, GTTM) model of musical structure, we argue that music, like language, conta...

The binary merging algorithm is the best general purpose merging algorithm known to date. Binary merge consists of two components: a rst component in which an array index is incremented by a number nearly equal to the ratio of the sizes of the two arrays being merged followed by a second component which is binary search. In this paper we formulate a simple algorithm called interpolation merge, ...