Fabricating Water-Insoluble Polyelectrolyte into Multilayers with Layer-by-layer Self-assembly

Summary A water insoluble azo-containing polyelectrolyte (PEAPB6P-AC) was successfully fabricated into multilayer films based on the layer-by-layer adsorption technique by using N, N-dimethylformamide (DMF) as the assembling media. The multilayer growth and structure were studied with UV-vis spectroscopy, and the multilayer surface were imaged with Atomic Force Microscopy and compared with that fabricated in water. The results show that assembling PEAPB6P-AC in DMF can effectively eliminate the hydrophobic aggregation of the azo units and consequently results in a much smoother multilayer surface than that fabricated in water. This improvement to the layer-by-layer adsorption technique, which can avoid some major difficulties faced when assembling hydrophobic polyelectrolytes in aqueous solutions, seems to be a versatile way to fabricate high quality multilayer films when using the hydrophobic even water-insoluble polyelectrolytes as assembling units.     

浅谈脱硫液中PDS质量浓度测定方法

提出了在以PDS催化剂作为单一的脱硫催化剂时,脱硫循环液中贫富液的PDS质量浓度的测定方法,可有效地指导在脱硫工序投加PDS的操作及生产运行,为确保出脱硫工序煤气中H2S含量稳定控制在20mg/L以内奠定了基础。     

Poly(3‐chlorothiophene) films prepared by the direct electrochemical oxidation of 3‐chlorothiophene in mixed electrolytes of boron trifluoride diethyl etherate and sulfuric acid

3‐Chlorothiophene (CT) was electrochemically polymerized in mixed electrolytes of a boron trifluoride diethyl etherate solution containing 0–20% (by volume) sulfuric acid. The oxidation potentials of the monomer in these media were measured to be only 1.06–1.31 V (vs Ag/AgCl). These values were much lower than that of CT in acetonitrile and 0.1 mol/L (Bu)₄NBF₄ (1.92 V vs Ag/AgCl). Poly(3‐chlorothiophene) (PCT) films with conductivities of 0.1–2 S cm^?1 were obtained. The structure, morphology, and electrochemical behavior of the PCT films also were investigated. © 2002 Wiley Periodicals, Inc. J Appl Polym Sci 87: 502–509, 2003     

A binary approximating method for graspable region determination of biped climbing robots

For a biped pole-climbing robot (BiPCR) with grippers, it is an essential demand to determine the target grasp configuration for climbing and transiting between poles, with the graspable region as a priori knowledge. The graspable region on the target pole is critically important for climbing path planning and motion control. To efficiently compute the graspable region for a BiPCR, we propose a novel binary approximating method in this paper. This method may also be applied to generate the three-dimensional (3-D) workspace of a manipulator with constant orientation. The grasping problem and the concept of graspable region for a BiPCR are first introduced. The binary approximating method and the corresponding algorithms are then presented to generate the graspable region. Additional constraints on a biped climbing robot with five degrees of freedom (DoFs) are presented as a supplement to the algorithm. A series of comprehensive simulations are conducted with the five-DoF and six-DoF climbing robots to verify the effectiveness of the proposed method. Finally, the dexterity of biped climbing robots with different DoFs is discussed.     

高帧频激光光斑采集系统设计

随着半导体技术的发展,COMS图像传感器的灵敏度、分辨率动态范围不断提高,采用高速COMS图像传感器替代传统的CCD图像传感器作为激光通信中APT系统的激光光斑探测单元是APT发展的一种趋势。提出了一种基于高速LUPA-300 COMS图像传感器、DSP和FPGA的通用型高帧频光斑采集系统。FPGA内部生成的异步FIFO作为图像传感器与DSP之间的数据缓冲器,简化了系统结构布局,提高了系统稳定性。经过硬件电路设计、调试、软件部分调试等工作,最终实现了每秒钟1 000帧128×128图像的数据采集,可用于高速激光光斑的采集。     

具有负载分享的P2P IPTV重迭网络的设计

针对在IPTV服务中当网上收视人数大规模增长时网络带宽消耗及服务器负载大大提高的问题,提出了利用P2P(Peer-to-Peer)概念中的应用层群播所形成的重迭网络来解决IPTV负载分享的问题,并通过P2P中Chord路由算法,加速构建与寻找对应的群播代理人节点。实验证明将Chord与应用层群播代理人做有效结合,可以提供用户具有服务质量、扩充性与负载分享的全方位P2P IPTV服务。     

JackHare: a framework for SQL to NoSQL translation using MapReduce

As data exploration has increased rapidly in recent years, the datastore and data processing are getting more and more attention in extracting important information. To find a scalable solution to process the large-scale data is a critical issue in either the relational database system or the emerging NoSQL database. With the inherent scalability and fault tolerance of Hadoop, MapReduce is attractive to process the massive data in parallel. Most of previous researches focus on developing the SQL or SQL-like queries translator with the Hadoop distributed file system. However, it could be difficult to update data frequently in such file system. Therefore, we need a flexible datastore as HBase not only to place the data over a scale-out storage system, but also to manipulate the changeable data in a transparent way. However, the HBase interface is not friendly enough for most users. A GUI composed of SQL client application and database connection to HBase will ease the learning curve. In this paper, we propose the JackHare framework with SQL query compiler, JDBC driver and a systematical method using MapReduce framework for processing the unstructured data in HBase. After importing the JDBC driver to a SQL client GUI, we can exploit the HBase as the underlying datastore to execute the ANSI-SQL queries. Experimental results show that our approaches can perform well with efficiency and scalability.     

Multi-scale patch-based sparse appearance model for robust object tracking

When objects undergo large pose change, illumination variation or partial occlusion, most existing visual tracking algorithms tend to drift away from targets and even fail to track them. To address the issue, in this paper we propose a multi-scale patch-based appearance model with sparse representation and provide an efficient scheme involving the collaboration between multi-scale patches encoded by sparse coefficients. The key idea of our method is to model the appearance of an object by different scale patches, which are represented by sparse coefficients with different scale dictionaries. The model exploits both partial and spatial information of targets based on multi-scale patches. Afterwards, a similarity score of one candidate target is input into a particle filter framework to estimate the target state sequentially over time in visual tracking. Additionally, to decrease the visual drift caused by frequently updating model, we present a novel two-step object tracking method which exploits both the ground truth information of the target labeled in the first frame and the target obtained online with the multi-scale patch information. Experiments on some publicly available benchmarks of video sequences showed that the similarity involving complementary information can locate targets more accurately and the proposed tracker is more robust and effective than others.     

Approximate inference for dynamic Bayesian networks: sliding window approach

Dynamic Bayesian networks (DBNs) are probabilistic graphical models that have become a ubiquitous tool for compactly describing statistical relationships among a group of stochastic processes. A suite of elaborately designed inference algorithms makes it possible for intelligent systems to use a DBN to make inferences in uncertain conditions. Unfortunately, exact inference or even approximation in a DBN has been proved to be NP-hard and is generally computationally prohibitive. In this paper, we investigate a sliding window framework for approximate inference in DBNs to reduce the computational burden. By introducing a sliding window that moves forward as time progresses, inference at any time is restricted to a quite narrow region of the network. The main contributions to the sliding window framework include an exploration of its foundations, explication of how it operates, and the proposal of two strategies for adaptive window size selection. To make this framework available as an inference engine, the interface algorithm widely used in exact inference is then integrated with the framework for approximate inference in DBNs. After analyzing its computational complexity, further empirical work is presented to demonstrate the validity of the proposed algorithms.     

Exponential synchronization of two totally different chaotic systems based on a unified model

This paper presents an exponential synchronization scheme between two chaotic systems with different structures and parameters. A unified model consisting of a linear dynamic system and a bounded static nonlinear operator is employed to describe these totally different chaotic systems. A novel state feedback control law is established to exponentially synchronize the two unified models with different parameters. Most chaotic systems with different structures and parameters, such as Hopfield neural networks, cellular neural networks, Chua’s circuits, unified chaotic systems, Qi systems, and chaotic recurrent multilayer perceptrons, can be transformed into this unified model with the synchronization controller designed in a unified way. Two numerical examples are exploited to illustrate the effectiveness of the proposed design schemes.