In this paper we derive decomposition results for the number of customers in polling systems under arbitrary (dynamic) polling order and service policies. Furthermore, we obtain sharper decomposition results for both the number of customers in the system and the waiting times under static polling policies. Our analysis, which is based on distributional laws, relaxes the Poisson assumption that ...

in this paper, we use modified laplace decomposition method to solving initial value problems (ivp) of the second order ordinary differential equations. theproposed method can be applied to linear and nonlinearproblems

Since LU decomposition-based key predistribution schemes can be compressed easily, they are very appropriate for source-limited sensor networks. But existing schemes have two flaws: (1) they all focus on key establishment without considering key or key material update, thus they can’t support extra nodes addition or deletion and their supported network size is limited; (2) they are vulnerable t...

[22] presents a new method called BTD for solving Valued CSPs and so Max-CSPs. This method based both on enumerative techniques and the tree-decomposition notion provides better theoretical time complexity bounds than classical enumerative methods and aims to benefit of the practical efficiency of enumerative methods thanks to the structural goods which are recorded and exploited during the sea...

From a theoretical viewpoint, the (tree-)decomposition methods offer a good approach when the (tree)-width of constraint networks (CSPs) is small. In this case, they have often shown their practical interest. However, sometimes, a bad choice for the root cluster (a tree-decomposition is a tree of clusters) may drastically degrade the performance of the solving. In this paper, we highlight an ex...

These papers are produced by Cambridge Judge Business School, University of Cambridge. They are circulated for discussion purposes only. Their contents should be considered preliminary and are not to be quoted without the authors' permission. The stochastic uncapacitated single allocation p-hub center problem is an extension of the deter-ministic version which aims to minimize the longest origi...

patient satisfaction is one of the sensitive indicators in determining the effectiveness of service rendered in hospitals. the study focus on comparing the health care services of  two cardiology based corporate hospitals in hyderabad, andhra pradesh, india. the data for the study was collected through a questionnaire consisting of two sections. an attempt has been made to elicit the informatio...

Optimization of dynamic composition of web service is helpful to answer user-request in a dynamic environment. However, it addresses multiple problems such as heterogeneity of service descriptions, request interpretation and decomposition, automatic service discovery. To keep the robust and best compositions of Web services, we consider them in a resolution process which uses the Multi-Objectiv...

This paper presents a decomposition technique for the service station reliability in a discrete-time repairable Geom/G/1 queueing system, in which the server takes exhaustive service and multiple adaptive delayed vacation discipline. Using such a novel analytic technique, some important reliability indices and reliability relation equations of the service station are derived. Furthermore, the s...