Organoiron Polyelectrolytes: Synthesis and Characterization of Cationic Cyclopentadienyliron Complexes of Polyarylether-Imines

The synthesis of an aromatic ether complex of cyclopentadienyliron containing two terminal aldehyde groups was achieved via metal-mediated nucleophilic aromatic substitution reactions. This dialdehyde monomer was subsequently reacted with a variety of aliphatic and aromatic diamines to produce the corresponding soluble cationic organoiron polyether-imines. These cationic organometallic polymers were characterized using IR, ¹H, and ¹³C NMR, viscosity and thermogravimetric analysis. Viscosity measurements showed that these polymers exhibited polyelectrolyte effects in DMSO solutions. Thermogravimetric analysis showed that decoordination of the iron moieties occurred at about 300°C for polymers with aliphatic spacers in their backbones, while the cyclopentadienyliron moieties were cleaved from the polymers with aromatic spacers in their backbones at about 200°C. Photolytic demetallation of the organoiron polymers resulted in the removal of the pendent cyclopentadienyliron moieties and allowed for the isolation of their organic analogs. While the organoiron polymers were soluble in polar organic solvents, the corresponding organic polymers exhibited very limited solubilities or were insoluble. The organic polymers had glass transition temperatures between 101 and 120°C     

卵磷脂改善瘠性料浆悬浮性的研究

注浆成型是一种应用广泛的陶瓷成型工艺 ,但要浇注出密度高、微观结构均匀的坯体 ,配制稳定性好的浆料悬浮液是关键之一。瘠性料浆由于不具亲水性 ,通常较难获得稳定的浆料 ,而卵磷脂是天然的两性表面活性剂 ,既存在极性基 ,又存在非极性基 ,固体颗粒可以通过卵磷脂的吸附、表面改性使料浆悬浮。本文以氧化铝浆料为例进行了添加卵磷脂改善与提高瘠性料浆的悬浮性的研究 ,并获得了良好的效果     

分布式开放存取期刊爬虫的设计与实现

开放存取（open access,OA）期刊属于网络深层资源且分散在互联网中,传统的搜索引擎不能对其建立索引,不能满足用户获取OA期刊资源的需求,从而造成了开放资源的浪费。针对如何集中采集万维网上分散的开放存取期刊资源的问题,提出了一个面向OA期刊的分布式主题爬虫架构。该架构采用主从分布式设计,提出了基于用户预定义规则的OA期刊页面学术信息提取方法,由一个主控中心节点控制多个可动态增减的爬行节点,采用基于Chrome浏览器的插件机制来实现分布式爬行节点的可扩展性和部署的灵活性。     

Editor’s note

正Because modern communication networks are expected to deliver increasingly high data rates at a decreasing cost per bit,the spectral efficiency of communication systems must be further improved to facilitate emerging ubiquitous services.Furthermore,because future communication networks will comprise a large     

An algorithm and observability research of autonomous navigation and joint attitude determination in asteroid exploration descent stage

In this paper, an autonomous relative navigation and joint attitude determination algorithm in asteroid exploration descent stage is researched based on feature point information of perpendicular asteroid surface image observed by optical navigation camera, distance vectors from spacecraft to asteroid measured by three angled installed lidars and relative velocity increment measured by accelerometer when the relative distance vector to the centroid of asteroid can not be obtained. The inertial attitude of spacecraft is determined by sun vector, star vectors and inertial angular velocity respectively measured by sun sensor, star trackers and inertial reference unit. Also, in order to obtain measurement error model transferred from sensor noise, a covariance matrix solver considering error correlation is presented via the error model of normalized vector to first order. Numerical simulation and improved observability evaluation of filtering are undertaken to discuss the results of complete sensor observation and weak observation of lidars, and verify the effectiveness of the presented relative navigation and attitude determination algorithm.     

Survivability-oriented optimal node density for randomly deployed wireless sensor networks

The survivability is usually critical for wireless sensor networks,which are often deployed in the unattended harsh environment.Lots of technical schemes to improve the survivability depend on the redundant resources of the sensor networks.The amount of resources is usually determined by the node density during the deployment phase.For the random deployment and random node failures,the quantitative relation between the survivability and the node density is studied.Based on the conditional survivability,the node density to meet the required survivability level is presented.Finally,the survivability for unpredictable failures and the optimal node density to maximize the price–performance ratio are also discussed.     

HTTP-SoLDiER: An HTTP-flooding attack detection scheme with the large deviation principle

HTTP-flooding attack is a much stealthier distributed denial of service （DDoS） attack, challenging the survivability of the web services seriously. Observing the web access behavior, we find that the surfing preference of normal users is much more consistent with the webpage popularity than that of malicious users. Based on this observation, this paper proposes a novel detection scheme for HTTP-flooding （HTTP-SoLDiER）. Specifically, HTTP-SoLDiER first quantifies the consistency between web users surfing preference and the web- page popularity with large-deviation principle. Then HTTP-SoLDiER distinguishes the malicious users from normal ones according to the large-deviation probability. In practice, the webpage popularity plays a key role in attack detection of HTTP-SoLDiER. Due to the never-ending updating of the webpage content and the disturbance induced by attackers, the webpage popularity often varies over time. Thus, it is critical for HTTP-SoLDiER to dynamically update the webpage popularity. We design a reversible exponentially weighted moving average （EWMA） algorithm to solve the problem. Finally, we evaluate the effectiveness of this scheme in terms of true positive （TF） and false positive （FP） probabilities with NS-3 simulations. The simulation results show that HTTP-SoLDiER can detect all random HTTP-flooding attackers and most of the perfect-knowledge HTTP-flooding attackers at little false positive.     

Lattice-based key exchange on small integer solution problem

In this paper, we propose a new hard problem, called bilateral inhomogeneous small integer solution （Bi-ISIS）, which can be seen as an extension of the small integer solution problem on lattices. The main idea is that, instead of choosing a rectangle matrix, we choose a square matrix with small rank to generate Bi-ISIS problem without affecting the hardness of the underlying SIS problem. Based on this new problem, we present two new hardness problems： computational Bi-ISIS and decisional problems. As a direct application of these problems, we construct a new lattice-based key exchange （KE） protocol, which is analogous to the classic Diffie- Hellman KE protocol. We prove the security of this protocol and show that it provides better security in case of worst-case hardness of lattice problems, relatively efficient implementations, and great simplicity.     

基于网络学堂辅助高等数学教学的应用性研究简

本文针对网络学堂如何辅助高等数学课堂教学进行了研究,介绍了建设高等数学网络学堂的必要性,提出了建设高等数学网络学堂的途径,最后探讨了如何利用网络学堂提高高等数学教学质量。     

组合KdV方程的Hamilton系统

本文根据KdV方程的Hamilton系统,构造并证明了组合KdV方程的Hamilton系统。