This paper argues that the conventional establishment of levels of Beginning, Intermediate and Upper Intermediate for teachers’ IT competency based on IT skill-sets is not be appropriate in enabling teachers for IT in education. Instead an Information-oriented model pegging on the central role of education is proposed.

The pegging algorithm is a method of generating large random regular graphs beginning with small ones. The ǫ-mixing time of the distribution of short cycle counts of these random regular graphs is the time at which the distribution reaches and maintains total variation distance at most ǫ from its limiting distribution. We show that this ǫ-mixing time is not o(ǫ−1). This demonstrates that the up...

In this article consumers need money to reduce their transaction costs. We highlight the existence of indeterminacy under a constant money growth within an endogenous growth framework. Real indeterminacy is avoided by an alternative monetary policy such as the interest pegging. The residual price indeterminacy is also ruled out if this monetary policy is completed by a non-Ricardian ...scal pol...

We formulate the fixed-charge multiple knapsack problem (FCMKP) as an extension of the multiple knapsack problem (MKP). The Lagrangian relaxation problem is easily solved, and together with a greedy heuristic we obtain a pair of upper and lower bounds quickly. We make use of these bounds in the pegging test to reduce the problem size. We also present a branch-and-bound (B&B) algorithm to solve ...

Patriksson [Pat08] provided a then up-to-date survey on the continuous, separable, differentiable and convex resource allocation problem with a single resource constraint. Since the publication of that paper the interest in the problem has grown: several new applications have arisen where the problem at hand constitutes a subproblem, and several new algorithms have been developed for its effici...