期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Periodic performance of the chaotic spread spectrum sequence on finite precision 被引量:3
1
作者 Zhu Canyan Zhang Lihua +2 位作者 Wang Yiming Liu Jiasheng Mao Lingfeng 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第4期672-678,共7页
It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attenti... It is well known that the periodic performance of spread spectrum sequence heavily affects the correlative and secure characteristics of communication systems. The chaotic binary sequence is paid more and more attention since it is one kind of applicable spread spectrum sequences. However, there are unavoidable short cyclic problems for chaotic binary sequences in finite precision. The chaotic binary sequence generating methods are studied first. Then the short cyclic behavior of the chaotic sequences is analyzed in detail, which are generated by quantification approaches with finite word-length. At the same time, a chaotic similar function is defined for presenting the cyclic characteristics of the sequences. Based on these efforts, an improved method with scrambling control for generating chaotic binary sequences is proposed. To quantitatively describe the improvement of periodic performance of the sequences, an orthogonal estimator is also defined. Some simulating results are provided. From the theoretical deduction and the experimental results, it is concluded that the proposed method can effectively increase the period and raise the complexity of the chaotic sequences to some extent. 展开更多
关键词 chaotic binary sequence finite precision periodic performance orthogonal estimator
在线阅读 下载PDF
Dynamic weighted voting for multiple classifier fusion:a generalized rough set method 被引量:9
2
作者 Sun Liang Han Chongzhao 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第3期487-494,共8页
To improve the performance of multiple classifier system, a knowledge discovery based dynamic weighted voting (KD-DWV) is proposed based on knowledge discovery. In the method, all base classifiers may be allowed to ... To improve the performance of multiple classifier system, a knowledge discovery based dynamic weighted voting (KD-DWV) is proposed based on knowledge discovery. In the method, all base classifiers may be allowed to operate in different measurement/feature spaces to make the most of diverse classification information. The weights assigned to each output of a base classifier are estimated by the separability of training sample sets in relevant feature space. For this purpose, some decision tables (DTs) are established in terms of the diverse feature sets. And then the uncertainty measures of the separability are induced, in the form of mass functions in Dempster-Shafer theory (DST), from each DTs based on generalized rough set model. From the mass functions, all the weights are calculated by a modified heuristic fusion function and assigned dynamically to each classifier varying with its output. The comparison experiment is performed on the hyperspectral remote sensing images. And the experimental results show that the performance of the classification can be improved by using the proposed method compared with the plurality voting (PV). 展开更多
关键词 multiple classifier fusion dynamic weighted voting generalized rough set hyperspectral.
在线阅读 下载PDF
Online blind source separation based on joint diagonalization 被引量:2
3
作者 Li Ronghua Zhou Guoxu Yang Zuyuan Xie Shengli 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2009年第2期229-233,共5页
A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, ... A new algorithm is proposed for joint diagonalization. With a modified objective function, the new algorithm not only excludes trivial and unbalanced solutions successfully, but is also easily optimized. In addition, with the new objective function, the proposed algorithm can work well in online blind source separation (BSS) for the first time, although this family of algorithms is always thought to be valid only in batch-mode BSS by far. Simulations show that it is a very competitive joint diagonalization algorithm. 展开更多
关键词 blind source separation joint diagonalization nonconvex optimization
在线阅读 下载PDF
Link reliability based hybrid routing for tactical mobile ad hoc network 被引量:2
4
作者 Xie Xiaochuan Wei Gang +2 位作者 Wu Keping Wang Gang Jia Shilou 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2008年第2期259-267,共9页
Tactical mobile ad hoc network (MANET) is a collection of mobile nodes forming a temporary network, without the aid of pre-established network infrastructure. The routing protocol has a crucial impact on the network... Tactical mobile ad hoc network (MANET) is a collection of mobile nodes forming a temporary network, without the aid of pre-established network infrastructure. The routing protocol has a crucial impact on the network performance in battlefields. Link reliability based hybrid routing (LRHR) is proposed, which is a novel hybrid routing protocol, for tactical MANET. Contrary to the traditional single path routing strategy, multiple paths are established between a pair of source-destination nodes. In the hybrid routing strategy, the rate of topological change provides a natural mechanism for switching dynamically between table-driven and on-demand routing. The simulation results indicate that the performances of the protocol in packet delivery ratio, routing overhead, and average end-to-end delay are better than the conventional routing protocol. 展开更多
关键词 tactical mobile ad hoc networks hybrid routing link reliability edge weight.
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部