躺着思想,不如站起行动

在很久很久以前,有两个年轻人,一起去遥远的地方寻找幸福和快乐,一路上风餐露宿,历尽艰辛,在即将到达目的地时,遇到了一条风急浪高的大河.对于如何渡过这条河,两人有不同的意见:一个人建议砍伐附近的树造一条木船渡过河去,另一个人则认为这么高的浪,这么湍急的水流,这么宽的河面,无论造多大的船都不可能渡过这条河,与其自寻烦恼和死路,不如等这条河干了,再轻轻松松地走过去.     

境由心生

在现实生活中,有人总是企盼没有的,却忘了现成的,追求遥远的,却无视身边的永无止境的物质追求,让人变得贪婪;盲目的攀比,让人抱怨生活的不公境由心生,心情不好,就会失去一次次微笑着感受人生的喜悦,就会失去不少在情绪乐观时可以获得成功的机会……其实,在这个纷繁复杂、充满诱惑的社会,不羡慕别人,不轻贱目己,过自己喜欢过的日子,就是最好的日子,活自己喜欢的活法,就是最好的活法,按自己的天性度过自己的时日,就是天堂般的日子!     

例谈“以退求进”法解题策略

著名数学家华罗庚说过:善于退,足够的退,退到最原始而不失去重要的地方,是学好数学的一个诀窍.这里所谓的退,当然不是逃跑,而是养精蓄锐,蓄势待发,是在为进寻求途径,即以退为进.它的实质是借助转化的数学思想,把复杂的问题简单化,运动的问题静止化,高维问题低维化,变量问题常量化,抽象问题具体化,代数问     

形如“|x|+|y|=1”的画法及其扩展

人教版教材第二册(上)第八章第二节讲的是椭圆的简单几何性质,在对称性中有这样的描述,在曲线的方程中,如果以-y代y方程不变,那么当P(x,y)在曲线上时,它关于x轴的对称点P′(x,-y)也在曲线上,所以曲线关于x轴对称,同理如果以-x代x方程不变,那么曲线关于y轴对称,如果同时以-x代x,以     

中考数学探索题的归类及评析

近年来,数学探索题以多彩优美的格调,清新多姿的风彩,发散开放的题型,背景育人的功能,注重能力的考查,强化创新的意识,出现在全国各地的中考试卷上,并有逐年上升之势,促进了生动、活泼、主动的数学学习活动,真正起到了实施素质教育“指挥棒”的作用,本文旨对近年来中考数学探索题作些归类,并对具体实例进行评析.     

共同探究,享受数学

众所周知,数学很重要,这很大层面上是由高考指挥棒决定的,学生在沉重的数学作业负担下,大多是疲于应付,很少有人真正体验到数学内在的美,学会享受数学.笔者从事高中数学多年,做了一点有益的尝试,让学生从多种角度理解数学,师生平等,教师做好组织、引领工作,充分调动学生学习数学积极性,各抒己见,经常是一个平淡的问题,往往出现多种漂亮的解法,碰撞出思维的火花,师生乐在其中,一同享受数学带给我们的快乐.现举两个案例,供大家分享.     

抓住小条件 解决大问题

每一道习题都有着严密的逻辑性,已知条件不可能多余,也不可能短缺,在所有条件中,抓住其最有特征性的一个,联想展开,这是解题的一种途径．许多同学在解题时,往往不去认真推敲题目中给出的已知条件,对于一些细小的似乎是不起眼的说明,便不去深入探讨,弃之一旁,熟视无睹,这是一个极大的错误．很多时候,若能紧紧抓住这些小条件,便可从这里打开缺口,解决大问题．     

高盛,华尔街曾经的笑柄

第一次世界大战结束后,美国经济进入繁荣时期。伴随着经济的繁荣,美国的股市也不断攀升,一直持续着牛市行情。然而,好景不长,1929年,全球金融危机爆发,华尔街股市大崩盘,让高盛损失了92%的原始投资,公司的声誉一落千丈,濒临倒闭,沦为华尔街的笑柄、错误的代名词。     

2012年中考专题复习(1)——“数与式”

中考内容要求实数与代数式所考查的知识有:有理数,倒数,相反数,绝对值,数轴的运用,实数的大小比较,乘方,科学记数法,有效数字,二次根式,实数的估算,列代数式,解释代数式,求代数式的值,探求数与式的规律.     

例谈数学中的一般化与特殊化

一般化与特殊化是人类认识事物的两个重要侧面,也是解题的两种基本策略,它们相辅相成,是辩证的统一.在多数场合,特殊问题简单、直观,容易认识,容易把握.但是,也有一些场合,特殊问题的个别特性可能会掩盖事物的本质属性,给解题带来困难,而直接求解相应的一般性问题,反而来得简便、明快、奇巧.     

限制情况下装卸工问题的最优解

装卸工问题是从现代物流技术中提出的一个实际问题,这个问题的雏形早在上个世纪60年代中国科学院数学研究所就提出和研究过.现代物流技术迅速发展,促成和推动装卸工问题的提出和研究.装卸工问题是一个新的NP困难的组合优化问题,首先介绍装卸工问题及限制情况下装卸工问题的数学模型,然后分析限制情况下的装卸工问题的性质,最后给出该问题的所有最优解.     

取油管振动方程解的整体不存在性

讨论推广的海底取油管振动方程的初边值问题和初值问题解的整体不存在性,对初边值问题推广了Gmira和Guedda得到的结果,对初值问题的结果是新的.     

三种新变形的全一问题

该文研究三种新变形的全一问题及最小全一问题. 原始的全一问题可被形象的称为顶点点亮顶点问题, 而这三类新问题则分别被称为顶点点亮边问题,边点亮顶点问题,边点亮边问题. 顶点点亮顶点问题已经得到了广泛的研究. 比如,解的存在性问题和求解的有效算法已经被解决,一般图上的最小顶点点亮顶点问题已经被证明是NP- 完备的,树、单圈图和双圈图上的最小顶点点亮顶点问题的线性时间最优算法也已被给出等. 该文对于顶点点亮边问题,证明一个图有解当且仅当它是二部图,因此只可能有两组解和最优解. 对于边点亮顶点问题,证明一个图有解当且仅当它包含偶数个顶点,并通过将其最优问题多项式变换成最小权的完美匹配问题,得出一般图上的最小边点亮顶点问题可在多项式时间内求解. 边点亮边问题可归约成线图上的顶点点亮顶点问题.     

On the algorithm of the solution of the signorini problem

An algorithm is proposed for solving the Signorini problem /1/ in the formulation of a unilateral variational problem for the boundary functional in the zone of possible contact /2/. The algorithm is based on a dual formulation of Lagrange maximin problems for whose solution a decomposition approach is used in the following sense: a Ritz process in the basis functions that satisfy the linear constraint of the problem, the differential equation in the domain, is used in solving the minimum problem (with fixed Lagrange multipliers); the maximum problem is solved by the method of descent (a generalization of the Frank-Wolf method) under convexity constraints on the Lagrange multipliers. The algorithm constructed can be conisidered as a modification of the well-known algorithm to find the Udzawa-Arrow-Hurwitz saddle points /3, 4/. The convergence of the algorithm is investigated. A numerical analysis of the algorithm is performed in the example of a classical contact problem about the insertion of a stamp in an elastic half-plane under approximation of the contact boundary by isoparametric boundary elements. The comparative efficiency of the algorithm is associated with the reduction in the dimensionality of the boundary value problem being solved and the possibility of utilizing the calculation apparatus of the method of boundary elements to realize the solution.     

A Note on the Stability of the Integral-Differential Equation of the Hyperbolic Type in a Hilbert Space

In this paper, the initial-value problem for integral-differential equation of the hyperbolic type in a Hilbert space H is considered. The unique solvability of this problem is established. The stability estimates for the solution of this problem are obtained. The difference scheme approximately solving this problem is presented. The stability estimates for the solution of this difference scheme are obtained. In applications, the stability estimates for the solutions of the nonlocal boundary problem for one-dimensional integral-differential equation of the hyperbolic type with two dependent limits and of the local boundary problem for multidimensional integral-differential equation of the hyperbolic type with two dependent limits are obtained. The difference schemes for solving these two problems are presented. The stability estimates for the solutions of these difference schemes are obtained.     

2010年研究生数学建模竞赛A题综述

第七届全国研究生数学建模竞赛A题是生物信息学中的一个急需解决的问题.虽然有关问题的研究已经经历了十多年,但由于问题的复杂性,人们的认识还很局限,基本的结论大多还以定性的为主,定量的探讨正方兴未艾.对参赛队员来讲解决该问题是一个极大的挑战.研究生们在讨论该问题时,大多直接进行分类.然而对于一个小样本的学习问题,显然这样做是行不通的.所以问题的关键是从数学和生物学角度减少用于分类的特征数目.同时,对于获取的基因标签,需要从临床上或生物学角度找到验证.该问题的求解过程引导研究生们从数学建模走向解决实际问题.     

Stability estimates for the solution to the problem of determining the kernel of a viscoelastic equation

For an integrodifferential equation corresponding to a two-dimensional viscoelastic problem, we study the problem of defining the spatial part of the kernel involved in the integral term of the equation. The support of the sought function is assumed to belong to a compact domain Ω. As information for solving this inverse problem, the traces of the solution to the direct Cauchy problem and its normal derivative are given for some finite time interval on the boundary of Ω. An important feature in the statement of the problem is the fact that the solution of the direct problem corresponds to the zero initial data and a force impulse in time localized on a fixed straight line disjoint with Ω. The main result of the article consists in obtaining a Lipschitz estimate for the conditional stability of the solution to the inverse problem under consideration.     

Boundary conditions of the second-order differential equation and the Riccati equation

The conversion of a second-order linear ordinary differential equation with variable coefficients into a Riccati equation depends on whether the second-order problem is an initial-value or two-point boundary-value problem. The distinction is critical in determining the initial condition for the Riccati equation. If the second-order problem is an initial-value problem, the choice of the Riccati transformation depends on whether a zero initial condition for the function or its derivative is specified. If the problem is a two-point boundary-value problem, special methods must be introduced as described in the paper.     

Determining the boundary of a two-dimensional region from the solution of the external initial boundary-value problem for the heat equation

We determine the boundary of a two-dimensional region using the solution of the external initial boundary-value problem for the nonhomogeneous heat equation. The initial values for the boundary determination include the right-hand side of the equation and the solution of the initial boundary-value problem given for finitely many points outside the region. The inverse problem is reduced to solving a system of two integral equations nonlinear in the function defining the sought boundary. An iterative procedure is proposed for numerical solution of the problem involving linearization of integral equations. The efficiency of the proposed procedure is investigated by a computer experiment.     

On the complexity of the dominating induced matching problem in hereditary classes of graphs

The dominating induced matching problem, also known as efficient edge domination, is the problem of determining whether a graph has an induced matching that dominates every edge of the graph. This problem is known to be NP-complete. We study the computational complexity of the problem in special graph classes. In the present paper, we identify a critical class for this problem (i.e., a class lying on a “boundary” separating difficult instances of the problem from polynomially solvable ones) and derive a number of polynomial-time results. In particular, we develop polynomial-time algorithms to solve the problem for claw-free graphs and convex graphs.