Capacity Constrained Transit Assignment with Common Lines

This paper proposes the use of absorbing Markov chains to solve the capacity constrained transit network loading problem taking common lines into account. The approach handles congested transit networks, where some passengers will not be able to board because of the absence of sufficient space. The model also handles the common lines problem, where choice of route depends on frequency of arrivals. The mathematical formulation of the problem is presented together with a numerical example. This revised version was published online in July 2006 with corrections to the Cover Date.     

Numerical solution of the Monge–Ampère equation by a Newton's algorithm

We solve numerically the Monge–Ampère equation with periodic boundary condition using a Newton's algorithm. We prove convergence of the algorithm, and present some numerical examples, for which a good approximation is obtained in 10 iterations. To cite this article: G. Loeper, F. Rapetti, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Synthesis,characterization and properties of methylaminocellulose

Homogeneously prepared tosylcelluloses (TC) with degrees of substitution (DS) of DS_Tos 0.1–1.8 were used as intermediates for the synthesis of methylaminocelluloses (MAC) by nucleophilic substitution with methylamine. TC with DS_Tos up to 1.1 were shown to be valuable intermediates for selective synthesis of MAC with DS_MA varying from 0.1 to approximately 1. No nucleophilic substitution was observed at higher DS_Tos. At the chosen reaction conditions (60 °C, 48 h) residual tosyl moieties remained unchanged and little hydrolysis took place. The samples obtained were characterized by means of elemental analysis, FTIR and ¹³C CP/MAS NMR spectroscopy. ¹³C CP/MAS NMR spectroscopy was found to be an efficient tool for quantification of DS_MA. Furthermore, the swelling behaviour in water was investigated and preliminary tests concerning the bilirubin adsorption capacity of MAC were carried out.     

Convergence of multistep discretizations of DAEs

Standard ODE methods such as linear multistep methods encounter difficulties when applied to differential-algebraic equations (DAEs) of index greater than 1. In particular, previous results for index 2 DAEs have practically ruled out the use of all explicit methods and of implicit multistep methods other than backward difference formulas (BDFs) because of stability considerations. In this paper we embed known results for semi-explicit index 1 and 2 DAEs in a more comprehensive theory based on compound multistep and one-leg discretizations. This explains and characterizes the necessary requirements that a method must fulfill in order to be applicable to semi-explicit DAEs. Thus we conclude that the most useful discretizations are those that avoid discretization of the constraint. A freer use of e.g. explicit methods for the non-stiff differential part of the DAE is then possible.Dedicated to Germund Dahlquist on the occasion of his 70th birthdayThis author thanks the Centro de Estadística y Software Matemático de la Universidad Simón Bolivar (CESMa) for permitting her free use of its research facilities.Partial support by the Swedish Research Council for Engineering Sciences TFR under contract no. 222/91-405.     

On α-I-continuous and α-I-open functions

Montgomery and Vaughan improved a theorem of Erd?s and Fuchs for an arbitrary sequence. Sárközy extended this theorem of Erd?s and Fuchs for two arbitrary sequences which are "near" in a certain sense. Using the idea of Jurkat (differentiation of the generating function), we will extend similarly the result of Montgomery and Vaughan for "sufficiently near" sequences.     

Circle actions on 4-manifolds I

Using cohomological methods it is proved that the intersection form of a closed (cohomology-) 4-manifoldM withH ₁(M)=0 which admits a non-trivial circle action is the sum of one- and two-dimensional forms provided every fixed point has a neighbourhood containing at most 4 orbit types.     

CAS based approach for discussing subset construction

This paper continues the discussion of teaching nondeterminism (see [6]) where we presented a didactic approach introducing the notion of nondeterministic automata. Although in this paper we use the same methodology we have to face up to new didactic challenges. Namely, teaching the subset construction requires answers to the question how can CAS be used in teaching the different phases of mathematical problem solving so that we can reach higher cognitive efficiency.