超强频率梳激光场驱动下多光子共振谐波辐射的相位突变研究

本文从理论上研究了在双色频率梳激光场驱动下多光子谐波辐射光谱中的相位突变现象。我们利用Floquet理论非微扰地模拟了频率梳激光场与原子分子等量子系统的相互作用过程。谐波辐射信号是多光子偶极跃迁相干叠加的结果,通过调节频率梳激光场间的相对相位,可以相干地控制谐波辐射信号的强度。通过对谐波信号进行傅里叶变换,可以提取不同跃迁路径的相对相位信息。我们通过改变频率梳组激光场的强度和频率组分实现多光子跃迁频率,让其跨越共振跃迁频率时,谐波相位会发生突变。从而可以观测超强激光场驱动下量子系统共振跃迁频率的斯塔克能移。     

Classification problems for shifts on modules over a principal ideal domain

In this paper we study symbolic dynamics over alphabets which are modules over a principal ideal domain, considering topological shifts which are also submodules. Our main result is the classification, up to algebraic and topological conjugacy, of the torsion-free, transitive, finite memory shifts.

     

Effect of the Parameters of Three-Mirror Resonators on the Spectral Characteristics of Single-Pulse Laser Generation with Self-Injection of Priming Radiation

Based on a semiclassical theory, investigations were made of the dynamics and spectral composition of pulsed generation with self-injection of priming radiation from the active part of a three-mirror linear resonator, the passive part of which contains an active loss modulator and serves as the output reflector of the laser. It is shown that there exists a range of resonator parameters at which pulsed lasing has virtually a single frequency irrespective of the detuning of the frequencies of the priming radiation and of the nearest eigenmode of the composite resonator. Considering graphically the phase conditions of generation, it is established that among pulsed lasers with self-injection of priming radiation which are constructed on the basis of three-mirror linear and branched resonators, the most efficient for creating single-frequency generation are those in which the length of the main resonator, where generation of the pulse occurs, is larger than the length of the additional one intended for forming the priming radiation. With an inverse ratio of the lengths of the resonators, the conditions of single-frequency pulsed generation becomes dependent on the priming radiation frequency.     

Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation

Several promising approaches for hexahedral mesh generation work as follows: Given a prescribed quadrilateral surface mesh they first build the combinatorial dual of the hexahedral mesh. This dual mesh is converted into the primal hexahedral mesh, and finally embedded and smoothed into the given domain. Two such approaches, the modified whisker weaving algorithm by Folwell and Mitchell, as well as a method proposed by the author, rely on an iterative elimination of certain dual cycles in the surface mesh. An intuitive interpretation of the latter method is that cycle eliminations correspond to complete sheets of hexahedra in the volume mesh.

Although these methods can be shown to work in principle, the quality of the generated meshes heavily relies on the dual cycle structure of the given surface mesh. In particular, it seems that difficulties in the hexahedral meshing process and poor mesh qualities are often due to self-intersecting dual cycles. Unfortunately, all previous work on quadrilateral surface mesh generation has focused on quality issues of the surface mesh alone but has disregarded its suitability for a high-quality extension to a three-dimensional mesh.

In this paper, we develop a new method to generate quadrilateral surface meshes without self-intersecting dual cycles. This method reuses previous b-matching problem formulations of the quadrilateral mesh refinement problem. The key insight is that the b-matching solution can be decomposed into a collection of simple cycles and paths of multiplicity two, and that these cycles and paths can be consistently embedded into the dual surface mesh.

A second tool uses recursive splitting of components into simpler subcomponents by insertion of internal two-manifolds. We show that such a two-manifold can be meshed with quadrilaterals such that the induced dual cycle structure of each subcomponent is free of self-intersections if the original component satisfies this property. Experiments show that we can achieve hexahedral meshes with a good quality.     

亚纯函数及其微分多项式的唯一性

设f是非常数亚纯函数,g是f的线性微分多项式．a和b是f的两个不同的小函数．本文证明如果f和g几乎CM分担a和b,则f≡g;此外,若f是非常数整函数,且f和f^(k)(k≥1)IM分担a和b,b-a≠Pe^λz,测f≡g．     

一类(0,1)-矩阵的最大积和式的积分表达式

给出了线和n-2的n阶（0，1）－矩阵的最大积和式的积分表达式，并证明了该积分表达式与[1]得到的组合表达式等价。     

在不同激光脉宽下的高次谐波

用数值计算方法计算了不同强激光脉冲宽度下高次谐波的产生.我们发现对于激光场强度不高,不能有效电离初态的激光场,长脉冲宽度可以更有效产生高次谐波;而对于高场强的激光场,由于它能够在几个光学周期之内把原子的初态全部电离,所以短脉冲的激光场能够更有效产生高次谐波.     

研究K4-同胚图K4(α,1,1,δ,ε,η)色性的一个引理

主要介绍了一个引理，这个引理奠定了K4－同胚图K4（α，1，1，δ，ε，η）色性研究的基础。     

Unified Model for Generation Complex Networks with Utility Preferential Attachment

In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics ofthis new network are given.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.