Suchergebnisse

James MacQueen (1778–1870) was one of the most outspoken critics of the British anti-slavery campaign in the 1820s and 1830s. A former manager of a sugar plantation in the Caribbean, he was editor of the Glasgow Courier, a paper that favoured West Indian merchant interests and opposed rights for slaves. First published in 1824, this book is a direct attack on contemporary anti-slavery campaigners, such as William Wilberforce and Thomas Clarkson, whom MacQueen holds responsible for 'the dreadful misrepresentations scattered abroad' about West India colonies and the planters. MacQueen, who insists on calling himself an enemy of slavery 'in the abstract', argues that abolition in the colonies would lead to insurrections, bringing chaos and barbarism to these territories. This, in turn, would lead to the loss of the British colonies. This volume remains an essential document in the context of post-colonial studies

Reproduction of original in: National Library of Canada. ; Errors in pagination: p. 433-971 numbered 432, 436-973. ; Added t.p.: A narrative of the principal military events during the memorable campaigns of 1812, 1813, 1814, in Russia, Germany, Spain, France & America / compiled from original documents by . James M'Queen. Glasgow : Printed by E. Khull & Co., 1814. ; Mode of access: Internet.

Vol. 2 has t.-p.: A narrative of the principal military events during the memorable campaigns, of 1812, 1813, 1814, in Russia, Germany, Spain, France & America, compiled from original documents . Glasgow, W. Sommerville [etc.] 1814. ; Mode of access: Internet.

AbstractThe discounted return associated with a finite state Markov chain X1, X2… is given by g(X1)+ αg(X2) + α2g(X3) + …, where g(x) represents the immediate return from state x. Knowing the transition matrix of the chain, it is desired to compute the expected discounted return (present worth) given the initial state. This type of problem arises in inventory theory, dynamic programming, and elsewhere.Usually the solution is approximated by solving the system of linear equations characterizing the expected return. These equations can be solved by a variety of well‐known methods. This paper describes yet another method, which is a slight modification of the classical iterative scheme. The method gives sequences of upper and lower bounds which converge mono‐tonely to the solution. Hence, the method is relatively free of error control problems.Computational experiments were conducted which suggest that for problems with a large number of states, the method is quite efficient. The amount of computation required to obtain the solution increases much slower with an increase in the number of states, N, than with the conventional methods. In fact, computational time is more nearly proportional to N2, than to N3.