Blind estimation of the PN sequence in lower SNR DS-SS signals with residual carrier

This paper presents a method of singular value decomposition (SVD) plus digital phase lock loop (DPLL) to solve the difficult problem of blind pseudo-noise (PN) sequence estimation in low signal to noise ratios (SNR) direct sequence spread spectrum (DS-SS, DS) signals with residual carrier. Of course, the method needs to know the parameters of DS signal, such as the period and code rate of PN sequence. Firstly, the received signal is sampled and divided into non-overlapping signal vectors according to a temporal window, whose duration is two periods of PN sequence. Then, an autocorrelation matrix is computed and accumulated by the signal vectors one by one. The PN sequence with residual carrier can be estimated by the principal eigenvector of this autocorrelation matrix. Furthermore, a DPLL is used to deal with the estimated PN sequence with residual carrier, it estimates and tracks the residual carrier, removes the residual carrier in the end. Theory analysis and computer simulation results show that this method can effectively realize the PN sequence estimation from the input DS signals with residual carrier in lower SNR.     

An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search.     

Adaptive fuzzy dynamic surface control for a class of perturbed nonlinear time-varying delay systems with unknown dead-zone

In this paper,adaptive dynamic surface control(DSC) is developed for a class of nonlinear systems with unknown discrete and distributed time-varying delays and unknown dead-zone.Fuzzy logic systems are used to approximate the unknown nonlinear functions.Then,by combining the backstepping technique and the appropriate Lyapunov-Krasovskii functionals with the dynamic surface control approach,the adaptive fuzzy tracking controller is designed.Our development is able to eliminate the problem of "explosion of complexity" inherent in the existing backstepping-based methods.The main advantages of our approach include:1) for the n-th-order nonlinear systems,only one parameter needs to be adjusted online in the controller design procedure,which reduces the computation burden greatly.Moreover,the input of the dead-zone with only one adjusted parameter is much simpler than the ones in the existing results;2) the proposed control scheme does not need to know the time delays and their upper bounds.It is proven that the proposed design method is able to guarantee that all the signals in the closed-loop system are bounded and the tracking error is smaller than a prescribed error bound,Finally,simulation results demonstrate the effectiveness of the proposed approach.     

保持几何特征的自适应弹性二次曲线模型

物体形状特征的准确提取往往受到图像获取、目标分割等过程中各种因素的影响,因而需要构造一种鲁棒的形状表现来保有其本质特征。揭示弹性二次曲线(EQW)模型中能量权重因子和样条重叠度因子与形状几何特性间的关系,提出一种自适应保持几何特征的EQW形状表现模型,并将该模型与交互式Live Wire算法相结合,应用至图像分割中,对于各种模态图像中的目标进行分割实验。直观上,本文方法能够在去除噪声同时较好地保持目标形状的显著特征;量化结果方面,交互式分割误差保持在较小稳定范围内,引入EQW模型带来的时间开销亦在可接受范围内。     

基于FPGA的高速二维DCT变换的研究与实现

空间科学实验中图像的分辨率不断提高、数据量越来越大,因此需要对图像数据进行星上压缩处理后再进行传输。FPGA具有低功耗、高性能的特点,已普遍应用在卫星的各种有效载荷上,因此可采用FPGA实现图像压缩。基于FPGA的图像压缩算法的核心是DCT变换,而DCT变换中需消耗大量的乘法资源。为了提高图像压缩的效率,同时减少对专用乘法器的依赖,本文就充分利用FPGA中的BRAM与LUT资源,使用改进型的分布式算法、流水结构和乒乓操作,在避免使用乘法器的同时,实现JPEG压缩算法中的DCT变换,具有良好的可移植性。经验证,该方法用于基于FPGA的JPEG图像压缩系统中,相比传统DCT快速算法运算速度显著提高。     

基于机会约束的电动汽车充光储一体化充电站容量优化方法

针对电动汽车充电站建设运营成本高,土地利用率较低,功能单一的缺点,提出了电动汽车充光储一体化充电站的容量优化方法。考虑光伏出力及电动汽车充电负荷的不确定性,研究在不确定性环境下的容量配置问题,以保证优化方案的可靠性。基于机会约束规划,以建设运营成本最小为目标建立电动汽车充光储一体化充电站容量配置模型,通过序列运算理论将模型中含有随机变量的约束进行确定性转化,采用CPLEX作为模型的求解工具。算例验证了所提模型及方法的有效性。     

The Importance of Therapeutically Targeting the Binary Toxin from Clostridioides difficile

Novel therapeutics are needed to treat pathologies associated with the Clostridioides difficile binary toxin (CDT), particularly when C. difficile infection (CDI) occurs in the elderly or in hospitalized patients having illnesses, in addition to CDI, such as cancer. While therapies are available to block toxicities associated with the large clostridial toxins (TcdA and TcdB) in this nosocomial disease, nothing is available yet to treat toxicities arising from strains of CDI having the binary toxin. Like other binary toxins, the active CDTa catalytic subunit of CDT is delivered into host cells together with an oligomeric assembly of CDTb subunits via host cell receptor-mediated endocytosis. Once CDT arrives in the host cell’s cytoplasm, CDTa catalyzes the ADP-ribosylation of G-actin leading to degradation of the cytoskeleton and rapid cell death. Although a detailed molecular mechanism for CDT entry and host cell toxicity is not yet fully established, structural and functional resemblances to other binary toxins are described. Additionally, unique conformational assemblies of individual CDT components are highlighted herein to refine our mechanistic understanding of this deadly toxin as is needed to develop effective new therapeutic strategies for treating some of the most hypervirulent and lethal strains of CDT-containing strains of CDI.     

一类具有Beddington - DeAngelis功能反应的离散竞争系统的概周期解

针对一类具有Beddington - DeAngelis功能反应的离散竞争系统,运用差分不等式和通过构造适当的Lyapunov函数,证明了该系统具有持久性和全局吸引性.利用差分概周期方程的壳理论,得到了保证该系统存在唯一的概周期解的充分条件.所得结果补充了文献[3]和文献[4]的工作.     

基于MODWT和BP神经网络的微电网故障诊断方法

近年来,随着微电网技术的持续发展,电力用户对其供电可靠性的要求也不断提高,因此微电网故障诊断研究也变得越来越重要。提出了一种基于极大重叠离散小波变换(MODWT)和反向传播(BP)神经网络的微电网故障诊断新方法,并通过仿真与算例进行了验证。结果表明:该方法能快速、准确地识别出故障类型,且不受故障初始相位角和过渡电阻等因素的影响;与现有的基于离散小波变换和反向传播神经网络的诊断方法相比所提出的方法可以提供更好的故障分类精度。     

双光子加工数据准备软件的研究*

双光子加工技术需要通过数据准备软件将CAD模型转换为加工数据.为此提出了三种进行双光子加工的数据准备方法,即STL处理、图片处理和线条处理;基于MFC的单文档/视图结构框架开发了软件.应用实例表明,该软件界面友好、运行可靠.