K2O和Na2O对高Al2O3炉渣组元活度和MgO含量的影响

 随着高品位铁矿石消耗的加快,资源逐渐趋于贫化,钢铁企业可利用的铁矿石原料逐渐向中低品位原料转变,尤其是高铝铁矿,这类原料的使用无疑会增加高炉渣中Al₂O₃质量分数,影响高炉现有的操作制度。Al₂O₃质量分数为15%～17%的高炉渣,由于Al₂O₃含量高而使高炉渣的冶金性能变差,为了保证高炉渣的冶金性能,必须在其中添加8%左右的MgO。然而,Al₂O₃含量相似的浦项钢铁的高炉渣,其MgO质量分数仅为4%左右,高炉实现了高效、稳定、顺行。因此,从高炉CaO-SiO₂-Al₂O₃-MgO四元渣系的物理化学机理出发,研究了K₂O、Na₂O对高炉渣四元渣系CaO-SiO₂-Al₂O₃-MgO中各组元活度的影响;研究了“渣-气”平衡条件下渣中碱金属氧化物和气体中碱金属的关系;计算了K₂O、Na₂O和MgO对黏度的影响。结果显示,在考虑高炉渣CaO-SiO₂-Al₂O₃-MgO中各组元活度、碱金属在渣-气间的分布和炉渣黏度的情况下,当碱金属氧化物K₂O和Na₂O存在时,可以适当减小MgO含量,并可以保证高炉渣各组元活度及炉渣黏度基本不变。这不仅有助于减少高炉原料中添加含镁熔剂、提高原料品位、高效排碱、降低碱危害、减少碳排放、延长高炉寿命及降低成本,还能促进钢铁企业实现节能减排的目标。     

用相变方法制取高纯度超细钽粉的研究

报导了通过相变热处理使Ｋ２ＴａＦ７晶体参数发生变化，以利于制取高纯度超细钽粉的实验依据和结果。结果表明，Ｋ２ＴａＦ７在２００～２５０℃发生可逆相变；相变后Ｋ２ＴａＦ７晶体的粒径可由原来的１３５１．８μｍ减小至７０．８μｍ，极大地提高了比表面积；相变后，杂质极大挥发，提高了Ｋ２ＴａＦ７的纯度。     

双组分高固体丙烯酸聚氨酯涂料的研究

介绍了改性高固体分羟基丙烯酸树脂的合成工艺，通过对引发剂、链转移剂、反应温度及叔碳酸缩水时油酯等因素的讨论，合成了新型的羟基丙烯酸树脂。以其为基料配制了丙烯酸聚氨酯涂料，并讨论了该磁漆的配方设计和各项性能。     

复分解四步循环法制取硫酸钾新工艺

介绍了制取硫酸钾的一种新工艺－－复分解四步循环法，即氯化钾与硫酸铵反应生成硫酸钾铵与氯化铵钾，硫酸钾铵再与氯化钾溶液反应生成硫酸钾，氯化铵钾再与硫酸铵溶液反应生成氯化铵。整个工艺全封闭循环生产，产品硫酸钾K2O质量分数≥50％，钾收率达92％。     

A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs

In recent years growing interest in local distributed algorithms has widely been observed. This results from their high resistance to errors and damage, as well as from their good performance, which is independent of the size of the network. A local deterministic distributed algorithm finding an approximation of a Minimum Dominating Set in planar graphs has been presented by Lenzen et al., and they proved that the algorithm returns a 130-approximation of the Minimum Dominating Set. In this article we will show that the algorithm is two times more effective than was previously assumed, and we prove that the algorithm by Lenzen et al. outputs a 52-approximation to a Minimum Dominating Set. Therefore the gap between the lower bound and the approximation ratio of the best yet local deterministic distributed algorithm is reduced by half.     

切换有向拓扑中的网络化Euler-Lagrange系统自适应同步控制

在动态切换拓扑中研究了带有参数不确定性和单向信息交互的网络化Euler-Lagrange系统的协同控制问题.针对通信拓扑随时间变化的问题,利用有效的局部信息交互设计了一个分布式控制律,并利用自适应技术解决了系统动力学中的参数不确定性问题.通过构造一个连续的Lyapunov函数,证明了系统在切换拓扑的并图存在一棵有向生成树的频率足够高时即可实现网络同步.此外,进一步拓展使用简单的干扰观测器或滑模控制方法进一步研究了该协同策略下的干扰抑制问题.最后,以五颗异构航天器的姿态同步为背景,通过数值仿真及其对照说明了所提合作控制策略的有效性.     

Peer-to-peer bichromatic reverse nearest neighbours in mobile ad-hoc networks

The increasing use of mobile communications has raised many issues of decision support and resource allocation. A crucial problem is how to solve queries of Reverse Nearest Neighbour (RNN). An RNN query returns all objects that consider the query object as their nearest neighbour. Existing methods mostly rely on a centralised base station. However, mobile P2P systems offer many benefits, including self-organisation, fault-tolerance and load-balancing. In this study, we propose and evaluate 3 distinct P2P algorithms focusing on bichromatic RNN queries, in which mobile query peers and static objects of interest are of two different categories, based on a time-out mechanism and a boundary polygon around the mobile query peers. The Brute-Force Search Algorithm provides a naive approach to exploit shared information among peers whereas two other Boundary Search Algorithms filter a number of peers involved in query processing. The algorithms are evaluated in the MiXiM simulation framework with both real and synthetic datasets. The results show the practical feasibility of the P2P approach for solving bichromatic RNN queries for mobile networks.     

一种不确定图中最可靠最大流问题的解决方案

最可靠最大流是不确定图中可靠性最高的最大流,它是传统最大流问题在不确定图上的自然延伸.现有的最可靠最大流算法SDBA时间复杂性较高,无法满足实际中不同应用的需求,为此,文中提出一种具有普遍适用性的最可靠最大流解决方案.该方案包含面向不同需求的3种算法:基于负权群落消去的NWCE算法、基于时间约束优先单环消去的SPEA-t算法和基于概率阈值约束优先单环消去的SPEA-p算法.其中,NWCE算法借鉴最小费用最大流的"流平移"思想并基于文中提出的负权群落概念,在辅助剩余图中不断地消去可使可靠性增加而流量不变的负权群落,可证当消去所有负权群落时对应的最大流即为最可靠最大流.根据负权群落中由单环组成的群落占很高比例且相对于多环组成的群落更易查找和消去的性质,同时考虑到NWCE算法为了获得最优解,往往为了消去最后少数几个对概率提高贡献很小的负权群落却花费了很长时间的现象,提出SPEA-t和SPEA-p两种快速近似算法,前者是以规定时间内尽可能逼近最优解为目标,后者是以最少时间达到预设的概率阈值为目标,它们都采用了优先消去概率-时间效益较好的单环群落的策略,加快对最优解的逼近速度,减少或放弃时间开销较大的多环群落的消去,以满足那些对算法时间性能要求很高而结果以近似最优即可的应用需求.实验表明,相对于SDBA算法,NWCE算法结合概率剪枝策略在时间性能上有了数量级的提高,而SPEA-t算法和SPEA-p算法则具有更高的性能和更好的适用性.     

Effects of urea fertigation of apple trees on soil pH,exchangeable cations and extractable manganese in a sandy loam soil in New Zealand

Changes in soil pH, exchangeable aluminium (Al), calcium (Ca), magnesium (Mg), and potassium (K) and extractable manganese (Mn) were investigated after urea fertigation of a sandy loam soil in an apple orchard in New Zealand. Urea at three rates (0, 25, 50 kg N ha^–1 yr^–1 or 0, 16.9, 33.8 g N emitter^–1 yr^–1) was applied in 4 equal fertigations. Soil cores at 4 profile depths (0–10, 10–20, 20–40 and 40–60 cm) directly below and 20 cm from the emitter were sampled approximately 4 weeks after each fertigation and in the following winter. Results obtained showed that the largest changes in soil pH and cations occurred in soils directly below the emitter in the 50 kg N ha^–1 yr^–1 treatment where the soil pH decreased by 1.6 pH units at all soil depths. The lowest pH of 4.3 was observed at a depth of 27 cm. Exchangeable Al and extractable Mn levels increased to 11 meq kg^–1 and 78µg g^–1 respectively. Estimated losses of Ca, Mg and K from the upper soil profile depth (0–10 cm) represented 23, 63 and 27% of their respective total exchangeable levels. At lower profile depths (>20 cm), accumulation of displaced K was evident. Variable, and generally non-significant, chemical changes recorded in soils 20 cm from the emitter were attributed to restricted lateral water movement, and therefore urea movement, down the profile.The present study showed that one season of urea fertigation by trickle emitters, applied to a sandy loam, at half the rate conventionally applied to apple orchards (50 kg N ha^–1 yr^–1) resulted in pH and mineral element imbalances which were potentially and sufficiently severe to inhibit tree growth.     

基于全网能量均衡的WirelessHART图路由算法

如何均衡使用网络节点能量并生成高可靠路由是WirelessHART网络研究的一个难题,为此提出了一种GRAEB（graph routing algorithm based on energy balancing）图路由算法。首先,网络被初始化为连通的图结构,能够提高丰富的冗余路径。网络管理器根据全网节点剩余能量、通信周期、链路分布等因子生成节点鲁棒系数矩阵,节点通过比较邻居的鲁棒系数来选择最优路径。另外,规定了邻居节点数的上限阈值,每次路由更新只保留鲁棒系数最优的邻居。仿真结果表明GRAEB不仅提高了网络可靠性,而且延长了网络寿命。