The Kissing Triangles: The Aesthetics of Mathematical Discovery

Papert's (1978) appeal to reconsider the power and possibilities of the aesthetic in mathematics learning is often ignored in mathematics education research. This paper begins with the premise, put forth by Dewey (1934), that the aesthetic structures many dimensions of inquiry and experience. In the same way that using particular paintings, musical compositions, or even everyday experiences has been instrumental to attempts by philosophers to understand the aesthetic dimensions of meaning and experience in artistic domains, I propose that analysing a particular encounter with mathematics may help reveal the nature and role of the often nebulous responses of elegance, beauty, and `fit' to which mathematicians lay claim in their mathematical activity. To achieve this, I draw on and adapt the defining features of the aesthetic character of experience set forth by the aesthetician Beardsley (1982). This, in turn, sheds light on the role thataesthetics can play in mathematical inquiry and experience, and provides initial categories and conjectures that can be used to investigate the potential roles of aesthetics in mathematics learning contexts.This revised version was published online in September 2005 with corrections to the Cover Date.     

飞秒孤子传输演化的数值研究

利用分步傅里叶法数值模拟了飞秒孤子在光纤中的传输演化过程。对光纤中单个孤子的传输及二阶孤子的自陡峭效应和自频移效应进行了分析,指出在一定的参数取值范围内,自频移效应对二阶fs孤子传输的影响要比自陡峭效应大,占主导地位,且对自陡峭效应有一定的抑制作用。     

动态激光衍射法测量细丝直径

基于夫琅禾费衍射理论和巴比涅互补原理,提出了利用激光衍射对细丝直径进行动态测量的方法.该方法具有测量精度高、速度快、非接触、使用方便且易于微机联接实现自动化测量等优点.     

波纹纤维混凝土的动力耗散研究

根据曲线纤维的几何特点和受力性能 ,推导了波纹纤维混凝土的本构关系 ,在本构理论的基础上进行动力耗散研究     

级联三能级介质中非线性光学信号的增强

揭示非最大相干可能比最大相干产生更有效的非线性频率转换. 为此以三能级级联系统(没有最大相干)为例计算其非线性光学信号的强度, 并与三能级Λ型系统(具有最大相干)进行比较. 利用非微扰方法计算表明, 在双光子共振和相同参数的条件下, 级联系统产生的非线性光学信号的最大强度约是Λ系统的两倍. 利用缀饰态表象分析表明, 两个系统中耦合跃迁的自发辐射及其介入的不可逆三光子过程具有相反的作用. 它们在级联系统中加强非线性转换, 而在Λ系统中削弱非线性转换. 关键词： 电磁感应透明 非线性光学过程 双光子共振     

Global and uniform convergence of subspace correction methods for some convex optimization problems

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained convex optimization problems. Some multigrid and domain decomposition methods are also discussed as special examples for solving some nonlinear elliptic boundary value problems.

     

Reductions of interval nonlinear programming problem

A general nonlinear programming problem with interval functions is considered. Two reductions of this problem to the deterministic nonlinear programming problem are proposed, and illustrative examples are discussed.     

ON HYPERBOLIC TIME DISCOUNTING IN EXHAUSTIBLE RESOURCE MODELS: AN APPLICATION TO WORLD OIL RESOURCES

ABSTRACT. Recent research on discounting in long term economic models involves hyperbolic discounting, in which the marginal discount rate shrinks as time passes. To investigate hyperbolic discounting and exhaustible resource allocation, this work develops a discrete‐time world oil model and model solution procedure, then uses the model to examine the consequences of adopting conventional (constant annual) discounting when hyperbolic discounting is appropriate, of adopting one hyperbolic discount rate path when a different hyperbolic path is appropriate, and of adopting hyperbolic discounting when conventional discounting is appropriate. Five conventional and two hyperbolic discount rate paths are considered. One hyperbolic path is that used by Nordhaus and Boyer [2000]; the other is that recommended by Weitzman [2001]. The generality of the findings is also assessed.     

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems

In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The LBs are derived from state space relaxations of a dynamic programming formulation, which involve the use of non-injective mapping functions guaranteing a reduction on the cardinality of the state space. The general state space relaxation procedure is extended to address problems involving transitions that go across several stages, as is the case of network flow problems. Applications for these LBs include: estimation of the quality of heuristic solutions; local search methods that use information of the LB solution structure to find initial solutions to restart the search (Fontes et al., 2003, Networks, 41, 221–228); and branch-and-bound (BB) methods having as a bounding procedure a modified version of the LB algorithm developed here, (see Fontes et al., 2005a). These LBs are iteratively improved by penalizing, in a Lagrangian fashion, customers not exactly satisfied or by performing state space modifications. Both the penalties and the state space are updated by using the subgradient method. Additional constraints are developed to improve further the LBs by reducing the searchable space. The computational results provided show that very good bounds can be obtained for concave cost network flow problems, particularly for fixed-charge problems.     

Time delay as a key to apoptosis induction in the p53 network

A feedback mechanism that involves the proteins p53 and mdm2, induces cell death as a controlled response to severe DNA damage. A minimal model for this mechanism demonstrates that the response may be dynamic and connected with the time needed to translate the mdm2 protein. The response takes place if the dissociation constant k between p53 and mdm2 varies from its normal value. Although it is widely believed that it is an increase in k that triggers the response, we show that the experimental behaviour is better described by a decrease in the dissociation constant. The response is quite robust upon changes in the parameters of the system, as required by any control mechanism, except for few weak points, which could be connected with the onset of cancer. Received 8 May 2002 / Received in final form 9 July 2002 Published online 17 September 2002