The character and the wave front set correspondence in the stable range

We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range.     

On generalized perfect difference sets constructed from Sidon sets

Let $\mathbb{N}$ be the set of positive integers. For a nonempty set A of integers and every integer u, denote by $d_A(u)$ the number of $(a,a^{\prime })$ with $a,a^{\prime }\in A$ such that $u=a-a^{\prime }$. For a sequence S of positive integers, let $S(x)$ be the counting function of S. The set $A\subseteq \mathbb{N}$ is called a perfect difference set if $d_A(u)=1$ for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let $f:\mathbb{N}\to \mathbb{N}$ be an increasing function satisfying $f(n)\ge 2$ for any positive integer n, then for every Sidon set B and every function $\omega (x)\to \infty$, there exists a set $A\subseteq \mathbb{N}$ such that $d_A(u)=f(u)$ for every positive integer u and $B(x/3)-\omega (x)\le A(x)\le B(x/3)+\omega (x)$ for all $x\ge C_{f,B,\omega }$.     

基于串联两阶段网络DEA模型的供应链规模收益分析

数据包络分析(DEA)是评价供应链系统(Supply chain system)间相对有效性的一种重要的工具,但是传统的DEA不考虑供应链的内部结构,对系统效率评价偏高;而本文所研究两阶段串联供应链系统,考虑把部分中间产品作为最终产品输出,增加额外中间投入的情形.基于所提出的供应链系统结构,本文建立相应的串联结构下的网络DEA模型,并针对所建立模型进行相关理论的研究,给出了串联结构下的生产可能集和规模收益情况判定方法.最后,进行数值实验,以验证我们提出的结论.     

基于三相幅度测量的相控阵天线快速校准方法

提出了一种基于三相幅度测量的相控阵天线快速校准方法。该方法将天线阵列进行分组,利用每种分组在三种配相下的阵面合成场幅度测量值,可解算出各个天线单元的初始幅相值。该方法仅需幅度测量,避免了相位测量误差影响单元幅相值的计算精度,而且所需幅度测量次数仅为(2N+1)次,可显著提高校准时效性。另外,利用分组思想,同时改变多个单元相位,使总辐射场的幅度变化显著,提升校准准确性。仿真结果表明:校准后相位均方根误差为2.2°,幅度均方根误差为0.2 dB。     

Definition and detection of data-based uniqueness in evaluating bilinear (two-way) chemical measurements

Multivariate curve resolution methods, frequently used in analyzing bilinear data sets, result in ambiguous decomposition in general. Implementing the adequate constraints may lead to reduce the so-called rotational ambiguity drastically, and in the most favorable cases to the unique solution. However, in some special cases, non-negativity constraint as minimal information of the system is a sufficient condition to resolve profiles uniquely. Although, several studies on exploring the uniqueness of the bilinear non-negatively constrained multivariate curve resolution methods have been made in the literature, it has still remained a mysterious question. In 1995, Manne published his profile-based theorems giving the necessary and sufficient conditions of the unique resolution. In this study, a new term, i.e., data-based uniqueness is defined and investigated in details, and a general procedure is suggested for detection of uniquely recovered profile(s) on the basis of data set structure in the abstract space. Close inspection of Borgen plots of these data sets leads to realize the comprehensive information of local rank, and these argumentations furnish a basis for data-based uniqueness theorem. The reported phenomenon and its exploration is a new stage (it can be said fundament) in understanding and describing the bilinear (matrix-type) chemical data in general.     

基于粗糙集信息观的决策表属性约简方法

粗糙集理论是近年来发展起来的一种有效的处理不精确、不确定、含糊信息的数学理论方法，它被广泛应用于相容和不相容决策表的属性约简和核属性计算。利用反例指出目前基于粗糙集信息观[2、6]的决策表属性约简和核属性计算方法的局限性。对决策表的性质作了深入的研究，研究发现文献[2、6]方法的不足原因是：它们没有考虑U／ind（C）中等价类的相客性。给出了基于U／ind（C）中等价类相客性的属性约简定义和核属性定义，并给出了一种新的基于粗糙集信息观的决策表属性约简和核属性计算方法。讨论了该方法同文献[2、6]方法的区别。最后用相同实例验证了该方法的有效性。     

在线multicast数据传输网络中的一个优化问题

首先建立了数据传输网络选择的最小成本模型，给出了有效支撑树代表集的概念，并给出了一个时间复杂性为D(mlogen)的算法产生代表集。然后对静态数据传输问题和在线数据传输问题，分别给出了一个时间复杂性为D(mlogen)和O(m^2 mlogen)的多项式时间的算法。     

协同作战能力简析

协同作战能力(CEC)是一种充分利用网络技术的新型海岸防空技术，给系统的作战能力带来了革命性的交破。本文对协同作战能力的产生、功能、组成以及未来的发展趋势作了详细的介绍，阐述了CEC系统的总体设计思想。在此基础上，将CEC系统与传统的作战系统的性能和设计思想在各方面进行了比较，交出了CEC系统各方面的优越性能。协同作战能力是现代和未来作战系统的发展方向，CEC系统的发展必将成为衡量各国国防科技现代化的重要指标。