Most prior work on online matching problems has been with the flexibility of keeping some vertices unmatched. We study three related constraint every vertex, i.e., no rejections. adopt a model in which arrive uniformly random order and edge-weights are arbitrary positive numbers. For capacitated bipartite problem one side graph offline those other online, we give 4.62-competitive algorithm when...

-The early P wave coda (5-15 sec after the first arrival) of underground explosions at the Nevada Test Site is studied in the time domain using 2082 teleseismic short-period recordings, with the intent of identifying near-source contributions to the signals in the frequency range 0.2-2.0 Hz. Smaller magnitude events tend to have relatively high coda levels in the 0.4-0.8 Hz frequency band for b...

In this paper, we investigate a single-server Poisson input queueing model, wherein arrivals of units are in bulk. The arrival rate of the units is state dependent, and service time is arbitrary distributed. It is also assumed that the system is subject to breakdown, and the failed server immediately joins the repair facility which takes constant duration to repair the server. By using suppl...