Potential of Transformations in Polycode Internet Meme Within the Event-Related Context of 2020

The article deals with a specific polycode text that functions in the field of virtual communication – Internet meme. The focus is on its regular transformations. Considering possible methodological approaches to the analysis of this phenomenon, the author comes to the conclusion about the efficiency of using the methodology of intertext linguistic theory. The essential characteristic of a meme is its transformational potential, which allows to create new meanings and use this communication unit in a wide range of relevant contexts. The polycode structure of a meme determines the spectrum of its potential transformations by changing the verbal and visual elements. The material of observations was one of the most popular memes of 2020 – "Get up, Natasha, we dropped everything". The author identifies 8 meme transformations, which can be considered as regular: development of the visuals with the addition of a verbal element; contraction of the visuals with the same verbal element / transformation of the verbal element; the reframing of the context; pragmatic transformation; intertextual transformation, including the effect of meta-communication; reduction of the image with the same visual markers; reframing with the change of verbal and visual elements; adaptation of the meme in the media texts. The latter transformation indicates the successful inclusion of the Internet meme as a communication element of network coverse in modern discursive practices.

Distributed Computing Column 81

Overview. In this edition of the column, we have an exciting contribution from Shir Cohen, Idit Keidar, and Oded Naor (Technion), who provide an in-depth perspective on communication-efficient Byzantine Agreement. With the huge popularity of blockchains, the classic area of Byzantine Agreement has seen a surge of interest, and, given the large-scale and widely-distributed deployments of such mechanisms, communication efficiency is a chief concern. This column provides a gentle introduction to the area, by rst the early work in the 80s. This provides the necessary context for the recent exciting work on communication reduction, from the King & Saia algorithm to Algorand. One very useful feature in this column's contribution is the fact that it provides a uni ed view of these results, along with the mathematical background to understand and di erentiate the underlying results. Many thanks to Shir, Idit and Oded for their contribution!

Adaptive Droop Gain-Based Event-Triggered Consensus Reactive Power Sharing in Microgrids

This paper proposes an adaptive droop gain-based consensus approach for reactive power sharing in microgrids (MGs) with the event triggered communication protocol (ETCP). A multi-agent system-based network is constructed to establish the communication with distributed generators (DGs) in MGs. An ETCP is proposed to reduce the communication among agents to save resources and improve system reliability, as the communication is only needed when the event triggered condition is fulfilled. A stability analysis is conducted to guarantee the existence of the equilibrium point and the freeness of the Zeno solution. Moreover, an adaptive droop gain is designed to reduce the impact of imbalanced feeder impedances. Four case studies are conducted to verify the effectiveness and performance of the proposed method. The simulation results show that the ETCP-based approach is capable of achieving power sharing consensus, communication reduction and shifting the information exchange mode based on the operation scenarios.