With the aim of improving reconstruction stochastic evolution equations from empirical time-series data, we derive a full representation generator Kramers-Moyal operator via power-series expansion exponential operator. This is necessary for deriving different terms in differential equation. this operator, are able to separate finite-time corrections arbitrary order into with and without derivat...

Insurance companies are among the service organizations, which maintain close relationships with their clients by providing insurance services. Clients are the most important resource for service companies. And profitability of insurance companies undoubtedly hinges on clear analysis of client satisfaction and improved productivity of service providers. An important factor of client satisfactio...

Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...

The peakedness characterization of a teletraffic stream has long been recognized as an extremely useful one for the analysis of loss systems. In this paper, we present a preliminary investigation into the utility of this characterization for the analysis of delay systems as well. Restricting attention, for simplicity, to single server queueing systems G/G/! with FCFS service, we derive an expli...

the purpose of this paper is to identify the factors of customer satisfaction in export development bank of iran (edbi). in this study, purposive sampling technique was employed to recruit 50 customers classified as government service holder, private service holder and businessmen from all edbi branches. we have done kaiser-meyer-olkin measure of sampling adequacy, bartlett's test of sphericity...

We find combinatorially the probability of having n customers in an M/M/1/c queueing system at an arbitrary time t when the arrival rate λ and the service rate μ are equal, including the case c = ∞. Our method uses pathcounting methods and finds a bijection between the paths of the type needed for the queueing model and paths of another type which are easy to count. The bijection involves some ...

In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edgeweighted tree T , and have to be served eventually. A service is defined as a subtree X of T that contains its root. This subtree X serves all requests that are pending in the nodes of X, and the cost of this service is equal to the total weight of X. Each request also incurs waiting cost between its arrival a...

We consider the problem of scheduling jobs online, where jobs may be served partially in order to optimize the overall use of the machines. Service requests arrive online to be executed immediately; the scheduler must decide how long and if it will run a job (that is, it must fix the Quality of Service level of the job) at the time of arrival of the job: preemption is not allowed. We give lower...