强预不变凸函数的充要条件

本文讨论了强预不变凸函数与预不变凸函数、严格预不变凸函数及半严格预不变凸函数之间的关系,得到它的三个充要条件：(i)在一定条件下,f是强预不变凸函数的充分必要条件是f是预不变凸函数且f满足中间点强预不变凸性；(ii)在一定条件下,f是强预不变凸函数的充分必要条件是f是严格预不变凸函数且f满足中间点强预不变凸性；(iii)在一定条件下,f是强预不变凸函数的充分必要条件是f是半严格预不变凸函数且f满足中间点强预不变凸性．     

■混合样本下非参数核回归估计的强相合性

本文在■混合样本下讨论Gasser和Müller提出的一类非参数核回归估计的强相合性.在较弱的条件下,证明了该估计的强相合性与一致强相合性.     

动力系统中的Lipschitz稳定性

本文讨论动力系统的Ｌｉｐｓｃｈｉｔｚ稳定性与吸引性之间的关系．给出动力系统中弱吸引性、吸引性和强吸引性这三个概念相互等价的条件，在一定的条件下证明了（弱、强）吸引子与全局（弱、强）吸引子是一致的．本文还讨论了度量Ｌｙａｐｕｎｏｖ稳定性和拓扑Ｌｙａｐｕｎｏｖ稳定性及它们与Ｌｉｐｓｃｈｉｔｚ稳定性之间的关系．     

强预拟不变凸函数的充要条件

本文引入了一类新的广义凸函数—强预拟不变凸函数.讨论了强预拟不变凸函数与预拟不变凸函数、严格预拟不变凸函数及半严格预拟不变凸函数之间的关系,得到它的三个充要条件:(i)当条件P_1满足时,f是强预拟不变凸函数的充分必要条件是f是预拟不变凸函数且f满足中间点强预拟不变凸性;(ii)当条件P_2满足时,f是强预拟不变凸函数的充分必要条件是f是严格预拟不变凸函数且f满足中间点强顶拟不变凸性;(iii)当条件P_2满足时,f是强预拟不变凸函数的充分必要条件是f是半严格预拟不变凸函数且f满足中间点强预拟不变凸性.     

局部凸空间的K强凸性与K强光滑性

首先引进了局部凸空间K强凸性的概念,它既是Banach空间K强凸性概念在局部凸空间中的推广,又是局部凸空间强凸性概念的自然推广;其次给出了局部凸空间K强凸性概念的对偶概念,即局部凸空间K强光滑性的概念,并得到了K强凸(K强光滑)的局部凸空间的特征刻画;最后,在P-自反的条件下给出了它们之间的对偶定理,即(X,TP)是K强凸(K强光滑)的当且仅当(X′,TP′)是K强光滑(K强凸)的.     

单位圆内零级代数体函数的强Borel点

主要讨论了单位圆内零级代数体函数在满足某条件下的强Borel点存在性问题,通过建立单位圆内零级代数体函数满足此条件的型函数的关系式,证明得到了单位圆内零级代数体函数在此条件下必存在强Borel点,且其强Borel点必是其Borel点.     

随机环境中马氏链的常返性和瞬时性

讨论了随机环境马氏链中具有强π不可约性链的常返性的判定,从而得到了强π不可约链常返性判定的充分必要条件,同时给出了在一定条件下随机环境中的马氏链的瞬时性判定的几个充分条件.     

删失回归模型LAD估计的一些强的性质

删失回归模型是一种因变量受限制的模型, 也称为Tobit模型. 在较弱的条件之下, 给出了回归系数LAD估计的强相合性、强收敛速度及其Bahadur强表示.     

非自治浮梁方程强拉回吸引子的存在性

本文试图研究具有自由边值条件的浮梁方程解的渐近性态,运用一系列能量估计证明了有界吸收集的存在性和拉回D-条件,进而得到该方程在强拓扑空间中拉回D-吸引子的存在性.     

非线性再生散度随机效应模型的渐近性质

对非线性再生散度随机效应模型, 该文给出了类似于Barndroff-Nielson, Cox (1989)和Severin, Wong (1992)的正则条件, 基于这些正则条件和Laplace近似, 证明了该模型参数极大似然估计的存在性、强相合性和渐近正态性.     

Fifth graders’ understanding of fractions on the number line

The goal of this research was to examine fifth graders’ understanding of fractions on the number line. This case‐study design focused on the various ways that students represented fractions on number lines. Students responded to task‐based interview questions by identifying fractions as a number on the number line as well as equivalency and problem solving. The tasks were administered individually to 26 fifth‐grade students over a 15‐minute time frame in their respective schools. The two groups of 10‐year‐old students answered most questions in written form with pencil and paper and were often asked to explain how they arrived at an answer. Student performance was highest when instructed to plot ½ on a number line of 0 to 1 as well as naming a fraction less than ½. The students performed lowest when they attempted to plot ½, ¼, and 1 on a number line with a predetermined unit 0 to 1/3. Other low performing concepts consisted of plotting ¼ on a number line from 0‐3, identifying ¼ on a non‐routine number line, and plotting a unit fraction with an equivalent fraction as well as an improper fraction on a common number line.     

The catwalk task: Reflections and synthesis: Part 1

In this article I recount my experiences with a series of encounters with the catwalk task and reflect on the professional growth that these opportunities afforded. First, I reflect on my own mathematical work on the catwalk task, including my efforts to fit various algebraic models to the data. Second, I reflect on my experiences working with a group of high school students on the catwalk task and my interpretations of their mathematical thinking. Finally, I reflect on the entire experience with the catwalk problem, as a mathematics learner, as a teacher, and as a professional.     

具有某种断面的半群的研究进展

本文综述了几类具有特殊断面的半群的近期研究结果。在介绍逆半群和正则半群的一般结构之后，概述了具有逆断面的正则半群的结构和同余格的研究成果。总结了作为逆断面的推广的可裂断面，纯正断面，正则^*－断面和恰当断面。提出了可以进一步研究的重要的问题。     

电子商务信息系统安全管理体系PRS-ISMS的研究

信息是电子商务至关重要的资产,电子商务的正常运转必须建立在安全的信息系统之上,因而电子商务信息系统安全问题成为人们日益关注的重点.根据电子商务信息系统特点,从信息系统过程(Process)、资源(Resource)和安全目标(Security)三个视角分析了电子商务信息安全风险的要素及其关系,构建了三维信息系统安全管理体系模型PRS-ISMS,提出了改进的信息安全风险管理过程PRS-PDCA.     

The catwalk task: Reflections and synthesis: Part 2

In this article we recount our experiences with a series of encounters with the catwalk task and reflect on the professional growth that these opportunities afforded. First, we individually reflect on our own mathematical work on the catwalk task. Second, we reflect on our experiences working with a group of community college students on the catwalk task and our interpretations of their mathematical thinking. In so doing we also detail a number of innovative and novel student-generated representations of the catwalk photos. Finally, we each individually reflect on the entire experience with the catwalk problem, as mathematics learners, as teachers, and as professionals.     

Regular reduction of controlled Hamiltonian system with symplectic structure and symmetry

In this paper, our goal is to study the regular reduction theory of regular controlled Hamiltonian (RCH) systems with symplectic structure and symmetry, and this reduction is an extension of regular symplectic reduction theory of Hamiltonian systems under regular controlled Hamiltonian equivalence conditions. Thus, in order to describe uniformly RCH systems defined on a cotangent bundle and on the regular reduced spaces, we first define a kind of RCH systems on a symplectic fiber bundle. Then we introduce regular point and regular orbit reducible RCH systems with symmetry by using momentum map and the associated reduced symplectic forms. Moreover, we give regular point and regular orbit reduction theorems for RCH systems to explain the relationships between RpCH-equivalence, RoCH-equivalence for reducible RCH systems with symmetry and RCH-equivalence for associated reduced RCH systems. Finally, as an application we regard rigid body and heavy top as well as them with internal rotors as the regular point reducible RCH systems on the rotation group SO(3) and on the Euclidean group SE(3), as well as on their generalizations, respectively, and discuss their RCH-equivalence. We also describe the RCH system and RCH-equivalence from the viewpoint of port Hamiltonian system with a symplectic structure.     

On p-Willmore disks with boundary energies

We consider an energy functional on surface immersions which includes contributions from both boundary and interior. Inspired by physical examples, the boundary is modeled as the center line of a generalized Kirchhoff elastic rod, while the interior term is arbitrarily dependent on the mean curvature and linearly dependent on the Gaussian curvature. We study equilibrium configurations for this energy in general among topological disks, as well as specifically for the class of examples known as p-Willmore energies.     

基于和积和最大积的信念传播算法的收敛性分析

在介绍马尔可夫网络和标准信念传播(Belief Propagation,BP)算法的基础上,以具有4个隐含结点的无环马尔可夫网络为例,详细分析了基于和积和最大积的BP算法收敛性,结果表明,在网络为无环马尔可夫网络时,基于和积的BP算法收敛于全局最优解,而基于最大积的BP算法在任何初值条件下,只要经过有限次迭代,BP算法必收敛到唯一固定点,若算法有唯一最优点,则此固定点为最优点.以实证分析为工具,研究BP算法收敛性,可作为BP算法基础理论研究的一次有益尝试.     

Cubature Formula and Interpolation on the Cubic Domain

Several cubature formulas on the cubic domains are derived using the dis-crete Fourier analysis associated with lattice tiling, as developed in [10]. The main results consist of a new derivation of the Gaussian type cubature for the product Cheby-shev weight functions and associated interpolation polynomials on [-1,1]2, as well as new results on [-1,1]3. In particular, compact formulas for the fundamental interpo-lation polynomials are derived, based on n3/4 + (n2) nodes of a cubature formula on [-1,1]3.     

On lexicographic optimal solutions in transportation problems

Lexicographic versions of the cost minimizing transportation problem (CMTP) and the time minimizing transportation problem (TMTP) are presented in this paper. In addition to minimizing the quantity sent on the costliest routes in a cost minimizing transportation problem. an attempt is made to minimize the quantity transported on the second-costliest routes. if the shipment on the costliest routes is as small as possible and the quantity shipped on the third-costliest routes, if the shipments on the costliest and the second- costliest routes are as small as possible. and so on. In a lexicographic time minimizing transportation problem one is not only interested in minimizing the transportation cost on the routes of the longest duration but also on the routes of second longest, third-longest duration and so on. For finding lexicographic optimal solutions (LOS) of lexicographic cost minimizing and time minimizing transportation problems a standard cost minimizing transportation problem is formulated whose optimal solution is shown to provide the answer. Some extensions are also discussed