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

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

Al_(63)Cu_(25)Fe_(12)准晶体的相变及应用研究

从应用角度出发,系统地研究了Al_(63)Cu_(25)Fe_(12)合金的相变及性能特点,并初步研究了准晶体对传统铝合金表面改性的贡献。结果表明:该合金在450℃～820℃温度区间内晶体相Al_7Cu_2Fe发生同素异构转变形成稳定I相,具有较高的硬度和硬度值变化不大(650～850kgf/mm~2)的特点,可与传统铝合金复合并使其硬度和耐磨性能显著提高。     

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.     

管理信息系统教学刍议

企业管理的发展变化和计算机信息技术的迅猛发展,给管理信息系统的教学提出了更高的要求,要求管理信息系统的教学体系要不断完善、教学内容要不断充实,教学方式要不断改进。从预备知识的重要性、教学内容的更新、强化案例教学、加强实践环节等方面进行探讨,探索出一条真正有效、切实可行的教学改革之路。     

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     

一类非线性规划问题的等价性证明

给出了非线性规划问题中目标函数单调变换前后的一个等价性证明.     

一种基于段的基音检测算法

作为语音信号处理领域一项基本、关键的技术,基音检测在语音信号处理中扮演着重要的角色,一直是语音信号处理的一个研究热点.首先对传统的基于短时自相关函数法的基音检测进行了研究;在此基础上提出了一种能同时检测一段语音信号基音周期的方法,有效地克服了传统基音检测算法只能检测一帧语音信号基音的缺点.进行了实验仿真,结果表明通过去野点,中值平滑等后处理的基于段的基音检测算法比传统的基于帧的基音检测算法具有更好的抗噪性.