Method of high-order lagrange multiplier and generalized variational principles of elasticity with more general forms of functionals

It is known[1]that the minimum principles of potential energy andcomplementary energy are the conditional variation principles underrespective conditions of constraints.By means of the method of La-grange multipliers,we are able to reduce the functionals of condi-tional variation principles to new functionals of non-conditionalvariation principles.This method can be described as follows:Mul-tiply undetermined Lagrange multipliers by various constraints,andadd these products to the original functionals.Considering these un-determined Lagrange multipliers and the original variables in thesenew functionals as independent variables of variation,we can see thatthe stationary conditions of these functionals give these undeter-mined Lagrange multipliers in terms of original variables.The sub-stitutions of these results for Lagrange multipliers into the abovefunctionals lead to the functionals of these non-conditional varia-tion principles.However,in certain cases,some of the undetermined Lagrangemultipliers ma     

Dirichlet problem of higher order elliptic equation with perturbation both in differential operator and in boundary

This paper is the continuation of article [7]. It gives further results about the asymptotic expression for the solution of higher order elliptic equation in the case of boundary perturbation combined with operator perturbation. When unperturbed problemA ₀ is not on the spectrum, the asymptotic expression for the solution of perturbation problemA may be expanded with respect to the small parameter . WhileA ₀ is on the spectrum, the asymptotic expression of the solution contains negative powers of the small parameter . The approximation of arbitrary order to the solution is considered and the recursive formula for the general term and the estimation of remainder term are given.     

相对性原理及其对自然界定律的协变性要求--机械能守恒定律协变性疑难的解答

阐明狭义相对性原理的准确含义,批出它并不要求自然界每条定律都单独协变,但要求每条定律至少属于一个协变集合,给出最小协变集的求法。表明机械能守恒定律满足狭义相对性原理及其对自然界定律的协变性要求,还指出一切社会科学定律也都满足狭义相对性原理。     

基于水平集-离散元方法的球谐函数颗粒材料缓冲性能分析

在自然环境与工业领域中,颗粒材料是一种常见的缓冲材料,其中大量形态各异的非球形颗粒表现出复杂的力学特性并应用于不同工程领域。本文采用球谐函数构造不同球面度和表面凹凸特性的非规则颗粒,通过水平集方法计算球谐函数颗粒间的接触点和碰撞力,并对冲击过程中球形和凹形颗粒的缓冲性能进行离散元分析。数值结果表明,颗粒床厚度、冲击速度和颗粒形状显著影响球谐函数颗粒材料的缓冲性能。颗粒床底部的冲击力峰值随着颗粒床厚度和表面凹凸性的增加而降低,同时冲击力峰值随着冲击速度和颗粒球面度的增加而增加。与球形颗粒相比,球谐函数颗粒具有凹凸表面和多接触点特性,这有利于冲击荷载向四周扩展并提高凹形颗粒的缓冲效果。     

极大3限制边连通二部图的充分条件

设G=(V,E)是一个连通图.称一个边集合S■E是一个k限制边割,如果G-S的每个连通分支至少有k个顶点.称G的所有k限制边割中所含边数最少的边割的基数为G的k限制边连通度,记为λ_k(G).定义ξ_k(G)=min{[X,■]:|X|=k,G[X]连通,■=V(G)\X}.称图G是极大k限制边连通的,如果λ_k(G)=ξ_k(G).本文给出了围长为g>6的极大3限制边连通二部图的充分条件.     

二维Logistic映射的分岔与分形

理论分析了二维Logistic映射的分岔,并采用相图、分岔图、功率谱、Lyapunov指数和分维数计算的方法,揭示出：二维Logistic映射可按倍周期分岔和Hopf分岔走向混沌;在倍周期分岔过程中,系统在参数空间和相空间中都表现出自相似性和尺度变换下的不变性．对二维Logistic映射的吸引盆及其Mandelbrot-Julia集(简称M-J集)的研究表明：吸引盆中周期和非周期区域之间的边界是分形的,这意味着无法预测相平面上点运动的归宿;M-J集的结构由控制参数决定,且它们的边界是分形的．     

Post's Problem for Reducibilities of Bounded Complexity

In this paper we consider the we known method by E. Post of solving the problem of construction of recursively enumerable sets that have a degree intermediate between the degrees of recursive and complete sets with respect to a given reducibility. Post considered reducibilities ≤_m, ≤_btt, ≤_tt and ≤_T and solved the problem for al of them except ≤_T. Here we extend Post's original method of construction of incomplete sets onto two wide classes of sub‐Turing reducibilities what were studying in [1, 2].     

近似凸集的某些性质

主要研究了两类近似凸集的关系和性质.首先,举例说明两类近似凸集没有相互包含关系.其次,在近似凸集(nearly convex)条件下,证明了在一定条件下函数上图是近似凸集与凸集的等价关系.同时,考虑了近似凸函数与函数上图是近似凸集的等价刻画、近似凸函数与函数水平集是近似凸集的必要性,并用例子说明近似凸函数与函数水平集是...     

On Genericity and Ershov's Hierarchy

It is natural to wish to study miniaturisations of Cohen forcing suitable to sets of low arithmetic complexity. We consider extensions of the work of Schaeffer [9] and Jockusch and Posner [6] by looking at genericity notions within the Δ₂ sets. Different equivalent characterisations of 1‐genericity suggest different ways in which the definition might be generalised. There are two natural ways of casting the notion of 1‐genericity: in terms of sets of strings and in terms of density functions, as we will see here. While these definitions coincide at the first level of the difference hierarchy, they turn out to differ at other levels. Furthermore, these differences remain when the remainder of the Δ⁰₂ sets are considered. While the string characterization of 1‐genericity collapses at the second level of the difference hierarchy to 2‐genericity, the density function definition gives a very interesting hierarchy at level w and above. Both of these results point towards the deep similarities exhibited by the n‐c.e. degrees for n ≥ 2.     

On a Conjecture of Kleene and Post

A proof is given that 0 ′ (the argest Turing degree containing a computably enumerable set) is definable in the structure of the degrees of unsolvability. This answers a long‐standing question of Kleene and Post, and has a number of corollaries including the definability of the jump operator.