基于AR模型和ZMNL变换的K分布海杂波仿真方法

海杂波统计模型的研究对最优检测算法设计和雷达性能预估有重要作用。文章介绍了一种基于AR模型和ZMNL变换的K分布海杂波仿真方法,结合ACI准则和Yule-Walker方程,利用Levinson-Durbin递推关系式求解AR模型的阶数和参数,将生成的高斯序列通过线性滤波器产生服从K分布的相关序列。仿真结果表明,无论是功率谱还是概率分布都与理想分布相吻合。     

光纤到户（FTTH）的ODN工程设计及测试

文章针对PON系统的基本保护要求,提出了光分路器（OBD）设计原则;采用最坏值法对PON系统最远的用户终端,进行ODN光通道衰减核算;同时,对ODN光缆线路进行分段衰减测试和全程衰减测试,测试结果满足FTTH系统工程规范。根据现场试验的研究和测试结果,规范光纤到户（FTTH）工程系统的规划、设计、施工、监理及竣工验收等工作。     

一种大尺度Gauss模糊的快速采样算法

针对大模板Gauss模糊的传统算法计算复杂度较高的缺点,提出了一种基于快速采样的新算法,将计算复杂度从O(N2)降到O(N)级别.利用极大似然估计理论,对传统Gauss模板和采样模板进行分析,给出了采样算法和传统算法的联系与区别.实验表明,新算法在极大的提高算法的速度的同时,可以将两者之间的能量误差控制在1%左右,当采样点等于10N时,人眼基本无法察觉两种算法的差异.     

负荷功率因数对配电变电站电压稳定性的影响

对配电变电站的电压稳定性原理进行仿真,分析表明,在负荷有功一定的情况下,负荷功率因数的下降对电压稳定性将会产生两个方面的影响:负荷无功-电压特性曲线上升,与之相对应的电网无功-电压特性曲线下降,从而使配电变电站的电压稳定性显著下降。     

能源管理系统实施中供配电系统改造方案

针对钢铁企业能源管理最基本的供配电系统以及供配电系统改造的内容作了较为详细的介绍。根据供配电系统的变电站现场配置情况,提出了供配电系统的3种改造方案,并就每种改造方案在什么情况下采用以及需要注意的事项进行探讨。     

Ultrasound speckle reduction by a SUSAN-controlled anisotropic diffusion method

An ultrasound speckle reduction method is proposed in this paper. The filter, which enhances the power of anisotropic diffusion with the Smallest Univalue Segment Assimilating Nucleus (SUSAN) edge detector, is referred to as the SUSAN-controlled anisotropic diffusion (SUSAN_AD). The SUSAN edge detector finds image features by using local information from a pseudo-global perspective. Thanks to the noise insensitivity and structure preservation properties of SUSAN, a better control can be provided to the subsequent diffusion process. To enhance the adaptability of the SUSAN_AD, the parameters of the SUSAN edge detector are calculated based on the statistics of a fully formed speckle (FFS) region. Different FFS estimation schemes are proposed for envelope-detected speckle images and log-compressed ultrasonic images. Adaptive diffusion threshold estimation and automatic diffusion termination criterion are employed to enhance the robustness of the method. Both synthetic and real ultrasound images are used to evaluate the proposed method. The performance of the SUSAN_AD is compared with four other existing speckle reduction methods. It is shown that the proposed method is superior to other methods in both noise reduction and detail preservation.     

无线专网技术在智能配网中的应用

随着国家智能电网的建设,新一代配网自动化系统处于试点建设阶段。配电自动化和现代通信技术的结合,特别是无线通信技术,包括3G、WiMax、Wi-Fi等新技术,对于配网自动化,智能化的发展有着重要的意义。与传统通信系统的数据传输相比,无线专网具有低成本、高频谱利用率、高可靠性等优点。该文介绍了三种热门无线专网的技术特性并和传统通信方式进行了分析比较。     

Traceable content protection based on chaos and neural networks

In this paper, a media content encryption/decryption algorithm is designed based on a chaos system and neural networks, which generates random sequences with chaos, and encrypts or decrypts media contents with neural networks in a parallel way. In this scheme, different decryption keys can be used to recover the media content into different copies. That is, the decryption operation gets the content containing certain random sequence that can be used as the identification. With respect to this property, the scheme is used for secure content distribution. Taking the audio content for example, it is encrypted by a key at the sender side and decrypted by different keys at the receiver side. The differences between decryption keys lead to different decrypted audio copies. If one customer distributes his copy to other unauthorized customers, the chaotic sequence contained in the copy can tell the illegal customer. The performances, including security, imperceptibility and robustness, are analyzed, and some experimental results are given to show the scheme's practicability.     

Summary queries for frequent itemsets mining

There are many advanced techniques that can efficiently mine frequent itemsets using a minimum-support. However, the question that remains unanswered is whether the minimum-support can really help decision makers to make decisions. In this paper, we study four summary queries for frequent itemsets mining, namely, (1) finding a support-average of itemsets, (2) finding a support-quantile of itemsets, (3) finding the number of itemsets that greater/less than the support-average, i.e., an approximated distribution of itemsets, and (4) finding the relative frequency of an itemset (compared its frequency with that of other itemsets in the same dataset). With these queries, a decision maker will know whether an itemset in question is greater/less than the support-quantile; the distribution of itemsets; and the frequentness of an itemset. Processing these summary queries is challenging, because the minimum-support constraint cannot be used to prune infrequent itemsets. In this paper, we propose several simple yet effective approximation solutions. We conduct extensive experiments for evaluating our strategy, and illustrate that the proposed approaches can well model and capture the statistical parameters (summary queries) of itemsets in a database.     

InfoSigs:一种面向Web对象的细粒度聚类算法

面向Web对象的细粒度聚类已经成为学术界研究的热点.然而现有大多数聚类模型只关注如何对文本内容或文章主题进行聚类,聚类结果粒度较粗,无法满足大规模网络信息检索的质量要求.针对上述挑战,充分挖掘Web文档中词汇间的树状概率层次关系,提出一种以词汇信息分布作为特征标志的聚类算法InfoSigs,实现对Web对象的细粒度聚类.算法构建一个信息传递有向无环图,根据词汇在图中信息分布的集中度赋予其合理的权重,产生更具代表性的特征向量;同时算法提出了一个自适应的记录合并模型,有效提高记录簇中记录间的相似度,减少噪音对合并过程的影响.实验结果表明,InfoSigs算法比传统聚类算法—I-Match和Shingling—在F-Measure值上平均约有21.3%的提高,可以有效地运用到多领域Web对象的聚类问题.