C60激发三重态被哌嗪猝灭特性研究

本文使用激光诱导瞬态吸收光谱装置,研究了C60激发三重态在乙腈/甲苯混合溶剂中的光物理性质,得到了3C60的激发态寿命、自猝灭速率常数和时间分辩的瞬态吸收光谱.此外,实验中引入了哌嗪作为激发三重态猝灭剂.我们发现哌嗪能有效的猝灭3C60,猝灭速率常数kq接近扩散控制极限.改变混合溶剂的比例,相应的猝灭速率常数值也发生变化,即kq随混合溶剂极性的增加而增加,随溶剂粘度的增加而减小.稳态光解实验反映了反应物向产物转化过程中在紫外-可见波段吸收强度的变化.     

In situ neutron diffraction study (300-1273 K) of non-stoichiometric strontium ferrite SrFeOx

The high-temperature cubic phase of non-stoichiometric strontium ferrite SrFeO_x (2.5≤x≤3.0) has been studied by in situ neutron powder diffraction in air over the temperature range 300-1273 K. The composition of SrFeO_x changes within the range 2.56≤x≤2.81 from 1273 to 673 K, respectively.Rietveld refinements of the diffraction patterns show that the high-temperature cubic phase of SrFeO_x is consistent with a face-centred Fm3c structure. This structure leads to agreement with previous density measurements. This cell allows the high-temperature structure of SrFeO_x to be described in terms of a solid solution of the composition end members. Cubic SrFeO_x at high temperature is found to closely obey Vegard's law. The density of cubic SrFeO_x is also found to exhibit a linear relationship with composition.     

HDTV信源解码器

本论文提出一种基于TMS320C6701 DSP实现HDTV信源解码器的方案。用C6701实现系统控制、解复用、AC-3音频解码,用STi7000视频解码。与现有的HDTV信源解码方案相比,本方案将核心芯片由三片(系统控制+解复用、视频解码和音频解码)减少到两片,有利于系统集成,代表了HDTV信源解码器的发展方向之一。     

用于千兆以太网基带铜缆接收器均衡的甚高频自适应 连续时间Gm-C 二阶带通滤波器的研究和设计

本文设计了用于千兆以太网基带铜缆接收器均衡的甚高频自适应连续时间Gm-C二阶带通滤波器。基于最陡梯度下降算法，带通滤波器的零点在57－340MHz的频率范围内可以自适应地调节，中心频率为1.278GHz。通过外接电阻伺服环路，滤波器中跨导转换器的跨导值不受工艺偏差和温度变化的影响，采用CSMC－HJ0.6μm CMOS工艺器件模型，用Cadence Spectres仿真器仿真了设计的自适应滤波器电路，仿真结果验证了设计原理和设计的电路。系统的最长学习时间为880个参考时钟周期。     

Asymptotique de la norme $L^2$ d'un cycle géodésique dans les revêtements de congruence d'une variété hyperbolique arithmétique

Let M be an arithmetic hyperbolic manifold and be a codimension 1 geodesic cycle. In this paper, we study the asymptotic growth of the -norm of the lifts of F in the congruence tower above M. We obtain an explicit value for the growth rate of this norm. In particular, we provide a new proof of a celebrated result of Millson [Mi] on the homology of the arithmetic hyperbolic manifolds. The method is quite general and gives a new way of getting non zero homology classes in certain locally symmetric spaces. Received: 20 April 2001; in final form: 26 September 2001 / Published online: 28 February 2002     

Simultaneous Packing and Covering in the Euclidean Plane

 In this article we study the simultaneous packing and covering constants of two-dimensional centrally symmetric convex domains. Besides an identity result between translative case and lattice case and a general upper bound, exact values for some special domains are determined. Similar to Mahler and Reinhardt’s result about packing densities, we show that the simultaneous packing and covering constant of an octagon is larger than that of a circle. (Received 17 January 2001; in revised form 13 July 2001)     

Nonexistence Results of Minimal Immersions

Let M be a Riemannian m-dimensional manifold with m ≥ 3, endowed with non zero parallel p-form. We prove that there is no minimal isometric immersions of M in a Riemannian manifold N with constant strictly negative sectional curvature. Next we show that, under the conform flatness of the manifold N and some assumptions on the Ricci curvature of N, there is no α-pluriharmonic isometric immersion.     

Defect operators, defect functions and defect indices for analytic submodules

This paper mainly concerns defect operators and defect functions of Hardy submodules, Bergman submodules over the unit ball, and Hardy submodules over the polydisk. The defect operator (function) carries key information about operator theory (function theory) and structure of analytic submodules. The problem when a submodule has finite defect is attacked for both Hardy submodules and Bergman submodules. Our interest will be in submodules generated by polynomials. The reason for choosing such submodules is to understand the interaction of operator theory, function theory and algebraic geometry.     

Unavoidable Traces Of Set Systems

Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set system consisting of sufficiently many sets contains at least one of these structures with many sets.     

On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance

The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004