Subword balance, position indices and power sums

AbstractIn this paper, we investigate various ways of characterizing words, mainly over a binary alphabet, using information about the positions of occurrences of letters in words. We introduce two new measures associated with words, the position index and sum of position indices. We establish some characterizations, connections with Parikh matrices, and connections with power sums. One particular emphasis concerns the effect of morphisms and iterated morphisms on words

Power Allocation Schemes for Multicell Massive MIMO Systems

This paper investigates the sum-rate gains brought by power allocation strategies in multicell massive multipleinput multiple-output systems, assuming time-division duplex transmission. For both uplink and downlink, we derive tractable expressions for the achievable rate with zero-forcing receivers and precoders respectively. To avoid high complexity joint optimization across the network, we propose a scheduling mechanism for power allocation, where in a single time slot, only cells that do not interfere with each other adjust their transmit powers. Based on this, corresponding transmit power allocation strategies are derived, aimed at maximizing the sum rate per-cell. These schemes are shown to bring considerable gains over equal power allocation for practical antenna configurations (e.g., up to a few hundred). However, with fixed number of users (N), these gains diminish as M turns to infinity, and equal power allocation becomes optimal. A different conclusion is drawn for the case where both M and N grow large together, in which case: (i) improved rates are achieved as M grows with fixed M/N ratio, and (ii) the relative gains over the equal power allocation diminish as M/N grows. Moreover, we also provide applicable values of M/N under an acceptable power allocation gain threshold, which can be used as to determine when the proposed power allocation schemes yield appreciable gains, and when they do not. From the network point of view, the proposed scheduling approach can achieve almost the same performance as the joint power allocation after one scheduling round, with much reduced complexity

Individual Taxpayers Compliance in Policy of Post Tax Amnesty Program: Phenomenology Study

This study aims to assess the compliance of individual taxpayers after the tax amnesty program policy and its benefits for taxpayers are for the State. This research is qualitative research with phenomenology method. Qualitative by exploring the values of the experience of human life, the aim is to discover the essence of the experience. Phenomenology method, namely by looking at phenomena, reality and experience, by digging data to find things that are fundamental and important, so as to obtain a picture of tile directly from people who experience it. The method of data collection used is through interviews. This study uses Theory of Planned Behavior (TPB) to examine the reaction ol taxpayers ajter tax amnesty, and Theory of Compliance (Compliance Theory) to examine taxpayer compliance with the fu?fillment o( the obligation to pay taxes after tax amnesty. The results of this study prove that out of 3 (three) taxpayers as respondents, have responded positively to the tax amnesty policy even though each respondent has diflerent motivations. Respondents became obedient after the tax amnesty program policy because they were aware that the purpose of the tax amnesty is as a government effort to improve economic conditions, development and reduce unemployment, reduce poverty and improve inequality

On Energy Allocation and Data Scheduling in Backscatter Networks with Multi-antenna Readers

In this paper, we study the throughput utility functions in buffer-equipped monostatic backscatter communication networks with multi-antenna Readers. In the considered model, the backscatter nodes (BNs) store the data in their buffers before transmission to the Reader. We investigate three utility functions, namely, the sum, the proportional and the common throughput. We design online admission policies, corresponding to each utility function, to determine how much data can be admitted in the buffers. Moreover, we propose an online data link control policy for jointly controlling the transmit and receive beamforming vectors as well as the reflection coefficients of the BNs. The proposed policies for data admission and data link control jointly optimize the throughput utility, while stabilizing the buffers. We adopt the min-drift-plus-penalty (MDPP) method in designing the control policies. Following the MDPP method, we cast the optimal data link control and the data admission policies as solutions of two independent optimization problems which should be solved in each time slot. The optimization problem corresponding to the data link control is non-convex and does not have a trivial solution. Using Lagrangian dual and quadratic transforms, we find a closed-form iterative solution. Finally, we use the results on the achievable rates of finite blocklength codes to study the system performance in the cases with short packets. As demonstrated, the proposed policies achieve optimal utility and stabilize the data buffers in the BNs

On the Optimality of Power Allocation for NOMA Downlinks with Individual QoS Constraints

This letter investigates a power allocation problem in a downlink single-input single-output non-orthogonal multiple access (NOMA) system. Our goal is to maximize the sum rate of users subject to minimum user rate requirements. We rigorously prove the optimal user decoding order, and show that the sum rate maximization problem is convex, which guarantees the globally optimal solution. Numerical results validate the performance gain by the proposed NOMA compared with conventional schemes

Realizing the potential of distributed energy resources and peer-to-peer trading through consensus-based coordination and cooperative game theory

Driven by environmental and energy security concerns, a large number of small-scale distributed energy resources (DERs) are increasingly being connected to the distribution network. This helps to support a cost-effective transition to a lower-carbon energy system, however, brings coordination challenges caused by variability and uncertainty of renewable energy resources (RES). In this setting, local flexible demand (FD) and energy storage (ES) technologies have attracted great interests due to their potential flexibility in mitigating the generation and demand variability and improving the cost efficiency of low-carbon electricity systems. The combined effect of deregulation and digitalization inspired new ways of exchanging electricity and providing management/services on the paradigm of peer-to-peer (P2P) and transparent transactions. P2P energy trading enables direct energy trading between prosumers, which incentivizes active participation of prosumer in the trading of electricity in the distribution network, in the meantime, the efficient usage of FD and ES owned by the prosumers also facilitates better local power and energy balance. Though the promising P2P energy trading brings numerous advancements, the existing P2P mechanisms either fail to coordinate energy in a fully distributed way or are unable to adequately incentivize prosumers to participate, preventing prosumers from accessing the highest achievable monetary benefits and/or suffering severely from the curse of dimensionality. Therefore, this thesis aims at proposing three P2P energy trading enabling mechanisms in the aspect of fully distributed efficient balanced energy coordination through consensus-based algorithm and two incentivizing pricing and benefit distribution mechanisms through cooperative game theory. Distributed, consensus-based algorithms have emerged as a promising approach for the coordination of DER due to their communication, computation, privacy and reliability advantages over centralized approaches. However, state-of-the-art consensus-based algorithms address the DER coordination problem in independent time periods and therefore are inherently unable to capture the time-coupling operating characteristics of FD and ES resources. This thesis demonstrates that state-of-the-art algorithms fail to converge when these time-coupling characteristics are considered. In order to address this fundamental limitation, a novel consensus-based algorithm is proposed which includes additional consensus variables. These variables express relative maximum power limits imposed on the FD and ES resources which effectively mitigate the concentration of the FD and ES responses at the same time periods and steer the consensual outcome to a feasible and optimal solution. The convergence and optimality of the proposed algorithm are theoretically proven while case studies numerically demonstrate its convergence, optimality, robustness to initialization and information loss, and plug-and-play adaptability. Moreover, this thesis proposes two computationally efficient pricing and benefit distribution mechanisms to construct a stable grand coalition of prosumers participating in P2P trading, founded on cooperative game-theoretic principles. The first one involves a benefit distribution scheme inspired by the core tatonnement process while the second involves a novel pricing mechanism based on the solution of single linear programming. The performance of the proposed mechanisms is validated against state-of-the-art mechanisms through numerous case studies using real-world data. The results demonstrate that the proposed mechanisms exhibit superior computational performance than the nucleolus and are superior to the rest of the examined mechanisms in incentivizing prosumers to remain in the grand coalition.Open Acces

Data-Oblivious Stream Productivity

We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidable, but for restricted formats computable sufficient conditions can be obtained. The usual analysis disregards the identity of data, thus leading to approaches that we call data-oblivious. We present a method that is provably optimal among all such data-oblivious approaches. This means that in order to improve on the algorithm in this paper one has to proceed in a data-aware fashion