This paper proposes an extra gradient Anderson-accelerated algorithm for solving pseudomonotone variational inequalities, which uses the extra gradient scheme with line search to guarantee the global convergence and A...
详细信息
We generalize the problem of online submodular welfare maximization to incorporate various stochastic elements that have gained significant attention in recent years. We show that a non-adaptive Greedy algorithm, whic...
详细信息
The Bitcoin blockchain is a secure, distributed ledger that enables trusted transactions across untrusted entities. However, many applications need much faster transaction confirmation than that of the current Bitcoin...
详细信息
The Bitcoin blockchain is a secure, distributed ledger that enables trusted transactions across untrusted entities. However, many applications need much faster transaction confirmation than that of the current Bitcoin blockchain. In this paper, we present a high-throughput, low-latency, deterministic confirmation mechanism called ACCEL for accelerating Bitcoin's block confirmation mechanism. Our key idea for achieving faster confirmation is the quick identification of singular blocks that provably belong to the blockchain. While it is impossible to determine with certainty if a block belongs to a blockchain when network delays are unbounded, singular block detection exploits the fact that the end-to-end latency between Bitcoin miners is substantially lower than the inter-block spacing and can be assumed to be upper bounded. ACCEL is especially suitable for low-latency, permissioned blockchains, where the block spacing can be optimized to the blockchain's small latencies to greatly improve throughput. We evaluate ACCEL's performance with extensive simulations and with a real implementation built with minimal changes to and fully compatible with the Bitcoin blockchain. We show that with appropriate bounds on the end-to-end latency, it is possible to reduce transaction confirmation latencies to milliseconds with ACCEL, and so meet the performance needs of a wide range of applications.
In this paper, we consider the problem of optimally coordinating the response of a set of distributed energy resources (DERs) for serving the needs of a set of electrical loads while protecting the privacy of consumer...
详细信息
ISBN:
(数字)9781728174471
ISBN:
(纸本)9781728174488
In this paper, we consider the problem of optimally coordinating the response of a set of distributed energy resources (DERs) for serving the needs of a set of electrical loads while protecting the privacy of consumer usage data. The DERs are coordinated via a distributed approach that relies on an averaging step for guiding DERs towards the optimal operating point. Since naive exchanges of information during the averaging step might reveal sensitive information about personal energy consumption, we incorporate homomorphic encryption into the averaging step to enforce electricity usage privacy. To carry out such a procedure, power consumption data collected at electrical loads are first quantized and encrypted using the Paillier homomorphic cryptosystem. The averaging step is then executed using the homomorphically encrypted version of the so-called ratio consensus algorithm that operates exclusively on integer values. We further analytically show that the use of homomorphic encryption does not significantly affect the performance of the distributed scheme, and prove that the resulting homomorphically encrypted distributed algorithm achieves geometric convergence speed over directed communication graphs with packet losses. We showcase the proposed algorithm using the standard IEEE 14-bus test system.
In recent years, the blockchain that is the basis of Bitcoin has received much attention. However, the blockchain also faces many challenges, such as security and scalability, which have been the subject of recent res...
详细信息
In recent years, the blockchain that is the basis of Bitcoin has received much attention. However, the blockchain also faces many challenges, such as security and scalability, which have been the subject of recent researches. Much work has been done to solve the scalability problem in blockchain; one of these methods is sharding. This method is based on dividing the network into different groups and validating transactions in parallel. These methods use traditional consensus algorithms. One of the problems in this regard is the incentive that should be provided for nodes to participate in these consensus algorithms. In this paper, Repchain, one of the existing methods in this field, is examined, and the problems that this method has is analyzed. Next, it is proved that the proposed method causes the network nodes not to follow the protocol and also causes collusion between network nodes.
We present a simple (1 + Ε)∆-edge-coloring algorithm for graphs of maximum degree ∆ = Ω(log n/Ε) with running time O (m log3 n/Ε3). Our algorithm improves upon that of [Duan, He, and Zhang;SODA19], which was the fi...
详细信息
Sensitivity measures how much the output of an algorithm changes, in terms of Hamming distance, when part of the input is modified. While approximation algorithms with low sensitivity have been developed for many prob...
详细信息
Previous papers give accounts of quests for satisfactory formalizations of the classical informal notion of an algorithm and the contemporary informal notion of an interactive algoritm. In this paper, an attempt is ma...
详细信息
This paper presents novel blockchain based resource tokenization method to crowdfund wireless network deployment. Crowdfunding is a method of financing certain projects with the funds collected from individuals. The m...
详细信息
ISBN:
(纸本)9781665443999;9781665444002
This paper presents novel blockchain based resource tokenization method to crowdfund wireless network deployment. Crowdfunding is a method of financing certain projects with the funds collected from individuals. The method presented in this paper finances the wireless network deployment projects by tokenizing proposed novel wireless resource units, and selling these units to investors. A new Data Tonnage Unit Per User (DTUPU) resource unit is introduced with a new pricing scheme depending on a load of a base station. A novel Proof of Load (PoLO) consensus algorithm is proposed which is used to verify load of a base station. Traffic Diversity Factor (TDF) and User Difference Factor (UDF) are proposed to determine the value of a base station and a cluster of base stations.
This article introduces a quick and simple combinatorial approximation algorithm for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of verti...
详细信息
暂无评论