“关灯”游戏的数学建模与求解

对互联网上的一个数学游戏的控制问题,进行了一般性推广,运用数学建模的方法给出了其基于有限域上的线性方程组的数学模型及求解.     

复Fuzzy函数的Buckley导数与Buckley积分

本文对Ｊ．Ｊ．Ｂｕｃｋｌｅｙ在［１］、［２］中给出的实变量复Ｆｕｚｚｙ数值函数的导数与积分加以推广,引出复变量复Ｆｕｚｚｙ数值的导数与积分概念,为研究Ｆｕｚｚｙ复分析打下一定的基础。     

Hjek-Rēnyi不等式的推广及其应用

对H~ajek-Rēnyi[1]不等式进行了推广,利用推广的不等式给出了随机变量序列绝对平均意义下的强大数定律的一个条件.     

Hajek—Renyi不等式的推广及其应用

对Hajek-Renyi不等式进行了推广，利用推广的不等式给出了随机变量序列绝对平均意义下的强大数定律的一个条件．     

皮尔曲线模型的推广及其应用

在分析皮尔曲线模型增长特性的基础上 ,提出了 1 4种推广模型 ,并依据这些模型建立了几种主要耐用消费品拥有量的预测模型 .预测模型的精度很高     

一个状态控制问题的数学建模与求解

对互联网上的一个数学游戏的控制问题,进行了一般性推广,运用数学建模的方法给出了其基于有限域上的线性方程组的数学模型及求解.     

工科院校一年级新生数学教学对策

在高中教育逐步得到普及,高等教育不断扩招的情况下,对淮海工学院大学一年级新生数学学习的实际状况进行了调查,研究了学生对《新课标》内容的掌握程度,得到了一些解决高等数学教材及教学应对实际情况与变化的对策。     

云南铁皮石斛生态环境中的数学方法研究

结合已有文献和方法,构建了云南铁皮石斛生态环境中的数学方法.运用云南石斛的调查资料及生态环境普查资料,对该方法进行验证并修正完善.并给出推广应用的建议,供相关决策机构、企业及种植户参考.     

线性规划对偶单纯形法的常识性经济解释

线性规划对偶单纯形法的数学描述是抽象且不易理解的 ,本文找到了一种常识性经济解释的描述 .既通俗易懂、又能抓住方法的实质 .这将从通俗易懂的思想方法上促进线性规划问题解法的普及推广应用     

可拓学的应用研究、普及与推广(综述)

可拓学研究的核心是如何通过变换处理矛盾问题.介绍了近年在计算机、设计、管理、控制、检测和中医药等领域利用可拓论和可拓方法的应用研究情况,提出今后可拓学普及与推广的方向.     

Some personal experiences in popularizing mathematical methods in the People's Republic of China†

This report is a summing‐up of some personal experiences so far accumulated in the on‐going course of the popularization of mathematical methods in the People's Republic of China. Some techniques and methodology currently in use both inside and outside China are critically reviewed.

     

融入项目类别信息的协同过滤推荐算法

协同过滤技术在电子商务领域得到了广泛的研究和应用,但是随着互联网的迅速普及和电子商务网站规模的急剧增长,用户评分的极端稀疏性导致协同过滤方法的推荐质量不高.提出了一种融入项目类别信息的协同过滤推荐算法,结合项目的类别信息为活动用户筛选出候选近邻集合,在候选近邻集合内综合利用项目的评分信息和类别信息对未评分值进行预测,最后依据用户实际评分和预测评分计算出活动用户的最近邻集合并进行推荐.实验结果表明,该算法具有较好的推荐准确性和实时性.     

空间啮合共轭齿廓曲率计算的新方法

提出一种新的空间啮合共轭齿廓曲率计算的方法,避免了大多数献中普遍采用的并矢这一数学工具,其特点是采用计算和作图相结合的方法,简明,直观。     

应用型人才培养中高等数学的教学质量与教学改革

应用型本科教育是一种新型的本科教育。培养应用型人才中高等数学等理论课的教学质量与教学改革,必须从我国高等教育进入大众化现状来思考,从我国基础教育实施新课程情况来思考,从培养应用型人才的定位来思考,从素质教育观来思考,从高等数学教学改革来思考.     

刍议大学数学教学活动的问题与对策

当前各高校的大学数学教学或多或少存在一些不协调的地方,如理科类学生课程深度过大,文科类学生数学能力弱,考核试卷的难度控制不好等等.针对大学数学的教学法及大众化教育的分析研究,结合教学实践,提出大学数学教学改革的一些对策.     

关于6 Sigma与3 Sigma的比较

在企业推广6σ的过程中,经常有学员不明白为什么6σ比3σ好,甚至有人会说6σ的规格限比3σ的规格限宽,当然6σ的合格率比3σ的合格率高。本文认为文献[1]、[2]关于6σ与3σ的比较图是引起这种误会的根源。为此本文给出另外的比较和解释。     

Dual bases for Wang-Bézier basis and their applications

This paper presents the dual bases for Wang-Bézier curves with a position parameter L, which include Bézier curve, Wang-Ball curve and some intermediate curves. The Marsden identity and the transformation formulas from Bézier curve to Wang-Bézier curve are also given. These results are useful for the application of Wang-Bézier curve and their popularization in Computer Aided Geometric Design.     

The dual bases for the Bézier-Said-Wang type generalized Ball polynomial bases and their applications

A unifying representation for the existing generalized Ball bases and the Bernstein bases are given. Then the dual bases for the Bézier-Said-Wang type generalized bases (BSWGB for short) are presented. The Marsden identity and the mutual transformation formulas between Bézier curve and Bézier-Said-Wang type generalized curve (BSWGB curve) are also given. These results are very useful for the applications of BSWGB curves and their popularization in CAGD. Numerical examples are also given to show the effectiveness of our methods.     

Local Fourier analysis for multigrid with overlapping smoothers applied to systems of PDEs

Since their popularization in the late 1970s and early 1980s, multigrid methods have been a central tool in the numerical solution of the linear and nonlinear systems that arise from the discretization of many PDEs. In this paper, we present a local Fourier analysis (LFA, or local mode analysis) framework for analyzing the complementarity between relaxation and coarse‐grid correction within multigrid solvers for systems of PDEs. Important features of this analysis framework include the treatment of arbitrary finite‐element approximation subspaces, leading to discretizations with staggered grids, and overlapping multiplicative Schwarz smoothers. The resulting tools are demonstrated for the Stokes, curl–curl, and grad–div equations. Copyright © 2011 John Wiley & Sons, Ltd.     

Parametric methods in integer linear programming

In contrast to methods of parametric linear programming which were developed soon after the invention of the simplex algorithm and are easily included as an extension of that method, techniques for parametric analysis on integer programs are not well known and require considerable effort to append them to an integer programming solution algorithm.The paper reviews some of the theory employed in parametric integer programming, then discusses algorithmic work in this area over the last 15 years when integer programs are solved by different methods. A summary of applications is included and the article concludes that parametric integer programming is a valuable tool of analysis awaiting further popularization.