反胶束法合成氧化锌微晶及其荧光特性

0引言材料的结构(微结构)、尺寸和形貌等因素对其特性及其实际应用具有重要的影响。对无机材料特别是氧化物半导体进行结构控制的研究近年来引起了人们极大的关注。氧化锌作为一种宽带隙(3.2eV)半导体材料,可广泛应用于压电材料、气体传感器、橡胶添加剂和光学器件等领域,而且还因其在室温下可产生激射现象使其成为纳米光学材料研究领域中的一大热点[1￣6]。目前,除了传统的固相-气相(V S)反应外,用于氧化锌微晶的制备方法主要有共沉淀法[7]、多羟基化合物水解法[8]、有机金属气相沉积法[9￣12]和水热法[13]等。通过选择不同的制备方法和…     

The influence of the structure of tetracoordinate phosphorus acid esters on the catalytic effect of the sodium dodecyl sulfate-hexanol-water ternary reverse micellar system

The catalytic effect of the sodium dodecyl sulfate-hexanol-water ternary reverse micellar system in the alkaline hydrolysis ofO-alkylO′-aryl chloromethylphosphonates as a function of the substrate structure was studied. The micellar effect is mainly determined by a change in the electronic properties of the substituents, while the hydrophobicity plays a secondary role. The kinetic data were examined in the framework of the pseudo-phase model of micellar catalysis. The rate constants of the reaction in the surface layer and the partition constants of the reactants were calculated. Published inIzvestiya Akademii Nauk. Seriya Khimicheskaya, No. 8, pp. 1366–1370., August, 2000.     

Topological multiplicity of the maximum eigenvalue of graph 1-Laplacian

In this paper, we reveal the connection between the independent number of a graph and the topological multiplicity of the maximal eigenvalue of the corresponding graph 1-Laplacian. The pseudo independent number of a graph is introduced, which provides a better lower estimate of the topological multiplicity of the maximum eigenvalue. The technique of our proof is based on the localization property of the eigenvector for graph 1-Laplacian, the Krasnoselski genus, and its relation to the topological join.     

Properties of connected graphs having minimum degree distance

The degree distance of a connected graph, introduced by Dobrynin, Kochetova and Gutman, has been studied in mathematical chemistry. In this paper some properties of graphs having minimum degree distance in the class of connected graphs of order n and size m≥n−1 are deduced. It is shown that any such graph G has no induced subgraph isomorphic to P₄, contains a vertex z of degree n−1 such that G−z has at most one connected component C such that |C|≥2 and C has properties similar to those of G.For any fixed k such that k=0,1 or k≥3, if m=n+k and n≥k+3 then the extremal graph is unique and it is isomorphic to K₁+(K_1,k+1∪(n−k−3)K₁).     

Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order

We compare Aut(Q), the classical automorphism group of a countable dense linear order, with Aut _c (Q), the group of all computable automorphisms of such an order. They have a number of similarities, including the facts that every element of each group is a commutator and each group has exactly three nontrivial normal subgroups. However, the standard proofs of these facts in Aut(Q) do not work for Aut _c (Q). Also, Aut(Q) has three fundamental properties which fail in Aut _c (Q): it is divisible, every element is a commutator of itself with some other element, and two elements are conjugate if and only if they have isomorphic orbital structures.     

A Cutting Plane Algorithm for Linear Reverse Convex Programs

In this paper, global optimization of linear programs with an additional reverse convex constraint is considered. This type of problem arises in many applications such as engineering design, communications networks, and many management decision support systems with budget constraints and economies-of-scale. The main difficulty with this type of problem is the presence of the complicated reverse convex constraint, which destroys the convexity and possibly the connectivity of the feasible region, putting the problem in a class of difficult and mathematically intractable problems. We present a cutting plane method within the scope of a branch-and-bound scheme that efficiently partitions the polytope associated with the linear constraints and systematically fathoms these portions through the use of the bounds. An upper bound and a lower bound for the optimal value is found and improved at each iteration. The algorithm terminates when all the generated subdivisions have been fathomed.     

共振域矩形介质光栅的逆向设计

采用模态法研究了共振域光栅分束器及闪耀光栅等光学器件的设计原理及逆向设计方法,给出了-1级非偏振闪耀光栅的典型设计示例。研究表明,自准直角入射时,光束在光栅内传输将激发产生离散模,通过调节离散模透过光栅传输时的累积相位差,可对衍射光进行调控,实现偏振(非偏振)分束、偏振(非偏振)闪耀等功能。采用严格耦合波法对基于模态法逆向设计的-1级非偏振石英闪耀光栅的几何参数进行验证,计算结果显示两者非常吻合,证明了该方法的正确性。     

复合Logistic映射中的逆分岔与分形

利用分岔图，揭示出复合Logistic映射可按倍周期分岔走向混沌，且混沌区中存在混沌危机及逆分岔现象．同时，分析了复合Logistic映射临界点的轨道，给出了复合Logistic映射Mandelbrot-Julia集(简称M-J集)的定义，推广了Welstead和Cromer所提出的周期点查找技术，并利用该技术，构造出一系列复合Logistic映射的M-J集．在此基础上，研究了M-J集的对称性；探索了M集周期区域分布的拓扑不变性；通过定性地建立M集上J集的整体刻画，发现M集包含了J集构造的大量信息．