Bonnet and shawl; an album.

"Five hundred and seventy-one copies of the first edition of Bonnet and shawl. of which two hundred and fifty copies will be for distribution in England, were printed by William Edwin Rudge, at Mount Vernon, N.Y. Designed by Frederic Warde. Distributed in America by Random House.

The philosophical significance of Cox's theorem

Cox's theorem states that, under certain assumptions, any measure of belief is isomorphic to a probability measure. This theorem, although intended as a justification of the subjectivist interpretation of probability theory, is sometimes presented as an argument for more controversial theses. Of particular interest is the thesis that the only coherent means of representing uncertainty is via the probability calculus. In this paper I examine the logical assumptions of Cox's theorem and I show how these impinge on the philosophical conclusions thought to be supported by the theorem. I show that the more controversial thesis is not supported by Cox's theorem. (C) 2003 Elsevier Inc. All rights reserved.

Axiomatisation of an Interval Calculus for Theorem Proving

We provide an axiomatisation of the Timed Interval Calculus, a set-theoretic notation for expressing properties of time intervals. We implement the axiomatisation in the Ergo theorem prover in order to allow the machine-checked proof of laws for reasoning about predicates expressed using interval operators. These laws can be then used in the machine-assisted verification of real-time applications.

Looking under the bonnet:factors affecting student adoption of e-learning systems in Jordan

The primary questions addressed in this paper are the following: what are the factors that affect students’ adoption of an e-learning system and what are the relationships among these factors? This paper investigates and identifies some of the major factors affecting students’ adoption of an e-learning system in a university in Jordan. E-learning adoption is approached from the information systems acceptance point of view. This suggests that a prior condition for learning effectively using e-learning systems is that students must actually use them. Thus, a greater knowledge of the factors that affect IT adoption and their interrelationships is a pre-cursor to a better understanding of student acceptance of e-learning systems. In turn, this will help and guide those who develop, implement, and deliver e-learning systems. In this study, an extended version of the Technology Acceptance Model (TAM) was developed to investigate the underlying factors that influence students’ decisions to use an e-learning system. The TAM was populated using data gathered from a survey of 486 undergraduate students using the Moodle based e-learning system at the Arab Open University. The model was estimated using Structural Equation Modelling (SEM). A path model was developed to analyze the relationships between the factors to explain students’ adoption of the e-learning system. Whilst findings support existing literature about prior experience affecting perceptions, they also point to surprising group effects, which may merit future exploration.

Rehabilitation in Charles Bonnet syndrome:a review of treatment options

People with vision loss sometimes experience visual hallucinations associated with Charles Bonnet syndrome. The appearance of these hallucinations often causes anxiety for the sufferer and can be difficult for the attending eye care professional to manage. A review of the literature highlighted a range of visual, pharmacological and social management regimes that may alleviate these hallucinations, albeit using small samples in uncontrolled trials. Eye care practitioners should be aware of methods of rehabilitation in Charles Bonnet syndrome that may lead to resolution of the visual hallucinations.

Improvements on the Juxtaposing Theorem

A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n1 +n2; 2(a1 +a2); n2) ≥ min {M1;M2}+1, if A(n1; 2a1; a1 +b1) = M1 and A(n2; 2b2; a2 +b2) = M2, in particular, A(30; 16; 15) = 16 and A(33; 18; 15) = 11.

On the Various Bisection Methods Derived from Vincent’s Theorem

In 2000 A. Alesina and M. Galuzzi presented Vincent’s theorem “from a modern point of view” along with two new bisection methods derived from it, B and C. Their profound understanding of Vincent’s theorem is responsible for simplicity — the characteristic property of these two methods. In this paper we compare the performance of these two new bisection methods — i.e. the time they take, as well as the number of intervals they examine in order to isolate the real roots of polynomials — against that of the well-known Vincent-Collins-Akritas method, which is the first bisection method derived from Vincent’s theorem back in 1976. Experimental results indicate that REL, the fastest implementation of the Vincent-Collins-Akritas method, is still the fastest of the three bisection methods, but the number of intervals it examines is almost the same as that of B. Therefore, further research on speeding up B while preserving its simplicity looks promising.

On a New Approach to Williamson's Generalization of Pólya's Enumeration Theorem

Pólya’s fundamental enumeration theorem and some results from Williamson’s generalized setup of it are proved in terms of Schur- Macdonald’s theory (S-MT) of “invariant matrices”. Given a permutation group W ≤ Sd and a one-dimensional character χ of W , the polynomial functor Fχ corresponding via S-MT to the induced monomial representation Uχ = ind|Sdv/W (χ) of Sd , is studied. It turns out that the characteristic ch(Fχ ) is the weighted inventory of some set J(χ) of W -orbits in the integer-valued hypercube [0, ∞)d . The elements of J(χ) can be distinguished among all W -orbits by a maximum property. The identity ch(Fχ ) = ch(Uχ ) of both characteristics is a consequence of S-MT, and is equivalent to a result of Williamson. Pólya’s theorem can be obtained from the above identity by the specialization χ = 1W , where 1W is the unit character of W.

A Remark On S.M. Bates' Theorem

In his paper [1], Bates investigates the existence of nonlinear, but highly smooth, surjective operators between various classes of Banach spaces. Modifying his basic method, he obtains the following striking results.

Analog of Favard's Theorem for Polynomials Connected with Difference Equation of 4-th Order

Orthonormal polynomials on the real line {pn (λ)} n=0 ... ∞ satisfy the recurrent relation of the form: λn−1 pn−1 (λ) + αn pn (λ) + λn pn+1 (λ) = λpn (λ), n = 0, 1, 2, . . . , where λn > 0, αn ∈ R, n = 0, 1, . . . ; λ−1 = p−1 = 0, λ ∈ C. In this paper we study systems of polynomials {pn (λ)} n=0 ... ∞ which satisfy the equation: αn−2 pn−2 (λ) + βn−1 pn−1 (λ) + γn pn (λ) + βn pn+1 (λ) + αn pn+2 (λ) = λ2 pn (λ), n = 0, 1, 2, . . . , where αn > 0, βn ∈ C, γn ∈ R, n = 0, 1, 2, . . ., α−1 = α−2 = β−1 = 0, p−1 = p−2 = 0, p0 (λ) = 1, p1 (λ) = cλ + b, c > 0, b ∈ C, λ ∈ C. It is shown that they are orthonormal on the real and the imaginary axes in the complex plane ...

Cerami (C) Condition and Mountain Pass Theorem for Multivalued Mappings

Partially supported by Sapientia Foundation.