比较5-Cl-PADAB光度测定Pt(Ⅳ)时的几种活化剂

比较了不同活化剂(KI-Vit C,KI,Vit C,KI-Na_2SO_3,Na_2SO_3,H_2C_2O_4)对5-Cl-PADAB光度测定Pt(Ⅳ)的影响。实验表明,KI、KI-Vit C、KI-Na_2SO_3这3种活化体系最好。其优点为:测定酸度较高,重现性和线性关系好,是良好的活化剂。     

国内外不锈钢精炼剂研究发展现状

分析了精炼剂组元元素的作用能力，讨论并总结了精炼剂组元的复合作用，介绍了几种国内、国外精炼剂产品，提出发展高效复合精炼剂的想法。     

离心铸造大口径球铁管用复合功能型脱硫剂的研制

为使硫量波动的高炉铁液能适应大型离心铸造球铁铸管生产,研制了一种成本较低廉、添加操作简单的复合功能型脱硫剂。其主要组分包括强脱[S]去[O]材料钝化镁粒、碳化钙,增加石墨核心元素Zn和膨胀集渣材料珍珠岩,以及能抑制反球化作用和净化铁液的材料等。采用冲入法进行球化处理,这种脱硫剂覆盖在球化剂和孕育剂上,使用方法简单,效果良好。     

Synchronization for linear singularly perturbed complex networks with coupling delays

This paper is concerned with the synchronization problem about linear singularly perturbed complex network system with coupling delay. The sufficient delay-dependent conditions for the synchronization of the network are established by introducing an equivalent network system with the Lyapunov stability theory. These conditions, which are formulated in terms of linear matrix inequalities, can be solved efficiently by the LMI toolbox of MATLAB. A simulation example is provided to show the validity of the proposed the synchronization conditions of the whole network.     

油井电磁清蜡器中电磁-热耦合场的数值模拟

为了减少感应加热对电磁清蜡器腔管的热蚀,提高电磁清蜡器的使用寿命,在分析油井电磁清蜡器感应加热过程的基础上,利用ANSYS的APLD语言建立了电磁清蜡器的电磁热耦合场有限元模型.重点对油井电磁清蜡器处理腔管中的电磁—热耦合场进行了仿真分析,得出了腔管内外壁的温度分布规律.仿真结果表明:电磁感应加热5s,钢管表面温度升高至175.128℃;加热10s钢管表面温度达到了343.286℃,避免了常规电阻式加热钢管明显的温升滞后现象,体现了电磁感应加热的升温速度快的特点,20s后钢管内的温度分布比较均匀,钢管总体温度在490～ 569℃的范围内,钢管内壁与钢管表面温差在77.323℃以下.     

Semi‐global and global containment control of multi‐agent systems with second‐order dynamics and input saturation

This paper considers both semi‐global and global containment control for a second‐order multi‐agent system that is composed by a network of identical harmonic oscillators or double integrators with multiple leaders and input saturation. A distributed low gain feedback algorithm is proposed to solve the semi‐global containment control problem for the network whose topology is directed and initial condition is taken from any a priori given bounded set. In particular, by using a parametric Lyapunov equation approach, M‐matrix properties and algebraic graph theory, an upper bound of the low gain parameter is estimated such that the low gain feedback matrix can be analytically determined without involving numerical computation. Furthermore, under the assumption that the induced subgraph formed by the followers is strongly connected and detail balanced, two linear feedback protocols are designed for coupled harmonic oscillators and coupled double integrators, respectively, to asymptotically achieve the global containment control of the network with any initial condition. Finally, numerical examples are given to illustrate the effectiveness of the theoretical results. Copyright © 2016 John Wiley & Sons, Ltd.     

The design and test of dual/triple‐mode bandpass filter based on temporal coupled‐mode theory

In this article, the design and test of both a K‐band dual‐mode bandpass filter (BPF) pair and a K‐band triple‐mode BPF are presented based on N‐mode temporal coupled‐mode theory (CMT). The expressions of transmission and reflection responses are analytically derived. All the parameters in the expressions have clear physical meanings and are easily optimized to reach the required filter performance. Aided by eigenmode simulations, concrete structures of the three integrated BPFs are designed and optimized to approach the calculated physical parameters. After the fabrications and measurements of the three BPFs, extended upper/lower stopband with high stopband rejections are achieved, and by increasing the number of resonant modes, improved frequency selectivity and better passband flatness are obtained. The analytical analysis well predicts the simulation and measurement results, which provides an efficient way for BPF designs. © 2016 Wiley Periodicals, Inc. Int J RF and Microwave CAE 26:609–622, 2016.     

Time Averaging Algorithms with Stopping Rules for Multi‐Agent Consensus with Noisy Measurements

A time averaging technique is introduced to consensus algorithms in networked multi‐agent systems under a noisy environment. Each agent communicates with its neighboring agents via a constant gain, while the time averaging states of the agents are considered as the values for agreement. The variation of the time averaging states then is evaluated at a specific number of iterations, where the number is given explicitly in terms of parameters related to the consensus accuracy and its probabilistic guarantee. This result establishes a rigorous stopping rule for the multi‐agent consensus with noisy measurements. Several results on this type of stopping rules are provided for undirected, directed, and time‐varying communication graphs. These theoretical results are illustrated through numerical examples.     

High‐precision formation control of nonlinear multi‐agent systems with switching topologies: A learning approach

Arbitrary high precision is considered one of the most desirable control objectives in the relative formation for many networked industrial applications, such as flying spacecrafts and mobile robots. The main purpose of this paper is to present design guidelines of applying the iterative schemes to develop distributed formation algorithms in order to achieve this control objective. If certain conditions are met, then the control input signals can be learned by the developed algorithms to accomplish the desired formations with arbitrary high precision. The systems under consideration are a class of multi‐agent systems under directed networks with switching topologies. The agents have discrete‐time affine nonlinear dynamics, but their state functions do not need to be identical. It is shown that the learning processes resulting from the relative output formation of multi‐agent systems can converge exponentially fast with the increase of the iteration number. In particular, this work induces a distributed algorithm that can simultaneously achieve the desired relative output formation between agents and regulate the movement of multi‐agent formations as desired along the time axis. The illustrative numerical simulations are finally performed to demonstrate the effectiveness and performance of the proposed distributed formation algorithms. Copyright © 2014 John Wiley & Sons, Ltd.