In this paper, a V-cycle multigrid method is presented for a Hermite rectangular element. By defining proper mesh-dependent inner product and transfer operator, we obtain its convergence property and the uniform conve...In this paper, a V-cycle multigrid method is presented for a Hermite rectangular element. By defining proper mesh-dependent inner product and transfer operator, we obtain its convergence property and the uniform convergence rate independent of mesh size and level are established.展开更多
For the test of rotation speed of high spinning projectile, the general formula of the motional electromotive force （MEMF） of planar magnetic induction coil （PMIC） is derived in case of 3D rotation in a stable mag...For the test of rotation speed of high spinning projectile, the general formula of the motional electromotive force （MEMF） of planar magnetic induction coil （PMIC） is derived in case of 3D rotation in a stable magnetic field. Under a reasona-ble assumption, the MEMF of PMIC is simplified after the aforementioned general formula is used to calculate high spinning PMIC in the geomagnetic field environment. The determination approach of half-cycle is discussed and the method of rotation speed test is studied, and a test is conducted in the paper. The rotation speed curve obtained by the approach in this paper is consistent with the curve by telemetry.展开更多
Rendezvous is a blind process establishing a communication link on a common channel between a pair of nodes in cognitive radio networks. We propose two guaranteed rendezvous algorithms for cognitive radio networks und...Rendezvous is a blind process establishing a communication link on a common channel between a pair of nodes in cognitive radio networks. We propose two guaranteed rendezvous algorithms for cognitive radio networks under both single-radio and multi-radio scenarios with an asynchronous setting. For single-radio scenario, each cycle length is a prime number associated with a channel hopping sequence.The rendezvous can be guaranteed as long as the IDs of the two nodes are different. For multi-radio scenario, we propose a cycle length and rotation based rendezvous algorithm. Each node generates a channel hopping sequence with only one cycle length. Then these radios of each nodes rotate on the generated sequence with different rotation numbers at each hopping cycle. The rendezvous between two nodes is guaranteed as long as they have different cycle lengths or the same cycle length with different number of rotations. We conduct simulations on three metrics and the results show that the proposed algorithms outperform the existing ones.展开更多
基金Supported by NSF of China(10971203)Supported by the NSF of the education Department of Henan Province (2009A110017)
文摘In this paper, a V-cycle multigrid method is presented for a Hermite rectangular element. By defining proper mesh-dependent inner product and transfer operator, we obtain its convergence property and the uniform convergence rate independent of mesh size and level are established.
基金National Key Lab for Electronic Measurement and Technology,North University of China(No.9140C120401080C12)
文摘For the test of rotation speed of high spinning projectile, the general formula of the motional electromotive force （MEMF） of planar magnetic induction coil （PMIC） is derived in case of 3D rotation in a stable magnetic field. Under a reasona-ble assumption, the MEMF of PMIC is simplified after the aforementioned general formula is used to calculate high spinning PMIC in the geomagnetic field environment. The determination approach of half-cycle is discussed and the method of rotation speed test is studied, and a test is conducted in the paper. The rotation speed curve obtained by the approach in this paper is consistent with the curve by telemetry.
基金supported in part by NSF under the grant CNS-1526152
文摘Rendezvous is a blind process establishing a communication link on a common channel between a pair of nodes in cognitive radio networks. We propose two guaranteed rendezvous algorithms for cognitive radio networks under both single-radio and multi-radio scenarios with an asynchronous setting. For single-radio scenario, each cycle length is a prime number associated with a channel hopping sequence.The rendezvous can be guaranteed as long as the IDs of the two nodes are different. For multi-radio scenario, we propose a cycle length and rotation based rendezvous algorithm. Each node generates a channel hopping sequence with only one cycle length. Then these radios of each nodes rotate on the generated sequence with different rotation numbers at each hopping cycle. The rendezvous between two nodes is guaranteed as long as they have different cycle lengths or the same cycle length with different number of rotations. We conduct simulations on three metrics and the results show that the proposed algorithms outperform the existing ones.
