一道以群的定义为背景的高考试题赏析

每一年的高考数学试卷中都有一些以高等数学背景立意的好题目,如2006年四川卷理科第16题,是一道以近世代数中群的定义为背景立意的填空题,这样的试题能够有效考查学生的学习能力、思维能力和数学创新意识,这为高校选拔学习潜质好的学生创造了条件.……     

负数的自述

我是负数,你以前虽然见过我,但我们还不很熟悉.下面就听听我的自述,我们会成为好朋友的.一、我的出现是实际生活的需要.数的扩充都是由于实际的需要而产生的,负数的引入也不例外,它是由于表示具有相反意义的量的需要而产生的.小学学过的自然数和分数只能表示相反意义的量中的一个量,不能满足实际需要,为了更好的记数而引入一种     

“1”的自述

我是数字1,大家对我似乎很熟悉,其实却不然,为了以后我们能够成为好朋友,也为了同学们能学好数学,下面请听我的自我介绍:一、我是最小的正整数,我的绝对值还是我;我的相反数是-1,-1的绝对值也是我;我的任何次幂都是我1n=1;我的算术根还是我n1=1;一个数与它倒数的积也等于我,怎么样,牛吧?其实这也不算什么,下面还有更牛的呢.     

分配格上上标准特征向量的求法

本文研究了分配格(L,∧,∨,0,1)上方阵A的上特征向量的性质.利用矩阵的伴随有向图,得到格上方阵A的上标准特征向量的一种实用的新方法.     

抓机会用“嫁接”

把要繁殖的植物的枝或芽接到另一种植物体上使它们结合在一起,成为一个独立生长的植株……叫做嫁接,嫁接能够保持植物原有的某些特性,是常用的改良品种的方法.把“嫁接”的思想应用于数学,常常可以收到意想不到的效果.     

食饵具脉冲扰动与捕食者具连续收获的时滞捕食-食饵模型

本文讨论了与生物资源管理相关的食饵具脉冲扰动与捕食者具连续收获的时滞捕食-食饵模型,得到了捕食者灭绝周期解的全局吸引和系统持久的充分条件.也证明了系统的所有解的一致完全有界.我们的结论为现实的生物资源管理提供了可靠的策略依据,也丰富了脉冲时滞微分方程的理论.     

例谈备课中新课程的导入与设问环节

备课是教师的一项基本功,是教师对教材进行再创造的过程,是集教学内容,教学方式,教学艺术于一体的一项关键设计.备课质量的高低,不仅影响着教学计划的实施和教育方针的落实,更潜在地制约着课堂教学的效率.     

手机套餐问题的一个数学模型

随着信息时代的到来,手机在人们日常工作、社交、经营等社会活动中的作用越来越重要.近年来我国通信业务量飞速增长,手机的功劳更是功不可没.手机资费问题也越来越受到人们的关注,并且对原有的各种资费方案越来越质疑.2007年1月以来上海、北京、广东等地相继推出的手机"套餐"琳琅满目,让人眼花缭乱,人们不能理性分辨手机"套餐"究竟优惠在何处.……     

赏析2011年湖北高考理科立几题

2011年高考已经落幕,笔者有意关注了湖北数学试卷,解读理科数学试卷,两道立体几何试题给我留下了很深的印象.小题的背景和问题设置让人耳目一新;大题的解法入口宽,方法多,涉及的知识面广,打破了单纯考查立体几何的常规,建立了立体几何与函数、三角、向量、解几的密切联系.这两道试题充分体现了源于教材,略高于教     

如何分遗产

古罗马一位寡妇，遵照丈夫的遗嘱，把丈夫遗留下来的3500元遗产同她即将出生的孩子一起分配。如果生的是儿子，那么，按照罗马的法律，做母亲的应分得儿子份额的一半；如果生的是女儿，做母亲的就应分得女儿份额的两倍。可发生的事情是：生了一对双胞胎——一男一女。     

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

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

Polynomial-time algorithms for regular set-covering and threshold synthesis

A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular.     

Detection of multivariate outliers with location slippage or scale inflation in left orthogonally invariant or elliptically contoured distributions

This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem.     

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.     

Milnor方图中的w-凝聚性

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

递推阻尼最小二乘法的收敛性与稳定性

递推最小二乘法是参数辨识中最常用的方法,但容易产生参数爆发现象,因此对一种更稳定的辨识方法－－递推阻尼最小二乘法进行了收敛特性的分析,在使用算法之前先旭一化测量向量,结果表明,参数化距离收敛于一个零均值随机变量并且在持续激励条件下,适应增益矩阵的条件数有界。参数化距离的方差有 。     

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

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

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.     

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.     

Logic optimality for multi-objective optimization

Pareto dominance is one of the most basic concepts in multi-objective optimization. However, it is inefficient when the number of objectives is large because in this case it leads to an unmanageable number of Pareto solutions. In order to solve this problem, a new concept of logic dominance is defined by considering the number of improved objectives and the quantity of improvement simultaneously, where probabilistic logic is applied to measure the quantity of improvement. Based on logic dominance, the corresponding logic nondominated solution is defined as a feasible solution which is not dominated by other ones based on this new relationship, and it is proved that each logic nondominated solution is also a Pareto solution. Essentially, logic dominance is an extension of Pareto dominance. Since there are already several extensions for Pareto dominance, some comparisons are given in terms of numerical examples, which indicates that logic dominance is more efficient. As an application of logic dominance, a house choice problem with five objectives is considered.