A framework for the construction of generative models for mesoscale structure in multilayer networks

Multilayer networks allow one to represent diverse and coupled connectivity patterns—such as time-dependence, multiple subsystems, or both—that arise in many applications and which are difficult or awkward to incorporate into standard network representations. In the study of multilayer networks, it is important to investigate mesoscale (i.e., intermediate-scale) structures, such as dense sets of nodes known as communities, to discover network features that are not apparent at the microscale or the macroscale. The ill-defined nature of mesoscale structure and its ubiquity in empirical networks make it crucial to develop generative models that can produce the features that one encounters in empirical networks. Key purposes of such models include generating synthetic networks with empirical properties of interest, benchmarking mesoscale-detection methods and algorithms, and inferring structure in empirical multilayer networks. In this paper, we introduce a framework for the construction of generative models for mesoscale structures in multilayer networks. Our framework provides a standardized set of generative models, together with an associated set of principles from which they are derived, for studies of mesoscale structures in multilayer networks. It unifies and generalizes many existing models for mesoscale structures in fully ordered (e.g., temporal) and unordered (e.g., multiplex) multilayer networks. One can also use it to construct generative models for mesoscale structures in partially ordered multilayer networks (e.g., networks that are both temporal and multiplex). Our framework has the ability to produce many features of empirical multilayer networks, and it explicitly incorporates a user-specified dependency structure between layers. We discuss the parameters and properties of our framework, and we illustrate examples of its use with benchmark models for community-detection methods and algorithms in multilayer networks

Inhibitive Action of Artemisia Plant Extract on the Copper Corrosion in Phosphoric Acid.

Effect of Artemisia plant Extract (APE) on the copper corrosion as a corrosion inhibitor in an aerated acidic solution of in 2M H3PO4 containing 3.10-1 M NaCl has been investigated using gravimetric and electrochemical techniques. A significant decrease in the corrosion rate of copper was observed in the presence of the Artemisia plant extract. The potentiodynamic polarization data indicated that the inhibitor was of mixed type. Impedance measurements showed that the charge transfer resistance increased and double layer capacitance decreased with increase in the inhibitor’s concentration. Also, some thermodynamic data for the activation are calculated and discussed. The results obtained from potentiodynamic polarization, impedance measurements and gravimetric method are in good agreement

Analysis of incremental augmented affine projection algorithm for distributed estimation of complex-valued signals

This paper considers the problem of distributed estimation in an incremental network when the measurements taken by the node follow a widely linear model. The proposed algorithm which we refer to it as incremental augmented affine projection algorithm (incAAPA) utilizes the full second order statistical information in the complex domain. Moreover, it exploits spatio-temporal diversity to improve the estimation performance. We derive steady-state performance metric of the incAAPA in terms of the mean-square deviation (MSD). We further derive sufficient conditions to ensure mean-square convergence. Our analysis illustrate that the proposed algorithm is able to process both second order circular (proper) and noncircular (improper) signals. The validity of the theoretical results and the good performance of the proposed algorithm are demonstrated by several computer simulations

A Methodology for Abstracting the Physical Layer of Direct V2X Communications Technologies

Recent advancements in vehicle-to-everything (V2X) communications have greatly increased the flexibility of the physical (PHY) and medium access control (MAC) layers. This increases the complexity when investigating the system from a network perspective to evaluate the performance of the supported applications. Such flexibility, in fact, needs to be taken into account through a cross-layer approach, which might lead to challenging evaluation processes. As an accurate simulation of the signals appears unfeasible, a typical solution is to rely on simple models for incorporating the PHY layer of the supported technologies based on off-line measurements or accurate link-level simulations. Such data are, however, limited to a subset of possible configurations, and extending them to others is costly when not even impossible. The goal of this paper is to develop a new approach for modeling the PHY layer of V2X communications that can be extended to a wide range of configurations without leading to extensive measurement or simulation campaigns at the link layer. In particular, given a scenario and starting from results in terms of the packet error rate (PER) vs. signal-to-interference-plus-noise ratio (SINR) related to a subset of possible configurations, we first approximated the curves with step functions characterized by a given SINR threshold, and we then derived one parameter, called implementation loss, that was used to obtain the SINR threshold and evaluate the network performance under any configuration in the same scenario. The proposed methodology, leading to a good trade-off among the complexity, generality, and accuracy of the performance evaluation process, was validated through extensive simulations with both IEEE 802.11p and LTE-V2X sidelink technologies in various scenarios. The results first show that the curves can be effectively approximated by using an SINR threshold, with a value corresponding to 0.5 PER, and then demonstrate that the network-level outputs derived from the proposed approach are very close to those obtained with complete curves, despite not being restricted to a few possible configurations

Trajectories and resource management of flying base stations for C-V2X

In a vehicular scenario where the penetration of cars equipped with wireless communication devices is far from 100% and application requirements tend to be challenging for a cellular network not specifically planned for it, the use of unmanned aerial vehicles (UAVs), carrying mobile base stations, becomes an interesting option. In this article, we consider a cellular-vehicle-to-anything (C-V2X) application and we propose the integration of an aerial and a terrestrial component of the network, to fill the potential unavailability of short-range connections among vehicles and address unpredictable traffic distribution in space and time. In particular, we envision a UAV with C-V2X equipment providing service for the extended sensing application, and we propose a UAV trajectory design accounting for the radio resource (RR) assignment. The system is tested considering a realistic scenario by varying the RRs availability and the number of active vehicles. Simulations show the results in terms of gain in throughput and percentage of served users, with respect to the case in which the UAV is not present

Tracking analysis of minimum kernel risk-sensitive loss algorithm under general non-Gaussian noise

In this paper the steady-state tracking performance of minimum kernel risk-sensitive loss (MKRSL) in a non-stationary environment is analyzed. In order to model a non-stationary environment, a first-order random-walk model is used to describe the variations of optimum weight vector over time. Moreover, the measurement noise is considered to have non-Gaussian distribution. The energy conservation relation is utilized to extract an approximate closed-form expression for the steady-state excess mean square error (EMSE). Our analysis shows that unlike for the stationary case, the EMSE curve is not an increasing function of step-size parameter. Hence, the optimum step-size which minimizes the EMSE is derived. We also discuss that our approach can be used to extract steady-state EMSE for a general class of adaptive filters. The simulation results with different noise distributions support the theoretical derivations

On the Minimum Degree up to Local Complementation: Bounds and Complexity

The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error correcting codes. First, we show that the local minimum degree of the Paley graph of order p is greater than sqrt{p} - 3/2, which is, up to our knowledge, the highest known bound on an explicit family of graphs. Probabilistic methods allows us to derive the existence of an infinite number of graphs whose local minimum degree is linear in their order with constant 0.189 for graphs in general and 0.110 for bipartite graphs. As regards the computational complexity of the decision problem associated with the local minimum degree, we show that it is NP-complete and that there exists no k-approximation algorithm for this problem for any constant k unless P = NP.Comment: 11 page

A robust scalable demand-side management based on diffusion-ADMM strategy for smart grid

Demand-side management (DSM) involves a group of programs, initiatives, and technologies designed to encourage consumers to modify their level and pattern of electricity usage. This is performed following methods such as financial incentives and behavioral change through education. While the objective of the DSM is to achieve a balance between energy production and demand, effective and efficient implementation of the program rests within effective use of emerging Internet of things (IoT) concept for online interactions. Here, a novel DSM framework based on diffusion and alternating direction method of multipliers (ADMM) strategies, repeated under a model predictive control (MPC) protocol, is proposed. On the demand side, the customers autonomously and by cooperation with their immediate neighbors estimate the baseline price in real time. Based on the estimated price signal, the customers schedule their energy consumption using the ADMM cost-sharing strategy to minimize their incommodity level. On the supply side, the utility company determines the price parameters based on the customers real-time behavior to make a profit and prevent the infrastructure overload. The proposed mechanism is capable of tracking drifts in the optimal solution resulting from the changes in supply/demand sides. Moreover, it considers all classes of appliances by formulating the DSM problem as a mixed-integer programming (MIP) problem. Numerical examples are provided to show the effectiveness of the proposed framework

Variants of partial update augmented CLMS algorithm and their performance analysis

Naturally complex-valued information or those presented in complex domain are effectively processed by an augmented complex least-mean-square (ACLMS) algorithm. In some applications, the ACLMS algorithm may be too computationally and memory-intensive to implement. In this paper, a new algorithm, termed partial-update ACLMS (PU-ACLMS) algorithm is proposed, where only a fraction of the coefficient set is selected to update at each iteration. Doing so, two types of partial update schemes are presented referred to as the sequential and stochastic partial-updates, to reduce computational load and power consumption in the corresponding adaptive filter. The computational cost for full-update PU-ACLMS and its partial update implementations are discussed. Next, the steady-state mean and mean-square performance of PU-ACLMS for noncircular complex signals are analyzed and closed-form expressions of the steady-state excess mean-square error (EMSE) and mean-square deviation (MSD) are given. Then, employing the weighted energy-conservation relation, the EMSE and MSD learning curves are derived. The simulation results are verified and compared with those of theoretical predictions through numerical examples

Analysis of Co-Channel Coexistence Mitigation Methods Applied to IEEE 802.11p and 5G NR-V2X Sidelink

Direct communication between vehicles and surrounding objects, called vehicle-to-everything (V2X), is ready for the market and promises to raise the level of safety and comfort while driving. To this aim, specific bands have been reserved in some countries worldwide and different wireless technologies have been developed; however, these are not interoperable. Recently, the issue of co-channel coexistence has been raised, leading the European Telecommunications Standards Institute (ETSI) to propose a number of solutions, called mitigation methods, for the coexistence of the IEEE 802.11p based ITS-G5 and the 3GPP fourth generation (4G) long term evolution (LTE)-V2X sidelink. In this work, several of the envisioned alternatives are investigated when adapted to the coexistence of the IEEE 802.11p with its enhancement IEEE 802.11bd and the latest 3GPP standards, i.e., the fifth generation (5G) new radio (NR)-V2X. The results, obtained through an open-source simulator that is shared with the research community for the evaluation of additional proposals, show that the methods called A and C, which require modifications to the standards, improve the transmission range of one or both systems without affecting the other, at least in low-density scenarios