基于同态的软件重用技术度量

针对现有重用技术不便于解决的重用问题，采用基于同态的重用技术，研究了问题表示的同态重用。在此基础上提出一种同态重用度的概念，通过计算同态重用度的方法，人们可以在编写程序前就对已有程序的重用程度给出评价，从而有目的有选择地进行软件重用，这样就能比较系统、广泛地在软件开发中应用重用技术。     

Fuzzy hyperlattices

In this paper, we introduce the notion of fuzzy hyperlattices and establish connections between fuzzy hyperlattices and hyperlattices. Then we discuss the relations between the weak homomorphism of fuzzy hyperlattices and the weak homomorphism of corresponding hyperlattices. Moreover, we define and analyze the hypercongruence on hyperlattices and the fuzzy (strong) hypercongruence on fuzzy hyperlattices. And we study the interrelation between the (fuzzy) hypercongruence on (fuzzy) hyperlattices and the homomorphism of (fuzzy) hyperlattices. Also, a relation between the fuzzy hypercongruence on fuzzy hyperlattices and the hypercongruence on corresponding hyperlattices is obtained. Finally, we apply the hypercongruence and the fuzzy strong hypercongruence to construct quotient structures of hyperlattices and fuzzy hyperlattices, respectively.     

时变衰落信道下同态滤波技术的研究

针对短波信道多径传播的特点,采用卷积型滤波技术和复时谱分析方法,抗多径传播引起的信号衰落．研究结果表明,该方法能够更好的滤除干扰,改变传输信道质量．     

雷达——通信一体化系统设计

针对日益复杂的电磁环境和目标威胁,作战平台一体化是军事对抗领域的强烈需求.研究在保持或很少影响雷达系统性能的前提下,利用软件无线电技术将通信功能加载到现有的雷达系统中,实现雷达与通信的综合一体化设计.首先将通信信号调制到雷达信号上,形成一体化信号进行发射,在接收端使接收信号先通过信号分离器,采用同态滤波和修正的肓信号分...     

关于布尔格同态的研究

对布尔格同态进行了深入研究后,给出了布尔格同态的新定义,在新定义中简化了原定义中关于同态的限制,作为新定义的应用,给出了判定布尔格之间布尔格同态的判定条件.     

Some mathematical properties of cayley digraphs with applications to interconnection network design

We consider the relationships between Cayley digraphs and their coset graphs with respect to subgroups and obtain some general results on homomorphism and broadcasting between them. We also derive a general factorization theorem on subgraphs of Cayley digraphs by their automorphism groups. We discuss the applications of these results to well-known interconnection networks such as the butterfly network, the de Bruijn network, the cube-connected cycles network and the shuffle-exchange network.     

Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks

Despite numerous interconnection schemes proposed for distributed multicomputing, systematic studies of classes of interprocessor networks, that offer speed-cost tradeoffs over a wide range, have been few and far in between. A notable exception is the study of Cayley graphs that model a wide array of symmetric networks of theoretical and practical interest. Properties established for all, or for certain subclasses of, Cayley graphs are extremely useful in view of their wide applicability. In this paper, we obtain a number of new relationships between Cayley (di)graphs and their subgraphs and coset graphs with respect to subgroups, focusing in particular on homomorphism between them and on relating their internode distances and diameters. We discuss applications of these results to well-known and useful interconnection networks such as hexagonal and honeycomb meshes as well as certain classes of pruned tori.     

软件图语言的若干问题研究

本文从语言学和形式化角度对软件工程中广泛和频繁使用的软件图进行研究，提出了软件图语言这一概念。本文首先提出了关于软件图语言的一组基本概念，研究了软件图语言的同态和同构，以构成软件图形式描述的基础；其次阐述了软件图语言的分类和体式；最后讨论了软件图的优化问题。本文工作可以作为设计软件图编辑器及自动生成工具的基础。     

On the algebraic structure of combinatorial problems

We describe a general algebraic formulation for a wide range of combinatorial problems including

Full-size image

and In this formulation each problem instance is represented by a pair of relational structures, and the solutions to a given instance are homomorphisms between these relational structures. The corresponding decision problem consists of deciding whether or not any such homomorphisms exist. We then demonstrate that the complexity of solving this decision problem is determined in many cases by simple algebraic properties of the relational structures involved. This result is used to identify tractable subproblems of , and to provide a simple test to establish whether a given set of Boolean relations gives rise to one of these tractable subproblems.