Measurements of theg-factor ratio of the first 3− and 5− states in40Ca and the lifetime of the 5− state

[Theg-factor ratio of the first excited 3^? and 5^? states in⁴⁰Ca was measured to beg ₃/g ₅=1.01(10) employing the implantation perturbed angular correlation technique. The static hyperfine fields (SF) in Fe and Gd hosts were used. In addition the lifetime of the 5^? state was measured to be τ=426(7)ps. The values of the SF in Gd and Fe hosts were deduced and compared with systematics in this element region.     

Cognitive Demands and Second-Language Learners: A Framework for Analyzing Mathematics Instructional Contexts

The issues involved in teaching English language learners mathematics while they are learning English pose many challenges for mathematics teachers and highlight the need to focus on language-processing issues related to teaching mathematical content. Two realistic-type problems from high-stakes tests are used to illustrate the complex interactions between culture, language, and mathematical learning. The analyses focus on aspects of the problems that potentially increase cognitive demands for second-language learners. An analytical framework is presented that is designed to enable mathematics teachers to identify critical elements in problems and the learning environment that contribute to increased cognitive demands for students of English as a second language. The framework is proposed as a cycle of teacher reflection that would extend a constructivist model of teaching to include broader linguistic, cultural, and cognitive processing issues of mathematics teaching, as well as enable teachers to develop more accurate mental models of student learning.     

Generalized green operator for an impulsive boundary-value problem with switchings

We establish constructive existence conditions and construct a generalized Green operator for the construction of solutions of a Noetherian linear boundary-value problem for a system of ordinary differential equations with switchings and pulse action in critical and noncritical cases. __________ Translated from Neliniini Kolyvannya, Vol. 10, No. 1, pp. 51–65, January–March, 2007.     

The π-π-theorem for manifold pairs with boundaries

The surgery obstruction of a normal map to a simple Poincaré pair (X, Y) lies in the relative surgery obstruction group L _*(π ₁(Y) → π ₁(X)). A well-known result of Wall, the so-called π-π-theorem, states that in higher dimensions a normal map of a manifold with boundary to a simple Poincaré pair with π ₁(X) ? π ₁(Y) is normally bordant to a simple homotopy equivalence of pairs. In order to study normal maps to a manifold with a submanifold, Wall introduced the surgery obstruction groups LP _* for manifold pairs and splitting obstruction groups LS _*. In the present paper, we formulate and prove for manifold pairs with boundary results similar to the π-π-theorem. We give direct geometric proofs, which are based on the original statements of Wall’s results and apply obtained results to investigate surgery on filtered manifolds.     

Fourier–Padé Approximants for Angelesco Systems

We study linear and nonlinear simultaneous Fourier-Pade approximation for Angelesco systems of functions and give the exact rate of convergence/divergence of the approximants in terms of the solution of associated vector equilibrium potential problems which differ for the linear and nonlinear cases.     

On the distribution of the number of retrials

We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged customer, until he finds an available server.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

Dynamic programming in cricket: optimizing batting order for a sticky wicket

In cricket, a rain-affected pitch can make batting more difficult than normal. Several other conditions such as poor light or an initially lively pitch, may also result in difficulties for the batsmen. In this note, we refer to all of them as ‘sticky wickets’. On sticky wickets, lower order batsmen are often sent into ‘hold the fort’ until conditions improve. In this paper, a stochastic dynamic programming model is used to examine the appropriateness of this policy. The model suggests that the tactic is often optimal when the sticky wicket persists until the end of the day's play, but not often when the sticky wicket is transitory. In some circumstances, it is worthwhile, on a normal wicket near the end of the day, to send in a lower order batsman to hold the fort (a night watchman): when the wicket is sticky, this tactic is even more worthwhile.