Attainability of the minimum data rate for stabilization of linear systems via logarithmic quantization

This paper investigates the attainability of the minimum average data rate for stabilization of linear systems via logarithmic quantization. It is shown that a finite-level logarithmic quantizer suffices to approach the well-known minimum average data rate for stabilizing an unstable linear discrete-time system under two basic network configurations. In particular, we derive explicit finite-level logarithmic quantizers and the corresponding controllers to approach the minimum average data rate.     

Convergence of multi-objective evolutionary algorithms to a uniformly distributed representation of the Pareto front

In evolutionary multi-objective optimization (EMO), the convergence to the Pareto set of a multi-objective optimization problem (MOP) and the diversity of the final approximation of the Pareto front are two important issues. In the existing definitions and analyses of convergence in multi-objective evolutionary algorithms (MOEAs), convergence with probability is easily obtained because diversity is not considered. However, diversity cannot be guaranteed. By combining the convergence with diversity, this paper presents a new definition for the finite representation of a Pareto set, the B-Pareto set, and a convergence metric for MOEAs. Based on a new archive-updating strategy, the convergence of one such MOEA to the B-Pareto sets of MOPs is proved. Numerical results show that the obtained B-Pareto front is uniformly distributed along the Pareto front when, according to the new definition of convergence, the algorithm is convergent.     

A priori and a posteriori analysis for a locking-free low order quadrilateral hybrid finite element for Reissner–Mindlin plates

This paper proposes a quadrilateral finite element method of the lowest order for Reissner–Mindlin (R–M) plates on the basis of Hellinger–Reissner variational principle, which includes variables of displacements, shear stresses and bending moments. This method uses continuous piecewise isoparametric bilinear interpolation for the approximation of transverse displacement and rotation. The piecewise-independent shear stress/bending moment approximation is constructed by following a self-equilibrium criterion and a shear-stress-enhanced condition. A priori and reliable a posteriori error estimates are derived and shown to be uniform with respect to the plate thickness t. Numerical experiments confirm the theoretical results.     

基于STM8的红外与超声波测距仪设计

介绍了一种基于STM8单片机的红外和超声波相结合的距离继电器的应用设计。阐述了该距离继电器的测距原理。经实际应用证明,该距离继电器的测量距离远大于10 m,克服了普通超声波测量距离只能达到5 m左右的问题,并且消除了测量的盲区。测量精度可以精确到1 cm,符合并超过实际应用要求。     

基于Xilinx System Generator的PID算法快速硬件实现

介绍了利用Xilinx System Generator平台构建模型化数字PID控制算法,并通过FPGA将数字PID算法结合传感器与实际硬件控制对象快速建立控制模型,构成完整的闭环控制。通过对控制效果的实验验证,证明了其控制方法的可行性。     

一种新型机载防浪涌电压保护电路设计

设计了一种新型的机载过压保护电路.该电路以芯片LT4356和APL502L为主要器件,简单可靠,能够满足防80 V/50 ms浪涌电压要求.介绍了该防浪涌电压保护电路主要特点和参数设计,并对该电路进行了仿真分析.相应实验结果表明,该电路是一种可靠有效的机载过压保护电路.     

边缘图像连通区域标记的算法研究和SoPC实现

针对二值边缘图像目标点较少的特点,提出了基于目标像素邻域的8方向生长区域标记算法.该算法充分利用了边缘图像的走向信息,提高了搜索效率,降低了堆栈空间消耗,消除了邻域反复扫描问题.     

Realization and synthesis of reversible functions

Reversible circuits play an important role in quantum computing. This paper studies the realization problem of reversible circuits. For any n-bit reversible function, we present a constructive synthesis algorithm. Given any n-bit reversible function, there are N distinct input patterns different from their corresponding outputs, where N≤2ⁿ, and the other (2ⁿ−N) input patterns will be the same as their outputs. We show that this circuit can be synthesized by at most 2n⋅N ‘(n−1)’-CNOT gates and 4n²⋅N NOT gates. The time and space complexities of the algorithm are Ω(n⋅4ⁿ) and Ω(n⋅2ⁿ), respectively. The computational complexity of our synthesis algorithm is exponentially lower than that of breadth-first search based synthesis algorithms.     

高层二次供水泵站远程监控系统的设计与实现

近几年,各级政府开始要求城市供水企业将高层建筑二次供水纳入日常管理范围,为了达到科学高效的管理目标,提出采用计算机、网络和自控技术对二次供水泵站进行远程监控,并详细介绍了系统的建设目标、建设原则、网络结构、中心端硬软件配置、现场端数据采集和地址分配。该系统实现了不同型号设备跨平台的集成,在实践中具有推广价值。     

一种视频序列拼接的新方法

提出了一种基于视频序列拼接的新方法。首先,利用KLT算法对视频序列中特征点进行提取和跟踪,实现关键帧粗略选取;其次,在选取的关键帧中利用SURF算法进行特征提取,利用最近邻距离比进行特征点匹配,通过RANSAC估计算法求精单映矩阵,并结合关键帧选取判定寻找最佳关键帧;最后,利用级联单映矩阵和加权融合算法实现视频序列拼接。实验验证了该方法的有效性。