We derive uniform asymptotic expressions of some Abel sums appearing in some problems in coding theory and indicate the usefulness of these sums in other fields, like empirical processes, machine maintenance, analysis of algorithms, probabilistic number theory, queuing models, etc.

Dünya ekonomisi içerisinde deniz ulaşımının büyük etkisi olduğu yadsınamaz bir gerçektir. Deniz ulaşımı için gemiler ve limanlar kadar dar su yolları da önem arz etmektedir. Bu bağlamda yollarının dünya etkili olduğunu söylemek mümkündür. İstanbul Boğazı etken rol oynayan en önemlilerindendir. Her yolunda gibi Boğazı’nda beklemeler oluşabilmekte, meydana gelen ekonomisini etkilemektedir. çalışm...

Mobile ad-hoc networks pose real difficulty in finding the multihop shortest paths because of continuous changing positions of the nodes. Traditional ad-hoc routing protocols are proposed to find multi-hop routes based on shortest path routing algorithms, which cannot effectively adapt to time-varying radio links and network topologies of Ad-hoc networks. In this paper we proposed an enhanced r...

This paper investigates the trade-off between cancellations of elective surgeries due to semi-urgent surgeries, and unused operating room (OR) time due to excessive reservation of OR time for semi-urgent surgeries. Semi-urgent surgeries, to be performed soon but not necessarily today, pose an uncertain demand on available hospital resources, and interfere with the planning of elective patients....

ISSN 0085-7130 ©Telenor ASA 2007 Background Humans have practised gambling at all times. The archaeologists have made excavations in prehistoric sites and found large numbers of roughly dice-shaped bones. Different types of games, sports events, other types of events and gambling are connected because it has always been challenging to make bets on different outcomes of a game. Experiences and s...

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...