UN/CEFACT’s ModellingMethodology (UMM) is amethodology created to capture the business requirements of inter-organizational business processes, regardless of the underlying technology. An example of how to apply UMM to an inter-enterprise e-health project is presented in this paper.

The non-Markovianity of the stochastic process called quantum semi-Markov (QSM) is studied using a recently proposed quantification memory based on deviation from semigroup evolution, that provides unified description divisible and indivisible channels. This shown to bring out property QSM processes exhibit effects even in CP-divisible regime, agreement with an earlier result. An operational me...

A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that ω(A) < ω(H) and ω(B) < ω(H). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, V (H) can be partitioned into two sets A,B such that H[A] is perfect and ω(B) < ω(H). We prove that if a graph is (P5, C5)-free, then it is 2-divisibl...

The main objective of this study is to analyze spillover fluctuations between inflation fluctuation and (un)employment fluctuation in relation to agriculture, industry and services sectors of Iran. In line with this, PANEL in Mean-MGARCH model has been used concerning Iran’s agriculture, industry and services sectors over the period of time from spring 2002 to winter 2016. The results show that...

Classes of multivariate and cone valued infinitely divisible Gamma distributions are introduced. Particular emphasis is put on the cone-valued case, due to the relevance of infinitely divisible distributions on the positive semi-definite matrices in applications. The cone-valued class of generalised Gamma convolutions is studied. In particular, a characterisation in terms of an Itô-Wiener integ...

Introduction. A p-divisible group X can be seen as a tower of building blocks, each of which is isomorphic to the same finite group scheme X[p]. Clearly, if X1 and X2 are isomorphic then X1[p] ∼= X2[p]; however, conversely X1[p] ∼= X2[p] does in general not imply that X1 and X2 are isomorphic. Can we give, over an algebraically closed field in characteristic p, a condition on the p-kernels whic...

Electronic voting is a prime application of cryptographic tools. Many researches are addressing election or confidence voting in this area. We address a new type of voting scheme “Divisible Voting Scheme,” in which each voter has multiple ballots where the number of ballots can be different among the voters. This type of voting is popular. We first define the divisible voting scheme and show na...