Improved error bound for multivariate Chebyshev polynomial interpolation

ABSTRACT

Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties which provides tremendous application potential in mathematical finance. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For efficiency, a sharp error bound is essential, in particular for high-dimensional applications. For tensorized Chebyshev interpolation, we present an error bound that improves existing results significantly.     

二维反三角超混沌系统及其在图像加密上的应用

为了进一步提高混沌系统的混沌特性，为图像加密算法提供更可靠的混沌系统，增强图像加密算法的安全性，提出了一种基于二维反三角超混沌系统的新型图像加密算法。首先，在一维三角混沌函数的基础上构建了一个二维反三角超混沌系统，通过分岔图和Lyapunov指数等仿真实验，验证了该系统具有更广的混沌区间和更强随机性的迭代序列，遍历性更加优秀；然后，基于此混沌系统，采用"置乱-扩散"策略，根据不同密钥生成的不同超混沌序列，对图像矩阵进行无重复置乱和循环移位扩散，循环三次得到密文，完成加密过程；最后，对图像加密方案进行了直方图分析、密钥空间分析、相邻像素相关性分析、明文敏感性分析和信息熵分析等性能测试。其中密文图像的相关指标参数像素变化率（NPCR）和统一平均变化强度（UACI）的测试值非常接近于它们的理想期望值，信息熵的测试结果约为7.997，也非常接近于理想期望值8。实验结果表明，此图像加密系统具有更可靠的安全性，抵抗攻击能力强，在图像安全领域具有较好的应用前景。     

An iterative method for suboptimal control of linear time-delayed systems

This article presents a new approach for solving the Optimal Control Problem (OCP) of linear time-delay systems with a quadratic cost functional. The proposed method can also be used for designing optimal control time-delay systems with disturbance. In this study, the Variational Iteration Method (VIM) is employed to convert the original Time-Delay Optimal Control Problem (TDOCP) into a sequence of nonhomogeneous linear two-point boundary value problems (TPBVPs). The optimal control law obtained consists of an accurate linear feedback term and a nonlinear compensation term which is the limit of an adjoint vector sequence. The feedback term is determined by solving Riccati matrix differential equation. By using the finite-step iteration of a nonlinear compensation sequence, we can obtain a suboptimal control law. Finally, Illustrative examples are included to demonstrate the validity and applicability of the technique.     

基于Legendre多项式的锂离子电池降阶模型

在Newman模型以及单粒子模型(SPM)的基础上,提出基于Legendre正交多项式的电池模型降阶算法;同时,将固液相物理量的分布纳入模型算法,在提高运算速度的情况下,保证运算精度。以磷酸铁锂(Li Fe PO4)正极锂离子电池为例,对导出的降阶模型进行仿真验证。与全阶模型相比,该模型所计算的电池状态量误差均能保持在2%下。     

超宽带大功率合成器设计北大核心CSCD

在80 MHz~1 GHz频段,单个功率管输出功率能达到100 W以上,为研制输出功率400 W的功率放大器,文中设计了四路功率合成器。该合成器需要实现功率容量大、工作频带宽、体积小的设计目标。在功率容量方面,文中采用悬置带状线结构,其功率容量远远大于微带线结构;在工作频带方面,采用切比雪夫九节阻抗变换器,将工作带宽拓宽为80 MHz~1 GHz;在体积方面,文中合成器的功率合成部分采用Y型节级联实现四路功率合成,阻抗变换部分采用切比雪夫阻抗变换器进行阻抗变换,该结构相较于磁环巴伦功率合成器,不但具有损耗小、平坦度高的优点,而且通过将阻抗变换器设计成曲折的形状,进一步缩小了合成器体积。仿真与实测结果显示该合成器在80 MHz~1 GHz范围内还具有较高的平坦度,合成效率可达90%以上。     

Construction of a polynomial invariant annihilation attack of degree 7 for T-310

Abstract

Cryptographic attacks are typically constructed by black-box methods and combinations of simpler properties, for example in [Generalised] Linear Cryptanalysis. In this article, we work with a more recent white-box algebraic-constructive methodology. Polynomial invariant attacks on a block cipher are constructed explicitly through the study of the space of Boolean polynomials which does not have a unique factorisation and solving the so-called Fundamental Equation (FE). Some recent invariant attacks are quite symmetric and exhibit some sort of clear structure, or work only when the Boolean function is degenerate. As a proof of concept, we construct an attack where a highly irregular product of seven polynomials is an invariant for any number of rounds for T-310 under certain conditions on the long term key and for any key and any IV. A key feature of our attack is that it works for any Boolean function which satisfies a specific annihilation property. We evaluate very precisely the probability that our attack works when the Boolean function is chosen uniformly at random.     

利用分段三次多项式提取山谷线和山脊线

通过利用分段三次多项式插值法将地形图中的等高线分段来求曲线的表达式,然后对每段上的表达式采取曲率最大值法,得出等高线弯曲变化的特征点,来提取地形图中的山谷线和山脊线,并选取了某一地区的地形等高线图进行了实验,以验证该方法的正确性。