arXiv subjects

Yongqiang Wang

Publications and source records attributed to Yongqiang Wang.

At least 109 records · Page 6Linked to original sources

arXiv2019

Privacy-Preserving Average Consensus via State Decomposition

Average consensus underpins key functionalities of distributed systems ranging from distributed information fusion, decision-making, distributed optimization, to load balancing and decentralized control. Existing distributed average consensus algorithms require each node to exchange and disclose state information to its neighbors, which is undesirable in cases where the state is private or contains sensitive information. In this paper, we propose a novel approach that avoids disclosing individual state information in average consensus by letting each node decompose its state into two sub-states. For each node, one of the two sub-states involves in computation and inter-node interactions as if it were the original state, while the other sub-state interacts only with the first sub-state of the same node, being completely invisible to other nodes. The initial values of the two sub-states are chosen randomly but with their mean fixed to the initial value of the original state, which is key to guarantee convergence to the desired consensus value. In direct contrast to differential-privacy based privacy-preserving average-consensus approaches which enable privacy by compromising accuracy in the consensus value, the proposed approach can guarantee convergence to the \emph{exact} desired value without any error. Not only is the proposed approach able to prevent the disclosure of a node's initial state to honest-but-curious neighbors, it can also provide protection against inference by external eavesdroppers able to wiretap communication links. Numerical simulations demonstrate the effectiveness of the approach and its advantages over state-of-the-art counterparts.

math.OC↗

arXiv2018

Secure and Privacy-Preserving Consensus

Consensus is fundamental for distributed systems since it underpins key functionalities of such systems ranging from distributed information fusion, decision-making, to decentralized control. In order to reach an agreement, existing consensus algorithms require each agent to exchange explicit state information with its neighbors. This leads to the disclosure of private state information, which is undesirable in cases where privacy is of concern. In this paper, we propose a novel approach that enables secure and privacy-preserving average consensus in a decentralized architecture in the absence of an aggregator or third-party. By leveraging partial homomorphic cryptography to embed secrecy in pairwise interaction dynamics, our approach can guarantee consensus to the exact value in a deterministic manner without disclosing a node's state to its neighbors. In addition to enabling resilience to passive attackers aiming to steal state information, the approach also allows easy incorporation of defending mechanisms against active attackers which try to alter the content of exchanged messages. Furthermore, in contrast to existing noise-injection based privacy-preserving mechanisms which have to reconfigure the entire network when the topology or number of nodes varies, our approach is applicable to dynamic environments with time-varying coupling topologies. This secure and privacy-preservation approach is also applicable to weighted average consensus as well as maximum/minimum consensus under a new update rule. The approach is light-weight in computation and communication. Implementation details and numerical examples are provided to demonstrate the capability of our approach.

math.OC↗

arXiv2018

End-to-end contextual speech recognition using class language models and a token passing decoder

End-to-end modeling (E2E) of automatic speech recognition (ASR) blends all the components of a traditional speech recognition system into a unified model. Although it simplifies training and decoding pipelines, the unified model is hard to adapt when mismatch exists between training and test data. In this work, we focus on contextual speech recognition, which is particularly challenging for E2E models because it introduces significant mismatch between training and test data. To improve the performance in the presence of complex contextual information, we propose to use class-based language models(CLM) that can populate the classes with contextdependent information in real-time. To enable this approach to scale to a large number of class members and minimize search errors, we propose a token passing decoder with efficient token recombination for E2E systems for the first time. We evaluate the proposed system on general and contextual ASR, and achieve relative 62% Word Error Rate(WER) reduction for contextual ASR without hurting performance for general ASR. We show that the proposed method performs well without modification of the decoding hyper-parameters across tasks, making it a general solution for E2E ASR.

cs.CL↗

arXiv2018

Dynamics Based Privacy Protection for Average Consensus on Directed Graphs

Average consensus is key for distributed networks, with applications ranging from network synchronization, distributed information fusion, decentralized control, to load balancing for parallel processors. Existing average consensus algorithms require each node to exchange explicit state values with its neighbors, which results in the undesirable disclosure of sensitive state information. In this paper, we propose a novel average consensus approach for directed graphs which can protect the privacy of participating nodes' initial states without the assistance of any trusted third party or data aggregator. By leveraging the inherent robustness of consensus dynamics to embed privacy in random coupling weights between interacting nodes, our proposed approach can guarantee consensus to the exact value without any error. This is in distinct difference from differential-privacy based average consensus approaches which enable privacy through sacrificing accuracy in obtained consensus value. The proposed approach is able to preserve privacy even when multiple honest-but-curious nodes collude with each other. Furthermore, by encrypting exchanged information, the proposed approach can also provide privacy protection against inference by external eavesdroppers wiretapping communication links. Numerical simulations and hardware experiments on Raspberry Pi boards confirm that the algorithm is lightweight in computation and communication.

eess.SY↗

arXiv2018

Privacy-preserving Decentralized Optimization via Decomposition

This paper considers the problem of privacy-preservation in decentralized optimization, in which $N$ agents cooperatively minimize a global objective function that is the sum of $N$ local objective functions. We assume that each local objective function is private and only known to an individual agent. To cooperatively solve the problem, most existing decentralized optimization approaches require participating agents to exchange and disclose estimates to neighboring agents. However, this results in leakage of private information about local objective functions, which is undesirable when adversaries exist and try to steal information from participating agents. To address this issue, we propose a privacy-preserving decentralized optimization approach based on proximal Jacobian ADMM via function decomposition. Numerical simulations confirm the effectiveness of the proposed approach.

math.OC↗

arXiv2018

Distributed Event Localization via Alternating Direction Method of Multipliers

This paper addresses the problem of distributed event localization using noisy range measurements with respect to sensors with known positions. Event localization is fundamental in many wireless sensor network applications such as homeland security, law enforcement, and environmental studies. However, most existing distributed algorithms require the target event to be within the convex hull of the deployed sensors. Based on the alternating direction method of multipliers (ADMM), we propose two scalable distributed algorithms named GS-ADMM and J-ADMM which do not require the target event to be within the convex hull of the deployed sensors. More specifically, the two algorithms can be implemented in a scenario in which the entire sensor network is divided into several clusters with cluster heads collecting measurements within each cluster and exchanging intermediate computation information to achieve localization consistency (consensus) across all clusters. This scenario is important in many applications such as homeland security and law enforcement. Simulation results confirm effectiveness of the proposed algorithms.

cs.DC↗

arXiv2018

ADMM Based Privacy-preserving Decentralized Optimization

Privacy preservation is addressed for decentralized optimization, where $N$ agents cooperatively minimize the sum of $N$ convex functions private to these individual agents. In most existing decentralized optimization approaches, participating agents exchange and disclose states explicitly, which may not be desirable when the states contain sensitive information of individual agents. The problem is more acute when adversaries exist which try to steal information from other participating agents. To address this issue, we propose a privacy-preserving decentralized optimization approach based on ADMM and partially homomorphic cryptography. To our knowledge, this is the first time that cryptographic techniques are incorporated in a fully decentralized setting to enable privacy preservation in decentralized optimization in the absence of any third party or aggregator. To facilitate the incorporation of encryption in a fully decentralized manner, we introduce a new ADMM which allows time-varying penalty matrices and rigorously prove that it has a convergence rate of $O(1/t)$. Numerical and experimental results confirm the effectiveness and low computational complexity of the proposed approach.

math.OC↗

arXiv2018

Towards end-to-end spoken language understanding

Spoken language understanding system is traditionally designed as a pipeline of a number of components. First, the audio signal is processed by an automatic speech recognizer for transcription or n-best hypotheses. With the recognition results, a natural language understanding system classifies the text to structured data as domain, intent and slots for down-streaming consumers, such as dialog system, hands-free applications. These components are usually developed and optimized independently. In this paper, we present our study on an end-to-end learning system for spoken language understanding. With this unified approach, we can infer the semantic meaning directly from audio features without the intermediate text representation. This study showed that the trained model can achieve reasonable good result and demonstrated that the model can capture the semantic attention directly from the audio features.

cs.CL↗

arXiv2017

Secure and Privacy-Preserving Average Consensus

Average consensus is fundamental for distributed systems since it underpins key functionalities of such systems ranging from distributed information fusion, decision-making, to decentralized control. In order to reach an agreement, existing average consensus algorithms require each agent to exchange explicit state information with its neighbors. This leads to the disclosure of private state information, which is undesirable in cases where privacy is of concern. In this paper, we propose a novel approach that enables secure and privacy-preserving average consensus in a decentralized architecture in the absence of any trusted third-parties. By leveraging homomorphic cryptography, our approach can guarantee consensus to the exact value in a deterministic manner. The proposed approach is light-weight in computation and communication, and applicable to time-varying interaction topology cases. A hardware implementation is presented to demonstrate the capability of our approach.

eess.SY↗

arXiv2017

Manipulating Multiple Order Parameters via Oxygen Vacancies: The case of Eu0.5Ba0.5TiO3-δ

Controlling functionalities, such as magnetism or ferroelectricity, by means of oxygen vacancies (VO) is a key issue for the future development of transition metal oxides. Progress in this field is currently addressed through VO variations and their impact on mainly one order parameter. Here we reveal a new mechanism for tuning both magnetism and ferroelectricity simultaneously by using VO. Combined experimental and density-functional theory studies of Eu0.5Ba0.5TiO3-δ, we demonstrate that oxygen vacancies create Ti3+ 3d1 defect states, mediating the ferromagnetic coupling between the localized Eu 4f7 spins, and increase an off-center displacement of Ti ions, enhancing the ferroelectric Curie temperature. The dual function of Ti sites also promises a magnetoelectric coupling in the Eu0.5Ba0.5TiO3-δ.

cond-mat.mtrl-sci↗

arXiv2017

Synchronization with Guaranteed Clock Continuity using Pulse-Coupled Oscillators

Clock synchronization is a widely discussed topic in the engineering literature. Ensuring that individual clocks are closely aligned is important in network systems, since the correct timing of various events in a network is usually necessary for proper system implementation. However, many existing clock synchronization algorithms update clock values abruptly, resulting in discontinuous clocks which have been shown to lead to undesirable behavior. In this paper, we propose using the pulse-coupled oscillator model to guarantee clock continuity, demonstrating two general methods for achieving continuous phase evolution in any pulse-coupled oscillator network. We provide rigorous mathematical proof that the pulse-coupled oscillator algorithm is able to converge to the synchronized state when the phase continuity methods are applied. We provide simulation results supporting these proofs. We further investigate the convergence behavior of other pulse-coupled oscillator synchronization algorithms using the proposed methods.

eess.SY↗

arXiv2016

Analysis and Design of Phase Desynchronization in Pulse-coupled Oscillators

By spreading phases on the unit circle, desynchronization algorithm is a powerful tool to achieve round-robin scheduling, which is crucial in applications as diverse as media access control of communication networks, realization of analog-to-digital converters, and scheduling of traffic flows in intersections. Driven by the increased application of pulse-coupled oscillators in achieving synchronization, desynchronization of pulse-coupled oscillators is also receiving more attention. In this paper, we propose a phase desynchronization algorithm by rigorously analyzing the dynamics of pulse-coupled oscillators and carefully designing the pulse based interaction function. A systematic proof for convergence to phase desynchronization is also given. Different from many existing results which can only achieve equal separation of firing time instants, the proposed approach can achieve equal separation of phases, which is more difficult to achieve due to phase jumps in pulse-coupled oscillators. Furthermore, the new strategy can guarantee achievement of desynchronization even when some nodes have identical initial phases, a situation which fails most existing desynchronization approaches. Numerical simulation results are provided to illustrate the effectiveness of the theoretical results.

eess.SY↗

arXiv2014

Global Synchronization of Pulse-Coupled Oscillators Interacting on Cycle Graphs

The importance of pulse-coupled oscillators (PCOs) in biology and engineering has motivated research to understand basic properties of PCO networks. Despite the large body of work addressing PCOs, a global synchronization result for networks that are more general than all-to-all connected is still unavailable. In this paper we address global synchronization of PCO networks described by cycle graphs. It is shown for the bidirectional cycle case that as the number of oscillators in the cycle grows, the coupling strength must be increased in order to guarantee synchronization for arbitrary initial conditions. For the unidirectional cycle case, the strongest coupling cannot ensure global synchronization yet a refractory period in the phase response curve is sufficient to enable global synchronization. Analytical findings are confirmed by numerical simulations.

eess.SY↗

arXiv2014

Collective oscillation period of inter-coupled biological negative cyclic feedback oscillators

A number of biological rhythms originate from networks comprised of multiple cellular oscillators. But analytical results are still lacking on the collective oscillation period of inter-coupled gene regulatory oscillators, which, as has been reported, may be different from that of an autonomous oscillator. Based on cyclic feedback oscillators, we analyze the collective oscillation pattern of coupled cellular oscillators. First we give a condition under which the oscillator network exhibits oscillatory and synchronized behavior. Then we estimate the collective oscillation period based on a novel multivariable harmonic balance technique. Analytical results are derived in terms of biochemical parameters, thus giving insight into the basic mechanism of biological oscillation and providing guidance in synthetic biology design.

eess.SY↗

arXiv2013

Oxygen-Vacancy-Induced Antiferromagnetism to Ferromagnetism Transformation in Multiferroic Thin Films

Oxygen vacancies (VOs) effects on magnetic ordering in Eu0.5Ba0.5TiO3-δ (EBTO3-δ) thin films have been investigated using a combination of experimental measurements and first-principles density-functional calculations. Two kinds of EBTO3-δthin films with different oxygen deficiency have been fabricated. A nuclear resonance backscattering spectrometry technique has been used to quantitatively measure contents of the VOs. Eu0.5Ba0.5TiO3 ceramics have been known to exhibit ferroelectric (FE) and G-type antiferromagnetic (AFM) properties. While, a ferromagnetic (FM) behavior with a Curie temperature of 1.85 K has been found in the EBTO3-δ thin films. Spin-polarized Ti3+ ions, which originated from the VOs, has been proven to mediate a FM coupling between the local Eu 4f spins and were believed to be responsible for the great change of the magnetic ordering. Our work opens up a new avenue for developing FM-FE materials by manipulating the oxygen deficiency in AFM-FE multiferroics.

cond-mat.mtrl-sci↗

arXiv2012

Exponential synchronization rate of Kuramoto oscillators in the presence of a pacemaker

The exponential synchronization rate is addressed for Kuramoto oscillators in the presence of a pacemaker. When natural frequencies are identical, we prove that synchronization can be ensured even when the phases are not constrained in an open half-circle, which improves the existing results in the literature. We derive a lower bound on the exponential synchronization rate, which is proven to be an increasing function of pacemaker strength, but may be an increasing or decreasing function of local coupling strength. A similar conclusion is obtained for phase locking when the natural frequencies are non-identical. An approach to trapping phase differences in an arbitrary interval is also given, which ensures synchronization in the sense that synchronization error can be reduced to an arbitrary level.

eess.SY↗

arXiv2012

Increasing sync rate of pulse-coupled oscillators via phase response function design: theory and application to wireless networks

This paper addresses the synchronization rate of weakly connected pulse-coupled oscillators (PCOs). We prove that besides coupling strength, the phase response function is also a determinant of synchronization rate. Inspired by the result, we propose to increase the synchronization rate of PCOs by designing the phase response function. This has important significance in PCO-based clock synchronization of wireless networks. By designing the phase response function, synchronization rate is increased even under a fixed transmission power. Given that energy consumption in synchronization is determined by the product of synchronization time and transformation power, the new strategy reduces energy consumption in clock synchronization. QualNet experiments confirm the theoretical results.

eess.SY↗

arXiv2012

The collective oscillation period of inter-coupled Goodwin oscillators

Many biological oscillators are arranged in networks composed of many inter-coupled cellular oscillators. However, results are still lacking on the collective oscillation period of inter-coupled gene regulatory oscillators, which, as has been reported, may be different from the oscillation period of an autonomous cellular oscillator. Based on the Goodwin oscillator, we analyze the collective oscillation pattern of coupled cellular oscillator networks. First we give a condition under which the oscillator network exhibits oscillatory and synchronized behavior, then we estimate the collective oscillation period based on a multivariable harmonic balance technique. Analytical results are derived in terms of biochemical parameters, thus giving insight into the basic mechanism of biological oscillation and providing guidance in synthetic biology design. Simulation results are given to confirm the theoretical predictions.

eess.SY↗