共查询到20条相似文献,搜索用时 218 毫秒
1.
本文主要讨论组合地图列举问题.刘的一部专著中提出了一个判定两个地图是否同构的算法.该算法的时间复杂度为O(m2),其中m为下图的规模.在此基础上,本文给出一个用于地图列举以及进而计算任意连通下图的地图亏格分布的通用算法.本文所得结果比之前文献中所给结果更优. 相似文献
2.
如何提高数学复习课的教学效率?这是当前数学教学中值得研究的问题."复习",如果只是基础知识的简单罗列,难免使学生厌倦;如果只是习题解法的演示,又会令学生深陷题海无所适从……,对复习课的目标和功能的认识,决定了复习课内容的选择、教学的模式和教学的效果. 相似文献
3.
起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G F是弦图.这里最小值|F|称为图G的填充数,表示为f(G).作为NP-困难问题,该问题的降维性质已被研究,其中包括它的可分解性.基本的可分解定理是:如果图G的一个点割集S是一个团,则G经由S是可分解的.作为推广,如果S是一个"近似"团(即只有极少数边丢失的团),则G经由S是可分解的.本文首先给出基本分解定理的另外一个推广:如果S是G的一个极小点割集且G-S含有至少|S|个分支,则G经由S是可分解的;其次,给出了这个新推广定理的一些应用. 相似文献
4.
本文研究了自由群的直积的检验元素,通过对直积的自同态的分解,得到了直积中的元素为检验元素的充分必要条件,改进了O'neill和Turner的结果.此外,构造了两类具体的检验元素. 相似文献
5.
本文主要根据生物学的复制和变异的基本原理,提出了具有反偏爱复制特性的一个蛋白质作用网络的新的演化模型.通过计算,发现所得的网络与实测的蛋白质作用网络的某些拓扑性质能够很好的吻合.生成的网络不仅是稀疏的,而且具有小世界性和无标度(scale-free)性质. 相似文献
6.
解题的一个重要环节是"审题",审题的目的就是希望从题目中提取有用的解题信息.一些创新性的试题,常在题干中设置了明显的"提示"信息,而对于解题者而言,如何利用好题目的这些"提示"信息,将是成功解题的关键. 相似文献
7.
向量在近几年高考中越来越重要,其工具性作用已渗透以数学的各个分支.解答题中主要是以向量为载体的综合问题,体现向量"搭台",其他知识"唱戏"的特点.近年来高考中小题综合化的特点,已被大家所共识.选填题中对向量知识的考查更加灵活多变,对学生能力要求较高,可是只要是题型新颖一点或能力要求高点的题就成为学生得分的"事故多发地带".…… 相似文献
8.
组织目标必须通过约束体系规范员工行为得以实现.进行组织约束下员工行为的定量研究,这对保证组织健康稳定发展非常必要.员工自身适应组织目标,服从组织的约束体系,配置好自有的资源,使得自身行为得以优化的研究较少.本文简要回顾了经济学理论、组织行为学、人力资源管理等方面对员工配置资源行为优化的研究及应用.界定了组织资源,并将其分为三种类型.在约束体系给出的基础上,将组织对员工行为的控制、要求或激励转为员工在之上或之下的运行约束;认为约束体系具有离散、悬河效应的特点;得出了评价组织约束体系的两种算法.讨论了员工资源及行为.尝试构造了基于员工适应组织约束下,员工的多目标、非线性,既有连续又有离散约束条件的配置资源行为优化的定量模型,并在基于员工利益最大化的前提下,对模型求解最优解的几种情况进行了研究.希望能够填补员工自身适应组织目标,行为优化定量模型这方面研究的空白. 相似文献
9.
数列在中学数学中占有极为重要的地位,它不仅广泛应用于实际,而且还融于高中数学的各个章节构成精彩纷呈的综合题,因此数列的综合题是高考中久考不衰的热点,且常考常新,并以此为压轴题者也屡见不鲜.本文拟就数列的几类主要综合题求解的基本策略简议如下:…… 相似文献
10.
一个数的绝对值有如下两个方面的涵义.(1)绝对值的代数意义:对任意的数x,当x≥0时,︱x︱=x;当x<0时,︱x︱=-x.(2)绝对值的几何意义:对任意的数x,x表示x在数轴上的对应点到原点的距离. 相似文献
11.
Markov models are widely used as a method for describing categorical data that exhibit stationary and nonstationary autocorrelation. However, diagnostic methods are a largely overlooked topic for Markov models. We introduce two types of residuals for this purpose: one for assessing the length of runs between state changes, and the other for assessing the frequency with which the process moves from any given state to the other states. Methods for calculating the sampling distribution of both types of residuals are presented, enabling objective interpretation through graphical summaries. The graphical summaries are formed using a modification of the probability integral transformation that is applicable for discrete data. Residuals from simulated datasets are presented to demonstrate when the model is, and is not, adequate for the data. The two types of residuals are used to highlight inadequacies of a model posed for real data on seabed fauna from the marine environment. Supplemental materials, including an R-package RMC with functions to perform the diagnostic measures on the class of models considered in this article, are at the journal’s website. The R-package is also available at CRAN. 相似文献
12.
In this paper we prove two global existence results for Hughes' model for pedestrian flows under assumptions that ensure that the traces of the solutions along the turning curve are zero for all positive times. 相似文献
13.
Selecting, modifying or creating appropriate problems for mathematics class has become an activity of increaing importance in the professional development of German mathematics teachers. But rather than asking in general: “What is a good problem?” there should be a stronger emphasis on considering the specific goal of a problem, e.g.: “What are the ingredients that make a problem appropriate for initiating a learning process” or “What are the characteristics that make a problem appropriate for its use in a central test?” We propose a guiding scheme for teachers that turns out to be especially helpful, since the newly introduced orientation on outcome standards a) leads to a critical predominance of test items and b) expects teachers to design adequate problems for specific learning processes (e.g. problem solving, reasoning and modelling activities). 相似文献
14.
We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights. We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules. We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules. 相似文献
15.
Previously formulated monotonicity criteria for explicit two-level difference schemes designed for hyperbolic equations (S.K. Godunov’s, A. Harten’s (TVD schemes), characteristic criteria) are extended to multileveled, including implicit, stencils. The characteristic monotonicity criterion is used to develop a universal algorithm for constructing high-order accurate nonlinear monotone schemes (for an arbitrary form of the desired solution) based on their analysis in the space of grid functions. Several new fourth-to-third-order accurate monotone difference schemes on a compact three-level stencil and nonexpanding (three-point) stencils are proposed for an extended system, which ensures their monotonicity for both the desired function and its derivatives. The difference schemes are tested using the characteristic monotonicity criterion and are extended to systems of hyperbolic equations. 相似文献
16.
We show that the cost of solving initial value problems for high-index differential algebraic equations is polynomial in the
number of digits of accuracy requested. The algorithm analyzed is built on a Taylor series method developed by Pryce for solving
a general class of differential algebraic equations. The problem may be fully implicit, of arbitrarily high fixed index and
contain derivatives of any order. We give estimates of the residual which are needed to design practical error control algorithms
for differential algebraic equations. We show that adaptive meshes are always more efficient than non-adaptive meshes. Finally,
we construct sufficiently smooth interpolants of the discrete solution.
AMS subject classification (2000) 34A09, 65L80, 68Q25 相似文献
17.
A new approach for constructing algebraic multilevel preconditioners for mixed finite element methods for second order elliptic problems with tensor coefficients on general geometry is proposed. The linear system arising from the mixed methods is first algebraically condensed to a symmetric, positive definite system for Lagrange multipliers, which corresponds to a linear system generated by standard nonconforming finite element methods. Algebraic multilevel preconditioners for this system are then constructed based on a triangulation of the domain into tetrahedral substructures. Explicit estimates of condition numbers and simple computational schemes are established for the constructed preconditioners. Finally, numerical results for the mixed finite element methods are presented to illustrate the present theory. 相似文献
18.
Summary In this paper the author considers a linear test delay differential equation with non-constant coefficients related to the definitions of PN and GPN-stability for numerical methods. He defines stability properties for an ordinary differential equation together with stability properties of interpolants for numerical methods and in this way he gives sufficient conditions for GPN-stability.This work was supported by the Italian M.P.I. (funds 40%) and by C.N.R. 相似文献
19.
There are several methods for approximating the multiple zeros of a nonlinear function when the multiplicity is known. The methods are classified by the order, informational efficiency and efficiency index. Here we consider other criteria, namely the basin of attraction of the method and its dependence on the order. We discuss all known methods of orders two to four and present the basin of attraction for several examples. 相似文献
20.
We consider propositional dynamic logic for agents. For this logic, we present a sequent calculus with a restricted cut rule and prove the soundness and completeness for the calculus. 相似文献
|