Lösung des absoluten Konvergenzproblems einer allgemeinen Klasse Dirichletscher Reihen

Ohne Zusammenfassung     

On the counting function of the lattice profile of periodic sequences

The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period.     

Paul阱内的压缩效应与量子跃迁

处理一个一维Ｐａｕｌ阱系统中的压缩现象与量子跃迁现象，对于阱内的最强压缩态和共振跃迁（一种极不稳定状态）之间的关系作了阐述，并对利用压缩性质在阱内进行精密测量的可能性作了讨论     

量子计算与超冷离子

通过介绍量子计算的基本概念和特点，并对比目前人们使用的计算机的计算方式，对于如何利用囚禁在离子阱中的超冷离子进行量子计算作了简要的叙述．     

Stochastic control problems with delay

We consider optimal control problems for systems described by stochastic differential equations with delay. We state conditions for certain classes of such systems under which the stochastic control problems become finite-dimensional. These conditions are illustrated with three applications. First, we solve some linear quadratic problems with delay. Then we find the optimal consumption rate in a financial market with delay. Finally, we solve explicitly a deterministic fluid problem with delay which arises from admission control in ATM communication networks.     

Effects of the switching time in OPS/OBS networks

In this paper we present an analytical model, which considers the effects of the switching time on the network performance in service differentiated optical packet/burst switching (OPS/OBS) networks. Our results indicate that the switching time must be less than 10 % of the packet/burst duration in order to avoid any significant reductions in the network performance. Furthermore, regarding a network with full wavelength conversion, we show that the benefits of statistical resource sharing are almost non-existent for low priority traffic when the switching time is large.     

Existence of many ergodic absolutely continuous invariant measures for piecewise-expandingC 2 chaotic transformations in ℝ2 on a fixed number of partitions

Let Ω be a region in ℝⁿ and letp = P_i ) _i ^1m , be a partition ofΩ into a finite number of closed subsets having piecewise C² boundaries of finite(n - 1 )dimensional measure. Let τ:Ω→Ω be piecewise C² onP where, τ_i = τ|p_i is aC ² diffeomorphism onto its image, and expanding in the sense that there exists α > 1 such that for anyi = 1, 2,...,m ‖Dτ_i ^-1 ‖ < α^-1, where Dτ_i ^-1 is the derivative matrixτ _i ^- 1 and |‖·‖ is the Euclidean matrix norm. By means of an example, we will show that the simple bound of one-dimensional dynamics cannot be generalized to higher dimensions. In fact, we will construct a piecewise expanding C² transformation on a fixed partition with a finite number of elements in ℝ², but which has an arbitrarily large number of ergodic, absolutely continuous invariant measures     

Algebraic composition operators

The focus of this paper is on the following problem. Given a linear space F of complex-valued functions on a set X and a polynomial p(z), is there an algebraic composition operator on F whose characteristic polynomial equals p(z)? We show that the supply of all the polynomials p(z) for which the answer to this question is affirmative depends heavily on the structure of the space F.