空间直线与平面

本单元的知识点主要有：平面的基本性质（三个公理及推论，空间图形的直观画法），线线关系（平行，异面，垂直，异面直线所成的角），线面关系（平行，相交，垂直，斜线在平面内的射影，直线和平面所成的角，三垂线定理），面面关系（平行，垂直，相交，二面角的平面角）．     

新教材中几点商榷之处

1．人教A版选修2-1P98A组第11题已知向量a，b，c是空间的一个单位正交基底，向量a＋b，a-b，c是空间的另一个基底，若向量p在基底口，b，c下的坐标为（1，2，3），求p在基底a＋b，a-b，c下的坐标．     

顾准的饭碗与理想

顾准（1915—1974），字哲云，上海人，中国当代学者，思想家，经济学家，会计学家。顾准被称为“有三个大脑的人”，用易中天的话说，“惟其思绪敏捷聪颖，才能在建国初期的大上海身兼数职，也才能在当学徒、当教授、当领导时，都先走一步，高人一筹。”     

基于巴斯卡数据成败型元件串联系统可靠性经典精确置信限

设Ａ为由Ｋ个相互独立的成败型元件组成的串联系统，第ｉ个元件的可靠性ｐｉ，ｐｉ未知，ｉ＝１，２，…，Ｋ．设对第ｉ个元件，对于给定的ｍｉ，有ｎｉ个巴斯卡试验数据：Ｘｉ１，Ｘｉ２，…，Ｘｉｎｉ，其中Ｘｉｊ表示对第ｉ个元件进行试验，试验进行到ｍｉ次成功时所需要的试验次数ｊ＝１，２，…，ｎｉ，ｉ＝１，２，…，Ｋ．记Ｔｉ＝Ｘｉ１＋Ｘｉ２＋…＋Ｘｉｎｉ，ｉ＝１，２，…，ｋ．本文研究基于统计量（Ｔ１，Ｔ２，…，Ｔｋ）求串联系统Ａ的可靠性经典精确最优置信下限．     

数列和式不等式的放缩策略

数列和式不等式的证明经常在竞赛题或试卷压轴题的最后一问出现，在思维能力和方法上要求很高，往往让人束手无策，其实，这类不等式的证明，是有章可循的，遵循什么章？就是要把和求出来，求出后再放缩，更多的情况下是不能直接求和的，这时就要先把通项放大或缩小，使得每一项按照相同的规律放大或缩小后，把和求出来，求和后再放缩，下面简述几个用来证明数列和式不等式的一般性策略。     

巧用（-1）^n求摆动数列的通项

在数列中，我们经常会碰到求形如：1，-1，1，-1，…或-1，1，-1，1，…等数列的通项，很显然，我们只要利用（-1）^n进行符号的调整，就能很快求出数列的通项公式，我们不禁会思考，在其它的摆动数列中，还能不能用（-1）^n去求通项？     

如何上好数学基础课

本文就如何上好数学基础课，谈一些个人感受，欢迎批评指正．1教学目标教学的目标至少应包含以下三个．第一，传授知识．教师应将书本知识讲活，讲透，使学生易于接受，便于掌握，使学生兴趣盎然，乐于接受；第二，培养学生的学习能力．授人以鱼，不如授人以渔．教师应培养学生的读书能力，动手能力，使他们善于获取新的知识；第三，培养学生的探索未知的方法和能力，     

高考数列压轴题的若干破解策略

近年来，高考数列压轴题的考查力度很大，尤其最后一问，综合性强，绝大部分考生感觉难度较大，在这些难题中，有一类题给出了递推关系式，其递推式中隐含一定的规律，常规思路难以切入，须采用一些特别的策略才能破解，本文通过分析近几年这类高考题，介绍几种破解策略，希望对大家有所启发。     

问渠那得清如许，惟有源头活水来——读稿有感

自1996年起，我有幸成为《数学通讯》的编委，审读“专题写作”栏目的稿件，“专题写作”是本刊的一个传统栏目，曾有不少数学家在这一栏目下发表过精彩的文章，担任其职，大有诚惶诚恐之感，深怕自己不能胜任，痛失珠玑，几年来，本人对所任工作，虽不敢说是呕心沥血，但可以说是问之无愧。     

巧用柯西不等式的变式解一类分式问题

我们知道柯西不等式：设a1，a2，a3，…，an和b1，b2，b3，…，bn是给定的实数，则     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

���������˻�����������ͽ�ģ������Ӧ��

At present, in degradation tests, product failure is generally defined as degradation of performance below or above a specified critical value (that is called single point degradation). Although this definition is simple and practical, it is not reasonable enough and degradation failure of the product can not be completely described. In this paper, a single point degradation model is improved, and an interval degeneration model is proposed. We discuss the interval degradation model when the degradation path is liner, and obtain life distribution functions for all kinds of linear interval degradation model. Numerical integration and Monte Carlo simulation methods are used to analyze and compare the life distribution of the interval degradation model and the single point degradation model, and the relationship between the interval degradation and the single point degradation is revealed. Finally, an real data example is analysis to show that interval egradation is more reasonable and effective in practice.     

油田注水系统拓扑布局优化的混合遗传算法

以投资最小为目标函数,建立了注水系统拓扑布局优化数学模型.根据模型特点,将优化问题分为两层,分别采用遗传算法和非线性优化方法进行求解.并对遗传算法的操作过程进行了改进,调整了适应函数,改进了交叉和变异操作,结合了模拟退火算法,在操作过程中使约束条件得到满足,减少了不可行解的产生,使遗传算法的优化性能得到了提高.优化算例说明了该方法的有效性.     

沪深股市收益的相关性

以概率作为相关度量指标,分整体相关性和尾部相关性对沪深两市收益进行考察。整体相关性采用概率方法中的变化协调形成的相关性作为度量,结果表明沪深两市收益在整体上具有一定的正相关性。对于尾部相关性,先用t分布分别拟事两市收益底分布,然后用蒙特卡洛模拟确定尾部的最优门限,进而求得尾部相关性,结果显示当市场剧烈波动时两市收益具有正的相关性,且比整体相关性强,尤其在暴跌的时候,两市具有很强的正相关性。     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

Chaotic synchronization with filter based on wavelet transformation

A kind of chaotic synchronization method is presented in the paper. In the transmitter, part signals are transformed by wavelet and the detail information is removed. In the receiver, the component with low frequency is reconstructed and discrete feedback is used, we show that synchronization of two identical structure chaotic systems is attained. The effect of feedback on chaotic synchronization is discussed. Using the synchronous method, the transmitting signal is transported in compressible way, system resource is saved, the component with high frequency is filtered and the effect of disturbance on synchronization is reduced. The synchronization method is illustrated by numerical simulation experiment.     

An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem

In this paper, the problem of locating new facilities in a competitive environment is considered. The problem is formulated as the firm expected profit maximization and a set of nodes is selected in a graph representing the geographical zone. Profit depends on fixed and deterministic location costs and, since customers are independent decision-makers, on the expected market share. The problem is an instance of nonlinear integer programming, because the objective function is concave and submodular. Due to this complexity a branch & bound method is developed for solving small size problems (that is, when the number of nodes is less than 50), while a heuristic is necessary for larger problems. The branch & bound is called data-correcting method, while the approximate solutions are obtained using the heuristic-concentration method.     

Banach空间有界线性算子强连续双半群

本文在Ｂａｎａｃｈ空间上研究单参数有界线性算子族－强连续双半群。     

Compromise solutions and estimation of the noninferior set

A general framework is presented in which the relation of the set of noninferior points and the set of compromise solutions is studied. It is shown that the set of compromise solutions is dense in the set of noninferior points and that each compromise solution is properly noninferior. Also, under convexity of the criteria space, a characterization of the properly noninferior points in terms of the compromise solutions is presented. In this characterization, the compromise solutions depend continuously on the weights. Use of the maximum norm is studied also. It is shown that a subset of these max-norm solutions, obtained by taking certain limits of compromise solutions, is dense and contained in the closure of the set of noninferior points.     

Strong conjugation actions induced by flags of exact Borel subalgebras

Let A be a quasi-hereditary algebra with a strong exact Borel subalgebra. It is proved that for any standard semisimple subalgebra T there exists an exact Borel subalgebra B of A such that T is a maximal semisimple subalgebra of B. It is shown that the maximal length of flags of exact Borel subalgebras of A is the difference of the radium and the rank of Grothendic group of A plus 2. The number of conjugation-classes of exact Borel subalgebras is 1 if and only if A is basic; the number is 2 if and only if A is semisimple. For all other cases, this number is 0 or no less than 3. Furthermore, it is shown that all the exact Borel subalgebras are idempotent-conjugate to each other, that is, for any exact Borel subalgebras B and C of A, there exists an idempotent e of A, and an invertible element u of A, such that eBe = u^-1eCeu.