氢化丁苯共聚物结构的核磁共振波谱表征Ⅱ.微观结构的定量计算

在氢化丁苯共聚物¹³C-NMR谱脂肪碳部分谱带归属的基础上,根据各谱带的主要来源,推导出六个二单元浓度的计算公式。计算出二单元、一单元的相对含量,各结构单元的数均序列长度、嵌段含量和其它结构参数。加氢前后的¹H-和¹³C-NMR谱的组成计算结果基本一致。初步探讨了作为粘度指数改进剂的氢化丁苯共聚物微观结构与性能的关系,为合成提供了依据。     

ICP－AES法测定金属矿产品中的磷

本文研究了铁矿石、铬矿石、锰矿石中的微量磷的电感耦合等离子体发射光谱法的测定。方法简便，具有很好的精密度和准确度。标准样品的分析结果基本与标称值相吻合，回收率在９５％－１０５％之间。     

New ligands for the Fe(III)‐mediated reverse atom transfer radical polymerization of methyl methacrylate

A series of (di)picolinic acids and their derivates are investigated as novel complexing tridentate or bidentate ligands in the iron‐mediated reverse atom transfer radical polymerization of methyl methacrylate in N,N‐dimethylformamide at 100 °C with 2,2′‐azobisisobutyrontrile as an initiator. The polymerization rates and polydispersity indices (1.32–1.8) of the resulting polymers are dependent on the structures of the ligands employed. Different iron complexes may be involved in iron‐mediated reverse atom transfer radical polymerization, depending on the type of acid used. ¹H NMR spectroscopy has been used to study the structure of the resulting polymers. Chain‐extension reactions have been performed to further confirm the living nature of this catalytic system. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 2912–2921, 2006     

A FUNDAMENTAL SOLUTION FOR THE LAPLACE OPERATOR ON THE QUATERNIONIC HEISENBERG GROUP

In this paper, the author studies the Laplace operator on the quaternionic Heisenberg group, construct a fundamental solution for it and use this solution to prove the Lp-boundedness and the weak (1-1) boundedness of certain singular convolution operators on the quaternionic Heisenberg group.     

一种新型彩色三维光学成像系统

提出一种新型三维彩色光学数字成像系统。此系统利用投影结构光对现实世界中的物体进行数字化，同时得到对应的彩色纹理。详细介绍了系统的硬件设计和软件体系结构设计，得到物体彩色纹理的两种不同方法；直接获取和从编码条纹中提取，给出了用该系统得到的实验结果并简单评价了系统的性能。此系统在反求工程、影视制作、三维游戏制作、医学应用等方面有远大的应用前景。     

Efficient computation of natural convection in a concentric annulus between an outer square cylinder and an inner circular cylinder

In this work, the natural convection in a concentric annulus between a cold outer square cylinder and a heated inner circular cylinder is simulated using the differential quadrature (DQ) method. The vorticity‐stream function formulation is used as the governing equation, and the coordinate transformation technique is introduced in the DQ computation. It is shown in this paper that the outer square boundary can be approximated by a super elliptic function. As a result, the coordinate transformation from the physical domain to the computational domain is set up by an analytical expression, and all the geometrical parameters can be computed exactly. Numerical results for Rayleigh numbers range from 104 to 106 and aspect ratios between 1.67 and 5.0 are presented, which are in a good agreement with available data in the literature. It is found that both the aspect ratio and the Rayleigh number are critical to the patterns of flow and thermal fields. The present study suggests that a critical aspect ratio may exist at high Rayleigh number to distinguish the flow and thermal patterns. Copyright © 2002 John Wiley & Sons, Ltd.     

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

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

Analysis of queueing policies in QoS switches

It is widely accepted that next-generation networks will provide guaranteed services, in contrast to the “best effort” approach today. We study and analyze queueing policies for network switches that support the QoS (Quality of Service) feature. One realization of the QoS feature is that packets are not necessarily all equal, with some having higher priorities than the others. We model this situation by assigning an intrinsic value to each packet. In this paper we are concerned with three different queueing policies: the nonpreemptive model, the FIFO preemptive model, and the bounded delay model. We concentrate on the situation where the incoming traffic overloads the queue, resulting in packet loss. The objective is to maximize the total value of packets transmitted by the queueing policy. The difficulty lies in the unpredictable nature of the future packet arrivals. We analyze the performance of the online queueing policies via competitive analysis, providing upper and lower bounds for the competitive ratios. We develop practical yet sophisticated online algorithms (queueing policies) for the three queueing models. The algorithms in many cases have provably optimal worst-case bounds. For the nonpreemptive model, we devise an optimal online algorithm for the common 2-value model. We provide a tight logarithmic bound for the general nonpreemptive model. For the FIFO preemptive model, we improve the general lower bound to 1.414, while showing a tight bound of 1.434 for the special case of queue size 2. We prove that the bounded delay model with uniform delay 2 is equivalent to a modified FIFO preemptive model with queue size 2. We then give improved upper and lower bounds on the 2-uniform bounded delay model. We also show an improved lower bound of 1.618 for the 2-variable bounded delay model, matching the previously known upper bound.     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005