Appropriate problems for learning and for performing—an issue for teacher training

Selecting, modifying or creating appropriate problems for mathematics class has become an activity of increaing importance in the professional development of German mathematics teachers. But rather than asking in general: “What is a good problem?” there should be a stronger emphasis on considering the specific goal of a problem, e.g.: “What are the ingredients that make a problem appropriate for initiating a learning process” or “What are the characteristics that make a problem appropriate for its use in a central test?” We propose a guiding scheme for teachers that turns out to be especially helpful, since the newly introduced orientation on outcome standards a) leads to a critical predominance of test items and b) expects teachers to design adequate problems for specific learning processes (e.g. problem solving, reasoning and modelling activities).     

Upper Bounds for a Ramsey Theorem for Trees

For natural numbers n, k, r and s there exists a complete tree ? of height and arity $r^{\left( {\mathop {K + 1}\limits_s } \right)} (n - 1) + 1$ such that for an arbitrary r-colouring of the s-chains of T a level-preserving monochromatically embedded copy of a complete tree of height k and arity n can be found in T. Moreover, a best possible upper bound for K is given.     

Algorithms for Computing Characters for Symmetric Spaces

Symmetric spaces or more general symmetric k-varieties can be defined as the homogeneous spaces G _k /K _k , where G is a reductive algebraic group defined over a field k of characteristic not 2, K the fixed point group of an involution θ of G and G _k resp. K _k the sets k-rational points of G resp. K. These symmetric spaces have a fine structure of root systems, characters, Weyl groups etc., similar to the underlying algebraic group G. The relationship between the fine structure of the symmetric space and the group plays an important role in the study of these symmetric spaces and their applications. To develop a computer algebra package for symmetric spaces one needs explicit formulas expressing the fine structure of the symmetric space and group in terms of each other. In this paper we consider the case that k is algebraically closed and give explicit algorithmic formulas for expressing the characters of the weight lattice of the symmetric space in terms of the characters of the weight lattice of the group. These algorithms can easily be implemented in a computer algebra package. The root system of the symmetric space can be described as the image of the root system of the group under a projection π derived from an involution θ on . This implies that . Using these formulas for the characters of each of these lattices we show that in fact . A.G. Helminck is partially supported by N.S.F. Grant DMS-0532140.     

Algorithms for approximation of invariant measures for IFS

We prove convergence of two algorithms approximating invariant measures to iterated function systems numerically. We consider IFSs with finitely many continuous and injective non-overlapping maps on the unit interval. The first algorithm is a version of the Ulam algorithm for IFSs introduced by Strichartz et al. [16]. We obtain convergence in the supremum metric for distribution functions of the approximating eigen-measures to a unique invariant measure for the IFS. We have to make some modifications of the usual way of treating the Ulam algorithm due to a problem concerning approximate eigenvalues, which is part of our more general situation with weights not necessarily being related to the maps of the IFS. The second algorithm is a new recursive algorithm which is an analogue of forward step algorithms in the approximation theory of ODEs. It produces a sequence of approximating measures that converges to a unique invariant measure with geometric rate in the supremum metric. The main advantage of the recursive algorithm is that it runs much faster on a computer (using Maple) than the Ulam algorithm.Mathematics Subject Classification (2000): 37A30, 37C30, 37M25, 47A58Acknowledgement I would like to express my deep gratitude to Andreas Strömbergsson and to the anonymous referee. The referee had several very enlightening comments, which Andreas helped me to deal with. Section 4 is essentially due to Andreas and he also came up with the new Proposition 3 and helped me to improve Lemma 1. Thanks also to Svante Janson, Anders Johansson, Sten Kaijser, Robert Strichartz and Hans Wallin.     

积分中值定理中间点比较及有关平均不等式

中值定理中间点是区间端点的平均.设f (x)、g(x)在同一区间[a,b]内严格单调并可积,p(x)、q(x)恒正可积,按积分中值定理各有唯一的中间点ξf ,p(a,b)和ξg,q(a,b) .当f递增(减)且f (g- 1)凸(凹)时,有ξg,p(a,b) <ξf,p(a,b) ;当p(x)q(x) 递增(减)且q(x) ∫bap(x) dx >( <) 0时,有ξf,q(a,b) <ξf ,p(a,b) .由此可证明和发现一系列有关平均的不等式.     

多产品公司创建平台邀请竞争对手进行联合销售的策略研究

由于资金分配或生产规模的限制,多产品公司的某类产品与专门销售此类产品的专业产品公司相比,会有一定的不足.以两个产品公司为对象,研究了两个竞争性公司的联合销售模式,即多产品公司投资建设平台,邀请销售单一产品的专业公司在平台上共同销售某类产品.运用主从博弈建立联合销售的基础模型,探讨不同销售模式下的相关投资,并利用数值计算进行决策分析.研究表明,通过创建平台进行联合销售,一方面,消除了消费者的额外购物成本;另一方面,在平台进行联合销售使得两个公司由单纯的竞争关系转化为相互补充,不仅能够吸引更多有不同产品需求的客户,而且能够在一定程度上提高两个产品公司的利润.     

Global existence for a nonlocal model for adhesive contact

Abstract

In this paper, we address the analytical investigation into a model for adhesive contact introduced in a paper by Freddi and Fremond, which includes nonlocal sources of damage on the contact surface, such as the elongation. The resulting PDE system features various nonlinearities rendering the unilateral contact conditions, the physical constraints on the internal variables, as well as the contributions related to the nonlocal forces. For the associated initial-boundary value problem, we obtain a global-in-time existence result by proving the existence of a local solution via a suitable approximation procedure and then by extending the local solution to a global one by a nonstandard prolongation argument.     

Graphical Diagnostics for Markov Models for Categorical Data

Markov models are widely used as a method for describing categorical data that exhibit stationary and nonstationary autocorrelation. However, diagnostic methods are a largely overlooked topic for Markov models. We introduce two types of residuals for this purpose: one for assessing the length of runs between state changes, and the other for assessing the frequency with which the process moves from any given state to the other states. Methods for calculating the sampling distribution of both types of residuals are presented, enabling objective interpretation through graphical summaries. The graphical summaries are formed using a modification of the probability integral transformation that is applicable for discrete data. Residuals from simulated datasets are presented to demonstrate when the model is, and is not, adequate for the data. The two types of residuals are used to highlight inadequacies of a model posed for real data on seabed fauna from the marine environment.

Supplemental materials, including an R-package RMC with functions to perform the diagnostic measures on the class of models considered in this article, are at the journal’s website. The R-package is also available at CRAN.     

Continuity Adjustment for Control Charts for Attributes

A unified approach is proposed for making a continuity adjustment on some control charts for attributes, e.g., np-chart and c-chart. through adding a uniform (0,1) random observation to the conventional sample statistic (e.g., npi and ci). The adjusted sample statistic then has a continuous distribution. Consequently, given any Type I risk a (the probability that the sample statistic is on or beyond the control limits), control charts achieving the exact value of a can be readily constructed. Guidelines are given for when to use the continuity adjustment control chart, the conventional Shewhart control chart (with ±3 standard deviations control limits), and the control chart based on the exact distribution of the sample statistic before adjustment.     

Algorithm for compiling optimal schedule for parallel-sequential networks

An algorithm is described for compiling an optimal schedule for a computational process simulated by a parallel-sequential network, and also for a homogeneous computational system.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 48, pp. 200–204, 1974.     

Estimates for the classical parametrix for the Laplacian

We consider the integral operators which were used classically to give a parametrix and remainder for the Laplacian on a Riemannian manifold. Their kernels are defined in terms of the distance function. These operators are shown to be bounded operators on the L₂ Hilbert spaces of differential forms, under the hypotheses that the manifold be complete and of finite volume, and that it satisfy curvature bounds. Furthermore, the remainder is shown to be compact.     

Fast heuristics for protection networks for dynamic routing

Traffic volatility and network reliability are important issues in the provision of high speed network services. We consider the construction of a second network, the protection network which can carry overload traffic due to the failure or congestion of any two links in the original network. The level of protection against such contingencies can be specified by a traffic requirement matrix. We construct a fully connected protection network, for an n node network, using an O(n²) heuristic based on the largest two traffic requirements for each node. This procedure is then modified to generate a more effective O(n⁴) heuristic, both methods facilitate fast processing for two-hop dynamic routing. We compare the performance of the heuristics with the O(n¹⁵) optimal solution.     

A Poisson process reparameterisation for Bayesian inference for extremes

A common approach to modelling extreme values is to consider the excesses above a high threshold as realisations of a non-homogeneous Poisson process. While this method offers the advantage of modelling using threshold-invariant extreme value parameters, the dependence between these parameters makes estimation more difficult. We present a novel approach for Bayesian estimation of the Poisson process model parameters by reparameterising in terms of a tuning parameter m. This paper presents a method for choosing the optimal value of m that near-orthogonalises the parameters, which is achieved by minimising the correlation between the asymptotic posterior distribution of the parameters. This choice of m ensures more rapid convergence and efficient sampling from the joint posterior distribution using Markov Chain Monte Carlo methods. Samples from the parameterisation of interest are then obtained by a simple transform. Results are presented in the cases of identically and non-identically distributed models for extreme rainfall in Cumbria, UK.     

A framework for decision support systems for scheduling problems

Considering a decision support system as a tool where executive's judgment can be included along with the mathematical tool kit of the management scientist, this paper shows the need to include problem management as an integral component of the decision support system for scheduling problems. A methodology based on the resolution of conflicts among various constraints in scheduling problems is proposed to implement the problem management system in a decision support system for these problems. The paper concludes with some guidelines to create a workable framework for providing effective decision support to solve scheduling problems and the identification of some fruitful directions for future research.     

A unified theory for homotopy principles for multimaps

In this article, we present a definition of d-essential and d–L-essential maps in completely regular topological spaces and we establish a homotopy property for both d-essential and d–L-essential maps. Also using the notion of extendability, we present new continuation theorems.     

Projection Method for Cauchy Problem for an Operator-Differential Equation

In the current paper, we study a projection method for a Cauchy problem for an operator-differential equation with a leading self-adjoint operator A(t) and a subordinate linear operator K(t) in a Hilbert space. The projection subspaces are linear spans of eigenvectors of an operator similar to A(t). It is assumed that the operators A(t) and K(t) are sufficiently smooth. Error estimates for the approximate solutions and their derivatives are obtained. The application of the developed method for solving the initial boundary value problems is given.     

Convergence conditions for the Brown-Robinson iterative method for bimatrix games

The article considers the convergence of the Brown-Robinson iterative method to find a mixed-strategy equilibrium in a bimatrix game. The known result on convergence to an equilibrium for a zero-sum game is generalized to a wider class of games that are reducible to zero-sum games by a composition of various transformations: addition of a constant to any column of the first-player payoff matrix; addition of a constant to any row in the second-player payoff matrix; multiplication of the payoff matrix by a positive constant α>0. Translated from Prikladnaya Matematika i Informatika, No. 2, pp. 69–83, 1999.     

Frames for operators

Frames in Hilbert spaces are a redundant set of vectors which yield a representation for each vector in the space. In the present paper, we give a generalization of frames, which allows, in a stable way, to reconstruct elements from the range of a linear and bounded operator in a Hilbert space.