First principles investigations of Fe,Co, Ni in model honeycomb carbon networks

The behaviors of ferromagnetic transition metals of the first period: Fe, Co and Ni are examined within density functional theory calculations in two dimensional carbon extended networks using model structure LiC₆. Around geometry optimized structures, the energy-volume equations of states considering non magnetic and spin polarized configurations established ferromagnetic ground states with magnetizations –reduced with respect to the metals’– of 2 μ_B for FeC₆ and 1 μ_B for CoC₆ while no magnetic solution could be identified for NiC₆. In the D_6h point group of the P6/mmm space group l_m decomposition of the d states results with increasing energy into doublet state E_1g with d(x²-y²) and d(xy); singlet state A_1g d(z²) and doublet state E_2g d(xz) and d(yz) lying on E_F and responsible of the onset of magnetic moments. This was mirrored via molecular orbital approach with a construct of Fe embedded between two extended carbon networks thus validating the model structure proposed for TC₆ compounds. The 100% polarization in one spin channel allows proposing potential uses in spintronics applications.     

Pattern universes

In this essay we explore analogies between macroscopic patterns, which result from a sequence of phase transitions/instabilities starting from a homogeneous state, and similar phenomena in cosmology, where a sequence of phase transitions in the early universe is believed to have separated the fundamental forces from each other, and also shaped the structure and distribution of matter in the universe. We discuss three distinct aspects of this analogy: (i) Defects and topological charges in macroscopic patterns are analogous to spins and charges of quarks and leptons; (ii) Defects in generic 3+1 stripe patterns carry an energy density that accounts for phenomena that are currently attributed to dark matter; (iii) Space-time patterns of interacting nonlinear waves display behaviors reminiscent of quantum phenomena including inflation, entanglement and dark energy.     

基于时变Copula模型的 基金收益率相依关系的应用研究

基于时变Copula模型,获得预测方差,确定单个基金收益率序列的边缘分布.利用常见的静态Copula和时变Copula模型对基金收益率序列间两两相依关系进行建模并进行对比分析.应用研究表明,基于MCMC方法的时变Copula模型能更有效地度量基金收益率序列的风险.     

Comparative studies on the mechanism of uridine phosphorolysis

We have used quantum mechanical method to study the transition states(TSs) of uridine phosphorolysis reaction. Comparing the four different reaction pathways and the five transition states obtained, we conclude that enzymatic uridine phosphorolysis takes place mainly according to acid-catalyzed SN2 mechanism. The proposed reaction pathway is consistent with many experimental results.     

识别过渡金属离子的1,8-萘二甲酰亚胺多胺衍生物荧光传感器的研究

设计合成了用以检测过渡金属离子的荧光化学敏感器体系,它们是由1,8-萘二酰亚胺为荧光团,多胺衍生物为金属离子受体组成．在室温下对其光物理性质的研究中发现,在没有加入过渡金属离子时,由于体系内存在有效的光诱导电子转移过程使得荧光团的荧光被淬灭．加入过渡金属离子后,金属离子受体中的氮原子和过渡金属离子之间的配位作用阻断了光诱导电子转移过程,体系的荧光增强．不同的金属离子受体表现出了和过渡金属离子不同的配位识别能力,并且通过荧光的变化传递出受体-金属离子作用的信息．     

Probability Collectives for Unstable Particles

Unstable particles, together with their stable decay products, constitute probability collectives that are defined as Hilbert spaces with dimension higher than one, nondecomposable in a particle basis. Their structure is considered in the framework of Birkhoff-von Neumann's Hilbert subspace lattices. Bases with particle states are related to bases with a diagonal scalar product by a Hilbert-bein involving the characteristic decay parameters (in some analogy to the n-bein structures of metrical manifolds). Probability predictions as expectation values, involving unstable particles, have to take into account all members of the higher dimensional collective. For example, the unitarity structure of the S-matrix for an unstable particle collective can be established by a transformation with its Hilbert-bein.     

一种新的奇偶非线性相干态的位相统计性质

根据Pegg-Barnett位相定义, 计算了一种新的奇偶非线性相干态的位相概率分布函数, 利用数值计算方法研究了它们的位相统计性质. 数值计算结果表明：新的奇偶非线性相干态的位相特性与通常奇偶相干态的位相特性截然不同.     

带干扰的多险种风险模型

由于保险公司风险经营规模不断扩大,用单一险种的模型来描述风险过程存在局限性,本文讨论了带干扰多险种风险模型,应用鞅论方法,得出伦德伯格不等式和最终破产概率公式。     

Maximum Shannon Entropy, Minimum Fisher Information, and an Elementary Game

We formulate an elementary statistical game which captures the essence of some fundamental quantum experiments such as photon polarization and spin measurement. We explore and compare the significance of the principle of maximum Shannon entropy and the principle of minimum Fisher information in solving such a game. The solution based on the principle of minimum Fisher information coincides with the solution based on an invariance principle, and provides an informational explanation of Malus' law for photon polarization. There is no solution based on the principle of maximum Shannon entropy. The result demonstrates the merits of Fisher information, and the demerits of Shannon entropy, in treating some fundamental quantum problems. It also provides a quantitative example in support of a general philosophy: Nature intends to hide Fisher information, while obeying some simple rules.     

On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.