水溶性CdTe:Mn量子点的双光子吸收

采用激发波长800 nm、脉宽50 fs、重复频率1 kHz的Ti:sapphire放大飞秒激光器作为激发光源,利用开孔Z扫描技术研究了不同粒径的CdTe:Mn量子点的非线性吸收性质。理论计算结果表明,同一生长时间CdTe:Mn量子点的双光子吸收系数是CdTe量子点的1.1倍,其双光子吸收系数随量子点尺寸的减小而增大,这是由于CdTe:Mn量子点非线性吸收属于反饱和吸收,掺杂了Mn元素,减小了表面缺陷浓度,表明掺杂量子点具有很好的双光子吸收现象。     

Large deviation principles for Euclidean functionals and other nearly additive processes

We prove a large deviation principle for a process indexed by cubes of the multidimensional integer lattice or Euclidean space, under approximate additivity and regularity hypotheses. The rate function is the convex dual of the limiting logarithmic moment generating function. In some applications the rate function can be expressed in terms of relative entropy. The general result applies to processes in Euclidean combinatorial optimization, statistical mechanics, and computational geometry. Examples include the length of the minimal tour (the traveling salesman problem), the length of the minimal matching graph, the length of the minimal spanning tree, the length of the k-nearest neighbors graph, and the free energy of a short-range spin glass model. Received: 3 April 1999 / Revised version: 23 June 1999 / Published online: 8 May 2001     

Weighted Sobolev embedding with unbounded and decaying radial potentials

We prove embedding results of weighted W1,p(RN) spaces of radially symmetric functions. The results then are used to obtain ground and bound state solutions of quasilinear equations with unbounded or decaying radial potentials.     

Damping of the domain walls motion in Co-based amorphous ribbons with helical magnetic anisotropy: Part III

The damping of the motion of domain walls of a sandwich domain structure by the eddy currents magnetic fields, the stray fields and the hysteresis friction fields is investigated. The blocking of the motion of domain walls by the eddy currents magnetic fields is discovered.     

Path continuity of fractional Dirichlet functionals

We prove that the quasi continuous version of a functional in E^p_r is continuous along the sample paths of the Dirichlet process provided that p>2, 0<r?1 and pr>2, without assuming the Meyer equivalence. Parallel results for multi-parameter processes are also obtained. Moreover, for 1<p<2, we prove that a n parameter Dirichlet process does not touch a set of (p,2n)-zero capacity. As an example, we also study the quasi-everywhere existence of the local times of martingales on path space.     

A shape-optimization technique for the capillary surface problem

Summary The problem of the construction of an equilibrium surface taking the surface tension into account leads to Laplace-Young equation which is a nonlinear elliptic free-boundary problem. In contrast to Orr et al. where an iterative technique is used for direct solution of the equation for problems with simple geometry, we propose here an alternative approach based on shape optimization techniques. The shape of the domain of the liquid is varied to attain the optimality condition. Using optimal control theory to derive expressions for the gradient, a numerical scheme is proposed and simple model problems are solved to validate the scheme.     

紫外吸收温差光谱法及其应用

用温差光谱法观察系列化合物的紫外吸收温差谱，发现温差谱具有很强的特征性，具有π键的富勒烯Ｃ６０的温差谱峰为负值，负峰的强度样品温差增大而负荷增大，负峰的峰位无明显移。     

The twisted SU(N) group. On the C *-algebra C(S μ U(N))

It is proved that C(S U(N)) is a type I C ^*-algebra.     

Reaction of amino acid derivatives with C_(60)

Ammo acid derivatives react with C60 at 110-120℃to form adduct compounds.The products were isolated by column chromatography and were identified by FD-MS,UV-Vis,FT-IR and 13C NMR spectroscopies.     

Multicoloring and Mycielski construction

The generalized Mycielskians of graphs (also known as cones over graphs) are the natural generalization of the Mycielskians of graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer p?0, one can transform G into a new graph μ_p(G), the p-Mycielskian of G. In this paper, we study the kth chromatic numbers χ_k of Mycielskians and generalized Mycielskians of graphs. We show that χ_k(G)+1?χ_k(μ(G))?χ_k(G)+k, where both upper and lower bounds are attainable. We then investigate the kth chromatic number of Mycielskians of cycles and determine the kth chromatic number of p-Mycielskian of a complete graph K_n for any integers k?1, p?0 and n?2. Finally, we prove that if a graph G is a/b-colorable then the p-Mycielskian of G, μ_p(G), is (at+b^p+1)/bt-colorable, where . And thus obtain graphs G with m(G) grows exponentially with the order of G, where m(G) is the minimal denominator of a a/b-coloring of G with χ_f(G)=a/b.