Factoring and decomposing a class of linear functional systems

Within a constructive homological algebra approach, we study the factorization and decomposition problems for a class of linear functional (determined, over-determined, under-determined) systems. Using the concept of Ore algebras of functional operators (e.g., ordinary/partial differential operators, shift operators, time-delay operators), we first concentrate on the computation of morphisms from a finitely presented left module M over an Ore algebra to another one M′, where M (resp., M′) is a module intrinsically associated with the linear functional system Ry = 0 (resp., R′z = 0). These morphisms define applications sending solutions of the system R′z = 0 to solutions of R y = 0. We explicitly characterize the kernel, image, cokernel and coimage of a general morphism. We then show that the existence of a non-injective endomorphism of the module M is equivalent to the existence of a non-trivial factorization R = R₂R₁ of the system matrix R. The corresponding system can then be integrated “in cascade”. Under certain conditions, we also show that the system Ry = 0 is equivalent to a system R′z = 0, where R′ is a block-triangular matrix of the same size as R. We show that the existence of idempotents of the endomorphism ring of the module M allows us to reduce the integration of the system Ry = 0 to the integration of two independent systems R₁y₁ = 0 and R₂y₂ = 0. Furthermore, we prove that, under certain conditions, idempotents provide decompositions of the system Ry = 0, i.e., they allow us to compute an equivalent system R′z = 0, where R′ is a block-diagonal matrix of the same size as R. Applications of these results in mathematical physics and control theory are given. Finally, the different algorithms of the paper are implemented in the Maple package Morphisms based on the library oremodules.     

Module homomorphisms and multipliers on locally compact quantum groups

For a Banach algebra A with a bounded approximate identity, we investigate the A-module homomorphisms of certain introverted subspaces of A^∗, and show that all A-module homomorphisms of A^∗ are normal if and only if A is an ideal of A∗∗. We obtain some characterizations of compactness and discreteness for a locally compact quantum group G. Furthermore, in the co-amenable case we prove that the multiplier algebra of L¹(G) can be identified with M(G). As a consequence, we prove that G is compact if and only if LUC(G)=WAP(G) and M(G)≅Z(LUC^∗(G)); which partially answer a problem raised by Volker Runde.     

AF C~*-代数上的Schur积与完全有界映射

证明了ＡＦＣ-代数Ｂ上的有界Ｄ-模映射是完全有界的,这里Ｄ是Ｂ的一个ＳＶｍａｓａ．     

故障注入技术在机载计算机模拟量采集中的应用

近年来航空武器的功能性能快速提高,机载计算机处理能力也越来越强。接口模块作为处理多种接口信号的重要部件,在机载计算机中起着至关重要的作用。文中结合故障注入技术,在以往常用模拟量采集电路基础上,设计了模拟量激励产生电路,实现模拟量采集电路的故障注入,结合测试软件完成模拟量采集电路的检测,达到提高机载计算机的测试性的目标。     

城轨列车辅助逆变器大功率器件开路故障诊断

随着LTE技术的不断发展,军事通信领域的通信终端产品也需要更新、升级。通信终端模块（CTM,Communication Transmission Module）是一款嵌入式的TD-LTE数据卡终端产品。AT指令模块用来实现CTM与PC机之间的数据传输与控制。提出了CTM中AT指令模块的软件设计方案,采用模块化的设计方法,统一上层应用接口,实现了应用程序与Nucleus平台的衔接,提高了应用程序的可移植性;AT指令的函数匹配处理流程采用分类查找法,简化了AT指令的查找过程,提高了查找效率。最后搭建测试环境,验证了AT指令模块的功能,以上方法在实际开发和应用中都具有良好的扩展性、通用性和可移植性。     

基于连续小波变换的神经网络人脸识别研究

研究了基于连续小波变换的神经网络进行人脸识别的方法.介绍了小波分析的理论基础，详细讨论了根据小波变换系数的范数选取小波母函数的方法，根据小波脊线确定网络神经元个数的方法以及神经网络的初始化和参数训练方法.通过对人脸图像灰度的连续小波分析，神经网络的自组织自学习能力，调整连接权值和小波神经元的尺度、位移参数，完成人脸识别的任务.实验结果验证了该神经网络的识别性能明显优于用特征脸方法对相同人脸库进行的识别.     

Joint optimization of product family configuration and scaling design by Stackelberg game

Product family design is generally characterized by two types of approaches: module-based and scale-based. While the former aims to enable product variety based on module configuration, the latter is to variegate product design by scaling up or down certain design parameters. The prevailing practice is to treat module configuration and scaling design as separate decisions or aggregate two design problems as a single-level, all-in-one optimization problem. In practice, optimization of scaling variables is always enacted within a specific modular platform; and meanwhile an optimal module configuration depends on how design parameters are to be scaled. The key challenge is how to deal with explicitly the coupling of these two design optimization problems.     

Smash积代数和量子模范畴中的Hopf代数的新对偶

本文引入模代数的一种新对偶,它推广了代数的有限对偶概念,并证明:通过这种新对偶,模代数的对偶为余模余代数,从而形成Smash余积,而且证明了Smash积的对偶是Smash余积,即有(A#H)~0 _HA~0×H~0余代数同构,最后证明量子模范畴中的Hopf代数通过这种新对偶是自对偶的。     

K[X]^m中模的生成基及其应用

本文研究了多项式环上的素模中的生成基理论和方法。通过建立新的约化准则,得到了模中生成基的结构和机械计算方法。对于低维情形给出了素右生成基的充分必要条件。文中的方法本质地简化了传统的模中Grobner基方法。文中同时介绍了该方法在样条理论研究中的应用,并给出了一些计算例子。