数学课堂教学目标设计与陈述案例研究——以“任意角”为例

课堂教学目标是课堂教学设计的“灵魂”,对学生掌握知识、提高技能、培养能力、形成素养起到引领作用.以“任意角”课堂教学目标设计与陈述为例,就如何确定课堂教学目标、如何叙写教学目标以及教学目标的陈述方法等进行阐述,帮助教师解决数学课堂教学目标表层问题.     

课堂教学设计的几点思考

数学课堂教学是学生获取数学知识、数学基本技能的主渠道 .因此 ,要想取得好的教学效果 ,就必须对数学课堂教学进行精心的设计 .本文从教学目标、教学语言、课堂提问、板书设计等几方面谈谈对数学课堂教学设计的一些做法和体会 .1　明确具体的教学目标是课堂教学设计的前提《教学大纲》、《考试说明》指出了中学数学教学的总目标是 :使学生学好从事社会主义现代化建设和进一步学习现代科学技术所必须的数学基础知识与基本技能 ,培养学生的运算能力、逻辑思维能力和空间想象能力 ,并逐步形成运用数学知识来分析和解决问题的能力 .然而 ,各章…     

新课程标准下教师教学设计中应具备的几种意识

教学设计是指教师为达到一定的教学目标，运用一定的教育思想作指导，系统规划自己的教学行为而形成的教学设想．具体地说，教学设计要解决三个问题：①教学设计要依据教学原理，遵循教学规律，结合教师对教学内容和学生情况的分析，确定教什么．②教学设计要依据教学目标     

基于三种价值取向的数学课堂教学目标设置研究

教学目标是预期的学生学习成果,它是教学的出发点和最终归属,是选择教学策略的依据,是评价教学的基本标尺.教学目标设置关系到教学设计的整个过程,可以说,一切教学安排都是围绕教学目标展开的.然而,由于部分教师对课堂教学目标内涵的理解存在偏差、对课堂教学目标的分析与陈述技术缺乏了解,致使数学课堂教学目标设置出现对象倒     

兼顾效率和成本的ARMA控制图多目标优化设计

ARMA控制图是一种有效的自相关过程质量监控方法,为了能够同时对ARMA控制图监控方案的效率和成本进行优化,本文分别研究了ARMA控制图的平均运行长度和质量成本的计算方法,并由此建立了ARMA控制图的多目标优化设计模型。采用NSGA-Ш智能优化算法,通过一个具体的算例对该模型的计算方法进行了说明,针对不同程度的过程偏移给出了多目标优化设计的非劣解解集。然后通过灵敏度分析的方法研究了模型中的主要设计参数对监控方案的效率和成本的影响程度。最后,通过与其它几种ARMA控制图优化设计方案的比较分析,说明了本文提出的设计方法的优势。     

加强认知分析 提高教学水平

数学教学的认知分析，就是指从认知的角度对数学教学的目标、教学设计及教学实践过程、学生的学习结果等进行分析，加强认知分析对于提高数学教学水平和质量具有重要意义．从数学教学的一般过程和影响数学活动的诸因素综合来看，笔者认为可以从教学目标、学生已有认知结     

Bresse系统的内部时滞控制器的设计

研究具有内部分布时滞控制的Bresse系统镇定问题.目标是设计反馈控制器使得闭环系统指数稳定.不同于以前的控制器设计方法,文章采用系统反馈等价方法,通过设计目标系统,应用系统等价方法寻找反馈控制律.利用具有奇异积核的积分变换,实现了当前控制系统与目标系统的等价.所应用的方法克服了通常反馈控制闭环系统的稳定性分析的困难.     

模糊择近原则在多目标容差设计中的应用

利用模糊数学中的择近原则,以容差-成本模型为基础,通过引入模糊数学中的隶属度函数和贴近度原则,结合实验并设计方法提出了一种模糊容差稳健优化设计方法,较好地解决了多目标容差设计的全局最优问题.最后通过一个实例验证了该方法的合理、有效性.     

公交网络时刻表再协同设计的多目标优化模型

为了改善公交服务质量,公交运营者试图调整现有时刻表的发车时间,使不同线路的车次协同到达换乘站点以方便乘客换乘。针对此场景,研究了公交时刻表重新协同设计问题,提出了求解该问题的多目标模型。模型考虑了对发车间隔灵敏的乘客需求、灵活的车次协同到站方式和发车时间的规则性,分析了该多目标模型的特征和计算复杂性,表明本文研究的问题是NP-hard问题,且它的帕累托最优前沿是非凸的,设计了基于非支配排序的遗传算法求解模型。算例表明,与枚举算法相比,提出的求解算法在较短的时间内可获得高质量的帕累托解。     

实现数学素质教育目标重在教学设计——对设计原则和微观过程设计的再讨论

张奠宙先生曾多次阐明了这样一种观点 :“教师的任务是把知识的学术形态转化为教育形态 .”本人认为 ,这是对教师作用的本质概括 .尽人皆知 ,“备好课”是提高课堂教学效益 ,实现素质教育目标的关键 .而将“知识的学术形态化作教育形态” ,需要作教学设计 .本文拟就数学课堂教学设计的原则和微观过程设计 ,在许多同行研究的基础上进行再讨论 ,与同行探讨 .1　数学课堂教学设计的原则所谓“教学设计” ,就是用一定的教育思想作指导 ,规划自己的教学行为而形成的教学设想 .对于同一个数学内容的教学 ,可以作出不同的设计 .这种不同的设计取决…     

Pseudo generalized Youden designs

Youden square designs, or Youden rectangles, are classical objects in design theory. Extensions of these were introduced in 1958 by Kiefer and in 1981 by Cheng, in the form of generalized Youden designs (GYDs) and pseudo Youden designs (PYDs), respectively. In this paper, we introduce a common generalization of both these objects, which we call a pseudo generalized Youden design (PGYD). PGYDs share the statistically desirable optimality properties of GYDs and PYDs, and we show that they exist in situations where neither GYDs nor PYDs do. We determine some numerical necessary conditions for the existence of PGYDs, classify their existence for small parameter sets, and provide constructions for families of PGYDs using patchwork methods based on affine planes.     

Geometric dissections now swing and twist

Conclusion  With their visual and kinetic appeal, hinged dissections and their design techniques will continue to play a role in mathematical recreation and education. They also invite substantive research in mathematics and computer science. Hinges are the simplest of linkages, permitting only relative rotation between connected pieces; with hingeability we address issues of transformation of objects which have wider relevance. In addition to the problem of generality discussed briefly in the introduction, there is the search for algorithms: procedures for determining whether a given dissection is hingeable, and for finding effectively a plan of motion that carries the hinged pieces from one of the figures to the other.     

创新产品目标设计阶段的需求分析和研究

本针对创新产品目标设计阶段的顾客需求进行研究，分析了需求的层次、需求的类型以及需求的特点，探讨了识别需求的方法、途径和所需注意的问题，论述了需求分析的方法、手段和重要性。最后，给出了需求的产品设计规范所包含的内容及一般的表达形式。     

Optimisation of gravity-fed water distribution network design: A critical review

This paper surveys the literature on the optimisation of water distribution network design. The water distribution network design (WDND) optimisation problem entails finding the material and diameter of each pipe in the network so that the total cost of the network is minimised without violating any hydraulic constraints. This is a difficult combinatorial optimisation problem, in which decision variables are discrete and both cost function and constraints are non-linear. Over the past 30 years, a large number of methods, especially in the field of (meta) heuristics, have been developed to solve this problem, most of which obtain good results on the available benchmark networks. In addition to outlining the basic features of each method, a detailed computational comparison is presented. Based on this comparison, some issues with the current state of the art in this domain are discussed, and some future research directions are suggested. Additionally, the need for an adequate set of benchmark instances is motivated, and the minimal requirements for an instance set generator are discussed.     

Method of reduction in convex programming

We present an algorithm which solves a convex program with faithfully convex (not necessarily differentiable) constraints. While finding a feasible starting point, the algorithm reduces the program to an equivalent program for which Slater's condition is satisfied. Included are algorithms for calculating various objects which have recently appeared in the literature. Stability of the algorithm is discussed.     

Dynamic data structures for fat objects and their applications

We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in or . Our planar structures are actually fitted for a more general class of objects – (β,δ)-covered objects – which are not necessarily convex, see definition below. These structures are more efficient than alternative known structures, because they exploit the fatness of the objects. We then apply these structures to obtain efficient solutions to two problems: (i) finding a perfect containment matching between a set of points and a set of convex fat objects, and (ii) finding a piercing set for a collection of convex fat objects, whose size is optimal up to some constant factor.     

Necessary and sufficient conditions in the problem of D-optimal weighing designs with autocorrelated errors

Necessary and sufficient conditions determining D-optimality of chemical balance weighing design with three objects are proved under first-order autoregressive errors with negative autocorrelation. D-optimality of the design constructed by Li and Yang (2005) is also shown.     

基于可拓变换的产品适应性设计研究

适应性设计是一种在面向产品全生命周期设计中解决矛盾问题的有效途径.然而,现有设计方法很难客观地反映定性定量相结合求解设计矛盾问题.为此,提出一种基于可拓变换的产品适应性设计方法.首先建立可拓适应性设计一般流程,定义可拓设计基元,建立适应性设计矛盾问题,然后进行可拓分析,建立起传导矛盾环系统,以及满足产品功能-结构的变换规则、适应度函数,再通过可拓变换实现产品设计基元之间冲突的消解,输出适应性设计方案.最后将该方法应用于某全自动LED分拣机振动盘的适应性设计.应用实例表明:该设计方法不仅能快速满足不同需求下的个性化要求,而且能为计算机参与解决产品设计矛盾问题提供一种可行的途径.     

Non-crossing matchings of points with geometric objects

Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a non-crossing matching between point–object pairs. In this paper, we address the algorithmic problem of determining whether a non-crossing matching exists between a given point–object pair. We show that when the objects we match the points to are finite point sets, the problem is NP-complete in general, and polynomial when the objects are on a line or when their size is at most 2. When the objects are line segments, we show that the problem is NP-complete in general, and polynomial when the segments form a convex polygon or are all on a line. Finally, for objects that are straight lines, we show that the problem of finding a min-max non-crossing matching is NP-complete.     

The M/G-G/1 Oscillating Queueing System

In this paper oscillating queueing system is studied. Oscillating queueing systems are interesting practical objects and researches in this subject are a natural continuation of previous studies on oscillating stochastic processes. It is shown a powerful method for finding characteristic quantities of queuing systems (potential method). Using this method the steady-state distribution of the length of the queue in the M/G-G/1 oscillating system is found and presented in explicit formula. In addition, a numerical example is given.