On the spectra of finite-dimensional quadratic Bose operators

A complete study of the spectrum of a finite-dimensional Bose operator is carried out in the paper. The cases in which the spectrum is discrete or continuous are studied. Translated fromMatematicheskie Zametki, Vol. 61, No. 6, pp. 835–854, June, 1997. Translated by A. M. Chebotarev     

生存轨道与集值映象的不动点

基于无穷维空间中的生存定理，我们研究了集值映象的不动点，得到了一个新的不动点定理，推广和改进了[1]和[5]中的相应结果。     

巷道底板上锚杆布置形式对预防底鼓效果的模拟研究

本文采用三个边界元模型对巷道底板上锚杆的不同布置形式对防治底鼓的效果进行了模拟研究。根据研究结果,提出采用在巷道底板上分期安装锚杆的方法,可有效地防治巷道底鼓。本文对巷道底鼓产生机理和防治措施的研究结果,具有一定的理论价值和应用参考价值。     

Security Analysis of Discrete Logarithm Based Cryptosystems

0 IntroductionNowthere are many well known cryptosystems based ondiscrete logarithms , such as the ElGamal cryptosys-tem[1]and the digital signature algorithm(DSA)[2]. Discretelogarithms have many advantages . Breaking the discrete log-arithm modulo pri mepappears to be somewhat harder thanfactoringintegern,and elliptic curve cryptosystems may usemuchsmaller keysizesthan RSA-basedcryptosystems of com-parable security.The discrete logarithmproblemover a group can be bro-ken down into a numb…     

Harmonic Calculus on Fractals - A Measure Geometric Approach I

Differentiation of functions w.r.t. finite atomless measures with compact support on the real line is introduced. The related harmonic calculus is similar to that of the classical Lebesgue case. As an application we obtain the Weyl exponent for the spectral asymptotics of the Laplacians w.r.t. linear Cantor-type measures with arbitrary weights.     

属性区间识别理论模型研究及其应用

根据程乾生教授创立的属性识别理论模型[1] ,提出了属性测度区间的概念 ,建立了属性区间识别理论模型 ,并在自然科学学术期刊质量评价中进行了应用 .     

Mackey Theory for p-adic Lie Groups

This paper gives a p-adic analogue of the Mackey theory, which relates representations of a group of type G - H × t A to systems of imprimitivity.     

Artificial time integration

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be “close enough” to the dynamics of the continuous system (which is typically easier to analyze) provided that small – hence many – time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought. In this article we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency. AMS subject classification (2000)  65L05, 65M32, 65N21, 65N22, 65D18     

Difference discrete connection and curvature on cubic lattice Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

In a way similar to the continuous case formally, we define in different but equivalent manners the difference discrete connection and curvature on discrete vector bundle over the regular lattice as base space. We deal with the difference operators as the discrete counterparts of the derivatives based upon the differential calculus on the lattice. One of the definitions can be extended to the case over the random lattice. We also discuss the relation between our approach and the lattice gauge theory and apply to the discrete integrable systems.