This paper studies a discrete-time single-server queue with two independent inputs and service interruptions. One of the inputs to the queue is an independent and identically distributed process. The other is a much more general process and it is not required to be Markov nor is it required to be stationary. The service interruption process is also general and it is not required to be Markov or...

Railway transport becomes a more popular transportation in many countries due to its large capacity, low energy consumption, and benign environment. The passenger train service planning is the key of rail operations system balance demand. In this paper, we propose mixed binary linear programming formulation for optimize route, frequency, stop schedule, assignment simultaneously. addition, analy...

We present an empirical comparison of decomposition techniques for CSPs. We compare three popular heuristics for tree decomposition and an exact method for optimal tree decomposition, along with two methods for hypertree decomposition. We use a small sample of instances in the experiments. We find that the connected hypertree decomposition method finds more optimal width decompositions than the...

nderlying almost every software design is a philosophy of perception, abstraction, and decomposition. Such a philosophy claims that adopting a specific abstraction and decomposition techniques will lead to a better design. In the context of dealing with change, we contrast two design philosophies: the component approach and the service approach to software development and analyze the difference...

In this work the topic of service composition scenarios is introduced and discussed with the use of leading example of service composition in the transport domain. The example is used to visualize the connection to the Internet of Things paradigm. The service composition itself is defined with a holistic approach, describing all steps of the proposed composition process like: requirements defin...

The Hierarchical Task Network (HTN) planning method is conceived of as a useful method for Web service composition as well as classical task planning. However, there are no complete successes of service composition by HTN as yet. The reason is the Web service composition process involves the interactive dataflow between variables in preconditions and input/output parameters of services. Since v...

This work presents an adaptive profitable discriminatory pricing mechanism for cloud computing based on secure function decomposition, cryptographic commitments and zero knowledge proof. Cloud computing is an emerging trend of enterprise resource planning where a selling agent or service provider (S) wants to allocate a set of computational resources and related IT services optimally and fairly...