We consider an interacting particle system on the lattice involving pushing and blocking interactions, called PushASEP, in presence of a wall at origin. show that invariant measure this is equal distribution to vector point-to-line last passage percolation times random geometrically distributed environment. The largest co-ordinates both these vectors are all-time supremum non-colliding walk.

T he current state of outpatient healthcare delivery is characterized by capacity shortages and long waits for appointments, yet a substantial fraction of valuable doctors’ capacity is wasted due to no-shows. In this study, we examine the effect of wait to appointment on patient flow, specifically on a patient’s decision to schedule an appointment and to subsequently arrive to it. These two dec...

Our theoretical developments are motivated by a real-world application under study in collaboration with a rail transport manufacturer, pertaining to the energy efficient operation of trains. Consider an electric train controlled by a digital control unit in discrete time, with sampling period Ts. Let us denote with k ∈Z the discrete time variable, with x(k) = [x1(k), x2(k)] the state of the tr...

objective(s) four novel losartan analogues 5a-d were synthesized by connecting a dihydropyridine nucleus to imidazole ring. the effects of 5a and 5b on angiotensin receptors (at') and l-type calcium channels were investigated on isolated rat aorta. materials and methods aortic rings were pre-contracted with 1 pm angiotensin ii or 80 mm kcl and relaxant effects of losartan, nifedipine, 5a a...

We discuss dynamic system performance evaluation in the river port utilizing queuing models with batch arrivals. The general models of the system are developed. This system is modelled by M/M/n/m queue with finite waiting areas and identical and independent cargo-handling capacities. The models are considered with whole and part batch acceptance or whole and part batch rejections and the intera...

We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The assignment of jobs occurs according to some fixed overflow policy. We are interested in the blocking probabilities of each class. This model can be used for call centers, tele-communication and computer networks. An a...

We consider the problem of stable matching with dynamic preference lists. At each time step, the preference list of some player may change by swapping random adjacent members. The goal of a central agency (algorithm) is to maintain an approximately stable matching (in terms of number of blocking pairs) at all times. The changes in the preference lists are not reported to the algorithm, but must...