Germination power is one of the basic parameters of rapeseed. It is a decisive factor regarding the suitability of a given batch of material for reproduction. This article attempts to develop a method for determining ...
详细信息
ISBN:
(纸本)9781538619438
Germination power is one of the basic parameters of rapeseed. It is a decisive factor regarding the suitability of a given batch of material for reproduction. This article attempts to develop a method for determining germination power based on the physical parameters of seeds (their elasticity). The main advantage of the proposed method is the short time needed to determine the germination force of seeds.
A comprehensive examination of DMPC theory and its technological applications • A comprehensive examination of DMPC theory and its technological applications from basic through to advanced level • A systematic introdu...
详细信息
ISBN:
(数字)9781118921579
ISBN:
(纸本)9781118921562
A comprehensive examination of DMPC theory and its technological applications • A comprehensive examination of DMPC theory and its technological applications from basic through to advanced level • A systematic introduction to DMPC technology providing classic DMPC coordination strategies, analysis of their performance, and design methods for both unconstraint and constraint systems • Includes the system partition methods, coordination strategies, the performance analysis and how to design stabilized DMPC under different coordination strategies • Presents useful theories and technologies which can be used in many different industrial fields, such as the metallurgical process and high speed transport, helping readers to grasp the procedure of using the DMPC • Reflects the authors’ combined research in the area, providing a wealth of and current and background information
In this paper, we study full-view coverage in camera sensor networks, by exploiting their limited mobility of orientation rotation. We focus on the fairness based coverage maximization problem, i.e., how to schedule t...
详细信息
ISBN:
(纸本)9781509013296
In this paper, we study full-view coverage in camera sensor networks, by exploiting their limited mobility of orientation rotation. We focus on the fairness based coverage maximization problem, i.e., how to schedule the orientations of the camera sensors to maximize the minimum accumulated full-view coverage time of target points. To solve this problem, we first try to reduce the space dimension of orientation search by dividing the orientation space into a set of discrete regions. We select the minimum number of sensing regions that camera sensors should rotate to in order to ensure the full-view coverage of all target points. Next, we attempt to understand the relationship of full-view coverage among the target points, which are spatially coupled. Based on results in these two steps, we devise an algorithm to solve the problem based on "largest demand first serve" principle. We provide extensive simulations to demonstrate the desired performance of the proposed algorithms.
The Dijkstra algorithm (DA) is a kind of tree search algorithm. The biggest advantage is that it has the smallest number of visited nodes among all optimal tree search algorithms. But stack sizes required by the DA ar...
详细信息
ISBN:
(纸本)9781467361866
The Dijkstra algorithm (DA) is a kind of tree search algorithm. The biggest advantage is that it has the smallest number of visited nodes among all optimal tree search algorithms. But stack sizes required by the DA are always too large to achieve. By partitioning the searching tree into blocks, two modified algorithms are proposed in this article to shrink stack sizes. One, serial block partitioned DA, searches blocks one by one. Another, parallel block partitioned DA, searches blocks at the same time. Radii, which are updated when one block search is finished, are set to cut nodes with metrics larger than them in both algorithms. Simulation results show that the visited nodes number of serial block partitioned DA increase is very limited while the stack size is reduced exponentially. It also shows that stack sizes of the parallel block partitioned DA are reduced exponentially and the processing time is reduced efficiently. The performance of proposed algorithms is kept optimal in both proposed algorithms.
This paper focuses on the transceiver design for multiple-input-multiple-output (MIMO) interference channel. The optimization objective is to minimize the maximum perstream mean square error (MSE) which greatly influe...
详细信息
ISBN:
(纸本)9781479913510
This paper focuses on the transceiver design for multiple-input-multiple-output (MIMO) interference channel. The optimization objective is to minimize the maximum perstream mean square error (MSE) which greatly influences the bit error rate (BER) performance. Considering the imperfect channel state information (CSI) in reality, we propose two robust algorithms based on statistical and bounded CSI error models, respectively. For statistical CSI error model, the maximum average per-stream MSE is minimized while the worst-case perstream MSE is optimized for bounded CSI error model. We utilize an alternate optimization approach to iteratively update the precoding and receiving matrices since the robust min-max per-stream MSE problems are not jointly convex. The objective is monotonically decreased and lower bounded, so the convergence of the algorithms is guaranteed. The improved performance and robustness of the proposed algorithms are verified by simulations.
暂无评论