贝卡的的乱糟糟记事簿

又到开学季! 我怀着沉重的心情来到学校,强装笑脸和大家交流暑假生活.瞧×脸上那由衷绽开的灿烂的微笑,贝卡的心在流泪,啊,别了,我的暑假! 今天是报名日,半天的报到时间,也就意味着暑假只剩下半天时间了. 奇怪的是,今天没看到Lucky,难道这家伙为了逃避上学,胆大到连报名都不来了?     

基于酉几何的等概的具有仲裁的认证码的构造

具有仲裁的认证码既要防止敌手的欺骗,又要防止收入和发方的互相欺骗,本文给出一种由酉几何构造等概的具有仲的认证码的方法,并计算了有关参数,分析了各种攻击成功的概率。     

树的最大特征值的上界的一个注记

设T是一个树,V是T的顶点集．记dv是υ∈V的度,△是T的最大顶点度．设υ∈V且dw=1．记k=ew+1,这里ew是w的excentricity．设δj′= max{dυ:dist(υ,w)=j},j=1,2,…,k-2,我们证明和这里μ1(T)和λ1(T)分别是T的Laplacian矩阵和邻接矩阵的最大特征值．特别地,记δo′=2．     

一元二次方程的根的判别式的应用

一元二次方程的根的判别式是初中代数的重要内容之一 ,它在中学数学中有着广泛的应用 ,成为近几年全国各地中考的热点问题 .为了帮助读者更好地掌握好这部分知识内容 ,现对它在初中数学中的应用进行归纳 ,以餮读者 .应用一 :判断一元二次方程 (或二元二次方程组 )的根的情况 ;或已知根的情况 ,求方程 (或组 )中的待定系数的取值范围 .一元二次方程ａｘ2 +ｂｘ +ｃ =0 (ａ≠ 0 )的根的判别式为△ =ｂ2 - 4ａｃ,它与这个方程的根有着十分密切的关系 :( 1)△ >0 方程有两个不等的实数根 ;( 2 )△ =0 方程有两个相等的实数根 .( 3)△ <0 方程…     

数的概念的发展

编者按:李邦河院士于2009年4月中国数学会厦门学术年会上荣获"华罗庚数学奖".本文是李院士在这次年会上所做的公众报告,他在报告中谈到一个重要的思想:数学玩的是概念,而不是纯粹的技巧.因为中小学数学里面的概念比较少,所以就在一些难题、技巧上下功夫,这恰恰是舍本逐末的做法,值得所有的数学教育工作者深思.     

具一步以上的食物链的生态系统的稳定性

时,系统(1)有一个坐标皆为正的平衡点x>O,y>0,z>0,w>0. Smith没有研究过这个系统的平衡点(x,y,z,w)的稳定性,但他猜想这个系统该是稳定的。 本文用李雅普诺夫第二方法证明了系统(1)平衡点(x,y,z,w)的稳定性,并把这结果推广到n种捕食者(即任何长度的食物链)的情况。     

一类具有转向点的三阶微分方程的边值问题的解的高阶渐近展开

利用上下解方法,研究如下一类具有转向点的三阶微分方程的边值问题{ε~2y″′=f(t,y,ε)y″ g(t,y,ε)y′ h(t,y,ε),a相似文献   

与一类算术函数关联的矩阵的行列式的下界

设f为一个算术函数,S={x 1,…,x n}为一个n元正整数集合.称S为gcd-封闭的, 如果对于任意1 i,j n,均有(x i,x j)∈S.以 ={y 1,…,y m}表示包含S的最小gcd-封闭的正整数集合. 设(f(x i,x j))表示一个n×n矩阵, 其(i,j)项为f在x i与x j的最大公因子(x i,x j)处的值. 设(f[x i,x j])表示一个n×n矩阵, 其(i,j)项为f在x i与x j的最小公倍数[x i.xj]处的值. 本文证明了: (i) 如果f∈C s ={f:(f*μ)(d)>0, x∈S,d|x},这里f*μ表示f与μ的Dirichlet乘积,μ表示M bius函数,那么 并且(1)取等号当且仅当S=;(ii)如果f为乘法函数,并且 ∈Cs,那么 并且(2)取等号当且仅当S= .不等式(1)和(2)分别改进了Bourque与Ligh在1993年和1995年所得到的结果.     

AHP中判断矩阵的满意的一致性的研究

对层次分析法(AHP)中的判断矩阵,给出了它具有满意的一致性的充分必要条件,也就是,给出了检验它是否有满意的一致性的一种方法,在否定的情况下,还给出了修正它的一种方法使得它的每个主子矩阵都有满意的一致性.     

二面角的平面角的作法

寻找二面角的平面角是解决二面角问题的关键 .本文就寻找二面角的平面角的一些常用方法进行归纳总结 .一准确应用定义定义是解决问题的有力工具 .例 1　如图 1,在△ABC中 ,AD⊥BC于D ,E是线段AD上一点 ,且AE =12 ED .过E作MN∥BC且MN交AB于M ,交AC于N ,以MN为棱将△AMN折成二面角A1 -MN-D ,设此二面角为α(0 <α <π) ,连A1 B、A1 D、A1 C ,求△A1 MN与△A1 BC所成二面角的大小 .图 1图 2分析　这是一个折叠图形问题 .需要充分在平面几何图形中寻找垂直、平行关系 .不难发现在折后图 2中 ,由于A1 E与MN、ED与MN的关…     

On the performance of the algebraic optimized Schwarz methods with applications

We investigate the performance of algebraic optimized Schwarz methods used as preconditioners for the solution of discretized differential equations. These methods consist on modifying the so-called transmission blocks. The transmission blocks are replaced by new blocks in order to improve the convergence of the corresponding iterative algorithms. In the optimal case, convergence in two iterations can be achieved. We are also interested in the behavior of the algebraic optimized Schwarz methods with respect to changes in the problems parameters. We focus on constructing preconditioners for different numerically challenging differential problems such as: Periodic and Torus problems; Meshfree problems; Three-dimensional problems. We present different numerical simulations corresponding to different type of problems in two- and three-dimensions.     

Variational problems in the theory of optimum processes

This paper presents a review of the optimization problems for control processes described by ordinary differential equations and of the variational methods for solving these problems. The following cases are studied: problems with constraints on the controls or the coordinates, problems described by equations with discontinuous right-hand sides, problems with functionals depending on intermediate coordinates, and problems with given discontinuities in the coordinates. Variational problems of synthesis of optimal systems are also discussed. The method of solution is based on the multiplier rule and the Weierstrass necessary condition for the strong minimum of a functional. In some cases, the Legendre-Clebsch necessary condition for the weak minimum of a functional is used.     

On the Necessary Conditions for the Solubility of Algebraic Inverse Eigenvalue Problems

In this paper we give some necessary conditions for the solubility of additive inverse eigenvalue problems, multiplicative inverse eigenvalue problems and general inverse eigenvalue problems.     

Identification of distributed systems and the theory of the regularization

The identification problems, i.e., the problems of finding unknown parameters in distributed systems from the observations are very important in modern control theory. The solutions of these identification problems can be obtained by solving the equations of the first kind. However, the solutions are often unstable. In other words, they are not continuously dependent on the data. The regularization or Tihonov's regularization is known as one of the stabilizing algorithms to solve these non well-posed problems. In this paper is studied the regularization method for identification of distributed systems. Several approximation theorems are proved to solve the equations of the first kind. Then, identification problems are reduced to the minimization of quadratic cost functionals by virtue of these theorems. On the other hand, it is known that the statistical methods for identification such as the maximum likelihood lead to the minimization problems of certain quadratic functionals. Comparing these quadratic cost functionals, the relations between the regularization and the statistical methods are discussed. Further, numerical examples are given to show the effectiveness of this method.     

On the robustness of the BPX-preconditioner with respect to jumps in the coefficients

We determine the worst case behavior of the standard BPX-preconditioner for elliptic problems with arbitrary coefficient jumps along the boundaries of the coarsest partition. The counterexamples are also useful for other problems.

     

The initial treatment of the concept of function in the selected secondary school mathematics textbooks in the US and China

In order to provide insight into cross-national differences in students’ achievement, this study compares the initial treatment of the concept of function sections of Chinese and US textbooks. The number of lessons, contents, and mathematical problems were analyzed. The results show that the US curricula introduce the concept of function one year earlier than the Chinese curriculum and provide strikingly more problems for students to work on. However, the Chinese curriculum emphasizes developing both concepts and procedures and includes more problems that require explanations, visual representations, and problem solving in worked-out examples that may help students formulate multiple solution methods. This result could indicate that instead of the number of problems and early introduction of the concept, the cognitive demands of textbook problems required for student thinking could be one reason for differences in American and Chinese students’ performances in international comparative studies. Implications of these findings for curriculum developers, teachers, and researchers are discussed.     

On the quasistability of trajectory problems of vector optimization

We consider quasistable multicriteria problems of discrete optimization on systems of subsets (trajectory problems). We single out the class of problems for which new Pareto optima can appear, while other optima for the problems do not disappear when the coefficients of the objective functions are slightly perturbed (in the Chebyshev metric). For the case of linear criteria (MINSUM), we obtain a formula for calculating the quasistability radius of the problem.     

On the stability of the solution mapping for parametric traffic network problems

In this paper, we introduce the parametric traffic network problems. Afterward, a key hypothesis is introduced by virtue of a parametric gap function to considered problems, and we prove that this hypothesis is not only sufficient but also necessary for the Hausdorff lower semicontinuity and Hausdorff continuity of the solution mapping for parametric traffic network problems.     

Discretization methods for the solution of semi-infinite programming problems

In the first part of this paper, we prove the convergence of a class of discretization methods for the solution of nonlinear semi-infinite programming problems, which includes known methods for linear problems as special cases. In the second part, we modify and study this type of algorithms for linear problems and suggest a specific method which requires the solution of a quadratic programming problem at each iteration. With this algorithm, satisfactory results can also be obtained for a number of singular problems. We demonstrate the performance of the algorithm by several numerical examples of multivariate Chebyshev approximation problems.     

On the solvability of some boundary value problems for the inhomogeneous polyharmonic equation with boundary operators of the Hadamard type

We study the properties of fractional integro-differential operators. As an application, we analyze the solvability of some boundary value problems for the inhomogeneous polyharmonic equation in the unit ball. These problems generalize the Dirichlet and Neumann problems to the case of fractional boundary operators.