Convergence Rate Analysis of Distributed Gossip (Linear Parameter) Estimation: Fundamental Limits and Tradeoffs

The paper considers gossip distributed estimation of a (static) distributed random field (a.k.a., large scale unknown parameter vector) observed by sparsely interconnected sensors, each of which only observes a small fraction of the field. We consider linear distributed estimators whose structure combines the information \emph{flow} among sensors (the \emph{consensus} term resulting from the local gossiping exchange among sensors when they are able to communicate) and the information \emph{gathering} measured by the sensors (the \emph{sensing} or \emph{innovations} term.) This leads to mixed time scale algorithms--one time scale associated with the consensus and the other with the innovations. The paper establishes a distributed observability condition (global observability plus mean connectedness) under which the distributed estimates are consistent and asymptotically normal. We introduce the distributed notion equivalent to the (centralized) Fisher information rate, which is a bound on the mean square error reduction rate of any distributed estimator; we show that under the appropriate modeling and structural network communication conditions (gossip protocol) the distributed gossip estimator attains this distributed Fisher information rate, asymptotically achieving the performance of the optimal centralized estimator. Finally, we study the behavior of the distributed gossip estimator when the measurements fade (noise variance grows) with time; in particular, we consider the maximum rate at which the noise variance can grow and still the distributed estimator being consistent, by showing that, as long as the centralized estimator is consistent, the distributed estimator remains consistent.Comment: Submitted for publication, 30 page

Generalized Ordered Propositions Fusion Based on Belief Entropy

A set of ordered propositions describe the different intensities of a characteristic of an object, the intensities increase or decrease gradually. A basic support function is a set of truth-values of ordered propositions, it includes the determinate part and indeterminate part. The indeterminate part of a basic support function indicates uncertainty about all ordered propositions. In this paper, we propose generalized ordered propositions by extending the basic support function for power set of ordered propositions. We also present the entropy which is a measure of uncertainty of a basic support function based on belief entropy. The fusion method of generalized ordered proposition also be presented. The generalized ordered propositions will be degenerated as the classical ordered propositions in that when the truth-values of non-single subsets of ordered propositions are zero. Some numerical examples are used to illustrate the efficiency of generalized ordered propositions and their fusion

Personalized individual semantics in Computing with Words for supporting linguistic Group Decision Making. An Application on Consensus reaching

Yucheng Dong would like to acknowledge the financial support of grants (Nos. 71171160, 71571124) from NSF of China, and a grant (No.xq15b01) from SSEM key research center at Sichuan province. Enrique Herrera-Viedma and Luis Mart´ınez would like to acknowledge the FEDER funds under Grant TIN2013-40658-P and TIN2015-66524-P respectivelyIn group decision making (GDM) dealing with Computing with Words (CW) has been highlighted the importance of the statement, words mean different things for different people, because of its influence in the final decision. Different proposals that either grouping such different meanings (uncertainty) to provide one representation for all people or use multi-granular linguistic term sets with the semantics of each granularity, have been developed and applied in the specialized literature. Despite these models are quite useful they do not model individually yet the different meanings of each person when he/she elicits linguistic information. Hence, in this paper a personalized individual semantics (PIS) model is proposed to personalize individual semantics by means of an interval numerical scale and the 2-tuple linguistic model. Specifically, a consistency-driven optimization-based model to obtain and represent the PIS is introduced. A new CW framework based on the 2-tuple linguistic model is then defined, such a CW framework allows us to deal with PIS to facilitate CW keeping the idea that words mean different things to different people. In order to justify the feasibility and validity of the PIS model, it is applied to solve linguistic GDM problems with a consensus reaching process.National Natural Science Foundation of China 71171160 71571124Sichuan University skqy201606European Union (EU) TIN2013-40658-P TIN2015-66524-

The Pivotal Role of Causality in Local Quantum Physics

In this article an attempt is made to present very recent conceptual and computational developments in QFT as new manifestations of old and well establihed physical principles. The vehicle for converting the quantum-algebraic aspects of local quantum physics into more classical geometric structures is the modular theory of Tomita. As the above named laureate to whom I have dedicated has shown together with his collaborator for the first time in sufficient generality, its use in physics goes through Einstein causality. This line of research recently gained momentum when it was realized that it is not only of structural and conceptual innovative power (see section 4), but also promises to be a new computational road into nonperturbative QFT (section 5) which, picturesquely speaking, enters the subject on the extreme opposite (noncommutative) side.Comment: This is a updated version which has been submitted to Journal of Physics A, tcilatex 62 pages. Adress: Institut fuer Theoretische Physik FU-Berlin, Arnimallee 14, 14195 Berlin presently CBPF, Rua Dr. Xavier Sigaud 150, 22290-180 Rio de Janeiro, Brazi