Wireless Sensor Network with a Regular, 3D Rectangular Array Structure
A wireless sensor network with a regular, 3D rectangular array structure is studied. The network consists of between 16 and 512 clusters, with between 1 and 5 intelligent sensors per cluster. Analytical expressions are obtained for the probability of failure-free network operation, polling cycle time, and node efficiency. A cyclic polling pipeline algorithm is examined.
In this work it was explained why the energy balancing in a static wireless sensor networks with autonomous energy sources is actual nowadays. We presented mathematical model of static wireless sensor network which considers external influence. We presented method of energy balancing in a static wireless sensor networks with autonomous energy sources and experimental results which show increasing work efficiency of static WSN with autonomous energy sources by increasing nodes lifetime and decreasing nodes energy consumption.
One of the goals of the first edition of this book back in 2005 was to present a coherent theory for K-Means partitioning and Ward hierarchical clustering. This theory leads to effective data pre-processing options, clustering algorithms and interpretation aids, as well as to firm relations to other areas of data analysis. The goal of this second edition is to consolidate, strengthen and extend this island of understanding in the light of recent developments. Moreover, the material on validation and interpretation of clusters is updated with a system better reflecting the current state of the art and with our recent ``lifting in taxonomies'' approach. The structure of the book has been streamlined by adding two Chapters: ``Similarity Clustering'' and ``Validation and Interpretation'', while removing two chapters: ``Different Clustering Approaches'' and ``General Issues.'' The Chapter on Mathematics of the data recovery approach, in a much extended version, almost doubled in size, now concludes the book. Parts of the removed chapters are integrated within the new structure. The change has added a hundred pages and a couple of dozen examples to the text and, in fact, transformed it into a different species of a book. In the first edition, the book had a Russian doll structure, with a core and a couple of nested shells around. Now it is a linear structure presentation of the data recovery clustering.
In this paper is proposed a method, which helps to increase the energy efficiency of wireless camera sensor networks. The method is based on image recognition on low-power end devices of the system.
This book constitutes the refereed proceedings of the 7th International Workshop on Multiple Access Communications, MACOM 2014, held in Halmstad, Sweden, in August 2014. The 12 full papers presented were carefully reviewed and selected from 22 submissions. They describe the latest advancements in the field of multiple access communications with an emphasis on reliability issues, physical layer techniques, cognitive radio, medium access control protocols, and video coding.
Let G be a semisimple algebraic group whose decomposition into the product of simple components does not contain simple groups of type A, and P⊆G be a parabolic subgroup. Extending the results of Popov , we enumerate all triples (G, P, n) such that (a) there exists an open G-orbit on the multiple flag variety G/P × G/P × . . . × G/P (n factors), (b) the number of G-orbits on the multiple flag variety is finite.
I give the explicit formula for the (set-theoretical) system of Resultants of m+1 homogeneous polynomials in n+1 variables