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 rangeland in the Khangai mountain region in Mongolia has degraded for the last decades mainly because of overgrazing and climate change. Livestock production is important part of the economy and is based on natural rangeland. In this research we seek to elucidate the influence of five years (2004-2009) of protection from grazing on vegetation cover of different degradation levels of Fes...

In this paper, a new simple design procedure of multifrequency unequal split Wilkinson power dividers (WPDs) is presented. The procedure is based on using N -sections of transmission line transformers, instead of the conventional quarter-wave WPD branches, to realize a WPD that operates at N frequencies. Good isolation is achieved by using lumped resistors without any extra modification to the ...

Given k ∈ L(0, 1) satisfying certain smoothness and growth conditions at 0, we consider the Volterra convolution operator Vk defined on L(0, 1) by (Vku)(t) = ∫ t 0 k(t − s)u(s) ds, and its iterates (V n k )n∈N . We construct some much simpler sequences which, as n → ∞, are asymptotically equal in the operator norm to V n k . This leads to a simple asymptotic formula for ‖V n k ‖ and to a simple...

with initial terms u0 ux = ••• = ur_2 = 0, ur_1 1. Then (u) is called a unit sequence with coefficients al5 a25 -.., ar. For a positive integer AT, the primitive period of (u) modulo AT, denoted by K(M), is the least positive integer m such that un + m = un (mod AT) for all nonnegative integers n greater than or equal to some fixed integer n0. It is known that the primitive period modulo M of a...

— Let K be a one-variable function field over a field of constants of characteristic 0. Let R be a holomorphy subring of K, not equal to K. We prove the following undecidability results for R: if K is recursive, then Hilbert’s Tenth Problem is undecidable in R. In general, there exist x1, . . . , xn ∈ R such that there is no algorithm to tell whether a polynomial equation with coefficients in Q...