Wastewater electrolysis cells(WECs)for decentralized wastewater treatment/reuse coupled with H_(2) production can reduce the carbon footprint associated with transportation of water,waste,and energy carrier.This study...Wastewater electrolysis cells(WECs)for decentralized wastewater treatment/reuse coupled with H_(2) production can reduce the carbon footprint associated with transportation of water,waste,and energy carrier.This study reports Ir-doped NiFe_(2)O_(4)(NFI,~5 at%Ir)spinel layer with TiO_(2) overlayer(NFI/TiO_(2)),as a scalable heterojunction anode for direct electrolysis of wastewater with circumneutral pH in a single-compartment cell.In dilute(0.1 M)NaCl solutions,the NFI/TiO_(2) marks superior activity and selectivity for chlorine evolution reaction,outperforming the benchmark IrO_(2).Robust operation in near-neutral pH was confirmed.Electroanalyses including operando X-ray absorption spectroscopy unveiled crucial roles of TiO_(2) which serves both as the primary site for Cl−chemisorption and a protective layer for NFI as an ohmic contact.Galvanostatic electrolysis of NH4+-laden synthetic wastewater demonstrated that NFI/TiO_(2)not only achieves quasi-stoichiometric NH_(4)^(+)-to-N_(2)conversion,but also enhances H_(2)generation efficiency with minimal competing reactions such as reduction of dissolved oxygen and reactive chlorine.The scaled-up WEC with NFI/TiO_(2)was demonstrated for electrolysis of toilet wastewater.展开更多
Energy access remains a critical challenge in rural South Sudan,with communities heavily relying on expensive and unfriendly environmental energy sources such as diesel generators and biomass.This study addresses the ...Energy access remains a critical challenge in rural South Sudan,with communities heavily relying on expensive and unfriendly environmental energy sources such as diesel generators and biomass.This study addresses the predicament by evaluating the feasibility of renewable energy-based decentralized electrification in the selected village ofDoleibHill,UpperNile,South Sudan.Using a demand assessment and theMulti-Tier Framework(MTF)approach,it categorizes households,public facilities,private sector,Non-GovernmentalOrganizations(NGOs)and business energy needs and designs an optimized hybrid energy system incorporating solar Photovoltaic(PV),wind turbines,batteries,and a generator.The proposed system,simulated in Hybrid Optimization Model Electric Renewable(HOMER)Pro,demonstrates strong economic viability,with a present worth of$292,145,an annual worth of$22,854,a return on investment(ROI)of 36.5%,and an internal rate of return(IRR)of 42.1%.The simple payback period is 2.31 years,and the discounted payback period is 2.62 years.The system achieves a levelized cost of energy(LCOE)of$0.276/kWh and significantly reduces dependence on diesel,producing 798,800 kWh annually fromwind energy.This research provides a replicable model for cost-effective,sustainable rural electrification,offering valuable insights for policymakers and energy planners seeking to expand electricity access in off-grid communities.展开更多
Federated Graph Learning (FGL) enables model training without requiring each client to share local graph data, effectively breaking data silos by aggregating the training parameters from each terminal while safeguardi...Federated Graph Learning (FGL) enables model training without requiring each client to share local graph data, effectively breaking data silos by aggregating the training parameters from each terminal while safeguarding data privacy. Traditional FGL relies on a centralized server for model aggregation;however, this central server presents challenges such as a single point of failure and high communication overhead. Additionally, efficiently training a robust personalized local model for each client remains a significant objective in federated graph learning. To address these issues, we propose a decentralized Federated Graph Learning framework with efficient communication, termed Decentralized Federated Graph Learning via Surrogate Model (SD_FGL). In SD_FGL, each client is required to maintain two models: a private model and a surrogate model. The surrogate model is publicly shared and can exchange and update information directly with any client, eliminating the need for a central server and reducing communication overhead. The private model is independently trained by each client, allowing it to calculate similarity with other clients based on local data as well as information shared through the surrogate model. This enables the private model to better adjust its training strategy and selectively update its parameters. Additionally, local differential privacy is incorporated into the surrogate model training process to enhance privacy protection. Testing on three real-world graph datasets demonstrates that the proposed framework improves accuracy while achieving decentralized Federated Graph Learning with lower communication overhead and stronger privacy safeguards.展开更多
In this paper, we study the decentralized federated learning problem, which involves the collaborative training of a global model among multiple devices while ensuring data privacy.In classical federated learning, the...In this paper, we study the decentralized federated learning problem, which involves the collaborative training of a global model among multiple devices while ensuring data privacy.In classical federated learning, the communication channel between the devices poses a potential risk of compromising private information. To reduce the risk of adversary eavesdropping in the communication channel, we propose TRADE(transmit difference weight) concept. This concept replaces the decentralized federated learning algorithm's transmitted weight parameters with differential weight parameters, enhancing the privacy data against eavesdropping. Subsequently, by integrating the TRADE concept with the primal-dual stochastic gradient descent(SGD)algorithm, we propose a decentralized TRADE primal-dual SGD algorithm. We demonstrate that our proposed algorithm's convergence properties are the same as those of the primal-dual SGD algorithm while providing enhanced privacy protection. We validate the algorithm's performance on fault diagnosis task using the Case Western Reserve University dataset, and image classification tasks using the CIFAR-10 and CIFAR-100 datasets,revealing model accuracy comparable to centralized federated learning. Additionally, the experiments confirm the algorithm's privacy protection capability.展开更多
Intensely using online social networks(OSNs)makes users concerned about privacy of data.Given the centralized nature of these platforms,and since each platform has a particular storage mechanism,authentication,and acc...Intensely using online social networks(OSNs)makes users concerned about privacy of data.Given the centralized nature of these platforms,and since each platform has a particular storage mechanism,authentication,and access control,their users do not have the control and the right over their data.Therefore,users cannot easily switch between similar platforms or transfer data from one platform to another.These issues imply,among other things,a threat to privacy since such users depend on the interests of the service provider responsible for administering OSNs.As a strategy for the decentralization of the OSNs and,consequently,as a solution to the privacy problems in these environments,the so-called decentralized online social networks(DOSNs)have emerged.Unlike OSNs,DOSNs are decentralized content management platforms because they do not use centralized service providers.Although DOSNs address some of the privacy issues encountered in OSNs,DOSNs also pose significant challenges to consider,for example,access control to user profile information with high granularity.This work proposes developing an ontological model and a service to support privacy in DOSNs.The model describes the main concepts of privacy access control in DOSNs and their relationships.In addition,the service will consume the model to apply access control according to the policies represented in the model.Our model was evaluated in two phases to verify its compliance with the proposed domain.Finally,we evaluated our service with a performance evaluation,and the results were satisfactory concerning the response time of access control requests.展开更多
Traditional Internet of Things(IoT)architectures that rely on centralized servers for data management and decision-making are vulnerable to security threats and privacy leakage.To address this issue,blockchain has bee...Traditional Internet of Things(IoT)architectures that rely on centralized servers for data management and decision-making are vulnerable to security threats and privacy leakage.To address this issue,blockchain has been advocated for decentralized data management in a tamper-resistance,traceable,and transparent manner.However,a major issue that hinders the integration of blockchain and IoT lies in that,it is rather challenging for resource-constrained IoT devices to perform computation-intensive blockchain consensuses such as Proof-of-Work(PoW).Furthermore,the incentive mechanism of PoW pushes lightweight IoT nodes to aggregate their computing power to increase the possibility of successful block generation.Nevertheless,this eventually leads to the formation of computing power alliances,and significantly compromises the decentralization and security of BlockChain-aided IoT(BC-IoT)networks.To cope with these issues,we propose a lightweight consensus protocol for BC-IoT,called Proof-of-Trusted-Work(PoTW).The goal of the proposed consensus is to disincentivize the centralization of computing power and encourage the independent participation of lightweight IoT nodes in blockchain consensus.First,we put forth an on-chain reputation evaluation rule and a reputation chain for PoTW to enable the verifiability and traceability of nodes’reputations based on their contributions of computing power to the blockchain consensus,and we incorporate the multi-level block generation difficulty as a rewards for nodes to accumulate reputations.Second,we model the block generation process of PoTW and analyze the block throughput using the continuous time Markov chain.Additionally,we define and optimize the relative throughput gain to quantify and maximize the capability of PoTW that suppresses the computing power centralization(i.e.,centralization suppression).Furthermore,we investigate the impact of the computing power of the computing power alliance and the levels of block generation difficulty on the centralization suppression capability of PoTW.Finally,simulation results demonstrate the consistency of the analytical results in terms of block throughput.In particular,the results show that PoTW effectively reduces the block generation proportion of the computing power alliance compared with PoW,while simultaneously improving that of individual lightweight nodes.This indicates that PoTW is capable of suppressing the centralization of computing power to a certain degree.Moreover,as the levels of block generation difficulty in PoTW increase,its centralization suppression capability strengthens.展开更多
The attention is a scarce resource in decentralized autonomous organizations(DAOs),as their self-governance relies heavily on the attention-intensive decision-making process of“proposal and voting”.To prevent the ne...The attention is a scarce resource in decentralized autonomous organizations(DAOs),as their self-governance relies heavily on the attention-intensive decision-making process of“proposal and voting”.To prevent the negative effects of pro-posers’attention-capturing strategies that contribute to the“tragedy of the commons”and ensure an efficient distribution of attention among multiple proposals,it is necessary to establish a market-driven allocation scheme for DAOs’attention.First,the Harberger tax-based attention markets are designed to facilitate its allocation via continuous and automated trading,where the individualized Harberger tax rate(HTR)determined by the pro-posers’reputation is adopted.Then,the Stackelberg game model is formulated in these markets,casting attention to owners in the role of leaders and other competitive proposers as followers.Its equilibrium trading strategies are also discussed to unravel the intricate dynamics of attention pricing.Moreover,utilizing the single-round Stackelberg game as an illustrative example,the existence of Nash equilibrium trading strategies is demonstrated.Finally,the impact of individualized HTR on trading strategies is investigated,and results suggest that it has a negative correlation with leaders’self-accessed prices and ownership duration,but its effect on their revenues varies under different conditions.This study is expected to provide valuable insights into leveraging attention resources to improve DAOs’governance and decision-making process.展开更多
This paper investigates the problem of decentralized multi-robot cooperative localization.This problem involves collaboratively estimating the poses of a group of robots with respect to a common reference coordinate s...This paper investigates the problem of decentralized multi-robot cooperative localization.This problem involves collaboratively estimating the poses of a group of robots with respect to a common reference coordinate system using robot-to-robot relative measurements and intermittent absolute measurements in a distributed manner.To address this problem,we present a decentralized fusion method that enables batch updating to handle relative measurements from multiple robots simultaneously.This method can improve both the accuracy and computational efficiency of cooperative localization.To reduce communication costs and reliance on connectivity,we do not maintain the inter-robot state correlations.Instead,we adopt a covariance intersection(CI)technique to design an upper bound that replaces unknown joint correlations.We propose an optimization method to determine a tight upper bound for the correlations in the joint update.The consistency and convergence of our proposed algorithm is theoretically analyzed.Furthermore,we conduct Monte Carlo numerical simulations and real-world experiments to demonstrate that the proposed method outperforms existing approaches in terms of both accuracy and consistency.展开更多
This paper investigates the anomaly-resistant decentralized state estimation(SE) problem for a class of wide-area power systems which are divided into several non-overlapping areas connected through transmission lines...This paper investigates the anomaly-resistant decentralized state estimation(SE) problem for a class of wide-area power systems which are divided into several non-overlapping areas connected through transmission lines. Two classes of measurements(i.e., local measurements and edge measurements) are obtained, respectively, from the individual area and the transmission lines. A decentralized state estimator, whose performance is resistant against measurement with anomalies, is designed based on the minimum error entropy with fiducial points(MEEF) criterion. Specifically, 1) An augmented model, which incorporates the local prediction and local measurement, is developed by resorting to the unscented transformation approach and the statistical linearization approach;2) Using the augmented model, an MEEF-based cost function is designed that reflects the local prediction errors of the state and the measurement;and 3) The local estimate is first obtained by minimizing the MEEF-based cost function through a fixed-point iteration and then updated by using the edge measuring information. Finally, simulation experiments with three scenarios are carried out on the IEEE 14-bus system to illustrate the validity of the proposed anomaly-resistant decentralized SE scheme.展开更多
Centralized storage and identity identification methods pose many risks,including hacker attacks,data misuse,and single points of failure.Additionally,existing centralized identity management methods face interoperabi...Centralized storage and identity identification methods pose many risks,including hacker attacks,data misuse,and single points of failure.Additionally,existing centralized identity management methods face interoperability issues and rely on a single identity provider,leaving users without control over their identities.Therefore,this paper proposes a mechanism for identity identification and data sharing based on decentralized identifiers.The scheme utilizes blockchain technology to store the identifiers and data hashed on the chain to ensure permanent identity recognition and data integrity.Data is stored on InterPlanetary File System(IPFS)to avoid the risk of single points of failure and to enhance data persistence and availability.At the same time,compliance with World Wide Web Consortium(W3C)standards for decentralized identifiers and verifiable credentials increases the mechanism’s scalability and interoperability.展开更多
The paper addresses the decentralized optimal control and stabilization problems for interconnected systems subject to asymmetric information.Compared with previous work,a closed-loop optimal solution to the control p...The paper addresses the decentralized optimal control and stabilization problems for interconnected systems subject to asymmetric information.Compared with previous work,a closed-loop optimal solution to the control problem and sufficient and necessary conditions for the stabilization problem of the interconnected systems are given for the first time.The main challenge lies in three aspects:Firstly,the asymmetric information results in coupling between control and estimation and failure of the separation principle.Secondly,two extra unknown variables are generated by asymmetric information(different information filtration)when solving forward-backward stochastic difference equations.Thirdly,the existence of additive noise makes the study of mean-square boundedness an obstacle.The adopted technique is proving and assuming the linear form of controllers and establishing the equivalence between the two systems with and without additive noise.A dual-motor parallel drive system is presented to demonstrate the validity of the proposed algorithm.展开更多
This article investigates the issue of finite-time state estimation in coupled neural networks under random mixed cyberattacks,in which the Markov process is used to model the mixed cyberattacks.To optimize the utiliz...This article investigates the issue of finite-time state estimation in coupled neural networks under random mixed cyberattacks,in which the Markov process is used to model the mixed cyberattacks.To optimize the utilization of channel resources,a decentralized event-triggered mechanism is adopted during the information transmission.By establishing the augmentation system and constructing the Lyapunov function,sufficient conditions are obtained for the system to be finite-time bounded and satisfy the H_(∞ )performance index.Then,under these conditions,a suitable state estimator gain is obtained.Finally,the feasibility of the method is verified by a given illustrative example.展开更多
In Decentralized Machine Learning(DML)systems,system participants contribute their resources to assist others in developing machine learning solutions.Identifying malicious contributions in DML systems is challenging,...In Decentralized Machine Learning(DML)systems,system participants contribute their resources to assist others in developing machine learning solutions.Identifying malicious contributions in DML systems is challenging,which has led to the exploration of blockchain technology.Blockchain leverages its transparency and immutability to record the provenance and reliability of training data.However,storing massive datasets or implementing model evaluation processes on smart contracts incurs high computational costs.Additionally,current research on preventing malicious contributions in DML systems primarily focuses on protecting models from being exploited by workers who contribute incorrect or misleading data.However,less attention has been paid to the scenario where malicious requesters intentionally manipulate test data during evaluation to gain an unfair advantage.This paper proposes a transparent and accountable training data sharing method that securely shares data among potentially malicious system participants.First,we introduce a blockchain-based DML system architecture that supports secure training data sharing through the IPFS network.Second,we design a blockchain smart contract to transparently split training datasets into training and test datasets,respectively,without involving system participants.Under the system,transparent and accountable training data sharing can be achieved with attribute-based proxy re-encryption.We demonstrate the security analysis for the system,and conduct experiments on the Ethereum and IPFS platforms to show the feasibility and practicality of the system.展开更多
The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy ...The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy of decentralized SCN algorithms while effectively protecting user privacy. To this end, we propose a decentralized semi-supervised learning algorithm for SCN, called DMT-SCN, which introduces teacher and student models by combining the idea of consistency regularization to improve the response speed of model iterations. In order to reduce the possible negative impact of unsupervised data on the model, we purposely change the way of adding noise to the unlabeled data. Simulation results show that the algorithm can effectively utilize unlabeled data to improve the classification accuracy of SCN training and is robust under different ground simulation environments.展开更多
This study proposes a quote-driven predictive automated market maker(AMM)platform with on-chain custody and settlement functions,alongside off-chain predictive reinforcement learning capabilities,to improve the liquid...This study proposes a quote-driven predictive automated market maker(AMM)platform with on-chain custody and settlement functions,alongside off-chain predictive reinforcement learning capabilities,to improve the liquidity provision of real-world AMMs.The proposed architecture augments Uniswap V3,a cryptocurrency AMM protocol,by using a novel market equilibrium pricing to reduce divergence and slippage losses.Furthermore,the proposed architecture involves a predictive AMM capability,for which a deep hybrid long short-term memory(LSTM)and Q-learning reinforcement learning framework is used.It seeks to improve market efficiency through obtaining more accurate forecasts of liquidity concentration ranges,where liquidity starts moving to expected concentration ranges prior to asset price movement;thus,liquidity utilization is improved.The augmented protocol framework is expected to have practical real-world implications through(1)reducing divergence loss for liquidity providers;(2)reducing slippage for crypto-asset traders;and(3)improving capital efficiency for liquidity provision for the AMM protocol.The proposed architecture is empirically benchmarked against the well-established Uniswap V3 AMM architecture.The preliminary findings indicate that the novel AMM framework offers enhanced capital efficiency,reduced divergence loss,and diminished slippage,which could potentially address several of the challenges inherent to AMMs.展开更多
In permissioned blockchain networks,the Proof of Authority(PoA)consensus,which uses the election of authorized nodes to validate transactions and blocks,has beenwidely advocated thanks to its high transaction throughp...In permissioned blockchain networks,the Proof of Authority(PoA)consensus,which uses the election of authorized nodes to validate transactions and blocks,has beenwidely advocated thanks to its high transaction throughput and fault tolerance.However,PoA suffers from the drawback of centralization dominated by a limited number of authorized nodes and the lack of anonymity due to the round-robin block proposal mechanism.As a result,traditional PoA is vulnerable to a single point of failure that compromises the security of the blockchain network.To address these issues,we propose a novel decentralized reputation management mechanism for permissioned blockchain networks to enhance security,promote liveness,and mitigate centralization while retaining the same throughput as traditional PoA.This paper aims to design an off-chain reputation evaluation and an on-chain reputation-aided consensus.First,we evaluate the nodes’reputation in the context of the blockchain networks and make the reputation globally verifiable through smart contracts.Second,building upon traditional PoA,we propose a reputation-aided PoA(rPoA)consensus to enhance securitywithout sacrificing throughput.In particular,rPoA can incentivize nodes to autonomously form committees based on reputation authority,which prevents block generation from being tracked through the randomness of reputation variation.Moreover,we develop a reputation-aided fork-choice rule for rPoA to promote the network’s liveness.Finally,experimental results show that the proposed rPoA achieves higher security performance while retaining transaction throughput compared to traditional PoA.展开更多
Recent advancements in decentralized finance(DeFi)have resulted in a rapid increase in the use of Automated Market Makers(AMMs)for creating decentralized exchanges(DEXs).In this paper,we organize these developments by...Recent advancements in decentralized finance(DeFi)have resulted in a rapid increase in the use of Automated Market Makers(AMMs)for creating decentralized exchanges(DEXs).In this paper,we organize these developments by treating an AMM as a neoclassical black-box characterized by the conversion of inputs(tokens)to outputs(prices).The conversion is governed by the technology of the AMM summarized by an‘exchange function’.Various types of AMMs are examined,including:Constant Product Market Makers;Constant Mean Market Makers;Constant Sum Market Makers;Hybrid Function Market Makers;and,Dynamic Automated Market Makers.The paper also looks at the impact of introducing concentrated liquidity in an AMM.Overall,the framework presented here provides an intuitive geometric representation of how an AMM operates,and a clear delineation of the similarities and differences across the various types of AMMs.展开更多
This paper addresses the problem of global practical stabilization of discrete-time switched affine systems via statedependent switching rules.Several attempts have been made to solve this problem via different types ...This paper addresses the problem of global practical stabilization of discrete-time switched affine systems via statedependent switching rules.Several attempts have been made to solve this problem via different types of a common quadratic Lyapunov function and an ellipsoid.These classical results require either the quadratic Lyapunov function or the employed ellipsoid to be of the centralized type.In some cases,the ellipsoids are defined dependently as the level sets of a decentralized Lyapunov function.In this paper,we extend the existing results by the simultaneous use of a general decentralized Lyapunov function and a decentralized ellipsoid parameterized independently.The proposed conditions provide less conservative results than existing works in the sense of the ultimate invariant set of attraction size.Two different approaches are proposed to extract the ultimate invariant set of attraction with a minimum size,i.e.,a purely numerical method and a numerical-analytical one.In the former,both invariant and attractiveness conditions are imposed to extract the final set of matrix inequalities.The latter is established on a principle that the attractiveness of a set implies its invariance.Thus,the stability conditions are derived based on only the attractiveness property as a set of matrix inequalities with a smaller dimension.Illustrative examples are presented to prove the satisfactory operation of the proposed stabilization methods.展开更多
The control method of highly redundant robot manipulators is introduced. A decentralized autonomous control scheme is used to guide the movement of robot manipulators so that the work done by manipulators is minimized...The control method of highly redundant robot manipulators is introduced. A decentralized autonomous control scheme is used to guide the movement of robot manipulators so that the work done by manipulators is minimized. The method of computing pseudoinverse which needs too many complicated calculation can be avoided. Then the calculation and control of robots are simplified. At the same time system robustness/fault tolerance is achieved.展开更多
A new decentralized adaptive control scheme is presented for linear time invariant systems with first order interconnections. The proposed control scheme with “proportional plus integral” terms is used to improve ...A new decentralized adaptive control scheme is presented for linear time invariant systems with first order interconnections. The proposed control scheme with “proportional plus integral” terms is used to improve the convergence rate and the ultimate bound of the tracking error. It is important to note that the adaptive scheme uses lower adaptive gains and smaller control inputs to avoid input saturation and oscillatory behavior. Simulation results are illustrated for controlling a dual inverted pendulum and a multivariable turbofan engine using the proposed adaptive scheme. These simulations validate out conclusions.展开更多
基金supported by the National Research Foundation of Korea(NRF)grants(2022R1A2C4001228,2022M3H4A4097524,2022M3I3A1082499,and 2021M3I3A1084818)the Technology Innovation Program(20026415)of the Ministry of Trade,Industry&Energy(MOTIE,Korea)the supports from Nanopac for fabrication of scaled-up reactor.
文摘Wastewater electrolysis cells(WECs)for decentralized wastewater treatment/reuse coupled with H_(2) production can reduce the carbon footprint associated with transportation of water,waste,and energy carrier.This study reports Ir-doped NiFe_(2)O_(4)(NFI,~5 at%Ir)spinel layer with TiO_(2) overlayer(NFI/TiO_(2)),as a scalable heterojunction anode for direct electrolysis of wastewater with circumneutral pH in a single-compartment cell.In dilute(0.1 M)NaCl solutions,the NFI/TiO_(2) marks superior activity and selectivity for chlorine evolution reaction,outperforming the benchmark IrO_(2).Robust operation in near-neutral pH was confirmed.Electroanalyses including operando X-ray absorption spectroscopy unveiled crucial roles of TiO_(2) which serves both as the primary site for Cl−chemisorption and a protective layer for NFI as an ohmic contact.Galvanostatic electrolysis of NH4+-laden synthetic wastewater demonstrated that NFI/TiO_(2)not only achieves quasi-stoichiometric NH_(4)^(+)-to-N_(2)conversion,but also enhances H_(2)generation efficiency with minimal competing reactions such as reduction of dissolved oxygen and reactive chlorine.The scaled-up WEC with NFI/TiO_(2)was demonstrated for electrolysis of toilet wastewater.
文摘Energy access remains a critical challenge in rural South Sudan,with communities heavily relying on expensive and unfriendly environmental energy sources such as diesel generators and biomass.This study addresses the predicament by evaluating the feasibility of renewable energy-based decentralized electrification in the selected village ofDoleibHill,UpperNile,South Sudan.Using a demand assessment and theMulti-Tier Framework(MTF)approach,it categorizes households,public facilities,private sector,Non-GovernmentalOrganizations(NGOs)and business energy needs and designs an optimized hybrid energy system incorporating solar Photovoltaic(PV),wind turbines,batteries,and a generator.The proposed system,simulated in Hybrid Optimization Model Electric Renewable(HOMER)Pro,demonstrates strong economic viability,with a present worth of$292,145,an annual worth of$22,854,a return on investment(ROI)of 36.5%,and an internal rate of return(IRR)of 42.1%.The simple payback period is 2.31 years,and the discounted payback period is 2.62 years.The system achieves a levelized cost of energy(LCOE)of$0.276/kWh and significantly reduces dependence on diesel,producing 798,800 kWh annually fromwind energy.This research provides a replicable model for cost-effective,sustainable rural electrification,offering valuable insights for policymakers and energy planners seeking to expand electricity access in off-grid communities.
基金supported by InnerMongolia Natural Science Foundation Project(2021LHMS06003)Inner Mongolia University Basic Research Business Fee Project(114).
文摘Federated Graph Learning (FGL) enables model training without requiring each client to share local graph data, effectively breaking data silos by aggregating the training parameters from each terminal while safeguarding data privacy. Traditional FGL relies on a centralized server for model aggregation;however, this central server presents challenges such as a single point of failure and high communication overhead. Additionally, efficiently training a robust personalized local model for each client remains a significant objective in federated graph learning. To address these issues, we propose a decentralized Federated Graph Learning framework with efficient communication, termed Decentralized Federated Graph Learning via Surrogate Model (SD_FGL). In SD_FGL, each client is required to maintain two models: a private model and a surrogate model. The surrogate model is publicly shared and can exchange and update information directly with any client, eliminating the need for a central server and reducing communication overhead. The private model is independently trained by each client, allowing it to calculate similarity with other clients based on local data as well as information shared through the surrogate model. This enables the private model to better adjust its training strategy and selectively update its parameters. Additionally, local differential privacy is incorporated into the surrogate model training process to enhance privacy protection. Testing on three real-world graph datasets demonstrates that the proposed framework improves accuracy while achieving decentralized Federated Graph Learning with lower communication overhead and stronger privacy safeguards.
基金supported by the National Key Research and Development Program of China(2022YFB3305904)the National Natural Science Foundation of China(62133003,61991403,61991400)+4 种基金the Open Project of State Key Laboratory of Synthetical Automation for Process Industries(SAPI-2024-KFKT-05,SAPI-2024-KFKT-08)China Academy of Engineering Institute of Land Cooperation Consulting Project(2023-DFZD-60-02,N2424004)the Fundamental Research Funds for the Central UniversitiesShanghai Municipal Science and Technology Major Project(2021SHZDZX0100)the Key Research and Development Program of Liaoning Province(2023JH26/10200011)
文摘In this paper, we study the decentralized federated learning problem, which involves the collaborative training of a global model among multiple devices while ensuring data privacy.In classical federated learning, the communication channel between the devices poses a potential risk of compromising private information. To reduce the risk of adversary eavesdropping in the communication channel, we propose TRADE(transmit difference weight) concept. This concept replaces the decentralized federated learning algorithm's transmitted weight parameters with differential weight parameters, enhancing the privacy data against eavesdropping. Subsequently, by integrating the TRADE concept with the primal-dual stochastic gradient descent(SGD)algorithm, we propose a decentralized TRADE primal-dual SGD algorithm. We demonstrate that our proposed algorithm's convergence properties are the same as those of the primal-dual SGD algorithm while providing enhanced privacy protection. We validate the algorithm's performance on fault diagnosis task using the Case Western Reserve University dataset, and image classification tasks using the CIFAR-10 and CIFAR-100 datasets,revealing model accuracy comparable to centralized federated learning. Additionally, the experiments confirm the algorithm's privacy protection capability.
基金Fundação de AmparoàPesquisa do Estado da Bahia(FAPESB),Coordenação de Aperfeiçoamento de Pessoal de Nível Superior(CAPES)Conselho Nacional de Desenvolvimento Científico e Tecnológico(CNPq)organizations for supporting the Graduate Program in Computer Science at the Federal University of Bahia.
文摘Intensely using online social networks(OSNs)makes users concerned about privacy of data.Given the centralized nature of these platforms,and since each platform has a particular storage mechanism,authentication,and access control,their users do not have the control and the right over their data.Therefore,users cannot easily switch between similar platforms or transfer data from one platform to another.These issues imply,among other things,a threat to privacy since such users depend on the interests of the service provider responsible for administering OSNs.As a strategy for the decentralization of the OSNs and,consequently,as a solution to the privacy problems in these environments,the so-called decentralized online social networks(DOSNs)have emerged.Unlike OSNs,DOSNs are decentralized content management platforms because they do not use centralized service providers.Although DOSNs address some of the privacy issues encountered in OSNs,DOSNs also pose significant challenges to consider,for example,access control to user profile information with high granularity.This work proposes developing an ontological model and a service to support privacy in DOSNs.The model describes the main concepts of privacy access control in DOSNs and their relationships.In addition,the service will consume the model to apply access control according to the policies represented in the model.Our model was evaluated in two phases to verify its compliance with the proposed domain.Finally,we evaluated our service with a performance evaluation,and the results were satisfactory concerning the response time of access control requests.
基金supported in part by National Key R&D Program of China(Grant No.2021YFB1714100)in part by the National Natural Science Foundation of China(NSFC)under Grant 62371239+5 种基金in part by the the Program of Science and Technology Cooperation of Nanjing with International/Hong Kong,Macao and Taiwan(Grant No.202401019)in part by the Guangdong Basic and Applied Basic Research Foundation(Grant No.2024A1515012407)in part by the the Research Center for FinTech and Digital-Intelligent Management at Shenzhen University,in part by the National Natural Science Foundation of China under Grant 62271192in part by the Equipment Pre-Research Joint Research Program of Ministry of Education under Grant 8091B032129in part by the Major Science and Technology Projects of Longmen Laboratory under Grant 231100220300 and 231100220200in part by the Central Plains Leading Talent in Scientific and Technological Innovation Program under Grant 244200510048.
文摘Traditional Internet of Things(IoT)architectures that rely on centralized servers for data management and decision-making are vulnerable to security threats and privacy leakage.To address this issue,blockchain has been advocated for decentralized data management in a tamper-resistance,traceable,and transparent manner.However,a major issue that hinders the integration of blockchain and IoT lies in that,it is rather challenging for resource-constrained IoT devices to perform computation-intensive blockchain consensuses such as Proof-of-Work(PoW).Furthermore,the incentive mechanism of PoW pushes lightweight IoT nodes to aggregate their computing power to increase the possibility of successful block generation.Nevertheless,this eventually leads to the formation of computing power alliances,and significantly compromises the decentralization and security of BlockChain-aided IoT(BC-IoT)networks.To cope with these issues,we propose a lightweight consensus protocol for BC-IoT,called Proof-of-Trusted-Work(PoTW).The goal of the proposed consensus is to disincentivize the centralization of computing power and encourage the independent participation of lightweight IoT nodes in blockchain consensus.First,we put forth an on-chain reputation evaluation rule and a reputation chain for PoTW to enable the verifiability and traceability of nodes’reputations based on their contributions of computing power to the blockchain consensus,and we incorporate the multi-level block generation difficulty as a rewards for nodes to accumulate reputations.Second,we model the block generation process of PoTW and analyze the block throughput using the continuous time Markov chain.Additionally,we define and optimize the relative throughput gain to quantify and maximize the capability of PoTW that suppresses the computing power centralization(i.e.,centralization suppression).Furthermore,we investigate the impact of the computing power of the computing power alliance and the levels of block generation difficulty on the centralization suppression capability of PoTW.Finally,simulation results demonstrate the consistency of the analytical results in terms of block throughput.In particular,the results show that PoTW effectively reduces the block generation proportion of the computing power alliance compared with PoW,while simultaneously improving that of individual lightweight nodes.This indicates that PoTW is capable of suppressing the centralization of computing power to a certain degree.Moreover,as the levels of block generation difficulty in PoTW increase,its centralization suppression capability strengthens.
基金supported by the National Natural Science Foundation of China(62103411)the Science and Technology Development Fund of Macao SAR(0093/2023/RIA2,0050/2020/A1)。
文摘The attention is a scarce resource in decentralized autonomous organizations(DAOs),as their self-governance relies heavily on the attention-intensive decision-making process of“proposal and voting”.To prevent the negative effects of pro-posers’attention-capturing strategies that contribute to the“tragedy of the commons”and ensure an efficient distribution of attention among multiple proposals,it is necessary to establish a market-driven allocation scheme for DAOs’attention.First,the Harberger tax-based attention markets are designed to facilitate its allocation via continuous and automated trading,where the individualized Harberger tax rate(HTR)determined by the pro-posers’reputation is adopted.Then,the Stackelberg game model is formulated in these markets,casting attention to owners in the role of leaders and other competitive proposers as followers.Its equilibrium trading strategies are also discussed to unravel the intricate dynamics of attention pricing.Moreover,utilizing the single-round Stackelberg game as an illustrative example,the existence of Nash equilibrium trading strategies is demonstrated.Finally,the impact of individualized HTR on trading strategies is investigated,and results suggest that it has a negative correlation with leaders’self-accessed prices and ownership duration,but its effect on their revenues varies under different conditions.This study is expected to provide valuable insights into leveraging attention resources to improve DAOs’governance and decision-making process.
文摘This paper investigates the problem of decentralized multi-robot cooperative localization.This problem involves collaboratively estimating the poses of a group of robots with respect to a common reference coordinate system using robot-to-robot relative measurements and intermittent absolute measurements in a distributed manner.To address this problem,we present a decentralized fusion method that enables batch updating to handle relative measurements from multiple robots simultaneously.This method can improve both the accuracy and computational efficiency of cooperative localization.To reduce communication costs and reliance on connectivity,we do not maintain the inter-robot state correlations.Instead,we adopt a covariance intersection(CI)technique to design an upper bound that replaces unknown joint correlations.We propose an optimization method to determine a tight upper bound for the correlations in the joint update.The consistency and convergence of our proposed algorithm is theoretically analyzed.Furthermore,we conduct Monte Carlo numerical simulations and real-world experiments to demonstrate that the proposed method outperforms existing approaches in terms of both accuracy and consistency.
基金supported in part by the National Natural Science Foundation of China(61933007, U21A2019, 62273005, 62273088, 62303301)the Program of Shanghai Academic/Technology Research Leader of China (20XD1420100)+2 种基金the Hainan Province Science and Technology Special Fund of China(ZDYF2022SHFZ105)the Natural Science Foundation of Anhui Province of China (2108085MA07)the Alexander von Humboldt Foundation of Germany。
文摘This paper investigates the anomaly-resistant decentralized state estimation(SE) problem for a class of wide-area power systems which are divided into several non-overlapping areas connected through transmission lines. Two classes of measurements(i.e., local measurements and edge measurements) are obtained, respectively, from the individual area and the transmission lines. A decentralized state estimator, whose performance is resistant against measurement with anomalies, is designed based on the minimum error entropy with fiducial points(MEEF) criterion. Specifically, 1) An augmented model, which incorporates the local prediction and local measurement, is developed by resorting to the unscented transformation approach and the statistical linearization approach;2) Using the augmented model, an MEEF-based cost function is designed that reflects the local prediction errors of the state and the measurement;and 3) The local estimate is first obtained by minimizing the MEEF-based cost function through a fixed-point iteration and then updated by using the edge measuring information. Finally, simulation experiments with three scenarios are carried out on the IEEE 14-bus system to illustrate the validity of the proposed anomaly-resistant decentralized SE scheme.
文摘Centralized storage and identity identification methods pose many risks,including hacker attacks,data misuse,and single points of failure.Additionally,existing centralized identity management methods face interoperability issues and rely on a single identity provider,leaving users without control over their identities.Therefore,this paper proposes a mechanism for identity identification and data sharing based on decentralized identifiers.The scheme utilizes blockchain technology to store the identifiers and data hashed on the chain to ensure permanent identity recognition and data integrity.Data is stored on InterPlanetary File System(IPFS)to avoid the risk of single points of failure and to enhance data persistence and availability.At the same time,compliance with World Wide Web Consortium(W3C)standards for decentralized identifiers and verifiable credentials increases the mechanism’s scalability and interoperability.
基金supported by the National Natural Science Foundation of China(62273213,62073199,62103241)Natural Science Foundation of Shandong Province for Innovation and Development Joint Funds(ZR2022LZH001)+4 种基金Natural Science Foundation of Shandong Province(ZR2020MF095,ZR2021QF107)Taishan Scholarship Construction Engineeringthe Original Exploratory Program Project of National Natural Science Foundation of China(62250056)Major Basic Research of Natural Science Foundation of Shandong Province(ZR2021ZD14)High-level Talent Team Project of Qingdao West Coast New Area(RCTD-JC-2019-05)。
文摘The paper addresses the decentralized optimal control and stabilization problems for interconnected systems subject to asymmetric information.Compared with previous work,a closed-loop optimal solution to the control problem and sufficient and necessary conditions for the stabilization problem of the interconnected systems are given for the first time.The main challenge lies in three aspects:Firstly,the asymmetric information results in coupling between control and estimation and failure of the separation principle.Secondly,two extra unknown variables are generated by asymmetric information(different information filtration)when solving forward-backward stochastic difference equations.Thirdly,the existence of additive noise makes the study of mean-square boundedness an obstacle.The adopted technique is proving and assuming the linear form of controllers and establishing the equivalence between the two systems with and without additive noise.A dual-motor parallel drive system is presented to demonstrate the validity of the proposed algorithm.
基金Project supported by the National Natural Science Foundation of China(Grant No.62303016)the Research and Development Project of Engineering Research Center of Biofilm Water Purification and Utilization Technology of the Ministry of Education of China(Grant No.BWPU2023ZY02)+1 种基金the University Synergy Innovation Program of Anhui Province,China(Grant No.GXXT-2023-020)the Key Project of Natural Science Research in Universities of Anhui Province,China(Grant No.2024AH050171).
文摘This article investigates the issue of finite-time state estimation in coupled neural networks under random mixed cyberattacks,in which the Markov process is used to model the mixed cyberattacks.To optimize the utilization of channel resources,a decentralized event-triggered mechanism is adopted during the information transmission.By establishing the augmentation system and constructing the Lyapunov function,sufficient conditions are obtained for the system to be finite-time bounded and satisfy the H_(∞ )performance index.Then,under these conditions,a suitable state estimator gain is obtained.Finally,the feasibility of the method is verified by a given illustrative example.
基金supported by the MSIT(Ministry of Science and ICT),Korea,under the Special R&D Zone Development Project(R&D)—Development of R&D Innovation Valley support program(2023-DD-RD-0152)supervised by the Innovation Foundation.It was also partially supported by the Ministry of Science and ICT(MSIT),Korea,under the Information Technology Research Center(ITRC)support program(IITP-2024-2020-0-01797)supervised by the Institute for Information&Communications Technology Planning&Evaluation(IITP).
文摘In Decentralized Machine Learning(DML)systems,system participants contribute their resources to assist others in developing machine learning solutions.Identifying malicious contributions in DML systems is challenging,which has led to the exploration of blockchain technology.Blockchain leverages its transparency and immutability to record the provenance and reliability of training data.However,storing massive datasets or implementing model evaluation processes on smart contracts incurs high computational costs.Additionally,current research on preventing malicious contributions in DML systems primarily focuses on protecting models from being exploited by workers who contribute incorrect or misleading data.However,less attention has been paid to the scenario where malicious requesters intentionally manipulate test data during evaluation to gain an unfair advantage.This paper proposes a transparent and accountable training data sharing method that securely shares data among potentially malicious system participants.First,we introduce a blockchain-based DML system architecture that supports secure training data sharing through the IPFS network.Second,we design a blockchain smart contract to transparently split training datasets into training and test datasets,respectively,without involving system participants.Under the system,transparent and accountable training data sharing can be achieved with attribute-based proxy re-encryption.We demonstrate the security analysis for the system,and conduct experiments on the Ethereum and IPFS platforms to show the feasibility and practicality of the system.
文摘The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy of decentralized SCN algorithms while effectively protecting user privacy. To this end, we propose a decentralized semi-supervised learning algorithm for SCN, called DMT-SCN, which introduces teacher and student models by combining the idea of consistency regularization to improve the response speed of model iterations. In order to reduce the possible negative impact of unsupervised data on the model, we purposely change the way of adding noise to the unlabeled data. Simulation results show that the algorithm can effectively utilize unlabeled data to improve the classification accuracy of SCN training and is robust under different ground simulation environments.
文摘This study proposes a quote-driven predictive automated market maker(AMM)platform with on-chain custody and settlement functions,alongside off-chain predictive reinforcement learning capabilities,to improve the liquidity provision of real-world AMMs.The proposed architecture augments Uniswap V3,a cryptocurrency AMM protocol,by using a novel market equilibrium pricing to reduce divergence and slippage losses.Furthermore,the proposed architecture involves a predictive AMM capability,for which a deep hybrid long short-term memory(LSTM)and Q-learning reinforcement learning framework is used.It seeks to improve market efficiency through obtaining more accurate forecasts of liquidity concentration ranges,where liquidity starts moving to expected concentration ranges prior to asset price movement;thus,liquidity utilization is improved.The augmented protocol framework is expected to have practical real-world implications through(1)reducing divergence loss for liquidity providers;(2)reducing slippage for crypto-asset traders;and(3)improving capital efficiency for liquidity provision for the AMM protocol.The proposed architecture is empirically benchmarked against the well-established Uniswap V3 AMM architecture.The preliminary findings indicate that the novel AMM framework offers enhanced capital efficiency,reduced divergence loss,and diminished slippage,which could potentially address several of the challenges inherent to AMMs.
基金supported by the Shenzhen Science and Technology Program under Grants KCXST20221021111404010,JSGG20220831103400002,JSGGKQTD20221101115655027,JCYJ 20210324094609027the National KeyR&DProgram of China under Grant 2021YFB2700900+1 种基金the National Natural Science Foundation of China under Grants 62371239,62376074,72301083the Jiangsu Specially-Appointed Professor Program 2021.
文摘In permissioned blockchain networks,the Proof of Authority(PoA)consensus,which uses the election of authorized nodes to validate transactions and blocks,has beenwidely advocated thanks to its high transaction throughput and fault tolerance.However,PoA suffers from the drawback of centralization dominated by a limited number of authorized nodes and the lack of anonymity due to the round-robin block proposal mechanism.As a result,traditional PoA is vulnerable to a single point of failure that compromises the security of the blockchain network.To address these issues,we propose a novel decentralized reputation management mechanism for permissioned blockchain networks to enhance security,promote liveness,and mitigate centralization while retaining the same throughput as traditional PoA.This paper aims to design an off-chain reputation evaluation and an on-chain reputation-aided consensus.First,we evaluate the nodes’reputation in the context of the blockchain networks and make the reputation globally verifiable through smart contracts.Second,building upon traditional PoA,we propose a reputation-aided PoA(rPoA)consensus to enhance securitywithout sacrificing throughput.In particular,rPoA can incentivize nodes to autonomously form committees based on reputation authority,which prevents block generation from being tracked through the randomness of reputation variation.Moreover,we develop a reputation-aided fork-choice rule for rPoA to promote the network’s liveness.Finally,experimental results show that the proposed rPoA achieves higher security performance while retaining transaction throughput compared to traditional PoA.
文摘Recent advancements in decentralized finance(DeFi)have resulted in a rapid increase in the use of Automated Market Makers(AMMs)for creating decentralized exchanges(DEXs).In this paper,we organize these developments by treating an AMM as a neoclassical black-box characterized by the conversion of inputs(tokens)to outputs(prices).The conversion is governed by the technology of the AMM summarized by an‘exchange function’.Various types of AMMs are examined,including:Constant Product Market Makers;Constant Mean Market Makers;Constant Sum Market Makers;Hybrid Function Market Makers;and,Dynamic Automated Market Makers.The paper also looks at the impact of introducing concentrated liquidity in an AMM.Overall,the framework presented here provides an intuitive geometric representation of how an AMM operates,and a clear delineation of the similarities and differences across the various types of AMMs.
文摘This paper addresses the problem of global practical stabilization of discrete-time switched affine systems via statedependent switching rules.Several attempts have been made to solve this problem via different types of a common quadratic Lyapunov function and an ellipsoid.These classical results require either the quadratic Lyapunov function or the employed ellipsoid to be of the centralized type.In some cases,the ellipsoids are defined dependently as the level sets of a decentralized Lyapunov function.In this paper,we extend the existing results by the simultaneous use of a general decentralized Lyapunov function and a decentralized ellipsoid parameterized independently.The proposed conditions provide less conservative results than existing works in the sense of the ultimate invariant set of attraction size.Two different approaches are proposed to extract the ultimate invariant set of attraction with a minimum size,i.e.,a purely numerical method and a numerical-analytical one.In the former,both invariant and attractiveness conditions are imposed to extract the final set of matrix inequalities.The latter is established on a principle that the attractiveness of a set implies its invariance.Thus,the stability conditions are derived based on only the attractiveness property as a set of matrix inequalities with a smaller dimension.Illustrative examples are presented to prove the satisfactory operation of the proposed stabilization methods.
文摘The control method of highly redundant robot manipulators is introduced. A decentralized autonomous control scheme is used to guide the movement of robot manipulators so that the work done by manipulators is minimized. The method of computing pseudoinverse which needs too many complicated calculation can be avoided. Then the calculation and control of robots are simplified. At the same time system robustness/fault tolerance is achieved.
文摘A new decentralized adaptive control scheme is presented for linear time invariant systems with first order interconnections. The proposed control scheme with “proportional plus integral” terms is used to improve the convergence rate and the ultimate bound of the tracking error. It is important to note that the adaptive scheme uses lower adaptive gains and smaller control inputs to avoid input saturation and oscillatory behavior. Simulation results are illustrated for controlling a dual inverted pendulum and a multivariable turbofan engine using the proposed adaptive scheme. These simulations validate out conclusions.
