检索结果-内蒙古大学图书馆

28th Conference of Spacecraft TT and C Technology in China - Openness, Integration and Intelligent Interconnection

作者： Liu, Youyong Geng, Hujun Guo, Suli Yang, Weijun CETC Res Inst 54 Shijiazhuang 050081 Hebei Peoples R China CETC Key Lab Space Informat Applicat Technol Shijiazhuang 050081 Hebei Peoples R China

ISBN: (纸本)9789811048371;9789811048364

Downlink antenna arraying is an effective method to improve the ground receiving capacity instead of the large-aperture antenna in the future deep space explorations, and that the arraying combining algorithm is the key factor in influencing the system performance. In allusion to the problem of the efficient combination under the lower SNR conditions at a Martian distance, an iterative FX correlation combining algorithm is proposed. The principle and performance of the algorithm are discussed and compared in detail, and the arraying application of the algorithm is presented in the CE mission. Simulation and experiment results intimate that adaptive FX correlation combining algorithm has a better performance than other arraying methods such as FSC and BC, and is acceptable for the arraying combining of the Martian weak received signal. © Tsinghua University Press, Beijing and Springer Nature Singapore Pte Ltd. 2018.

关键词： combining algorithm Downlink antenna arraying FX correlator Martian TT & C and communication

来源：评论

学校读者我要写书评

暂无评论

A Maximum Likelihood combining algorithm for Spatial Multiplexing MIMO Amplify-and-Forward Relaying Systems

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2015年第12期64卷 5767-5774页

作者： Zhang, Kangli Xiong, Chunlin Chen, Bin Wang, Jian Wei, Jibo Natl Univ Def Technol Coll Elect Sci & Engn Changsha 410073 Hunan Peoples R China

Using a spatial multiplexing transmission scheme can improve the data rate in multiple-input-multiple-output (MIMO) relaying systems, while making signal detection more difficult at receivers. Aiming at lowering the computational complexity of the receiver, this paper proposes a maximum likelihood combining (MLC) algorithm for spatial multiplexing MIMO amplify-and-forward (AF) relaying systems in a Rayleigh flat-fading environment, which is implemented before maximum likelihood (ML) detection. The combining signal and equivalent channel are opportunely designed based on the ML rule in the MLC algorithm. We also formulate the diversity gain of the systems that employ the MLC algorithm mathematically, induced by the Chernoff bound of pairwise error probability (PEP). An upper bound on the symbol error probability (SEP) for the MLC algorithm with multiple modulations is also given, based on the derived bound of PEP. Moreover, the complexities of ML receivers adopting the MLC algorithm and the conventional vector combining (VC) algorithm are analyzed. Numerical simulations indicate that systems with the MLC algorithm achieve the same performance while consuming lower computational complexity compared to that with the VC algorithm.

关键词： Amplify and forward (AF) combining algorithm maximum likelihood (ML) detection multiple-input-multiple-output (MIMO) pairwise error probability (PEP) spatial multiplexing

来源：评论

学校读者我要写书评

暂无评论

Formalizing Semantic Differences between combining algorithms in XACML 3.0 Policies

Formalizing Semantic Differences between Combining Algorithm...

引用

IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)

作者： Xu, Dianxiang Zhang, Yunpeng Shen, Ning Boise State Univ Dept Comp Sci Boise ID 83725 USA

ISBN: (纸本)9781467379892

XACML is a standard language for specifying attribute-based access control policies of computer and software systems. It offers a variety of combining algorithms for flexible policy composition. While they are intended to be different, they also bear similarities. Some combining algorithms can be functionally equivalent with respect to the given policy or policies. To correctly use the combining algorithms, it is important to understand the subtle similarities and differences. This paper presents a formal treatment of the semantic differences between the commonly used combining algorithms in XACML 3.0. For each pair of the selected combining algorithms, we identify when they are functionally equivalent and when they are not equivalent. This rigorous understanding helps minimize incorrect uses of combining algorithms that may lead to unauthorized access and denial of service. It also provides a foundation for determining equivalent mutants of combining algorithms in mutation testing of XACML policies.

关键词： Attribute-based access control combining algorithm formal methods mutation testing XACML

来源：评论

学校读者我要写书评

暂无评论

Detecting Incorrect Uses of combining algorithms in XACML 3.0 Policies

引用

INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING 2015年第9-10期25卷 1551-1571页

作者： Xu, Dianxiang Shen, Ning Zhang, Yunpeng Boise State Univ Dept Comp Sci Boise ID 83725 USA Univ Houston Dept Informat & Logist Technol Houston TX 77204 USA

With the increasing complexity of software, new access control methods have emerged to deal with attribute-based authorization. As a standard language for specifying attribute-based access control policies, XACML offers a number of rule and policy combining algorithms to meet different needs of policy composition. Due to their variety and complexity, however, it is not uncommon to apply combining algorithms incorrectly, which can lead to unauthorized access or denial of service. To solve this problem, this paper presents a fault-based testing approach for revealing incorrect combining algorithms in XACML 3.0 policies. The theoretical foundation of this approach relies on the formalization of semantic differences between rule combining algorithms and between policy combining algorithms. It allows the use of a constraint solver for generating queries to which a given policy produces different responses than its combining algorithm-based mutants. Such queries can determine whether or not the given combining algorithm is used correctly. Our empirical studies using various XACML policies have demonstrated that our approach is effective.

关键词： combining algorithm constraint solving fault-based testing XACML

来源：评论

学校读者我要写书评

暂无评论

Application of Coherent Integration and Probability algorithm in Weak Signal Detection 2

Application of Coherent Integration and Probability Algorith...

引用

2nd ETP/IITA Conference on Telecommunication and Information

作者： Sun, Guo Ming Wang, Xin Na Luohe Vocat Technol Coll Luohe City 462002 Henan Province Peoples R China

Weak signal detection is very important for military and civil system. This paper discussed the combining algorithm of coherent integration and probability, the simulation with matlab showed it's advantageous char... 详细信息

ISBN: (纸本)9789881824202

关键词： Signal detection Coherent integration Probability combining algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of Coherent Integration and Probability algorithm in Weak Signal Detection

Application of Coherent Integration and Probability Algorith...

引用

2011 Second ETP/IITA Conference on Telecommunication and Information(TEIN 2011)

作者： Guo ming Sun Xin na Wang Luohe vocational Technology College

关键词： Signal detection Coherent integration Probability combining algorithm

来源：评论

学校读者我要写书评

暂无评论

AN OPTIMAL algorithm FOR COMPUTING CENSUS FUNCTIONS IN MESSAGE-PASSING SYSTEMS

引用

Parallel Processing Letters 1993年第1期3卷 19-23页

作者： AMOTZ BAR-NOY SHLOMO KIPNIS BARUCH SCHIEBER IBM Research Division T.J. Watson Research Center Yorktown Heights NY 10598 USA

We consider a message-passing system of n processors, each of which initially holds one piece of data. The goal is to compute an associative and commutative census function f on the n distributed pieces of data and to make the result known to all processors. To perform the computation, processors communicate with each other by sending and receiving messages in specified communication rounds. We describe an optimal algorithm for this problem that requires the least number of communication rounds and that minimizes the time spent by any processor in sending and receiving messages.

关键词： Census computation census function combining algorithm message-passing system parallel computer

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：