本文提出了一种基于接收信号强度值(Received Signal Strength Indication,RSSI)的三维加权质心定位方法,并在其中引入通信半径的概念,提出两个不同的算法,同时在算法中加以修正。通过在一定范围的空间区域中的仿真实验表明,本文提出的...本文提出了一种基于接收信号强度值(Received Signal Strength Indication,RSSI)的三维加权质心定位方法,并在其中引入通信半径的概念,提出两个不同的算法,同时在算法中加以修正。通过在一定范围的空间区域中的仿真实验表明,本文提出的算法具有很高的定位精度和广泛的适用范围。展开更多
This paper proposes a decomposition based algo- rithm for revision problems in classical propositional logic. A set of decomposing rules are presented to analyze the satis- fiability of formulas. The satisfiability of...This paper proposes a decomposition based algo- rithm for revision problems in classical propositional logic. A set of decomposing rules are presented to analyze the satis- fiability of formulas. The satisfiability of a formula is equivalent to the satisfiability of a set of literal sets. A decomposing function is constructed to calculate all satisfiable literal sets of a given formula. When expressing the satisfiability of a formula, these literal sets are equivalent to all satisfied models of such formula. A revision algorithm based on this decomposing function is proposed, which can calculate maximal contractions of a given problem. In order to reduce the memory requirement, a filter function is introduced. The improved algorithm has a good performance in both time and space perspectives.展开更多
文摘本文提出了一种基于接收信号强度值(Received Signal Strength Indication,RSSI)的三维加权质心定位方法,并在其中引入通信半径的概念,提出两个不同的算法,同时在算法中加以修正。通过在一定范围的空间区域中的仿真实验表明,本文提出的算法具有很高的定位精度和广泛的适用范围。
基金This work was supported by the State Key Laboratory of Software Develop Environment Supported Project （SKLSDE- 2012ZX-18）, the National Natural Science Foundation of China （Grant No. 912183001） and the National High-Tech Research and Development Program （863） of China （2013AA01A212）.
文摘This paper proposes a decomposition based algo- rithm for revision problems in classical propositional logic. A set of decomposing rules are presented to analyze the satis- fiability of formulas. The satisfiability of a formula is equivalent to the satisfiability of a set of literal sets. A decomposing function is constructed to calculate all satisfiable literal sets of a given formula. When expressing the satisfiability of a formula, these literal sets are equivalent to all satisfied models of such formula. A revision algorithm based on this decomposing function is proposed, which can calculate maximal contractions of a given problem. In order to reduce the memory requirement, a filter function is introduced. The improved algorithm has a good performance in both time and space perspectives.
